137 	struct key_vector kv[1];  member
138 #define tn_bits kv[0].bits
141 #define TNODE_SIZE(n)	offsetof(struct tnode, kv[0].tnode[n])
166 	struct key_vector kv[1];  member
187 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()  argument
189 	return container_of(kv, struct tnode, kv[0]);  in tn_info()
217 #define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)  argument
219 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()  argument
221 	unsigned long index = key ^ kv->key;  in get_index()
223 	if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))  in get_index()
226 	return index >> kv->pos;  in get_index()
355 	struct tnode *kv;  in leaf_new()  local
357 	kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);  in leaf_new()
358 	if (!kv)  in leaf_new()
362 	l = kv->kv;  in leaf_new()
396 	tn = tnode->kv;  in tnode_new()
497 		tn = container_of(head, struct tnode, rcu)->kv;  in tnode_free()
937 	struct key_vector *pn, *n = t->kv;  in fib_find_node()
1408 	pn = t->kv;  in fib_table_lookup()
1791 	struct key_vector *pn = t->kv;  in fib_trie_free()
1849 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()
1908 	struct key_vector *pn = t->kv;  in fib_table_flush_external()
1977 	struct key_vector *pn = t->kv;  in fib_table_flush()
2063 	struct key_vector *pn = t->kv;  in __fib_info_notify_update()
2167 	struct key_vector *l, *tp = t->kv;  in fib_table_notify()
2310 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()
2382 	t->kv[0].pos = KEYLENGTH;  in fib_trie_table()
2383 	t->kv[0].slen = KEYLENGTH;  in fib_trie_table()
2456 	pn = t->kv;  in fib_trie_get_first()
2854 	iter->tnode = t->kv;  in fib_route_seq_start()