Lines Matching defs:leaf
113 struct leaf {
232 If n is a leaf, every bit in its key is significant. Its presence is
234 searching for a leaf - unless we are doing an insertion) we will completely
312 kfree(container_of(head, struct leaf, rcu));
320 static inline void free_leaf_info(struct leaf_info *leaf)
322 call_rcu(&leaf->rcu, __leaf_info_free_rcu);
354 struct leaf *l = (struct leaf *) tn;
360 static struct leaf *leaf_new(void)
362 struct leaf *l = kmalloc(sizeof(struct leaf), GFP_KERNEL);
705 /* A leaf or an internal node with skipped bits */
886 static struct leaf_info *find_leaf_info(struct leaf *l, int plen)
899 static inline struct list_head * get_fa_head(struct leaf *l, int plen)
932 static struct leaf *
953 /* Case we have found a leaf. Compare prefixes */
956 return (struct leaf *)n;
997 struct leaf *l;
1007 * just put a new leaf in if, or we have reached an empty child slot,
1008 * and we should just put our new leaf in that.
1047 /* Case 1: n is a leaf. Compare prefixes */
1050 struct leaf *l = (struct leaf *) n;
1084 /* Case 2: n is NULL, and will just insert a new leaf */
1158 struct leaf *l;
1297 static inline int check_leaf(struct trie *t, struct leaf *l,
1353 /* Just a leaf? */
1355 if ((ret = check_leaf(t, (struct leaf *)n, key, &plen, flp, res)) <= 0)
1379 if ((ret = check_leaf(t, (struct leaf *)n, key, &plen, flp, res)) <= 0)
1525 struct leaf *l;
1541 l = (struct leaf *) n;
1548 * Remove the leaf and rebalance the tree
1578 struct leaf *l;
1670 static int trie_flush_leaf(struct trie *t, struct leaf *l)
1690 static struct leaf *nextleaf(struct trie *t, struct leaf *thisleaf)
1701 if (IS_LEAF(trie)) /* trie w. just a leaf */
1702 return (struct leaf *) trie;
1738 return (struct leaf *) c;
1754 struct leaf *ll = NULL, *l = NULL;
1785 struct leaf *l;
1902 struct leaf *l = NULL;
2136 bytes = sizeof(struct leaf) * stat->leaves;
2179 seq_printf(seq, "Basic info: size of leaf: %Zd bytes, size of tnode: %Zd bytes.\n",
2180 sizeof(struct leaf), sizeof(struct tnode));
2337 struct leaf *l = (struct leaf *) n;
2426 struct leaf *l = v;