49 #define HASH(bv, nw) (((nw) == 1) ? *(bv) : hash(bv, nw))
50 #define HIT(h,bv,ss,nw) ((ss)->hash == (h) && ((nw) == 1 || \
51 memcmp(VS(bv), VS((ss)->states), (nw)*sizeof(unsigned)) == 0))
56 #define NOPROGRESS 010
101 #define DOMALLOC ((struct smalldfa *)NULL)
126 #define VISERR(vv) ((vv)->err != 0)
127 #define ISERR() VISERR(v)
128 #define VERR(vv,e) ((vv)->err = ((vv)->err ? (vv)->err : (e)))
129 #define ERR(e) VERR(v, e)
130 #define NOERR() {if (ISERR()) return v->err;}
131 #define OFF(p) ((p) - v->start)
132 #define LOFF(p) ((long)OFF(p))
164 static unsigned hash(
unsigned *,
int);
186 register struct vars *v = &var;
203 if (search_start >
len)
218 if (backref && nmatch <= v->g->nsub)
238 if (nmatch > v->
g->
nsub + 1)
239 nmatch = v->
g->
nsub + 1;
266 for (
i = 0;
i < n;
i++)
279 for (
i = 0;
i < n;
i++)
288 for (
i = 0;
i < n;
i++)
308 assert(nmatch <= v->nmatch);
325 for (
i = 0;
i < n;
i++)
336 for (
i = 0;
i < n;
i++)
431 &cold, (
int *) NULL);
456 for (begin = open; begin <=
close; begin++)
458 MDEBUG((
"\nfind trying at %ld\n",
LOFF(begin)));
461 (
chr **) NULL, &hitend);
469 if (hitend && cold == NULL)
558 assert(d != NULL && s != NULL);
578 for (begin = open; begin <=
close; begin++)
580 MDEBUG((
"\ncfind trying at %ld\n",
LOFF(begin)));
588 estop, (
chr **) NULL, &hitend);
590 end =
longest(v, d, begin, estop,
597 if (hitend && cold == NULL)
642 }
while (close < v->stop);
659 for (
i = n - 1;
i > 0;
i--)
678 if ((
size_t) n < v->nmatch)
701 if ((
size_t) n >= v->
nmatch)
846 mid =
longest(v, d, begin, end, (
int *) NULL);
850 MDEBUG((
"%d: tentative midpoint %ld\n", t->
id,
LOFF(mid)));
856 if (
longest(v, d2, mid, end, (
int *) NULL) == end)
865 MDEBUG((
"%d: successful\n", t->
id));
880 MDEBUG((
"%d: no midpoint\n", t->
id));
883 mid =
longest(v, d, begin, mid - 1, (
int *) NULL);
888 MDEBUG((
"%d: failed midpoint\n", t->
id));
927 mid =
shortest(v, d, begin, begin, end, (
chr **) NULL, (
int *) NULL);
931 MDEBUG((
"%d: tentative midpoint %ld\n", t->
id,
LOFF(mid)));
937 if (
longest(v, d2, mid, end, (
int *) NULL) == end)
946 MDEBUG((
"%d: successful\n", t->
id));
961 MDEBUG((
"%d: no midpoint\n", t->
id));
964 mid =
shortest(v, d, begin, mid + 1, end, (
chr **) NULL, (
int *) NULL);
969 MDEBUG((
"%d: failed midpoint\n", t->
id));
1003 assert((
size_t) n < v->nmatch);
1005 MDEBUG((
"%d: cbrdissect %d{%d-%d} %ld-%ld\n", t->
id, n, min, max,
1021 if (begin == end && min <= max)
1023 MDEBUG((
"%d: backref matched trivially\n", t->
id));
1033 MDEBUG((
"%d: backref matched trivially\n", t->
id));
1045 if (tlen % brlen != 0)
1047 numreps = tlen / brlen;
1048 if (numreps < min || (numreps > max && max !=
DUPINF))
1053 while (numreps-- > 0)
1055 if ((*v->
g->compare) (brstring, p, brlen) != 0)
1060 MDEBUG((
"%d: backref matched\n", t->
id));
1090 if (
longest(v, d, begin, end, (
int *) NULL) == end)
1092 MDEBUG((
"%d: caltdissect matched\n", t->
id));
1140 min_matches = t->
min;
1141 if (min_matches <= 0)
1153 max_matches = end - begin;
1155 max_matches = t->
max;
1156 if (max_matches < min_matches)
1157 max_matches = min_matches;
1158 endpts = (
chr **)
MALLOC((max_matches + 1) *
sizeof(
chr *));
1189 endpts[k] =
longest(v, d, endpts[k - 1], limit, (
int *) NULL);
1195 if (endpts[k] == NULL)
1201 MDEBUG((
"%d: working endpoint %d: %ld\n",
1202 t->
id, k,
LOFF(endpts[k])));
1208 if (endpts[k] != end)
1211 if (k >= max_matches)
1219 if (endpts[k] == endpts[k - 1] &&
1220 (k >= min_matches || min_matches - k < end - endpts[k]))
1234 if (k < min_matches)
1237 MDEBUG((
"%d: verifying %d..%d\n", t->
id, nverified + 1, k));
1239 for (
i = nverified + 1;
i <= k;
i++)
1259 MDEBUG((
"%d: successful\n", t->
id));
1275 chr *prev_end = endpts[k - 1];
1277 if (endpts[k] > prev_end)
1279 limit = endpts[k] - 1;
1280 if (limit > prev_end ||
1281 (k < min_matches && min_matches - k >= end - prev_end))
1299 if (t->
min == 0 && begin == end)
1301 MDEBUG((
"%d: allowing zero matches\n", t->
id));
1340 min_matches = t->
min;
1341 if (min_matches <= 0)
1345 MDEBUG((
"%d: allowing zero matches\n", t->
id));
1360 max_matches = end - begin;
1362 max_matches = t->
max;
1363 if (max_matches < min_matches)
1364 max_matches = min_matches;
1365 endpts = (
chr **)
MALLOC((max_matches + 1) *
sizeof(
chr *));
1396 if (limit == endpts[k - 1] &&
1398 (k >= min_matches || min_matches - k < end - limit))
1402 if (k >= max_matches)
1406 endpts[k] =
shortest(v, d, endpts[k - 1], limit, end,
1407 (
chr **) NULL, (
int *) NULL);
1413 if (endpts[k] == NULL)
1419 MDEBUG((
"%d: working endpoint %d: %ld\n",
1420 t->
id, k,
LOFF(endpts[k])));
1426 if (endpts[k] != end)
1429 if (k >= max_matches)
1437 limit = endpts[k - 1];
1447 if (k < min_matches)
1450 MDEBUG((
"%d: verifying %d..%d\n", t->
id, nverified + 1, k));
1452 for (
i = nverified + 1;
i <= k;
i++)
1472 MDEBUG((
"%d: successful\n", t->
id));
1487 if (endpts[k] < end)
1489 limit = endpts[k] + 1;
static void cleanup(void)
static void const char fflush(stdout)
void pg_set_regex_collation(Oid collation)
static chr * shortest(struct vars *, struct dfa *, chr *, chr *, chr *, chr **, int *)
static chr * dfa_backref(struct vars *, struct dfa *, chr *, chr *, chr *, bool)
static int cdissect(struct vars *, struct subre *, chr *, chr *)
static int lacon(struct vars *, struct cnfa *, chr *, color)
static unsigned hash(unsigned *, int)
static struct sset * getvacant(struct vars *, struct dfa *, chr *, chr *)
static void subset(struct vars *, struct subre *, chr *, chr *)
static chr * longest(struct vars *, struct dfa *, chr *, chr *, int *)
static struct sset * pickss(struct vars *, struct dfa *, chr *, chr *)
static struct dfa * getsubdfa(struct vars *, struct subre *)
static int citerdissect(struct vars *, struct subre *, chr *, chr *)
static void freedfa(struct dfa *)
static int crevcondissect(struct vars *, struct subre *, chr *, chr *)
static struct sset * miss(struct vars *, struct dfa *, struct sset *, color, chr *, chr *)
static struct sset * initialize(struct vars *, struct dfa *, chr *)
static int creviterdissect(struct vars *, struct subre *, chr *, chr *)
static chr * lastcold(struct vars *, struct dfa *)
static void zapallsubs(regmatch_t *, size_t)
static int cfindloop(struct vars *, struct cnfa *, struct colormap *, struct dfa *, struct dfa *, chr **)
static struct dfa * getladfa(struct vars *, int)
static int cfind(struct vars *, struct cnfa *, struct colormap *)
static int ccondissect(struct vars *, struct subre *, chr *, chr *)
static int find(struct vars *, struct cnfa *, struct colormap *)
static void zaptreesubs(struct vars *, struct subre *)
static int caltdissect(struct vars *, struct subre *, chr *, chr *)
int pg_regexec(regex_t *re, const chr *string, size_t len, size_t search_start, rm_detail_t *details, size_t nmatch, regmatch_t pmatch[], int flags)
static struct dfa * newdfa(struct vars *, struct cnfa *, struct colormap *, struct smalldfa *)
static int matchuntil(struct vars *, struct dfa *, chr *, struct sset **, chr **)
static int cbrdissect(struct vars *, struct subre *, chr *, chr *)
#define STACK_TOO_DEEP(re)
#define CANCEL_REQUESTED(re)
unsigned statesarea[FEWSTATES *2+WORK]
struct arcp incarea[FEWSTATES *2 *FEWCOLORS]
struct sset * outsarea[FEWSTATES *2 *FEWCOLORS]
struct sset ssets[FEWSTATES *2]