Defines |
#define | states1 long /* for later use in llvm_regexec() decision */ |
#define | states states1 |
#define | CLEAR(v) ((v) = 0) |
#define | SET0(v, n) ((v) &= ~((unsigned long)1 << (n))) |
#define | SET1(v, n) ((v) |= (unsigned long)1 << (n)) |
#define | ISSET(v, n) (((v) & ((unsigned long)1 << (n))) != 0) |
#define | ASSIGN(d, s) ((d) = (s)) |
#define | EQ(a, b) ((a) == (b)) |
#define | STATEVARS long dummy /* dummy version */ |
#define | STATESETUP(m, n) /* nothing */ |
#define | STATETEARDOWN(m) /* nothing */ |
#define | SETUP(v) ((v) = 0) |
#define | onestate long |
#define | INIT(o, n) ((o) = (unsigned long)1 << (n)) |
#define | INC(o) ((o) = (unsigned long)(o) << 1) |
#define | ISSTATEIN(v, o) (((v) & (o)) != 0) |
#define | FWD(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) << (n)) |
#define | BACK(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) >> (n)) |
#define | ISSETBACK(v, n) (((v) & ((unsigned long)here >> (n))) != 0) |
#define | SNAMES /* engine.inc looks after details */ |
#define | states char * |
#define | CLEAR(v) memset(v, 0, m->g->nstates) |
#define | SET0(v, n) ((v)[n] = 0) |
#define | SET1(v, n) ((v)[n] = 1) |
#define | ISSET(v, n) ((v)[n]) |
#define | ASSIGN(d, s) memmove(d, s, m->g->nstates) |
#define | EQ(a, b) (memcmp(a, b, m->g->nstates) == 0) |
#define | STATEVARS long vn; char *space |
#define | STATESETUP(m, nv) |
#define | STATETEARDOWN(m) { free((m)->space); } |
#define | SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates]) |
#define | onestate long |
#define | INIT(o, n) ((o) = (n)) |
#define | INC(o) ((o)++) |
#define | ISSTATEIN(v, o) ((v)[o]) |
#define | FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here]) |
#define | BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here]) |
#define | ISSETBACK(v, n) ((v)[here - (n)]) |
#define | LNAMES /* flag */ |
#define | GOODFLAGS(f) ((f)&(REG_NOTBOL|REG_NOTEOL|REG_STARTEND)) |
Functions |
int | llvm_regexec (const llvm_regex_t *preg, const char *string, size_t nmatch, llvm_regmatch_t pmatch[], int eflags) |