Lines Matching defs:curr
380 register struct trie *curr, *fail;
403 for (i = kwset->mind - 1, curr = kwset->trie; i >= 0; --i)
405 kwset->target[i] = curr->links->label;
406 curr = curr->links->trie;
422 for (curr = last = kwset->trie; curr; curr = curr->next)
425 enqueue(curr->links, &last);
427 curr->shift = kwset->mind;
428 curr->maxshift = kwset->mind;
431 treedelta(curr->links, curr->depth, delta);
434 treefails(curr->links, curr->fail, kwset->trie);
438 for (fail = curr->fail; fail; fail = fail->fail)
443 if (!hasevery(fail->links, curr->links))
444 if (curr->depth - fail->depth < fail->shift)
445 fail->shift = curr->depth - fail->depth;
450 if (curr->accepting && fail->maxshift > curr->depth - fail->depth)
451 fail->maxshift = curr->depth - fail->depth;
457 for (curr = kwset->trie->next; curr; curr = curr->next)
459 if (curr->maxshift > curr->parent->maxshift)
460 curr->maxshift = curr->parent->maxshift;
461 if (curr->shift > curr->maxshift)
462 curr->shift = curr->maxshift;