Lines Matching refs:must
17 * 1. Redistributions of source code must retain the above copyright
19 * 2. Redistributions in binary form must reproduce the above copyright
257 g->must = NULL;
624 case BACKSL|')': /* should not get here -- must be user */
1052 case REP(0, 0): /* must be user doing this */
1412 - findmust - fill in must and mlen with longest mandatory literal string
1419 * Note that must and mlen got initialized during setup.
1470 case OQUEST_: /* things that must be skipped */
1546 * must sequence doesn't occur later.
1568 g->must = malloc((size_t)g->mlen + 1);
1569 if (g->must == NULL) { /* argh; just forget it */
1574 cp = g->must;
1577 while (cp < g->must + g->mlen) {
1584 assert(cp == g->must + g->mlen);
1629 /* We must skip to the next position, or we'll
1663 * This algorithm assumes g->must exists and is has size greater than
1698 g->charjump[(int)g->must[mindex]] = g->mlen - mindex - 1;
1705 * This algorithm assumes g->must exists and is has size greater than
1717 int mindex; /* General "must" iterator */
1757 && g->must[mindex] != g->must[suffix]) {
1765 * to the beginning of the largest must pattern prefix matching