114 	struct key_vector kv[1];  member
115 #define tn_bits kv[0].bits
118 #define TNODE_SIZE(n)	offsetof(struct tnode, kv[0].tnode[n])
143 	struct key_vector kv[1];  member
162 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()  argument
164 	return container_of(kv, struct tnode, kv[0]);  in tn_info()
192 #define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)  argument
194 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()  argument
196 	unsigned long index = key ^ kv->key;  in get_index()
198 	if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))  in get_index()
201 	return index >> kv->pos;  in get_index()
327 	struct tnode *kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);  in leaf_new()  local
328 	struct key_vector *l = kv->kv;  in leaf_new()
330 	if (!kv)  in leaf_new()
350 	struct key_vector *tn = tnode->kv;  in tnode_new()
466 		tn = container_of(head, struct tnode, rcu)->kv;  in tnode_free()
915 	struct key_vector *pn, *n = t->kv;  in fib_find_node()
1273 	pn = t->kv;  in fib_table_lookup()
1601 	struct key_vector *pn = t->kv;  in fib_trie_free()
1659 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()
1716 	struct key_vector *pn = t->kv;  in fib_table_flush_external()
1791 	struct key_vector *pn = t->kv;  in fib_table_flush()
1923 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()
1987 	t->kv[0].pos = KEYLENGTH;  in fib_trie_table()
1988 	t->kv[0].slen = KEYLENGTH;  in fib_trie_table()
2056 	struct key_vector *n, *pn = t->kv;  in fib_trie_get_first()
2447 		iter->tnode = t->kv;  in fib_route_get_idx()
2493 	iter->tnode = t->kv;  in fib_route_seq_start()