Home
last modified time | relevance | path

Searched refs:cp3 (Results 1 – 2 of 2) sorted by relevance

/xnu-8019.80.24/bsd/net/
H A Dradix.c253 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; in rn_satisfies_leaf() local
257 if (cp3 == 0) { in rn_satisfies_leaf()
258 cp3 = rn_ones; in rn_satisfies_leaf()
260 length = min(length, *(u_char *)cp3); in rn_satisfies_leaf()
262 cplim = cp + length; cp3 += skip; cp2 += skip; in rn_satisfies_leaf()
263 for (cp += skip; cp < cplim; cp++, cp2++, cp3++) { in rn_satisfies_leaf()
264 if ((*cp ^ *cp2) & *cp3) { in rn_satisfies_leaf()
H A Dif.c1176 const char *cp, *cp2, *cp3; in ifa_ifwithnet_common() local
1208 cp3 = ifa->ifa_netmask->sa_data; in ifa_ifwithnet_common()
1211 while (cp3 < cplim) { in ifa_ifwithnet_common()
1212 if ((*cp++ ^ *cp2++) & *cp3++) { in ifa_ifwithnet_common()
1282 const char *cp, *cp2, *cp3; in ifaof_ifpforaddr() local
1329 cp3 = ifa->ifa_netmask->sa_data; in ifaof_ifpforaddr()
1332 for (; cp3 < cplim; cp3++) { in ifaof_ifpforaddr()
1333 if ((*cp++ ^ *cp2++) & *cp3) { in ifaof_ifpforaddr()
1337 if (cp3 == cplim) { in ifaof_ifpforaddr()