Searched refs:leaf (Results 1 - 25 of 25) sorted by relevance

/net/ipv6/
H A Dip6_fib.c191 table->tb6_root.leaf = net->ipv6.ip6_null_entry;
273 for (rt = w->leaf; rt; rt = rt->dst.rt6_next) {
277 w->leaf = rt;
282 w->leaf = NULL;
439 key = (struct rt6key *)((u8 *)fn->leaf + offset);
463 rt6_release(fn->leaf);
464 fn->leaf = NULL;
501 * Create new leaf node without children.
543 * (new leaf node)[ln] (old node)[fn]
568 in->leaf
[all...]
H A Droute.c663 for (rt = fn->leaf; rt && rt != rr_head && rt->rt6i_metric == metric;
678 fn->rr_ptr = rt0 = fn->leaf;
688 next = fn->leaf;
799 rt = fn->leaf;
1217 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) {
1724 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) {
1923 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) {
1978 for (rt = table->tb6_root.leaf; rt; rt = rt->dst.rt6_next) {
H A Daddrconf.c2115 for (rt = fn->leaf; rt; rt = rt->dst.rt6_next) {
/net/sched/
H A Dsch_htb.c93 /* interior & leaf nodes; props specific to leaves are marked L:
104 int quantum; /* but stored for parent-to-leaf return */
132 } leaf; member in union:htb_class::__anon154
196 * should be passed directly thru. In all other cases leaf class is returned.
201 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessful
225 /* Start with inner filter chain if a non-leaf class is selected */
251 return cl; /* we hit leaf; return it */
539 * htb_activate - inserts leaf cl into appropriate active feeds
541 * Routine learns (new) priority of leaf an
[all...]
H A Dsch_ingress.c113 .leaf = ingress_leaf,
H A Dsch_api.c164 if (!(cops->get && cops->put && cops->walk && cops->leaf))
311 struct Qdisc *leaf; local
320 leaf = cops->leaf(p, cl);
322 return leaf;
1080 struct Qdisc *leaf; local
1084 leaf = cops->leaf(q, cl);
1085 if (leaf) {
1086 if (leaf
[all...]
H A Dsch_mq.c229 .leaf = mq_leaf,
H A Dsch_dsmark.c472 .leaf = dsmark_leaf,
H A Dsch_mqprio.c396 .leaf = mqprio_leaf,
H A Dsch_multiq.c403 .leaf = multiq_leaf,
H A Dsch_prio.c367 .leaf = prio_leaf,
H A Dsch_red.c354 .leaf = red_leaf,
H A Dsch_atm.c654 .leaf = atm_tc_leaf,
H A Dsch_choke.c598 .leaf = choke_leaf,
H A Dsch_drr.c496 .leaf = drr_class_leaf,
H A Dsch_fq_codel.c583 .leaf = fq_codel_leaf,
H A Dsch_sfb.c684 .leaf = sfb_leaf,
H A Dsch_tbf.c544 .leaf = tbf_leaf,
H A Dsch_netem.c1093 .leaf = netem_leaf,
H A Dsch_sfq.c62 should be used as leaf of CBQ or P3, which put interactive traffic
902 .leaf = sfq_leaf,
H A DKconfig58 want to use as leaf disciplines.
H A Dsch_qfq.c1024 WARN_ONCE(1, "qfq_dequeue: non-workconserving leaf\n");
1554 .leaf = qfq_class_leaf,
H A Dsch_cbq.c122 0 for leaf classes, and maximal
276 * Repeat this procdure until we hit a leaf node.
407 /* TC_CBQ_OVL_CLASSIC: (default) penalize leaf class by adding offtime */
439 * real available rate, rather than leaf rate,
2020 .leaf = cbq_leaf,
H A Dsch_hfsc.c126 struct Qdisc *qdisc; /* leaf qdisc */
180 struct list_head droplist; /* active leaf class list (for
305 * get the leaf class with the minimum vt in the hierarchy
1188 return cl; /* hit leaf class */
1712 .leaf = hfsc_class_leaf,
/net/ipv4/
H A Dfib_trie.c103 struct leaf { struct
283 If n is a leaf, every bit in its key is significant. Its presence is
285 searching for a leaf - unless we are doing an insertion) we will completely
362 struct leaf *l = container_of(head, struct leaf, rcu);
366 static inline void free_leaf(struct leaf *l)
371 static inline void free_leaf_info(struct leaf_info *leaf) argument
373 kfree_rcu(leaf, rcu);
399 free_leaf((struct leaf *) tn);
429 static struct leaf *leaf_ne
[all...]

Completed in 458 milliseconds