Searched refs:leaf (Results 1 – 25 of 28) sorted by relevance
12
| /net/ipv6/ |
| D | ip6_fib.c | 245 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
461 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
462 w->leaf = NULL; in fib6_node_dump()
524 w->leaf = rt; in fib6_dump_node()
545 w->leaf = NULL; in fib6_dump_node()
761 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
763 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
789 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
790 fib6_info_release(leaf); in fib6_add_1()
793 rcu_access_pointer(fn->leaf) == in fib6_add_1()
[all …]
|
| D | route.c | 839 static void find_rr_leaf(struct fib6_node *fn, struct fib6_info *leaf, in find_rr_leaf() argument
850 __find_rr_leaf(leaf, rr_head, metric, res, &cont, in find_rr_leaf()
863 struct fib6_info *leaf = rcu_dereference(fn->leaf); in rt6_select() local
871 if (!leaf || leaf == net->ipv6.fib6_null_entry) in rt6_select()
876 rt0 = leaf; in rt6_select()
891 find_rr_leaf(fn, leaf, rt0, oif, strict, &do_rr, res); in rt6_select()
897 next = leaf; in rt6_select()
900 spin_lock_bh(&leaf->fib6_table->tb6_lock); in rt6_select()
904 spin_unlock_bh(&leaf->fib6_table->tb6_lock); in rt6_select()
1215 res.f6i = rcu_dereference(fn->leaf); in ip6_pol_route_lookup()
[all …]
|
| /net/sched/ |
| D | sch_htb.c | 129 } leaf; member
591 WARN_ON(cl->level || !cl->leaf.q || !cl->leaf.q->q.qlen); in htb_activate()
638 } else if ((ret = qdisc_enqueue(skb, cl->leaf.q, in htb_enqueue()
889 if (unlikely(cl->leaf.q->q.qlen == 0)) { in htb_dequeue_tree()
905 skb = cl->leaf.q->dequeue(cl->leaf.q); in htb_dequeue_tree()
909 qdisc_warn_nonwc("htb", cl->leaf.q); in htb_dequeue_tree()
918 cl->leaf.deficit[level] -= qdisc_pkt_len(skb); in htb_dequeue_tree()
919 if (cl->leaf.deficit[level] < 0) { in htb_dequeue_tree()
920 cl->leaf.deficit[level] += cl->quantum; in htb_dequeue_tree()
927 if (!cl->leaf.q->q.qlen) in htb_dequeue_tree()
[all …]
|
| D | sch_ingress.c | 131 .leaf = ingress_leaf,
272 .leaf = ingress_leaf,
|
| D | sch_api.c | 154 if (!(cops->find && cops->walk && cops->leaf)) in register_qdisc()
345 return cops->leaf(p, cl); in qdisc_leaf()
1407 struct Qdisc *leaf; in check_loop_fn() local
1411 leaf = cops->leaf(q, cl); in check_loop_fn()
1412 if (leaf) { in check_loop_fn()
1413 if (leaf == arg->p || arg->depth > 7) in check_loop_fn()
1415 return check_loop(leaf, arg->p, arg->depth + 1); in check_loop_fn()
|
| D | sch_skbprio.c | 281 .leaf = skbprio_leaf,
|
| D | sch_mq.c | 300 .leaf = mq_leaf,
|
| D | sch_multiq.c | 381 .leaf = multiq_leaf,
|
| D | sch_prio.c | 403 .leaf = prio_leaf,
|
| D | sch_drr.c | 474 .leaf = drr_class_leaf,
|
| D | sch_dsmark.c | 482 .leaf = dsmark_leaf,
|
| D | sch_cbs.c | 535 .leaf = cbs_leaf,
|
| D | sch_tbf.c | 578 .leaf = tbf_leaf,
|
| D | sch_red.c | 536 .leaf = red_leaf,
|
| D | sch_mqprio.c | 681 .leaf = mqprio_leaf,
|
| D | sch_sfb.c | 691 .leaf = sfb_leaf,
|
| D | sch_atm.c | 672 .leaf = atm_tc_leaf,
|
| D | sch_fq_codel.c | 690 .leaf = fq_codel_leaf,
|
| D | sch_ets.c | 797 .leaf = ets_class_leaf,
|
| D | sch_sfq.c | 905 .leaf = sfq_leaf,
|
| D | sch_netem.c | 1263 .leaf = netem_leaf,
|
| D | sch_qfq.c | 1512 .leaf = qfq_class_leaf,
|
| D | sch_hfsc.c | 1667 .leaf = hfsc_class_leaf,
|
| D | sch_cbq.c | 1777 .leaf = cbq_leaf,
|
| /net/ipv4/ |
| D | fib_trie.c | 126 struct hlist_head leaf; member
369 INIT_HLIST_HEAD(&l->leaf); in leaf_new()
370 hlist_add_head(&fa->fa_list, &l->leaf); in leaf_new()
1028 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { in fib_find_matching_alias()
1166 hlist_for_each_entry(last, &l->leaf, fa_list) { in fib_insert_alias()
1178 hlist_add_head_rcu(&new->fa_list, &l->leaf); in fib_insert_alias()
1238 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority, in fib_table_insert()
1312 if (fib_find_alias(&l->leaf, fa->fa_slen, 0, 0, in fib_table_insert()
1383 if (fib_find_alias(&l->leaf, new_fa->fa_slen, 0, 0, tb->tb_id, true) == in fib_table_insert()
1570 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { in fib_table_lookup()
[all …]
|
12