PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
regcomp.c
Go to the documentation of this file.
1 /*
2  * re_*comp and friends - compile REs
3  * This file #includes several others (see the bottom).
4  *
5  * Copyright (c) 1998, 1999 Henry Spencer. All rights reserved.
6  *
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
10  * thanks all of them.
11  *
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.
16  *
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.
19  *
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.
30  *
31  * src/backend/regex/regcomp.c
32  *
33  */
34 
35 #include "regex/regguts.h"
36 
37 /*
38  * forward declarations, up here so forward datatypes etc. are defined early
39  */
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);
73 
74 #ifdef REG_DEBUG
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);
79 #endif
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);
92 
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 *);
114 
115 #ifdef REG_DEBUG
116 static void dumpcolors(struct colormap *, FILE *);
117 static void dumpchr(chr, FILE *);
118 #endif
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 **);
157 
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 *);
182 
183 #ifdef REG_DEBUG
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 *);
189 #endif
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 *);
197 
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);
210 
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);
221 
222 
223 /* internal variables, bundled for easy passing around */
224 struct vars
225 {
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" */
230  const chr *savestop;
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 */
255 };
256 
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)
272 
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 */
292 
293 /* is an arc colored, and hence on a color chain? */
294 #define COLORED(a) \
295  ((a)->type == PLAIN || (a)->type == AHEAD || (a)->type == BEHIND)
296 
297 
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 */
303 };
304 
305 
306 
307 /*
308  * pg_regcomp - compile regular expression
309  *
310  * Note: on failure, no resources remain allocated, so pg_regfree()
311  * need not be applied to re.
312  */
313 int
315  const chr *string,
316  size_t len,
317  int flags,
318  Oid collation)
319 {
320  struct vars var;
321  struct vars *v = &var;
322  struct guts *g;
323  int i;
324  size_t j;
325 
326 #ifdef REG_DEBUG
327  FILE *debug = (flags & REG_PROGRESS) ? stdout : (FILE *) NULL;
328 #else
329  FILE *debug = (FILE *) NULL;
330 #endif
331 
332 #define CNOERR() { if (ISERR()) return freev(v, v->err); }
333 
334  /* sanity checks */
335 
336  if (re == NULL || string == NULL)
337  return REG_INVARG;
338  if ((flags & REG_QUOTE) &&
339  (flags & (REG_ADVANCED | REG_EXPANDED | REG_NEWLINE)))
340  return REG_INVARG;
341  if (!(flags & REG_EXTENDED) && (flags & REG_ADVF))
342  return REG_INVARG;
343 
344  /* Initialize locale-dependent support */
345  pg_set_regex_collation(collation);
346 
347  /* initial setup (after which freev() is callable) */
348  v->re = re;
349  v->now = string;
350  v->stop = v->now + len;
351  v->savenow = v->savestop = NULL;
352  v->err = 0;
353  v->cflags = flags;
354  v->nsubexp = 0;
355  v->subs = v->sub10;
356  v->nsubs = 10;
357  for (j = 0; j < v->nsubs; j++)
358  v->subs[j] = NULL;
359  v->nfa = NULL;
360  v->cm = NULL;
361  v->nlcolor = COLORLESS;
362  v->wordchrs = NULL;
363  v->tree = NULL;
364  v->treechain = NULL;
365  v->treefree = NULL;
366  v->cv = NULL;
367  v->cv2 = NULL;
368  v->lacons = NULL;
369  v->nlacons = 0;
370  v->spaceused = 0;
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;
375  re->re_guts = NULL;
376  re->re_fns = VS(&functions);
377 
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;
383  g->tree = NULL;
384  initcm(v, &g->cmap);
385  v->cm = &g->cmap;
386  g->lacons = NULL;
387  g->nlacons = 0;
388  ZAPCNFA(g->search);
389  v->nfa = newnfa(v, v->cm, (struct nfa *) NULL);
390  CNOERR();
391  /* set up a reasonably-sized transient cvec for getcvec usage */
392  v->cv = newcvec(100, 20);
393  if (v->cv == NULL)
394  return freev(v, REG_ESPACE);
395 
396  /* parsing */
397  lexstart(v); /* also handles prefixes */
398  if ((v->cflags & REG_NLSTOP) || (v->cflags & REG_NLANCH))
399  {
400  /* assign newline a unique color */
401  v->nlcolor = subcolor(v->cm, newline());
402  okcolors(v->nfa, v->cm);
403  }
404  CNOERR();
405  v->tree = parse(v, EOS, PLAIN, v->nfa->init, v->nfa->final);
406  assert(SEE(EOS)); /* even if error; ISERR() => SEE(EOS) */
407  CNOERR();
408  assert(v->tree != NULL);
409 
410  /* finish setup of nfa and its subre tree */
411  specialcolors(v->nfa);
412  CNOERR();
413 #ifdef REG_DEBUG
414  if (debug != NULL)
415  {
416  fprintf(debug, "\n\n\n========= RAW ==========\n");
417  dumpnfa(v->nfa, debug);
418  dumpst(v->tree, debug, 1);
419  }
420 #endif
421  optst(v, v->tree);
422  v->ntree = numst(v->tree, 1);
423  markst(v->tree);
424  cleanst(v);
425 #ifdef REG_DEBUG
426  if (debug != NULL)
427  {
428  fprintf(debug, "\n\n\n========= TREE FIXED ==========\n");
429  dumpst(v->tree, debug, 1);
430  }
431 #endif
432 
433  /* build compacted NFAs for tree and lacons */
434  re->re_info |= nfatree(v, v->tree, debug);
435  CNOERR();
436  assert(v->nlacons == 0 || v->lacons != NULL);
437  for (i = 1; i < v->nlacons; i++)
438  {
439  struct subre *lasub = &v->lacons[i];
440 
441 #ifdef REG_DEBUG
442  if (debug != NULL)
443  fprintf(debug, "\n\n\n========= LA%d ==========\n", i);
444 #endif
445 
446  /* Prepend .* to pattern if it's a lookbehind LACON */
447  nfanode(v, lasub, !LATYPE_IS_AHEAD(lasub->subno), debug);
448  }
449  CNOERR();
450  if (v->tree->flags & SHORTER)
452 
453  /* build compacted NFAs for tree, lacons, fast search */
454 #ifdef REG_DEBUG
455  if (debug != NULL)
456  fprintf(debug, "\n\n\n========= SEARCH ==========\n");
457 #endif
458  /* can sacrifice main NFA now, so use it as work area */
459  (DISCARD) optimize(v->nfa, debug);
460  CNOERR();
461  makesearch(v, v->nfa);
462  CNOERR();
463  compact(v->nfa, &g->search);
464  CNOERR();
465 
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;
473  g->tree = v->tree;
474  v->tree = NULL;
475  g->ntree = v->ntree;
476  g->compare = (v->cflags & REG_ICASE) ? casecmp : cmp;
477  g->lacons = v->lacons;
478  v->lacons = NULL;
479  g->nlacons = v->nlacons;
480 
481 #ifdef REG_DEBUG
482  if (flags & REG_DUMP)
483  dump(re, stdout);
484 #endif
485 
486  assert(v->err == 0);
487  return freev(v, 0);
488 }
489 
490 /*
491  * moresubs - enlarge subRE vector
492  */
493 static void
494 moresubs(struct vars * v,
495  int wanted) /* want enough room for this one */
496 {
497  struct subre **p;
498  size_t n;
499 
500  assert(wanted > 0 && (size_t) wanted >= v->nsubs);
501  n = (size_t) wanted *3 / 2 + 1;
502 
503  if (v->subs == v->sub10)
504  {
505  p = (struct subre **) MALLOC(n * sizeof(struct subre *));
506  if (p != NULL)
507  memcpy(VS(p), VS(v->subs),
508  v->nsubs * sizeof(struct subre *));
509  }
510  else
511  p = (struct subre **) REALLOC(v->subs, n * sizeof(struct subre *));
512  if (p == NULL)
513  {
514  ERR(REG_ESPACE);
515  return;
516  }
517  v->subs = p;
518  for (p = &v->subs[v->nsubs]; v->nsubs < n; p++, v->nsubs++)
519  *p = NULL;
520  assert(v->nsubs == n);
521  assert((size_t) wanted < v->nsubs);
522 }
523 
524 /*
525  * freev - free vars struct's substructures where necessary
526  *
527  * Optionally does error-number setting, and always returns error code
528  * (if any), to make error-handling code terser.
529  */
530 static int
531 freev(struct vars * v,
532  int err)
533 {
534  if (v->re != NULL)
535  rfree(v->re);
536  if (v->subs != v->sub10)
537  FREE(v->subs);
538  if (v->nfa != NULL)
539  freenfa(v->nfa);
540  if (v->tree != NULL)
541  freesubre(v, v->tree);
542  if (v->treechain != NULL)
543  cleanst(v);
544  if (v->cv != NULL)
545  freecvec(v->cv);
546  if (v->cv2 != NULL)
547  freecvec(v->cv2);
548  if (v->lacons != NULL)
549  freelacons(v->lacons, v->nlacons);
550  ERR(err); /* nop if err==0 */
551 
552  return v->err;
553 }
554 
555 /*
556  * makesearch - turn an NFA into a search NFA (implicit prepend of .*?)
557  * NFA must have been optimize()d already.
558  */
559 static void
560 makesearch(struct vars * v,
561  struct nfa * nfa)
562 {
563  struct arc *a;
564  struct arc *b;
565  struct state *pre = nfa->pre;
566  struct state *s;
567  struct state *s2;
568  struct state *slist;
569 
570  /* no loops are needed if it's anchored */
571  for (a = pre->outs; a != NULL; a = a->outchain)
572  {
573  assert(a->type == PLAIN);
574  if (a->co != nfa->bos[0] && a->co != nfa->bos[1])
575  break;
576  }
577  if (a != NULL)
578  {
579  /* add implicit .* in front */
580  rainbow(nfa, v->cm, PLAIN, COLORLESS, pre, pre);
581 
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);
585  }
586 
587  /*
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.
594  */
595 
596  /* first, make a list of the states reachable from pre and elsewhere */
597  slist = NULL;
598  for (a = pre->outs; a != NULL; a = a->outchain)
599  {
600  s = a->to;
601  for (b = s->ins; b != NULL; b = b->inchain)
602  {
603  if (b->from != pre)
604  break;
605  }
606 
607  /*
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.
612  */
613  if (b != NULL && s->tmp == NULL)
614  {
615  s->tmp = (slist != NULL) ? slist : s;
616  slist = s;
617  }
618  }
619 
620  /* do the splits */
621  for (s = slist; s != NULL; s = s2)
622  {
623  s2 = newstate(nfa);
624  NOERR();
625  copyouts(nfa, s, s2);
626  NOERR();
627  for (a = s->ins; a != NULL; a = b)
628  {
629  b = a->inchain;
630  if (a->from != pre)
631  {
632  cparc(nfa, a, a->from, s2);
633  freearc(nfa, a);
634  }
635  }
636  s2 = (s->tmp != s) ? s->tmp : NULL;
637  s->tmp = NULL; /* clean up while we're at it */
638  }
639 }
640 
641 /*
642  * parse - parse an RE
643  *
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.
647  */
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 */
654 {
655  struct state *left; /* scaffolding for branch */
656  struct state *right;
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? */
661 
662  assert(stopper == ')' || stopper == EOS);
663 
664  branches = subre(v, '|', LONGER, init, final);
665  NOERRN();
666  branch = branches;
667  firstbranch = 1;
668  do
669  { /* a branch */
670  if (!firstbranch)
671  {
672  /* need a place to hang it */
673  branch->right = subre(v, '|', LONGER, init, final);
674  NOERRN();
675  branch = branch->right;
676  }
677  firstbranch = 0;
678  left = newstate(v->nfa);
679  right = newstate(v->nfa);
680  NOERRN();
681  EMPTYARC(init, left);
682  EMPTYARC(right, final);
683  NOERRN();
684  branch->left = parsebranch(v, stopper, type, left, right, 0);
685  NOERRN();
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;
690  } while (EAT('|'));
691  assert(SEE(stopper) || SEE(EOS));
692 
693  if (!SEE(stopper))
694  {
695  assert(stopper == ')' && SEE(EOS));
696  ERR(REG_EPAREN);
697  }
698 
699  /* optimize out simple cases */
700  if (branch == branches)
701  { /* only one branch */
702  assert(branch->right == NULL);
703  t = branch->left;
704  branch->left = NULL;
705  freesubre(v, branches);
706  branches = t;
707  }
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;
714  branches->op = '=';
715  }
716 
717  return branches;
718 }
719 
720 /*
721  * parsebranch - parse one branch of an RE
722  *
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.
726  */
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? */
734 {
735  struct state *lp; /* left end of current construct */
736  int seencontent; /* is there anything in this branch yet? */
737  struct subre *t;
738 
739  lp = left;
740  seencontent = 0;
741  t = subre(v, '=', 0, left, right); /* op '=' is tentative */
742  NOERRN();
743  while (!SEE('|') && !SEE(stopper) && !SEE(EOS))
744  {
745  if (seencontent)
746  { /* implicit concat operator */
747  lp = newstate(v->nfa);
748  NOERRN();
749  moveins(v->nfa, right, lp);
750  }
751  seencontent = 1;
752 
753  /* NB, recursion in parseqatom() may swallow rest of branch */
754  parseqatom(v, stopper, type, lp, right, t);
755  NOERRN();
756  }
757 
758  if (!seencontent)
759  { /* empty branch */
760  if (!partial)
761  NOTE(REG_UUNSPEC);
762  assert(lp == left);
763  EMPTYARC(left, right);
764  }
765 
766  return t;
767 }
768 
769 /*
770  * parseqatom - parse one quantified atom or constraint of an RE
771  *
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.
775  */
776 static void
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 */
783 {
784  struct state *s; /* temporaries for new states */
785  struct state *s2;
786 
787 #define ARCV(t, val) newarc(v->nfa, t, val, lp, rp)
788  int m,
789  n;
790  struct subre *atom; /* atom's subtree */
791  struct subre *t;
792  int cap; /* capturing parens? */
793  int latype; /* lookaround constraint type */
794  int subno; /* capturing-parens or backref number */
795  int atomtype;
796  int qprefer; /* quantifier short/long preference */
797  int f;
798  struct subre **atomp; /* where the pointer to atom is */
799 
800  /* initial bookkeeping */
801  atom = NULL;
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 */
805 
806  /* an atom or constraint... */
807  atomtype = v->nexttype;
808  switch (atomtype)
809  {
810  /* first, constraints, which end by returning */
811  case '^':
812  ARCV('^', 1);
813  if (v->cflags & REG_NLANCH)
814  ARCV(BEHIND, v->nlcolor);
815  NEXT();
816  return;
817  break;
818  case '$':
819  ARCV('$', 1);
820  if (v->cflags & REG_NLANCH)
821  ARCV(AHEAD, v->nlcolor);
822  NEXT();
823  return;
824  break;
825  case SBEGIN:
826  ARCV('^', 1); /* BOL */
827  ARCV('^', 0); /* or BOS */
828  NEXT();
829  return;
830  break;
831  case SEND:
832  ARCV('$', 1); /* EOL */
833  ARCV('$', 0); /* or EOS */
834  NEXT();
835  return;
836  break;
837  case '<':
838  wordchrs(v); /* does NEXT() */
839  s = newstate(v->nfa);
840  NOERR();
841  nonword(v, BEHIND, lp, s);
842  word(v, AHEAD, s, rp);
843  return;
844  break;
845  case '>':
846  wordchrs(v); /* does NEXT() */
847  s = newstate(v->nfa);
848  NOERR();
849  word(v, BEHIND, lp, s);
850  nonword(v, AHEAD, s, rp);
851  return;
852  break;
853  case WBDRY:
854  wordchrs(v); /* does NEXT() */
855  s = newstate(v->nfa);
856  NOERR();
857  nonword(v, BEHIND, lp, s);
858  word(v, AHEAD, s, rp);
859  s = newstate(v->nfa);
860  NOERR();
861  word(v, BEHIND, lp, s);
862  nonword(v, AHEAD, s, rp);
863  return;
864  break;
865  case NWBDRY:
866  wordchrs(v); /* does NEXT() */
867  s = newstate(v->nfa);
868  NOERR();
869  word(v, BEHIND, lp, s);
870  word(v, AHEAD, s, rp);
871  s = newstate(v->nfa);
872  NOERR();
873  nonword(v, BEHIND, lp, s);
874  nonword(v, AHEAD, s, rp);
875  return;
876  break;
877  case LACON: /* lookaround constraint */
878  latype = v->nextvalue;
879  NEXT();
880  s = newstate(v->nfa);
881  s2 = newstate(v->nfa);
882  NOERR();
883  t = parse(v, ')', LACON, s, s2);
884  freesubre(v, t); /* internal structure irrelevant */
885  NOERR();
886  assert(SEE(')'));
887  NEXT();
888  processlacon(v, s, s2, latype, lp, rp);
889  return;
890  break;
891  /* then errors, to get them out of the way */
892  case '*':
893  case '+':
894  case '?':
895  case '{':
896  ERR(REG_BADRPT);
897  return;
898  break;
899  default:
900  ERR(REG_ASSERT);
901  return;
902  break;
903  /* then plain characters, and minor variants on that theme */
904  case ')': /* unbalanced paren */
905  if ((v->cflags & REG_ADVANCED) != REG_EXTENDED)
906  {
907  ERR(REG_EPAREN);
908  return;
909  }
910  /* legal in EREs due to specification botch */
911  NOTE(REG_UPBOTCH);
912  /* fallthrough into case PLAIN */
913  case PLAIN:
914  onechr(v, v->nextvalue, lp, rp);
915  okcolors(v->nfa, v->cm);
916  NOERR();
917  NEXT();
918  break;
919  case '[':
920  if (v->nextvalue == 1)
921  bracket(v, lp, rp);
922  else
923  cbracket(v, lp, rp);
924  assert(SEE(']') || ISERR());
925  NEXT();
926  break;
927  case '.':
928  rainbow(v->nfa, v->cm, PLAIN,
929  (v->cflags & REG_NLSTOP) ? v->nlcolor : COLORLESS,
930  lp, rp);
931  NEXT();
932  break;
933  /* and finally the ugly stuff */
934  case '(': /* value flags as capturing or non */
935  cap = (type == LACON) ? 0 : v->nextvalue;
936  if (cap)
937  {
938  v->nsubexp++;
939  subno = v->nsubexp;
940  if ((size_t) subno >= v->nsubs)
941  moresubs(v, subno);
942  assert((size_t) subno < v->nsubs);
943  }
944  else
945  atomtype = PLAIN; /* something that's not '(' */
946  NEXT();
947  /* need new endpoints because tree will contain pointers */
948  s = newstate(v->nfa);
949  s2 = newstate(v->nfa);
950  NOERR();
951  EMPTYARC(lp, s);
952  EMPTYARC(s2, rp);
953  NOERR();
954  atom = parse(v, ')', type, s, s2);
955  assert(SEE(')') || ISERR());
956  NEXT();
957  NOERR();
958  if (cap)
959  {
960  v->subs[subno] = atom;
961  t = subre(v, '(', atom->flags | CAP, lp, rp);
962  NOERR();
963  t->subno = subno;
964  t->left = atom;
965  atom = t;
966  }
967  /* postpone everything else pending possible {0} */
968  break;
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);
973  NOERR();
974  assert(v->nextvalue > 0);
975  atom = subre(v, 'b', BACKR, lp, rp);
976  NOERR();
977  subno = v->nextvalue;
978  atom->subno = subno;
979  EMPTYARC(lp, rp); /* temporarily, so there's something */
980  NEXT();
981  break;
982  }
983 
984  /* ...and an atom may be followed by a quantifier */
985  switch (v->nexttype)
986  {
987  case '*':
988  m = 0;
989  n = DUPINF;
990  qprefer = (v->nextvalue) ? LONGER : SHORTER;
991  NEXT();
992  break;
993  case '+':
994  m = 1;
995  n = DUPINF;
996  qprefer = (v->nextvalue) ? LONGER : SHORTER;
997  NEXT();
998  break;
999  case '?':
1000  m = 0;
1001  n = 1;
1002  qprefer = (v->nextvalue) ? LONGER : SHORTER;
1003  NEXT();
1004  break;
1005  case '{':
1006  NEXT();
1007  m = scannum(v);
1008  if (EAT(','))
1009  {
1010  if (SEE(DIGIT))
1011  n = scannum(v);
1012  else
1013  n = DUPINF;
1014  if (m > n)
1015  {
1016  ERR(REG_BADBR);
1017  return;
1018  }
1019  /* {m,n} exercises preference, even if it's {m,m} */
1020  qprefer = (v->nextvalue) ? LONGER : SHORTER;
1021  }
1022  else
1023  {
1024  n = m;
1025  /* {m} passes operand's preference through */
1026  qprefer = 0;
1027  }
1028  if (!SEE('}'))
1029  { /* catches errors too */
1030  ERR(REG_BADBR);
1031  return;
1032  }
1033  NEXT();
1034  break;
1035  default: /* no quantifier */
1036  m = n = 1;
1037  qprefer = 0;
1038  break;
1039  }
1040 
1041  /* annoying special case: {0} or {0,0} cancels everything */
1042  if (m == 0 && n == 0)
1043  {
1044  if (atom != NULL)
1045  freesubre(v, atom);
1046  if (atomtype == '(')
1047  v->subs[subno] = NULL;
1048  delsub(v->nfa, lp, rp);
1049  EMPTYARC(lp, rp);
1050  return;
1051  }
1052 
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)))
1057  {
1058  if (!(m == 1 && n == 1))
1059  repeat(v, lp, rp, m, n);
1060  if (atom != NULL)
1061  freesubre(v, atom);
1062  top->flags = f;
1063  return;
1064  }
1065 
1066  /*
1067  * hard part: something messy
1068  *
1069  * That is, capturing parens, back reference, short/long clash, or an atom
1070  * with substructure containing one of those.
1071  */
1072 
1073  /* now we'll need a subre for the contents even if they're boring */
1074  if (atom == NULL)
1075  {
1076  atom = subre(v, '=', 0, lp, rp);
1077  NOERR();
1078  }
1079 
1080  /*----------
1081  * Prepare a general-purpose state skeleton.
1082  *
1083  * In the no-backrefs case, we want this:
1084  *
1085  * [lp] ---> [s] ---prefix---> [begin] ---atom---> [end] ---rest---> [rp]
1086  *
1087  * where prefix is some repetitions of atom. In the general case we need
1088  *
1089  * [lp] ---> [s] ---iterator---> [s2] ---rest---> [rp]
1090  *
1091  * where the iterator wraps around [begin] ---atom---> [end]
1092  *
1093  * We make the s state here for both cases; s2 is made below if needed
1094  *----------
1095  */
1096  s = newstate(v->nfa); /* first, new endpoints for the atom */
1097  s2 = newstate(v->nfa);
1098  NOERR();
1099  moveouts(v->nfa, lp, s);
1100  moveins(v->nfa, rp, s2);
1101  NOERR();
1102  atom->begin = s;
1103  atom->end = s2;
1104  s = newstate(v->nfa); /* set up starting state */
1105  NOERR();
1106  EMPTYARC(lp, s);
1107  NOERR();
1108 
1109  /* break remaining subRE into x{...} and what follows */
1110  t = subre(v, '.', COMBINE(qprefer, atom->flags), lp, rp);
1111  NOERR();
1112  t->left = atom;
1113  atomp = &t->left;
1114 
1115  /* here we should recurse... but we must postpone that to the end */
1116 
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);
1120  NOERR();
1121  top->op = '.';
1122  top->right = t;
1123 
1124  /* if it's a backref, now is the time to replicate the subNFA */
1125  if (atomtype == BACKREF)
1126  {
1127  assert(atom->begin->nouts == 1); /* just the EMPTY */
1128  delsub(v->nfa, atom->begin, atom->end);
1129  assert(v->subs[subno] != NULL);
1130 
1131  /*
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.
1135  */
1136  dupnfa(v->nfa, v->subs[subno]->begin, v->subs[subno]->end,
1137  atom->begin, atom->end);
1138  NOERR();
1139  }
1140 
1141  /*
1142  * It's quantifier time. If the atom is just a backref, we'll let it deal
1143  * with quantifiers internally.
1144  */
1145  if (atomtype == BACKREF)
1146  {
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 */
1155  s2 = atom->end;
1156  }
1157  else if (m == 1 && n == 1)
1158  {
1159  /* no/vacuous quantifier: done */
1160  EMPTYARC(s, atom->begin); /* empty prefix */
1161  /* rest of branch can be strung starting from atom->end */
1162  s2 = atom->end;
1163  }
1164  else if (m > 0 && !(atom->flags & BACKR))
1165  {
1166  /*
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.
1173  */
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 */
1179  NOERR();
1180  t->left = subre(v, '=', PREF(f), s, atom->begin);
1181  NOERR();
1182  t->right = atom;
1183  *atomp = t;
1184  /* rest of branch can be strung starting from atom->end */
1185  s2 = atom->end;
1186  }
1187  else
1188  {
1189  /* general case: need an iteration node */
1190  s2 = newstate(v->nfa);
1191  NOERR();
1192  moveouts(v->nfa, atom->end, s2);
1193  NOERR();
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);
1198  NOERR();
1199  t->min = (short) m;
1200  t->max = (short) n;
1201  t->left = atom;
1202  *atomp = t;
1203  /* rest of branch is to be strung from iteration's end state */
1204  }
1205 
1206  /* and finally, look after that postponed recursion */
1207  t = top->right;
1208  if (!(SEE('|') || SEE(stopper) || SEE(EOS)))
1209  t->right = parsebranch(v, stopper, type, s2, rp, 1);
1210  else
1211  {
1212  EMPTYARC(s2, rp);
1213  t->right = subre(v, '=', 0, s2, rp);
1214  }
1215  NOERR();
1216  assert(SEE('|') || SEE(stopper) || SEE(EOS));
1217  t->flags |= COMBINE(t->flags, t->right->flags);
1218  top->flags |= COMBINE(top->flags, t->flags);
1219 }
1220 
1221 /*
1222  * nonword - generate arcs for non-word-character ahead or behind
1223  */
1224 static void
1225 nonword(struct vars * v,
1226  int dir, /* AHEAD or BEHIND */
1227  struct state * lp,
1228  struct state * rp)
1229 {
1230  int anchor = (dir == AHEAD) ? '$' : '^';
1231 
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) */
1237 }
1238 
1239 /*
1240  * word - generate arcs for word character ahead or behind
1241  */
1242 static void
1243 word(struct vars * v,
1244  int dir, /* AHEAD or BEHIND */
1245  struct state * lp,
1246  struct state * rp)
1247 {
1248  assert(dir == AHEAD || dir == BEHIND);
1249  cloneouts(v->nfa, v->wordchrs, lp, rp, dir);
1250  /* (no need for special attention to \n) */
1251 }
1252 
1253 /*
1254  * scannum - scan a number
1255  */
1256 static int /* value, <= DUPMAX */
1257 scannum(struct vars * v)
1258 {
1259  int n = 0;
1260 
1261  while (SEE(DIGIT) && n < DUPMAX)
1262  {
1263  n = n * 10 + v->nextvalue;
1264  NEXT();
1265  }
1266  if (SEE(DIGIT) || n > DUPMAX)
1267  {
1268  ERR(REG_BADBR);
1269  return 0;
1270  }
1271  return n;
1272 }
1273 
1274 /*
1275  * repeat - replicate subNFA for quantifiers
1276  *
1277  * The sub-NFA strung from lp to rp is modified to represent m to n
1278  * repetitions of its initial contents.
1279  *
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.
1286  */
1287 static void
1288 repeat(struct vars * v,
1289  struct state * lp,
1290  struct state * rp,
1291  int m,
1292  int n)
1293 {
1294 #define SOME 2
1295 #define INF 3
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);
1300  struct state *s;
1301  struct state *s2;
1302 
1303  switch (PAIR(rm, rn))
1304  {
1305  case PAIR(0, 0): /* empty string */
1306  delsub(v->nfa, lp, rp);
1307  EMPTYARC(lp, rp);
1308  break;
1309  case PAIR(0, 1): /* do as x| */
1310  EMPTYARC(lp, rp);
1311  break;
1312  case PAIR(0, SOME): /* do as x{1,n}| */
1313  repeat(v, lp, rp, 1, n);
1314  NOERR();
1315  EMPTYARC(lp, rp);
1316  break;
1317  case PAIR(0, INF): /* loop x around */
1318  s = newstate(v->nfa);
1319  NOERR();
1320  moveouts(v->nfa, lp, s);
1321  moveins(v->nfa, rp, s);
1322  EMPTYARC(lp, s);
1323  EMPTYARC(s, rp);
1324  break;
1325  case PAIR(1, 1): /* no action required */
1326  break;
1327  case PAIR(1, SOME): /* do as x{0,n-1}x = (x{1,n-1}|)x */
1328  s = newstate(v->nfa);
1329  NOERR();
1330  moveouts(v->nfa, lp, s);
1331  dupnfa(v->nfa, s, rp, lp, s);
1332  NOERR();
1333  repeat(v, lp, s, 1, n - 1);
1334  NOERR();
1335  EMPTYARC(lp, s);
1336  break;
1337  case PAIR(1, INF): /* add loopback arc */
1338  s = newstate(v->nfa);
1339  s2 = newstate(v->nfa);
1340  NOERR();
1341  moveouts(v->nfa, lp, s);
1342  moveins(v->nfa, rp, s2);
1343  EMPTYARC(lp, s);
1344  EMPTYARC(s2, rp);
1345  EMPTYARC(s2, s);
1346  break;
1347  case PAIR(SOME, SOME): /* do as x{m-1,n-1}x */
1348  s = newstate(v->nfa);
1349  NOERR();
1350  moveouts(v->nfa, lp, s);
1351  dupnfa(v->nfa, s, rp, lp, s);
1352  NOERR();
1353  repeat(v, lp, s, m - 1, n - 1);
1354  break;
1355  case PAIR(SOME, INF): /* do as x{m-1,}x */
1356  s = newstate(v->nfa);
1357  NOERR();
1358  moveouts(v->nfa, lp, s);
1359  dupnfa(v->nfa, s, rp, lp, s);
1360  NOERR();
1361  repeat(v, lp, s, m - 1, n);
1362  break;
1363  default:
1364  ERR(REG_ASSERT);
1365  break;
1366  }
1367 }
1368 
1369 /*
1370  * bracket - handle non-complemented bracket expression
1371  * Also called from cbracket for complemented bracket expressions.
1372  */
1373 static void
1374 bracket(struct vars * v,
1375  struct state * lp,
1376  struct state * rp)
1377 {
1378  assert(SEE('['));
1379  NEXT();
1380  while (!SEE(']') && !SEE(EOS))
1381  brackpart(v, lp, rp);
1382  assert(SEE(']') || ISERR());
1383  okcolors(v->nfa, v->cm);
1384 }
1385 
1386 /*
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.
1391  */
1392 static void
1393 cbracket(struct vars * v,
1394  struct state * lp,
1395  struct state * rp)
1396 {
1397  struct state *left = newstate(v->nfa);
1398  struct state *right = newstate(v->nfa);
1399 
1400  NOERR();
1401  bracket(v, left, right);
1402  if (v->cflags & REG_NLSTOP)
1403  newarc(v->nfa, PLAIN, v->nlcolor, left, right);
1404  NOERR();
1405 
1406  assert(lp->nouts == 0); /* all outarcs will be ours */
1407 
1408  /*
1409  * Easy part of complementing, and all there is to do since the MCCE code
1410  * was removed.
1411  */
1412  colorcomplement(v->nfa, v->cm, PLAIN, left, lp, rp);
1413  NOERR();
1414  dropstate(v->nfa, left);
1415  assert(right->nins == 0);
1416  freestate(v->nfa, right);
1417 }
1418 
1419 /*
1420  * brackpart - handle one item (or range) within a bracket expression
1421  */
1422 static void
1423 brackpart(struct vars * v,
1424  struct state * lp,
1425  struct state * rp)
1426 {
1427  chr startc;
1428  chr endc;
1429  struct cvec *cv;
1430  const chr *startp;
1431  const chr *endp;
1432  chr c[1];
1433 
1434  /* parse something, get rid of special cases, take shortcuts */
1435  switch (v->nexttype)
1436  {
1437  case RANGE: /* a-b-c or other botch */
1438  ERR(REG_ERANGE);
1439  return;
1440  break;
1441  case PLAIN:
1442  c[0] = v->nextvalue;
1443  NEXT();
1444  /* shortcut for ordinary chr (not range) */
1445  if (!SEE(RANGE))
1446  {
1447  onechr(v, c[0], lp, rp);
1448  return;
1449  }
1450  startc = element(v, c, c + 1);
1451  NOERR();
1452  break;
1453  case COLLEL:
1454  startp = v->now;
1455  endp = scanplain(v);
1456  INSIST(startp < endp, REG_ECOLLATE);
1457  NOERR();
1458  startc = element(v, startp, endp);
1459  NOERR();
1460  break;
1461  case ECLASS:
1462  startp = v->now;
1463  endp = scanplain(v);
1464  INSIST(startp < endp, REG_ECOLLATE);
1465  NOERR();
1466  startc = element(v, startp, endp);
1467  NOERR();
1468  cv = eclass(v, startc, (v->cflags & REG_ICASE));
1469  NOERR();
1470  subcolorcvec(v, cv, lp, rp);
1471  return;
1472  break;
1473  case CCLASS:
1474  startp = v->now;
1475  endp = scanplain(v);
1476  INSIST(startp < endp, REG_ECTYPE);
1477  NOERR();
1478  cv = cclass(v, startp, endp, (v->cflags & REG_ICASE));
1479  NOERR();
1480  subcolorcvec(v, cv, lp, rp);
1481  return;
1482  break;
1483  default:
1484  ERR(REG_ASSERT);
1485  return;
1486  break;
1487  }
1488 
1489  if (SEE(RANGE))
1490  {
1491  NEXT();
1492  switch (v->nexttype)
1493  {
1494  case PLAIN:
1495  case RANGE:
1496  c[0] = v->nextvalue;
1497  NEXT();
1498  endc = element(v, c, c + 1);
1499  NOERR();
1500  break;
1501  case COLLEL:
1502  startp = v->now;
1503  endp = scanplain(v);
1504  INSIST(startp < endp, REG_ECOLLATE);
1505  NOERR();
1506  endc = element(v, startp, endp);
1507  NOERR();
1508  break;
1509  default:
1510  ERR(REG_ERANGE);
1511  return;
1512  break;
1513  }
1514  }
1515  else
1516  endc = startc;
1517 
1518  /*
1519  * Ranges are unportable. Actually, standard C does guarantee that digits
1520  * are contiguous, but making that an exception is just too complicated.
1521  */
1522  if (startc != endc)
1523  NOTE(REG_UUNPORT);
1524  cv = range(v, startc, endc, (v->cflags & REG_ICASE));
1525  NOERR();
1526  subcolorcvec(v, cv, lp, rp);
1527 }
1528 
1529 /*
1530  * scanplain - scan PLAIN contents of [. etc.
1531  *
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.
1534  */
1535 static const chr * /* just after end of sequence */
1536 scanplain(struct vars * v)
1537 {
1538  const chr *endp;
1539 
1540  assert(SEE(COLLEL) || SEE(ECLASS) || SEE(CCLASS));
1541  NEXT();
1542 
1543  endp = v->now;
1544  while (SEE(PLAIN))
1545  {
1546  endp = v->now;
1547  NEXT();
1548  }
1549 
1550  assert(SEE(END) || ISERR());
1551  NEXT();
1552 
1553  return endp;
1554 }
1555 
1556 /*
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.
1559  */
1560 static void
1561 onechr(struct vars * v,
1562  chr c,
1563  struct state * lp,
1564  struct state * rp)
1565 {
1566  if (!(v->cflags & REG_ICASE))
1567  {
1568  color lastsubcolor = COLORLESS;
1569 
1570  subcoloronechr(v, c, lp, rp, &lastsubcolor);
1571  return;
1572  }
1573 
1574  /* rats, need general case anyway... */
1575  subcolorcvec(v, allcases(v, c), lp, rp);
1576 }
1577 
1578 /*
1579  * wordchrs - set up word-chr list for word-boundary stuff, if needed
1580  *
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.
1586  */
1587 static void
1588 wordchrs(struct vars * v)
1589 {
1590  struct state *left;
1591  struct state *right;
1592 
1593  if (v->wordchrs != NULL)
1594  {
1595  NEXT(); /* for consistency */
1596  return;
1597  }
1598 
1599  left = newstate(v->nfa);
1600  right = newstate(v->nfa);
1601  NOERR();
1602  /* fine point: implemented with [::], and lexer will set REG_ULOCALE */
1603  lexword(v);
1604  NEXT();
1605  assert(v->savenow != NULL && SEE('['));
1606  bracket(v, left, right);
1607  assert((v->savenow != NULL && SEE(']')) || ISERR());
1608  NEXT();
1609  NOERR();
1610  v->wordchrs = left;
1611 }
1612 
1613 /*
1614  * processlacon - generate the NFA representation of a LACON
1615  *
1616  * In the general case this is just newlacon() + newarc(), but some cases
1617  * can be optimized.
1618  */
1619 static void
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 */
1623  int latype,
1624  struct state * lp, /* left state to hang it on */
1625  struct state * rp) /* right state to hang it on */
1626 {
1627  struct state *s1;
1628  int n;
1629 
1630  /*
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.
1633  */
1634  s1 = single_color_transition(begin, end);
1635  switch (latype)
1636  {
1637  case LATYPE_AHEAD_POS:
1638  /* If lookahead RE is just colorset C, convert to AHEAD(C) */
1639  if (s1 != NULL)
1640  {
1641  cloneouts(v->nfa, s1, lp, rp, AHEAD);
1642  return;
1643  }
1644  break;
1645  case LATYPE_AHEAD_NEG:
1646  /* If lookahead RE is just colorset C, convert to AHEAD(^C)|$ */
1647  if (s1 != NULL)
1648  {
1649  colorcomplement(v->nfa, v->cm, AHEAD, s1, lp, rp);
1650  newarc(v->nfa, '$', 1, lp, rp);
1651  newarc(v->nfa, '$', 0, lp, rp);
1652  return;
1653  }
1654  break;
1655  case LATYPE_BEHIND_POS:
1656  /* If lookbehind RE is just colorset C, convert to BEHIND(C) */
1657  if (s1 != NULL)
1658  {
1659  cloneouts(v->nfa, s1, lp, rp, BEHIND);
1660  return;
1661  }
1662  break;
1663  case LATYPE_BEHIND_NEG:
1664  /* If lookbehind RE is just colorset C, convert to BEHIND(^C)|^ */
1665  if (s1 != NULL)
1666  {
1667  colorcomplement(v->nfa, v->cm, BEHIND, s1, lp, rp);
1668  newarc(v->nfa, '^', 1, lp, rp);
1669  newarc(v->nfa, '^', 0, lp, rp);
1670  return;
1671  }
1672  break;
1673  default:
1674  assert(NOTREACHED);
1675  }
1676 
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);
1680 }
1681 
1682 /*
1683  * subre - allocate a subre
1684  */
1685 static struct subre *
1686 subre(struct vars * v,
1687  int op,
1688  int flags,
1689  struct state * begin,
1690  struct state * end)
1691 {
1692  struct subre *ret = v->treefree;
1693 
1694  /*
1695  * Checking for stack overflow here is sufficient to protect parse() and
1696  * its recursive subroutines.
1697  */
1698  if (STACK_TOO_DEEP(v->re))
1699  {
1700  ERR(REG_ETOOBIG);
1701  return NULL;
1702  }
1703 
1704  if (ret != NULL)
1705  v->treefree = ret->left;
1706  else
1707  {
1708  ret = (struct subre *) MALLOC(sizeof(struct subre));
1709  if (ret == NULL)
1710  {
1711  ERR(REG_ESPACE);
1712  return NULL;
1713  }
1714  ret->chain = v->treechain;
1715  v->treechain = ret;
1716  }
1717 
1718  assert(strchr("=b|.*(", op) != NULL);
1719 
1720  ret->op = op;
1721  ret->flags = flags;
1722  ret->id = 0; /* will be assigned later */
1723  ret->subno = 0;
1724  ret->min = ret->max = 1;
1725  ret->left = NULL;
1726  ret->right = NULL;
1727  ret->begin = begin;
1728  ret->end = end;
1729  ZAPCNFA(ret->cnfa);
1730 
1731  return ret;
1732 }
1733 
1734 /*
1735  * freesubre - free a subRE subtree
1736  */
1737 static void
1738 freesubre(struct vars * v, /* might be NULL */
1739  struct subre * sr)
1740 {
1741  if (sr == NULL)
1742  return;
1743 
1744  if (sr->left != NULL)
1745  freesubre(v, sr->left);
1746  if (sr->right != NULL)
1747  freesubre(v, sr->right);
1748 
1749  freesrnode(v, sr);
1750 }
1751 
1752 /*
1753  * freesrnode - free one node in a subRE subtree
1754  */
1755 static void
1756 freesrnode(struct vars * v, /* might be NULL */
1757  struct subre * sr)
1758 {
1759  if (sr == NULL)
1760  return;
1761 
1762  if (!NULLCNFA(sr->cnfa))
1763  freecnfa(&sr->cnfa);
1764  sr->flags = 0;
1765 
1766  if (v != NULL && v->treechain != NULL)
1767  {
1768  /* we're still parsing, maybe we can reuse the subre */
1769  sr->left = v->treefree;
1770  v->treefree = sr;
1771  }
1772  else
1773  FREE(sr);
1774 }
1775 
1776 /*
1777  * optst - optimize a subRE subtree
1778  */
1779 static void
1780 optst(struct vars * v,
1781  struct subre * t)
1782 {
1783  /*
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.
1788  */
1789  return;
1790 }
1791 
1792 /*
1793  * numst - number tree nodes (assigning "id" indexes)
1794  */
1795 static int /* next number */
1796 numst(struct subre * t,
1797  int start) /* starting point for subtree numbers */
1798 {
1799  int i;
1800 
1801  assert(t != NULL);
1802 
1803  i = start;
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);
1809  return i;
1810 }
1811 
1812 /*
1813  * markst - mark tree nodes as INUSE
1814  *
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.
1828  */
1829 static void
1830 markst(struct subre * t)
1831 {
1832  assert(t != NULL);
1833 
1834  t->flags |= INUSE;
1835  if (t->left != NULL)
1836  markst(t->left);
1837  if (t->right != NULL)
1838  markst(t->right);
1839 }
1840 
1841 /*
1842  * cleanst - free any tree nodes not marked INUSE
1843  */
1844 static void
1845 cleanst(struct vars * v)
1846 {
1847  struct subre *t;
1848  struct subre *next;
1849 
1850  for (t = v->treechain; t != NULL; t = next)
1851  {
1852  next = t->chain;
1853  if (!(t->flags & INUSE))
1854  FREE(t);
1855  }
1856  v->treechain = NULL;
1857  v->treefree = NULL; /* just on general principles */
1858 }
1859 
1860 /*
1861  * nfatree - turn a subRE subtree into a tree of compacted NFAs
1862  */
1863 static long /* optimize results from top node */
1864 nfatree(struct vars * v,
1865  struct subre * t,
1866  FILE *f) /* for debug output */
1867 {
1868  assert(t != NULL && t->begin != NULL);
1869 
1870  if (t->left != NULL)
1871  (DISCARD) nfatree(v, t->left, f);
1872  if (t->right != NULL)
1873  (DISCARD) nfatree(v, t->right, f);
1874 
1875  return nfanode(v, t, 0, f);
1876 }
1877 
1878 /*
1879  * nfanode - do one NFA for nfatree or lacons
1880  *
1881  * If converttosearch is true, apply makesearch() to the NFA.
1882  */
1883 static long /* optimize results */
1884 nfanode(struct vars * v,
1885  struct subre * t,
1886  int converttosearch,
1887  FILE *f) /* for debug output */
1888 {
1889  struct nfa *nfa;
1890  long ret = 0;
1891 
1892  assert(t->begin != NULL);
1893 
1894 #ifdef REG_DEBUG
1895  if (f != NULL)
1896  {
1897  char idbuf[50];
1898 
1899  fprintf(f, "\n\n\n========= TREE NODE %s ==========\n",
1900  stid(t, idbuf, sizeof(idbuf)));
1901  }
1902 #endif
1903  nfa = newnfa(v, v->cm, v->nfa);
1904  NOERRZ();
1905  dupnfa(nfa, t->begin, t->end, nfa->init, nfa->final);
1906  if (!ISERR())
1907  specialcolors(nfa);
1908  if (!ISERR())
1909  ret = optimize(nfa, f);
1910  if (converttosearch && !ISERR())
1911  makesearch(v, nfa);
1912  if (!ISERR())
1913  compact(nfa, &t->cnfa);
1914 
1915  freenfa(nfa);
1916  return ret;
1917 }
1918 
1919 /*
1920  * newlacon - allocate a lookaround-constraint subRE
1921  */
1922 static int /* lacon number */
1923 newlacon(struct vars * v,
1924  struct state * begin,
1925  struct state * end,
1926  int latype)
1927 {
1928  int n;
1929  struct subre *newlacons;
1930  struct subre *sub;
1931 
1932  if (v->nlacons == 0)
1933  {
1934  n = 1; /* skip 0th */
1935  newlacons = (struct subre *) MALLOC(2 * sizeof(struct subre));
1936  }
1937  else
1938  {
1939  n = v->nlacons;
1940  newlacons = (struct subre *) REALLOC(v->lacons,
1941  (n + 1) * sizeof(struct subre));
1942  }
1943  if (newlacons == NULL)
1944  {
1945  ERR(REG_ESPACE);
1946  return 0;
1947  }
1948  v->lacons = newlacons;
1949  v->nlacons = n + 1;
1950  sub = &v->lacons[n];
1951  sub->begin = begin;
1952  sub->end = end;
1953  sub->subno = latype;
1954  ZAPCNFA(sub->cnfa);
1955  return n;
1956 }
1957 
1958 /*
1959  * freelacons - free lookaround-constraint subRE vector
1960  */
1961 static void
1962 freelacons(struct subre * subs,
1963  int n)
1964 {
1965  struct subre *sub;
1966  int i;
1967 
1968  assert(n > 0);
1969  for (sub = subs + 1, i = n - 1; i > 0; sub++, i--) /* no 0th */
1970  if (!NULLCNFA(sub->cnfa))
1971  freecnfa(&sub->cnfa);
1972  FREE(subs);
1973 }
1974 
1975 /*
1976  * rfree - free a whole RE (insides of regfree)
1977  */
1978 static void
1980 {
1981  struct guts *g;
1982 
1983  if (re == NULL || re->re_magic != REMAGIC)
1984  return;
1985 
1986  re->re_magic = 0; /* invalidate RE */
1987  g = (struct guts *) re->re_guts;
1988  re->re_guts = NULL;
1989  re->re_fns = NULL;
1990  if (g != NULL)
1991  {
1992  g->magic = 0;
1993  freecm(&g->cmap);
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);
2000  FREE(g);
2001  }
2002 }
2003 
2004 /*
2005  * rcancelrequested - check for external request to cancel regex operation
2006  *
2007  * Return nonzero to fail the operation with error code REG_CANCEL,
2008  * zero to keep going
2009  *
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.
2013  */
2014 static int
2016 {
2018 }
2019 
2020 /*
2021  * rstacktoodeep - check for stack getting dangerously deep
2022  *
2023  * Return nonzero to fail the operation with error code REG_ETOOBIG,
2024  * zero to keep going
2025  *
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.
2029  */
2030 static int
2032 {
2033  return stack_is_too_deep();
2034 }
2035 
2036 #ifdef REG_DEBUG
2037 
2038 /*
2039  * dump - dump an RE in human-readable form
2040  */
2041 static void
2042 dump(regex_t *re,
2043  FILE *f)
2044 {
2045  struct guts *g;
2046  int i;
2047 
2048  if (re->re_magic != REMAGIC)
2049  fprintf(f, "bad magic number (0x%x not 0x%x)\n", re->re_magic,
2050  REMAGIC);
2051  if (re->re_guts == NULL)
2052  {
2053  fprintf(f, "NULL guts!!!\n");
2054  return;
2055  }
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,
2059  GUTSMAGIC);
2060 
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);
2064 
2065  dumpcolors(&g->cmap, f);
2066  if (!NULLCNFA(g->search))
2067  {
2068  fprintf(f, "\nsearch:\n");
2069  dumpcnfa(&g->search, f);
2070  }
2071  for (i = 1; i < g->nlacons; i++)
2072  {
2073  struct subre *lasub = &g->lacons[i];
2074  const char *latype;
2075 
2076  switch (lasub->subno)
2077  {
2078  case LATYPE_AHEAD_POS:
2079  latype = "positive lookahead";
2080  break;
2081  case LATYPE_AHEAD_NEG:
2082  latype = "negative lookahead";
2083  break;
2084  case LATYPE_BEHIND_POS:
2085  latype = "positive lookbehind";
2086  break;
2087  case LATYPE_BEHIND_NEG:
2088  latype = "negative lookbehind";
2089  break;
2090  default:
2091  latype = "???";
2092  break;
2093  }
2094  fprintf(f, "\nla%d (%s):\n", i, latype);
2095  dumpcnfa(&lasub->cnfa, f);
2096  }
2097  fprintf(f, "\n");
2098  dumpst(g->tree, f, 0);
2099 }
2100 
2101 /*
2102  * dumpst - dump a subRE tree
2103  */
2104 static void
2105 dumpst(struct subre * t,
2106  FILE *f,
2107  int nfapresent) /* is the original NFA still around? */
2108 {
2109  if (t == NULL)
2110  fprintf(f, "null tree\n");
2111  else
2112  stdump(t, f, nfapresent);
2113  fflush(f);
2114 }
2115 
2116 /*
2117  * stdump - recursive guts of dumpst
2118  */
2119 static void
2120 stdump(struct subre * t,
2121  FILE *f,
2122  int nfapresent) /* is the original NFA still around? */
2123 {
2124  char idbuf[50];
2125 
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");
2133  if (t->flags & CAP)
2134  fprintf(f, " hascapture");
2135  if (t->flags & BACKR)
2136  fprintf(f, " hasbackref");
2137  if (!(t->flags & INUSE))
2138  fprintf(f, " UNUSED");
2139  if (t->subno != 0)
2140  fprintf(f, " (#%d)", t->subno);
2141  if (t->min != 1 || t->max != 1)
2142  {
2143  fprintf(f, " {%d,", t->min);
2144  if (t->max != DUPINF)
2145  fprintf(f, "%d", t->max);
2146  fprintf(f, "}");
2147  }
2148  if (nfapresent)
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))
2155  {
2156  fprintf(f, "\n");
2157  dumpcnfa(&t->cnfa, f);
2158  }
2159  fprintf(f, "\n");
2160  if (t->left != NULL)
2161  stdump(t->left, f, nfapresent);
2162  if (t->right != NULL)
2163  stdump(t->right, f, nfapresent);
2164 }
2165 
2166 /*
2167  * stid - identify a subtree node for dumping
2168  */
2169 static const char * /* points to buf or constant string */
2170 stid(struct subre * t,
2171  char *buf,
2172  size_t bufsize)
2173 {
2174  /* big enough for hex int or decimal t->id? */
2175  if (bufsize < sizeof(void *) * 2 + 3 || bufsize < sizeof(t->id) * 3 + 1)
2176  return "unable";
2177  if (t->id != 0)
2178  sprintf(buf, "%d", t->id);
2179  else
2180  sprintf(buf, "%p", t);
2181  return buf;
2182 }
2183 #endif /* REG_DEBUG */
2184 
2185 
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"
#define REG_USHORTEST
Definition: regex.h:73
static color newcolor(struct colormap *)
#define EAT(t)
Definition: regcomp.c:260
static void subcolorcvec(struct vars *, struct cvec *, struct state *, struct state *)
#define RANGE
Definition: regcomp.c:283
static int scannum(struct vars *)
Definition: regcomp.c:1257
#define PAIR(x, y)
#define REG_ESUBREG
Definition: regex.h:143
static int isconstraintarc(struct arc *)
static chr newline(void)
static void cloneouts(struct nfa *, struct state *, struct state *, struct state *, int)
int nexttype
Definition: regcomp.c:234
static int pg_wc_islower(pg_wchar c)
struct subre * treefree
Definition: regcomp.c:247
int no
Definition: regguts.h:300
static void sortouts(struct nfa *, struct state *)
static void optst(struct vars *, struct subre *)
Definition: regcomp.c:1780
#define REG_NLSTOP
Definition: regex.h:109
static void cparc(struct nfa *, struct arc *, struct state *, struct state *)
static int lexescape(struct vars *)
struct state * from
Definition: regguts.h:280
#define END
Definition: regcomp.c:282
char * re_fns
Definition: regex.h:79
static int pg_wc_isgraph(pg_wchar c)
static void okcolors(struct nfa *, struct colormap *)
static void lexword(struct vars *)
#define CCLASS
Definition: regcomp.c:281
static void changearctarget(struct arc *, struct state *)
int type
Definition: regguts.h:278
static void destroystate(struct nfa *, struct state *)
static void freelacons(struct subre *, int)
Definition: regcomp.c:1962
static int numst(struct subre *, int)
Definition: regcomp.c:1796
static long optimize(struct nfa *, FILE *)
int ntree
Definition: regcomp.c:248
chr nextvalue
Definition: regcomp.c:235
static void rfree(regex_t *)
Definition: regcomp.c:1979
#define DUPMAX
Definition: regguts.h:93
static int brenext(struct vars *, chr)
#define REG_EPAREN
Definition: regex.h:145
struct subre * lacons
Definition: regguts.h:474
#define NOERRN()
Definition: regcomp.c:267
static chr element(struct vars *, const chr *, const chr *)
static int rcancelrequested(void)
Definition: regcomp.c:2015
static void bracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1374
struct subre * tree
Definition: regguts.h:469
struct state * final
Definition: regguts.h:319
static long nfatree(struct vars *, struct subre *, FILE *)
Definition: regcomp.c:1864
struct subre * treechain
Definition: regcomp.c:246
static chr lexdigits(struct vars *, int, int, int)
#define REDUCE(x)
static void freecm(struct colormap *)
static void nonword(struct vars *, int, struct state *, struct state *)
Definition: regcomp.c:1225
static void mergeins(struct nfa *, struct state *, struct arc **, int)
static int pg_wc_isspace(pg_wchar c)
struct subre * right
Definition: regguts.h:432
#define REG_ESPACE
Definition: regex.h:149
static int cclass_column_index(struct colormap *, chr)
int subno
Definition: regguts.h:427
static int freev(struct vars *, int)
Definition: regcomp.c:531
Definition: regguts.h:276
static void carcsort(struct carc *, size_t)
static void specialcolors(struct nfa *)
#define REG_QUOTE
Definition: regex.h:104
static void prefixes(struct vars *)
#define NEXT()
Definition: regcomp.c:258
#define NULLCNFA(cnfa)
Definition: regguts.h:372
const chr * savenow
Definition: regcomp.c:229
#define MESSY(f)
Definition: regguts.h:422
static void markreachable(struct nfa *, struct state *, struct state *, struct state *)
#define LATYPE_BEHIND_POS
Definition: regguts.h:101
static struct cvec * newcvec(int, int)
static struct cvec * getcvec(struct vars *, int, int)
Definition: regguts.h:354
short color
Definition: regguts.h:134
static void colorchain(struct colormap *, struct arc *)
int nins
Definition: regguts.h:303
Definition: regguts.h:445
color nlcolor
Definition: regcomp.c:243
char op
Definition: regguts.h:410
static struct cvec * range(struct vars *, chr, chr, int)
static void fixempties(struct nfa *, FILE *)
static void lexnest(struct vars *, const chr *, const chr *)
int nlacons
Definition: regguts.h:475
static struct cvec * eclass(struct vars *, chr, int)
static struct subre * subre(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:1686
static void pushfwd(struct nfa *, FILE *)
static int hasconstraintout(struct state *)
int lasttype
Definition: regcomp.c:233
#define FREE(p)
Definition: regcustom.h:63
static struct state * emptyreachable(struct nfa *, struct state *, struct state *, struct arc **)
short min
Definition: regguts.h:429
#define REMAGIC
Definition: regguts.h:96
static void onechr(struct vars *, chr, struct state *, struct state *)
Definition: regcomp.c:1561
static color subcolor(struct colormap *, chr)
static void parseqatom(struct vars *, int, int, struct state *, struct state *, struct subre *)
Definition: regcomp.c:777
static void wordchrs(struct vars *)
Definition: regcomp.c:1588
struct state * begin
Definition: regguts.h:433
#define COMBINE(f1, f2)
Definition: regguts.h:425
Definition: regguts.h:315
static int hasnonemptyout(struct state *)
#define LATYPE_AHEAD_NEG
Definition: regguts.h:100
unsigned int Oid
Definition: postgres_ext.h:31
#define ISERR()
Definition: regcomp.c:262
static void subcoloronechr(struct vars *, chr, struct state *, struct state *, color *)
volatile bool QueryCancelPending
Definition: globals.c:30
#define BEHIND
Definition: regcomp.c:286
#define REG_ICASE
Definition: regex.h:106
int re_csize
Definition: regex.h:74
static void makesearch(struct vars *, struct nfa *)
Definition: regcomp.c:560
int pg_regcomp(regex_t *re, const chr *string, size_t len, int flags, Oid collation)
Definition: regcomp.c:314
static int sortouts_cmp(const void *, const void *)
static void dupnfa(struct nfa *, struct state *, struct state *, struct state *, struct state *)
#define NOTREACHED
Definition: regguts.h:91
int nsubexp
Definition: regcomp.c:237
#define LATYPE_AHEAD_POS
Definition: regguts.h:99
#define MALLOC(n)
Definition: regcustom.h:62
#define SOME
static struct state * single_color_transition(struct state *, struct state *)
#define REG_PROGRESS
Definition: regex.h:117
#define ERR(e)
Definition: regcomp.c:265
struct subre * chain
Definition: regguts.h:436
struct vars * v
Definition: regguts.h:328
int re_magic
Definition: regex.h:57
static void addchr(struct cvec *, chr)
struct cnfa search
Definition: regguts.h:470
static int push(struct nfa *, struct arc *, struct state **)
static void newhicolorcols(struct colormap *)
pg_wchar chr
Definition: regcustom.h:68
#define REALLOC(p, n)
Definition: regcustom.h:64
size_t re_nsub
Definition: regex.h:58
static void freesrnode(struct vars *, struct subre *)
Definition: regcomp.c:1756
static void duptraverse(struct nfa *, struct state *, struct state *)
struct colormap * cm
Definition: regcomp.c:242
#define ZAPCNFA(cnfa)
Definition: regguts.h:371
static void dumpnfa(struct nfa *, FILE *)
static int newhicolorrow(struct colormap *, int)
bool debug
Definition: pg_standby.c:46
char * s1
static void rainbow(struct nfa *, struct colormap *, int, color, struct state *, struct state *)
#define LACON
Definition: regcomp.c:284
regex_t * re
Definition: regcomp.c:226
int nlacons
Definition: regcomp.c:252
#define REG_BADBR
Definition: regex.h:147
int magic
Definition: regguts.h:464
static void uncolorchain(struct colormap *, struct arc *)
static void clonesuccessorstates(struct nfa *, struct state *, struct state *, struct state *, struct arc *, char *, char *, int)
char * c
#define REG_INVARG
Definition: regex.h:152
static char * buf
Definition: pg_test_fsync.c:65
static void markst(struct subre *)
Definition: regcomp.c:1830
static void fixconstraintloops(struct nfa *, FILE *)
static void freesubre(struct vars *, struct subre *)
Definition: regcomp.c:1738
#define REG_BADRPT
Definition: regex.h:150
static void processlacon(struct vars *, struct state *, struct state *, int, struct state *, struct state *)
Definition: regcomp.c:1620
static long analyze(struct nfa *)
static int next(struct vars *)
struct arc * outchain
Definition: regguts.h:282
char * flag(int b)
Definition: test-ctype.c:33
char flags
Definition: regguts.h:411
struct subre ** subs
Definition: regcomp.c:238
static struct nfa * newnfa(struct vars *, struct colormap *, struct nfa *)
char string[11]
Definition: preproc-type.c:46
color bos[2]
Definition: regguts.h:326
static int pg_wc_isupper(pg_wchar c)
struct colormap cmap
Definition: regguts.h:472
#define assert(TEST)
Definition: imath.c:37
static void freecolor(struct colormap *, color)
#define LATYPE_IS_AHEAD(la)
Definition: regguts.h:104
static void moveins(struct nfa *, struct state *, struct state *)
static pg_wchar pg_wc_tolower(pg_wchar c)
struct arc * outs
Definition: regguts.h:306
#define REG_NEWLINE
Definition: regex.h:111
static void moveouts(struct nfa *, struct state *, struct state *)
static const chr * scanplain(struct vars *)
Definition: regcomp.c:1536
#define REG_ADVANCED
Definition: regex.h:103
#define SEE(t)
Definition: regcomp.c:259
static int findconstraintloop(struct nfa *, struct state *)
#define REG_ECOLLATE
Definition: regex.h:140
static int pg_wc_isdigit(pg_wchar c)
struct subre * left
Definition: regguts.h:431
size_t nsubs
Definition: regcomp.c:239
static struct cvec * clearcvec(struct cvec *)
static void sortins(struct nfa *, struct state *)
static struct cvec * allcases(struct vars *, chr)
unsigned int pg_wchar
Definition: mbprint.c:31
static struct state * newstate(struct nfa *)
#define SBEGIN
Definition: regcomp.c:289
static void delsub(struct nfa *, struct state *, struct state *)
#define BACKREF
Definition: regcomp.c:278
static void copyouts(struct nfa *, struct state *, struct state *)
struct state * tmp
Definition: regguts.h:308
Definition: regguts.h:256
int err
Definition: regcomp.c:231
static struct state * newfstate(struct nfa *, int flag)
static void copyins(struct nfa *, struct state *, struct state *)
#define LATYPE_BEHIND_NEG
Definition: regguts.h:102
static long nfanode(struct vars *, struct subre *, int, FILE *)
Definition: regcomp.c:1884
static int pg_wc_isalpha(pg_wchar c)
static struct arc * allocarc(struct nfa *, struct state *)
#define REG_EXTENDED
Definition: regex.h:101
struct nfa * nfa
Definition: regcomp.c:241
#define PREF(f)
Definition: regguts.h:423
struct cvec * cv
Definition: regcomp.c:249
static color subcolorhi(struct colormap *, color *)
static void freestate(struct nfa *, struct state *)
static int pull(struct nfa *, struct arc *, struct state **)
struct state * to
Definition: regguts.h:281
char * s2
struct cvec * cv2
Definition: regcomp.c:250
static chr chrnamed(struct vars *, const chr *, const chr *, chr)
#define REG_UUNPORT
Definition: regex.h:69
#define REG_ADVF
Definition: regex.h:102
const chr * savestop
Definition: regcomp.c:230
static void brackpart(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1423
#define PLAIN
Definition: regcomp.c:276
#define EMPTYARC(x, y)
Definition: regcomp.c:271
struct state * wordchrs
Definition: regcomp.c:244
#define BACKR
Definition: regguts.h:416
long re_info
Definition: regex.h:59
static struct subre * parsebranch(struct vars *, int, int, struct state *, struct state *, int)
Definition: regcomp.c:728
#define REG_DUMP
Definition: regex.h:115
Definition: regguts.h:462
int ntree
Definition: regguts.h:471
static void cleanup(struct nfa *)
static color newsub(struct colormap *, color)
static int rstacktoodeep(void)
Definition: regcomp.c:2031
static void createarc(struct nfa *, int, color, struct state *, struct state *)
#define EOS
Definition: regcomp.c:275
volatile bool InterruptPending
Definition: globals.c:29
#define REG_ECTYPE
Definition: regex.h:141
static struct cvec * cclass(struct vars *, const chr *, const chr *, int)
static void cbracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1393
color co
Definition: regguts.h:279
#define NWBDRY
Definition: regcomp.c:288
#define DUPINF
Definition: regguts.h:94
#define REG_ASSERT
Definition: regex.h:151
#define MIXED
Definition: regguts.h:414
static void deltraverse(struct nfa *, struct state *, struct state *)
#define NULL
Definition: c.h:229
#define GUTSMAGIC
Definition: regguts.h:465
#define REG_UUNSPEC
Definition: regex.h:68
void pg_set_regex_collation(Oid collation)
Definition: regguts.h:298
static void skip(struct vars *)
short max
Definition: regguts.h:430
static void newarc(struct nfa *, int, color, struct state *, struct state *)
static int carc_cmp(const void *, const void *)
static pg_wchar pg_wc_toupper(pg_wchar c)
#define REG_ERANGE
Definition: regex.h:148
static int pg_wc_isalnum(pg_wchar c)
const chr * now
Definition: regcomp.c:227
#define REG_NLANCH
Definition: regex.h:110
#define REG_ETOOBIG
Definition: regex.h:155
static const struct fns functions
Definition: regcomp.c:299
static void subcoloronerange(struct vars *, chr, chr, struct state *, struct state *, color *)
static void init(bool is_no_vacuum)
Definition: pgbench.c:2571
#define COLLEL
Definition: regcomp.c:279
static int sortins_cmp(const void *, const void *)
#define VS(x)
Definition: regguts.h:61
static int cmp(const chr *, const chr *, size_t)
struct state * end
Definition: regguts.h:434
static void initcm(struct vars *, struct colormap *)
static void subcoloronerow(struct vars *, int, struct state *, struct state *, color *)
#define INUSE
Definition: regguts.h:417
long info
Definition: regguts.h:467
Definition: regguts.h:408
#define NOTE(b)
Definition: regcomp.c:270
#define NOERRZ()
Definition: regcomp.c:268
int lexcon
Definition: regcomp.c:236
struct cnfa cnfa
Definition: regguts.h:435
#define CNOERR()
#define LONGER
Definition: regguts.h:412
static void pullback(struct nfa *, FILE *)
static void repeat(struct vars *, struct state *, struct state *, int, int)
Definition: regcomp.c:1288
static void word(struct vars *, int, struct state *, struct state *)
Definition: regcomp.c:1243
static void freecvec(struct cvec *)
const chr * stop
Definition: regcomp.c:228
char * re_guts
Definition: regex.h:78
int nouts
Definition: regguts.h:305
#define CAP
Definition: regguts.h:415
volatile bool ProcDiePending
Definition: globals.c:31
static int pg_wc_isprint(pg_wchar c)
static struct arc * findarc(struct state *, int, color)
int cflags
Definition: regguts.h:466
static int before(chr, chr)
static void addrange(struct cvec *, chr, chr)
#define NOERR()
Definition: regcomp.c:266
#define UP(f)
Definition: regguts.h:421
struct state * init
Definition: regguts.h:318
#define SEND
Definition: regcomp.c:290
int cflags
Definition: regcomp.c:232
size_t nsub
Definition: regguts.h:468
struct arc * inchain
Definition: regguts.h:285
static void lexstart(struct vars *)
static int casecmp(const chr *, const chr *, size_t)
#define ARCV(t, val)
static color pseudocolor(struct colormap *)
short id
Definition: regguts.h:426
#define SHORTER
Definition: regguts.h:413
int i
struct subre * sub10[10]
Definition: regcomp.c:240
#define COLORLESS
Definition: regguts.h:137
#define REG_EXPANDED
Definition: regex.h:108
#define DISCARD
Definition: regguts.h:58
static void freearc(struct nfa *, struct arc *)
static void freenfa(struct nfa *)
struct subre * tree
Definition: regcomp.c:245
static color maxcolor(struct colormap *)
#define WBDRY
Definition: regcomp.c:287
static void cleanst(struct vars *)
Definition: regcomp.c:1845
static void dropstate(struct nfa *, struct state *)
#define INF
size_t spaceused
Definition: regcomp.c:254
#define INSIST(c, e)
Definition: regcomp.c:269
struct subre * lacons
Definition: regcomp.c:251
static void freecnfa(struct cnfa *)
static int pg_wc_ispunct(pg_wchar c)
static void breakconstraintloop(struct nfa *, struct state *)
Definition: regcomp.c:224
Oid re_collation
Definition: regex.h:76
static void compact(struct nfa *, struct cnfa *)
Definition: regex.h:55
static void moresubs(struct vars *, int)
Definition: regcomp.c:494
static void cleartraverse(struct nfa *, struct state *)
#define STACK_TOO_DEEP(re)
Definition: regguts.h:455
#define DIGIT
Definition: regcomp.c:277
#define AHEAD
Definition: regcomp.c:285
struct arc * ins
Definition: regguts.h:304
static int newlacon(struct vars *, struct state *, struct state *, int)
Definition: regcomp.c:1923
static int combine(struct arc *, struct arc *)
struct state * pre
Definition: regguts.h:317
static void markcanreach(struct nfa *, struct state *, struct state *, struct state *)
static struct subre * parse(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:649
bool stack_is_too_deep(void)
Definition: postgres.c:3112
static void colorcomplement(struct nfa *, struct colormap *, int, struct state *, struct state *, struct state *)
Definition: regguts.h:348
#define ECLASS
Definition: regcomp.c:280
#define REG_UPBOTCH
Definition: regex.h:65