Searched refs:leaf (Results 1 – 23 of 23) sorted by relevance
| /net/ipv6/ |
| D | ip6_fib.c | 244 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
419 w->leaf = NULL; in fib6_node_dump()
470 w->leaf = rt; in fib6_dump_node()
491 w->leaf = NULL; in fib6_dump_node()
707 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
709 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
735 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
736 fib6_info_release(leaf); in fib6_add_1()
739 rcu_access_pointer(fn->leaf) == in fib6_add_1()
741 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
[all …]
|
| D | route.c | 854 static void find_rr_leaf(struct fib6_node *fn, struct fib6_info *leaf, in find_rr_leaf() argument
865 __find_rr_leaf(leaf, rr_head, metric, res, &cont, in find_rr_leaf()
878 struct fib6_info *leaf = rcu_dereference(fn->leaf); in rt6_select() local
886 if (!leaf || leaf == net->ipv6.fib6_null_entry) in rt6_select()
891 rt0 = leaf; in rt6_select()
906 find_rr_leaf(fn, leaf, rt0, oif, strict, &do_rr, res); in rt6_select()
912 next = leaf; in rt6_select()
915 spin_lock_bh(&leaf->fib6_table->tb6_lock); in rt6_select()
919 spin_unlock_bh(&leaf->fib6_table->tb6_lock); in rt6_select()
1232 res.f6i = rcu_dereference(fn->leaf); in ip6_pol_route_lookup()
[all …]
|
| /net/sched/ |
| D | sch_htb.c | 127 } leaf; member
560 WARN_ON(cl->level || !cl->leaf.q || !cl->leaf.q->q.qlen); in htb_activate()
605 } else if ((ret = qdisc_enqueue(skb, cl->leaf.q, in htb_enqueue()
847 if (unlikely(cl->leaf.q->q.qlen == 0)) { in htb_dequeue_tree()
863 skb = cl->leaf.q->dequeue(cl->leaf.q); in htb_dequeue_tree()
867 qdisc_warn_nonwc("htb", cl->leaf.q); in htb_dequeue_tree()
876 cl->leaf.deficit[level] -= qdisc_pkt_len(skb); in htb_dequeue_tree()
877 if (cl->leaf.deficit[level] < 0) { in htb_dequeue_tree()
878 cl->leaf.deficit[level] += cl->quantum; in htb_dequeue_tree()
885 if (!cl->leaf.q->q.qlen) in htb_dequeue_tree()
[all …]
|
| D | sch_ingress.c | 124 .leaf = ingress_leaf,
263 .leaf = ingress_leaf,
|
| D | sch_api.c | 152 if (!(cops->find && cops->walk && cops->leaf)) in register_qdisc()
342 return cops->leaf(p, cl); in qdisc_leaf()
1397 struct Qdisc *leaf; in check_loop_fn() local
1401 leaf = cops->leaf(q, cl); in check_loop_fn()
1402 if (leaf) { in check_loop_fn()
1403 if (leaf == arg->p || arg->depth > 7) in check_loop_fn()
1405 return check_loop(leaf, arg->p, arg->depth + 1); in check_loop_fn()
|
| D | sch_skbprio.c | 284 .leaf = skbprio_leaf,
|
| D | sch_mq.c | 277 .leaf = mq_leaf,
|
| D | sch_multiq.c | 382 .leaf = multiq_leaf,
|
| D | sch_prio.c | 405 .leaf = prio_leaf,
|
| D | sch_cbs.c | 534 .leaf = cbs_leaf,
|
| D | sch_tbf.c | 528 .leaf = tbf_leaf,
|
| D | sch_drr.c | 475 .leaf = drr_class_leaf,
|
| D | sch_red.c | 426 .leaf = red_leaf,
|
| D | sch_mqprio.c | 659 .leaf = mqprio_leaf,
|
| D | sch_sfb.c | 691 .leaf = sfb_leaf,
|
| D | sch_fq_codel.c | 693 .leaf = fq_codel_leaf,
|
| D | sch_sfq.c | 905 .leaf = sfq_leaf,
|
| D | sch_netem.c | 1263 .leaf = netem_leaf,
|
| D | sch_qfq.c | 1509 .leaf = qfq_class_leaf,
|
| D | sch_hfsc.c | 1664 .leaf = hfsc_class_leaf,
|
| D | sch_taprio.c | 1980 .leaf = taprio_leaf,
|
| D | sch_cake.c | 3074 .leaf = cake_leaf,
|
| /net/ipv4/ |
| D | fib_trie.c | 127 struct hlist_head leaf; member
372 INIT_HLIST_HEAD(&l->leaf); in leaf_new()
373 hlist_add_head(&fa->fa_list, &l->leaf); in leaf_new()
1079 hlist_for_each_entry(last, &l->leaf, fa_list) { in fib_insert_alias()
1091 hlist_add_head_rcu(&new->fa_list, &l->leaf); in fib_insert_alias()
1149 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority, in fib_table_insert()
1441 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { in fib_table_lookup()
1500 res->fa_head = &n->leaf; in fib_table_lookup()
1529 if (hlist_empty(&l->leaf)) { in fib_remove_alias()
1568 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id); in fib_table_delete()
[all …]
|