/haiku/src/libs/uuid/ |
H A D | isnull.c | 40 const unsigned char *cp; local 43 for (i=0, cp = uu; i < 16; i++) 44 if (*cp++)
|
H A D | parse.c | 46 const char *cp; local 51 for (i=0, cp = in; i <= 36; i++,cp++) { 54 if (*cp == '-') 60 if (*cp == 0) 62 if (!isxdigit(*cp)) 69 cp = in+24; 72 buf[0] = *cp++; 73 buf[1] = *cp++;
|
/haiku/src/system/libroot/posix/glibc/stdlib/ |
H A D | grouping.h | 55 const STRING_TYPE *cp = end - 1; local 59 while (cp >= begin) 62 if (*cp == thousands) 65 if (cp[thousands_len - 1] == *thousands) 68 if (thousands[cnt] != cp[thousands_len - 1 - cnt]) 74 --cp; 79 if (cp < begin) 82 if (end - cp == (int) *gp + 1) 88 if (cp < begin) 96 new_end = cp [all...] |
/haiku/src/add-ons/accelerants/radeon/ |
H A D | CP.c | 52 CP_info *cp = &ai->si->cp; local 56 *(uint32 *)(ai->mapped_memory[cp->feedback.mem_type].data + cp->feedback.head_mem_offset) 57 //*cp->ring.head 58 - cp->ring.tail; 59 //space = INREG( ai->regs, RADEON_CP_RB_RPTR ) - cp->ring.tail; 62 space += cp->ring.size; 69 *(uint32 *)(ai->mapped_memory[cp->feedback.mem_type].data + cp 85 CP_info *cp = &ai->si->cp; local 128 CP_info *cp = &ai->si->cp; local 171 CP_info *cp = &ai->si->cp; local 203 CP_info *cp = &ai->si->cp; local 271 CP_info *cp = &ai->si->cp; local 363 CP_info *cp = &ai->si->cp; local 384 CP_info *cp = &ai->si->cp; local [all...] |
/haiku/src/system/libnetwork/netresolv/resolv/ |
H A D | res_mkquery.c | 113 register u_char *cp, *ep; local 137 cp = buf + HFIXEDSZ; 149 if (ep - cp < QFIXEDSZ) 151 if ((n = dn_comp(dname, cp, (int)(ep - cp - QFIXEDSZ), dnptrs, 154 cp += n; 155 ns_put16(type, cp); 156 cp += INT16SZ; 157 ns_put16(class, cp); 158 cp 223 register u_char *cp, *ep; local 282 register u_char *cp, *ep; local [all...] |
H A D | res_init.c | 178 register char *cp, **pp; local 272 char buf[sizeof(statp->defdname)], *cp; local 279 cp = strchr(buf, '.'); 280 cp = (cp == NULL) ? buf : (cp + 1); 281 (void)strlcpy(statp->defdname, cp, 288 if ((cp = getenv("LOCALDOMAIN")) != NULL) { 289 (void)strncpy(statp->defdname, cp, sizeof(statp->defdname) - 1); 300 cp 538 const char *cp = options; local [all...] |
H A D | res_debug.c | 212 const u_char *cp = ns_rr_rdata(rr); local 215 GETSHORT(optcode, cp); 216 GETSHORT(optlen, cp); 226 cp[i]); 230 isprint(cp[i])? 231 cp[i] : '.'); 243 cp[i]); 247 isprint(cp[i]) ? 248 cp[i] : '.'); 361 p_cdnname(const u_char *cp, cons argument 375 p_cdname(const u_char *cp, const u_char *msg, FILE *file) argument 384 p_fqnname(const u_char *cp, const u_char *msg, int msglen, char *name, int namelen) argument 405 p_fqname(const u_char *cp, const u_char *msg, FILE *file) argument 794 const char *cp; local 832 const char *cp; local 929 const char *cp, *maxcp; local 1041 const u_char *cp = binary; local [all...] |
/haiku/headers/libs/agg/ |
H A D | agg_curves.h | 170 double cp[8]; member in struct:agg::curve4_points 177 cp[0] = x1; cp[1] = y1; cp[2] = x2; cp[3] = y2; 178 cp[4] = x3; cp[5] = y3; cp[6] = x4; cp[7] = y4; 185 cp[ 210 curve4_inc(const curve4_points& cp) argument 222 init(const curve4_points& cp) argument 295 catrom_to_bezier(const curve4_points& cp) argument 330 ubspline_to_bezier(const curve4_points& cp) argument 367 hermite_to_bezier(const curve4_points& cp) argument 398 curve4_div(const curve4_points& cp) argument 412 init(const curve4_points& cp) argument 594 curve4(const curve4_points& cp) argument 621 init(const curve4_points& cp) argument [all...] |
/haiku/src/system/libroot/posix/glibc/locale/ |
H A D | weight.h | 26 const unsigned char *cp; local 35 cp = &extra[-i]; 42 i = *((const int32_t *) cp); 43 cp += sizeof (int32_t); 48 nhere = *cp++; 60 if (cp[cnt] != usrc[cnt]) 71 cp += nhere; 73 cp += __alignof__ (int32_t) - (1 + nhere) % __alignof__ (int32_t); 83 if (cp[cnt] != usrc[cnt]) 88 if (cp[cn [all...] |
H A D | weightwc.h | 26 const wint_t *cp; local 38 cp = &extra[-i]; 45 i = *cp++; 50 nhere = *cp++; 62 if (cp[cnt] != usrc[cnt]) 73 cp += nhere; 83 if (cp[cnt] != usrc[cnt]) 88 cp += 2 * nhere; 92 if (cp[nhere - 1] > usrc[nhere -1]) 94 cp [all...] |
/haiku/src/libs/util/ |
H A D | fparseln.c | 52 const char *cp; local 65 for (ne = 0, cp = p; --cp >= sp && *cp == esc; ne++) 85 char *ptr, *cp; local 119 for (cp = ptr; cp < ptr + s; cp++) 120 if (*cp == com && !isescaped(ptr, cp, es [all...] |
/haiku/src/system/libnetwork/netresolv/net/ |
H A D | getnetent.c | 122 register char *cp, **q; local 138 cp = strpbrk(p, "#\n"); 139 if (cp == NULL) 141 *cp = '\0'; 143 cp = strpbrk(p, " \t"); 144 if (cp == NULL) 146 *cp++ = '\0'; 147 while (*cp == ' ' || *cp == '\t') 148 cp [all...] |
H A D | getprotoent_r.c | 94 char *p, *cp, **q; local 111 cp = strpbrk(p, " \t"); 112 if (cp == NULL) 114 *cp++ = '\0'; 115 while (*cp == ' ' || *cp == '\t') 116 cp++; 117 p = strpbrk(cp, " \t"); 120 pr->p_proto = atoi(cp); 133 cp [all...] |
H A D | getprotobyname_r.c | 58 char **cp; local 66 for (cp = p->p_aliases; *cp != NULL; cp++) 67 if (strcmp(*cp, name) == 0)
|
H A D | gethnamaddr.c | 203 cp += (x); \ 204 if (cp > eom) \ 219 const u_char *cp; local 262 cp = answer->buf; 267 n = dn_expand(answer->buf, eom, cp, bp, (int)(ep - bp)); 291 while (ancount-- > 0 && cp < eom && !had_error) { 292 n = dn_expand(answer->buf, eom, cp, bp, (int)(ep - bp)); 297 cp += n; /* name */ 298 BOUNDS_CHECK(cp, 3 * INT16SZ + INT32SZ); 299 type = _getshort(cp); 568 const char *cp; local 745 char *cp, **q; local 1117 char *cp, **q, *ptr; local [all...] |
/haiku/src/system/libroot/posix/glibc/extensions/ |
H A D | getopt_init.c | 50 char *cp, **ep; local 55 cp = memcpy (&var[sizeof (var) - sizeof (envvar_tail)], envvar_tail, 57 cp = _itoa_word (__getpid (), cp, 10, 0); 60 len = (var + sizeof (var) - 1) - cp; 64 && __builtin_expect (strncmp (*ep + 1, cp, len) == 0, 0))
|
/haiku/src/system/kernel/util/ |
H A D | inet_addr.c | 82 inet_addr(const char *cp) { argument 85 if (inet_aton(cp, &val)) 91 * Check whether "cp" is a valid ascii representation 98 inet_aton(const char *cp, struct in_addr *addr) { argument 106 c = *cp; 117 c = *++cp; 119 base = 16, c = *++cp; 130 c = *++cp; 136 c = *++cp; 151 c = *++cp; [all...] |
/haiku/src/libs/bsd/ |
H A D | unvis.c | 201 unvis(char *cp, int c, int *astate, int flag) argument 214 _DIAGASSERT(cp != NULL); 235 *cp = 0; 252 *cp = c; 258 *cp = c; 263 *cp = (c - '0'); 267 *cp = (char)0200; 274 *cp = '\n'; 278 *cp = '\r'; 282 *cp [all...] |
/haiku/src/system/libnetwork/netresolv/inet/ |
H A D | inet_net_ntop.c | 179 char *cp; local 188 cp = outbuf; 191 *cp++ = ':'; 192 *cp++ = ':'; 193 *cp = '\0'; 243 *cp++ = ':'; 245 *cp++ = ':'; 252 *cp++ = (p == 6) ? ':' : '.'; 253 cp += SPRINTF((cp, " [all...] |
/haiku/build/scripts/ |
H A D | build_haiku_repository | 35 cp "$packageFile" "$packageDir/$fileName" 39 cp "$repoInfo" "$repositoryDir/repo.info"
|
/haiku/src/libs/mapm/ |
H A D | mapmistr.c | 63 char *cp, *p, sbuf[128]; local 91 cp = (char *)vp; 95 cp = sbuf; 98 p = cp; 134 cp[ct + ii] = '\0'; 135 strcpy(s, cp);
|
/haiku/src/system/libroot/posix/glibc/stdio-common/ |
H A D | _itoa.h | 76 char *cp = _itoa_word (value, tmpbuf + sizeof (value) * 4, base, upper_case); local 77 while (cp < tmpbuf + sizeof (value) * 4) 78 *buf++ = *cp++; 86 char *cp = _itoa (value, tmpbuf + sizeof (value) * 4, base, upper_case); local 87 while (cp < tmpbuf + sizeof (value) * 4) 88 *buf++ = *cp++;
|
/haiku/src/libs/stdc++/legacy/ |
H A D | strstream.cc | 44 istrstream::istrstream(const char *cp, int n) argument 46 __my_sb.init_readonly (cp, n); 49 strstreambase::strstreambase(char *cp, int n, int mode) argument 50 : __my_sb (cp, n, 51 (mode == ios::app || mode == ios::ate) ? cp + strlen(cp) : cp)
|
/haiku/src/add-ons/kernel/drivers/graphics/radeon/ |
H A D | CP_setup.c | 122 ACQUIRE_BEN( di->si->cp.lock ); 134 RELEASE_BEN( di->si->cp.lock ); 268 //if( si->cp.ring.head ) { 270 if( si->cp.feedback.mem_handle != 0 ) { 271 *(uint32 *)MEM2CPU( si->cp.feedback.mem_type, si->cp.feedback.head_mem_offset) = 273 // *si->cp.ring.head = cur_read_ptr; 274 si->cp.ring.tail = cur_read_ptr; 325 CP_info *cp = &si->cp; local 392 CP_info *cp = &di->si->cp; local 444 CP_info *cp = &di->si->cp; local 608 CP_info *cp = &di->si->cp; local [all...] |
/haiku/src/system/libroot/posix/stdlib/ |
H A D | radixsort.c | 134 int *cp, bigc; local 191 for (cp = count + bmin; nc > 0; cp++) { 192 while (*cp == 0) /* Find next non-empty pile. */ 193 cp++; 194 if (*cp > 1) { 195 if (*cp > bigc) { 196 bigc = *cp; 199 push(ak, *cp, i+1); 201 top[cp 234 int *cp, bigc; local [all...] |