76 lines
1.7 KiB
C
76 lines
1.7 KiB
C
/*
|
|
* This file is part of the UCB release of Plan 9. It is subject to the license
|
|
* terms in the LICENSE file found in the top-level directory of this
|
|
* distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
|
|
* part of the UCB release of Plan 9, including this file, may be copied,
|
|
* modified, propagated, or distributed except according to the terms contained
|
|
* in the LICENSE file.
|
|
*/
|
|
|
|
#pragma src "/sys/src/lib/regexp"
|
|
#pragma lib "libregexp.a"
|
|
|
|
typedef struct Resub Resub;
|
|
typedef struct Reclass Reclass;
|
|
typedef struct Reinst Reinst;
|
|
typedef struct Reprog Reprog;
|
|
|
|
/*
|
|
* Sub expression matches
|
|
*/
|
|
struct Resub{
|
|
union
|
|
{
|
|
char *sp;
|
|
Rune *rsp;
|
|
};
|
|
union
|
|
{
|
|
char *ep;
|
|
Rune *rep;
|
|
};
|
|
};
|
|
|
|
/*
|
|
* character class, each pair of rune's defines a range
|
|
*/
|
|
struct Reclass{
|
|
Rune *end;
|
|
Rune spans[64];
|
|
};
|
|
|
|
/*
|
|
* Machine instructions
|
|
*/
|
|
struct Reinst{
|
|
int type;
|
|
union {
|
|
Reclass *cp; /* class pointer */
|
|
Rune r; /* character */
|
|
int subid; /* sub-expression id for RBRA and LBRA */
|
|
Reinst *right; /* right child of OR */
|
|
};
|
|
union { /* regexp relies on these two being in the same union */
|
|
Reinst *left; /* left child of OR */
|
|
Reinst *next; /* next instruction for CAT & LBRA */
|
|
};
|
|
};
|
|
|
|
/*
|
|
* Reprogram definition
|
|
*/
|
|
struct Reprog{
|
|
Reinst *startinst; /* start pc */
|
|
Reclass class[16]; /* .data */
|
|
Reinst firstinst[5]; /* .text */
|
|
};
|
|
|
|
extern Reprog *regcomp(char*);
|
|
extern Reprog *regcomplit(char*);
|
|
extern Reprog *regcompnl(char*);
|
|
extern void regerror(char*);
|
|
extern int regexec(Reprog*, char*, Resub*, int);
|
|
extern void regsub(char*, char*, int, Resub*, int);
|
|
extern int rregexec(Reprog*, Rune*, Resub*, int);
|
|
extern void rregsub(Rune*, Rune*, int, Resub*, int);
|