80   int mind;                     /* Minimum depth of an accepting node. */  member
116   kwset->mind = INT_MAX;  in kwsalloc()
276   if (trie->depth < kwset->mind)  in kwsincr()
277     kwset->mind = trie->depth;  in kwsincr()
390     if (kwset->mind < 256)  in kwsprep()
392         delta[i] = kwset->mind;  in kwsprep()
406       kwset->target = (char *) obstack_alloc (&kwset->obstack, kwset->mind);  in kwsprep()
407       for (i = kwset->mind - 1, curr = kwset->trie; i >= 0; --i)  in kwsprep()
413       for (i = 0; i < kwset->mind; ++i)  in kwsprep()
414         delta[(unsigned char) kwset->target[i]] = kwset->mind - (i + 1);  in kwsprep()
415       kwset->mind2 = kwset->mind;  in kwsprep()
418       for (i = 0; i < kwset->mind - 1; ++i)  in kwsprep()
419         if (kwset->target[i] == kwset->target[kwset->mind - 1])  in kwsprep()
420           kwset->mind2 = kwset->mind - (i + 1);  in kwsprep()
436           curr->shift = kwset->mind;  in kwsprep()
437           curr->maxshift = kwset->mind;  in kwsprep()
523   len = kwset->mind;  in bmexec()
629   if (len < kwset->mind)  in cwexec()
649     if ((d = kwset->mind) != 0)  in cwexec()
657     if (len >= 4 * kwset->mind)  in cwexec()
658       qlim = lim - 4 * kwset->mind;  in cwexec()
822           kwsmatch->size[0] = kwset->mind;  in kwsexec()