Home
last modified time | relevance | path

Searched refs:trie (Results 1 – 4 of 4) sorted by relevance

/linux-4.1.27/Documentation/networking/
Dfib_trie.txt1 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. It 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 …]
D00-INDEX84 - Level Compressed Trie (LC-trie) notes: a structure for routing.
/linux-4.1.27/net/ipv4/
Dfib_trie.c142 struct trie { struct
149 static struct key_vector *resize(struct trie *t, struct key_vector *tn); argument
475 static struct key_vector *replace(struct trie *t, in replace()
504 static struct key_vector *inflate(struct trie *t, in inflate()
600 static struct key_vector *halve(struct trie *t, in halve()
655 static struct key_vector *collapse(struct trie *t, in collapse()
812 static struct key_vector *resize(struct trie *t, struct key_vector *tn) in resize()
912 static struct key_vector *fib_find_node(struct trie *t, in fib_find_node()
983 static void trie_rebalance(struct trie *t, struct key_vector *tn) in trie_rebalance()
989 static int fib_insert_node(struct trie *t, struct key_vector *tp, in fib_insert_node()
[all …]
/linux-4.1.27/Documentation/RCU/
DRTFP.txt159 Robert Olsson described an RCU-protected trie-hash combination
1539 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1545 RCU-protected dynamic trie-hash combination.
1796 ,Title="{TRASH}: A dynamic {LC}-trie and hash data structure"
1804 RCU-protected dynamic trie-hash combination.