2 * re_*comp and friends - compile REs
3 * This file #includes several others (see the bottom).
5 * Copyright (c) 1998, 1999 Henry Spencer. All rights reserved.
7 * Development of this software was funded, in part, by Cray Research Inc.,
8 * UUNET Communications Services Inc., Sun Microsystems Inc., and Scriptics
9 * Corporation, none of whom are responsible for the results. The author
12 * Redistribution and use in source and binary forms -- with or without
13 * modification -- are permitted for any purpose, provided that
14 * redistributions in source form retain this entire copyright notice and
15 * indicate the origin and nature of any modifications.
17 * I'd appreciate being given credit for this package in the documentation
18 * of software which uses it, but that is not a requirement.
20 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
21 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
22 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
23 * HENRY SPENCER BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 * src/backend/regex/regcomp.c
35 #include "regex/regguts.h"
38 * forward declarations, up here so forward datatypes etc. are defined early
40 /* === regcomp.c === */
41 static void moresubs(struct vars *, int);
42 static int freev(struct vars *, int);
43 static void makesearch(struct vars *, struct nfa *);
44 static struct subre *parse(struct vars *, int, int, struct state *, struct state *);
45 static struct subre *parsebranch(struct vars *, int, int, struct state *, struct state *, int);
46 static void parseqatom(struct vars *, int, int, struct state *, struct state *, struct subre *);
47 static void nonword(struct vars *, int, struct state *, struct state *);
48 static void word(struct vars *, int, struct state *, struct state *);
49 static int scannum(struct vars *);
50 static void repeat(struct vars *, struct state *, struct state *, int, int);
51 static void bracket(struct vars *, struct state *, struct state *);
52 static void cbracket(struct vars *, struct state *, struct state *);
53 static void brackpart(struct vars *, struct state *, struct state *);
54 static const chr *scanplain(struct vars *);
55 static void onechr(struct vars *, chr, struct state *, struct state *);
56 static void wordchrs(struct vars *);
57 static void processlacon(struct vars *, struct state *, struct state *, int,
58 struct state *, struct state *);
59 static struct subre *subre(struct vars *, int, int, struct state *, struct state *);
60 static void freesubre(struct vars *, struct subre *);
61 static void freesrnode(struct vars *, struct subre *);
62 static void optst(struct vars *, struct subre *);
63 static int numst(struct subre *, int);
64 static void markst(struct subre *);
65 static void cleanst(struct vars *);
66 static long nfatree(struct vars *, struct subre *, FILE *);
67 static long nfanode(struct vars *, struct subre *, int, FILE *);
68 static int newlacon(struct vars *, struct state *, struct state *, int);
69 static void freelacons(struct subre *, int);
70 static void rfree(regex_t *);
71 static int rcancelrequested(void);
72 static int rstacktoodeep(void);
75 static void dump(regex_t *, FILE *);
76 static void dumpst(struct subre *, FILE *, int);
77 static void stdump(struct subre *, FILE *, int);
78 static const char *stid(struct subre *, char *, size_t);
80 /* === regc_lex.c === */
81 static void lexstart(struct vars *);
82 static void prefixes(struct vars *);
83 static void lexnest(struct vars *, const chr *, const chr *);
84 static void lexword(struct vars *);
85 static int next(struct vars *);
86 static int lexescape(struct vars *);
87 static chr lexdigits(struct vars *, int, int, int);
88 static int brenext(struct vars *, chr);
89 static void skip(struct vars *);
90 static chr newline(void);
91 static chr chrnamed(struct vars *, const chr *, const chr *, chr);
93 /* === regc_color.c === */
94 static void initcm(struct vars *, struct colormap *);
95 static void freecm(struct colormap *);
96 static color maxcolor(struct colormap *);
97 static color newcolor(struct colormap *);
98 static void freecolor(struct colormap *, color);
99 static color pseudocolor(struct colormap *);
100 static color subcolor(struct colormap *, chr);
101 static color subcolorhi(struct colormap *, color *);
102 static color newsub(struct colormap *, color);
103 static int newhicolorrow(struct colormap *, int);
104 static void newhicolorcols(struct colormap *);
105 static void subcolorcvec(struct vars *, struct cvec *, struct state *, struct state *);
106 static void subcoloronechr(struct vars *, chr, struct state *, struct state *, color *);
107 static void subcoloronerange(struct vars *, chr, chr, struct state *, struct state *, color *);
108 static void subcoloronerow(struct vars *, int, struct state *, struct state *, color *);
109 static void okcolors(struct nfa *, struct colormap *);
110 static void colorchain(struct colormap *, struct arc *);
111 static void uncolorchain(struct colormap *, struct arc *);
112 static void rainbow(struct nfa *, struct colormap *, int, color, struct state *, struct state *);
113 static void colorcomplement(struct nfa *, struct colormap *, int, struct state *, struct state *, struct state *);
116 static void dumpcolors(struct colormap *, FILE *);
117 static void dumpchr(chr, FILE *);
119 /* === regc_nfa.c === */
120 static struct nfa *newnfa(struct vars *, struct colormap *, struct nfa *);
121 static void freenfa(struct nfa *);
122 static struct state *newstate(struct nfa *);
123 static struct state *newfstate(struct nfa *, int flag);
124 static void dropstate(struct nfa *, struct state *);
125 static void freestate(struct nfa *, struct state *);
126 static void destroystate(struct nfa *, struct state *);
127 static void newarc(struct nfa *, int, color, struct state *, struct state *);
128 static void createarc(struct nfa *, int, color, struct state *, struct state *);
129 static struct arc *allocarc(struct nfa *, struct state *);
130 static void freearc(struct nfa *, struct arc *);
131 static void changearctarget(struct arc *, struct state *);
132 static int hasnonemptyout(struct state *);
133 static struct arc *findarc(struct state *, int, color);
134 static void cparc(struct nfa *, struct arc *, struct state *, struct state *);
135 static void sortins(struct nfa *, struct state *);
136 static int sortins_cmp(const void *, const void *);
137 static void sortouts(struct nfa *, struct state *);
138 static int sortouts_cmp(const void *, const void *);
139 static void moveins(struct nfa *, struct state *, struct state *);
140 static void copyins(struct nfa *, struct state *, struct state *);
141 static void mergeins(struct nfa *, struct state *, struct arc **, int);
142 static void moveouts(struct nfa *, struct state *, struct state *);
143 static void copyouts(struct nfa *, struct state *, struct state *);
144 static void cloneouts(struct nfa *, struct state *, struct state *, struct state *, int);
145 static void delsub(struct nfa *, struct state *, struct state *);
146 static void deltraverse(struct nfa *, struct state *, struct state *);
147 static void dupnfa(struct nfa *, struct state *, struct state *, struct state *, struct state *);
148 static void duptraverse(struct nfa *, struct state *, struct state *);
149 static void cleartraverse(struct nfa *, struct state *);
150 static struct state *single_color_transition(struct state *, struct state *);
151 static void specialcolors(struct nfa *);
152 static long optimize(struct nfa *, FILE *);
153 static void pullback(struct nfa *, FILE *);
154 static int pull(struct nfa *, struct arc *, struct state **);
155 static void pushfwd(struct nfa *, FILE *);
156 static int push(struct nfa *, struct arc *, struct state **);
158 #define INCOMPATIBLE 1 /* destroys arc */
159 #define SATISFIED 2 /* constraint satisfied */
160 #define COMPATIBLE 3 /* compatible but not satisfied yet */
161 static int combine(struct arc *, struct arc *);
162 static void fixempties(struct nfa *, FILE *);
163 static struct state *emptyreachable(struct nfa *, struct state *,
164 struct state *, struct arc **);
165 static int isconstraintarc(struct arc *);
166 static int hasconstraintout(struct state *);
167 static void fixconstraintloops(struct nfa *, FILE *);
168 static int findconstraintloop(struct nfa *, struct state *);
169 static void breakconstraintloop(struct nfa *, struct state *);
170 static void clonesuccessorstates(struct nfa *, struct state *, struct state *,
171 struct state *, struct arc *,
172 char *, char *, int);
173 static void cleanup(struct nfa *);
174 static void markreachable(struct nfa *, struct state *, struct state *, struct state *);
175 static void markcanreach(struct nfa *, struct state *, struct state *, struct state *);
176 static long analyze(struct nfa *);
177 static void compact(struct nfa *, struct cnfa *);
178 static void carcsort(struct carc *, size_t);
179 static int carc_cmp(const void *, const void *);
180 static void freecnfa(struct cnfa *);
181 static void dumpnfa(struct nfa *, FILE *);
184 static void dumpstate(struct state *, FILE *);
185 static void dumparcs(struct state *, FILE *);
186 static void dumparc(struct arc *, struct state *, FILE *);
187 static void dumpcnfa(struct cnfa *, FILE *);
188 static void dumpcstate(int, struct cnfa *, FILE *);
190 /* === regc_cvec.c === */
191 static struct cvec *newcvec(int, int);
192 static struct cvec *clearcvec(struct cvec *);
193 static void addchr(struct cvec *, chr);
194 static void addrange(struct cvec *, chr, chr);
195 static struct cvec *getcvec(struct vars *, int, int);
196 static void freecvec(struct cvec *);
198 /* === regc_pg_locale.c === */
199 static int pg_wc_isdigit(pg_wchar c);
200 static int pg_wc_isalpha(pg_wchar c);
201 static int pg_wc_isalnum(pg_wchar c);
202 static int pg_wc_isupper(pg_wchar c);
203 static int pg_wc_islower(pg_wchar c);
204 static int pg_wc_isgraph(pg_wchar c);
205 static int pg_wc_isprint(pg_wchar c);
206 static int pg_wc_ispunct(pg_wchar c);
207 static int pg_wc_isspace(pg_wchar c);
208 static pg_wchar pg_wc_toupper(pg_wchar c);
209 static pg_wchar pg_wc_tolower(pg_wchar c);
211 /* === regc_locale.c === */
212 static chr element(struct vars *, const chr *, const chr *);
213 static struct cvec *range(struct vars *, chr, chr, int);
214 static int before(chr, chr);
215 static struct cvec *eclass(struct vars *, chr, int);
216 static struct cvec *cclass(struct vars *, const chr *, const chr *, int);
217 static int cclass_column_index(struct colormap *, chr);
218 static struct cvec *allcases(struct vars *, chr);
219 static int cmp(const chr *, const chr *, size_t);
220 static int casecmp(const chr *, const chr *, size_t);
223 /* internal variables, bundled for easy passing around */
227 const chr *now; /* scan pointer into string */
228 const chr *stop; /* end of string */
229 const chr *savenow; /* saved now and stop for "subroutine call" */
231 int err; /* error code (0 if none) */
232 int cflags; /* copy of compile flags */
233 int lasttype; /* type of previous token */
234 int nexttype; /* type of next token */
235 chr nextvalue; /* value (if any) of next token */
236 int lexcon; /* lexical context type (see lex.c) */
237 int nsubexp; /* subexpression count */
238 struct subre **subs; /* subRE pointer vector */
239 size_t nsubs; /* length of vector */
240 struct subre *sub10[10]; /* initial vector, enough for most */
241 struct nfa *nfa; /* the NFA */
242 struct colormap *cm; /* character color map */
243 color nlcolor; /* color of newline */
244 struct state *wordchrs; /* state in nfa holding word-char outarcs */
245 struct subre *tree; /* subexpression tree */
246 struct subre *treechain; /* all tree nodes allocated */
247 struct subre *treefree; /* any free tree nodes */
248 int ntree; /* number of tree nodes, plus one */
249 struct cvec *cv; /* interface cvec */
250 struct cvec *cv2; /* utility cvec */
251 struct subre *lacons; /* lookaround-constraint vector */
252 int nlacons; /* size of lacons[]; note that only slots
253 * numbered 1 .. nlacons-1 are used */
254 size_t spaceused; /* approx. space used for compilation */
257 /* parsing macros; most know that `v' is the struct vars pointer */
258 #define NEXT() (next(v)) /* advance by one token */
259 #define SEE(t) (v->nexttype == (t)) /* is next token this? */
260 #define EAT(t) (SEE(t) && next(v)) /* if next is this, swallow it */
261 #define VISERR(vv) ((vv)->err != 0) /* have we seen an error yet? */
262 #define ISERR() VISERR(v)
263 #define VERR(vv,e) ((vv)->nexttype = EOS, \
264 (vv)->err = ((vv)->err ? (vv)->err : (e)))
265 #define ERR(e) VERR(v, e) /* record an error */
266 #define NOERR() {if (ISERR()) return;} /* if error seen, return */
267 #define NOERRN() {if (ISERR()) return NULL;} /* NOERR with retval */
268 #define NOERRZ() {if (ISERR()) return 0;} /* NOERR with retval */
269 #define INSIST(c, e) do { if (!(c)) ERR(e); } while (0) /* error if c false */
270 #define NOTE(b) (v->re->re_info |= (b)) /* note visible condition */
271 #define EMPTYARC(x, y) newarc(v->nfa, EMPTY, 0, x, y)
273 /* token type codes, some also used as NFA arc types */
274 #define EMPTY 'n' /* no token present */
275 #define EOS 'e' /* end of string */
276 #define PLAIN 'p' /* ordinary character */
277 #define DIGIT 'd' /* digit (in bound) */
278 #define BACKREF 'b' /* back reference */
279 #define COLLEL 'I' /* start of [. */
280 #define ECLASS 'E' /* start of [= */
281 #define CCLASS 'C' /* start of [: */
282 #define END 'X' /* end of [. [= [: */
283 #define RANGE 'R' /* - within [] which might be range delim. */
284 #define LACON 'L' /* lookaround constraint subRE */
285 #define AHEAD 'a' /* color-lookahead arc */
286 #define BEHIND 'r' /* color-lookbehind arc */
287 #define WBDRY 'w' /* word boundary constraint */
288 #define NWBDRY 'W' /* non-word-boundary constraint */
289 #define SBEGIN 'A' /* beginning of string (even if not BOL) */
290 #define SEND 'Z' /* end of string (even if not EOL) */
291 #define PREFER 'P' /* length preference */
293 /* is an arc colored, and hence on a color chain? */
295 ((a)->type == PLAIN || (a)->type == AHEAD || (a)->type == BEHIND)
298 /* static function list */
299 static const struct fns functions = {
300 rfree, /* regfree insides */
301 rcancelrequested, /* check for cancel request */
302 rstacktoodeep /* check for stack getting dangerously deep */
308 * pg_regcomp - compile regular expression
310 * Note: on failure, no resources remain allocated, so pg_regfree()
311 * need not be applied to re.
314 pg_regcomp(regex_t *re,
321 struct vars *v = &var;
327 FILE *debug = (flags & REG_PROGRESS) ? stdout : (FILE *) NULL;
329 FILE *debug = (FILE *) NULL;
332 #define CNOERR() { if (ISERR()) return freev(v, v->err); }
336 if (re == NULL || string == NULL)
338 if ((flags & REG_QUOTE) &&
339 (flags & (REG_ADVANCED | REG_EXPANDED | REG_NEWLINE)))
341 if (!(flags & REG_EXTENDED) && (flags & REG_ADVF))
344 /* Initialize locale-dependent support */
345 pg_set_regex_collation(collation);
347 /* initial setup (after which freev() is callable) */
350 v->stop = v->now + len;
351 v->savenow = v->savestop = NULL;
357 for (j = 0; j < v->nsubs; j++)
361 v->nlcolor = COLORLESS;
371 re->re_magic = REMAGIC;
372 re->re_info = 0; /* bits get set during parse */
373 re->re_csize = sizeof(chr);
374 re->re_collation = collation;
376 re->re_fns = VS(&functions);
378 /* more complex setup, malloced things */
379 re->re_guts = VS(MALLOC(sizeof(struct guts)));
380 if (re->re_guts == NULL)
381 return freev(v, REG_ESPACE);
382 g = (struct guts *) re->re_guts;
389 v->nfa = newnfa(v, v->cm, (struct nfa *) NULL);
391 /* set up a reasonably-sized transient cvec for getcvec usage */
392 v->cv = newcvec(100, 20);
394 return freev(v, REG_ESPACE);
397 lexstart(v); /* also handles prefixes */
398 if ((v->cflags & REG_NLSTOP) || (v->cflags & REG_NLANCH))
400 /* assign newline a unique color */
401 v->nlcolor = subcolor(v->cm, newline());
402 okcolors(v->nfa, v->cm);
405 v->tree = parse(v, EOS, PLAIN, v->nfa->init, v->nfa->final);
406 assert(SEE(EOS)); /* even if error; ISERR() => SEE(EOS) */
408 assert(v->tree != NULL);
410 /* finish setup of nfa and its subre tree */
411 specialcolors(v->nfa);
416 fprintf(debug, "\n\n\n========= RAW ==========\n");
417 dumpnfa(v->nfa, debug);
418 dumpst(v->tree, debug, 1);
422 v->ntree = numst(v->tree, 1);
428 fprintf(debug, "\n\n\n========= TREE FIXED ==========\n");
429 dumpst(v->tree, debug, 1);
433 /* build compacted NFAs for tree and lacons */
434 re->re_info |= nfatree(v, v->tree, debug);
436 assert(v->nlacons == 0 || v->lacons != NULL);
437 for (i = 1; i < v->nlacons; i++)
439 struct subre *lasub = &v->lacons[i];
443 fprintf(debug, "\n\n\n========= LA%d ==========\n", i);
446 /* Prepend .* to pattern if it's a lookbehind LACON */
447 nfanode(v, lasub, !LATYPE_IS_AHEAD(lasub->subno), debug);
450 if (v->tree->flags & SHORTER)
453 /* build compacted NFAs for tree, lacons, fast search */
456 fprintf(debug, "\n\n\n========= SEARCH ==========\n");
458 /* can sacrifice main NFA now, so use it as work area */
459 (DISCARD) optimize(v->nfa, debug);
461 makesearch(v, v->nfa);
463 compact(v->nfa, &g->search);
466 /* looks okay, package it up */
467 re->re_nsub = v->nsubexp;
468 v->re = NULL; /* freev no longer frees re */
469 g->magic = GUTSMAGIC;
470 g->cflags = v->cflags;
471 g->info = re->re_info;
472 g->nsub = re->re_nsub;
476 g->compare = (v->cflags & REG_ICASE) ? casecmp : cmp;
477 g->lacons = v->lacons;
479 g->nlacons = v->nlacons;
482 if (flags & REG_DUMP)
491 * moresubs - enlarge subRE vector
494 moresubs(struct vars *v,
495 int wanted) /* want enough room for this one */
500 assert(wanted > 0 && (size_t) wanted >= v->nsubs);
501 n = (size_t) wanted * 3 / 2 + 1;
503 if (v->subs == v->sub10)
505 p = (struct subre **) MALLOC(n * sizeof(struct subre *));
507 memcpy(VS(p), VS(v->subs),
508 v->nsubs * sizeof(struct subre *));
511 p = (struct subre **) REALLOC(v->subs, n * sizeof(struct subre *));
518 for (p = &v->subs[v->nsubs]; v->nsubs < n; p++, v->nsubs++)
520 assert(v->nsubs == n);
521 assert((size_t) wanted < v->nsubs);
525 * freev - free vars struct's substructures where necessary
527 * Optionally does error-number setting, and always returns error code
528 * (if any), to make error-handling code terser.
531 freev(struct vars *v,
536 if (v->subs != v->sub10)
541 freesubre(v, v->tree);
542 if (v->treechain != NULL)
548 if (v->lacons != NULL)
549 freelacons(v->lacons, v->nlacons);
550 ERR(err); /* nop if err==0 */
556 * makesearch - turn an NFA into a search NFA (implicit prepend of .*?)
557 * NFA must have been optimize()d already.
560 makesearch(struct vars *v,
565 struct state *pre = nfa->pre;
570 /* no loops are needed if it's anchored */
571 for (a = pre->outs; a != NULL; a = a->outchain)
573 assert(a->type == PLAIN);
574 if (a->co != nfa->bos[0] && a->co != nfa->bos[1])
579 /* add implicit .* in front */
580 rainbow(nfa, v->cm, PLAIN, COLORLESS, pre, pre);
582 /* and ^* and \A* too -- not always necessary, but harmless */
583 newarc(nfa, PLAIN, nfa->bos[0], pre, pre);
584 newarc(nfa, PLAIN, nfa->bos[1], pre, pre);
588 * Now here's the subtle part. Because many REs have no lookback
589 * constraints, often knowing when you were in the pre state tells you
590 * little; it's the next state(s) that are informative. But some of them
591 * may have other inarcs, i.e. it may be possible to make actual progress
592 * and then return to one of them. We must de-optimize such cases,
593 * splitting each such state into progress and no-progress states.
596 /* first, make a list of the states reachable from pre and elsewhere */
598 for (a = pre->outs; a != NULL; a = a->outchain)
601 for (b = s->ins; b != NULL; b = b->inchain)
608 * We want to mark states as being in the list already by having non
609 * NULL tmp fields, but we can't just store the old slist value in tmp
610 * because that doesn't work for the first such state. Instead, the
611 * first list entry gets its own address in tmp.
613 if (b != NULL && s->tmp == NULL)
615 s->tmp = (slist != NULL) ? slist : s;
621 for (s = slist; s != NULL; s = s2)
625 copyouts(nfa, s, s2);
627 for (a = s->ins; a != NULL; a = b)
632 cparc(nfa, a, a->from, s2);
636 s2 = (s->tmp != s) ? s->tmp : NULL;
637 s->tmp = NULL; /* clean up while we're at it */
642 * parse - parse an RE
644 * This is actually just the top level, which parses a bunch of branches
645 * tied together with '|'. They appear in the tree as the left children
646 * of a chain of '|' subres.
648 static struct subre *
649 parse(struct vars *v,
650 int stopper, /* EOS or ')' */
651 int type, /* LACON (lookaround subRE) or PLAIN */
652 struct state *init, /* initial state */
653 struct state *final) /* final state */
655 struct state *left; /* scaffolding for branch */
657 struct subre *branches; /* top level */
658 struct subre *branch; /* current branch */
659 struct subre *t; /* temporary */
660 int firstbranch; /* is this the first branch? */
662 assert(stopper == ')' || stopper == EOS);
664 branches = subre(v, '|', LONGER, init, final);
672 /* need a place to hang it */
673 branch->right = subre(v, '|', LONGER, init, final);
675 branch = branch->right;
678 left = newstate(v->nfa);
679 right = newstate(v->nfa);
681 EMPTYARC(init, left);
682 EMPTYARC(right, final);
684 branch->left = parsebranch(v, stopper, type, left, right, 0);
686 branch->flags |= UP(branch->flags | branch->left->flags);
687 if ((branch->flags & ~branches->flags) != 0) /* new flags */
688 for (t = branches; t != branch; t = t->right)
689 t->flags |= branch->flags;
691 assert(SEE(stopper) || SEE(EOS));
695 assert(stopper == ')' && SEE(EOS));
699 /* optimize out simple cases */
700 if (branch == branches)
701 { /* only one branch */
702 assert(branch->right == NULL);
705 freesubre(v, branches);
708 else if (!MESSY(branches->flags))
709 { /* no interesting innards */
710 freesubre(v, branches->left);
711 branches->left = NULL;
712 freesubre(v, branches->right);
713 branches->right = NULL;
721 * parsebranch - parse one branch of an RE
723 * This mostly manages concatenation, working closely with parseqatom().
724 * Concatenated things are bundled up as much as possible, with separate
725 * ',' nodes introduced only when necessary due to substructure.
727 static struct subre *
728 parsebranch(struct vars *v,
729 int stopper, /* EOS or ')' */
730 int type, /* LACON (lookaround subRE) or PLAIN */
731 struct state *left, /* leftmost state */
732 struct state *right, /* rightmost state */
733 int partial) /* is this only part of a branch? */
735 struct state *lp; /* left end of current construct */
736 int seencontent; /* is there anything in this branch yet? */
741 t = subre(v, '=', 0, left, right); /* op '=' is tentative */
743 while (!SEE('|') && !SEE(stopper) && !SEE(EOS))
746 { /* implicit concat operator */
747 lp = newstate(v->nfa);
749 moveins(v->nfa, right, lp);
753 /* NB, recursion in parseqatom() may swallow rest of branch */
754 parseqatom(v, stopper, type, lp, right, t);
763 EMPTYARC(left, right);
770 * parseqatom - parse one quantified atom or constraint of an RE
772 * The bookkeeping near the end cooperates very closely with parsebranch();
773 * in particular, it contains a recursion that can involve parsing the rest
774 * of the branch, making this function's name somewhat inaccurate.
777 parseqatom(struct vars *v,
778 int stopper, /* EOS or ')' */
779 int type, /* LACON (lookaround subRE) or PLAIN */
780 struct state *lp, /* left state to hang it on */
781 struct state *rp, /* right state to hang it on */
782 struct subre *top) /* subtree top */
784 struct state *s; /* temporaries for new states */
787 #define ARCV(t, val) newarc(v->nfa, t, val, lp, rp)
790 struct subre *atom; /* atom's subtree */
792 int cap; /* capturing parens? */
793 int latype; /* lookaround constraint type */
794 int subno; /* capturing-parens or backref number */
796 int qprefer; /* quantifier short/long preference */
798 struct subre **atomp; /* where the pointer to atom is */
800 /* initial bookkeeping */
802 assert(lp->nouts == 0); /* must string new code */
803 assert(rp->nins == 0); /* between lp and rp */
804 subno = 0; /* just to shut lint up */
806 /* an atom or constraint... */
807 atomtype = v->nexttype;
810 /* first, constraints, which end by returning */
813 if (v->cflags & REG_NLANCH)
814 ARCV(BEHIND, v->nlcolor);
820 if (v->cflags & REG_NLANCH)
821 ARCV(AHEAD, v->nlcolor);
826 ARCV('^', 1); /* BOL */
827 ARCV('^', 0); /* or BOS */
832 ARCV('$', 1); /* EOL */
833 ARCV('$', 0); /* or EOS */
838 wordchrs(v); /* does NEXT() */
839 s = newstate(v->nfa);
841 nonword(v, BEHIND, lp, s);
842 word(v, AHEAD, s, rp);
846 wordchrs(v); /* does NEXT() */
847 s = newstate(v->nfa);
849 word(v, BEHIND, lp, s);
850 nonword(v, AHEAD, s, rp);
854 wordchrs(v); /* does NEXT() */
855 s = newstate(v->nfa);
857 nonword(v, BEHIND, lp, s);
858 word(v, AHEAD, s, rp);
859 s = newstate(v->nfa);
861 word(v, BEHIND, lp, s);
862 nonword(v, AHEAD, s, rp);
866 wordchrs(v); /* does NEXT() */
867 s = newstate(v->nfa);
869 word(v, BEHIND, lp, s);
870 word(v, AHEAD, s, rp);
871 s = newstate(v->nfa);
873 nonword(v, BEHIND, lp, s);
874 nonword(v, AHEAD, s, rp);
877 case LACON: /* lookaround constraint */
878 latype = v->nextvalue;
880 s = newstate(v->nfa);
881 s2 = newstate(v->nfa);
883 t = parse(v, ')', LACON, s, s2);
884 freesubre(v, t); /* internal structure irrelevant */
888 processlacon(v, s, s2, latype, lp, rp);
891 /* then errors, to get them out of the way */
903 /* then plain characters, and minor variants on that theme */
904 case ')': /* unbalanced paren */
905 if ((v->cflags & REG_ADVANCED) != REG_EXTENDED)
910 /* legal in EREs due to specification botch */
912 /* fallthrough into case PLAIN */
914 onechr(v, v->nextvalue, lp, rp);
915 okcolors(v->nfa, v->cm);
920 if (v->nextvalue == 1)
924 assert(SEE(']') || ISERR());
928 rainbow(v->nfa, v->cm, PLAIN,
929 (v->cflags & REG_NLSTOP) ? v->nlcolor : COLORLESS,
933 /* and finally the ugly stuff */
934 case '(': /* value flags as capturing or non */
935 cap = (type == LACON) ? 0 : v->nextvalue;
940 if ((size_t) subno >= v->nsubs)
942 assert((size_t) subno < v->nsubs);
945 atomtype = PLAIN; /* something that's not '(' */
947 /* need new endpoints because tree will contain pointers */
948 s = newstate(v->nfa);
949 s2 = newstate(v->nfa);
954 atom = parse(v, ')', type, s, s2);
955 assert(SEE(')') || ISERR());
960 v->subs[subno] = atom;
961 t = subre(v, '(', atom->flags | CAP, lp, rp);
967 /* postpone everything else pending possible {0} */
969 case BACKREF: /* the Feature From The Black Lagoon */
970 INSIST(type != LACON, REG_ESUBREG);
971 INSIST(v->nextvalue < v->nsubs, REG_ESUBREG);
972 INSIST(v->subs[v->nextvalue] != NULL, REG_ESUBREG);
974 assert(v->nextvalue > 0);
975 atom = subre(v, 'b', BACKR, lp, rp);
977 subno = v->nextvalue;
979 EMPTYARC(lp, rp); /* temporarily, so there's something */
984 /* ...and an atom may be followed by a quantifier */
990 qprefer = (v->nextvalue) ? LONGER : SHORTER;
996 qprefer = (v->nextvalue) ? LONGER : SHORTER;
1002 qprefer = (v->nextvalue) ? LONGER : SHORTER;
1019 /* {m,n} exercises preference, even if it's {m,m} */
1020 qprefer = (v->nextvalue) ? LONGER : SHORTER;
1025 /* {m} passes operand's preference through */
1029 { /* catches errors too */
1035 default: /* no quantifier */
1041 /* annoying special case: {0} or {0,0} cancels everything */
1042 if (m == 0 && n == 0)
1046 if (atomtype == '(')
1047 v->subs[subno] = NULL;
1048 delsub(v->nfa, lp, rp);
1053 /* if not a messy case, avoid hard part */
1054 assert(!MESSY(top->flags));
1055 f = top->flags | qprefer | ((atom != NULL) ? atom->flags : 0);
1056 if (atomtype != '(' && atomtype != BACKREF && !MESSY(UP(f)))
1058 if (!(m == 1 && n == 1))
1059 repeat(v, lp, rp, m, n);
1067 * hard part: something messy
1069 * That is, capturing parens, back reference, short/long clash, or an atom
1070 * with substructure containing one of those.
1073 /* now we'll need a subre for the contents even if they're boring */
1076 atom = subre(v, '=', 0, lp, rp);
1081 * Prepare a general-purpose state skeleton.
1083 * In the no-backrefs case, we want this:
1085 * [lp] ---> [s] ---prefix---> [begin] ---atom---> [end] ---rest---> [rp]
1087 * where prefix is some repetitions of atom. In the general case we need
1089 * [lp] ---> [s] ---iterator---> [s2] ---rest---> [rp]
1091 * where the iterator wraps around [begin] ---atom---> [end]
1093 * We make the s state here for both cases; s2 is made below if needed
1096 s = newstate(v->nfa); /* first, new endpoints for the atom */
1097 s2 = newstate(v->nfa);
1099 moveouts(v->nfa, lp, s);
1100 moveins(v->nfa, rp, s2);
1104 s = newstate(v->nfa); /* set up starting state */
1109 /* break remaining subRE into x{...} and what follows */
1110 t = subre(v, '.', COMBINE(qprefer, atom->flags), lp, rp);
1115 /* here we should recurse... but we must postpone that to the end */
1117 /* split top into prefix and remaining */
1118 assert(top->op == '=' && top->left == NULL && top->right == NULL);
1119 top->left = subre(v, '=', top->flags, top->begin, lp);
1124 /* if it's a backref, now is the time to replicate the subNFA */
1125 if (atomtype == BACKREF)
1127 assert(atom->begin->nouts == 1); /* just the EMPTY */
1128 delsub(v->nfa, atom->begin, atom->end);
1129 assert(v->subs[subno] != NULL);
1132 * And here's why the recursion got postponed: it must wait until the
1133 * skeleton is filled in, because it may hit a backref that wants to
1134 * copy the filled-in skeleton.
1136 dupnfa(v->nfa, v->subs[subno]->begin, v->subs[subno]->end,
1137 atom->begin, atom->end);
1142 * It's quantifier time. If the atom is just a backref, we'll let it deal
1143 * with quantifiers internally.
1145 if (atomtype == BACKREF)
1147 /* special case: backrefs have internal quantifiers */
1148 EMPTYARC(s, atom->begin); /* empty prefix */
1149 /* just stuff everything into atom */
1150 repeat(v, atom->begin, atom->end, m, n);
1151 atom->min = (short) m;
1152 atom->max = (short) n;
1153 atom->flags |= COMBINE(qprefer, atom->flags);
1154 /* rest of branch can be strung starting from atom->end */
1157 else if (m == 1 && n == 1)
1159 /* no/vacuous quantifier: done */
1160 EMPTYARC(s, atom->begin); /* empty prefix */
1161 /* rest of branch can be strung starting from atom->end */
1164 else if (m > 0 && !(atom->flags & BACKR))
1167 * If there's no backrefs involved, we can turn x{m,n} into
1168 * x{m-1,n-1}x, with capturing parens in only the second x. This is
1169 * valid because we only care about capturing matches from the final
1170 * iteration of the quantifier. It's a win because we can implement
1171 * the backref-free left side as a plain DFA node, since we don't
1172 * really care where its submatches are.
1174 dupnfa(v->nfa, atom->begin, atom->end, s, atom->begin);
1175 assert(m >= 1 && m != DUPINF && n >= 1);
1176 repeat(v, s, atom->begin, m - 1, (n == DUPINF) ? n : n - 1);
1177 f = COMBINE(qprefer, atom->flags);
1178 t = subre(v, '.', f, s, atom->end); /* prefix and atom */
1180 t->left = subre(v, '=', PREF(f), s, atom->begin);
1184 /* rest of branch can be strung starting from atom->end */
1189 /* general case: need an iteration node */
1190 s2 = newstate(v->nfa);
1192 moveouts(v->nfa, atom->end, s2);
1194 dupnfa(v->nfa, atom->begin, atom->end, s, s2);
1195 repeat(v, s, s2, m, n);
1196 f = COMBINE(qprefer, atom->flags);
1197 t = subre(v, '*', f, s, s2);
1203 /* rest of branch is to be strung from iteration's end state */
1206 /* and finally, look after that postponed recursion */
1208 if (!(SEE('|') || SEE(stopper) || SEE(EOS)))
1209 t->right = parsebranch(v, stopper, type, s2, rp, 1);
1213 t->right = subre(v, '=', 0, s2, rp);
1216 assert(SEE('|') || SEE(stopper) || SEE(EOS));
1217 t->flags |= COMBINE(t->flags, t->right->flags);
1218 top->flags |= COMBINE(top->flags, t->flags);
1222 * nonword - generate arcs for non-word-character ahead or behind
1225 nonword(struct vars *v,
1226 int dir, /* AHEAD or BEHIND */
1230 int anchor = (dir == AHEAD) ? '$' : '^';
1232 assert(dir == AHEAD || dir == BEHIND);
1233 newarc(v->nfa, anchor, 1, lp, rp);
1234 newarc(v->nfa, anchor, 0, lp, rp);
1235 colorcomplement(v->nfa, v->cm, dir, v->wordchrs, lp, rp);
1236 /* (no need for special attention to \n) */
1240 * word - generate arcs for word character ahead or behind
1243 word(struct vars *v,
1244 int dir, /* AHEAD or BEHIND */
1248 assert(dir == AHEAD || dir == BEHIND);
1249 cloneouts(v->nfa, v->wordchrs, lp, rp, dir);
1250 /* (no need for special attention to \n) */
1254 * scannum - scan a number
1256 static int /* value, <= DUPMAX */
1257 scannum(struct vars *v)
1261 while (SEE(DIGIT) && n < DUPMAX)
1263 n = n * 10 + v->nextvalue;
1266 if (SEE(DIGIT) || n > DUPMAX)
1275 * repeat - replicate subNFA for quantifiers
1277 * The sub-NFA strung from lp to rp is modified to represent m to n
1278 * repetitions of its initial contents.
1280 * The duplication sequences used here are chosen carefully so that any
1281 * pointers starting out pointing into the subexpression end up pointing into
1282 * the last occurrence. (Note that it may not be strung between the same
1283 * left and right end states, however!) This used to be important for the
1284 * subRE tree, although the important bits are now handled by the in-line
1285 * code in parse(), and when this is called, it doesn't matter any more.
1288 repeat(struct vars *v,
1296 #define PAIR(x, y) ((x)*4 + (y))
1297 #define REDUCE(x) ( ((x) == DUPINF) ? INF : (((x) > 1) ? SOME : (x)) )
1298 const int rm = REDUCE(m);
1299 const int rn = REDUCE(n);
1303 switch (PAIR(rm, rn))
1305 case PAIR(0, 0): /* empty string */
1306 delsub(v->nfa, lp, rp);
1309 case PAIR(0, 1): /* do as x| */
1312 case PAIR(0, SOME): /* do as x{1,n}| */
1313 repeat(v, lp, rp, 1, n);
1317 case PAIR(0, INF): /* loop x around */
1318 s = newstate(v->nfa);
1320 moveouts(v->nfa, lp, s);
1321 moveins(v->nfa, rp, s);
1325 case PAIR(1, 1): /* no action required */
1327 case PAIR(1, SOME): /* do as x{0,n-1}x = (x{1,n-1}|)x */
1328 s = newstate(v->nfa);
1330 moveouts(v->nfa, lp, s);
1331 dupnfa(v->nfa, s, rp, lp, s);
1333 repeat(v, lp, s, 1, n - 1);
1337 case PAIR(1, INF): /* add loopback arc */
1338 s = newstate(v->nfa);
1339 s2 = newstate(v->nfa);
1341 moveouts(v->nfa, lp, s);
1342 moveins(v->nfa, rp, s2);
1347 case PAIR(SOME, SOME): /* do as x{m-1,n-1}x */
1348 s = newstate(v->nfa);
1350 moveouts(v->nfa, lp, s);
1351 dupnfa(v->nfa, s, rp, lp, s);
1353 repeat(v, lp, s, m - 1, n - 1);
1355 case PAIR(SOME, INF): /* do as x{m-1,}x */
1356 s = newstate(v->nfa);
1358 moveouts(v->nfa, lp, s);
1359 dupnfa(v->nfa, s, rp, lp, s);
1361 repeat(v, lp, s, m - 1, n);
1370 * bracket - handle non-complemented bracket expression
1371 * Also called from cbracket for complemented bracket expressions.
1374 bracket(struct vars *v,
1380 while (!SEE(']') && !SEE(EOS))
1381 brackpart(v, lp, rp);
1382 assert(SEE(']') || ISERR());
1383 okcolors(v->nfa, v->cm);
1387 * cbracket - handle complemented bracket expression
1388 * We do it by calling bracket() with dummy endpoints, and then complementing
1389 * the result. The alternative would be to invoke rainbow(), and then delete
1390 * arcs as the b.e. is seen... but that gets messy.
1393 cbracket(struct vars *v,
1397 struct state *left = newstate(v->nfa);
1398 struct state *right = newstate(v->nfa);
1401 bracket(v, left, right);
1402 if (v->cflags & REG_NLSTOP)
1403 newarc(v->nfa, PLAIN, v->nlcolor, left, right);
1406 assert(lp->nouts == 0); /* all outarcs will be ours */
1409 * Easy part of complementing, and all there is to do since the MCCE code
1412 colorcomplement(v->nfa, v->cm, PLAIN, left, lp, rp);
1414 dropstate(v->nfa, left);
1415 assert(right->nins == 0);
1416 freestate(v->nfa, right);
1420 * brackpart - handle one item (or range) within a bracket expression
1423 brackpart(struct vars *v,
1434 /* parse something, get rid of special cases, take shortcuts */
1435 switch (v->nexttype)
1437 case RANGE: /* a-b-c or other botch */
1442 c[0] = v->nextvalue;
1444 /* shortcut for ordinary chr (not range) */
1447 onechr(v, c[0], lp, rp);
1450 startc = element(v, c, c + 1);
1455 endp = scanplain(v);
1456 INSIST(startp < endp, REG_ECOLLATE);
1458 startc = element(v, startp, endp);
1463 endp = scanplain(v);
1464 INSIST(startp < endp, REG_ECOLLATE);
1466 startc = element(v, startp, endp);
1468 cv = eclass(v, startc, (v->cflags & REG_ICASE));
1470 subcolorcvec(v, cv, lp, rp);
1475 endp = scanplain(v);
1476 INSIST(startp < endp, REG_ECTYPE);
1478 cv = cclass(v, startp, endp, (v->cflags & REG_ICASE));
1480 subcolorcvec(v, cv, lp, rp);
1492 switch (v->nexttype)
1496 c[0] = v->nextvalue;
1498 endc = element(v, c, c + 1);
1503 endp = scanplain(v);
1504 INSIST(startp < endp, REG_ECOLLATE);
1506 endc = element(v, startp, endp);
1519 * Ranges are unportable. Actually, standard C does guarantee that digits
1520 * are contiguous, but making that an exception is just too complicated.
1524 cv = range(v, startc, endc, (v->cflags & REG_ICASE));
1526 subcolorcvec(v, cv, lp, rp);
1530 * scanplain - scan PLAIN contents of [. etc.
1532 * Certain bits of trickery in lex.c know that this code does not try
1533 * to look past the final bracket of the [. etc.
1535 static const chr * /* just after end of sequence */
1536 scanplain(struct vars *v)
1540 assert(SEE(COLLEL) || SEE(ECLASS) || SEE(CCLASS));
1550 assert(SEE(END) || ISERR());
1557 * onechr - fill in arcs for a plain character, and possible case complements
1558 * This is mostly a shortcut for efficient handling of the common case.
1561 onechr(struct vars *v,
1566 if (!(v->cflags & REG_ICASE))
1568 color lastsubcolor = COLORLESS;
1570 subcoloronechr(v, c, lp, rp, &lastsubcolor);
1574 /* rats, need general case anyway... */
1575 subcolorcvec(v, allcases(v, c), lp, rp);
1579 * wordchrs - set up word-chr list for word-boundary stuff, if needed
1581 * The list is kept as a bunch of arcs between two dummy states; it's
1582 * disposed of by the unreachable-states sweep in NFA optimization.
1583 * Does NEXT(). Must not be called from any unusual lexical context.
1584 * This should be reconciled with the \w etc. handling in lex.c, and
1585 * should be cleaned up to reduce dependencies on input scanning.
1588 wordchrs(struct vars *v)
1591 struct state *right;
1593 if (v->wordchrs != NULL)
1595 NEXT(); /* for consistency */
1599 left = newstate(v->nfa);
1600 right = newstate(v->nfa);
1602 /* fine point: implemented with [::], and lexer will set REG_ULOCALE */
1605 assert(v->savenow != NULL && SEE('['));
1606 bracket(v, left, right);
1607 assert((v->savenow != NULL && SEE(']')) || ISERR());
1614 * processlacon - generate the NFA representation of a LACON
1616 * In the general case this is just newlacon() + newarc(), but some cases
1620 processlacon(struct vars *v,
1621 struct state *begin, /* start of parsed LACON sub-re */
1622 struct state *end, /* end of parsed LACON sub-re */
1624 struct state *lp, /* left state to hang it on */
1625 struct state *rp) /* right state to hang it on */
1631 * Check for lookaround RE consisting of a single plain color arc (or set
1632 * of arcs); this would typically be a simple chr or a bracket expression.
1634 s1 = single_color_transition(begin, end);
1637 case LATYPE_AHEAD_POS:
1638 /* If lookahead RE is just colorset C, convert to AHEAD(C) */
1641 cloneouts(v->nfa, s1, lp, rp, AHEAD);
1645 case LATYPE_AHEAD_NEG:
1646 /* If lookahead RE is just colorset C, convert to AHEAD(^C)|$ */
1649 colorcomplement(v->nfa, v->cm, AHEAD, s1, lp, rp);
1650 newarc(v->nfa, '$', 1, lp, rp);
1651 newarc(v->nfa, '$', 0, lp, rp);
1655 case LATYPE_BEHIND_POS:
1656 /* If lookbehind RE is just colorset C, convert to BEHIND(C) */
1659 cloneouts(v->nfa, s1, lp, rp, BEHIND);
1663 case LATYPE_BEHIND_NEG:
1664 /* If lookbehind RE is just colorset C, convert to BEHIND(^C)|^ */
1667 colorcomplement(v->nfa, v->cm, BEHIND, s1, lp, rp);
1668 newarc(v->nfa, '^', 1, lp, rp);
1669 newarc(v->nfa, '^', 0, lp, rp);
1677 /* General case: we need a LACON subre and arc */
1678 n = newlacon(v, begin, end, latype);
1679 newarc(v->nfa, LACON, n, lp, rp);
1683 * subre - allocate a subre
1685 static struct subre *
1686 subre(struct vars *v,
1689 struct state *begin,
1692 struct subre *ret = v->treefree;
1695 * Checking for stack overflow here is sufficient to protect parse() and
1696 * its recursive subroutines.
1698 if (STACK_TOO_DEEP(v->re))
1705 v->treefree = ret->left;
1708 ret = (struct subre *) MALLOC(sizeof(struct subre));
1714 ret->chain = v->treechain;
1718 assert(strchr("=b|.*(", op) != NULL);
1722 ret->id = 0; /* will be assigned later */
1724 ret->min = ret->max = 1;
1735 * freesubre - free a subRE subtree
1738 freesubre(struct vars *v, /* might be NULL */
1744 if (sr->left != NULL)
1745 freesubre(v, sr->left);
1746 if (sr->right != NULL)
1747 freesubre(v, sr->right);
1753 * freesrnode - free one node in a subRE subtree
1756 freesrnode(struct vars *v, /* might be NULL */
1762 if (!NULLCNFA(sr->cnfa))
1763 freecnfa(&sr->cnfa);
1766 if (v != NULL && v->treechain != NULL)
1768 /* we're still parsing, maybe we can reuse the subre */
1769 sr->left = v->treefree;
1777 * optst - optimize a subRE subtree
1780 optst(struct vars *v,
1784 * DGP (2007-11-13): I assume it was the programmer's intent to eventually
1785 * come back and add code to optimize subRE trees, but the routine coded
1786 * just spends effort traversing the tree and doing nothing. We can do
1787 * nothing with less effort.
1793 * numst - number tree nodes (assigning "id" indexes)
1795 static int /* next number */
1796 numst(struct subre *t,
1797 int start) /* starting point for subtree numbers */
1804 t->id = (short) i++;
1805 if (t->left != NULL)
1806 i = numst(t->left, i);
1807 if (t->right != NULL)
1808 i = numst(t->right, i);
1813 * markst - mark tree nodes as INUSE
1815 * Note: this is a great deal more subtle than it looks. During initial
1816 * parsing of a regex, all subres are linked into the treechain list;
1817 * discarded ones are also linked into the treefree list for possible reuse.
1818 * After we are done creating all subres required for a regex, we run markst()
1819 * then cleanst(), which results in discarding all subres not reachable from
1820 * v->tree. We then clear v->treechain, indicating that subres must be found
1821 * by descending from v->tree. This changes the behavior of freesubre(): it
1822 * will henceforth FREE() unwanted subres rather than sticking them into the
1823 * treefree list. (Doing that any earlier would result in dangling links in
1824 * the treechain list.) This all means that freev() will clean up correctly
1825 * if invoked before or after markst()+cleanst(); but it would not work if
1826 * called partway through this state conversion, so we mustn't error out
1827 * in or between these two functions.
1830 markst(struct subre *t)
1835 if (t->left != NULL)
1837 if (t->right != NULL)
1842 * cleanst - free any tree nodes not marked INUSE
1845 cleanst(struct vars *v)
1850 for (t = v->treechain; t != NULL; t = next)
1853 if (!(t->flags & INUSE))
1856 v->treechain = NULL;
1857 v->treefree = NULL; /* just on general principles */
1861 * nfatree - turn a subRE subtree into a tree of compacted NFAs
1863 static long /* optimize results from top node */
1864 nfatree(struct vars *v,
1866 FILE *f) /* for debug output */
1868 assert(t != NULL && t->begin != NULL);
1870 if (t->left != NULL)
1871 (DISCARD) nfatree(v, t->left, f);
1872 if (t->right != NULL)
1873 (DISCARD) nfatree(v, t->right, f);
1875 return nfanode(v, t, 0, f);
1879 * nfanode - do one NFA for nfatree or lacons
1881 * If converttosearch is true, apply makesearch() to the NFA.
1883 static long /* optimize results */
1884 nfanode(struct vars *v,
1886 int converttosearch,
1887 FILE *f) /* for debug output */
1892 assert(t->begin != NULL);
1899 fprintf(f, "\n\n\n========= TREE NODE %s ==========\n",
1900 stid(t, idbuf, sizeof(idbuf)));
1903 nfa = newnfa(v, v->cm, v->nfa);
1905 dupnfa(nfa, t->begin, t->end, nfa->init, nfa->final);
1909 ret = optimize(nfa, f);
1910 if (converttosearch && !ISERR())
1913 compact(nfa, &t->cnfa);
1920 * newlacon - allocate a lookaround-constraint subRE
1922 static int /* lacon number */
1923 newlacon(struct vars *v,
1924 struct state *begin,
1929 struct subre *newlacons;
1932 if (v->nlacons == 0)
1934 n = 1; /* skip 0th */
1935 newlacons = (struct subre *) MALLOC(2 * sizeof(struct subre));
1940 newlacons = (struct subre *) REALLOC(v->lacons,
1941 (n + 1) * sizeof(struct subre));
1943 if (newlacons == NULL)
1948 v->lacons = newlacons;
1950 sub = &v->lacons[n];
1953 sub->subno = latype;
1959 * freelacons - free lookaround-constraint subRE vector
1962 freelacons(struct subre *subs,
1969 for (sub = subs + 1, i = n - 1; i > 0; sub++, i--) /* no 0th */
1970 if (!NULLCNFA(sub->cnfa))
1971 freecnfa(&sub->cnfa);
1976 * rfree - free a whole RE (insides of regfree)
1983 if (re == NULL || re->re_magic != REMAGIC)
1986 re->re_magic = 0; /* invalidate RE */
1987 g = (struct guts *) re->re_guts;
1994 if (g->tree != NULL)
1995 freesubre((struct vars *) NULL, g->tree);
1996 if (g->lacons != NULL)
1997 freelacons(g->lacons, g->nlacons);
1998 if (!NULLCNFA(g->search))
1999 freecnfa(&g->search);
2005 * rcancelrequested - check for external request to cancel regex operation
2007 * Return nonzero to fail the operation with error code REG_CANCEL,
2008 * zero to keep going
2010 * The current implementation is Postgres-specific. If we ever get around
2011 * to splitting the regex code out as a standalone library, there will need
2012 * to be some API to let applications define a callback function for this.
2015 rcancelrequested(void)
2017 return InterruptPending && (QueryCancelPending || ProcDiePending);
2021 * rstacktoodeep - check for stack getting dangerously deep
2023 * Return nonzero to fail the operation with error code REG_ETOOBIG,
2024 * zero to keep going
2026 * The current implementation is Postgres-specific. If we ever get around
2027 * to splitting the regex code out as a standalone library, there will need
2028 * to be some API to let applications define a callback function for this.
2033 return stack_is_too_deep();
2039 * dump - dump an RE in human-readable form
2048 if (re->re_magic != REMAGIC)
2049 fprintf(f, "bad magic number (0x%x not 0x%x)\n", re->re_magic,
2051 if (re->re_guts == NULL)
2053 fprintf(f, "NULL guts!!!\n");
2056 g = (struct guts *) re->re_guts;
2057 if (g->magic != GUTSMAGIC)
2058 fprintf(f, "bad guts magic number (0x%x not 0x%x)\n", g->magic,
2061 fprintf(f, "\n\n\n========= DUMP ==========\n");
2062 fprintf(f, "nsub %d, info 0%lo, csize %d, ntree %d\n",
2063 (int) re->re_nsub, re->re_info, re->re_csize, g->ntree);
2065 dumpcolors(&g->cmap, f);
2066 if (!NULLCNFA(g->search))
2068 fprintf(f, "\nsearch:\n");
2069 dumpcnfa(&g->search, f);
2071 for (i = 1; i < g->nlacons; i++)
2073 struct subre *lasub = &g->lacons[i];
2076 switch (lasub->subno)
2078 case LATYPE_AHEAD_POS:
2079 latype = "positive lookahead";
2081 case LATYPE_AHEAD_NEG:
2082 latype = "negative lookahead";
2084 case LATYPE_BEHIND_POS:
2085 latype = "positive lookbehind";
2087 case LATYPE_BEHIND_NEG:
2088 latype = "negative lookbehind";
2094 fprintf(f, "\nla%d (%s):\n", i, latype);
2095 dumpcnfa(&lasub->cnfa, f);
2098 dumpst(g->tree, f, 0);
2102 * dumpst - dump a subRE tree
2105 dumpst(struct subre *t,
2107 int nfapresent) /* is the original NFA still around? */
2110 fprintf(f, "null tree\n");
2112 stdump(t, f, nfapresent);
2117 * stdump - recursive guts of dumpst
2120 stdump(struct subre *t,
2122 int nfapresent) /* is the original NFA still around? */
2126 fprintf(f, "%s. `%c'", stid(t, idbuf, sizeof(idbuf)), t->op);
2127 if (t->flags & LONGER)
2128 fprintf(f, " longest");
2129 if (t->flags & SHORTER)
2130 fprintf(f, " shortest");
2131 if (t->flags & MIXED)
2132 fprintf(f, " hasmixed");
2134 fprintf(f, " hascapture");
2135 if (t->flags & BACKR)
2136 fprintf(f, " hasbackref");
2137 if (!(t->flags & INUSE))
2138 fprintf(f, " UNUSED");
2140 fprintf(f, " (#%d)", t->subno);
2141 if (t->min != 1 || t->max != 1)
2143 fprintf(f, " {%d,", t->min);
2144 if (t->max != DUPINF)
2145 fprintf(f, "%d", t->max);
2149 fprintf(f, " %ld-%ld", (long) t->begin->no, (long) t->end->no);
2150 if (t->left != NULL)
2151 fprintf(f, " L:%s", stid(t->left, idbuf, sizeof(idbuf)));
2152 if (t->right != NULL)
2153 fprintf(f, " R:%s", stid(t->right, idbuf, sizeof(idbuf)));
2154 if (!NULLCNFA(t->cnfa))
2157 dumpcnfa(&t->cnfa, f);
2160 if (t->left != NULL)
2161 stdump(t->left, f, nfapresent);
2162 if (t->right != NULL)
2163 stdump(t->right, f, nfapresent);
2167 * stid - identify a subtree node for dumping
2169 static const char * /* points to buf or constant string */
2170 stid(struct subre *t,
2174 /* big enough for hex int or decimal t->id? */
2175 if (bufsize < sizeof(void *) * 2 + 3 || bufsize < sizeof(t->id) * 3 + 1)
2178 sprintf(buf, "%d", t->id);
2180 sprintf(buf, "%p", t);
2183 #endif /* REG_DEBUG */
2186 #include "regc_lex.c"
2187 #include "regc_color.c"
2188 #include "regc_nfa.c"
2189 #include "regc_cvec.c"
2190 #include "regc_pg_locale.c"
2191 #include "regc_locale.c"