116 	struct key_vector kv[1];  member
117 #define tn_bits kv[0].bits
120 #define TNODE_SIZE(n)	offsetof(struct tnode, kv[0].tnode[n])
145 	struct key_vector kv[1];  member
164 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()  argument
166 	return container_of(kv, struct tnode, kv[0]);  in tn_info()
194 #define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)  argument
196 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()  argument
198 	unsigned long index = key ^ kv->key;  in get_index()
200 	if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))  in get_index()
203 	return index >> kv->pos;  in get_index()
330 	struct tnode *kv;  in leaf_new()  local
332 	kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);  in leaf_new()
333 	if (!kv)  in leaf_new()
337 	l = kv->kv;  in leaf_new()
371 	tn = tnode->kv;  in tnode_new()
472 		tn = container_of(head, struct tnode, rcu)->kv;  in tnode_free()
921 	struct key_vector *pn, *n = t->kv;  in fib_find_node()
1284 	pn = t->kv;  in fib_table_lookup()
1623 	struct key_vector *pn = t->kv;  in fib_trie_free()
1681 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()
1738 	struct key_vector *pn = t->kv;  in fib_table_flush_external()
1812 	struct key_vector *pn = t->kv;  in fib_table_flush()
1943 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()
2006 	t->kv[0].pos = KEYLENGTH;  in fib_trie_table()
2007 	t->kv[0].slen = KEYLENGTH;  in fib_trie_table()
2080 	pn = t->kv;  in fib_trie_get_first()
2467 		iter->tnode = t->kv;  in fib_route_get_idx()
2513 	iter->tnode = t->kv;  in fib_route_seq_start()