PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
regcomp.c File Reference
#include "regex/regguts.h"
#include "regc_lex.c"
#include "regc_color.c"
#include "regc_nfa.c"
#include "regc_cvec.c"
#include "regc_pg_locale.c"
#include "regc_locale.c"
Include dependency graph for regcomp.c:

Go to the source code of this file.

Data Structures

struct  vars
 

Macros

#define INCOMPATIBLE   1 /* destroys arc */
 
#define SATISFIED   2 /* constraint satisfied */
 
#define COMPATIBLE   3 /* compatible but not satisfied yet */
 
#define NEXT()   (next(v)) /* advance by one token */
 
#define SEE(t)   (v->nexttype == (t)) /* is next token this? */
 
#define EAT(t)   (SEE(t) && next(v)) /* if next is this, swallow it */
 
#define VISERR(vv)   ((vv)->err != 0) /* have we seen an error yet? */
 
#define ISERR()   VISERR(v)
 
#define VERR(vv, e)
 
#define ERR(e)   VERR(v, e) /* record an error */
 
#define NOERR()   {if (ISERR()) return;} /* if error seen, return */
 
#define NOERRN()   {if (ISERR()) return NULL;} /* NOERR with retval */
 
#define NOERRZ()   {if (ISERR()) return 0;} /* NOERR with retval */
 
#define INSIST(c, e)   do { if (!(c)) ERR(e); } while (0) /* error if c false */
 
#define NOTE(b)   (v->re->re_info |= (b)) /* note visible condition */
 
#define EMPTYARC(x, y)   newarc(v->nfa, EMPTY, 0, x, y)
 
#define EMPTY   'n' /* no token present */
 
#define EOS   'e' /* end of string */
 
#define PLAIN   'p' /* ordinary character */
 
#define DIGIT   'd' /* digit (in bound) */
 
#define BACKREF   'b' /* back reference */
 
#define COLLEL   'I' /* start of [. */
 
#define ECLASS   'E' /* start of [= */
 
#define CCLASS   'C' /* start of [: */
 
#define END   'X' /* end of [. [= [: */
 
#define RANGE   'R' /* - within [] which might be range delim. */
 
#define LACON   'L' /* lookaround constraint subRE */
 
#define AHEAD   'a' /* color-lookahead arc */
 
#define BEHIND   'r' /* color-lookbehind arc */
 
#define WBDRY   'w' /* word boundary constraint */
 
#define NWBDRY   'W' /* non-word-boundary constraint */
 
#define SBEGIN   'A' /* beginning of string (even if not BOL) */
 
#define SEND   'Z' /* end of string (even if not EOL) */
 
#define PREFER   'P' /* length preference */
 
#define COLORED(a)   ((a)->type == PLAIN || (a)->type == AHEAD || (a)->type == BEHIND)
 
#define CNOERR()   { if (ISERR()) return freev(v, v->err); }
 
#define ARCV(t, val)   newarc(v->nfa, t, val, lp, rp)
 
#define SOME   2
 
#define INF   3
 
#define PAIR(x, y)   ((x)*4 + (y))
 
#define REDUCE(x)   ( ((x) == DUPINF) ? INF : (((x) > 1) ? SOME : (x)) )
 

Functions

static void moresubs (struct vars *, int)
 
static int freev (struct vars *, int)
 
static void makesearch (struct vars *, struct nfa *)
 
static struct subreparse (struct vars *, int, int, struct state *, struct state *)
 
static struct subreparsebranch (struct vars *, int, int, struct state *, struct state *, int)
 
static void parseqatom (struct vars *, int, int, struct state *, struct state *, struct subre *)
 
static void nonword (struct vars *, int, struct state *, struct state *)
 
static void word (struct vars *, int, struct state *, struct state *)
 
static int scannum (struct vars *)
 
static void repeat (struct vars *, struct state *, struct state *, int, int)
 
static void bracket (struct vars *, struct state *, struct state *)
 
static void cbracket (struct vars *, struct state *, struct state *)
 
static void brackpart (struct vars *, struct state *, struct state *)
 
static const chrscanplain (struct vars *)
 
static void onechr (struct vars *, chr, struct state *, struct state *)
 
static void wordchrs (struct vars *)
 
static void processlacon (struct vars *, struct state *, struct state *, int, struct state *, struct state *)
 
static struct subresubre (struct vars *, int, int, struct state *, struct state *)
 
static void freesubre (struct vars *, struct subre *)
 
static void freesrnode (struct vars *, struct subre *)
 
static void optst (struct vars *, struct subre *)
 
static int numst (struct subre *, int)
 
static void markst (struct subre *)
 
static void cleanst (struct vars *)
 
static long nfatree (struct vars *, struct subre *, FILE *)
 
static long nfanode (struct vars *, struct subre *, int, FILE *)
 
static int newlacon (struct vars *, struct state *, struct state *, int)
 
static void freelacons (struct subre *, int)
 
static void rfree (regex_t *)
 
static int rcancelrequested (void)
 
static int rstacktoodeep (void)
 
static void lexstart (struct vars *)
 
static void prefixes (struct vars *)
 
static void lexnest (struct vars *, const chr *, const chr *)
 
static void lexword (struct vars *)
 
static int next (struct vars *)
 
static int lexescape (struct vars *)
 
static chr lexdigits (struct vars *, int, int, int)
 
static int brenext (struct vars *, chr)
 
static void skip (struct vars *)
 
static chr newline (void)
 
static chr chrnamed (struct vars *, const chr *, const chr *, chr)
 
static void initcm (struct vars *, struct colormap *)
 
static void freecm (struct colormap *)
 
static color maxcolor (struct colormap *)
 
static color newcolor (struct colormap *)
 
static void freecolor (struct colormap *, color)
 
static color pseudocolor (struct colormap *)
 
static color subcolor (struct colormap *, chr)
 
static color subcolorhi (struct colormap *, color *)
 
static color newsub (struct colormap *, color)
 
static int newhicolorrow (struct colormap *, int)
 
static void newhicolorcols (struct colormap *)
 
static void subcolorcvec (struct vars *, struct cvec *, struct state *, struct state *)
 
static void subcoloronechr (struct vars *, chr, struct state *, struct state *, color *)
 
static void subcoloronerange (struct vars *, chr, chr, struct state *, struct state *, color *)
 
static void subcoloronerow (struct vars *, int, struct state *, struct state *, color *)
 
static void okcolors (struct nfa *, struct colormap *)
 
static void colorchain (struct colormap *, struct arc *)
 
static void uncolorchain (struct colormap *, struct arc *)
 
static void rainbow (struct nfa *, struct colormap *, int, color, struct state *, struct state *)
 
static void colorcomplement (struct nfa *, struct colormap *, int, struct state *, struct state *, struct state *)
 
static struct nfanewnfa (struct vars *, struct colormap *, struct nfa *)
 
static void freenfa (struct nfa *)
 
static struct statenewstate (struct nfa *)
 
static struct statenewfstate (struct nfa *, int flag)
 
static void dropstate (struct nfa *, struct state *)
 
static void freestate (struct nfa *, struct state *)
 
static void destroystate (struct nfa *, struct state *)
 
static void newarc (struct nfa *, int, color, struct state *, struct state *)
 
static void createarc (struct nfa *, int, color, struct state *, struct state *)
 
static struct arcallocarc (struct nfa *, struct state *)
 
static void freearc (struct nfa *, struct arc *)
 
static void changearctarget (struct arc *, struct state *)
 
static int hasnonemptyout (struct state *)
 
static struct arcfindarc (struct state *, int, color)
 
static void cparc (struct nfa *, struct arc *, struct state *, struct state *)
 
static void sortins (struct nfa *, struct state *)
 
static int sortins_cmp (const void *, const void *)
 
static void sortouts (struct nfa *, struct state *)
 
static int sortouts_cmp (const void *, const void *)
 
static void moveins (struct nfa *, struct state *, struct state *)
 
static void copyins (struct nfa *, struct state *, struct state *)
 
static void mergeins (struct nfa *, struct state *, struct arc **, int)
 
static void moveouts (struct nfa *, struct state *, struct state *)
 
static void copyouts (struct nfa *, struct state *, struct state *)
 
static void cloneouts (struct nfa *, struct state *, struct state *, struct state *, int)
 
static void delsub (struct nfa *, struct state *, struct state *)
 
static void deltraverse (struct nfa *, struct state *, struct state *)
 
static void dupnfa (struct nfa *, struct state *, struct state *, struct state *, struct state *)
 
static void duptraverse (struct nfa *, struct state *, struct state *)
 
static void cleartraverse (struct nfa *, struct state *)
 
static struct statesingle_color_transition (struct state *, struct state *)
 
