trie               53 kwset.c          struct trie *trie;		/* Trie node pointed to by this edge. */
trie               63 kwset.c          struct trie *parent;		/* Parent of this node. */
trie               64 kwset.c          struct trie *next;		/* List of all trie nodes in level order. */
trie               65 kwset.c          struct trie *fail;		/* Aho-Corasick failure function. */
trie               76 kwset.c          struct trie *trie;		/* The trie itself. */
trie               80 kwset.c          struct trie *next[NCHAR];	/* Table of children of the root. */
trie               97 kwset.c          kwset->trie
trie               98 kwset.c            = (struct trie *) obstack_alloc(&kwset->obstack, sizeof (struct trie));
trie               99 kwset.c          if (!kwset->trie)
trie              104 kwset.c          kwset->trie->accepting = 0;
trie              105 kwset.c          kwset->trie->links = NULL;
trie              106 kwset.c          kwset->trie->parent = NULL;
trie              107 kwset.c          kwset->trie->next = NULL;
trie              108 kwset.c          kwset->trie->fail = NULL;
trie              109 kwset.c          kwset->trie->depth = 0;
trie              110 kwset.c          kwset->trie->shift = 0;
trie              129 kwset.c          register struct trie *trie;
trie              138 kwset.c          trie = kwset->trie;
trie              150 kwset.c              link = trie->links;
trie              151 kwset.c              links[0] = (struct tree *) &trie->links;
trie              175 kwset.c        	  link->trie = (struct trie *) obstack_alloc(&kwset->obstack,
trie              176 kwset.c        						     sizeof (struct trie));
trie              177 kwset.c        	  if (!link->trie)
trie              182 kwset.c        	  link->trie->accepting = 0;
trie              183 kwset.c        	  link->trie->links = NULL;
trie              184 kwset.c        	  link->trie->parent = trie;
trie              185 kwset.c        	  link->trie->next = NULL;
trie              186 kwset.c        	  link->trie->fail = NULL;
trie              187 kwset.c        	  link->trie->depth = trie->depth + 1;
trie              188 kwset.c        	  link->trie->shift = 0;
trie              265 kwset.c              trie = link->trie;
trie              270 kwset.c          if (!trie->accepting)
trie              271 kwset.c            trie->accepting = 1 + 2 * kwset->words;
trie              275 kwset.c          if (trie->depth < kwset->mind)
trie              276 kwset.c            kwset->mind = trie->depth;
trie              277 kwset.c          if (trie->depth > kwset->maxd)
trie              278 kwset.c            kwset->maxd = trie->depth;
trie              286 kwset.c        enqueue (struct tree *tree, struct trie **last)
trie              292 kwset.c          (*last) = (*last)->next = tree->trie;
trie              299 kwset.c        treefails (register struct tree const *tree, struct trie const *fail,
trie              300 kwset.c        	   struct trie *recourse)
trie              322 kwset.c        	  tree->trie->fail = link->trie;
trie              328 kwset.c          tree->trie->fail = recourse;
trie              367 kwset.c        treenext (struct tree const *tree, struct trie *next[])
trie              373 kwset.c          next[tree->label] = tree->trie;
trie              383 kwset.c          register struct trie *curr;
trie              404 kwset.c              for (i = kwset->mind - 1, curr = kwset->trie; i >= 0; --i)
trie              407 kwset.c        	  curr = curr->links->trie;
trie              422 kwset.c              register struct trie *fail;
trie              423 kwset.c              struct trie *last, *next[NCHAR];
trie              427 kwset.c              for (curr = last = kwset->trie; curr; curr = curr->next)
trie              439 kwset.c        	  treefails(curr->links, curr->fail, kwset->trie);
trie              462 kwset.c              for (curr = kwset->trie->next; curr; curr = curr->next)
trie              474 kwset.c              treenext(kwset->trie->links, next);
trie              480 kwset.c        	memcpy(kwset->next, next, NCHAR * sizeof(struct trie *));
trie              584 kwset.c          struct trie * const *next;
trie              585 kwset.c          struct trie const *trie;
trie              586 kwset.c          struct trie const *accept;
trie              610 kwset.c              mch = text, accept = kwset->trie;
trie              637 kwset.c              trie = next[c];
trie              638 kwset.c              if (trie->accepting)
trie              641 kwset.c        	  accept = trie;
trie              643 kwset.c              d = trie->shift;
trie              647 kwset.c        	  tree = trie->links;
trie              655 kwset.c        	      trie = tree->trie;
trie              656 kwset.c        	      if (trie->accepting)
trie              659 kwset.c        		  accept = trie;
trie              664 kwset.c        	  d = trie->shift;
trie              684 kwset.c              if (!(trie = next[c]))
trie              689 kwset.c              if (trie->accepting && beg <= mch)
trie              692 kwset.c        	  accept = trie;
trie              694 kwset.c              d = trie->shift;
trie              698 kwset.c        	  tree = trie->links;
trie              706 kwset.c        	      trie = tree->trie;
trie              707 kwset.c        	      if (trie->accepting && beg <= mch)
trie              710 kwset.c        		  accept = trie;
trie              715 kwset.c        	  d = trie->shift;