Lines Matching refs:key_vector
119 struct key_vector { struct
128 struct key_vector __rcu *tnode[0]; argument
136 struct key_vector __rcu *parent;
137 struct key_vector kv[1];
166 struct key_vector kv[1];
172 static struct key_vector *resize(struct trie *t, struct key_vector *tn);
187 static inline struct tnode *tn_info(struct key_vector *kv) in tn_info()
201 static inline void node_set_parent(struct key_vector *n, struct key_vector *tp) in node_set_parent()
212 static inline unsigned long child_length(const struct key_vector *tn) in child_length()
219 static inline unsigned long get_index(t_key key, struct key_vector *kv) in get_index()
305 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
336 static inline void empty_child_inc(struct key_vector *n) in empty_child_inc()
344 static inline void empty_child_dec(struct key_vector *n) in empty_child_dec()
352 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa) in leaf_new()
354 struct key_vector *l; in leaf_new()
375 static struct key_vector *tnode_new(t_key key, int pos, int bits) in tnode_new()
378 struct key_vector *tn; in tnode_new()
389 sizeof(struct key_vector *) << bits); in tnode_new()
408 static inline int tnode_full(struct key_vector *tn, struct key_vector *n) in tnode_full()
416 static void put_child(struct key_vector *tn, unsigned long i, in put_child()
417 struct key_vector *n) in put_child()
419 struct key_vector *chi = get_child(tn, i); in put_child()
445 static void update_children(struct key_vector *tn) in update_children()
451 struct key_vector *inode = get_child(tn, --i); in update_children()
467 static inline void put_child_root(struct key_vector *tp, t_key key, in put_child_root()
468 struct key_vector *n) in put_child_root()
476 static inline void tnode_free_init(struct key_vector *tn) in tnode_free_init()
481 static inline void tnode_free_append(struct key_vector *tn, in tnode_free_append()
482 struct key_vector *n) in tnode_free_append()
488 static void tnode_free(struct key_vector *tn) in tnode_free()
506 static struct key_vector *replace(struct trie *t, in replace()
507 struct key_vector *oldtnode, in replace()
508 struct key_vector *tn) in replace()
510 struct key_vector *tp = node_parent(oldtnode); in replace()
525 struct key_vector *inode = get_child(tn, --i); in replace()
535 static struct key_vector *inflate(struct trie *t, in inflate()
536 struct key_vector *oldtnode) in inflate()
538 struct key_vector *tn; in inflate()
557 struct key_vector *inode = get_child(oldtnode, --i); in inflate()
558 struct key_vector *node0, *node1; in inflate()
631 static struct key_vector *halve(struct trie *t, in halve()
632 struct key_vector *oldtnode) in halve()
634 struct key_vector *tn; in halve()
652 struct key_vector *node1 = get_child(oldtnode, --i); in halve()
653 struct key_vector *node0 = get_child(oldtnode, --i); in halve()
654 struct key_vector *inode; in halve()
686 static struct key_vector *collapse(struct trie *t, in collapse()
687 struct key_vector *oldtnode) in collapse()
689 struct key_vector *n, *tp; in collapse()
707 static unsigned char update_suffix(struct key_vector *tn) in update_suffix()
725 struct key_vector *n = get_child(tn, i); in update_suffix()
802 static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn) in should_inflate()
817 static inline bool should_halve(struct key_vector *tp, struct key_vector *tn) in should_halve()
831 static inline bool should_collapse(struct key_vector *tn) in should_collapse()
846 static struct key_vector *resize(struct trie *t, struct key_vector *tn) in resize()
851 struct key_vector *tp = node_parent(tn); in resize()
911 static void node_pull_suffix(struct key_vector *tn, unsigned char slen) in node_pull_suffix()
925 static void node_push_suffix(struct key_vector *tn, unsigned char slen) in node_push_suffix()
934 static struct key_vector *fib_find_node(struct trie *t, in fib_find_node()
935 struct key_vector **tp, u32 key) in fib_find_node()
937 struct key_vector *pn, *n = t->kv; in fib_find_node()
1014 struct key_vector *l, *tp; in fib_find_matching_alias()
1091 static void trie_rebalance(struct trie *t, struct key_vector *tn) in trie_rebalance()
1097 static int fib_insert_node(struct trie *t, struct key_vector *tp, in fib_insert_node()
1100 struct key_vector *n, *l; in fib_insert_node()
1116 struct key_vector *tn; in fib_insert_node()
1147 static int fib_insert_alias(struct trie *t, struct key_vector *tp, in fib_insert_alias()
1148 struct key_vector *l, struct fib_alias *new, in fib_insert_alias()
1199 static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1200 struct key_vector *l, struct fib_alias *old);
1208 struct key_vector *l, *tp; in fib_table_insert()
1404 static inline t_key prefix_mismatch(t_key key, struct key_vector *n) in prefix_mismatch()
1440 struct key_vector *n, *pn; in fib_table_lookup()
1499 struct key_vector __rcu **cptr = n->tnode; in fib_table_lookup()
1636 static void fib_remove_alias(struct trie *t, struct key_vector *tp, in fib_remove_alias()
1637 struct key_vector *l, struct fib_alias *old) in fib_remove_alias()
1703 struct key_vector *l, *tp; in fib_table_delete()
1768 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key) in leaf_walk_rcu()
1770 struct key_vector *pn, *n = *tn; in leaf_walk_rcu()
1828 struct key_vector *pn = t->kv; in fib_trie_free()
1835 struct key_vector *n; in fib_trie_free()
1886 struct key_vector *l, *tp = ot->kv; in fib_trie_unmerge()
1902 struct key_vector *local_l = NULL, *local_tp; in fib_trie_unmerge()
1945 struct key_vector *pn = t->kv; in fib_table_flush_external()
1953 struct key_vector *n; in fib_table_flush_external()
2014 struct key_vector *pn = t->kv; in fib_table_flush()
2023 struct key_vector *n; in fib_table_flush()
2100 struct key_vector *pn = t->kv; in __fib_info_notify_update()
2105 struct key_vector *n; in __fib_info_notify_update()
2158 static int fib_leaf_notify(struct key_vector *l, struct fib_table *tb, in fib_leaf_notify()
2195 struct key_vector *l, *tp = t->kv; in fib_table_notify()
2248 static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb, in fn_trie_dump_leaf()
2339 struct key_vector *l, *tp = t->kv; in fib_table_dump()
2429 struct key_vector *tnode;
2434 static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter) in fib_trie_get_next()
2437 struct key_vector *pn = iter->tnode; in fib_trie_get_next()
2445 struct key_vector *n = get_child_rcu(pn, cindex++); in fib_trie_get_next()
2477 static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter, in fib_trie_get_first()
2480 struct key_vector *n, *pn; in fib_trie_get_first()
2505 struct key_vector *n; in trie_collect_stats()
2570 bytes += sizeof(struct key_vector *) * pointers; in trie_show_stats()
2653 static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos) in fib_trie_get_idx()
2665 struct key_vector *n; in fib_trie_get_idx()
2694 struct key_vector *n; in fib_trie_seq_next()
2780 struct key_vector *n = v; in fib_trie_seq_show()
2829 struct key_vector *tnode;
2834 static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter, in fib_route_get_idx()
2837 struct key_vector *l, **tp = &iter->tnode; in fib_route_get_idx()
2897 struct key_vector *l = NULL; in fib_route_seq_next()
2951 struct key_vector *l = v; in fib_route_seq_show()