PostgreSQL Source Code  git master
regguts.h
Go to the documentation of this file.
1 /*
2  * Internal interface definitions, etc., for the reg package
3  *
4  * Copyright (c) 1998, 1999 Henry Spencer. All rights reserved.
5  *
6  * Development of this software was funded, in part, by Cray Research Inc.,
7  * UUNET Communications Services Inc., Sun Microsystems Inc., and Scriptics
8  * Corporation, none of whom are responsible for the results. The author
9  * thanks all of them.
10  *
11  * Redistribution and use in source and binary forms -- with or without
12  * modification -- are permitted for any purpose, provided that
13  * redistributions in source form retain this entire copyright notice and
14  * indicate the origin and nature of any modifications.
15  *
16  * I'd appreciate being given credit for this package in the documentation
17  * of software which uses it, but that is not a requirement.
18  *
19  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
20  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
21  * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
22  * HENRY SPENCER BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
23  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
25  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
26  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
27  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
28  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29  *
30  * src/include/regex/regguts.h
31  */
32 
33 
34 
35 /*
36  * Environmental customization. It should not (I hope) be necessary to
37  * alter the file you are now reading -- regcustom.h should handle it all,
38  * given care here and elsewhere.
39  */
40 #include "regcustom.h"
41 
42 
43 
44 /*
45  * Things that regcustom.h might override.
46  */
47 
48 /* assertions */
49 #ifndef assert
50 #ifndef REG_DEBUG
51 #define NDEBUG /* no assertions */
52 #endif
53 #include <assert.h>
54 #endif
55 
56 /* voids */
57 #ifndef DISCARD
58 #define DISCARD void /* for throwing values away */
59 #endif
60 #ifndef VS
61 #define VS(x) ((void *)(x)) /* cast something to generic ptr */
62 #endif
63 
64 /* function-pointer declarator */
65 #ifndef FUNCPTR
66 #define FUNCPTR(name, args) (*(name)) args
67 #endif
68 
69 /* memory allocation */
70 #ifndef MALLOC
71 #define MALLOC(n) malloc(n)
72 #endif
73 #ifndef REALLOC
74 #define REALLOC(p, n) realloc(VS(p), n)
75 #endif
76 #ifndef FREE
77 #define FREE(p) free(VS(p))
78 #endif
79 
80 /* interruption */
81 #ifndef INTERRUPT
82 #define INTERRUPT(re)
83 #endif
84 
85 /* want size of a char in bits, and max value in bounded quantifiers */
86 #ifndef _POSIX2_RE_DUP_MAX
87 #define _POSIX2_RE_DUP_MAX 255 /* normally from <limits.h> */
88 #endif
89 
90 
91 
92 /*
93  * misc
94  */
95 
96 #define NOTREACHED 0
97 
98 #define DUPMAX _POSIX2_RE_DUP_MAX
99 #define DUPINF (DUPMAX+1)
100 
101 #define REMAGIC 0xfed7 /* magic number for main struct */
102 
103 /* Type codes for lookaround constraints */
104 #define LATYPE_AHEAD_POS 03 /* positive lookahead */
105 #define LATYPE_AHEAD_NEG 02 /* negative lookahead */
106 #define LATYPE_BEHIND_POS 01 /* positive lookbehind */
107 #define LATYPE_BEHIND_NEG 00 /* negative lookbehind */
108 #define LATYPE_IS_POS(la) ((la) & 01)
109 #define LATYPE_IS_AHEAD(la) ((la) & 02)
110 
111 
112 /*
113  * debugging facilities
114  */
115 #ifdef REG_DEBUG
116 /* FDEBUG does finite-state tracing */
117 #define FDEBUG(arglist) { if (v->eflags&REG_FTRACE) printf arglist; }
118 /* MDEBUG does higher-level tracing */
119 #define MDEBUG(arglist) { if (v->eflags&REG_MTRACE) printf arglist; }
120 #else
121 #define FDEBUG(arglist) {}
122 #define MDEBUG(arglist) {}
123 #endif
124 
125 
126 
127 /*
128  * bitmap manipulation
129  */
130 #define UBITS (CHAR_BIT * sizeof(unsigned))
131 #define BSET(uv, sn) ((uv)[(sn)/UBITS] |= (unsigned)1 << ((sn)%UBITS))
132 #define ISBSET(uv, sn) ((uv)[(sn)/UBITS] & ((unsigned)1 << ((sn)%UBITS)))
133 
134 
135 /*
136  * known character classes
137  */
139 {
142 };
143 
144 #define NUM_CCLASSES 14
145 
146 
147 /*
148  * As soon as possible, we map chrs into equivalence classes -- "colors" --
149  * which are of much more manageable number.
150  *
151  * To further reduce the number of arcs in NFAs and DFAs, we also have a
152  * special RAINBOW "color" that can be assigned to an arc. This is not a
153  * real color, in that it has no entry in color maps.
154  */
155 typedef short color; /* colors of characters */
156 
157 #define MAX_COLOR 32767 /* max color (must fit in 'color' datatype) */
158 #define COLORLESS (-1) /* impossible color */
159 #define RAINBOW (-2) /* represents all colors except pseudocolors */
160 #define WHITE 0 /* default color, parent of all others */
161 /* Note: various places in the code know that WHITE is zero */
162 
163 
164 /*
165  * Per-color data structure for the compile-time color machinery
166  *
167  * If "sub" is not NOSUB then it is the number of the color's current
168  * subcolor, i.e. we are in process of dividing this color (character
169  * equivalence class) into two colors. See src/backend/regex/README for
170  * discussion of subcolors.
171  *
172  * Currently-unused colors have the FREECOL bit set and are linked into a
173  * freelist using their "sub" fields, but only if their color numbers are
174  * less than colormap.max. Any array entries beyond "max" are just garbage.
175  */
176 struct colordesc
177 {
178  int nschrs; /* number of simple chars of this color */
179  int nuchrs; /* number of upper map entries of this color */
180  color sub; /* open subcolor, if any; or free-chain ptr */
181 #define NOSUB COLORLESS /* value of "sub" when no open subcolor */
182  struct arc *arcs; /* chain of all arcs of this color */
183  chr firstchr; /* simple char first assigned to this color */
184  int flags; /* bitmask of the following flags: */
185 #define FREECOL 01 /* currently free */
186 #define PSEUDO 02 /* pseudocolor, no real chars */
187 #define COLMARK 04 /* temporary marker used in some functions */
188 };
189 
190 #define UNUSEDCOLOR(cd) ((cd)->flags & FREECOL)
191 
192 /*
193  * The color map itself
194  *
195  * This struct holds both data used only at compile time, and the chr to
196  * color mapping information, used at both compile and run time. The latter
197  * is the bulk of the space, so it's not really worth separating out the
198  * compile-only portion.
199  *
200  * Ideally, the mapping data would just be an array of colors indexed by
201  * chr codes; but for large character sets that's impractical. Fortunately,
202  * common characters have smaller codes, so we can use a simple array for chr
203  * codes up to MAX_SIMPLE_CHR, and do something more complex for codes above
204  * that, without much loss of performance. The "something more complex" is a
205  * 2-D array of color entries, where row indexes correspond to individual chrs
206  * or chr ranges that have been mentioned in the regex (with row zero
207  * representing all other chrs), and column indexes correspond to different
208  * sets of locale-dependent character classes such as "isalpha". The
209  * classbits[k] entry is zero if we do not care about the k'th character class
210  * in this regex, and otherwise it is the bit to be OR'd into the column index
211  * if the character in question is a member of that class. We find the color
212  * of a high-valued chr by identifying which colormaprange it is in to get
213  * the row index (use row zero if it's in none of them), identifying which of
214  * the interesting cclasses it's in to get the column index, and then indexing
215  * into the 2-D hicolormap array.
216  *
217  * The colormapranges are required to be nonempty, nonoverlapping, and to
218  * appear in increasing chr-value order.
219  */
220 
221 typedef struct colormaprange
222 {
223  chr cmin; /* range represents cmin..cmax inclusive */
225  int rownum; /* row index in hicolormap array (>= 1) */
227 
228 struct colormap
229 {
230  int magic;
231 #define CMMAGIC 0x876
232  struct vars *v; /* for compile error reporting */
233  size_t ncds; /* allocated length of colordescs array */
234  size_t max; /* highest color number currently in use */
235  color free; /* beginning of free chain (if non-0) */
236  struct colordesc *cd; /* pointer to array of colordescs */
237 #define CDEND(cm) (&(cm)->cd[(cm)->max + 1])
238 
239  /* mapping data for chrs <= MAX_SIMPLE_CHR: */
240  color *locolormap; /* simple array indexed by chr code */
241 
242  /* mapping data for chrs > MAX_SIMPLE_CHR: */
243  int classbits[NUM_CCLASSES]; /* see comment above */
244  int numcmranges; /* number of colormapranges */
245  colormaprange *cmranges; /* ranges of high chrs */
246  color *hicolormap; /* 2-D array of color entries */
247  int maxarrayrows; /* number of array rows allocated */
248  int hiarrayrows; /* number of array rows in use */
249  int hiarraycols; /* number of array columns (2^N) */
250 
251  /* If we need up to NINLINECDS, we store them here to save a malloc */
252 #define NINLINECDS ((size_t) 10)
253  struct colordesc cdspace[NINLINECDS];
254 };
255 
256 /* fetch color for chr; beware of multiple evaluation of c argument */
257 #define GETCOLOR(cm, c) \
258  ((c) <= MAX_SIMPLE_CHR ? (cm)->locolormap[(c) - CHR_MIN] : pg_reg_getcolor(cm, c))
259 
260 
261 /*
262  * Interface definitions for locale-interface functions in regc_locale.c.
263  */
264 
265 /*
266  * Representation of a set of characters. chrs[] represents individual
267  * code points, ranges[] represents ranges in the form min..max inclusive.
268  *
269  * If the cvec represents a locale-specific character class, eg [[:alpha:]],
270  * then the chrs[] and ranges[] arrays contain only members of that class
271  * up to MAX_SIMPLE_CHR (inclusive). cclasscode is set to regc_locale.c's
272  * code for the class, rather than being -1 as it is in an ordinary cvec.
273  *
274  * Note that in cvecs gotten from newcvec() and intended to be freed by
275  * freecvec(), both arrays of chrs are after the end of the struct, not
276  * separately malloc'd; so chrspace and rangespace are effectively immutable.
277  */
278 struct cvec
279 {
280  int nchrs; /* number of chrs */
281  int chrspace; /* number of chrs allocated in chrs[] */
282  chr *chrs; /* pointer to vector of chrs */
283  int nranges; /* number of ranges (chr pairs) */
284  int rangespace; /* number of ranges allocated in ranges[] */
285  chr *ranges; /* pointer to vector of chr pairs */
286  int cclasscode; /* value of "enum classes", or -1 */
287 };
288 
289 
290 /*
291  * definitions for NFA internal representation
292  */
293 struct state;
294 
295 struct arc
296 {
297  int type; /* 0 if free, else an NFA arc type code */
298  color co; /* color the arc matches (possibly RAINBOW) */
299  struct state *from; /* where it's from */
300  struct state *to; /* where it's to */
301  struct arc *outchain; /* link in *from's outs chain or free chain */
302  struct arc *outchainRev; /* back-link in *from's outs chain */
303 #define freechain outchain /* we do not maintain "freechainRev" */
304  struct arc *inchain; /* link in *to's ins chain */
305  struct arc *inchainRev; /* back-link in *to's ins chain */
306  /* these fields are not used when co == RAINBOW: */
307  struct arc *colorchain; /* link in color's arc chain */
308  struct arc *colorchainRev; /* back-link in color's arc chain */
309 };
310 
311 struct arcbatch
312 { /* for bulk allocation of arcs */
313  struct arcbatch *next; /* chain link */
314  size_t narcs; /* number of arcs allocated in this arcbatch */
315  struct arc a[FLEXIBLE_ARRAY_MEMBER];
316 };
317 #define ARCBATCHSIZE(n) ((n) * sizeof(struct arc) + offsetof(struct arcbatch, a))
318 /* first batch will have FIRSTABSIZE arcs; then double it until MAXABSIZE */
319 #define FIRSTABSIZE 64
320 #define MAXABSIZE 1024
321 
322 struct state
323 {
324  int no; /* state number, zero and up; or FREESTATE */
325 #define FREESTATE (-1)
326  char flag; /* marks special states */
327  int nins; /* number of inarcs */
328  int nouts; /* number of outarcs */
329  struct arc *ins; /* chain of inarcs */
330  struct arc *outs; /* chain of outarcs */
331  struct state *tmp; /* temporary for traversal algorithms */
332  struct state *next; /* chain for traversing all live states */
333  /* the "next" field is also used to chain free states together */
334  struct state *prev; /* back-link in chain of all live states */
335 };
336 
338 { /* for bulk allocation of states */
339  struct statebatch *next; /* chain link */
340  size_t nstates; /* number of states allocated in this batch */
341  struct state s[FLEXIBLE_ARRAY_MEMBER];
342 };
343 #define STATEBATCHSIZE(n) ((n) * sizeof(struct state) + offsetof(struct statebatch, s))
344 /* first batch will have FIRSTSBSIZE states; then double it until MAXSBSIZE */
345 #define FIRSTSBSIZE 32
346 #define MAXSBSIZE 1024
347 
348 struct nfa
349 {
350  struct state *pre; /* pre-initial state */
351  struct state *init; /* initial state */
352  struct state *final; /* final state */
353  struct state *post; /* post-final state */
354  int nstates; /* for numbering states */
355  struct state *states; /* chain of live states */
356  struct state *slast; /* tail of the chain */
357  struct state *freestates; /* chain of free states */
358  struct arc *freearcs; /* chain of free arcs */
359  struct statebatch *lastsb; /* chain of statebatches */
360  struct arcbatch *lastab; /* chain of arcbatches */
361  size_t lastsbused; /* number of states consumed from *lastsb */
362  size_t lastabused; /* number of arcs consumed from *lastab */
363  struct colormap *cm; /* the color map */
364  color bos[2]; /* colors, if any, assigned to BOS and BOL */
365  color eos[2]; /* colors, if any, assigned to EOS and EOL */
366  int flags; /* flags to pass forward to cNFA */
367  int minmatchall; /* min number of chrs to match, if matchall */
368  int maxmatchall; /* max number of chrs to match, or DUPINF */
369  struct vars *v; /* simplifies compile error reporting */
370  struct nfa *parent; /* parent NFA, if any */
371 };
372 
373 
374 
375 /*
376  * definitions for compacted NFA
377  *
378  * The main space savings in a compacted NFA is from making the arcs as small
379  * as possible. We store only the transition color and next-state number for
380  * each arc. The list of out arcs for each state is an array beginning at
381  * cnfa.states[statenumber], and terminated by a dummy carc struct with
382  * co == COLORLESS.
383  *
384  * The non-dummy carc structs are of two types: plain arcs and LACON arcs.
385  * Plain arcs just store the transition color number as "co". LACON arcs
386  * store the lookaround constraint number plus cnfa.ncolors as "co". LACON
387  * arcs can be distinguished from plain by testing for co >= cnfa.ncolors.
388  *
389  * Note that in a plain arc, "co" can be RAINBOW; since that's negative,
390  * it doesn't break the rule about how to recognize LACON arcs.
391  *
392  * We have special markings for "trivial" NFAs that can match any string
393  * (possibly with limits on the number of characters therein). In such a
394  * case, flags & MATCHALL is set (and HASLACONS can't be set). Then the
395  * fields minmatchall and maxmatchall give the minimum and maximum numbers
396  * of characters to match. For example, ".*" produces minmatchall = 0
397  * and maxmatchall = DUPINF, while ".+" produces minmatchall = 1 and
398  * maxmatchall = DUPINF.
399  */
400 struct carc
401 {
402  color co; /* COLORLESS is list terminator */
403  int to; /* next-state number */
404 };
405 
406 struct cnfa
407 {
408  int nstates; /* number of states */
409  int ncolors; /* number of colors (max color in use + 1) */
410  int flags; /* bitmask of the following flags: */
411 #define HASLACONS 01 /* uses lookaround constraints */
412 #define MATCHALL 02 /* matches all strings of a range of lengths */
413  int pre; /* setup state number */
414  int post; /* teardown state number */
415  color bos[2]; /* colors, if any, assigned to BOS and BOL */
416  color eos[2]; /* colors, if any, assigned to EOS and EOL */
417  char *stflags; /* vector of per-state flags bytes */
418 #define CNFA_NOPROGRESS 01 /* flag bit for a no-progress state */
419  struct carc **states; /* vector of pointers to outarc lists */
420  /* states[n] are pointers into a single malloc'd array of arcs */
421  struct carc *arcs; /* the area for the lists */
422  /* these fields are used only in a MATCHALL NFA (else they're -1): */
423  int minmatchall; /* min number of chrs to match */
424  int maxmatchall; /* max number of chrs to match, or DUPINF */
425 };
426 
427 /*
428  * When debugging, it's helpful if an un-filled CNFA is all-zeroes.
429  * In production, though, we only require nstates to be zero.
430  */
431 #ifdef REG_DEBUG
432 #define ZAPCNFA(cnfa) memset(&(cnfa), 0, sizeof(cnfa))
433 #else
434 #define ZAPCNFA(cnfa) ((cnfa).nstates = 0)
435 #endif
436 #define NULLCNFA(cnfa) ((cnfa).nstates == 0)
437 
438 /*
439  * This symbol limits the transient heap space used by the regex compiler,
440  * and thereby also the maximum complexity of NFAs that we'll deal with.
441  * Currently we only count NFA states and arcs against this; the other
442  * transient data is generally not large enough to notice compared to those.
443  * Note that we do not charge anything for the final output data structures
444  * (the compacted NFA and the colormap).
445  * The scaling here is based on an empirical measurement that very large
446  * NFAs tend to have about 4 arcs/state.
447  */
448 #ifndef REG_MAX_COMPILE_SPACE
449 #define REG_MAX_COMPILE_SPACE \
450  (500000 * (sizeof(struct state) + 4 * sizeof(struct arc)))
451 #endif
452 
453 /*
454  * subexpression tree
455  *
456  * "op" is one of:
457  * '=' plain regex without interesting substructure (implemented as DFA)
458  * 'b' back-reference (has no substructure either)
459  * '(' no-op capture node: captures the match of its single child
460  * '.' concatenation: matches a match for first child, then second child
461  * '|' alternation: matches a match for any of its children
462  * '*' iteration: matches some number of matches of its single child
463  *
464  * An alternation node can have any number of children (but at least two),
465  * linked through their sibling fields.
466  *
467  * A concatenation node must have exactly two children. It might be useful
468  * to support more, but that would complicate the executor. Note that it is
469  * the first child's greediness that determines the node's preference for
470  * where to split a match.
471  *
472  * Note: when a backref is directly quantified, we stick the min/max counts
473  * into the backref rather than plastering an iteration node on top. This is
474  * for efficiency: there is no need to search for possible division points.
475  */
476 struct subre
477 {
478  char op; /* see type codes above */
479  char flags;
480 #define LONGER 01 /* prefers longer match */
481 #define SHORTER 02 /* prefers shorter match */
482 #define MIXED 04 /* mixed preference below */
483 #define CAP 010 /* capturing parens here or below */
484 #define BACKR 020 /* back reference here or below */
485 #define BRUSE 040 /* is referenced by a back reference */
486 #define INUSE 0100 /* in use in final tree */
487 #define UPPROP (MIXED|CAP|BACKR) /* flags which should propagate up */
488 #define LMIX(f) ((f)<<2) /* LONGER -> MIXED */
489 #define SMIX(f) ((f)<<1) /* SHORTER -> MIXED */
490 #define UP(f) (((f)&UPPROP) | (LMIX(f) & SMIX(f) & MIXED))
491 #define MESSY(f) ((f)&(MIXED|CAP|BACKR))
492 #define PREF(f) ((f)&(LONGER|SHORTER))
493 #define PREF2(f1, f2) ((PREF(f1) != 0) ? PREF(f1) : PREF(f2))
494 #define COMBINE(f1, f2) (UP((f1)|(f2)) | PREF2(f1, f2))
495  char latype; /* LATYPE code, if lookaround constraint */
496  int id; /* ID of subre (1..ntree-1) */
497  int capno; /* if capture node, subno to capture into */
498  int backno; /* if backref node, subno it refers to */
499  short min; /* min repetitions for iteration or backref */
500  short max; /* max repetitions for iteration or backref */
501  struct subre *child; /* first child, if any (also freelist chain) */
502  struct subre *sibling; /* next child of same parent, if any */
503  struct state *begin; /* outarcs from here... */
504  struct state *end; /* ...ending in inarcs here */
505  struct cnfa cnfa; /* compacted NFA, if any */
506  struct subre *chain; /* for bookkeeping and error cleanup */
507 };
508 
509 
510 
511 /*
512  * table of function pointers for generic manipulation functions
513  * A regex_t's re_fns points to one of these.
514  */
515 struct fns
516 {
517  void FUNCPTR(free, (regex_t *));
518  int FUNCPTR(stack_too_deep, (void));
519 };
520 
521 #define STACK_TOO_DEEP(re) \
522  ((*((struct fns *) (re)->re_fns)->stack_too_deep) ())
523 
524 
525 /*
526  * the insides of a regex_t, hidden behind a void *
527  */
528 struct guts
529 {
530  int magic;
531 #define GUTSMAGIC 0xfed9
532  int cflags; /* copy of compile flags */
533  long info; /* copy of re_info */
534  size_t nsub; /* copy of re_nsub */
535  struct subre *tree;
536  struct cnfa search; /* for fast preliminary search */
537  int ntree; /* number of subre's, plus one */
538  struct colormap cmap;
539  int FUNCPTR(compare, (const chr *, const chr *, size_t));
540  struct subre *lacons; /* lookaround-constraint vector */
541  int nlacons; /* size of lacons[]; note that only slots
542  * numbered 1 .. nlacons-1 are used */
543 };
544 
545 
546 /* prototypes for functions that are exported from regcomp.c to regexec.c */
547 extern void pg_set_regex_collation(Oid collation);
548 extern color pg_reg_getcolor(struct colormap *cm, chr c);
#define FLEXIBLE_ARRAY_MEMBER
Definition: c.h:382
static int compare(const void *arg1, const void *arg2)
Definition: geqo_pool.c:145
#define free(a)
Definition: header.h:65
unsigned int Oid
Definition: postgres_ext.h:31
char * c
pg_wchar chr
Definition: regcustom.h:59
#define NUM_CCLASSES
Definition: regguts.h:144
#define NINLINECDS
Definition: regguts.h:252
short color
Definition: regguts.h:155
char_classes
Definition: regguts.h:139
@ CC_UPPER
Definition: regguts.h:141
@ CC_WORD
Definition: regguts.h:141
@ CC_LOWER
Definition: regguts.h:141
@ CC_ASCII
Definition: regguts.h:140
@ CC_ALNUM
Definition: regguts.h:140
@ CC_XDIGIT
Definition: regguts.h:141
@ CC_PRINT
Definition: regguts.h:141
@ CC_BLANK
Definition: regguts.h:140
@ CC_GRAPH
Definition: regguts.h:140
@ CC_CNTRL
Definition: regguts.h:140
@ CC_SPACE
Definition: regguts.h:141
@ CC_DIGIT
Definition: regguts.h:140
@ CC_ALPHA
Definition: regguts.h:140
@ CC_PUNCT
Definition: regguts.h:141
void pg_set_regex_collation(Oid collation)
struct colormaprange colormaprange
color pg_reg_getcolor(struct colormap *cm, chr c)
Definition: regc_color.c:120
Definition: regguts.h:296
struct arc * outchain
Definition: regguts.h:301
struct arc * colorchain
Definition: regguts.h:307
struct arc * outchainRev
Definition: regguts.h:302
struct state * from
Definition: regguts.h:299
int type
Definition: regguts.h:297
color co
Definition: regguts.h:298
struct state * to
Definition: regguts.h:300
struct arc * inchainRev
Definition: regguts.h:305
struct arc * inchain
Definition: regguts.h:304
struct arc * colorchainRev
Definition: regguts.h:308
struct arcbatch * next
Definition: regguts.h:313
size_t narcs
Definition: regguts.h:314
struct arc a[FLEXIBLE_ARRAY_MEMBER]
Definition: regguts.h:315
Definition: regguts.h:401
int to
Definition: regguts.h:403
color co
Definition: regguts.h:402
Definition: regguts.h:407
int pre
Definition: regguts.h:413
color eos[2]
Definition: regguts.h:416
struct carc ** states
Definition: regguts.h:419
int ncolors
Definition: regguts.h:409
int maxmatchall
Definition: regguts.h:424
int flags
Definition: regguts.h:410
int post
Definition: regguts.h:414
int minmatchall
Definition: regguts.h:423
struct carc * arcs
Definition: regguts.h:421
color bos[2]
Definition: regguts.h:415
int nstates
Definition: regguts.h:408
char * stflags
Definition: regguts.h:417
struct arc * arcs
Definition: regguts.h:182
chr firstchr
Definition: regguts.h:183
int nuchrs
Definition: regguts.h:179
int nschrs
Definition: regguts.h:178
color sub
Definition: regguts.h:180
int flags
Definition: regguts.h:184
int classbits[NUM_CCLASSES]
Definition: regguts.h:243
struct vars * v
Definition: regguts.h:232
color * locolormap
Definition: regguts.h:240
int hiarraycols
Definition: regguts.h:249
struct colordesc cdspace[NINLINECDS]
Definition: regguts.h:253
size_t max
Definition: regguts.h:234
int maxarrayrows
Definition: regguts.h:247
color free
Definition: regguts.h:235
struct colordesc * cd
Definition: regguts.h:236
int numcmranges
Definition: regguts.h:244
int magic
Definition: regguts.h:230
size_t ncds
Definition: regguts.h:233
int hiarrayrows
Definition: regguts.h:248
color * hicolormap
Definition: regguts.h:246
colormaprange * cmranges
Definition: regguts.h:245
Definition: regguts.h:279
int chrspace
Definition: regguts.h:281
int nchrs
Definition: regguts.h:280
int rangespace
Definition: regguts.h:284
chr * chrs
Definition: regguts.h:282
chr * ranges
Definition: regguts.h:285
int cclasscode
Definition: regguts.h:286
int nranges
Definition: regguts.h:283
Definition: regguts.h:516
int FUNCPTR(stack_too_deep,(void))
void FUNCPTR(free,(regex_t *))
Definition: regguts.h:529
struct subre * tree
Definition: regguts.h:535
struct subre * lacons
Definition: regguts.h:540
int magic
Definition: regguts.h:530
long info
Definition: regguts.h:533
int FUNCPTR(compare,(const chr *, const chr *, size_t))
struct cnfa search
Definition: regguts.h:536
int ntree
Definition: regguts.h:537
int cflags
Definition: regguts.h:532
size_t nsub
Definition: regguts.h:534
int nlacons
Definition: regguts.h:541
struct colormap cmap
Definition: regguts.h:538
Definition: regguts.h:349
struct vars * v
Definition: regguts.h:369
struct statebatch * lastsb
Definition: regguts.h:359
size_t lastabused
Definition: regguts.h:362
int minmatchall
Definition: regguts.h:367
struct arc * freearcs
Definition: regguts.h:358
int maxmatchall
Definition: regguts.h:368
struct state * slast
Definition: regguts.h:356
color bos[2]
Definition: regguts.h:364
size_t lastsbused
Definition: regguts.h:361
int nstates
Definition: regguts.h:354
color eos[2]
Definition: regguts.h:365
struct arcbatch * lastab
Definition: regguts.h:360
struct state * states
Definition: regguts.h:355
int flags
Definition: regguts.h:366
struct state * post
Definition: regguts.h:353
struct state * pre
Definition: regguts.h:350
struct colormap * cm
Definition: regguts.h:363
struct nfa * parent
Definition: regguts.h:370
struct state * freestates
Definition: regguts.h:357
struct state * init
Definition: regguts.h:351
Definition: regex.h:56
Definition: regguts.h:323
int nins
Definition: regguts.h:327
int nouts
Definition: regguts.h:328
char flag
Definition: regguts.h:326
struct state * prev
Definition: regguts.h:334
struct state * tmp
Definition: regguts.h:331
struct arc * outs
Definition: regguts.h:330
struct state * next
Definition: regguts.h:332
struct arc * ins
Definition: regguts.h:329
int no
Definition: regguts.h:324
struct state s[FLEXIBLE_ARRAY_MEMBER]
Definition: regguts.h:341
struct statebatch * next
Definition: regguts.h:339
size_t nstates
Definition: regguts.h:340
Definition: regguts.h:477
int backno
Definition: regguts.h:498
char op
Definition: regguts.h:478
struct subre * chain
Definition: regguts.h:506
struct state * end
Definition: regguts.h:504
short min
Definition: regguts.h:499
short max
Definition: regguts.h:500
struct subre * sibling
Definition: regguts.h:502
char flags
Definition: regguts.h:479
int id
Definition: regguts.h:496
char latype
Definition: regguts.h:495
struct subre * child
Definition: regguts.h:501
int capno
Definition: regguts.h:497
struct state * begin
Definition: regguts.h:503
Definition: regcomp.c:281