Lines Matching defs:tb
1182 int fib_table_insert(struct fib_table *tb, struct fib_config *cfg)
1184 struct trie *t = (struct trie *) tb->tb_data;
1199 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
1292 tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE);
1336 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, tb->tb_id,
1381 int fib_table_lookup(struct fib_table *tb, const struct flowi *flp,
1384 struct trie *t = (struct trie *) tb->tb_data;
1603 int fib_table_delete(struct fib_table *tb, struct fib_config *cfg)
1605 struct trie *t = (struct trie *) tb->tb_data;
1660 rtmsg_fib(RTM_DELROUTE, htonl(key), fa, plen, tb->tb_id,
1796 int fib_table_flush(struct fib_table *tb)
1798 struct trie *t = (struct trie *) tb->tb_data;
1817 void fib_table_select_default(struct fib_table *tb,
1821 struct trie *t = (struct trie *) tb->tb_data;
1864 &last_idx, tb->tb_default)) {
1866 tb->tb_default = order;
1873 tb->tb_default = -1;
1878 tb->tb_default)) {
1880 tb->tb_default = order;
1885 tb->tb_default = last_idx;
1891 struct fib_table *tb,
1912 tb->tb_id,
1928 static int fn_trie_dump_leaf(struct leaf *l, struct fib_table *tb,
1951 if (fn_trie_dump_fa(l->key, li->plen, &li->falh, tb, skb, cb) < 0) {
1962 int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1966 struct trie *t = (struct trie *) tb->tb_data;
1987 if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) {
2020 struct fib_table *tb;
2023 tb = kmalloc(sizeof(struct fib_table) + sizeof(struct trie),
2025 if (tb == NULL)
2028 tb->tb_id = id;
2029 tb->tb_default = -1;
2031 t = (struct trie *) tb->tb_data;
2037 return tb;
2044 struct fib_table *tb;
2217 static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
2219 if (tb->tb_id == RT_TABLE_LOCAL)
2221 else if (tb->tb_id == RT_TABLE_MAIN)
2224 seq_printf(seq, "Id %d:\n", tb->tb_id);
2241 struct fib_table *tb;
2243 hlist_for_each_entry_rcu(tb, node, head, tb_hlist) {
2244 struct trie *t = (struct trie *) tb->tb_data;
2250 fib_table_print(seq, tb);
2286 struct fib_table *tb;
2288 hlist_for_each_entry_rcu(tb, node, head, tb_hlist) {
2292 (struct trie *) tb->tb_data);
2295 iter->tb = tb;
2315 struct fib_table *tb = iter->tb;
2327 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
2328 while ( (tb_node = rcu_dereference(tb->tb_hlist.next)) ) {
2329 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2330 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2338 hlist_for_each_entry_rcu(tb, tb_node, head, tb_hlist) {
2339 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2347 iter->tb = tb;
2406 fib_table_print(seq, iter->tb);
2506 struct fib_table *tb;
2509 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
2510 if (!tb)
2513 iter->main_trie = (struct trie *) tb->tb_data;