static void specialcolors (struct nfa *)
 
static long optimize (struct nfa *, FILE *)
 
static void pullback (struct nfa *, FILE *)
 
static int pull (struct nfa *, struct arc *, struct state **)
 
static void pushfwd (struct nfa *, FILE *)
 
static int push (struct nfa *, struct arc *, struct state **)
 
static int combine (struct arc *, struct arc *)
 
static void fixempties (struct nfa *, FILE *)
 
static struct stateemptyreachable (struct nfa *, struct state *, struct state *, struct arc **)
 
static int isconstraintarc (struct arc *)
 
static int hasconstraintout (struct state *)
 
static void fixconstraintloops (struct nfa *, FILE *)
 
static int findconstraintloop (struct nfa *, struct state *)
 
static void breakconstraintloop (struct nfa *, struct state *)
 
static void clonesuccessorstates (struct nfa *, struct state *, struct state *, struct state *, struct arc *, char *, char *, int)
 
static void cleanup (struct nfa *)
 
static void markreachable (struct nfa *, struct state *, struct state *, struct state *)
 
static void markcanreach (struct nfa *, struct state *, struct state *, struct state *)
 
static long analyze (struct nfa *)
 
static void compact (struct nfa *, struct cnfa *)
 
static void carcsort (struct carc *, size_t)
 
static int carc_cmp (const void *, const void *)
 
static void freecnfa (struct cnfa *)
 
static void dumpnfa (struct nfa *, FILE *)
 
static struct cvecnewcvec (int, int)
 
static struct cvecclearcvec (struct cvec *)
 
static void addchr (struct cvec *, chr)
 
static void addrange (struct cvec *, chr, chr)
 
static struct cvecgetcvec (struct vars *, int, int)
 
static void freecvec (struct cvec *)
 
static int pg_wc_isdigit (pg_wchar c)
 
static int pg_wc_isalpha (pg_wchar c)
 
static int pg_wc_isalnum (pg_wchar c)
 
static int pg_wc_isupper (pg_wchar c)
 
static int pg_wc_islower (pg_wchar c)
 
static int pg_wc_isgraph (pg_wchar c)
 
static int pg_wc_isprint (pg_wchar c)
 
static int pg_wc_ispunct (pg_wchar c)
 
static int pg_wc_isspace (pg_wchar c)
 
static pg_wchar pg_wc_toupper (pg_wchar c)
 
static pg_wchar pg_wc_tolower (pg_wchar c)
 
static chr element (struct vars *, const chr *, const chr *)
 
static struct cvecrange (struct vars *, chr, chr, int)
 
static int before (chr, chr)
 
static struct cvececlass (struct vars *, chr, int)
 
static struct cveccclass (struct vars *, const chr *, const chr *, int)
 
static int cclass_column_index (struct colormap *, chr)
 
static struct cvecallcases (struct vars *, chr)
 
static int cmp (const chr *, const chr *, size_t)
 
static int casecmp (const chr *, const chr *, size_t)
 
int pg_regcomp (regex_t *re, const chr *string, size_t len, int flags, Oid collation)
 

Variables

static const struct fns functions
 

Macro Definition Documentation

#define AHEAD   'a' /* color-lookahead arc */

Definition at line 285 of file regcomp.c.

Referenced by combine(), isconstraintarc(), nonword(), parseqatom(), processlacon(), pushfwd(), and word().

#define ARCV (   t,
  val 
)    newarc(v->nfa, t, val, lp, rp)

Referenced by parseqatom().

#define BACKREF   'b' /* back reference */

Definition at line 278 of file regcomp.c.

Referenced by brenext(), lexescape(), and parseqatom().

#define BEHIND   'r' /* color-lookbehind arc */

Definition at line 286 of file regcomp.c.

Referenced by combine(), isconstraintarc(), nonword(), parseqatom(), processlacon(), pullback(), and word().

#define CCLASS   'C' /* start of [: */

Definition at line 281 of file regcomp.c.

Referenced by brackpart(), lexescape(), next(), and scanplain().

#define CNOERR ( )    { if (ISERR()) return freev(v, v->err); }

Referenced by pg_regcomp().

#define COLLEL   'I' /* start of [. */

Definition at line 279 of file regcomp.c.

Referenced by brackpart(), next(), and scanplain().

#define COLORED (   a)    ((a)->type == PLAIN || (a)->type == AHEAD || (a)->type == BEHIND)

Definition at line 294 of file regcomp.c.

Referenced by createarc(), and freearc().

#define COMPATIBLE   3 /* compatible but not satisfied yet */

Definition at line 160 of file regcomp.c.

Referenced by combine(), pull(), and push().

#define DIGIT   'd' /* digit (in bound) */

Definition at line 277 of file regcomp.c.

Referenced by next(), parseqatom(), and scannum().

#define EAT (   t)    (SEE(t) && next(v)) /* if next is this, swallow it */

Definition at line 260 of file regcomp.c.

Referenced by parse(), and parseqatom().

#define ECLASS   'E' /* start of [= */

Definition at line 280 of file regcomp.c.

Referenced by brackpart(), next(), and scanplain().

#define EMPTY   'n' /* no token present */
#define EMPTYARC (   x,
 
)    newarc(v->nfa, EMPTY, 0, x, y)

Definition at line 271 of file regcomp.c.

Referenced by parse(), parsebranch(), parseqatom(), and repeat().

#define END   'X' /* end of [. [= [: */

Definition at line 282 of file regcomp.c.

Referenced by scanplain().

#define EOS   'e' /* end of string */

Definition at line 275 of file regcomp.c.

Referenced by bracket(), next(), parse(), parsebranch(), parseqatom(), and pg_regcomp().

#define ERR (   e)    VERR(v, e) /* record an error */

Definition at line 265 of file regcomp.c.

Referenced by brackpart(), freev(), moresubs(), newlacon(), parse(), parseqatom(), repeat(), scannum(), and subre().

#define INCOMPATIBLE   1 /* destroys arc */

Definition at line 158 of file regcomp.c.

Referenced by combine(), pull(), and push().

#define INF   3

Referenced by repeat().

#define INSIST (   c,
  e 
)    do { if (!(c)) ERR(e); } while (0) /* error if c false */

Definition at line 269 of file regcomp.c.

Referenced by brackpart(), and parseqatom().

#define ISERR ( )    VISERR(v)

Definition at line 262 of file regcomp.c.

Referenced by bracket(), lexescape(), longest(), miss(), newnfa(), next(), nfanode(), parseqatom(), scanplain(), and wordchrs().

#define LACON   'L' /* lookaround constraint subRE */

Definition at line 284 of file regcomp.c.

Referenced by combine(), compact(), isconstraintarc(), next(), parseqatom(), and processlacon().

#define NEXT ( )    (next(v)) /* advance by one token */

Definition at line 258 of file regcomp.c.

Referenced by bracket(), brackpart(), parseqatom(), scannum(), scanplain(), and wordchrs().

#define NOERR ( )    {if (ISERR()) return;} /* if error seen, return */
#define NOERRN ( )    {if (ISERR()) return NULL;} /* NOERR with retval */

Definition at line 267 of file regcomp.c.

Referenced by parse(), parsebranch(), and range().

#define NOERRZ ( )    {if (ISERR()) return 0;} /* NOERR with retval */

Definition at line 268 of file regcomp.c.

Referenced by nfanode().

#define NOTE (   b)    (v->re->re_info |= (b)) /* note visible condition */
#define NWBDRY   'W' /* non-word-boundary constraint */

Definition at line 288 of file regcomp.c.

Referenced by lexescape(), and parseqatom().

#define PAIR (   x,
 
)    ((x)*4 + (y))

Referenced by repeat().

#define PREFER   'P' /* length preference */

Definition at line 291 of file regcomp.c.

#define RANGE   'R' /* - within [] which might be range delim. */

Definition at line 283 of file regcomp.c.

Referenced by brackpart(), and next().

#define REDUCE (   x)    ( ((x) == DUPINF) ? INF : (((x) > 1) ? SOME : (x)) )

Referenced by repeat().

#define SATISFIED   2 /* constraint satisfied */

Definition at line 159 of file regcomp.c.

Referenced by combine(), pull(), and push().

#define SBEGIN   'A' /* beginning of string (even if not BOL) */

Definition at line 289 of file regcomp.c.

Referenced by lexescape(), next(), and parseqatom().

#define SEE (   t)    (v->nexttype == (t)) /* is next token this? */
#define SEND   'Z' /* end of string (even if not EOL) */

Definition at line 290 of file regcomp.c.

Referenced by lexescape(), and parseqatom().

#define SOME   2

Referenced by repeat().

