PostgreSQL Source Code  git master
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

◆ AHEAD

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

Definition at line 285 of file regcomp.c.

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

◆ ARCV

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

Referenced by parseqatom().

◆ BACKREF

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

Definition at line 278 of file regcomp.c.

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

◆ BEHIND

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

◆ CCLASS

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

Definition at line 281 of file regcomp.c.

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

◆ CNOERR

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

Referenced by pg_regcomp().

◆ COLLEL

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

Definition at line 279 of file regcomp.c.

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

◆ COLORED

#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().

◆ COMPATIBLE

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

Definition at line 160 of file regcomp.c.

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

◆ DIGIT

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

Definition at line 277 of file regcomp.c.

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

◆ EAT

#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().

◆ ECLASS

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

Definition at line 280 of file regcomp.c.

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

◆ EMPTY

#define EMPTY   'n' /* no token present */

◆ EMPTYARC

#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().

◆ END

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

Definition at line 282 of file regcomp.c.

Referenced by scanplain().

◆ EOS

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

Definition at line 275 of file regcomp.c.

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

◆ ERR

#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().

◆ INCOMPATIBLE

#define INCOMPATIBLE   1 /* destroys arc */

Definition at line 158 of file regcomp.c.

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

◆ INF

#define INF   3

Referenced by repeat().

◆ INSIST

#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().

◆ ISERR

#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().

◆ LACON

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

Definition at line 284 of file regcomp.c.

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

◆ NEXT

#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().

◆ NOERR

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

◆ NOERRN

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

Definition at line 267 of file regcomp.c.

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

◆ NOERRZ

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

Definition at line 268 of file regcomp.c.

Referenced by nfanode().

◆ NOTE

#define NOTE (   b)    (v->re->re_info |= (b)) /* note visible condition */

◆ NWBDRY

#define NWBDRY   'W' /* non-word-boundary constraint */

Definition at line 288 of file regcomp.c.

Referenced by lexescape(), and parseqatom().

◆ PAIR

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

Referenced by repeat().

◆ PLAIN

◆ PREFER

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

Definition at line 291 of file regcomp.c.

◆ RANGE

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

Definition at line 283 of file regcomp.c.

Referenced by brackpart(), and next().

◆ REDUCE

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

Referenced by repeat().

◆ SATISFIED

#define SATISFIED   2 /* constraint satisfied */

Definition at line 159 of file regcomp.c.

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

◆ SBEGIN

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

Definition at line 289 of file regcomp.c.

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

◆ SEE

#define SEE (   t)    (v->nexttype == (t)) /* is next token this? */

◆ SEND

#define SEND   'Z' /* end of string (even if not EOL) */

Definition at line 290 of file regcomp.c.

Referenced by lexescape(), and parseqatom().

◆ SOME

#define SOME   2

Referenced by repeat().

◆ VERR

#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.

◆ VISERR

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

Definition at line 261 of file regcomp.c.

◆ WBDRY

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

Definition at line 287 of file regcomp.c.

Referenced by lexescape(), and parseqatom().

Function Documentation

◆ addchr()

static void addchr ( struct cvec ,
chr   
)
static

◆ addrange()

static void addrange ( struct cvec ,
chr  ,
chr   
)
static

◆ allcases()

static struct cvec* allcases ( struct vars ,
chr   
)
static

Referenced by onechr().

◆ allocarc()

static struct arc* allocarc ( struct nfa ,
struct state  
)
static

◆ analyze()

static long analyze ( struct nfa )
static

◆ before()

static int before ( chr  ,
chr   
)
static

◆ bracket()

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

Definition at line 1375 of file regcomp.c.

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

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

1378 {
1379  assert(SEE('['));
1380  NEXT();
1381  while (!SEE(']') && !SEE(EOS))
1382  brackpart(v, lp, rp);
1383  assert(SEE(']') || ISERR());
1384  okcolors(v->nfa, v->cm);
1385 }
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:1424
#define EOS
Definition: regcomp.c:275

◆ brackpart()

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

Definition at line 1424 of file regcomp.c.

References cclass(), CCLASS, vars::cflags, COLLEL, vars::cv, 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().

1427 {
1428  chr startc;
1429  chr endc;
1430  struct cvec *cv;
1431  const chr *startp;
1432  const chr *endp;
1433  chr c[1];
1434 
1435  /* parse something, get rid of special cases, take shortcuts */
1436  switch (v->nexttype)
1437  {
1438  case RANGE: /* a-b-c or other botch */
1439  ERR(REG_ERANGE);
1440  return;
1441  break;
1442  case PLAIN:
1443  c[0] = v->nextvalue;
1444  NEXT();
1445  /* shortcut for ordinary chr (not range) */
1446  if (!SEE(RANGE))
1447  {
1448  onechr(v, c[0], lp, rp);
1449  return;
1450  }
1451  startc = element(v, c, c + 1);
1452  NOERR();
1453  break;
1454  case COLLEL:
1455  startp = v->now;
1456  endp = scanplain(v);
1457  INSIST(startp < endp, REG_ECOLLATE);
1458  NOERR();
1459  startc = element(v, startp, endp);
1460  NOERR();
1461  break;
1462  case ECLASS:
1463  startp = v->now;
1464  endp = scanplain(v);
1465  INSIST(startp < endp, REG_ECOLLATE);
1466  NOERR();
1467  startc = element(v, startp, endp);
1468  NOERR();
1469  cv = eclass(v, startc, (v->cflags & REG_ICASE));
1470  NOERR();
1471  subcolorcvec(v, cv, lp, rp);
1472  return;
1473  break;
1474  case CCLASS:
1475  startp = v->now;
1476  endp = scanplain(v);
1477  INSIST(startp < endp, REG_ECTYPE);
1478  NOERR();
1479  cv = cclass(v, startp, endp, (v->cflags & REG_ICASE));
1480  NOERR();
1481  subcolorcvec(v, cv, lp, rp);
1482  return;
1483  break;
1484  default:
1485  ERR(REG_ASSERT);
1486  return;
1487  break;
1488  }
1489 
1490  if (SEE(RANGE))
1491  {
1492  NEXT();
1493  switch (v->nexttype)
1494  {
1495  case PLAIN:
1496  case RANGE:
1497  c[0] = v->nextvalue;
1498  NEXT();
1499  endc = element(v, c, c + 1);
1500  NOERR();
1501  break;
1502  case COLLEL:
1503  startp = v->now;
1504  endp = scanplain(v);
1505  INSIST(startp < endp, REG_ECOLLATE);
1506  NOERR();
1507  endc = element(v, startp, endp);
1508  NOERR();
1509  break;
1510  default:
1511  ERR(REG_ERANGE);
1512  return;
1513  break;
1514  }
1515  }
1516  else
1517  endc = startc;
1518 
1519  /*
1520  * Ranges are unportable. Actually, standard C does guarantee that digits
1521  * are contiguous, but making that an exception is just too complicated.
1522  */
1523  if (startc != endc)
1524  NOTE(REG_UUNPORT);
1525  cv = range(v, startc, endc, (v->cflags & REG_ICASE));
1526  NOERR();
1527  subcolorcvec(v, cv, lp, rp);
1528 }
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:1562
#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:1537
#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

