Home
last modified time | relevance | path

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

/linux/kernel/bpf/
A Dlpm_trie.c324 if (trie->n_entries == trie->map.max_entries) { in trie_update_elem()
335 trie->n_entries++; in trie_update_elem()
347 slot = &trie->root; in trie_update_elem()
378 trie->n_entries--; in trie_update_elem()
421 trie->n_entries--; in trie_update_elem()
455 trim = &trie->root; in trie_delete_elem()
479 trie->n_entries--; in trie_delete_elem()
561 if (!trie) in trie_alloc()
568 trie->max_prefixlen = trie->data_size * 8; in trie_alloc()
572 return &trie->map; in trie_alloc()
[all …]
/linux/fs/unicode/
A Dutf8-norm.c322 utf8trie_t *trie = NULL; in utf8nlookup() local
337 if (*trie & NEXTBYTE) { in utf8nlookup()
348 offset = trie[offlen]; in utf8nlookup()
351 offset |= trie[offlen]; in utf8nlookup()
353 trie += offset; in utf8nlookup()
356 node = (*trie & TRIENODE); in utf8nlookup()
357 trie++; in utf8nlookup()
367 trie += offlen + 1; in utf8nlookup()
374 trie++; in utf8nlookup()
384 if (LEAF_CCC(trie) == DECOMPOSE && LEAF_STR(trie)[0] == HANGUL) in utf8nlookup()
[all …]
A Dmkutf8data.c2709 utf8trie_t *trie; in utf8nlookup() local
2723 if (*trie & NEXTBYTE) { in utf8nlookup()
2734 offset = trie[offlen]; in utf8nlookup()
2737 offset |= trie[offlen]; in utf8nlookup()
2739 trie += offset; in utf8nlookup()
2742 node = (*trie & TRIENODE); in utf8nlookup()
2743 trie++; in utf8nlookup()
2753 trie += offlen + 1; in utf8nlookup()
2760 trie++; in utf8nlookup()
2770 if (LEAF_CCC(trie) == DECOMPOSE && LEAF_STR(trie)[0] == HANGUL) in utf8nlookup()
[all …]
/linux/net/ipv4/
A Dfib_trie.c1206 struct trie *t = (struct trie *)tb->tb_data; in fib_table_insert()
1435 struct trie *t = (struct trie *) tb->tb_data; in fib_table_lookup()
1701 struct trie *t = (struct trie *) tb->tb_data; in fib_table_delete()
1827 struct trie *t = (struct trie *)tb->tb_data; in fib_trie_free()
1944 struct trie *t = (struct trie *)tb->tb_data; in fib_table_flush_external()
2013 struct trie *t = (struct trie *)tb->tb_data; in fib_table_flush()
2099 struct trie *t = (struct trie *)tb->tb_data; in __fib_info_notify_update()
2194 struct trie *t = (struct trie *)tb->tb_data; in fib_table_notify()
2235 struct trie *t = (struct trie *)tb->tb_data; in __trie_free_rcu()
2338 struct trie *t = (struct trie *)tb->tb_data; in fib_table_dump()
[all …]
/linux/Documentation/networking/
A Dfib_trie.rst4 LC-trie implementation notes
14 trie node or tnode
40 the trie is kept level balanced moving, under certain conditions, the
68 straightforward trie lookup.
71 Inserts a new leaf node in the trie. This is bit more complicated than
73 level compression algorithm on part of the trie.
79 The key function for the dynamic trie after any change in the trie
80 it is run to optimize and reorganize. It will walk the trie upwards
102 This walks the full trie (using nextleaf()) and searches for empty
108 entire trie for each prefix length. In comparison, fib_hash is organized
[all …]
/linux/drivers/net/wireguard/
A Dallowedips.c108 static struct allowedips_node *find_node(struct allowedips_node *trie, u8 bits, in find_node() argument
111 struct allowedips_node *node = trie, *found = NULL; in find_node()
146 static bool node_placement(struct allowedips_node __rcu *trie, const u8 *key, in node_placement() argument
150 struct allowedips_node *node = rcu_dereference_protected(trie, lockdep_is_held(lock)); in node_placement()
178 static int add(struct allowedips_node __rcu **trie, u8 bits, const u8 *key, in add() argument
186 if (!rcu_access_pointer(*trie)) { in add()
193 connect_node(trie, 2, node); in add()
196 if (node_placement(*trie, key, cidr, bits, &node, lock)) { in add()
210 down = rcu_dereference_protected(*trie, lockdep_is_held(lock)); in add()
225 connect_node(trie, 2, newnode); in add()
[all …]
/linux/Documentation/networking/devlink/
A Ddevlink-dpipe.rst34 Level Path Compression trie (LPC-trie) in hardware.
/linux/Documentation/RCU/
A 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.

Completed in 31 milliseconds