Searched refs:trie (Results 1 - 2 of 2) sorted by relevance

/netgear-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/timemachine/gettext-0.17/gettext-tools/libgrep/
H A Dkwset.c50 /* Balanced tree of edges and labels leaving a given trie node. */
55 struct trie *trie; /* Trie node pointed to by this edge. */ member in struct:tree
60 /* Node of a trie representing a set of reversed keywords. */
61 struct trie struct
65 struct trie *parent; /* Parent of this node. */
66 struct trie *next; /* List of all trie nodes in level order. */
67 struct trie *fail; /* Aho-Corasick failure function. */
77 int words; /* Number of words in the trie
78 struct trie *trie; /* The trie itself. */ member in struct:kwset
129 register struct trie *trie; local
584 struct trie const *trie; local
[all...]
/netgear-WNDR4500-V1.0.1.40_1.0.68/src/linux/linux-2.6/net/ipv4/
H A Dfib_trie.c15 * This work is based on the LPC-trie which is originally descibed in:
158 struct trie { struct
159 struct node *trie; member in struct:trie
167 static void put_child(struct trie *t, struct tnode *tn, int i, struct node *n);
169 static struct node *resize(struct trie *t, struct tnode *tn);
170 static struct tnode *inflate(struct trie *t, struct tnode *tn);
171 static struct tnode *halve(struct trie *t, struct tnode *tn);
175 static struct trie *trie_local = NULL, *trie_main = NULL;
227 necessary. Every node in the trie has a key associated with it, but not
414 static inline void put_child(struct trie *
1695 struct node *trie = rcu_dereference(t->trie); local
2008 struct trie *trie; member in struct:fib_trie_iter
[all...]

Completed in 51 milliseconds