Lines Matching refs:key_vector
120 struct key_vector { struct
129 DECLARE_FLEX_ARRAY(struct key_vector __rcu *, tnode); argument
137 struct key_vector __rcu *parent;
138 struct key_vector kv[1];
167 struct key_vector kv[1];
173 static struct key_vector *resize(struct trie *t, struct key_vector *tn);
188 static inline struct tnode *tn_info(struct key_vector *kv) in tn_info()
202 static inline void node_set_parent(struct key_vector *n, struct key_vector *tp) in node_set_parent()
213 static inline unsigned long child_length(const struct key_vector *tn) in child_length()
220 static inline unsigned long get_index(t_key key, struct key_vector *kv) in get_index()
306 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
337 static inline void empty_child_inc(struct key_vector *n) in empty_child_inc()
345 static inline void empty_child_dec(struct key_vector *n) in empty_child_dec()
353 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa) in leaf_new()
355 struct key_vector *l; in leaf_new()
376 static struct key_vector *tnode_new(t_key key, int pos, int bits) in tnode_new()
379 struct key_vector *tn; in tnode_new()
390 sizeof(struct key_vector *) << bits); in tnode_new()
409 static inline int tnode_full(struct key_vector *tn, struct key_vector *n) in tnode_full()
417 static void put_child(struct key_vector *tn, unsigned long i, in put_child()
418 struct key_vector *n) in put_child()
420 struct key_vector *chi = get_child(tn, i); in put_child()
446 static void update_children(struct key_vector *tn) in update_children()
452 struct key_vector *inode = get_child(tn, --i); in update_children()
468 static inline void put_child_root(struct key_vector *tp, t_key key, in put_child_root()
469 struct key_vector *n) in put_child_root()
477 static inline void tnode_free_init(struct key_vector *tn) in tnode_free_init()
482 static inline void tnode_free_append(struct key_vector *tn, in tnode_free_append()
483 struct key_vector *n) in tnode_free_append()
489 static void tnode_free(struct key_vector *tn) in tnode_free()
507 static struct key_vector *replace(struct trie *t, in replace()
508 struct key_vector *oldtnode, in replace()
509 struct key_vector *tn) in replace()
511 struct key_vector *tp = node_parent(oldtnode); in replace()
526 struct key_vector *inode = get_child(tn, --i); in replace()
536 static struct key_vector *inflate(struct trie *t, in inflate()
537 struct key_vector *oldtnode) in inflate()
539 struct key_vector *tn; in inflate()
558 struct key_vector *inode = get_child(oldtnode, --i); in inflate()
559 struct key_vector *node0, *node1; in inflate()
632 static struct key_vector *halve(struct trie *t, in halve()
633 struct key_vector *oldtnode) in halve()
635 struct key_vector *tn; in halve()
653 struct key_vector *node1 = get_child(oldtnode, --i); in halve()
654 struct key_vector *node0 = get_child(oldtnode, --i); in halve()
655 struct key_vector *inode; in halve()
687 static struct key_vector *collapse(struct trie *t, in collapse()
688 struct key_vector *oldtnode) in collapse()
690 struct key_vector *n, *tp; in collapse()
708 static unsigned char update_suffix(struct key_vector *tn) in update_suffix()
726 struct key_vector *n = get_child(tn, i); in update_suffix()
803 static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn) in should_inflate()
818 static inline bool should_halve(struct key_vector *tp, struct key_vector *tn) in should_halve()
832 static inline bool should_collapse(struct key_vector *tn) in should_collapse()
847 static struct key_vector *resize(struct trie *t, struct key_vector *tn) in resize()
852 struct key_vector *tp = node_parent(tn); in resize()
912 static void node_pull_suffix(struct key_vector *tn, unsigned char slen) in node_pull_suffix()
926 static void node_push_suffix(struct key_vector *tn, unsigned char slen) in node_push_suffix()
935 static struct key_vector *fib_find_node(struct trie *t, in fib_find_node()
936 struct key_vector **tp, u32 key) in fib_find_node()
938 struct key_vector *pn, *n = t->kv; in fib_find_node()
1019 struct key_vector *l, *tp; in fib_find_matching_alias()
1103 static void trie_rebalance(struct trie *t, struct key_vector *tn) in trie_rebalance()
1109 static int fib_insert_node(struct trie *t, struct key_vector *tp, in fib_insert_node()
1112 struct key_vector *n, *l; in fib_insert_node()
1128 struct key_vector *tn; in fib_insert_node()
1159 static int fib_insert_alias(struct trie *t, struct key_vector *tp, in fib_insert_alias()
1160 struct key_vector *l, struct fib_alias *new, in fib_insert_alias()
1211 static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1212 struct key_vector *l, struct fib_alias *old);
1220 struct key_vector *l, *tp; in fib_table_insert()
1419 static inline t_key prefix_mismatch(t_key key, struct key_vector *n) in prefix_mismatch()
1452 struct key_vector *n, *pn; in fib_table_lookup()
1511 struct key_vector __rcu **cptr = n->tnode; in fib_table_lookup()
1650 static void fib_remove_alias(struct trie *t, struct key_vector *tp, in fib_remove_alias()
1651 struct key_vector *l, struct fib_alias *old) in fib_remove_alias()
1717 struct key_vector *l, *tp; in fib_table_delete()
1784 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key) in leaf_walk_rcu()
1786 struct key_vector *pn, *n = *tn; in leaf_walk_rcu()
1844 struct key_vector *pn = t->kv; in fib_trie_free()
1851 struct key_vector *n; in fib_trie_free()
1902 struct key_vector *l, *tp = ot->kv; in fib_trie_unmerge()
1918 struct key_vector *local_l = NULL, *local_tp; in fib_trie_unmerge()
1961 struct key_vector *pn = t->kv; in fib_table_flush_external()
1969 struct key_vector *n; in fib_table_flush_external()
2031 struct key_vector *pn = t->kv; in fib_table_flush()
2040 struct key_vector *n; in fib_table_flush()
2120 struct key_vector *pn = t->kv; in __fib_info_notify_update()
2125 struct key_vector *n; in __fib_info_notify_update()
2178 static int fib_leaf_notify(struct key_vector *l, struct fib_table *tb, in fib_leaf_notify()
2215 struct key_vector *l, *tp = t->kv; in fib_table_notify()
2268 static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb, in fn_trie_dump_leaf()
2359 struct key_vector *l, *tp = t->kv; in fib_table_dump()
2449 struct key_vector *tnode;
2454 static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter) in fib_trie_get_next()
2457 struct key_vector *pn = iter->tnode; in fib_trie_get_next()
2465 struct key_vector *n = get_child_rcu(pn, cindex++); in fib_trie_get_next()
2497 static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter, in fib_trie_get_first()
2500 struct key_vector *n, *pn; in fib_trie_get_first()
2525 struct key_vector *n; in trie_collect_stats()
2590 bytes += sizeof(struct key_vector *) * pointers; in trie_show_stats()
2673 static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos) in fib_trie_get_idx()
2685 struct key_vector *n; in fib_trie_get_idx()
2714 struct key_vector *n; in fib_trie_seq_next()
2800 struct key_vector *n = v; in fib_trie_seq_show()
2850 struct key_vector *tnode;
2855 static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter, in fib_route_get_idx()
2858 struct key_vector *l, **tp = &iter->tnode; in fib_route_get_idx()
2918 struct key_vector *l = NULL; in fib_route_seq_next()
2972 struct key_vector *l = v; in fib_route_seq_show()