Searched defs:leaf (Results 1 - 3 of 3) sorted by relevance

/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...]
/net/sched/
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_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...]

Completed in 74 milliseconds