#define VERR (   vv,
  e 
)
Value:
((vv)->nexttype = EOS, \
(vv)->err = ((vv)->err ? (vv)->err : (e)))
#define EOS
Definition: regcomp.c:275
e
Definition: preproc-init.c:82

Definition at line 263 of file regcomp.c.

#define VISERR (   vv)    ((vv)->err != 0) /* have we seen an error yet? */

Definition at line 261 of file regcomp.c.

#define WBDRY   'w' /* word boundary constraint */

Definition at line 287 of file regcomp.c.

Referenced by lexescape(), and parseqatom().

Function Documentation

static void addchr ( struct cvec ,
chr   
)
static
static void addrange ( struct cvec ,
chr  ,
chr   
)
static
static struct cvec* allcases ( struct vars ,
chr   
)
static

Referenced by onechr().

static struct arc* allocarc ( struct nfa ,
struct state  
)
static
static long analyze ( struct nfa )
static
static int before ( chr  ,
chr   
)
static
static void bracket ( struct vars v,
struct state lp,
struct state rp 
)
static

Definition at line 1374 of file regcomp.c.

References assert, brackpart(), vars::cm, EOS, ISERR, NEXT, vars::nfa, okcolors(), and SEE.

Referenced by cbracket(), parseqatom(), and wordchrs().

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 }
static void okcolors(struct nfa *, struct colormap *)
#define NEXT()
Definition: regcomp.c:258
#define ISERR()
Definition: regcomp.c:262
struct colormap * cm
Definition: regcomp.c:242
#define assert(TEST)
Definition: imath.c:37
#define SEE(t)
Definition: regcomp.c:259
struct nfa * nfa
Definition: regcomp.c:241
static void brackpart(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1423
#define EOS
Definition: regcomp.c:275
static void brackpart ( struct vars v,
struct state lp,
struct state rp 
)
static

Definition at line 1423 of file regcomp.c.

References cclass(), CCLASS, vars::cflags, COLLEL, eclass(), ECLASS, element(), ERR, INSIST, NEXT, vars::nexttype, vars::nextvalue, NOERR, NOTE, vars::now, onechr(), PLAIN, range(), RANGE, REG_ASSERT, REG_ECOLLATE, REG_ECTYPE, REG_ERANGE, REG_ICASE, REG_UUNPORT, scanplain(), SEE, and subcolorcvec().

Referenced by bracket().

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 }
static void subcolorcvec(struct vars *, struct cvec *, struct state *, struct state *)
#define RANGE
Definition: regcomp.c:283
int nexttype
Definition: regcomp.c:234
#define CCLASS
Definition: regcomp.c:281
chr nextvalue
Definition: regcomp.c:235
static chr element(struct vars *, const chr *, const chr *)
#define NEXT()
Definition: regcomp.c:258
static struct cvec * range(struct vars *, chr, chr, int)
static struct cvec * eclass(struct vars *, chr, int)
static void onechr(struct vars *, chr, struct state *, struct state *)
Definition: regcomp.c:1561
#define REG_ICASE
Definition: regex.h:106
#define ERR(e)
Definition: regcomp.c:265
pg_wchar chr
Definition: regcustom.h:68
char * c
static const chr * scanplain(struct vars *)
Definition: regcomp.c:1536
#define SEE(t)
Definition: regcomp.c:259
#define REG_ECOLLATE
Definition: regex.h:140
Definition: regguts.h:256
#define REG_UUNPORT
Definition: regex.h:69
#define PLAIN
Definition: regcomp.c:276
#define REG_ECTYPE
Definition: regex.h:141
static struct cvec * cclass(struct vars *, const chr *, const chr *, int)
#define REG_ASSERT
Definition: regex.h:151
#define REG_ERANGE
Definition: regex.h:148
const chr * now
Definition: regcomp.c:227
#define COLLEL
Definition: regcomp.c:279
#define NOTE(b)
Definition: regcomp.c:270
#define NOERR()
Definition: regcomp.c:266
int cflags
Definition: regcomp.c:232
#define INSIST(c, e)
Definition: regcomp.c:269
#define ECLASS
Definition: regcomp.c:280
static void breakconstraintloop ( struct nfa ,
struct state  
)
static
static int brenext ( struct vars ,
chr   
)
static
static int carc_cmp ( const void *  ,
const void *   
)
static
static void carcsort ( struct carc ,
size_t   
)
static
static int casecmp ( const chr ,
const chr ,
size_t   
)
static

Referenced by pg_regcomp().

static void cbracket ( struct vars v,
struct state lp,
struct state rp 
)
static

Definition at line 1393 of file regcomp.c.

References assert, bracket(), vars::cflags, vars::cm, colorcomplement(), dropstate(), freestate(), newarc(), newstate(), vars::nfa, state::nins, vars::nlcolor, NOERR, state::nouts, PLAIN, and REG_NLSTOP.

Referenced by parseqatom().

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 }
#define REG_NLSTOP
Definition: regex.h:109
static void bracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1374
int nins
Definition: regguts.h:303
color nlcolor
Definition: regcomp.c:243
struct colormap * cm
Definition: regcomp.c:242
#define assert(TEST)
Definition: imath.c:37
static struct state * newstate(struct nfa *)
struct nfa * nfa
Definition: regcomp.c:241
static void freestate(struct nfa *, struct state *)
#define PLAIN
Definition: regcomp.c:276
Definition: regguts.h:298
static void newarc(struct nfa *, int, color, struct state *, struct state *)
int nouts
Definition: regguts.h:305
#define NOERR()
Definition: regcomp.c:266
int cflags
Definition: regcomp.c:232
static void dropstate(struct nfa *, struct state *)
static void colorcomplement(struct nfa *, struct colormap *, int, struct state *, struct state *, struct state *)
static struct cvec* cclass ( struct vars ,
const chr ,
const chr ,
int   
)
static

Referenced by brackpart().

static int cclass_column_index ( struct colormap ,
chr   
)
static
static void changearctarget ( struct arc ,
struct state  
)
static
static chr chrnamed ( struct vars ,
const chr ,
const chr ,
chr   
)
static
static void cleanst ( struct vars v)
static

Definition at line 1845 of file regcomp.c.

References subre::chain, subre::flags, FREE, INUSE, next(), vars::treechain, and vars::treefree.

Referenced by freev(), and pg_regcomp().

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 }
struct subre * treefree
Definition: regcomp.c:247
struct subre * treechain
Definition: regcomp.c:246
struct subre * chain
Definition: regguts.h:436
static int next(struct vars *)
char flags
Definition: regguts.h:411
#define INUSE
Definition: regguts.h:417
Definition: regguts.h:408
#define FREE(size)
Definition: saslprep.c:51
static void cleanup ( struct nfa )
static
static struct cvec* clearcvec ( struct cvec )
static
static void cleartraverse ( struct nfa ,
struct state  
)
static
static void cloneouts ( struct nfa ,
struct state ,
struct state ,
struct state ,
int   
)
static

Referenced by processlacon(), and word().

static void clonesuccessorstates ( struct nfa ,
struct state ,
struct state ,
struct state ,
struct arc ,
char *  ,
char *  ,
int   
)
static
static int cmp ( const chr ,
const chr ,
size_t   
)
static

Referenced by pg_regcomp().

static void colorchain ( struct colormap ,
struct arc  
)
static
static void colorcomplement ( struct nfa ,
struct colormap ,
int  ,
struct state ,
struct state ,
struct state  
)
static

Referenced by cbracket(), nonword(), and processlacon().

static int combine ( struct arc ,
struct arc  
)
static
static void compact ( struct nfa ,
struct cnfa  
)
static

Referenced by nfanode(), and pg_regcomp().

static void copyins ( struct nfa ,
struct state ,
struct state  
)
static
static void copyouts ( struct nfa ,
struct state ,
struct state  
)
static

Referenced by makesearch().

static void cparc ( struct nfa ,
struct arc ,
struct state ,
struct state  
)
static

Referenced by makesearch().

static void createarc ( struct nfa ,
int  ,
color  ,
struct state ,
struct state  
)
static
static void delsub ( struct nfa ,
struct state ,
struct state  
)
static

Referenced by parseqatom(), and repeat().

static void deltraverse ( struct nfa ,
struct state ,
struct state  
)
static
static void destroystate ( struct nfa ,
struct state  
)
static
static void dropstate ( struct nfa ,
struct state  
)
static

Referenced by cbracket().

static void dumpnfa ( struct nfa ,
FILE *   
)
static

Referenced by pg_regcomp().

static void dupnfa ( struct nfa ,
struct state ,
struct state ,
struct state ,
struct state  
)
static

Referenced by nfanode(), parseqatom(), and repeat().

