Home
last modified time | relevance | path

Searched refs:cp2 (Results 1 – 10 of 10) sorted by relevance

/haiku/src/libs/uuid/
H A Dcopy.c40 const unsigned char *cp2; in uuid_copy() local
43 for (i=0, cp1 = dst, cp2 = src; i < 16; i++) in uuid_copy()
44 *cp1++ = *cp2++; in uuid_copy()
/haiku/src/apps/poorman/libhttpd/
H A Dlibhttpd.c807 char* cp2; in defang() local
809 for ( cp1 = str, cp2 = dfstr; in defang()
810 *cp1 != '\0' && cp2 - dfstr < dfsize - 5; in defang()
811 ++cp1, ++cp2 ) in defang()
816 *cp2++ = '&'; in defang()
817 *cp2++ = 'l'; in defang()
818 *cp2++ = 't'; in defang()
819 *cp2 = ';'; in defang()
822 *cp2++ = '&'; in defang()
823 *cp2++ = 'g'; in defang()
[all …]
/haiku/src/system/libnetwork/netresolv/resolv/
H A Dres_query.c401 char *file, *cp1, *cp2; in res_hostalias() local
423 for (cp2 = cp1 + 1; *cp2 && in res_hostalias()
424 !isspace((unsigned char)*cp2); ++cp2) in res_hostalias()
426 *cp2 = '\0'; in res_hostalias()
/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
221 int length = min(LEN(cp), LEN(cp2)); 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()
286 register uint8 *cp2 = t->rn_key + head_off; in rn_insert() local
291 if (*cp2++ != *cp++) in rn_insert()
298 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff; in rn_insert()
512 register caddr_t cp = v, cp2; in rn_match() local
541 cp += off; cp2 = t->rn_key + off; cplim = v + vlen; in rn_match()
[all …]
/haiku/src/bin/network/telnet/
H A Dcommands.c158 char *cp, *cp2, c; in makeargv() local
177 for (cp2 = cp; c != '\0'; c = *++cp) { in makeargv()
196 *cp2++ = c; in makeargv()
198 *cp2 = '\0'; in makeargv()
1653 char *cp2 = strchr((char *)ep->value, ':'); in env_init() local
1657 asprintf(&cp, "%s%s", hbuf, cp2); in env_init()
2847 unsigned char *cp, *cp2, *lsrp, *ep; in sourceroute() local
2934 cp2 = 0; in sourceroute()
2935 else for (cp2 = cp; (c = *cp2); cp2++) { in sourceroute()
2937 *cp2++ = '\0'; in sourceroute()
[all …]
H A Dtelnet.c578 char c, *cp, **argvp, *cp2, **argv, **avt; in mklist() local
610 for (cp = cp2 = buf; (c = *cp); cp++) { in mklist()
620 if (n || (cp - cp2 > 41)) in mklist()
622 else if (name && (strncasecmp(name, cp2, cp-cp2) == 0)) in mklist()
623 *argv = cp2; in mklist()
624 else if (is_unique(cp2, argv+1, argvp)) in mklist()
625 *argvp++ = cp2; in mklist()
635 cp2 = cp; in mklist()
/haiku/headers/libs/agg/
H A Dagg_math.h51 bool cp2 = cross_product(x2, y2, x3, y3, x, y) < 0.0; in point_in_triangle() local
53 return cp1 == cp2 && cp2 == cp3 && cp3 == cp1; in point_in_triangle()
/haiku/src/bin/network/ftpd/
H A Dftpcmd.y1279 char *cp, *cp2;
1332 if ((cp2 = strpbrk(cp, " \n")))
1333 cpos = cp2 - cbuf;
/haiku/src/libs/libsolv/solv/
H A Drules.c2614 Id p, *cp2; in prune_to_update_targets() local
2618 for (cp2 = cp; *cp2; cp2++) in prune_to_update_targets()
2619 if (*cp2 == p) in prune_to_update_targets()
H A Dsolver.c1669 Id p, *cp2; in prune_to_update_targets() local
1673 for (cp2 = cp; *cp2; cp2++) in prune_to_update_targets()
1674 if (*cp2 == p) in prune_to_update_targets()