struct {
reg_trie_accepted *accept_buff;
- U32 accepted; /* how many accepting states we have seen */
+ U32 accepted; /* how many accepting states we have seen */
+ regnode *B; /* node following the trie */
+ regnode *me; /* only needed for debugging */
} trie;
struct {
struct {
I32 paren;
- CHECKPOINT lastcp;
+ CHECKPOINT cp;
I32 c1, c2; /* case fold search */
- char *e;
- char *old;
+ char *maxpos; /* highest possible point in string to match */
+ char *oldloc; /* the previous locinput */
int count;
- } plus; /* and CURLYN/CURLY/STAR */
+ int min, max; /* {m,n} */
+ regnode *A, *B; /* the nodes corresponding to /A*B/ */
+ } curly; /* and CURLYN/PLUS/STAR */
struct {
/* this first element must match u.yes */