◆ breakconstraintloop()

static void breakconstraintloop ( struct nfa ,
struct state  
)
static

◆ brenext()

static int brenext ( struct vars ,
chr   
)
static

◆ carc_cmp()

static int carc_cmp ( const void *  ,
const void *   
)
static

◆ carcsort()

static void carcsort ( struct carc ,
size_t   
)
static

◆ casecmp()

static int casecmp ( const chr ,
const chr ,
size_t   
)
static

Referenced by pg_regcomp().

◆ cbracket()

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

Definition at line 1394 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().

1397 {
1398  struct state *left = newstate(v->nfa);
1399  struct state *right = newstate(v->nfa);
1400 
1401  NOERR();
1402  bracket(v, left, right);
1403  if (v->cflags & REG_NLSTOP)
1404  newarc(v->nfa, PLAIN, v->nlcolor, left, right);
1405  NOERR();
1406 
1407  assert(lp->nouts == 0); /* all outarcs will be ours */
1408 
1409  /*
1410  * Easy part of complementing, and all there is to do since the MCCE code
1411  * was removed.
1412  */
1413  colorcomplement(v->nfa, v->cm, PLAIN, left, lp, rp);
1414  NOERR();
1415  dropstate(v->nfa, left);
1416  assert(right->nins == 0);
1417  freestate(v->nfa, right);
1418 }
#define REG_NLSTOP
Definition: regex.h:109
static void bracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1375
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 *)

◆ cclass()

static struct cvec* cclass ( struct vars ,
const chr ,
const chr ,
int   
)
static

Referenced by brackpart().

◆ cclass_column_index()

static int cclass_column_index ( struct colormap ,
chr   
)
static

◆ changearctarget()

static void changearctarget ( struct arc ,
struct state  
)
static

◆ chrnamed()

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

◆ cleanst()

static void cleanst ( struct vars v)
static

Definition at line 1846 of file regcomp.c.

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

Referenced by freev(), and pg_regcomp().

1847 {
1848  struct subre *t;
1849  struct subre *next;
1850 
1851  for (t = v->treechain; t != NULL; t = next)
1852  {
1853  next = t->chain;
1854  if (!(t->flags & INUSE))
1855  FREE(t);
1856  }
1857  v->treechain = NULL;
1858  v->treefree = NULL; /* just on general principles */
1859 }
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

◆ cleanup()

static void cleanup ( struct nfa )
static

◆ clearcvec()

static struct cvec* clearcvec ( struct cvec )
static

◆ cleartraverse()

static void cleartraverse ( struct nfa ,
struct state  
)
static

◆ cloneouts()

static void cloneouts ( struct nfa ,
struct state ,
struct state ,
struct state ,
int   
)
static

Referenced by processlacon(), and word().

◆ clonesuccessorstates()

static void clonesuccessorstates ( struct nfa ,
struct state ,
struct state ,
struct state ,
struct arc ,
char *  ,
char *  ,
int   
)
static

◆ cmp()

static int cmp ( const chr ,
const chr ,
size_t   
)
static

Referenced by pg_regcomp().

◆ colorchain()

static void colorchain ( struct colormap ,
struct arc  
)
static

◆ colorcomplement()

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

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

◆ combine()

static int combine ( struct arc ,
struct arc  
)
static

◆ compact()

static void compact ( struct nfa ,
struct cnfa  
)
static

Referenced by nfanode(), and pg_regcomp().

◆ copyins()

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

◆ copyouts()

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

Referenced by makesearch().

◆ cparc()

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

Referenced by makesearch().

◆ createarc()

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

◆ delsub()

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

Referenced by parseqatom(), and repeat().

◆ deltraverse()

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

◆ destroystate()

static void destroystate ( struct nfa ,
struct state  
)
static

◆ dropstate()

static void dropstate ( struct nfa ,
struct state  
)
static

Referenced by cbracket().

◆ dumpnfa()

static void dumpnfa ( struct nfa ,
FILE *   
)
static

Referenced by pg_regcomp().

◆ dupnfa()

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

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

◆ duptraverse()

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

◆ eclass()

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

Referenced by brackpart().

◆ element()

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

Referenced by brackpart().

◆ emptyreachable()

static struct state* emptyreachable ( struct nfa ,
struct state ,
struct state ,
struct arc **   
)
static

◆ findarc()

static struct arc* findarc ( struct state ,
int  ,
color   
)
static

◆ findconstraintloop()

static int findconstraintloop ( struct nfa ,
struct state  
)
static

◆ fixconstraintloops()

static void fixconstraintloops ( struct nfa ,
FILE *   
)
static

◆ fixempties()

static void fixempties ( struct nfa ,
FILE *   
)
static

◆ freearc()

static void freearc ( struct nfa ,
struct arc  
)
static

Referenced by makesearch().

◆ freecm()

static void freecm ( struct colormap )
static

Referenced by rfree().

◆ freecnfa()

static void freecnfa ( struct cnfa )
static

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

◆ freecolor()

static void freecolor ( struct colormap ,
color   
)
static

◆ freecvec()

static void freecvec ( struct cvec )
static

Referenced by freev().

◆ freelacons()

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

