Lines Matching refs:tnode
107 struct key_vector __rcu *tnode[0]; member
111 struct tnode { struct
120 #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n]) argument
164 static inline struct tnode *tn_info(struct key_vector *kv) in tn_info()
166 return container_of(kv, struct tnode, kv[0]); in tn_info()
171 #define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
175 #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
288 struct tnode *n = container_of(head, struct tnode, rcu); in __node_free_rcu()
300 static struct tnode *tnode_alloc(int bits) in tnode_alloc()
330 struct tnode *kv; in leaf_new()
354 struct tnode *tnode; in tnode_new() local
359 tnode = tnode_alloc(bits); in tnode_new()
360 if (!tnode) in tnode_new()
363 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0), in tnode_new()
367 tnode->full_children = 1; in tnode_new()
369 tnode->empty_children = 1ul << bits; in tnode_new()
371 tn = tnode->kv; in tnode_new()
417 rcu_assign_pointer(tn->tnode[i], n); in put_child()
446 rcu_assign_pointer(tp->tnode[0], n); in put_child_root()
472 tn = container_of(head, struct tnode, rcu)->kv; in tnode_free()
1336 struct key_vector __rcu **cptr = n->tnode; in fib_table_lookup()
1386 cptr = &pn->tnode[cindex]; in fib_table_lookup()
2024 struct key_vector *tnode; member
2032 struct key_vector *pn = iter->tnode; in fib_trie_get_next()
2036 iter->tnode, iter->index, iter->depth); in fib_trie_get_next()
2046 iter->tnode = pn; in fib_trie_get_next()
2050 iter->tnode = n; in fib_trie_get_next()
2066 iter->tnode = pn; in fib_trie_get_next()
2081 n = rcu_dereference(pn->tnode[0]); in fib_trie_get_first()
2086 iter->tnode = n; in fib_trie_get_first()
2090 iter->tnode = pn; in fib_trie_get_first()
2448 struct key_vector *tnode; member
2457 struct key_vector *l, **tp = &iter->tnode; in fib_route_get_idx()
2467 iter->tnode = t->kv; in fib_route_get_idx()
2513 iter->tnode = t->kv; in fib_route_seq_start()
2530 l = leaf_walk_rcu(&iter->tnode, key); in fib_route_seq_next()