static void duptraverse ( struct nfa ,
struct state ,
struct state  
)
static
static struct cvec* eclass ( struct vars ,
chr  ,
int   
)
static

Referenced by brackpart().

static chr element ( struct vars ,
const chr ,
const chr  
)
static

Referenced by brackpart().

static struct state* emptyreachable ( struct nfa ,
struct state ,
struct state ,
struct arc **   
)
static
static struct arc* findarc ( struct state ,
int  ,
color   
)
static
static int findconstraintloop ( struct nfa ,
struct state  
)
static
static void fixconstraintloops ( struct nfa ,
FILE *   
)
static
static void fixempties ( struct nfa ,
FILE *   
)
static
static void freearc ( struct nfa ,
struct arc  
)
static

Referenced by makesearch().

static void freecm ( struct colormap )
static

Referenced by rfree().

static void freecnfa ( struct cnfa )
static

Referenced by freelacons(), freesrnode(), and rfree().

static void freecolor ( struct colormap ,
color   
)
static
static void freecvec ( struct cvec )
static

Referenced by freev().

static void freelacons ( struct subre subs,
int  n 
)
static

Definition at line 1962 of file regcomp.c.

References assert, subre::cnfa, FREE, freecnfa(), i, and NULLCNFA.

Referenced by freev(), and rfree().

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 }
#define NULLCNFA(cnfa)
Definition: regguts.h:372
#define assert(TEST)
Definition: imath.c:37
Definition: regguts.h:408
struct cnfa cnfa
Definition: regguts.h:435
int i
static void freecnfa(struct cnfa *)
#define FREE(size)
Definition: saslprep.c:51
static void freenfa ( struct nfa )
static

Referenced by freev(), and nfanode().

static void freesrnode ( struct vars v,
struct subre sr 
)
static

Definition at line 1756 of file regcomp.c.

References subre::cnfa, subre::flags, FREE, freecnfa(), subre::left, NULLCNFA, vars::treechain, and vars::treefree.

Referenced by freesubre().

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 }
struct subre * treefree
Definition: regcomp.c:247
struct subre * treechain
Definition: regcomp.c:246
#define NULLCNFA(cnfa)
Definition: regguts.h:372
char flags
Definition: regguts.h:411
struct subre * left
Definition: regguts.h:431
struct cnfa cnfa
Definition: regguts.h:435
static void freecnfa(struct cnfa *)
#define FREE(size)
Definition: saslprep.c:51
static void freestate ( struct nfa ,
struct state  
)
static

Referenced by cbracket().

static void freesubre ( struct vars v,
struct subre sr 
)
static

Definition at line 1738 of file regcomp.c.

References freesrnode(), subre::left, and subre::right.

Referenced by freev(), parse(), parseqatom(), and rfree().

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 }
struct subre * right
Definition: regguts.h:432
static void freesrnode(struct vars *, struct subre *)
Definition: regcomp.c:1756
static void freesubre(struct vars *, struct subre *)
Definition: regcomp.c:1738
struct subre * left
Definition: regguts.h:431
static int freev ( struct vars v,
int  err 
)
static

Definition at line 531 of file regcomp.c.

References cleanst(), vars::cv, vars::cv2, vars::err, ERR, FREE, freecvec(), freelacons(), freenfa(), freesubre(), vars::lacons, vars::nfa, vars::nlacons, vars::re, rfree(), vars::sub10, vars::subs, vars::tree, and vars::treechain.

Referenced by pg_regcomp().

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 }
static void freelacons(struct subre *, int)
Definition: regcomp.c:1962
static void rfree(regex_t *)
Definition: regcomp.c:1979
struct subre * treechain
Definition: regcomp.c:246
#define ERR(e)
Definition: regcomp.c:265
regex_t * re
Definition: regcomp.c:226
int nlacons
Definition: regcomp.c:252
static void freesubre(struct vars *, struct subre *)
Definition: regcomp.c:1738
struct subre ** subs
Definition: regcomp.c:238
int err
Definition: regcomp.c:231
struct nfa * nfa
Definition: regcomp.c:241
struct cvec * cv
Definition: regcomp.c:249
struct cvec * cv2
Definition: regcomp.c:250
static void freecvec(struct cvec *)
struct subre * sub10[10]
Definition: regcomp.c:240
static void freenfa(struct nfa *)
struct subre * tree
Definition: regcomp.c:245
static void cleanst(struct vars *)
Definition: regcomp.c:1845
struct subre * lacons
Definition: regcomp.c:251
#define FREE(size)
Definition: saslprep.c:51
static struct cvec* getcvec ( struct vars ,
int  ,
int   
)
static
static int hasconstraintout ( struct state )
static
static int hasnonemptyout ( struct state )
static
static void initcm ( struct vars ,
struct colormap  
)
static

Referenced by pg_regcomp().

static int isconstraintarc ( struct arc )
static
static chr lexdigits ( struct vars ,
int  ,
int  ,
int   
)
static
static int lexescape ( struct vars )
static
static void lexnest ( struct vars ,
const chr ,
const chr  
)
static
static void lexstart ( struct vars )
static

Referenced by pg_regcomp().

static void lexword ( struct vars )
static

Referenced by wordchrs().

static void makesearch ( struct vars v,
struct nfa nfa 
)
static

Definition at line 560 of file regcomp.c.

References assert, nfa::bos, vars::cm, arc::co, COLORLESS, copyouts(), cparc(), freearc(), arc::from, arc::inchain, state::ins, newarc(), newstate(), NOERR, arc::outchain, state::outs, PLAIN, nfa::pre, rainbow(), s2, state::tmp, arc::to, and arc::type.

Referenced by nfanode(), and pg_regcomp().

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 }
static void cparc(struct nfa *, struct arc *, struct state *, struct state *)
struct state * from
Definition: regguts.h:280
int type
Definition: regguts.h:278
Definition: regguts.h:276
struct colormap * cm
Definition: regcomp.c:242
static void rainbow(struct nfa *, struct colormap *, int, color, struct state *, struct state *)
struct arc * outchain
Definition: regguts.h:282
color bos[2]
Definition: regguts.h:326
#define assert(TEST)
Definition: imath.c:37
struct arc * outs
Definition: regguts.h:306
static struct state * newstate(struct nfa *)
static void copyouts(struct nfa *, struct state *, struct state *)
struct state * tmp
Definition: regguts.h:308
struct state * to
Definition: regguts.h:281
char * s2
#define PLAIN
Definition: regcomp.c:276
color co
Definition: regguts.h:279
Definition: regguts.h:298
static void newarc(struct nfa *, int, color, struct state *, struct state *)
#define NOERR()
Definition: regcomp.c:266
struct arc * inchain
Definition: regguts.h:285
#define COLORLESS
Definition: regguts.h:137
static void freearc(struct nfa *, struct arc *)
struct arc * ins
Definition: regguts.h:304
struct state * pre
Definition: regguts.h:317
static void markcanreach ( struct nfa ,
struct state ,
struct state ,
struct state  
)
static
static void markreachable ( struct nfa ,
struct state ,
struct state ,
struct state  
)
static
static void markst ( struct subre t)
static

Definition at line 1830 of file regcomp.c.

References assert, subre::flags, INUSE, subre::left, and subre::right.

Referenced by pg_regcomp().

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 }
struct subre * right
Definition: regguts.h:432
static void markst(struct subre *)
Definition: regcomp.c:1830
char flags
Definition: regguts.h:411
#define assert(TEST)
Definition: imath.c:37
struct subre * left
Definition: regguts.h:431
#define INUSE
Definition: regguts.h:417
static color maxcolor ( struct colormap )
static
static void mergeins ( struct nfa ,
struct state ,
struct arc **  ,
int   
)
static
static void moresubs ( struct vars v,
int  wanted 
)
static

Definition at line 494 of file regcomp.c.

References assert, ERR, MALLOC, vars::nsubs, REALLOC, REG_ESPACE, vars::sub10, vars::subs, and VS.

Referenced by parseqatom().

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 }
#define REG_ESPACE
Definition: regex.h:149
#define MALLOC(n)
Definition: regcustom.h:62
#define ERR(e)
Definition: regcomp.c:265
#define REALLOC(p, n)
Definition: regcustom.h:64
struct subre ** subs
Definition: regcomp.c:238
#define assert(TEST)
Definition: imath.c:37
size_t nsubs
Definition: regcomp.c:239
#define VS(x)
Definition: regguts.h:61
Definition: regguts.h:408
struct subre * sub10[10]
Definition: regcomp.c:240
static void moveins ( struct nfa ,
struct state ,
struct state  
)
static

Referenced by parsebranch(), parseqatom(), and repeat().

static void moveouts ( struct nfa ,
struct state ,
struct state  
)
static