Definition at line 1963 of file regcomp.c.

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

Referenced by freev(), and rfree().

1965 {
1966  struct subre *sub;
1967  int i;
1968 
1969  assert(n > 0);
1970  for (sub = subs + 1, i = n - 1; i > 0; sub++, i--) /* no 0th */
1971  if (!NULLCNFA(sub->cnfa))
1972  freecnfa(&sub->cnfa);
1973  FREE(subs);
1974 }
#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

◆ freenfa()

static void freenfa ( struct nfa )
static

Referenced by freev(), and nfanode().

◆ freesrnode()

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

Definition at line 1757 of file regcomp.c.

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

Referenced by freesubre().

1759 {
1760  if (sr == NULL)
1761  return;
1762 
1763  if (!NULLCNFA(sr->cnfa))
1764  freecnfa(&sr->cnfa);
1765  sr->flags = 0;
1766 
1767  if (v != NULL && v->treechain != NULL)
1768  {
1769  /* we're still parsing, maybe we can reuse the subre */
1770  sr->left = v->treefree;
1771  v->treefree = sr;
1772  }
1773  else
1774  FREE(sr);
1775 }
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

◆ freestate()

static void freestate ( struct nfa ,
struct state  
)
static

Referenced by cbracket().

◆ freesubre()

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

Definition at line 1739 of file regcomp.c.

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

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

1741 {
1742  if (sr == NULL)
1743  return;
1744 
1745  if (sr->left != NULL)
1746  freesubre(v, sr->left);
1747  if (sr->right != NULL)
1748  freesubre(v, sr->right);
1749 
1750  freesrnode(v, sr);
1751 }
struct subre * right
Definition: regguts.h:432
static void freesrnode(struct vars *, struct subre *)
Definition: regcomp.c:1757
static void freesubre(struct vars *, struct subre *)
Definition: regcomp.c:1739
struct subre * left
Definition: regguts.h:431

◆ freev()

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:1963
static void rfree(regex_t *)
Definition: regcomp.c:1980
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:1739
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:1846
struct subre * lacons
Definition: regcomp.c:251
#define FREE(size)
Definition: saslprep.c:51

◆ getcvec()

static struct cvec* getcvec ( struct vars ,
int  ,
int   
)
static

◆ hasconstraintout()

static int hasconstraintout ( struct state )
static

◆ hasnonemptyout()

static int hasnonemptyout ( struct state )
static

◆ initcm()

static void initcm ( struct vars ,
struct colormap  
)
static

Referenced by pg_regcomp().

◆ isconstraintarc()

static int isconstraintarc ( struct arc )
static

◆ lexdigits()

static chr lexdigits ( struct vars ,
int  ,
int  ,
int   
)
static

◆ lexescape()

static int lexescape ( struct vars )
static

◆ lexnest()

static void lexnest ( struct vars ,
const chr ,
const chr  
)
static

◆ lexstart()

static void lexstart ( struct vars )
static

Referenced by pg_regcomp().

◆ lexword()

static void lexword ( struct vars )
static

Referenced by wordchrs().

◆ makesearch()

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

◆ markcanreach()

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

◆ markreachable()

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

◆ markst()

static void markst ( struct subre t)
static

Definition at line 1831 of file regcomp.c.

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

Referenced by pg_regcomp().

1832 {
1833  assert(t != NULL);
1834 
1835  t->flags |= INUSE;
1836  if (t->left != NULL)
1837  markst(t->left);
1838  if (t->right != NULL)
1839  markst(t->right);
1840 }
struct subre * right
Definition: regguts.h:432
static void markst(struct subre *)
Definition: regcomp.c:1831
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

◆ maxcolor()

static color maxcolor ( struct colormap )
static

◆ mergeins()

static void mergeins ( struct nfa ,
struct state ,
struct arc **  ,
int   
)
static

◆ moresubs()

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

◆ moveins()

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

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

◆ moveouts()

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

Referenced by parseqatom(), and repeat().

◆ newarc()

static void newarc ( struct nfa ,
int  ,
color  ,
struct state ,
struct state  
)
static

◆ newcolor()

static color newcolor ( struct colormap )
static

◆ newcvec()

static struct cvec* newcvec ( int  ,
int   
)
static

Referenced by pg_regcomp().

◆ newfstate()

static struct state* newfstate ( struct nfa ,
int  flag 
)
static

◆ newhicolorcols()

static void newhicolorcols ( struct colormap )
static

◆ newhicolorrow()

static int newhicolorrow ( struct colormap ,
int   
)
static

◆ newlacon()

static int newlacon ( struct vars v,
struct state begin,
struct state end,
int  latype 
)
static

Definition at line 1924 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().

1928 {
1929  int n;
1930  struct subre *newlacons;
1931  struct subre *sub;
1932 
1933  if (v->nlacons == 0)
1934  {
1935  n = 1; /* skip 0th */
1936  newlacons = (struct subre *) MALLOC(2 * sizeof(struct subre));
1937  }
1938  else
1939  {
1940  n = v->nlacons;
1941  newlacons = (struct subre *) REALLOC(v->lacons,
1942  (n + 1) * sizeof(struct subre));
1943  }
1944  if (newlacons == NULL)
1945  {
1946  ERR(REG_ESPACE);
1947  return 0;
1948  }
1949  v->lacons = newlacons;
1950  v->nlacons = n + 1;
1951  sub = &v->lacons[n];
1952  sub->begin = begin;
1953  sub->end = end;
1954  sub->subno = latype;
1955  ZAPCNFA(sub->cnfa);
1956  return n;
1957 }
#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

◆ newline()

static chr newline ( void  )
static

Referenced by pg_regcomp().

◆ newnfa()

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

Referenced by nfanode(), and pg_regcomp().

◆ newstate()

static struct state* newstate ( struct nfa )
static

◆ newsub()

static color newsub ( struct colormap ,
color   
)
static

◆ next()

static int next ( struct vars )
static

Referenced by cleanst().

◆ nfanode()

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

Definition at line 1885 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().

