Cross Reference: /net/ipv4/fib

Lines Matching defs:leaf
104 struct leaf {
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)
374 	kfree_rcu(leaf, rcu);
400 		free_leaf((struct leaf *) tn);
430 static struct leaf *leaf_new(void)
432 	struct leaf *l = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
762 		/* A leaf or an internal node with skipped bits */
911 static struct leaf_info *find_leaf_info(struct leaf *l, int plen)
923 static inline struct list_head *get_fa_head(struct leaf *l, int plen)
955 static struct leaf *
979 	/* Case we have found a leaf. Compare prefixes */
982 		return (struct leaf *)n;
1028 	struct leaf *l;
1038 	 * just put a new leaf in if, or we have reached an empty child slot,
1039 	 * and we should just put our new leaf in that.
1081 	/* Case 1: n is a leaf. Compare prefixes */
1084 		l = (struct leaf *) n;
1111 		/* Case 2: n is NULL, and will just insert a new leaf */
1182 	struct leaf *l;
1340 static int check_leaf(struct fib_table *tb, struct trie *t, struct leaf *l,
1430 	/* Just a leaf? */
1432 		ret = check_leaf(tb, t, (struct leaf *)n, key, flp, res, fib_flags);
1457 			ret = check_leaf(tb, t, (struct leaf *)n, key, flp, res, fib_flags);
1600  * Remove the leaf and return parent.
1602 static void trie_leaf_remove(struct trie *t, struct leaf *l)
1629 	struct leaf *l;
1727 static int trie_flush_leaf(struct leaf *l)
1746  * Scan for the next right leaf starting at node p->child[idx]
1749 static struct leaf *leaf_walk_rcu(struct tnode *p, struct rt_trie_node *c)
1766 				return (struct leaf *) c;
1781 static struct leaf *trie_firstleaf(struct trie *t)
1788 	if (IS_LEAF(n))          /* trie is just a leaf */
1789 		return (struct leaf *) n;
1794 static struct leaf *trie_nextleaf(struct leaf *l)
1800 		return NULL;	/* trie with just one leaf */
1805 static struct leaf *trie_leafindex(struct trie *t, int index)
1807 	struct leaf *l = trie_firstleaf(t);
1822 	struct leaf *l, *ll = NULL;
1882 static int fn_trie_dump_leaf(struct leaf *l, struct fib_table *tb,
1918 	struct leaf *l;
1964 					   max(sizeof(struct leaf),
2080 			struct leaf *l = (struct leaf *)n;
2123 	bytes = sizeof(struct leaf) * stat->leaves;
2183 		   "Basic info: size of leaf:"
2185 		   sizeof(struct leaf), sizeof(struct tnode));
2366 		struct leaf *l = (struct leaf *) n;
2423 static struct leaf *fib_route_get_idx(struct fib_route_iter *iter, loff_t pos)
2425 	struct leaf *l = NULL;
2470 	struct leaf *l = v;
2516 	struct leaf *l = v;