Referenced by parseqatom(), and repeat().

static void newarc ( struct nfa ,
int  ,
color  ,
struct state ,
struct state  
)
static
static color newcolor ( struct colormap )
static
static struct cvec* newcvec ( int  ,
int   
)
static

Referenced by pg_regcomp().

static struct state* newfstate ( struct nfa ,
int  flag 
)
static
static void newhicolorcols ( struct colormap )
static
static int newhicolorrow ( struct colormap ,
int   
)
static
static int newlacon ( struct vars v,
struct state begin,
struct state end,
int  latype 
)
static

Definition at line 1923 of file regcomp.c.

References subre::begin, subre::cnfa, subre::end, ERR, vars::lacons, MALLOC, vars::nlacons, REALLOC, REG_ESPACE, subre::subno, and ZAPCNFA.

Referenced by processlacon().

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 }
#define REG_ESPACE
Definition: regex.h:149
int subno
Definition: regguts.h:427
struct state * begin
Definition: regguts.h:433
#define MALLOC(n)
Definition: regcustom.h:62
#define ERR(e)
Definition: regcomp.c:265
#define REALLOC(p, n)
Definition: regcustom.h:64
#define ZAPCNFA(cnfa)
Definition: regguts.h:371
int nlacons
Definition: regcomp.c:252
struct state * end
Definition: regguts.h:434
Definition: regguts.h:408
struct cnfa cnfa
Definition: regguts.h:435
struct subre * lacons
Definition: regcomp.c:251
static chr newline ( void  )
static

Referenced by pg_regcomp().

static struct nfa* newnfa ( struct vars ,
struct colormap ,
struct nfa  
)
static

Referenced by nfanode(), and pg_regcomp().

static struct state* newstate ( struct nfa )
static
static color newsub ( struct colormap ,
color   
)
static
static int next ( struct vars )
static

Referenced by cleanst().

static long nfanode ( struct vars v,
struct subre t,
int  converttosearch,
FILE *  f 
)
static

Definition at line 1884 of file regcomp.c.

References assert, subre::begin, vars::cm, subre::cnfa, compact(), dupnfa(), subre::end, nfa::final, freenfa(), nfa::init, ISERR, makesearch(), newnfa(), vars::nfa, NOERRZ, optimize(), and specialcolors().

Referenced by nfatree(), and pg_regcomp().

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 }
static long optimize(struct nfa *, FILE *)
struct state * final
Definition: regguts.h:319
static void specialcolors(struct nfa *)
struct state * begin
Definition: regguts.h:433
Definition: regguts.h:315
#define ISERR()
Definition: regcomp.c:262
static void makesearch(struct vars *, struct nfa *)
Definition: regcomp.c:560
static void dupnfa(struct nfa *, struct state *, struct state *, struct state *, struct state *)
struct colormap * cm
Definition: regcomp.c:242
static struct nfa * newnfa(struct vars *, struct colormap *, struct nfa *)
#define assert(TEST)
Definition: imath.c:37
struct nfa * nfa
Definition: regcomp.c:241
struct state * end
Definition: regguts.h:434
#define NOERRZ()
Definition: regcomp.c:268
struct cnfa cnfa
Definition: regguts.h:435
struct state * init
Definition: regguts.h:318
static void freenfa(struct nfa *)
static void compact(struct nfa *, struct cnfa *)
static long nfatree ( struct vars v,
struct subre t,
FILE *  f 
)
static

Definition at line 1864 of file regcomp.c.

References assert, subre::begin, DISCARD, subre::left, nfanode(), and subre::right.

Referenced by pg_regcomp().

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 }
static long nfatree(struct vars *, struct subre *, FILE *)
Definition: regcomp.c:1864
struct subre * right
Definition: regguts.h:432
struct state * begin
Definition: regguts.h:433
#define assert(TEST)
Definition: imath.c:37
struct subre * left
Definition: regguts.h:431
static long nfanode(struct vars *, struct subre *, int, FILE *)
Definition: regcomp.c:1884
#define DISCARD
Definition: regguts.h:58
static void nonword ( struct vars v,
int  dir,
struct state lp,
struct state rp 
)
static

Definition at line 1225 of file regcomp.c.

References AHEAD, assert, BEHIND, vars::cm, colorcomplement(), newarc(), vars::nfa, and vars::wordchrs.

Referenced by parseqatom().

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 }
#define BEHIND
Definition: regcomp.c:286
struct colormap * cm
Definition: regcomp.c:242
#define assert(TEST)
Definition: imath.c:37
struct nfa * nfa
Definition: regcomp.c:241
struct state * wordchrs
Definition: regcomp.c:244
static void newarc(struct nfa *, int, color, struct state *, struct state *)
#define AHEAD
Definition: regcomp.c:285
static void colorcomplement(struct nfa *, struct colormap *, int, struct state *, struct state *, struct state *)
static int numst ( struct subre t,
int  start 
)
static

Definition at line 1796 of file regcomp.c.

References assert, i, subre::id, subre::left, and subre::right.

Referenced by pg_regcomp().

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 }
static int numst(struct subre *, int)
Definition: regcomp.c:1796
struct subre * right
Definition: regguts.h:432
#define assert(TEST)
Definition: imath.c:37
struct subre * left
Definition: regguts.h:431
short id
Definition: regguts.h:426
int i
static void okcolors ( struct nfa ,
struct colormap  
)
static

Referenced by bracket(), parseqatom(), and pg_regcomp().

static void onechr ( struct vars v,
chr  c,
struct state lp,
struct state rp 
)
static

Definition at line 1561 of file regcomp.c.

References allcases(), vars::cflags, COLORLESS, REG_ICASE, subcolorcvec(), and subcoloronechr().

Referenced by brackpart(), and parseqatom().

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 }
static void subcolorcvec(struct vars *, struct cvec *, struct state *, struct state *)
short color
Definition: regguts.h:134
static void subcoloronechr(struct vars *, chr, struct state *, struct state *, color *)
#define REG_ICASE
Definition: regex.h:106
char * c
static struct cvec * allcases(struct vars *, chr)
int cflags
Definition: regcomp.c:232
#define COLORLESS
Definition: regguts.h:137
static long optimize ( struct nfa ,
FILE *   
)
static

Referenced by nfanode(), and pg_regcomp().

static void optst ( struct vars v,
struct subre t 
)
static

Definition at line 1780 of file regcomp.c.

Referenced by pg_regcomp().

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 }
static struct subre * parse ( struct vars v,
int  stopper,
int  type,
struct state init,
struct state final 
)
static

Definition at line 649 of file regcomp.c.

References assert, EAT, EMPTYARC, EOS, ERR, subre::flags, freesubre(), subre::left, LONGER, MESSY, newstate(), vars::nfa, NOERRN, subre::op, parsebranch(), REG_EPAREN, subre::right, SEE, subre(), and UP.