1889 {
1890  struct nfa *nfa;
1891  long ret = 0;
1892 
1893  assert(t->begin != NULL);
1894 
1895 #ifdef REG_DEBUG
1896  if (f != NULL)
1897  {
1898  char idbuf[50];
1899 
1900  fprintf(f, "\n\n\n========= TREE NODE %s ==========\n",
1901  stid(t, idbuf, sizeof(idbuf)));
1902  }
1903 #endif
1904  nfa = newnfa(v, v->cm, v->nfa);
1905  NOERRZ();
1906  dupnfa(nfa, t->begin, t->end, nfa->init, nfa->final);
1907  if (!ISERR())
1908  specialcolors(nfa);
1909  if (!ISERR())
1910  ret = optimize(nfa, f);
1911  if (converttosearch && !ISERR())
1912  makesearch(v, nfa);
1913  if (!ISERR())
1914  compact(nfa, &t->cnfa);
1915 
1916  freenfa(nfa);
1917  return ret;
1918 }
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 *)

◆ nfatree()

static long nfatree ( struct vars v,
struct subre t,
FILE *  f 
)
static

Definition at line 1865 of file regcomp.c.

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

Referenced by pg_regcomp().

1868 {
1869  assert(t != NULL && t->begin != NULL);
1870 
1871  if (t->left != NULL)
1872  (DISCARD) nfatree(v, t->left, f);
1873  if (t->right != NULL)
1874  (DISCARD) nfatree(v, t->right, f);
1875 
1876  return nfanode(v, t, 0, f);
1877 }
static long nfatree(struct vars *, struct subre *, FILE *)
Definition: regcomp.c:1865
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:1885
#define DISCARD
Definition: regguts.h:58

◆ nonword()

static void nonword ( struct vars v,
int  dir,
struct state lp,
struct state rp 
)
static

Definition at line 1226 of file regcomp.c.

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

Referenced by parseqatom().

1230 {
1231  int anchor = (dir == AHEAD) ? '$' : '^';
1232 
1233  assert(dir == AHEAD || dir == BEHIND);
1234  newarc(v->nfa, anchor, 1, lp, rp);
1235  newarc(v->nfa, anchor, 0, lp, rp);
1236  colorcomplement(v->nfa, v->cm, dir, v->wordchrs, lp, rp);
1237  /* (no need for special attention to \n) */
1238 }
#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 *)

◆ numst()

static int numst ( struct subre t,
int  start 
)
static

Definition at line 1797 of file regcomp.c.

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

Referenced by pg_regcomp().

1799 {
1800  int i;
1801 
1802  assert(t != NULL);
1803 
1804  i = start;
1805  t->id = (short) i++;
1806  if (t->left != NULL)
1807  i = numst(t->left, i);
1808  if (t->right != NULL)
1809  i = numst(t->right, i);
1810  return i;
1811 }
static int numst(struct subre *, int)
Definition: regcomp.c:1797
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

◆ okcolors()

static void okcolors ( struct nfa ,
struct colormap  
)
static

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

◆ onechr()

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

Definition at line 1562 of file regcomp.c.

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

Referenced by brackpart(), and parseqatom().

1566 {
1567  if (!(v->cflags & REG_ICASE))
1568  {
1569  color lastsubcolor = COLORLESS;
1570 
1571  subcoloronechr(v, c, lp, rp, &lastsubcolor);
1572  return;
1573  }
1574 
1575  /* rats, need general case anyway... */
1576  subcolorcvec(v, allcases(v, c), lp, rp);
1577 }
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

◆ optimize()

static long optimize ( struct nfa ,
FILE *   
)
static

Referenced by nfanode(), and pg_regcomp().

◆ optst()

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

Definition at line 1781 of file regcomp.c.

Referenced by pg_regcomp().

1783 {
1784  /*
1785  * DGP (2007-11-13): I assume it was the programmer's intent to eventually
1786  * come back and add code to optimize subRE trees, but the routine coded
1787  * just spends effort traversing the tree and doing nothing. We can do
1788  * nothing with less effort.
1789  */
1790  return;
1791 }

◆ parse()

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(), add_paths_to_grouping_rel(), build_minmax_path(), can_partial_agg(), check_sql_fn_retval(), consider_groupingsets_paths(), convert_ANY_sublink_to_join(), convert_EXISTS_sublink_to_join(), create_degenerate_grouping_paths(), create_distinct_paths(), create_grouping_paths(), create_partial_grouping_paths(), expand_inherited_rtentry(), expand_single_inheritance_child(), flatten_simple_union_all(), get_number_of_groups(), grouping_planner(), inheritance_planner(), is_degenerate_grouping(), 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:1687
#define ERR(e)
Definition: regcomp.c:265
static void freesubre(struct vars *, struct subre *)
Definition: regcomp.c:1739
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

◆ parsebranch()

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:1687
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

