Lines Matching refs:kv
138 struct key_vector kv[1]; member
139 #define tn_bits kv[0].bits
142 #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n])
167 struct key_vector kv[1]; member
188 static inline struct tnode *tn_info(struct key_vector *kv) in tn_info() argument
190 return container_of(kv, struct tnode, kv[0]); in tn_info()
218 #define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos) argument
220 static inline unsigned long get_index(t_key key, struct key_vector *kv) in get_index() argument
222 unsigned long index = key ^ kv->key; in get_index()
224 if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos)) in get_index()
227 return index >> kv->pos; in get_index()
356 struct tnode *kv; in leaf_new() local
358 kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL); in leaf_new()
359 if (!kv) in leaf_new()
363 l = kv->kv; in leaf_new()
397 tn = tnode->kv; in tnode_new()
498 tn = container_of(head, struct tnode, rcu)->kv; in tnode_free()
938 struct key_vector *pn, *n = t->kv; in fib_find_node()
1457 pn = t->kv; in fib_table_lookup()
1843 struct key_vector *pn = t->kv; in fib_trie_free()
1901 struct key_vector *l, *tp = ot->kv; in fib_trie_unmerge()
1960 struct key_vector *pn = t->kv; in fib_table_flush_external()
2029 struct key_vector *pn = t->kv; in fib_table_flush()
2115 struct key_vector *pn = t->kv; in __fib_info_notify_update()
2210 struct key_vector *l, *tp = t->kv; in fib_table_notify()
2354 struct key_vector *l, *tp = t->kv; in fib_table_dump()
2426 t->kv[0].pos = KEYLENGTH; in fib_trie_table()
2427 t->kv[0].slen = KEYLENGTH; in fib_trie_table()
2500 pn = t->kv; in fib_trie_get_first()
2899 iter->tnode = t->kv; in fib_route_seq_start()