usr.bin/grep/kwset.c

80   int mind;			/* Minimum depth of an accepting node. */
116   kwset->mind = INT_MAX;
273   if (trie->depth < kwset->mind)
274     kwset->mind = trie->depth;
391   if (kwset->mind < 256)
393       delta[i] = kwset->mind;
403       kwset->target = obstack_alloc(&kwset->obstack, kwset->mind);
404       for (i = kwset->mind - 1, curr = kwset->trie; i >= 0; --i)
410       for (i = 0; i < kwset->mind; ++i)
411 	delta[(unsigned char) kwset->target[i]] = kwset->mind - (i + 1);
412       kwset->mind2 = kwset->mind;
415       for (i = 0; i < kwset->mind - 1; ++i)
416 	if (kwset->target[i] == kwset->target[kwset->mind - 1])
417 	  kwset->mind2 = kwset->mind - (i + 1);
428 	  curr->shift = kwset->mind;
429 	  curr->maxshift = kwset->mind;
503   len = kwset->mind;
601   if (len < kwset->mind)
608   if ((d = kwset->mind) != 0)
616   if (len >= 4 * kwset->mind)
617     qlim = lim - 4 * kwset->mind;
756 	  kwsmatch->size[0] = kwset->mind;