◆ parseqatom()

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 vars::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  /* fall through into case PLAIN */
913  /* FALLTHROUGH */
914  case PLAIN:
915  onechr(v, v->nextvalue, lp, rp);
916  okcolors(v->nfa, v->cm);
917  NOERR();
918  NEXT();
919  break;
920  case '[':
921  if (v->nextvalue == 1)
922  bracket(v, lp, rp);
923  else
924  cbracket(v, lp, rp);
925  assert(SEE(']') || ISERR());
926  NEXT();
927  break;
928  case '.':
929  rainbow(v->nfa, v->cm, PLAIN,
930  (v->cflags & REG_NLSTOP) ? v->nlcolor : COLORLESS,
931  lp, rp);
932  NEXT();
933  break;
934  /* and finally the ugly stuff */
935  case '(': /* value flags as capturing or non */
936  cap = (type == LACON) ? 0 : v->nextvalue;
937  if (cap)
938  {
939  v->nsubexp++;
940  subno = v->nsubexp;
941  if ((size_t) subno >= v->nsubs)
942  moresubs(v, subno);
943  assert((size_t) subno < v->nsubs);
944  }
945  else
946  atomtype = PLAIN; /* something that's not '(' */
947  NEXT();
948  /* need new endpoints because tree will contain pointers */
949  s = newstate(v->nfa);
950  s2 = newstate(v->nfa);
951  NOERR();
952  EMPTYARC(lp, s);
953  EMPTYARC(s2, rp);
954  NOERR();
955  atom = parse(v, ')', type, s, s2);
956  assert(SEE(')') || ISERR());
957  NEXT();
958  NOERR();
959  if (cap)
960  {
961  v->subs[subno] = atom;
962  t = subre(v, '(', atom->flags | CAP, lp, rp);
963  NOERR();
964  t->subno = subno;
965  t->left = atom;
966  atom = t;
967  }
968  /* postpone everything else pending possible {0} */
969  break;
970  case BACKREF: /* the Feature From The Black Lagoon */
972  INSIST(v->nextvalue < v->nsubs, REG_ESUBREG);
973  INSIST(v->subs[v->nextvalue] != NULL, REG_ESUBREG);
974  NOERR();
975  assert(v->nextvalue > 0);
976  atom = subre(v, 'b', BACKR, lp, rp);
977  NOERR();
978  subno = v->nextvalue;
979  atom->subno = subno;
980  EMPTYARC(lp, rp); /* temporarily, so there's something */
981  NEXT();
982  break;
983  }
984 
985  /* ...and an atom may be followed by a quantifier */
986  switch (v->nexttype)
987  {
988  case '*':
989  m = 0;
990  n = DUPINF;
991  qprefer = (v->nextvalue) ? LONGER : SHORTER;
992  NEXT();
993  break;
994  case '+':
995  m = 1;
996  n = DUPINF;
997  qprefer = (v->nextvalue) ? LONGER : SHORTER;
998  NEXT();
999  break;
1000  case '?':
1001  m = 0;
1002  n = 1;
1003  qprefer = (v->nextvalue) ? LONGER : SHORTER;
1004  NEXT();
1005  break;
1006  case '{':
1007  NEXT();
1008  m = scannum(v);
1009  if (EAT(','))
1010  {
1011  if (SEE(DIGIT))
1012  n = scannum(v);
1013  else
1014  n = DUPINF;
1015  if (m > n)
1016  {
1017  ERR(REG_BADBR);
1018  return;
1019  }
1020  /* {m,n} exercises preference, even if it's {m,m} */
1021  qprefer = (v->nextvalue) ? LONGER : SHORTER;
1022  }
1023  else
1024  {
1025  n = m;
1026  /* {m} passes operand's preference through */
1027  qprefer = 0;
1028  }
1029  if (!SEE('}'))
1030  { /* catches errors too */
1031  ERR(REG_BADBR);
1032  return;
1033  }
1034  NEXT();
1035  break;
1036  default: /* no quantifier */
1037  m = n = 1;
1038  qprefer = 0;
1039  break;
1040  }
1041 
1042  /* annoying special case: {0} or {0,0} cancels everything */
1043  if (m == 0 && n == 0)
1044  {
1045  if (atom != NULL)
1046  freesubre(v, atom);
1047  if (atomtype == '(')
1048  v->subs[subno] = NULL;
1049  delsub(v->nfa, lp, rp);
1050  EMPTYARC(lp, rp);
1051  return;
1052  }
1053 
1054  /* if not a messy case, avoid hard part */
1055  assert(!MESSY(top->flags));
1056  f = top->flags | qprefer | ((atom != NULL) ? atom->flags : 0);
1057  if (atomtype != '(' && atomtype != BACKREF && !MESSY(UP(f)))
1058  {
1059  if (!(m == 1 && n == 1))
1060  repeat(v, lp, rp, m, n);
1061  if (atom != NULL)
1062  freesubre(v, atom);
1063  top->flags = f;
1064  return;
1065  }
1066 
1067  /*
1068  * hard part: something messy
1069  *
1070  * That is, capturing parens, back reference, short/long clash, or an atom
1071  * with substructure containing one of those.
1072  */
1073 
1074  /* now we'll need a subre for the contents even if they're boring */
1075  if (atom == NULL)
1076  {
1077  atom = subre(v, '=', 0, lp, rp);
1078  NOERR();
1079  }
1080 
1081  /*----------
1082  * Prepare a general-purpose state skeleton.
1083  *
1084  * In the no-backrefs case, we want this:
1085  *
1086  * [lp] ---> [s] ---prefix---> [begin] ---atom---> [end] ---rest---> [rp]
1087  *
1088  * where prefix is some repetitions of atom. In the general case we need
1089  *
1090  * [lp] ---> [s] ---iterator---> [s2] ---rest---> [rp]
1091  *
1092  * where the iterator wraps around [begin] ---atom---> [end]
1093  *
1094  * We make the s state here for both cases; s2 is made below if needed
1095  *----------
1096  */
1097  s = newstate(v->nfa); /* first, new endpoints for the atom */
1098  s2 = newstate(v->nfa);
1099  NOERR();
1100  moveouts(v->nfa, lp, s);
1101  moveins(v->nfa, rp, s2);
1102  NOERR();
1103  atom->begin = s;
1104  atom->end = s2;
1105  s = newstate(v->nfa); /* set up starting state */
1106  NOERR();
1107  EMPTYARC(lp, s);
1108  NOERR();
1109 
1110  /* break remaining subRE into x{...} and what follows */
1111  t = subre(v, '.', COMBINE(qprefer, atom->flags), lp, rp);
1112  NOERR();
1113  t->left = atom;
1114  atomp = &t->left;
1115 
1116  /* here we should recurse... but we must postpone that to the end */
1117 
1118  /* split top into prefix and remaining */
1119  assert(top->op == '=' && top->left == NULL && top->right == NULL);
1120  top->left = subre(v, '=', top->flags, top->begin, lp);
1121  NOERR();
1122  top->op = '.';
1123  top->right = t;
1124 
1125  /* if it's a backref, now is the time to replicate the subNFA */
1126  if (atomtype == BACKREF)
1127  {
1128  assert(atom->begin->nouts == 1); /* just the EMPTY */
1129  delsub(v->nfa, atom->begin, atom->end);
1130  assert(v->subs[subno] != NULL);
1131 
1132  /*
1133  * And here's why the recursion got postponed: it must wait until the
1134  * skeleton is filled in, because it may hit a backref that wants to
1135  * copy the filled-in skeleton.
1136  */
1137  dupnfa(v->nfa, v->subs[subno]->begin, v->subs[subno]->end,
1138  atom->begin, atom->end);
1139  NOERR();
1140  }
1141 
1142  /*
1143  * It's quantifier time. If the atom is just a backref, we'll let it deal
1144  * with quantifiers internally.
1145  */
1146  if (atomtype == BACKREF)
1147  {
1148  /* special case: backrefs have internal quantifiers */
1149  EMPTYARC(s, atom->begin); /* empty prefix */
1150  /* just stuff everything into atom */
1151  repeat(v, atom->begin, atom->end, m, n);
1152  atom->min = (short) m;
1153  atom->max = (short) n;
1154  atom->flags |= COMBINE(qprefer, atom->flags);
1155  /* rest of branch can be strung starting from atom->end */
1156  s2 = atom->end;
1157  }
1158  else if (m == 1 && n == 1)
1159  {
1160  /* no/vacuous quantifier: done */
1161  EMPTYARC(s, atom->begin); /* empty prefix */
1162  /* rest of branch can be strung starting from atom->end */
1163  s2 = atom->end;
1164  }
1165  else if (m > 0 && !(atom->flags & BACKR))
1166  {
1167  /*
1168  * If there's no backrefs involved, we can turn x{m,n} into
1169  * x{m-1,n-1}x, with capturing parens in only the second x. This is
1170  * valid because we only care about capturing matches from the final
1171  * iteration of the quantifier. It's a win because we can implement
1172  * the backref-free left side as a plain DFA node, since we don't
1173  * really care where its submatches are.
1174  */
1175  dupnfa(v->nfa, atom->begin, atom->end, s, atom->begin);
1176  assert(m >= 1 && m != DUPINF && n >= 1);
1177  repeat(v, s, atom->begin, m - 1, (n == DUPINF) ? n : n - 1);
1178  f = COMBINE(qprefer, atom->flags);
1179  t = subre(v, '.', f, s, atom->end); /* prefix and atom */
1180  NOERR();
1181  t->left = subre(v, '=', PREF(f), s, atom->begin);
1182  NOERR();
1183  t->right = atom;
1184  *atomp = t;
1185  /* rest of branch can be strung starting from atom->end */
1186  s2 = atom->end;
1187  }
1188  else
1189  {
1190  /* general case: need an iteration node */
1191  s2 = newstate(v->nfa);
1192  NOERR();
1193  moveouts(v->nfa, atom->end, s2);
1194  NOERR();
1195  dupnfa(v->nfa, atom->begin, atom->end, s, s2);
1196  repeat(v, s, s2, m, n);
1197  f = COMBINE(qprefer, atom->flags);
1198  t = subre(v, '*', f, s, s2);
1199  NOERR();
1200  t->min = (short) m;
1201  t->max = (short) n;
1202  t->left = atom;
1203  *atomp = t;
1204  /* rest of branch is to be strung from iteration's end state */
1205  }
1206 
1207  /* and finally, look after that postponed recursion */
1208  t = top->right;
1209  if (!(SEE('|') || SEE(stopper) || SEE(EOS)))
1210  t->right = parsebranch(v, stopper, type, s2, rp, 1);
1211  else
1212  {
1213  EMPTYARC(s2, rp);
1214  t->right = subre(v, '=', 0, s2, rp);
1215  }
1216  NOERR();
1217  assert(SEE('|') || SEE(stopper) || SEE(EOS));
1218  t->flags |= COMBINE(t->flags, t->right->flags);
1219  top->flags |= COMBINE(top->flags, t->flags);
1220 }
#define EAT(t)
Definition: regcomp.c:260
static int scannum(struct vars *)
Definition: regcomp.c:1258
#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:1375
static void nonword(struct vars *, int, struct state *, struct state *)
Definition: regcomp.c:1226
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:1687
short min
Definition: regguts.h:429
static void onechr(struct vars *, chr, struct state *, struct state *)
Definition: regcomp.c:1562
static void wordchrs(struct vars *)
Definition: regcomp.c:1589
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:1739
#define REG_BADRPT
Definition: regex.h:150
static void processlacon(struct vars *, struct state *, struct state *, int, struct state *, struct state *)
Definition: regcomp.c:1621
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:1394
#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:1289
static void word(struct vars *, int, struct state *, struct state *)
Definition: regcomp.c:1244
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

