124 	unsigned char slen;  member
367 	l->slen = fa->fa_slen;  in leaf_new()
401 	tn->slen = pos;  in tnode_new()
440 	if (n && (tn->slen < n->slen))  in put_child()
441 		tn->slen = n->slen;  in put_child()
710 	unsigned char slen = tn->pos;  in update_suffix()  local
718 	slen_max = min_t(unsigned char, tn->pos + tn->bits - 1, tn->slen);  in update_suffix()
728 		if (!n || (n->slen <= slen))  in update_suffix()
732 		stride <<= (n->slen - slen);  in update_suffix()
733 		slen = n->slen;  in update_suffix()
737 		if (slen >= slen_max)  in update_suffix()
741 	tn->slen = slen;  in update_suffix()
743 	return slen;  in update_suffix()
912 static void node_pull_suffix(struct key_vector *tn, unsigned char slen)  in node_pull_suffix()  argument
914 	unsigned char node_slen = tn->slen;  in node_pull_suffix()
916 	while ((node_slen > tn->pos) && (node_slen > slen)) {  in node_pull_suffix()
917 		slen = update_suffix(tn);  in node_pull_suffix()
918 		if (node_slen == slen)  in node_pull_suffix()
922 		node_slen = tn->slen;  in node_pull_suffix()
926 static void node_push_suffix(struct key_vector *tn, unsigned char slen)  in node_push_suffix()  argument
928 	while (tn->slen < slen) {  in node_push_suffix()
929 		tn->slen = slen;  in node_push_suffix()
982 static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,  in fib_find_alias()  argument
996 		if (fa->fa_slen < slen)  in fib_find_alias()
998 		if (fa->fa_slen != slen)  in fib_find_alias()
1018 	u8 slen = KEYLENGTH - fri->dst_len;  in fib_find_matching_alias()  local
1034 		if (fa->fa_slen == slen && fa->tb_id == fri->tb_id &&  in fib_find_matching_alias()
1187 	if (l->slen < new->fa_slen) {  in fib_insert_alias()
1188 		l->slen = new->fa_slen;  in fib_insert_alias()
1224 	u8 slen = KEYLENGTH - plen;  in fib_table_insert()  local
1244 	fa = l ? fib_find_alias(&l->leaf, slen, dscp, fi->fib_priority,  in fib_table_insert()
1274 			if ((fa->fa_slen != slen) ||  in fib_table_insert()
1370 	new_fa->fa_slen = slen;  in fib_table_insert()
1498 		if (n->slen > n->pos) {  in fib_table_lookup()
1517 		if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))  in fib_table_lookup()
1663 		if (tp->slen == l->slen)  in fib_remove_alias()
1676 	l->slen = fa->fa_slen;  in fib_remove_alias()
1687 	u8 slen = fa_to_delete->fa_slen;  in fib_notify_alias_delete()  local
1691 	if (fib_find_alias(fah, slen, 0, 0, tb_id, true) != fa_to_delete)  in fib_notify_alias_delete()
1699 	if (fa_next && fa_next->fa_slen == slen && fa_next->tb_id == tb_id) {  in fib_notify_alias_delete()
1706 	call_fib_entry_notifiers(net, fib_event, key, KEYLENGTH - slen,  in fib_notify_alias_delete()
1718 	u8 slen = KEYLENGTH - plen;  in fib_table_delete()  local
1732 	fa = fib_find_alias(&l->leaf, slen, dscp, 0, tb->tb_id, false);  in fib_table_delete()
1743 		if ((fa->fa_slen != slen) ||  in fib_table_delete()
1967 		unsigned char slen = 0;  in fib_table_flush_external()  local
1978 			if (pn->slen > pn->pos)  in fib_table_flush_external()
2012 			slen = fa->fa_slen;  in fib_table_flush_external()
2016 		n->slen = slen;  in fib_table_flush_external()
2037 		unsigned char slen = 0;  in fib_table_flush()  local
2048 			if (pn->slen > pn->pos)  in fib_table_flush()
2077 				slen = fa->fa_slen;  in fib_table_flush()
2085 				slen = fa->fa_slen;  in fib_table_flush()
2098 		n->slen = slen;  in fib_table_flush()
2427 	t->kv[0].slen = KEYLENGTH;  in fib_trie_table()