Referenced by _outPlannerInfo(), add_foreign_grouping_paths(), build_minmax_path(), check_sql_fn_retval(), consider_groupingsets_paths(), convert_ANY_sublink_to_join(), convert_EXISTS_sublink_to_join(), create_distinct_paths(), create_grouping_paths(), expand_inherited_rtentry(), expand_single_inheritance_child(), flatten_simple_union_all(), get_number_of_groups(), grouping_planner(), inheritance_planner(), make_group_input_target(), make_partial_grouping_target(), make_sort_input_target(), make_window_input_target(), max_parallel_hazard(), parseqatom(), pg_regcomp(), plan_set_operations(), planner(), preprocess_groupclause(), preprocess_grouping_sets(), preprocess_limit(), preprocess_minmax_aggregates(), preprocess_rowmarks(), preprocess_targetlist(), pull_up_simple_subquery(), pull_up_simple_values(), query_planner(), remove_useless_groupby_columns(), resolve_unique_index_expr(), set_subquery_pathlist(), standard_qp_callback(), and subquery_planner().

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 }
#define EAT(t)
Definition: regcomp.c:260
#define REG_EPAREN
Definition: regex.h:145
#define NOERRN()
Definition: regcomp.c:267
struct subre * right
Definition: regguts.h:432
#define MESSY(f)
Definition: regguts.h:422
char op
Definition: regguts.h:410
static struct subre * subre(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:1686
#define ERR(e)
Definition: regcomp.c:265
static void freesubre(struct vars *, struct subre *)
Definition: regcomp.c:1738
char flags
Definition: regguts.h:411
#define assert(TEST)
Definition: imath.c:37
#define SEE(t)
Definition: regcomp.c:259
struct subre * left
Definition: regguts.h:431
static struct state * newstate(struct nfa *)
struct nfa * nfa
Definition: regcomp.c:241
#define EMPTYARC(x, y)
Definition: regcomp.c:271
static struct subre * parsebranch(struct vars *, int, int, struct state *, struct state *, int)
Definition: regcomp.c:728
#define EOS
Definition: regcomp.c:275
Definition: regguts.h:298
Definition: regguts.h:408
#define LONGER
Definition: regguts.h:412
#define UP(f)
Definition: regguts.h:421
static struct subre * parsebranch ( struct vars v,
int  stopper,
int  type,
struct state left,
struct state right,
int  partial 
)
static

Definition at line 728 of file regcomp.c.

References assert, EMPTYARC, EOS, subre::left, moveins(), newstate(), vars::nfa, NOERRN, NOTE, parseqatom(), REG_UUNSPEC, SEE, and subre().

Referenced by parse(), and parseqatom().

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 }
#define NOERRN()
Definition: regcomp.c:267
static struct subre * subre(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:1686
static void parseqatom(struct vars *, int, int, struct state *, struct state *, struct subre *)
Definition: regcomp.c:777
#define assert(TEST)
Definition: imath.c:37
static void moveins(struct nfa *, struct state *, struct state *)
#define SEE(t)
Definition: regcomp.c:259
struct subre * left
Definition: regguts.h:431
static struct state * newstate(struct nfa *)
struct nfa * nfa
Definition: regcomp.c:241
#define EMPTYARC(x, y)
Definition: regcomp.c:271
#define EOS
Definition: regcomp.c:275
#define REG_UUNSPEC
Definition: regex.h:68
Definition: regguts.h:298
Definition: regguts.h:408
#define NOTE(b)
Definition: regcomp.c:270
static void parseqatom ( struct vars v,
int  stopper,
int  type,
struct state lp,
struct state rp,
struct subre top 
)
static

Definition at line 777 of file regcomp.c.

References AHEAD, ARCV, assert, BACKR, BACKREF, subre::begin, BEHIND, bracket(), CAP, cbracket(), vars::cflags, vars::cm, COLORLESS, COMBINE, delsub(), DIGIT, DUPINF, dupnfa(), EAT, EMPTYARC, subre::end, EOS, ERR, subre::flags, freesubre(), INSIST, ISERR, LACON, subre::left, LONGER, subre::max, MESSY, subre::min, moresubs(), moveins(), moveouts(), newstate(), NEXT, vars::nexttype, vars::nextvalue, vars::nfa, state::nins, vars::nlcolor, NOERR, nonword(), NOTE, state::nouts, vars::nsubexp, vars::nsubs, NWBDRY, okcolors(), onechr(), subre::op, parse(), parsebranch(), PLAIN, PREF, processlacon(), rainbow(), REG_ADVANCED, REG_ASSERT, REG_BADBR, REG_BADRPT, REG_EPAREN, REG_ESUBREG, REG_EXTENDED, REG_NLANCH, REG_NLSTOP, REG_UPBOTCH, repeat(), subre::right, s2, SBEGIN, scannum(), SEE, SEND, SHORTER, subre::subno, subre(), vars::subs, UP, WBDRY, word(), and wordchrs().

Referenced by parsebranch().

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 }
#define EAT(t)
Definition: regcomp.c:260
static int scannum(struct vars *)
Definition: regcomp.c:1257
#define REG_ESUBREG
Definition: regex.h:143
int nexttype
Definition: regcomp.c:234
#define REG_NLSTOP
Definition: regex.h:109
static void okcolors(struct nfa *, struct colormap *)
chr nextvalue
Definition: regcomp.c:235
#define REG_EPAREN
Definition: regex.h:145
static void bracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1374
static void nonword(struct vars *, int, struct state *, struct state *)
Definition: regcomp.c:1225
struct subre * right
Definition: regguts.h:432
int subno
Definition: regguts.h:427
#define NEXT()
Definition: regcomp.c:258
#define MESSY(f)
Definition: regguts.h:422
int nins
Definition: regguts.h:303
color nlcolor
Definition: regcomp.c:243
char op
Definition: regguts.h:410
static struct subre * subre(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:1686
short min
Definition: regguts.h:429
static void onechr(struct vars *, chr, struct state *, struct state *)
Definition: regcomp.c:1561
static void wordchrs(struct vars *)
Definition: regcomp.c:1588
struct state * begin
Definition: regguts.h:433
#define COMBINE(f1, f2)
Definition: regguts.h:425
#define ISERR()
Definition: regcomp.c:262
#define BEHIND
Definition: regcomp.c:286
static void dupnfa(struct nfa *, struct state *, struct state *, struct state *, struct state *)
int nsubexp
Definition: regcomp.c:237
#define ERR(e)
Definition: regcomp.c:265
struct colormap * cm
Definition: regcomp.c:242
static void rainbow(struct nfa *, struct colormap *, int, color, struct state *, struct state *)
#define LACON
Definition: regcomp.c:284
#define REG_BADBR
Definition: regex.h:147
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
char flags
Definition: regguts.h:411
struct subre ** subs
Definition: regcomp.c:238
#define assert(TEST)
Definition: imath.c:37
static void moveins(struct nfa *, struct state *, struct state *)
static void moveouts(struct nfa *, struct state *, struct state *)
#define REG_ADVANCED
Definition: regex.h:103
#define SEE(t)
Definition: regcomp.c:259
struct subre * left
Definition: regguts.h:431
size_t nsubs
Definition: regcomp.c:239
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
#define REG_EXTENDED
Definition: regex.h:101
struct nfa * nfa
Definition: regcomp.c:241
#define PREF(f)
Definition: regguts.h:423
char * s2
#define PLAIN
Definition: regcomp.c:276
#define EMPTYARC(x, y)
Definition: regcomp.c:271
#define BACKR
Definition: regguts.h:416
static struct subre * parsebranch(struct vars *, int, int, struct state *, struct state *, int)
Definition: regcomp.c:728
#define EOS
Definition: regcomp.c:275
static void cbracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1393
#define NWBDRY
Definition: regcomp.c:288
#define DUPINF
Definition: regguts.h:94
#define REG_ASSERT
Definition: regex.h:151
Definition: regguts.h:298
short max
Definition: regguts.h:430
#define REG_NLANCH
Definition: regex.h:110
struct state * end
Definition: regguts.h:434
Definition: regguts.h:408
#define NOTE(b)
Definition: regcomp.c:270
#define LONGER
Definition: regguts.h:412
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
int nouts
Definition: regguts.h:305
#define CAP
Definition: regguts.h:415
#define NOERR()
Definition: regcomp.c:266
#define UP(f)
Definition: regguts.h:421
#define SEND
Definition: regcomp.c:290
int cflags
Definition: regcomp.c:232
#define ARCV(t, val)
#define SHORTER
Definition: regguts.h:413
#define COLORLESS
Definition: regguts.h:137
#define WBDRY
Definition: regcomp.c:287
#define INSIST(c, e)
Definition: regcomp.c:269
static void moresubs(struct vars *, int)
Definition: regcomp.c:494
#define DIGIT
Definition: regcomp.c:277
#define AHEAD
Definition: regcomp.c:285
static struct subre * parse(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:649
#define REG_UPBOTCH
Definition: regex.h:65
int pg_regcomp ( regex_t re,
const chr string,
size_t  len,
int  flags,
Oid  collation 
)

Definition at line 314 of file regcomp.c.

References assert, casecmp(), vars::cflags, guts::cflags, cleanst(), vars::cm, guts::cmap, cmp(), CNOERR, COLORLESS, compact(), vars::cv, vars::cv2, debug, DISCARD, dumpnfa(), EOS, vars::err, nfa::final, subre::flags, freev(), GUTSMAGIC, i, guts::info, nfa::init, initcm(), vars::lacons, guts::lacons, LATYPE_IS_AHEAD, lexstart(), guts::magic, makesearch(), MALLOC, markst(), newcvec(), newline(), newnfa(), vars::nfa, nfanode(), nfatree(), vars::nlacons, guts::nlacons, vars::nlcolor, NOTE, vars::now, guts::nsub, vars::nsubexp, vars::nsubs, vars::ntree, guts::ntree, numst(), okcolors(), optimize(), optst(), parse(), pg_set_regex_collation(), PLAIN, vars::re, regex_t::re_collation, regex_t::re_csize, regex_t::re_fns, regex_t::re_guts, regex_t::re_info, regex_t::re_magic, regex_t::re_nsub, REG_ADVANCED, REG_ADVF, REG_DUMP, REG_ESPACE, REG_EXPANDED, REG_EXTENDED, REG_ICASE, REG_INVARG, REG_NEWLINE, REG_NLANCH, REG_NLSTOP, REG_PROGRESS, REG_QUOTE, REG_USHORTEST, REMAGIC, vars::savenow, vars::savestop, guts::search, SEE, SHORTER, vars::spaceused, specialcolors(), vars::stop, vars::sub10, subcolor(), subre::subno, vars::subs, vars::tree, guts::tree, vars::treechain, vars::treefree, VS, vars::wordchrs, and ZAPCNFA.

Referenced by NIAddAffix(), parse_ident_line(), RE_compile(), and RE_compile_and_cache().

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 }
#define REG_USHORTEST
Definition: regex.h:73
static chr newline(void)
struct subre * treefree
Definition: regcomp.c:247
static void optst(struct vars *, struct subre *)
Definition: regcomp.c:1780
#define REG_NLSTOP
Definition: regex.h:109
char * re_fns
Definition: regex.h:79
static void okcolors(struct nfa *, struct colormap *)
static int numst(struct subre *, int)
Definition: regcomp.c:1796
static long optimize(struct nfa *, FILE *)
int ntree
Definition: regcomp.c:248
struct subre * lacons
Definition: regguts.h:474
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
#define REG_ESPACE
Definition: regex.h:149
int subno
Definition: regguts.h:427
static int freev(struct vars *, int)
Definition: regcomp.c:531
static void specialcolors(struct nfa *)
#define REG_QUOTE
Definition: regex.h:104
const chr * savenow
Definition: regcomp.c:229
static struct cvec * newcvec(int, int)
color nlcolor
Definition: regcomp.c:243
int nlacons
Definition: regguts.h:475
#define REMAGIC
Definition: regguts.h:96
static color subcolor(struct colormap *, chr)
Definition: regguts.h:315
#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 nsubexp
Definition: regcomp.c:237
#define MALLOC(n)
Definition: regcustom.h:62
#define REG_PROGRESS
Definition: regex.h:117
int re_magic
Definition: regex.h:57
struct cnfa search
Definition: regguts.h:470
pg_wchar chr
Definition: regcustom.h:68
size_t re_nsub
Definition: regex.h:58
struct colormap * cm
Definition: regcomp.c:242
#define ZAPCNFA(cnfa)
Definition: regguts.h:371
static void dumpnfa(struct nfa *, FILE *)
bool debug
Definition: pg_standby.c:48
regex_t * re
Definition: regcomp.c:226
int nlacons
Definition: regcomp.c:252
int magic
Definition: regguts.h:464
#define REG_INVARG
Definition: regex.h:152
static void markst(struct subre *)
Definition: regcomp.c:1830
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
struct colormap cmap
Definition: regguts.h:472
#define assert(TEST)
Definition: imath.c:37
#define LATYPE_IS_AHEAD(la)
Definition: regguts.h:104
#define REG_NEWLINE
Definition: regex.h:111
#define REG_ADVANCED
Definition: regex.h:103
#define SEE(t)
Definition: regcomp.c:259
size_t nsubs
Definition: regcomp.c:239
int err
Definition: regcomp.c:231
static long nfanode(struct vars *, struct subre *, int, FILE *)
Definition: regcomp.c:1884
struct nfa * nfa
Definition: regcomp.c:241
#define REG_EXTENDED
Definition: regex.h:101
struct cvec * cv
Definition: regcomp.c:249
struct cvec * cv2
Definition: regcomp.c:250
#define REG_ADVF
Definition: regex.h:102
const chr * savestop
Definition: regcomp.c:230
#define PLAIN
Definition: regcomp.c:276
struct state * wordchrs
Definition: regcomp.c:244
long re_info
Definition: regex.h:59
#define REG_DUMP
Definition: regex.h:115
Definition: regguts.h:462
int ntree
Definition: regguts.h:471
#define EOS
Definition: regcomp.c:275
#define GUTSMAGIC
Definition: regguts.h:465
void pg_set_regex_collation(Oid collation)
const chr * now
Definition: regcomp.c:227
#define REG_NLANCH
Definition: regex.h:110
static const struct fns functions
Definition: regcomp.c:299
#define VS(x)
Definition: regguts.h:61
static int cmp(const chr *, const chr *, size_t)
static void initcm(struct vars *, struct colormap *)
long info
Definition: regguts.h:467
Definition: regguts.h:408
#define NOTE(b)
Definition: regcomp.c:270
#define CNOERR()
const chr * stop
Definition: regcomp.c:228
char * re_guts
Definition: regex.h:78
int cflags
Definition: regguts.h:466
struct state * init
Definition: regguts.h:318
int cflags
Definition: regcomp.c:232
size_t nsub
Definition: regguts.h:468
static void lexstart(struct vars *)
static int casecmp(const chr *, const chr *, size_t)
#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
struct subre * tree
Definition: regcomp.c:245
static void cleanst(struct vars *)
Definition: regcomp.c:1845
size_t spaceused
Definition: regcomp.c:254
struct subre * lacons
Definition: regcomp.c:251
Definition: regcomp.c:224
Oid re_collation
Definition: regex.h:76
static void compact(struct nfa *, struct cnfa *)
static struct subre * parse(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:649
static int pg_wc_isalnum ( pg_wchar  c)
static
static int pg_wc_isalpha ( pg_wchar  c)
static
static int pg_wc_isdigit ( pg_wchar  c)
static
static int pg_wc_isgraph ( pg_wchar  c)
static
static int pg_wc_islower ( pg_wchar  c)
static
static int pg_wc_isprint ( pg_wchar  c)
static
static int pg_wc_ispunct ( pg_wchar  c)
static
static int pg_wc_isspace ( pg_wchar  c)
static
static int pg_wc_isupper ( pg_wchar  c)
static
static pg_wchar pg_wc_tolower ( pg_wchar  c)
static
static pg_wchar pg_wc_toupper ( pg_wchar  c)
static
static void prefixes ( struct vars )
static
static void processlacon ( struct vars v,
struct state begin,
struct state end,
int  latype,
struct state lp,
struct state rp 
)
static

Definition at line 1620 of file regcomp.c.

References AHEAD, assert, BEHIND, cloneouts(), vars::cm, colorcomplement(), LACON, LATYPE_AHEAD_NEG, LATYPE_AHEAD_POS, LATYPE_BEHIND_NEG, LATYPE_BEHIND_POS, newarc(), newlacon(), vars::nfa, NOTREACHED, s1, and single_color_transition().

Referenced by parseqatom().

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 }
static void cloneouts(struct nfa *, struct state *, struct state *, struct state *, int)
#define LATYPE_BEHIND_POS
Definition: regguts.h:101
#define LATYPE_AHEAD_NEG
Definition: regguts.h:100
#define BEHIND
Definition: regcomp.c:286
#define NOTREACHED
Definition: regguts.h:91
#define LATYPE_AHEAD_POS
Definition: regguts.h:99
static struct state * single_color_transition(struct state *, struct state *)
struct colormap * cm
Definition: regcomp.c:242
char * s1
#define LACON
Definition: regcomp.c:284
#define assert(TEST)
Definition: imath.c:37
#define LATYPE_BEHIND_NEG
Definition: regguts.h:102
struct nfa * nfa
Definition: regcomp.c:241
Definition: regguts.h:298
static void newarc(struct nfa *, int, color, struct state *, struct state *)
#define AHEAD
Definition: regcomp.c:285
static int newlacon(struct vars *, struct state *, struct state *, int)
Definition: regcomp.c:1923
static void colorcomplement(struct nfa *, struct colormap *, int, struct state *, struct state *, struct state *)
static color pseudocolor ( struct colormap )
static
static int pull ( struct nfa ,
struct arc ,
struct state **   
)
static
static void pullback ( struct nfa ,
FILE *   
)
static
static int push ( struct nfa ,
struct arc ,
struct state **   
)
static
static void pushfwd ( struct nfa ,
FILE *   
)
static
static void rainbow ( struct nfa ,
struct colormap ,
int  ,
color  ,
struct state ,
struct state  
)
static

Referenced by makesearch(), and parseqatom().

static struct cvec* range ( struct vars ,
chr  ,
chr  ,
int   
)
static

Referenced by brackpart().

static int rcancelrequested ( void  )
static

Definition at line 2015 of file regcomp.c.

References InterruptPending, ProcDiePending, and QueryCancelPending.

2016 {
2018 }
volatile bool QueryCancelPending
Definition: globals.c:30
volatile bool InterruptPending
Definition: globals.c:29
volatile bool ProcDiePending
Definition: globals.c:31
static void repeat ( struct vars v,
struct state lp,
struct state rp,
int  m,
int  n 
)
static

Definition at line 1288 of file regcomp.c.

References delsub(), dupnfa(), EMPTYARC, ERR, INF, moveins(), moveouts(), newstate(), vars::nfa, NOERR, PAIR, REDUCE, REG_ASSERT, s2, and SOME.

Referenced by parseqatom().

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 }
#define PAIR(x, y)
#define REDUCE(x)
Definition: regguts.h:315
static void dupnfa(struct nfa *, struct state *, struct state *, struct state *, struct state *)
#define SOME
#define ERR(e)
Definition: regcomp.c:265
static void moveins(struct nfa *, struct state *, struct state *)
static void moveouts(struct nfa *, struct state *, struct state *)
static struct state * newstate(struct nfa *)
static void delsub(struct nfa *, struct state *, struct state *)
struct nfa * nfa
Definition: regcomp.c:241
char * s2
#define EMPTYARC(x, y)
Definition: regcomp.c:271
#define REG_ASSERT
Definition: regex.h:151
Definition: regguts.h:298
static void repeat(struct vars *, struct state *, struct state *, int, int)
Definition: regcomp.c:1288
#define NOERR()
Definition: regcomp.c:266
#define INF
static void rfree ( regex_t re)
static