◆ pg_regcomp()

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(), vars::g, 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:1781
#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:1797
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:1865
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:1831
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:1885
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:1846
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

◆ pg_wc_isalnum()

static int pg_wc_isalnum ( pg_wchar  c)
static

◆ pg_wc_isalpha()

static int pg_wc_isalpha ( pg_wchar  c)
static

◆ pg_wc_isdigit()

static int pg_wc_isdigit ( pg_wchar  c)
static

◆ pg_wc_isgraph()

static int pg_wc_isgraph ( pg_wchar  c)
static

◆ pg_wc_islower()

static int pg_wc_islower ( pg_wchar  c)
static

◆ pg_wc_isprint()

static int pg_wc_isprint ( pg_wchar  c)
static

◆ pg_wc_ispunct()

static int pg_wc_ispunct ( pg_wchar  c)
static

◆ pg_wc_isspace()

static int pg_wc_isspace ( pg_wchar  c)
static

◆ pg_wc_isupper()

static int pg_wc_isupper ( pg_wchar  c)
static

◆ pg_wc_tolower()

static pg_wchar pg_wc_tolower ( pg_wchar  c)
static

◆ pg_wc_toupper()

static pg_wchar pg_wc_toupper ( pg_wchar  c)
static

◆ prefixes()

static void prefixes ( struct vars )
static

◆ processlacon()

static void processlacon ( struct vars v,
struct state begin,
struct state end,
int  latype,
struct state lp,
struct state rp 
)
static

Definition at line 1621 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().

