usr.bin/grep/dfa.c

1496       if (hash != d->states[i].hash || s->nelem != d->states[i].elems.nelem
1497 	  || newline != d->states[i].newline || letter != d->states[i].letter)
1501 	    != d->states[i].elems.elems[j].constraint
1502 	    || s->elems[j].index != d->states[i].elems.elems[j].index)
1509   REALLOC_IF_NECESSARY(d->states, dfa_state, d->salloc, d->sindex);
1510   d->states[i].hash = hash;
1511   MALLOC(d->states[i].elems.elems, position, s->nelem);
1512   copy(s, &d->states[i].elems);
1513   d->states[i].newline = newline;
1514   d->states[i].letter = letter;
1515   d->states[i].backref = 0;
1516   d->states[i].constraint = 0;
1517   d->states[i].first_end = 0;
1520     d->states[i].mbps.nelem = 0;
1530 	  d->states[i].constraint |= constraint;
1531 	if (! d->states[i].first_end)
1532 	  d->states[i].first_end = d->tokens[s->elems[j].index];
1536 	d->states[i].constraint = NO_CONSTRAINT;
1537 	d->states[i].backref = 1;
1889   MALLOC(d->states, dfa_state, d->salloc);
1971   for (i = 0; i < d->states[s].elems.nelem; ++i)
1973       pos = d->states[s].elems.elems[i];
1984 	     must put it to d->states[s].mbps, which contains the positions
1986 	  if (d->states[s].mbps.nelem == 0)
1988 	      MALLOC(d->states[s].mbps.elems, position,
1989 		     d->states[s].elems.nelem);
1991 	  insert(pos, &(d->states[s].mbps));
2003 					 d->states[s].newline, 1))
2006 					 d->states[s].newline, 0))
2010 					d->states[s].letter, 1))
2014 					d->states[s].letter, 0))
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);
2135 	     character, or the states of follows must accept the bytes
2171 	for (j = 0; j < d->states[0].elems.nelem; ++j)
2172 	  insert(d->states[0].elems.elems[j], &follows);
2260   if (ACCEPTS_IN_CONTEXT(d->states[s].newline, 1, d->states[s].letter, 0,
2263   if (ACCEPTS_IN_CONTEXT(d->states[s].newline, 0, d->states[s].letter, 1,
2266   if (ACCEPTS_IN_CONTEXT(d->states[s].newline, 0, d->states[s].letter, 0,
2448   if (!SUCCEEDS_IN_CONTEXT(pos.constraint, d->states[s].newline,
2449 			   newline, d->states[s].letter, letter))
2495   if (!SUCCEEDS_IN_CONTEXT(pos.constraint, d->states[s].newline,
2496 			   newline, d->states[s].letter, letter))
2570 /* Check each of `d->states[s].mbps.elem' can match or not. Then return the
2571    array which corresponds to `d->states[s].mbps.elem' and each element of
2583   MALLOC(rarray, int, d->states[s].mbps.nelem);
2584   for (i = 0; i < d->states[s].mbps.nelem; ++i)
2586       position pos = d->states[s].mbps.elems[i];
2631   copy(&(d->states[s1].elems), pps);
2634   if (match_lens == NULL && d->states[s].mbps.nelem != 0)
2641   for (i = 0; i < d->states[s].mbps.nelem ; i++)
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],
2666   int nelem = d->states[s].mbps.nelem; /* Just a alias.  */
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],
2831 	    if (d->states[s].mbps.nelem != 0)
2877 		*backref = (d->states[s].backref != 0);
2892 		if (d->states[s].mbps.nelem != 0)
3029     free((ptr_t) d->states[i].elems.elems);
3030   free((ptr_t) d->states);