Searched refs:trie (Results 1 – 4 of 4) sorted by relevance
| /linux-3.4.99/net/ipv4/ |
| D | fib_trie.c | 154 struct trie { struct
155 struct rt_trie_node __rcu *trie; member
161 static void put_child(struct trie *t, struct tnode *tn, int i, struct rt_trie_node *n);
164 static struct rt_trie_node *resize(struct trie *t, struct tnode *tn);
165 static struct tnode *inflate(struct trie *t, struct tnode *tn);
166 static struct tnode *halve(struct trie *t, struct tnode *tn);
492 static inline void put_child(struct trie *t, struct tnode *tn, int i, in put_child()
534 static struct rt_trie_node *resize(struct trie *t, struct tnode *tn) in resize()
712 static struct tnode *inflate(struct trie *t, struct tnode *tn) in inflate()
845 static struct tnode *halve(struct trie *t, struct tnode *tn) in halve()
[all …]
|
| /linux-3.4.99/Documentation/networking/ |
| D | fib_trie.txt | 1 LC-trie implementation notes.
10 trie node or tnode
36 the trie is kept level balanced moving, under certain conditions, the
64 straightforward trie lookup.
67 Inserts a new leaf node in the trie. This is bit more complicated than
69 level compression algorithm on part of the trie.
75 The key function for the dynamic trie after any change in the trie
76 it is run to optimize and reorganize. Tt will walk the trie upwards
98 This walks the full trie (using nextleaf()) and searches for empty
104 entire trie for each prefix length. In comparison, fib_hash is organized
[all …]
|
| D | 00-INDEX | 80 - Level Compressed Trie (LC-trie) notes: a structure for routing.
|
| /linux-3.4.99/Documentation/RCU/ |
| D | RTFP.txt | 143 Robert Olsson described an RCU-protected trie-hash combination
1398 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1406 RCU-protected dynamic trie-hash combination.
1654 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1662 RCU-protected dynamic trie-hash combination.
|