1627 {
1628  struct state *s1;
1629  int n;
1630 
1631  /*
1632  * Check for lookaround RE consisting of a single plain color arc (or set
1633  * of arcs); this would typically be a simple chr or a bracket expression.
1634  */
1635  s1 = single_color_transition(begin, end);
1636  switch (latype)
1637  {
1638  case LATYPE_AHEAD_POS:
1639  /* If lookahead RE is just colorset C, convert to AHEAD(C) */
1640  if (s1 != NULL)
1641  {
1642  cloneouts(v->nfa, s1, lp, rp, AHEAD);
1643  return;
1644  }
1645  break;
1646  case LATYPE_AHEAD_NEG:
1647  /* If lookahead RE is just colorset C, convert to AHEAD(^C)|$ */
1648  if (s1 != NULL)
1649  {
1650  colorcomplement(v->nfa, v->cm, AHEAD, s1, lp, rp);
1651  newarc(v->nfa, '$', 1, lp, rp);
1652  newarc(v->nfa, '$', 0, lp, rp);
1653  return;
1654  }
1655  break;
1656  case LATYPE_BEHIND_POS:
1657  /* If lookbehind RE is just colorset C, convert to BEHIND(C) */
1658  if (s1 != NULL)
1659  {
1660  cloneouts(v->nfa, s1, lp, rp, BEHIND);
1661  return;
1662  }
1663  break;
1664  case LATYPE_BEHIND_NEG:
1665  /* If lookbehind RE is just colorset C, convert to BEHIND(^C)|^ */
1666  if (s1 != NULL)
1667  {
1668  colorcomplement(v->nfa, v->cm, BEHIND, s1, lp, rp);
1669  newarc(v->nfa, '^', 1, lp, rp);
1670  newarc(v->nfa, '^', 0, lp, rp);
1671  return;
1672  }
1673  break;
1674  default:
1675  assert(NOTREACHED);
1676  }
1677 
1678  /* General case: we need a LACON subre and arc */
1679  n = newlacon(v, begin, end, latype);
1680  newarc(v->nfa, LACON, n, lp, rp);
1681 }
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:1924
static void colorcomplement(struct nfa *, struct colormap *, int, struct state *, struct state *, struct state *)

◆ pseudocolor()

static color pseudocolor ( struct colormap )
static

◆ pull()

static int pull ( struct nfa ,
struct arc ,
struct state **   
)
static

◆ pullback()

static void pullback ( struct nfa ,
FILE *   
)
static

◆ push()

static int push ( struct nfa ,
struct arc ,
struct state **   
)
static

◆ pushfwd()

static void pushfwd ( struct nfa ,
FILE *   
)
static

◆ rainbow()

static void rainbow ( struct nfa ,
struct colormap ,
int  ,
color  ,
struct state ,
struct state  
)
static

Referenced by makesearch(), and parseqatom().

◆ range()

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

Referenced by brackpart().

◆ rcancelrequested()

static int rcancelrequested ( void  )
static

Definition at line 2016 of file regcomp.c.

References InterruptPending, ProcDiePending, and QueryCancelPending.

2017 {
2019 }
volatile bool QueryCancelPending
Definition: globals.c:31
volatile bool InterruptPending
Definition: globals.c:30
volatile bool ProcDiePending
Definition: globals.c:32

◆ repeat()

static void repeat ( struct vars v,
struct state lp,
struct state rp,
int  m,
int  n 
)
static

Definition at line 1289 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().

1294 {
1295 #define SOME 2
1296 #define INF 3
1297 #define PAIR(x, y) ((x)*4 + (y))
1298 #define REDUCE(x) ( ((x) == DUPINF) ? INF : (((x) > 1) ? SOME : (x)) )
1299  const int rm = REDUCE(m);
1300  const int rn = REDUCE(n);
1301  struct state *s;
1302  struct state *s2;
1303 
1304  switch (PAIR(rm, rn))
1305  {
1306  case PAIR(0, 0): /* empty string */
1307  delsub(v->nfa, lp, rp);
1308  EMPTYARC(lp, rp);
1309  break;
1310  case PAIR(0, 1): /* do as x| */
1311  EMPTYARC(lp, rp);
1312  break;
1313  case PAIR(0, SOME): /* do as x{1,n}| */
1314  repeat(v, lp, rp, 1, n);
1315  NOERR();
1316  EMPTYARC(lp, rp);
1317  break;
1318  case PAIR(0, INF): /* loop x around */
1319  s = newstate(v->nfa);
1320  NOERR();
1321  moveouts(v->nfa, lp, s);
1322  moveins(v->nfa, rp, s);
1323  EMPTYARC(lp, s);
1324  EMPTYARC(s, rp);
1325  break;
1326  case PAIR(1, 1): /* no action required */
1327  break;
1328  case PAIR(1, SOME): /* do as x{0,n-1}x = (x{1,n-1}|)x */
1329  s = newstate(v->nfa);
1330  NOERR();
1331  moveouts(v->nfa, lp, s);
1332  dupnfa(v->nfa, s, rp, lp, s);
1333  NOERR();
1334  repeat(v, lp, s, 1, n - 1);
1335  NOERR();
1336  EMPTYARC(lp, s);
1337  break;
1338  case PAIR(1, INF): /* add loopback arc */
1339  s = newstate(v->nfa);
1340  s2 = newstate(v->nfa);
1341  NOERR();
1342  moveouts(v->nfa, lp, s);
1343  moveins(v->nfa, rp, s2);
1344  EMPTYARC(lp, s);
1345  EMPTYARC(s2, rp);
1346  EMPTYARC(s2, s);
1347  break;
1348  case PAIR(SOME, SOME): /* do as x{m-1,n-1}x */
1349  s = newstate(v->nfa);
1350  NOERR();
1351  moveouts(v->nfa, lp, s);
1352  dupnfa(v->nfa, s, rp, lp, s);
1353  NOERR();
1354  repeat(v, lp, s, m - 1, n - 1);
1355  break;
1356  case PAIR(SOME, INF): /* do as x{m-1,}x */
1357  s = newstate(v->nfa);
1358  NOERR();
1359  moveouts(v->nfa, lp, s);
1360  dupnfa(v->nfa, s, rp, lp, s);
1361  NOERR();
1362  repeat(v, lp, s, m - 1, n);
1363  break;
1364  default:
1365  ERR(REG_ASSERT);
1366  break;
1367  }
1368 }
#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:1289
#define NOERR()
Definition: regcomp.c:266
#define INF

◆ rfree()

static void rfree ( regex_t re)
static

Definition at line 1980 of file regcomp.c.

References guts::cmap, FREE, freecm(), freecnfa(), freelacons(), freesubre(), vars::g, 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().

