Lines Matching defs:leaf
126 struct hlist_head leaf;
210 * leaf this will return 0 meaning none of the children are accessible.
235 * If n is a leaf, every bit in its key is significant. Its presence is
237 * searching for a leaf - unless we are doing an insertion) we will completely
368 /* link leaf to fib alias */
369 INIT_HLIST_HEAD(&l->leaf);
370 hlist_add_head(&fa->fa_list, &l->leaf);
565 /* A leaf or an internal node with skipped bits */
968 /* keep searching until we find a perfect match leaf or NULL */
1028 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1095 /* parent now has a NULL spot where the leaf can go */
1099 /* Case 3: n is NULL, and will just insert a new leaf */
1124 hlist_for_each_entry(last, &l->leaf, fa_list) {
1136 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1196 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1269 if (fib_find_alias(&l->leaf, fa->fa_slen, 0, 0,
1339 if (fib_find_alias(&l->leaf, new_fa->fa_slen, 0, 0, tb->tb_id, true) ==
1444 /* we have found a leaf. Prefixes have already been compared */
1473 /* exit out and process leaf */
1525 /* Step 3: Process the leaf, if that fails fall back to backtracing */
1526 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1585 res->fa_head = &n->leaf;
1612 /* if we emptied the list this leaf will be freed and we can sort
1615 if (hlist_empty(&l->leaf)) {
1684 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id, false);
1716 fib_notify_alias_delete(net, key, &l->leaf, fa_to_delete, extack);
1733 /* Scan for the next leaf starting at the provided key value */
1758 /* this loop will search for the next leaf with a greater key */
1827 /* record pn and cindex for leaf walking */
1834 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1870 hlist_for_each_entry(fa, &l->leaf, fa_list) {
1945 /* record pn and cindex for leaf walking */
1952 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1966 /* update leaf slen */
1969 if (hlist_empty(&n->leaf)) {
2016 /* record pn and cindex for leaf walking */
2023 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
2041 fib_notify_alias_delete(net, n->key, &n->leaf, fa,
2052 /* update leaf slen */
2055 if (hlist_empty(&n->leaf)) {
2094 /* record pn and cindex for leaf walking */
2101 hlist_for_each_entry(fa, &n->leaf, fa_list) {
2145 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2245 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2498 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
2600 "Basic info: size of leaf:"
2778 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2941 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {