Lines Matching defs:slen
123 unsigned char slen;
366 l->slen = fa->fa_slen;
400 tn->slen = pos;
439 if (n && (tn->slen < n->slen))
440 tn->slen = n->slen;
709 unsigned char slen = tn->pos;
717 slen_max = min_t(unsigned char, tn->pos + tn->bits - 1, tn->slen);
727 if (!n || (n->slen <= slen))
730 /* update stride and slen based on new value */
731 stride <<= (n->slen - slen);
732 slen = n->slen;
736 if (slen >= slen_max)
740 tn->slen = slen;
742 return slen;
911 static void node_pull_suffix(struct key_vector *tn, unsigned char slen)
913 unsigned char node_slen = tn->slen;
915 while ((node_slen > tn->pos) && (node_slen > slen)) {
916 slen = update_suffix(tn);
917 if (node_slen == slen)
921 node_slen = tn->slen;
925 static void node_push_suffix(struct key_vector *tn, unsigned char slen)
927 while (tn->slen < slen) {
928 tn->slen = slen;
981 static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
991 if (fa->fa_slen < slen)
993 if (fa->fa_slen != slen)
1013 u8 slen = KEYLENGTH - fri->dst_len;
1029 if (fa->fa_slen == slen && fa->tb_id == fri->tb_id &&
1139 /* if we added to the tail node then we need to update slen */
1140 if (l->slen < new->fa_slen) {
1141 l->slen = new->fa_slen;
1177 u8 slen = KEYLENGTH - plen;
1196 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1226 if ((fa->fa_slen != slen) ||
1321 new_fa->fa_slen = slen;
1451 if (n->slen > n->pos) {
1470 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
1616 if (tp->slen == l->slen)
1629 l->slen = fa->fa_slen;
1640 u8 slen = fa_to_delete->fa_slen;
1644 if (fib_find_alias(fah, slen, 0, 0, tb_id, true) != fa_to_delete)
1652 if (fa_next && fa_next->fa_slen == slen && fa_next->tb_id == tb_id) {
1659 call_fib_entry_notifiers(net, fib_event, key, KEYLENGTH - slen,
1671 u8 slen = KEYLENGTH - plen;
1684 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id, false);
1694 if ((fa->fa_slen != slen) ||
1918 unsigned char slen = 0;
1929 if (pn->slen > pn->pos)
1962 /* record local slen */
1963 slen = fa->fa_slen;
1966 /* update leaf slen */
1967 n->slen = slen;
1989 unsigned char slen = 0;
2000 if (pn->slen > pn->pos)
2029 slen = fa->fa_slen;
2037 slen = fa->fa_slen;
2052 /* update leaf slen */
2053 n->slen = slen;
2390 t->kv[0].slen = KEYLENGTH;