187 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()  function
193 #define node_parent(tn) rtnl_dereference(tn_info(tn)->parent)
197 #define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent)
204 		rcu_assign_pointer(tn_info(n)->parent, tp);  in node_set_parent()
207 #define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p)
317 #define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
338 	tn_info(n)->empty_children++;  in empty_child_inc()
340 	if (!tn_info(n)->empty_children)  in empty_child_inc()
341 		tn_info(n)->full_children++;  in empty_child_inc()
346 	if (!tn_info(n)->empty_children)  in empty_child_dec()
347 		tn_info(n)->full_children--;  in empty_child_dec()
349 	tn_info(n)->empty_children--;  in empty_child_dec()
435 		tn_info(tn)->full_children--;  in put_child()
437 		tn_info(tn)->full_children++;  in put_child()
478 	tn_info(tn)->rcu.next = NULL;  in tnode_free_init()
484 	tn_info(n)->rcu.next = tn_info(tn)->rcu.next;  in tnode_free_append()
485 	tn_info(tn)->rcu.next = &tn_info(n)->rcu;  in tnode_free_append()
490 	struct callback_head *head = &tn_info(tn)->rcu;  in tnode_free()
809 	used -= tn_info(tn)->empty_children;  in should_inflate()
810 	used += tn_info(tn)->full_children;  in should_inflate()
824 	used -= tn_info(tn)->empty_children;  in should_halve()
835 	used -= tn_info(tn)->empty_children;  in should_collapse()
838 	if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)  in should_collapse()
2499 			s->nullpointers += tn_info(n)->empty_children;  in trie_collect_stats()
2764 			   tn_info(n)->full_children,  in fib_trie_seq_show()
2765 			   tn_info(n)->empty_children);  in fib_trie_seq_show()