1981 {
1982  struct guts *g;
1983 
1984  if (re == NULL || re->re_magic != REMAGIC)
1985  return;
1986 
1987  re->re_magic = 0; /* invalidate RE */
1988  g = (struct guts *) re->re_guts;
1989  re->re_guts = NULL;
1990  re->re_fns = NULL;
1991  if (g != NULL)
1992  {
1993  g->magic = 0;
1994  freecm(&g->cmap);
1995  if (g->tree != NULL)
1996  freesubre((struct vars *) NULL, g->tree);
1997  if (g->lacons != NULL)
1998  freelacons(g->lacons, g->nlacons);
1999  if (!NULLCNFA(g->search))
2000  freecnfa(&g->search);
2001  FREE(g);
2002  }
2003 }
char * re_fns
Definition: regex.h:79
static void freelacons(struct subre *, int)
Definition: regcomp.c:1963
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:1739
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

◆ rstacktoodeep()

◆ scannum()

static int scannum ( struct vars v)
static

Definition at line 1258 of file regcomp.c.

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

Referenced by parseqatom().

1259 {
1260  int n = 0;
1261 
1262  while (SEE(DIGIT) && n < DUPMAX)
1263  {
1264  n = n * 10 + v->nextvalue;
1265  NEXT();
1266  }
1267  if (SEE(DIGIT) || n > DUPMAX)
1268  {
1269  ERR(REG_BADBR);
1270  return 0;
1271  }
1272  return n;
1273 }
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

◆ scanplain()

static const chr * scanplain ( struct vars v)
static

Definition at line 1537 of file regcomp.c.

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

Referenced by brackpart().

1538 {
1539  const chr *endp;
1540 
1541  assert(SEE(COLLEL) || SEE(ECLASS) || SEE(CCLASS));
1542  NEXT();
1543 
1544  endp = v->now;
1545  while (SEE(PLAIN))
1546  {
1547  endp = v->now;
1548  NEXT();
1549  }
1550 
1551  assert(SEE(END) || ISERR());
1552  NEXT();
1553 
1554  return endp;
1555 }
#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

◆ single_color_transition()

static struct state* single_color_transition ( struct state ,
struct state  
)
static

Referenced by processlacon().

◆ skip()

static void skip ( struct vars )
static

◆ sortins()

static void sortins ( struct nfa ,
struct state  
)
static

◆ sortins_cmp()

static int sortins_cmp ( const void *  ,
const void *   
)
static

◆ sortouts()

static void sortouts ( struct nfa ,
struct state  
)
static

◆ sortouts_cmp()

static int sortouts_cmp ( const void *  ,
const void *   
)
static

◆ specialcolors()

static void specialcolors ( struct nfa )
static

Referenced by nfanode(), and pg_regcomp().

◆ subcolor()

static color subcolor ( struct colormap ,
chr   
)
static

Referenced by pg_regcomp().

◆ subcolorcvec()

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

Referenced by brackpart(), and onechr().

◆ subcolorhi()

static color subcolorhi ( struct colormap ,
color  
)
static

◆ subcoloronechr()

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

Referenced by onechr().

◆ subcoloronerange()

static void subcoloronerange ( struct vars ,
chr  ,
chr  ,
struct state ,
struct state ,
color  
)
static

◆ subcoloronerow()

static void subcoloronerow ( struct vars ,
int  ,
struct state ,
struct state ,
color  
)
static

◆ subre()

static struct subre * subre ( struct vars v,
int  op,
int  flags,
struct state begin,
struct state end 
)
static

Definition at line 1687 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().

1692 {
1693  struct subre *ret = v->treefree;
1694 
1695  /*
1696  * Checking for stack overflow here is sufficient to protect parse() and
1697  * its recursive subroutines.
1698  */
1699  if (STACK_TOO_DEEP(v->re))
1700  {
1701  ERR(REG_ETOOBIG);
1702  return NULL;
1703  }
1704 
1705  if (ret != NULL)
1706  v->treefree = ret->left;
1707  else
1708  {
1709  ret = (struct subre *) MALLOC(sizeof(struct subre));
1710  if (ret == NULL)
1711  {
1712  ERR(REG_ESPACE);
1713  return NULL;
1714  }
1715  ret->chain = v->treechain;
1716  v->treechain = ret;
1717  }
1718 
1719  assert(strchr("=b|.*(", op) != NULL);
1720 
1721  ret->op = op;
1722  ret->flags = flags;
1723  ret->id = 0; /* will be assigned later */
1724  ret->subno = 0;
1725  ret->min = ret->max = 1;
1726  ret->left = NULL;
1727  ret->right = NULL;
1728  ret->begin = begin;
1729  ret->end = end;
1730  ZAPCNFA(ret->cnfa);
1731 
1732  return ret;
1733 }
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

◆ uncolorchain()

static void uncolorchain ( struct colormap ,
struct arc  
)
static

◆ word()

static void word ( struct vars v,
int  dir,
struct state lp,
struct state rp 
)
static

Definition at line 1244 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().

1248 {
1249  assert(dir == AHEAD || dir == BEHIND);
1250  cloneouts(v->nfa, v->wordchrs, lp, rp, dir);
1251  /* (no need for special attention to \n) */
1252 }
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

◆ wordchrs()

static void wordchrs ( struct vars v)
static

Definition at line 1589 of file regcomp.c.

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

1590 {
1591  struct state *left;
1592  struct state *right;
1593 
1594  if (v->wordchrs != NULL)
1595  {
1596  NEXT(); /* for consistency */
1597  return;
1598  }
1599 
1600  left = newstate(v->nfa);
1601  right = newstate(v->nfa);
1602  NOERR();
1603  /* fine point: implemented with [::], and lexer will set REG_ULOCALE */
1604  lexword(v);
1605  NEXT();
1606  assert(v->savenow != NULL && SEE('['));
1607  bracket(v, left, right);
1608  assert((v->savenow != NULL && SEE(']')) || ISERR());
1609  NEXT();
1610  NOERR();
1611  v->wordchrs = left;
1612 }
static void lexword(struct vars *)
static void bracket(struct vars *, struct state *, struct state *)
Definition: regcomp.c:1375
#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

◆ functions

const struct fns functions
static