141 		struct key_vector __rcu *tnode[0];  member
145 struct tnode {  struct
154 #define TNODE_SIZE(n)	offsetof(struct tnode, kv[0].tnode[n])  argument
198 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()
200 	return container_of(kv, struct tnode, kv[0]);  in tn_info()
205 #define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
209 #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
322 	struct tnode *n = container_of(head, struct tnode, rcu);  in __node_free_rcu()
332 static struct tnode *tnode_alloc(int bits)  in tnode_alloc()
362 	struct tnode *kv;  in leaf_new()
386 	struct tnode *tnode;  in tnode_new()  local
391 	tnode = tnode_alloc(bits);  in tnode_new()
392 	if (!tnode)  in tnode_new()
395 	pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),  in tnode_new()
399 		tnode->full_children = 1;  in tnode_new()
401 		tnode->empty_children = 1ul << bits;  in tnode_new()
403 	tn = tnode->kv;  in tnode_new()
449 	rcu_assign_pointer(tn->tnode[i], n);  in put_child()
478 		rcu_assign_pointer(tp->tnode[0], n);  in put_child_root()
504 		tn = container_of(head, struct tnode, rcu)->kv;  in tnode_free()
1383 		struct key_vector __rcu **cptr = n->tnode;  in fib_table_lookup()
1436 			cptr = &pn->tnode[cindex];  in fib_table_lookup()
2134 	struct key_vector *tnode;  member
2142 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()
2146 		 iter->tnode, iter->index, iter->depth);  in fib_trie_get_next()
2156 				iter->tnode = pn;  in fib_trie_get_next()
2160 				iter->tnode = n;  in fib_trie_get_next()
2176 	iter->tnode = pn;  in fib_trie_get_next()
2191 	n = rcu_dereference(pn->tnode[0]);  in fib_trie_get_first()
2196 		iter->tnode = n;  in fib_trie_get_first()
2200 		iter->tnode = pn;  in fib_trie_get_first()
2531 	struct key_vector *tnode;  member
2539 	struct key_vector *l, **tp = &iter->tnode;  in fib_route_get_idx()
2585 	iter->tnode = t->kv;  in fib_route_seq_start()
2606 		l = leaf_walk_rcu(&iter->tnode, key);  in fib_route_seq_next()