Home
last modified time | relevance | path

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

/haiku/src/add-ons/kernel/network/stack/
H A Dradix.c219 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; in rn_satisfies_leaf() local
223 if (cp3 == 0) in rn_satisfies_leaf()
224 cp3 = rn_ones; in rn_satisfies_leaf()
226 length = min(length, *(u_char *)cp3); in rn_satisfies_leaf()
227 cplim = cp + length; cp3 += skip; cp2 += skip; in rn_satisfies_leaf()
228 for (cp += skip; cp < cplim; cp++, cp2++, cp3++) in rn_satisfies_leaf()
229 if ((*cp ^ *cp2) & *cp3) in rn_satisfies_leaf()
/haiku/headers/libs/agg/
H A Dagg_math.h52 bool cp3 = cross_product(x3, y3, x1, y1, x, y) < 0.0; in point_in_triangle() local
53 return cp1 == cp2 && cp2 == cp3 && cp3 == cp1; in point_in_triangle()
/haiku/src/apps/poorman/libhttpd/
H A Dlibhttpd.c4078 char* cp3; in really_check_referrer() local
4101 for ( cp3 = refhost; cp1 < cp2; ++cp1, ++cp3 ) in really_check_referrer()
4103 *cp3 = tolower(*cp1); in really_check_referrer()
4105 *cp3 = *cp1; in really_check_referrer()
4106 *cp3 = '\0'; in really_check_referrer()