Definition at line 1979 of file regcomp.c.

References guts::cmap, FREE, freecm(), freecnfa(), freelacons(), freesubre(), guts::lacons, guts::magic, guts::nlacons, NULLCNFA, regex_t::re_fns, regex_t::re_guts, regex_t::re_magic, REMAGIC, guts::search, and guts::tree.

Referenced by freev().

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 }
char * re_fns
Definition: regex.h:79
static void freelacons(struct subre *, int)
Definition: regcomp.c:1962
struct subre * lacons
Definition: regguts.h:474
struct subre * tree
Definition: regguts.h:469
static void freecm(struct colormap *)
#define NULLCNFA(cnfa)
Definition: regguts.h:372
int nlacons
Definition: regguts.h:475
#define REMAGIC
Definition: regguts.h:96
int re_magic
Definition: regex.h:57
struct cnfa search
Definition: regguts.h:470
int magic
Definition: regguts.h:464
static void freesubre(struct vars *, struct subre *)
Definition: regcomp.c:1738
struct colormap cmap
Definition: regguts.h:472
Definition: regguts.h:462
char * re_guts
Definition: regex.h:78
static void freecnfa(struct cnfa *)
Definition: regcomp.c:224
#define FREE(size)
Definition: saslprep.c:51
static int rstacktoodeep ( void  )
static

