Lines Matching defs:leaf
127 struct hlist_head leaf;
211 * leaf this will return 0 meaning none of the children are accessible.
236 * If n is a leaf, every bit in its key is significant. Its presence is
238 * searching for a leaf - unless we are doing an insertion) we will completely
369 /* link leaf to fib alias */
370 INIT_HLIST_HEAD(&l->leaf);
371 hlist_add_head(&fa->fa_list, &l->leaf);
566 /* A leaf or an internal node with skipped bits */
969 /* keep searching until we find a perfect match leaf or NULL */
1033 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1142 /* parent now has a NULL spot where the leaf can go */
1146 /* Case 3: n is NULL, and will just insert a new leaf */
1171 hlist_for_each_entry(last, &l->leaf, fa_list) {
1183 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1244 fa = l ? fib_find_alias(&l->leaf, slen, dscp, fi->fib_priority,
1318 if (fib_find_alias(&l->leaf, fa->fa_slen, 0, 0,
1389 if (fib_find_alias(&l->leaf, new_fa->fa_slen, 0, 0, tb->tb_id, true) ==
1491 /* we have found a leaf. Prefixes have already been compared */
1520 /* exit out and process leaf */
1572 /* Step 3: Process the leaf, if that fails fall back to backtracing */
1573 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1633 res->fa_head = &n->leaf;
1660 /* if we emptied the list this leaf will be freed and we can sort
1663 if (hlist_empty(&l->leaf)) {
1733 fa = fib_find_alias(&l->leaf, slen, dscp, 0, tb->tb_id, false);
1766 fib_notify_alias_delete(net, key, &l->leaf, fa_to_delete, extack);
1783 /* Scan for the next leaf starting at the provided key value */
1808 /* this loop will search for the next leaf with a greater key */
1877 /* record pn and cindex for leaf walking */
1884 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1920 hlist_for_each_entry(fa, &l->leaf, fa_list) {
1995 /* record pn and cindex for leaf walking */
2002 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
2016 /* update leaf slen */
2019 if (hlist_empty(&n->leaf)) {
2066 /* record pn and cindex for leaf walking */
2073 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
2091 fib_notify_alias_delete(net, n->key, &n->leaf, fa,
2102 /* update leaf slen */
2105 if (hlist_empty(&n->leaf)) {
2144 /* record pn and cindex for leaf walking */
2151 hlist_for_each_entry(fa, &n->leaf, fa_list) {
2186 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2286 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2540 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
2642 "Basic info: size of leaf:"
2820 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2984 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {