Lines Matching defs:dst
2167 * return length of part which dst and src are equal
2171 in6_matchlen(src, dst)
2172 struct in6_addr *src, *dst;
2175 u_char *s = (u_char *)src, *d = (u_char *)dst;
2248 struct in6_addr *dst)
2250 int dst_scope = in6_addrscope(dst), src_scope, best_scope = 0;
2274 if (in6_addr2scopeid(ifp, dst) != in6_addr2scopeid(oifp, dst))
2317 * If ifa_best has a smaller scope than dst and
2319 * (or equal to) dst, always replace ifa_best.
2321 * than dst, ignore it unless ifa_best also has a
2325 * (scope(src) < scope(dst) &&
2326 * scope(best) < scope(dst))
2328 * (scope(best) >= scope(dst) &&
2329 * scope(src) >= scope(dst))
2411 * the scope of if_best is larger(smaller) than dst and
2413 * than dst. Such a case has already been covered.
2417 * dst (dscopecmp)
2420 * - if the address match dst longer than ifa_best
2439 * longest address match against dst is considered.
2469 * now we need address matching against dst
2472 tlen = in6_matchlen(IFA_IN6(ifa), dst);
2499 in6_matchlen(IFA_IN6(ifa), dst);
2534 struct in6_addr *dst)
2536 int dst_scope = in6_addrscope(dst), blen = -1, tlen;
2546 * If two or more, return one which matches the dst longest.
2572 blen = in6_matchlen(&besta->ia_addr.sin6_addr, dst);
2573 tlen = in6_matchlen(IFA_IN6(ifa), dst);