Definition at line 2031 of file regcomp.c.

References stack_is_too_deep().

2032 {
2033  return stack_is_too_deep();
2034 }
bool stack_is_too_deep(void)
Definition: postgres.c:3164
static int scannum ( struct vars v)
static

Definition at line 1257 of file regcomp.c.

References DIGIT, DUPMAX, ERR, NEXT, vars::nextvalue, REG_BADBR, and SEE.

Referenced by parseqatom().

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 }
chr nextvalue
Definition: regcomp.c:235
#define DUPMAX
Definition: regguts.h:93
#define NEXT()
Definition: regcomp.c:258
#define ERR(e)
Definition: regcomp.c:265
#define REG_BADBR
Definition: regex.h:147
#define SEE(t)
Definition: regcomp.c:259
#define DIGIT
Definition: regcomp.c:277
static const chr * scanplain ( struct vars v)
static

Definition at line 1536 of file regcomp.c.

References assert, CCLASS, COLLEL, ECLASS, END, ISERR, NEXT, vars::now, PLAIN, and SEE.

Referenced by brackpart().

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 }
#define END
Definition: regcomp.c:282
#define CCLASS
Definition: regcomp.c:281
#define NEXT()
Definition: regcomp.c:258
#define ISERR()
Definition: regcomp.c:262
pg_wchar chr
Definition: regcustom.h:68
#define assert(TEST)
Definition: imath.c:37
#define SEE(t)
Definition: regcomp.c:259
#define PLAIN
Definition: regcomp.c:276
const chr * now
Definition: regcomp.c:227
#define COLLEL
Definition: regcomp.c:279
#define ECLASS
Definition: regcomp.c:280
static struct state* single_color_transition ( struct state ,
struct state  
)
static

Referenced by processlacon().

static void skip ( struct vars )
static
static void sortins ( struct nfa ,
struct state  
)
static
static int sortins_cmp ( const void *  ,
const void *   
)
static
static void sortouts ( struct nfa ,
struct state  
)
static
static int sortouts_cmp ( const void *  ,
const void *   
)
static
static void specialcolors ( struct nfa )
static

Referenced by nfanode(), and pg_regcomp().

static color subcolor ( struct colormap ,
chr   
)
static

Referenced by pg_regcomp().

static void subcolorcvec ( struct vars ,
struct cvec ,
struct state ,
struct state  
)
static

Referenced by brackpart(), and onechr().

static color subcolorhi ( struct colormap ,
color  
)
static
static void subcoloronechr ( struct vars ,
chr  ,
struct state ,
struct state ,
color  
)
static

Referenced by onechr().

static void subcoloronerange ( struct vars ,
chr  ,
chr  ,
struct state ,
struct state ,
color  
)
static
static void subcoloronerow ( struct vars ,
int  ,
struct state ,
struct state ,
color  
)
static
static struct subre * subre ( struct vars v,
int  op,
int  flags,
struct state begin,
struct state end 
)
static

Definition at line 1686 of file regcomp.c.

References assert, subre::begin, subre::chain, subre::cnfa, subre::end, ERR, subre::flags, subre::id, subre::left, MALLOC, subre::max, subre::min, subre::op, vars::re, REG_ESPACE, REG_ETOOBIG, subre::right, STACK_TOO_DEEP, subre::subno, vars::treechain, vars::treefree, and ZAPCNFA.

Referenced by parse(), parsebranch(), and parseqatom().

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 }
struct subre * treefree
Definition: regcomp.c:247
struct subre * treechain
Definition: regcomp.c:246
struct subre * right
Definition: regguts.h:432
#define REG_ESPACE
Definition: regex.h:149
int subno
Definition: regguts.h:427
char op
Definition: regguts.h:410
short min
Definition: regguts.h:429
struct state * begin
Definition: regguts.h:433
#define MALLOC(n)
Definition: regcustom.h:62
#define ERR(e)
Definition: regcomp.c:265
struct subre * chain
Definition: regguts.h:436
#define ZAPCNFA(cnfa)
Definition: regguts.h:371
regex_t * re
Definition: regcomp.c:226
char flags
Definition: regguts.h:411
#define assert(TEST)
Definition: imath.c:37
struct subre * left
Definition: regguts.h:431
short max
Definition: regguts.h:430
#define REG_ETOOBIG
Definition: regex.h:155
struct state * end
Definition: regguts.h:434
Definition: regguts.h:408
struct cnfa cnfa
Definition: regguts.h:435
short id
Definition: regguts.h:426
#define STACK_TOO_DEEP(re)
Definition: regguts.h:455
static void uncolorchain ( struct colormap ,
struct arc  
)
static
static void word ( struct vars v,
int  dir,
struct state lp,
struct state rp 
)
static

Definition at line 1243 of file regcomp.c.

References AHEAD, assert, BEHIND, cloneouts(), vars::nfa, and vars::wordchrs.

Referenced by addNorm(), AddStem(), CheckCompoundAffixes(), cmpspell(), compareWORD(), dxsyn_lexize(), hlfinditem(), itsabbr(), parseqatom(), ScanKeywordLookup(), and unicode_to_utf8word().

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 }
static void cloneouts(struct nfa *, struct state *, struct state *, struct state *, int)
#define BEHIND
Definition: regcomp.c:286
#define assert(TEST)
Definition: imath.c:37
struct nfa * nfa
Definition: regcomp.c:241
struct state * wordchrs
Definition: regcomp.c:244
#define AHEAD
Definition: regcomp.c:285
static void wordchrs ( struct vars v)
static

Definition at line 1588 of file regcomp.c.

References assert, bracket(), ISERR, lexword(), newstate(), NEXT, vars::nfa, NOERR, vars::savenow, SEE, and vars::wordchrs.

Referenced by parseqatom().

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 }
static void lexword(struct vars *)
static void bracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1374
#define NEXT()
Definition: regcomp.c:258
const chr * savenow
Definition: regcomp.c:229
#define ISERR()
Definition: regcomp.c:262
#define assert(TEST)
Definition: imath.c:37
#define SEE(t)
Definition: regcomp.c:259
static struct state * newstate(struct nfa *)
struct nfa * nfa
Definition: regcomp.c:241
struct state * wordchrs
Definition: regcomp.c:244
Definition: regguts.h:298
#define NOERR()
Definition: regcomp.c:266

Variable Documentation

const struct fns functions
static