Lines Matching refs:slen
123 unsigned char slen; member
366 l->slen = fa->fa_slen; in leaf_new()
400 tn->slen = pos; in tnode_new()
439 if (n && (tn->slen < n->slen)) in put_child()
440 tn->slen = n->slen; in put_child()
709 unsigned char slen = tn->pos; in update_suffix() local
717 slen_max = min_t(unsigned char, tn->pos + tn->bits - 1, tn->slen); in update_suffix()
727 if (!n || (n->slen <= slen)) in update_suffix()
731 stride <<= (n->slen - slen); in update_suffix()
732 slen = n->slen; in update_suffix()
736 if (slen >= slen_max) in update_suffix()
740 tn->slen = slen; in update_suffix()
742 return slen; in update_suffix()
911 static void node_pull_suffix(struct key_vector *tn, unsigned char slen) in node_pull_suffix() argument
913 unsigned char node_slen = tn->slen; in node_pull_suffix()
915 while ((node_slen > tn->pos) && (node_slen > slen)) { in node_pull_suffix()
916 slen = update_suffix(tn); in node_pull_suffix()
917 if (node_slen == slen) in node_pull_suffix()
921 node_slen = tn->slen; in node_pull_suffix()
925 static void node_push_suffix(struct key_vector *tn, unsigned char slen) in node_push_suffix() argument
927 while (tn->slen < slen) { in node_push_suffix()
928 tn->slen = slen; in node_push_suffix()
981 static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen, in fib_find_alias() argument
991 if (fa->fa_slen < slen) in fib_find_alias()
993 if (fa->fa_slen != slen) in fib_find_alias()
1013 u8 slen = KEYLENGTH - fri->dst_len; in fib_find_matching_alias() local
1029 if (fa->fa_slen == slen && fa->tb_id == fri->tb_id && in fib_find_matching_alias()
1175 if (l->slen < new->fa_slen) { in fib_insert_alias()
1176 l->slen = new->fa_slen; in fib_insert_alias()
1212 u8 slen = KEYLENGTH - plen; in fib_table_insert() local
1231 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority, in fib_table_insert()
1261 if ((fa->fa_slen != slen) || in fib_table_insert()
1357 new_fa->fa_slen = slen; in fib_table_insert()
1486 if (n->slen > n->pos) { in fib_table_lookup()
1505 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos)) in fib_table_lookup()
1650 if (tp->slen == l->slen) in fib_remove_alias()
1663 l->slen = fa->fa_slen; in fib_remove_alias()
1674 u8 slen = fa_to_delete->fa_slen; in fib_notify_alias_delete() local
1678 if (fib_find_alias(fah, slen, 0, 0, tb_id, true) != fa_to_delete) in fib_notify_alias_delete()
1686 if (fa_next && fa_next->fa_slen == slen && fa_next->tb_id == tb_id) { in fib_notify_alias_delete()
1693 call_fib_entry_notifiers(net, fib_event, key, KEYLENGTH - slen, in fib_notify_alias_delete()
1705 u8 slen = KEYLENGTH - plen; in fib_table_delete() local
1718 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id, false); in fib_table_delete()
1728 if ((fa->fa_slen != slen) || in fib_table_delete()
1952 unsigned char slen = 0; in fib_table_flush_external() local
1963 if (pn->slen > pn->pos) in fib_table_flush_external()
1997 slen = fa->fa_slen; in fib_table_flush_external()
2001 n->slen = slen; in fib_table_flush_external()
2022 unsigned char slen = 0; in fib_table_flush() local
2033 if (pn->slen > pn->pos) in fib_table_flush()
2062 slen = fa->fa_slen; in fib_table_flush()
2070 slen = fa->fa_slen; in fib_table_flush()
2083 n->slen = slen; in fib_table_flush()
2412 t->kv[0].slen = KEYLENGTH; in fib_trie_table()