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

/net/ipv4/
H A Dfib_trie.c104 struct leaf { struct
284 If n is a leaf, every bit in its key is significant. Its presence is
286 searching for a leaf - unless we are doing an insertion) we will completely
363 struct leaf *l = container_of(head, struct leaf, rcu);
367 static inline void free_leaf(struct leaf *l)
372 static inline void free_leaf_info(struct leaf_info *leaf) argument
374 kfree_rcu(leaf, rcu);
400 free_leaf((struct leaf *) tn);
430 static struct leaf *leaf_ne
[all...]
/net/sched/
H A Dsch_api.c164 if (!(cops->get && cops->put && cops->walk && cops->leaf))
254 struct Qdisc *leaf; local
263 leaf = cops->leaf(p, cl);
265 return leaf;
958 struct Qdisc *leaf; local
962 leaf = cops->leaf(q, cl);
963 if (leaf) {
964 if (leaf
[all...]
H A Dsch_htb.c75 /* interior & leaf nodes; props specific to leaves are marked L: */
91 int quantum; /* but stored for parent-to-leaf return */
98 } leaf; member in union:htb_class::__anon150
182 * should be passed directly thru. In all other cases leaf class is returned.
187 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessful
232 return cl; /* we hit leaf; return it */
517 * htb_activate - inserts leaf cl into appropriate active feeds
519 * Routine learns (new) priority of leaf and activates feed chain
520 * for the prio. It can be called on already active leaf safel
[all...]

Completed in 128 milliseconds