usr.bin/grep/dfa.c

1407     dst->elems[i] = src->elems[i];
1414    S->elems must point to an array large enough to hold the resulting set. */
1421   for (i = 0; i < s->nelem && p.index < s->elems[i].index; ++i)
1423   if (i < s->nelem && p.index == s->elems[i].index)
1424     s->elems[i].constraint |= p.constraint;
1431 	  t2 = s->elems[i];
1432 	  s->elems[i++] = t1;
1447     if (s1->elems[i].index > s2->elems[j].index)
1448       m->elems[m->nelem++] = s1->elems[i++];
1449     else if (s1->elems[i].index < s2->elems[j].index)
1450       m->elems[m->nelem++] = s2->elems[j++];
1453 	m->elems[m->nelem] = s1->elems[i++];
1454 	m->elems[m->nelem++].constraint |= s2->elems[j++].constraint;
1457     m->elems[m->nelem++] = s1->elems[i++];
1459     m->elems[m->nelem++] = s2->elems[j++];
1469     if (p.index == s->elems[i].index)
1473       s->elems[i] = s->elems[i + 1];
1491     hash ^= s->elems[i].index + s->elems[i].constraint;
1496       if (hash != d->states[i].hash || s->nelem != d->states[i].elems.nelem
1500 	if (s->elems[j].constraint
1501 	    != d->states[i].elems.elems[j].constraint
1502 	    || s->elems[j].index != d->states[i].elems.elems[j].index)
1511   MALLOC(d->states[i].elems.elems, position, s->nelem);
1512   copy(s, &d->states[i].elems);
1523     if (d->tokens[s->elems[j].index] < 0)
1525 	constraint = s->elems[j].constraint;
1532 	  d->states[i].first_end = d->tokens[s->elems[j].index];
1534     else if (d->tokens[s->elems[j].index] == BACKREF)
1549    S->elems must be large enough to hold the result. */
1562     if (d->tokens[s->elems[i].index] >= NOTCHAR
1563 	&& d->tokens[s->elems[i].index] != BACKREF
1565 	&& d->tokens[s->elems[i].index] != ANYCHAR
1566 	&& d->tokens[s->elems[i].index] != MBCSET
1568 	&& d->tokens[s->elems[i].index] < CSET)
1570 	old = s->elems[i];
1572 	delete(s->elems[i], s);
1604 	    p.index = d->follows[old.index].elems[j].index;
1709   MALLOC(merged.elems, position, d->nleaves);
1732 	tmp.elems = firstpos;
1737 	    REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1752 	tmp.elems = firstpos;
1757 	    REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1820 	MALLOC(d->follows[i].elems, position, nalloc[i]);
1861 	    fprintf(stderr, " %d:", d->follows[i].elems[j].index);
1862 	    prtok(d->tokens[d->follows[i].elems[j].index]);
1869 	  REALLOC(d->follows[i].elems, position, merged.nelem);
1883     if (PREV_NEWLINE_DEPENDENT(merged.elems[i].constraint))
1898   free(merged.elems);
1971   for (i = 0; i < d->states[s].elems.nelem; ++i)
1973       pos = d->states[s].elems.elems[i];
1988 	      MALLOC(d->states[s].mbps.elems, position,
1989 		     d->states[s].elems.nelem);
2058 	      MALLOC(grps[ngrps].elems, position, d->nleaves);
2065 	  grps[j].elems[grps[j].nelem++] = pos;
2079 	  MALLOC(grps[ngrps].elems, position, d->nleaves);
2081 	  grps[ngrps].elems[0] = pos;
2086   MALLOC(follows.elems, position, d->nleaves);
2087   MALLOC(tmp.elems, position, d->nleaves);
2096       for (i = 0; i < d->states[0].elems.nelem; ++i)
2098 	  if (PREV_NEWLINE_DEPENDENT(d->states[0].elems.elems[i].constraint))
2100 	  if (PREV_LETTER_DEPENDENT(d->states[0].elems.elems[i].constraint))
2103       copy(&d->states[0].elems, &follows);
2128 	for (k = 0; k < d->follows[grps[i].elems[j].index].nelem; ++k)
2129 	  insert(d->follows[grps[i].elems[j].index].elems[k], &follows);
2134 	  /* If a token in follows.elems is not 1st byte of a multibyte
2155 	      if (!(d->multibyte_prop[follows.elems[j].index] & 1))
2171 	for (j = 0; j < d->states[0].elems.nelem; ++j)
2172 	  insert(d->states[0].elems.elems[j], &follows);
2178 	  if (PREV_NEWLINE_DEPENDENT(follows.elems[j].constraint))
2187 	  if (PREV_LETTER_DEPENDENT(follows.elems[j].constraint))
2218     free(grps[i].elems);
2219   free(follows.elems);
2220   free(tmp.elems);
2586       position pos = d->states[s].mbps.elems[i];
2631   copy(&(d->states[s1].elems), pps);
2644 	for (j = 0; j < d->follows[d->states[s].mbps.elems[i].index].nelem;
2646 	  insert(d->follows[d->states[s].mbps.elems[i].index].elems[j],
2706   MALLOC(follows.elems, position, d->nleaves);
2727 		 j < d->follows[d->states[s1].mbps.elems[i].index].nelem; j++)
2728 	      insert(d->follows[d->states[s1].mbps.elems[i].index].elems[j],
2737   free(follows.elems);
3029     free((ptr_t) d->states[i].elems.elems);
3032     if (d->follows[i].elems)
3033       free((ptr_t) d->follows[i].elems);