n 106 TSRM/tsrm_virtual_cwd.c while (n-- > 0) if (element[n] != '.') break;
n 108 TSRM/tsrm_virtual_cwd.c return (n != -1);
n 616 TSRM/tsrm_virtual_cwd.c unsigned long n = key % (sizeof(CWDG(realpath_cache)) / sizeof(CWDG(realpath_cache)[0]));
n 617 TSRM/tsrm_virtual_cwd.c realpath_cache_bucket **bucket = &CWDG(realpath_cache)[n];
n 654 TSRM/tsrm_virtual_cwd.c unsigned long n;
n 683 TSRM/tsrm_virtual_cwd.c n = bucket->key % (sizeof(CWDG(realpath_cache)) / sizeof(CWDG(realpath_cache)[0]));
n 684 TSRM/tsrm_virtual_cwd.c bucket->next = CWDG(realpath_cache)[n];
n 685 TSRM/tsrm_virtual_cwd.c CWDG(realpath_cache)[n] = bucket;
n 699 TSRM/tsrm_virtual_cwd.c unsigned long n = key % (sizeof(CWDG(realpath_cache)) / sizeof(CWDG(realpath_cache)[0]));
n 700 TSRM/tsrm_virtual_cwd.c realpath_cache_bucket **bucket = &CWDG(realpath_cache)[n];
n 574 Zend/zend.h ((n) ? (((n)>0) ? 1 : -1) : 0)
n 1230 Zend/zend_API.c ZVAL_LONG(tmp, n);
n 1313 Zend/zend_API.c ZVAL_LONG(tmp, n);
n 1396 Zend/zend_API.c ZVAL_LONG(tmp, n);
n 1580 Zend/zend_API.c ZVAL_LONG(tmp, n);
n 1634 Zend/zend_API.c ZVAL_RESOURCE(tmp, n);
n 646 Zend/zend_API.h ZEND_SET_GLOBAL_VAR(n, var); \
n 655 Zend/zend_API.h ZEND_SET_GLOBAL_VAR(n, var); \
n 664 Zend/zend_API.h ZEND_SET_GLOBAL_VAR(n, var); \
n 673 Zend/zend_API.h ZEND_SET_GLOBAL_VAR(n, var); \
n 668 Zend/zend_alloc.c unsigned int n;
n 670 Zend/zend_alloc.c __asm__("bsrl %1,%0\n\t" : "=r" (n) : "rm" (_size) : "cc");
n 671 Zend/zend_alloc.c return n;
n 673 Zend/zend_alloc.c unsigned long n;
n 675 Zend/zend_alloc.c __asm__("bsr %1,%0\n\t" : "=r" (n) : "rm" (_size) : "cc");
n 676 Zend/zend_alloc.c return (unsigned int)n;
n 684 Zend/zend_alloc.c unsigned int n = 0;
n 687 Zend/zend_alloc.c n++;
n 689 Zend/zend_alloc.c return n-1;
n 696 Zend/zend_alloc.c unsigned int n;
n 698 Zend/zend_alloc.c __asm__("bsfl %1,%0\n\t" : "=r" (n) : "rm" (_size) : "cc");
n 699 Zend/zend_alloc.c return n;
n 701 Zend/zend_alloc.c unsigned long n;
n 703 Zend/zend_alloc.c __asm__("bsf %1,%0\n\t" : "=r" (n) : "rm" (_size) : "cc");
n 704 Zend/zend_alloc.c return (unsigned int)n;
n 713 Zend/zend_alloc.c unsigned int n;
n 716 Zend/zend_alloc.c n = offset[_size & 15];
n 717 Zend/zend_alloc.c while (n == 4) {
n 719 Zend/zend_alloc.c index += n;
n 720 Zend/zend_alloc.c n = offset[_size & 15];
n 723 Zend/zend_alloc.c return index + n;
n 383 Zend/zend_closures.c *n = closure->this_ptr ? 1 : 0;
n 325 Zend/zend_compile.c zval_dtor(&CONSTANT_EX(op_array, n));
n 326 Zend/zend_compile.c if (n + 1 == op_array->last_literal) {
n 329 Zend/zend_compile.c Z_TYPE(CONSTANT_EX(op_array, n)) = IS_NULL;
n 964 Zend/zend_compile.c int n = 0;
n 966 Zend/zend_compile.c while (last_op_number - n > 0) {
n 969 Zend/zend_compile.c last_op = &CG(active_op_array)->opcodes[last_op_number-n-1];
n 974 Zend/zend_compile.c if (n > 0) {
n 989 Zend/zend_compile.c if (n > 0) {
n 1012 Zend/zend_compile.c n++;
n 5927 Zend/zend_compile.c size_t n = 0;
n 5930 Zend/zend_compile.c while (list[n]) {
n 5931 Zend/zend_compile.c n++;
n 5935 Zend/zend_compile.c list = erealloc(list, sizeof(void*) * (n+2));
n 5937 Zend/zend_compile.c list[n] = item;
n 5938 Zend/zend_compile.c list[n+1] = NULL;
n 6793 Zend/zend_compile.c int n = zend_hash_num_elements(CG(class_table));
n 6795 Zend/zend_compile.c if (CG(static_members_table) && n >= CG(last_static_member)) {
n 6797 Zend/zend_compile.c CG(last_static_member) = n+1;
n 6798 Zend/zend_compile.c CG(static_members_table) = realloc(CG(static_members_table), (n+1)*sizeof(zval**));
n 6799 Zend/zend_compile.c CG(static_members_table)[n] = NULL;
n 6801 Zend/zend_compile.c ce->static_members_table = (zval**)(zend_intptr_t)n;
n 404 Zend/zend_compile.h #define EX_TMP_VAR(ex, n) ((temp_variable*)(((char*)(ex)) + ((int)(n))))
n 405 Zend/zend_compile.h #define EX_TMP_VAR_NUM(ex, n) (EX_TMP_VAR(ex, 0) - (1 + (n)))
n 407 Zend/zend_compile.h #define EX_CV_NUM(ex, n) (((zval***)(((char*)(ex))+ZEND_MM_ALIGNED_SIZE(sizeof(zend_execute_data))))+(n))
n 55 Zend/zend_config.w32.h #define strncasecmp(s1, s2, n) strnicmp(s1, s2, n)
n 286 Zend/zend_gc.c int i, n;
n 288 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 290 Zend/zend_gc.c while (n > 0 && !table[n-1]) n--;
n 291 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 298 Zend/zend_gc.c if (!props && i == n - 1) {
n 341 Zend/zend_gc.c int i, n;
n 343 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 345 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 393 Zend/zend_gc.c int i, n;
n 395 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 397 Zend/zend_gc.c while (n > 0 && !table[n-1]) n--;
n 398 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 404 Zend/zend_gc.c if (!props && i == n - 1) {
n 449 Zend/zend_gc.c int i, n;
n 451 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 453 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 533 Zend/zend_gc.c int i, n;
n 535 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 537 Zend/zend_gc.c while (n > 0 && !table[n-1]) n--;
n 538 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 541 Zend/zend_gc.c if (!props && i == n - 1) {
n 590 Zend/zend_gc.c int i, n;
n 592 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 594 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 652 Zend/zend_gc.c int i, n;
n 654 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 663 Zend/zend_gc.c while (n > 0 && !table[n-1]) n--;
n 664 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 670 Zend/zend_gc.c if (!props && i == n - 1) {
n 724 Zend/zend_gc.c int i, n;
n 726 Zend/zend_gc.c HashTable *props = get_gc(pz, &table, &n TSRMLS_CC);
n 728 Zend/zend_gc.c for (i = 0; i < n; i++) {
n 74 Zend/zend_hash.c #define SET_INCONSISTENT(n) ht->inconsistent = n;
n 470 Zend/zend_ini_parser.c # define YYID(n) (n)
n 507 Zend/zend_language_parser.c # define YYID(n) (n)
n 56 Zend/zend_language_scanner.c #define YYFILL(n) { if ((YYCURSOR + n) >= (YYLIMIT + ZEND_MMAP_AHEAD)) { return 0; } }
n 120 Zend/zend_object_handlers.c *n = 0;
n 127 Zend/zend_object_handlers.c *n = 0;
n 131 Zend/zend_object_handlers.c *n = zobj->ce->default_properties_count;
n 309 Zend/zend_operators.h if (n <= 0) {
n 313 Zend/zend_operators.h for (e = (const unsigned char *)s + n - 1; e >= (const unsigned char *)s; e--) {
n 158 Zend/zend_stream.c size_t n;
n 166 Zend/zend_stream.c for (n = 0; n < len && (c = zend_stream_getc(file_handle TSRMLS_CC)) != EOF && c != 4 && c != '\n'; ++n) {
n 168 Zend/zend_stream.c for (n = 0; n < len && (c = zend_stream_getc(file_handle TSRMLS_CC)) != EOF && c != '\n'; ++n) {
n 170 Zend/zend_stream.c buf[n] = (char)c;
n 173 Zend/zend_stream.c buf[n++] = (char)c;
n 176 Zend/zend_stream.c return n;
n 538 Zend/zend_strtod.c t = rv = rv_alloc(n);
n 831 Zend/zend_strtod.c int i, k1, n, n1;
n 836 Zend/zend_strtod.c n = k >> 5;
n 838 Zend/zend_strtod.c n = k >> 4;
n 841 Zend/zend_strtod.c n1 = n + b->wds + 1;
n 847 Zend/zend_strtod.c for(i = 0; i < n; i++) {
n 1284 Zend/zend_strtod.c int n;
n 1293 Zend/zend_strtod.c n = S->wds;
n 1295 Zend/zend_strtod.c /*debug*/ if (b->wds > n)
n 1298 Zend/zend_strtod.c if (b->wds < n)
n 1301 Zend/zend_strtod.c sxe = sx + --n;
n 1303 Zend/zend_strtod.c bxe = bx + n;
n 1338 Zend/zend_strtod.c --n;
n 1339 Zend/zend_strtod.c b->wds = n;
n 1372 Zend/zend_strtod.c bxe = bx + n;
n 1375 Zend/zend_strtod.c --n;
n 1376 Zend/zend_strtod.c b->wds = n;
n 187 ext/bcmath/libbcmath/src/recmul.c int n, prodlen, m1zero;
n 199 ext/bcmath/libbcmath/src/recmul.c n = (MAX(ulen, vlen)+1) / 2;
n 202 ext/bcmath/libbcmath/src/recmul.c if (ulen < n) {
n 206 ext/bcmath/libbcmath/src/recmul.c u1 = new_sub_num (ulen-n, 0, u->n_value);
n 207 ext/bcmath/libbcmath/src/recmul.c u0 = new_sub_num (n, 0, u->n_value+ulen-n);
n 209 ext/bcmath/libbcmath/src/recmul.c if (vlen < n) {
n 213 ext/bcmath/libbcmath/src/recmul.c v1 = new_sub_num (vlen-n, 0, v->n_value);
n 214 ext/bcmath/libbcmath/src/recmul.c v0 = new_sub_num (n, 0, v->n_value+vlen-n);
n 254 ext/bcmath/libbcmath/src/recmul.c _bc_shift_addsub (*prod, m1, 2*n, 0);
n 255 ext/bcmath/libbcmath/src/recmul.c _bc_shift_addsub (*prod, m1, n, 0);
n 257 ext/bcmath/libbcmath/src/recmul.c _bc_shift_addsub (*prod, m3, n, 0);
n 259 ext/bcmath/libbcmath/src/recmul.c _bc_shift_addsub (*prod, m2, n, d1->n_sign != d2->n_sign);
n 516 ext/calendar/calendar.c if (n > 9999 || n < 1) {
n 522 ext/calendar/calendar.c if (n / 1000) {
n 523 ext/calendar/calendar.c *p = alef_bet[n / 1000];
n 536 ext/calendar/calendar.c n = n % 1000;
n 540 ext/calendar/calendar.c while (n >= 400) {
n 543 ext/calendar/calendar.c n -= 400;
n 547 ext/calendar/calendar.c if (n >= 100) {
n 548 ext/calendar/calendar.c *p = alef_bet[18 + n / 100];
n 550 ext/calendar/calendar.c n = n % 100;
n 554 ext/calendar/calendar.c if (n == 15 || n == 16) {
n 557 ext/calendar/calendar.c *p = alef_bet[n - 9];
n 561 ext/calendar/calendar.c if (n >= 10) {
n 562 ext/calendar/calendar.c *p = alef_bet[9 + n / 10];
n 564 ext/calendar/calendar.c n = n % 10;
n 568 ext/calendar/calendar.c if (n > 0) {
n 569 ext/calendar/calendar.c *p = alef_bet[n];
n 101 ext/curl/interface.c tsrm_mutex_lock(php_curl_openssl_tsl[n]);
n 103 ext/curl/interface.c tsrm_mutex_unlock(php_curl_openssl_tsl[n]);
n 493 ext/curl/interface.c size_t n = 0;
n 558 ext/curl/interface.c n = 0;
n 561 ext/curl/interface.c n += sprintf(str + n, "%s%s", *p, *(p + 1) != NULL ? ", " : "");
n 73 ext/date/lib/timelib_structs.h # define TIMELIB_LL_CONST(n) n ## i64
n 77 ext/date/lib/timelib_structs.h # define TIMELIB_LL_CONST(n) n ## ll
n 2187 ext/date/php_date.c *n = 0;
n 2195 ext/date/php_date.c *n = 0;
n 2392 ext/date/php_date.c *n = 0;
n 2413 ext/date/php_date.c zend_hash_update(props, n, strlen(n) + 1, &zv, sizeof(zv), NULL);
n 4027 ext/date/php_date.c value = obj->diff->n; \
n 4098 ext/date/php_date.c obj->diff->n = Z_LVAL_P(value); \
n 4800 ext/date/php_date.c *n = 0;
n 222 ext/dba/dba_cdb.c if (cdb_file_read(cdb->file, buf, n) < n) return NULL; \
n 240 ext/dba/dba_cdb.c if (n >= cdb->eod) return NULL; \
n 241 ext/dba/dba_cdb.c if (cdb_file_lseek(cdb->file, (off_t)n, SEEK_SET TSRMLS_CC) != (off_t) n) return NULL; \
n 49 ext/dba/libcdb/cdb.c unsigned int n;
n 52 ext/dba/libcdb/cdb.c n = sizeof(buf);
n 53 ext/dba/libcdb/cdb.c if (n > len)
n 54 ext/dba/libcdb/cdb.c n = len;
n 55 ext/dba/libcdb/cdb.c if (cdb_read(c, buf, n, pos TSRMLS_CC) == -1)
n 57 ext/dba/libcdb/cdb.c if (memcmp(buf, key, n))
n 59 ext/dba/libcdb/cdb.c pos += n;
n 60 ext/dba/libcdb/cdb.c key += n;
n 61 ext/dba/libcdb/cdb.c len -= n;
n 1431 ext/dom/node.c xmlNode *n, *node;
n 1440 ext/dom/node.c DOM_GET_OBJ(n, id, xmlNodePtr, intern);
n 1442 ext/dom/node.c node = xmlDocCopyNode(n, n->doc, recursive);
n 1450 ext/dom/node.c if (n->type == XML_ELEMENT_NODE && recursive == 0) {
n 1451 ext/dom/node.c if (n->nsDef != NULL) {
n 1452 ext/dom/node.c node->nsDef = xmlCopyNamespaceList(n->nsDef);
n 1454 ext/dom/node.c if (n->ns != NULL) {
n 1456 ext/dom/node.c ns = xmlSearchNs(n->doc, node, n->ns->prefix);
n 1458 ext/dom/node.c ns = xmlSearchNs(n->doc, n, n->ns->prefix);
n 1471 ext/dom/node.c if (n->properties != NULL) {
n 1472 ext/dom/node.c node->properties = xmlCopyPropList(node, n->properties);
n 1477 ext/dom/node.c if (node->doc != n->doc) {
n 53 ext/ereg/regex/regcomp.c #define NEXTn(n) (p->next += (n))
n 67 ext/ereg/regex/regcomp.c #define DROP(n) (p->slen -= (n))
n 922 ext/ereg/regex/regcomp.c # define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
n 1139 ext/ereg/regex/regcomp.c register int n = 0;
n 1143 ext/ereg/regex/regcomp.c n++;
n 1144 ext/ereg/regex/regcomp.c return(n);
n 50 ext/ereg/regex/regex2.h #define OP(n) ((n)&OPRMASK)
n 51 ext/ereg/regex/regex2.h #define OPND(n) ((n)&OPDMASK)
n 25 ext/ereg/regex/regexec.c #define SET0(v, n) ((v) &= ~((unsigned)1 << (n)))
n 26 ext/ereg/regex/regexec.c #define SET1(v, n) ((v) |= (unsigned)1 << (n))
n 27 ext/ereg/regex/regexec.c #define ISSET(v, n) ((v) & ((unsigned)1 << (n)))
n 35 ext/ereg/regex/regexec.c #define INIT(o, n) ((o) = (unsigned)1 << (n))
n 40 ext/ereg/regex/regexec.c #define FWD(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) << (n))
n 41 ext/ereg/regex/regexec.c #define BACK(dst, src, n) ((dst) |= ((unsigned)(src)&(here)) >> (n))
n 42 ext/ereg/regex/regexec.c #define ISSETBACK(v, n) ((v) & ((unsigned)here >> (n)))
n 72 ext/ereg/regex/regexec.c #define SET0(v, n) ((v)[n] = 0)
n 73 ext/ereg/regex/regexec.c #define SET1(v, n) ((v)[n] = 1)
n 74 ext/ereg/regex/regexec.c #define ISSET(v, n) ((v)[n])
n 84 ext/ereg/regex/regexec.c #define INIT(o, n) ((o) = (n))
n 89 ext/ereg/regex/regexec.c #define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here])
n 90 ext/ereg/regex/regexec.c #define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here])
n 91 ext/ereg/regex/regexec.c #define ISSETBACK(v, n) ((v)[here - (n)])
n 156 ext/ereg/regex/split.c register int n;
n 161 ext/ereg/regex/split.c for (n = atoi(argv[3]); n > 0; n--) {
n 165 ext/ereg/regex/split.c for (n = atoi(argv[3]); n > 0; n--) {
n 280 ext/ereg/regex/split.c register int n;
n 287 ext/ereg/regex/split.c for (n = 0; tests[n].str != NULL; n++) {
n 288 ext/ereg/regex/split.c (void) strcpy(buf, tests[n].str);
n 290 ext/ereg/regex/split.c nf = split(buf, fields, RNF, tests[n].seps);
n 292 ext/ereg/regex/split.c if (nf != tests[n].nf) {
n 294 ext/ereg/regex/split.c tests[n].str, tests[n].seps, nf, tests[n].nf);
n 304 ext/ereg/regex/split.c if (strcmp(f, tests[n].fi[i]) != 0) {
n 306 ext/ereg/regex/split.c tests[n].str, tests[n].seps,
n 307 ext/ereg/regex/split.c i, fields[i], tests[n].fi[i]);
n 1049 ext/exif/exif.c int c, i, p=0, n = 5+31;
n 1053 ext/exif/exif.c for(i=0; i<len+15 && p+n<=sizeof(buf); i++) {
n 3447 ext/exif/exif.c int n, marker;
n 3470 ext/exif/exif.c n = 8;
n 3471 ext/exif/exif.c while ((c = data[pos++]) == 0xFF && n--) {
n 992 ext/fileinfo/libmagic/cdf.c const char *n;
n 1023 ext/fileinfo/libmagic/cdf.c return snprintf(buf, bufsiz, "%s", vn[i].n);
n 157 ext/fileinfo/libmagic/compress.c size_t rn = n;
n 160 ext/fileinfo/libmagic/compress.c switch (rv = write(fd, buf, n)) {
n 166 ext/fileinfo/libmagic/compress.c n -= rv;
n 170 ext/fileinfo/libmagic/compress.c while (n > 0);
n 185 ext/fileinfo/libmagic/compress.c size_t rn = n;
n 219 ext/fileinfo/libmagic/compress.c if (t > 0 && (size_t)t < n) {
n 220 ext/fileinfo/libmagic/compress.c n = t;
n 221 ext/fileinfo/libmagic/compress.c rn = n;
n 227 ext/fileinfo/libmagic/compress.c switch ((rv = FINFO_READ_FUNC(fd, buf, n))) {
n 233 ext/fileinfo/libmagic/compress.c return rn - n;
n 235 ext/fileinfo/libmagic/compress.c n -= rv;
n 239 ext/fileinfo/libmagic/compress.c while (n > 0);
n 329 ext/fileinfo/libmagic/compress.c if (data_start+1 >= n)
n 334 ext/fileinfo/libmagic/compress.c while(data_start < n && old[data_start])
n 339 ext/fileinfo/libmagic/compress.c while(data_start < n && old[data_start])
n 346 ext/fileinfo/libmagic/compress.c if (data_start >= n)
n 355 ext/fileinfo/libmagic/compress.c z.avail_in = CAST(uint32_t, (n - data_start));
n 375 ext/fileinfo/libmagic/compress.c n = (size_t)z.total_out;
n 379 ext/fileinfo/libmagic/compress.c (*newch)[n] = '\0';
n 381 ext/fileinfo/libmagic/compress.c return n;
n 396 ext/fileinfo/libmagic/compress.c return uncompressgzipped(ms, old, newch, n);
n 449 ext/fileinfo/libmagic/compress.c if (swrite(fdin[1], old, n) != (ssize_t)n) {
n 483 ext/fileinfo/libmagic/compress.c n = 0;
n 487 ext/fileinfo/libmagic/compress.c n = r;
n 490 ext/fileinfo/libmagic/compress.c (*newch)[n] = '\0';
n 503 ext/fileinfo/libmagic/compress.c return n;
n 294 ext/fileinfo/libmagic/encoding.c int n;
n 336 ext/fileinfo/libmagic/encoding.c for (n = 0; n < following; n++) {
n 329 ext/fileinfo/libmagic/funcs.c (void)(*(n)++ = '\\', \
n 330 ext/fileinfo/libmagic/funcs.c *(n)++ = (((uint32_t)*(o) >> 6) & 3) + '0', \
n 331 ext/fileinfo/libmagic/funcs.c *(n)++ = (((uint32_t)*(o) >> 3) & 7) + '0', \
n 332 ext/fileinfo/libmagic/funcs.c *(n)++ = (((uint32_t)*(o) >> 0) & 7) + '0', \
n 127 ext/filter/logical_filters.c unsigned long n = ((*(str++)) - '0');
n 130 ext/filter/logical_filters.c ((ctx_value = ctx_value * 8) > ((unsigned long)(~(long)0)) - n)) {
n 133 ext/filter/logical_filters.c ctx_value += n;
n 147 ext/filter/logical_filters.c unsigned long n;
n 151 ext/filter/logical_filters.c n = ((*(str++)) - '0');
n 153 ext/filter/logical_filters.c n = ((*(str++)) - ('a' - 10));
n 155 ext/filter/logical_filters.c n = ((*(str++)) - ('A' - 10));
n 160 ext/filter/logical_filters.c ((ctx_value = ctx_value * 16) > ((unsigned long)(~(long)0)) - n)) {
n 163 ext/filter/logical_filters.c ctx_value += n;
n 321 ext/filter/logical_filters.c int first, n;
n 346 ext/filter/logical_filters.c n = 0;
n 348 ext/filter/logical_filters.c ++n;
n 352 ext/filter/logical_filters.c if (!first && n != 3) {
n 374 ext/filter/logical_filters.c if (first?(n < 1 || n > 3):(n != 3)) {
n 561 ext/filter/logical_filters.c int n = 0;
n 581 ext/filter/logical_filters.c ip[n++] = num;
n 582 ext/filter/logical_filters.c if (n == 4) {
n 596 ext/filter/logical_filters.c int n;
n 653 ext/filter/logical_filters.c n = 0;
n 658 ext/filter/logical_filters.c n++;
n 661 ext/filter/logical_filters.c if (n < 1 || n > 4) {
n 703 ext/ftp/ftp.c socklen_t n;
n 717 ext/ftp/ftp.c n = sizeof(ftp->pasvaddr);
n 718 ext/ftp/ftp.c memset(&ftp->pasvaddr, 0, n);
n 722 ext/ftp/ftp.c if (getpeername(ftp->fd, sa, &n) < 0) {
n 743 ext/ftp/ftp.c for (n = 0; *ptr && n < 3; ptr++) {
n 745 ext/ftp/ftp.c n++;
n 769 ext/ftp/ftp.c n = sscanf(ptr, "%lu,%lu,%lu,%lu,%lu,%lu", &b[0], &b[1], &b[2], &b[3], &b[4], &b[5]);
n 770 ext/ftp/ftp.c if (n != 6) {
n 773 ext/ftp/ftp.c for (n = 0; n < 6; n++) {
n 774 ext/ftp/ftp.c ipbox.c[n] = (unsigned char) b[n];
n 987 ext/ftp/ftp.c int n;
n 1000 ext/ftp/ftp.c n = sscanf(ptr, "%4u%2u%2u%2u%2u%2u", &tm.tm_year, &tm.tm_mon, &tm.tm_mday, &tm.tm_hour, &tm.tm_min, &tm.tm_sec);
n 1001 ext/ftp/ftp.c if (n != 6) {
n 1227 ext/ftp/ftp.c int n;
n 1231 ext/ftp/ftp.c n = php_pollfd_for_ms(s, POLLOUT, ftp->timeout_sec * 1000);
n 1233 ext/ftp/ftp.c if (n < 1) {
n 1236 ext/ftp/ftp.c if (n == 0) {
n 1271 ext/ftp/ftp.c int n, nr_bytes;
n 1273 ext/ftp/ftp.c n = php_pollfd_for_ms(s, PHP_POLLREADABLE, ftp->timeout_sec * 1000);
n 1274 ext/ftp/ftp.c if (n < 1) {
n 1276 ext/ftp/ftp.c if (n == 0) {
n 1303 ext/ftp/ftp.c int n;
n 1305 ext/ftp/ftp.c n = php_pollfd_for_ms(s, PHP_POLLREADABLE, 1000);
n 1306 ext/ftp/ftp.c if (n < 1) {
n 1308 ext/ftp/ftp.c if (n == 0) {
n 1323 ext/ftp/ftp.c int n;
n 1325 ext/ftp/ftp.c n = php_pollfd_for_ms(s, POLLOUT, 1000);
n 1326 ext/ftp/ftp.c if (n < 1) {
n 1328 ext/ftp/ftp.c if (n == 0) {
n 1344 ext/ftp/ftp.c int n;
n 1346 ext/ftp/ftp.c n = php_pollfd_for_ms(s, PHP_POLLREADABLE, ftp->timeout_sec * 1000);
n 1347 ext/ftp/ftp.c if (n < 1) {
n 1349 ext/ftp/ftp.c if (n == 0) {
n 1416 ext/gd/gd.c int ind, body_size, n = 0, b, i, body_size_check;
n 1443 ext/gd/gd.c while (b < hdr_size && (n = php_stream_read(stream, (char*)&font[b], hdr_size - b))) {
n 1444 ext/gd/gd.c b += n;
n 1447 ext/gd/gd.c if (!n) {
n 1486 ext/gd/gd.c while (b < body_size && (n = php_stream_read(stream, &font->data[b], body_size - b))) {
n 1487 ext/gd/gd.c b += n;
n 1490 ext/gd/gd.c if (!n) {
n 399 ext/gd/libgd/gd.c float h = HWB.H, w = HWB.W, b = HWB.B, v, n, f;
n 411 ext/gd/libgd/gd.c n = w + f * (v - w); /* linear interpolation between w and v */
n 415 ext/gd/libgd/gd.c RETURN_RGB(v, n, w);
n 417 ext/gd/libgd/gd.c RETURN_RGB(n, v, w);
n 419 ext/gd/libgd/gd.c RETURN_RGB(w, v, n);
n 421 ext/gd/libgd/gd.c RETURN_RGB(w, n, v);
n 423 ext/gd/libgd/gd.c RETURN_RGB(n, w, v);
n 425 ext/gd/libgd/gd.c RETURN_RGB(v, w, n);
n 1656 ext/gd/libgd/gd.c long result = (long) sqrt ((double) n);
n 2564 ext/gd/libgd/gd.c if (n <= 0) {
n 2582 ext/gd/libgd/gd.c draw_line(im, lx, ly, p[n - 1].x, p[n - 1].y, c);
n 2583 ext/gd/libgd/gd.c for (i = 1; i < n; i++) {
n 2617 ext/gd/libgd/gd.c if (n <= 0) {
n 2621 ext/gd/libgd/gd.c if (overflow2(sizeof(int), n)) {
n 2632 ext/gd/libgd/gd.c im->polyInts = (int *) gdMalloc(sizeof(int) * n);
n 2633 ext/gd/libgd/gd.c im->polyAllocated = n;
n 2635 ext/gd/libgd/gd.c if (im->polyAllocated < n) {
n 2636 ext/gd/libgd/gd.c while (im->polyAllocated < n) {
n 2646 ext/gd/libgd/gd.c for (i = 1; i < n; i++) {
n 2669 ext/gd/libgd/gd.c for (i = 0; i < n; i++) {
n 2671 ext/gd/libgd/gd.c ind1 = n - 1;
n 2709 ext/gd/libgd/gd.c gdImagePolygon(im, p, n, c);
n 503 ext/gd/libgd/gd.h void gdImagePolygon(gdImagePtr im, gdPointPtr p, int n, int c);
n 504 ext/gd/libgd/gd.h void gdImageFilledPolygon(gdImagePtr im, gdPointPtr p, int n, int c);
n 1136 ext/gd/libgd/gd_interpolation.c const long n = gd_fxtoi(f_b);
n 1138 ext/gd/libgd/gd_interpolation.c dst_img->tpixels[dst_offset_y][dst_offset_x++] = im->tpixels[m][n];
n 1147 ext/gd/libgd/gd_interpolation.c const long n = gd_fxtoi(f_b);
n 1149 ext/gd/libgd/gd_interpolation.c dst_img->tpixels[dst_offset_y][dst_offset_x++] = colorIndex2RGBA(im->pixels[m][n]);
n 1240 ext/gd/libgd/gd_interpolation.c const long n = gd_fxtoi(f_b);
n 1242 ext/gd/libgd/gd_interpolation.c gdFixed f_g = f_b - gd_itofx(n);
n 1258 ext/gd/libgd/gd_interpolation.c pixel1 = getPixelOverflowPalette(im, n, m, 0);
n 1259 ext/gd/libgd/gd_interpolation.c pixel2 = getPixelOverflowPalette(im, n + 1, m, 0);
n 1260 ext/gd/libgd/gd_interpolation.c pixel3 = getPixelOverflowPalette(im, n, m + 1, 0);
n 1261 ext/gd/libgd/gd_interpolation.c pixel4 = getPixelOverflowPalette(im, n + 1, m + 1, 0);
n 1328 ext/gd/libgd/gd_interpolation.c const long n = gd_fxtoi(f_b);
n 1330 ext/gd/libgd/gd_interpolation.c gdFixed f_g = f_b - gd_itofx(n);
n 1344 ext/gd/libgd/gd_interpolation.c dwSrcTotalOffset = m + n;
n 1346 ext/gd/libgd/gd_interpolation.c pixel1 = getPixelOverflowTC(im, n, m, 0);
n 1347 ext/gd/libgd/gd_interpolation.c pixel2 = getPixelOverflowTC(im, n + 1, m, 0);
n 1348 ext/gd/libgd/gd_interpolation.c pixel3 = getPixelOverflowTC(im, n, m + 1, 0);
n 1349 ext/gd/libgd/gd_interpolation.c pixel4 = getPixelOverflowTC(im, n + 1, m + 1, 0);
n 1434 ext/gd/libgd/gd_interpolation.c const long n = gd_fxtoi(f_b);
n 1436 ext/gd/libgd/gd_interpolation.c const gdFixed f_g = f_b - gd_itofx(n);
n 1443 ext/gd/libgd/gd_interpolation.c if ((m < 1) || (n < 1)) {
n 1444 ext/gd/libgd/gd_interpolation.c src_offset_x[0] = n;
n 1447 ext/gd/libgd/gd_interpolation.c src_offset_x[0] = n - 1;
n 1452 ext/gd/libgd/gd_interpolation.c src_offset_x[1] = n;
n 1455 ext/gd/libgd/gd_interpolation.c src_offset_x[1] = n;
n 1459 ext/gd/libgd/gd_interpolation.c if ((m < 1) || (n >= src_w - 1)) {
n 1460 ext/gd/libgd/gd_interpolation.c src_offset_x[2] = n;
n 1463 ext/gd/libgd/gd_interpolation.c src_offset_x[2] = n + 1;
n 1467 ext/gd/libgd/gd_interpolation.c if ((m < 1) || (n >= src_w - 2)) {
n 1468 ext/gd/libgd/gd_interpolation.c src_offset_x[3] = n;
n 1471 ext/gd/libgd/gd_interpolation.c src_offset_x[3] = n + 1 + 1;
n 1475 ext/gd/libgd/gd_interpolation.c if (n < 1) {
n 1476 ext/gd/libgd/gd_interpolation.c src_offset_x[4] = n;
n 1479 ext/gd/libgd/gd_interpolation.c src_offset_x[4] = n - 1;
n 1483 ext/gd/libgd/gd_interpolation.c src_offset_x[5] = n;
n 1485 ext/gd/libgd/gd_interpolation.c if (n >= src_w-1) {
n 1486 ext/gd/libgd/gd_interpolation.c src_offset_x[6] = n;
n 1489 ext/gd/libgd/gd_interpolation.c src_offset_x[6] = n + 1;
n 1493 ext/gd/libgd/gd_interpolation.c if (n >= src_w - 2) {
n 1494 ext/gd/libgd/gd_interpolation.c src_offset_x[7] = n;
n 1497 ext/gd/libgd/gd_interpolation.c src_offset_x[7] = n + 1 + 1;
n 1501 ext/gd/libgd/gd_interpolation.c if ((m >= src_h - 1) || (n < 1)) {
n 1502 ext/gd/libgd/gd_interpolation.c src_offset_x[8] = n;
n 1505 ext/gd/libgd/gd_interpolation.c src_offset_x[8] = n - 1;
n 1510 ext/gd/libgd/gd_interpolation.c src_offset_x[8] = n;
n 1513 ext/gd/libgd/gd_interpolation.c src_offset_x[9] = n;
n 1517 ext/gd/libgd/gd_interpolation.c if ((m >= src_h-1) || (n >= src_w-1)) {
n 1518 ext/gd/libgd/gd_interpolation.c src_offset_x[10] = n;
n 1521 ext/gd/libgd/gd_interpolation.c src_offset_x[10] = n + 1;
n 1525 ext/gd/libgd/gd_interpolation.c if ((m >= src_h - 1) || (n >= src_w - 2)) {
n 1526 ext/gd/libgd/gd_interpolation.c src_offset_x[11] = n;
n 1529 ext/gd/libgd/gd_interpolation.c src_offset_x[11] = n + 1 + 1;
n 1533 ext/gd/libgd/gd_interpolation.c if ((m >= src_h - 2) || (n < 1)) {
n 1534 ext/gd/libgd/gd_interpolation.c src_offset_x[12] = n;
n 1537 ext/gd/libgd/gd_interpolation.c src_offset_x[12] = n - 1;
n 1542 ext/gd/libgd/gd_interpolation.c src_offset_x[13] = n;
n 1545 ext/gd/libgd/gd_interpolation.c src_offset_x[13] = n;
n 1549 ext/gd/libgd/gd_interpolation.c if ((m >= src_h - 2) || (n >= src_w - 1)) {
n 1550 ext/gd/libgd/gd_interpolation.c src_offset_x[14] = n;
n 1553 ext/gd/libgd/gd_interpolation.c src_offset_x[14] = n + 1;
n 1557 ext/gd/libgd/gd_interpolation.c if ((m >= src_h - 2) || (n >= src_w - 2)) {
n 1558 ext/gd/libgd/gd_interpolation.c src_offset_x[15] = n;
n 1561 ext/gd/libgd/gd_interpolation.c src_offset_x[15] = n + 1 + 1;
n 1694 ext/gd/libgd/gd_interpolation.c long n = gd_fxtoi(f_n);
n 1696 ext/gd/libgd/gd_interpolation.c if ((m > 0) && (m < src_h-1) && (n > 0) && (n < src_w-1)) {
n 1698 ext/gd/libgd/gd_interpolation.c dst->tpixels[dst_offset_y][dst_offset_x++] = src->tpixels[m][n];
n 1751 ext/gd/libgd/gd_interpolation.c long n = gd_fxtoi(f_n);
n 1753 ext/gd/libgd/gd_interpolation.c if ((n <= 0) || (m <= 0) || (m >= src_h) || (n >= src_w)) {
n 1755 ext/gd/libgd/gd_interpolation.c } else if ((n <= 1) || (m <= 1) || (m >= src_h - 1) || (n >= src_w - 1)) {
n 1757 ext/gd/libgd/gd_interpolation.c register int c = getPixelInterpolated(src, n, m, bgColor);
n 1762 ext/gd/libgd/gd_interpolation.c dst->tpixels[dst_offset_y][dst_offset_x++] = getPixelInterpolated(src, n, m, bgColor);
n 1805 ext/gd/libgd/gd_interpolation.c const unsigned int n = gd_fxtoi(f_n);
n 1807 ext/gd/libgd/gd_interpolation.c if ((m > 0) && (m < src_h - 1) && (n > 0) && (n < src_w - 1)) {
n 1809 ext/gd/libgd/gd_interpolation.c const gdFixed f_g = f_n - gd_itofx(n);
n 1815 ext/gd/libgd/gd_interpolation.c if (n < src_w - 1) {
n 1816 ext/gd/libgd/gd_interpolation.c src_offset_x = n + 1;
n 1821 ext/gd/libgd/gd_interpolation.c src_offset_x = n;
n 1825 ext/gd/libgd/gd_interpolation.c if (!((n >= src_w-1) || (m >= src_h-1))) {
n 1826 ext/gd/libgd/gd_interpolation.c src_offset_x = n + 1;
n 1925 ext/gd/libgd/gd_interpolation.c const int n = gd_fxtoi(f_n);
n 1927 ext/gd/libgd/gd_interpolation.c if ((m > 0) && (m < src_h - 1) && (n > 0) && (n < src_w-1)) {
n 1929 ext/gd/libgd/gd_interpolation.c const gdFixed f_g = f_n - gd_itofx(n);
n 1935 ext/gd/libgd/gd_interpolation.c if ((m < 1) || (n < 1)) {
n 1936 ext/gd/libgd/gd_interpolation.c src_offset_x[0] = n;
n 1939 ext/gd/libgd/gd_interpolation.c src_offset_x[0] = n - 1;
n 1944 ext/gd/libgd/gd_interpolation.c src_offset_x[1] = n;
n 1947 ext/gd/libgd/gd_interpolation.c src_offset_x[1] = n;
n 1951 ext/gd/libgd/gd_interpolation.c if ((m < 1) || (n >= src_w-1)) {
n 1955 ext/gd/libgd/gd_interpolation.c src_offset_x[2] = n + 1;
n 1959 ext/gd/libgd/gd_interpolation.c if ((m < 1) || (n >= src_w-2)) {
n 1963 ext/gd/libgd/gd_interpolation.c src_offset_x[3] = n + 1 + 1;
n 1967 ext/gd/libgd/gd_interpolation.c if (n < 1) {
n 1971 ext/gd/libgd/gd_interpolation.c src_offset_x[4] = n - 1;
n 1975 ext/gd/libgd/gd_interpolation.c src_offset_x[5] = n;
n 1977 ext/gd/libgd/gd_interpolation.c if (n >= src_w-1) {
n 1981 ext/gd/libgd/gd_interpolation.c src_offset_x[6] = n + 1;
n 1985 ext/gd/libgd/gd_interpolation.c if (n >= src_w-2) {
n 1989 ext/gd/libgd/gd_interpolation.c src_offset_x[7] = n + 1 + 1;
n 1993 ext/gd/libgd/gd_interpolation.c if ((m >= src_h-1) || (n < 1)) {
n 1997 ext/gd/libgd/gd_interpolation.c src_offset_x[8] = n - 1;
n 2005 ext/gd/libgd/gd_interpolation.c src_offset_x[9] = n;
n 2009 ext/gd/libgd/gd_interpolation.c if ((m >= src_h-1) || (n >= src_w-1)) {
n 2013 ext/gd/libgd/gd_interpolation.c src_offset_x[10] = n + 1;
n 2017 ext/gd/libgd/gd_interpolation.c if ((m >= src_h-1) || (n >= src_w-2)) {
n 2021 ext/gd/libgd/gd_interpolation.c src_offset_x[11] = n + 1 + 1;
n 2025 ext/gd/libgd/gd_interpolation.c if ((m >= src_h-2) || (n < 1)) {
n 2029 ext/gd/libgd/gd_interpolation.c src_offset_x[12] = n - 1;
n 2037 ext/gd/libgd/gd_interpolation.c src_offset_x[13] = n;
n 2041 ext/gd/libgd/gd_interpolation.c if ((m >= src_h-2) || (n >= src_w - 1)) {
n 2045 ext/gd/libgd/gd_interpolation.c src_offset_x[14] = n + 1;
n 2049 ext/gd/libgd/gd_interpolation.c if ((m >= src_h-2) || (n >= src_w-2)) {
n 2053 ext/gd/libgd/gd_interpolation.c src_offset_x[15] = n + 1 + 1;
n 608 ext/gd/libgd/gd_topal.c int n, lb;
n 647 ext/gd/libgd/gd_topal.c n = 1;
n 651 ext/gd/libgd/gd_topal.c n = 0;
n 655 ext/gd/libgd/gd_topal.c n = 2;
n 659 ext/gd/libgd/gd_topal.c n = 1;
n 663 ext/gd/libgd/gd_topal.c n = 2;
n 667 ext/gd/libgd/gd_topal.c n = 0;
n 676 ext/gd/libgd/gd_topal.c switch (n)
n 71 ext/gd/libgd/gd_webp.c size_t size = 0, n;
n 87 ext/gd/libgd/gd_webp.c n = gdGetBuf(read, GD_WEBP_ALLOC_STEP, infile);
n 89 ext/gd/libgd/gd_webp.c if (n>0 && n!=EOF) {
n 90 ext/gd/libgd/gd_webp.c size += n;
n 92 ext/gd/libgd/gd_webp.c } while (n>0 && n!=EOF);
n 216 ext/gd/libgd/gdft.c int i, n = 0;
n 232 ext/gd/libgd/gdft.c n = (n * 16) + byte;
n 238 ext/gd/libgd/gdft.c n = (n * 10) + (byte - '0');
n 245 ext/gd/libgd/gdft.c *chPtr = (Tcl_UniChar) n;
n 348 ext/gd/libgd/gdft.c int n;
n 461 ext/gd/libgd/gdft.c for (n = 0; n < a->face->num_charmaps; n++) {
n 462 ext/gd/libgd/gdft.c charmap = a->face->charmaps[n];
n 160 ext/hash/hash.c int n;
n 162 ext/hash/hash.c while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n 163 ext/hash/hash.c ops->hash_update(context, (unsigned char *) buf, n);
n 277 ext/hash/hash.c int n;
n 280 ext/hash/hash.c while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n 281 ext/hash/hash.c ops->hash_update(context, (unsigned char *) buf, n);
n 435 ext/hash/hash.c long n, toread = 1024;
n 441 ext/hash/hash.c if ((n = php_stream_read(stream, buf, toread)) <= 0) {
n 445 ext/hash/hash.c hash->ops->hash_update(hash->context, (unsigned char *) buf, n);
n 446 ext/hash/hash.c length -= n;
n 447 ext/hash/hash.c didread += n;
n 463 ext/hash/hash.c int filename_len, n;
n 478 ext/hash/hash.c while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n 479 ext/hash/hash.c hash->ops->hash_update(hash->context, (unsigned char *) buf, n);
n 139 ext/hash/hash_haval.c #define ROTR(x,n) (((x) >> (n)) | ((x) << (32 - (n))))
n 144 ext/hash/hash_md.c int n;
n 158 ext/hash/hash_md.c while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n 159 ext/hash/hash_md.c PHP_MD5Update(&context, buf, n);
n 166 ext/hash/hash_md.c if (n<0) {
n 238 ext/hash/hash_md.c #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
n 150 ext/hash/hash_ripemd.c #define K(n) K_values[ (n) >> 4]
n 151 ext/hash/hash_ripemd.c #define KK(n) KK_values[(n) >> 4]
n 152 ext/hash/hash_ripemd.c #define KK160(n) KK160_values[(n) >> 4]
n 184 ext/hash/hash_ripemd.c #define ROL(n, x) (((x) << n) | ((x) >> (32 - n)))
n 128 ext/hash/hash_sha.c int n;
n 142 ext/hash/hash_sha.c while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n 143 ext/hash/hash_sha.c PHP_SHA1Update(&context, buf, n);
n 150 ext/hash/hash_sha.c if (n<0) {
n 172 ext/hash/hash_sha.c #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
n 2730 ext/imap/php_imap.c "abcdefghijklmnopqrstuvwxyz0123456789+,"[(n) & 0x3f])
n 209 ext/interbase/ibase_query.c unsigned short i, n;
n 222 ext/interbase/ibase_query.c for (i = n = 0; i < sqlda->sqld; ++i) {
n 228 ext/interbase/ibase_query.c ibase_array *a = &ar[n++];
n 535 ext/interbase/ibase_query.c unsigned short n;
n 584 ext/interbase/ibase_query.c n = sscanf(Z_STRVAL_P(val), "%d%*[/]%d%*[/]%d %d%*[:]%d%*[:]%d",
n 587 ext/interbase/ibase_query.c if (n != 3 && n != 6) {
n 589 ext/interbase/ibase_query.c " Use format 'm/d/Y H:i:s'. You gave '%s')" TSRMLS_CC, n, Z_STRVAL_P(val));
n 602 ext/interbase/ibase_query.c n = sscanf(Z_STRVAL_P(val), "%d%*[/]%d%*[/]%d", &t.tm_mon, &t.tm_mday, &t.tm_year);
n 604 ext/interbase/ibase_query.c if (n != 3) {
n 606 ext/interbase/ibase_query.c "Use format 'm/d/Y' You gave '%s')" TSRMLS_CC, n, Z_STRVAL_P(val));
n 619 ext/interbase/ibase_query.c n = sscanf(Z_STRVAL_P(val), "%d%*[:]%d%*[:]%d", &t.tm_hour, &t.tm_min, &t.tm_sec);
n 621 ext/interbase/ibase_query.c if (n != 3) {
n 623 ext/interbase/ibase_query.c "Use format 'H:i:s'. You gave '%s')" TSRMLS_CC, n, Z_STRVAL_P(val));
n 1318 ext/interbase/ibase_query.c long n;
n 1331 ext/interbase/ibase_query.c n = *(short *) data;
n 1335 ext/interbase/ibase_query.c n = *(long *) data;
n 1342 ext/interbase/ibase_query.c ISC_INT64 n = *(ISC_INT64 *) data, f = scales[-scale];
n 1344 ext/interbase/ibase_query.c if (n >= 0) {
n 1345 ext/interbase/ibase_query.c l = slprintf(string_data, sizeof(string_data), "%" LL_MASK "d.%0*" LL_MASK "d", n / f, -scale, n % f);
n 1346 ext/interbase/ibase_query.c } else if (n <= -f) {
n 1347 ext/interbase/ibase_query.c l = slprintf(string_data, sizeof(string_data), "%" LL_MASK "d.%0*" LL_MASK "d", n / f, -scale, -n % f);
n 1349 ext/interbase/ibase_query.c l = slprintf(string_data, sizeof(string_data), "-0.%0*" LL_MASK "d", -scale, -n % f);
n 1356 ext/interbase/ibase_query.c n = *(ISC_LONG *) data;
n 1359 ext/interbase/ibase_query.c ZVAL_LONG(val,n);
n 1363 ext/interbase/ibase_query.c if (n >= 0) {
n 1364 ext/interbase/ibase_query.c l = slprintf(string_data, sizeof(string_data), "%ld.%0*ld", n / f, -scale, n % f);
n 1365 ext/interbase/ibase_query.c } else if (n <= -f) {
n 1366 ext/interbase/ibase_query.c l = slprintf(string_data, sizeof(string_data), "%ld.%0*ld", n / f, -scale, -n % f);
n 1368 ext/interbase/ibase_query.c l = slprintf(string_data, sizeof(string_data), "-0.%0*ld", -scale, -n % f);
n 213 ext/intl/breakiterator/codepointiterator_internal.cpp UBool res = utext_moveIndex32(this->fText, n);
n 71 ext/intl/breakiterator/codepointiterator_internal.h virtual int32_t next(int32_t n);
n 110 ext/mbstring/libmbfl/filters/mbfilter_armscii8.c int s, n;
n 118 ext/mbstring/libmbfl/filters/mbfilter_armscii8.c n = armscii8_ucs_table_len-1;
n 119 ext/mbstring/libmbfl/filters/mbfilter_armscii8.c while (n >= 0) {
n 120 ext/mbstring/libmbfl/filters/mbfilter_armscii8.c if (c == armscii8_ucs_table[n]) {
n 121 ext/mbstring/libmbfl/filters/mbfilter_armscii8.c s = armscii8_ucs_table_min + n;
n 124 ext/mbstring/libmbfl/filters/mbfilter_armscii8.c n--;
n 86 ext/mbstring/libmbfl/filters/mbfilter_base64.c int n;
n 88 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = (filter->status & 0xff);
n 89 ext/mbstring/libmbfl/filters/mbfilter_base64.c if (n == 0) {
n 92 ext/mbstring/libmbfl/filters/mbfilter_base64.c } else if (n == 1) {
n 98 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = (filter->status & 0xff00) >> 8;
n 99 ext/mbstring/libmbfl/filters/mbfilter_base64.c if (n > 72) {
n 106 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = filter->cache | (c & 0xff);
n 107 ext/mbstring/libmbfl/filters/mbfilter_base64.c CK((*filter->output_function)(mbfl_base64_table[(n >> 18) & 0x3f], filter->data));
n 108 ext/mbstring/libmbfl/filters/mbfilter_base64.c CK((*filter->output_function)(mbfl_base64_table[(n >> 12) & 0x3f], filter->data));
n 109 ext/mbstring/libmbfl/filters/mbfilter_base64.c CK((*filter->output_function)(mbfl_base64_table[(n >> 6) & 0x3f], filter->data));
n 110 ext/mbstring/libmbfl/filters/mbfilter_base64.c CK((*filter->output_function)(mbfl_base64_table[n & 0x3f], filter->data));
n 151 ext/mbstring/libmbfl/filters/mbfilter_base64.c int n;
n 157 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = 0;
n 159 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = c - 65;
n 161 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = c - 71;
n 163 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = c + 4;
n 165 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = 62;
n 167 ext/mbstring/libmbfl/filters/mbfilter_base64.c n = 63;
n 169 ext/mbstring/libmbfl/filters/mbfilter_base64.c n &= 0x3f;
n 174 ext/mbstring/libmbfl/filters/mbfilter_base64.c filter->cache = n << 18;
n 178 ext/mbstring/libmbfl/filters/mbfilter_base64.c filter->cache |= n << 12;
n 182 ext/mbstring/libmbfl/filters/mbfilter_base64.c filter->cache |= n << 6;
n 186 ext/mbstring/libmbfl/filters/mbfilter_base64.c n |= filter->cache;
n 187 ext/mbstring/libmbfl/filters/mbfilter_base64.c CK((*filter->output_function)((n >> 16) & 0xff, filter->data));
n 188 ext/mbstring/libmbfl/filters/mbfilter_base64.c CK((*filter->output_function)((n >> 8) & 0xff, filter->data));
n 189 ext/mbstring/libmbfl/filters/mbfilter_base64.c CK((*filter->output_function)(n & 0xff, filter->data));
n 93 ext/mbstring/libmbfl/filters/mbfilter_byte2.c int n;
n 97 ext/mbstring/libmbfl/filters/mbfilter_byte2.c n = (c & 0xff) << 8;
n 98 ext/mbstring/libmbfl/filters/mbfilter_byte2.c filter->cache = n;
n 101 ext/mbstring/libmbfl/filters/mbfilter_byte2.c n = (c & 0xff) | filter->cache;
n 102 ext/mbstring/libmbfl/filters/mbfilter_byte2.c CK((*filter->output_function)(n, filter->data));
n 116 ext/mbstring/libmbfl/filters/mbfilter_byte2.c int n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_byte2.c n = c & 0xff;
n 121 ext/mbstring/libmbfl/filters/mbfilter_byte2.c filter->cache = n;
n 124 ext/mbstring/libmbfl/filters/mbfilter_byte2.c n = ((c & 0xff) << 8) | filter->cache;
n 125 ext/mbstring/libmbfl/filters/mbfilter_byte2.c CK((*filter->output_function)(n, filter->data));
n 95 ext/mbstring/libmbfl/filters/mbfilter_byte4.c int n;
n 99 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = (c & 0xff) << 24;
n 100 ext/mbstring/libmbfl/filters/mbfilter_byte4.c filter->cache = n;
n 103 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = (c & 0xff) << 16;
n 104 ext/mbstring/libmbfl/filters/mbfilter_byte4.c filter->cache |= n;
n 107 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = (c & 0xff) << 8;
n 108 ext/mbstring/libmbfl/filters/mbfilter_byte4.c filter->cache |= n;
n 111 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = (c & 0xff) | filter->cache;
n 112 ext/mbstring/libmbfl/filters/mbfilter_byte4.c CK((*filter->output_function)(n, filter->data));
n 128 ext/mbstring/libmbfl/filters/mbfilter_byte4.c int n;
n 132 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = (c & 0xff);
n 133 ext/mbstring/libmbfl/filters/mbfilter_byte4.c filter->cache = n;
n 136 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = (c & 0xff) << 8;
n 137 ext/mbstring/libmbfl/filters/mbfilter_byte4.c filter->cache |= n;
n 140 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = (c & 0xff) << 16;
n 141 ext/mbstring/libmbfl/filters/mbfilter_byte4.c filter->cache |= n;
n 144 ext/mbstring/libmbfl/filters/mbfilter_byte4.c n = ((c & 0xff) << 24) | filter->cache;
n 145 ext/mbstring/libmbfl/filters/mbfilter_byte4.c CK((*filter->output_function)(n, filter->data));
n 112 ext/mbstring/libmbfl/filters/mbfilter_cp1251.c int s, n;
n 118 ext/mbstring/libmbfl/filters/mbfilter_cp1251.c n = cp1251_ucs_table_len-1;
n 119 ext/mbstring/libmbfl/filters/mbfilter_cp1251.c while (n >= 0) {
n 120 ext/mbstring/libmbfl/filters/mbfilter_cp1251.c if (c == cp1251_ucs_table[n]) {
n 121 ext/mbstring/libmbfl/filters/mbfilter_cp1251.c s = cp1251_ucs_table_min + n;
n 124 ext/mbstring/libmbfl/filters/mbfilter_cp1251.c n--;
n 83 ext/mbstring/libmbfl/filters/mbfilter_cp1252.c int s=-1, n;
n 88 ext/mbstring/libmbfl/filters/mbfilter_cp1252.c n = 31;
n 89 ext/mbstring/libmbfl/filters/mbfilter_cp1252.c while (n >= 0) {
n 90 ext/mbstring/libmbfl/filters/mbfilter_cp1252.c if (c == cp1252_ucs_table[n] && c != 0xfffe) {
n 91 ext/mbstring/libmbfl/filters/mbfilter_cp1252.c s = 0x80 + n;
n 94 ext/mbstring/libmbfl/filters/mbfilter_cp1252.c n--;
n 84 ext/mbstring/libmbfl/filters/mbfilter_cp1254.c int s, n;
n 90 ext/mbstring/libmbfl/filters/mbfilter_cp1254.c n = cp1254_ucs_table_len-1;
n 91 ext/mbstring/libmbfl/filters/mbfilter_cp1254.c while (n >= 0) {
n 92 ext/mbstring/libmbfl/filters/mbfilter_cp1254.c if (c == cp1254_ucs_table[n] && c != 0xfffe) {
n 93 ext/mbstring/libmbfl/filters/mbfilter_cp1254.c s = cp1254_ucs_table_min + n;
n 96 ext/mbstring/libmbfl/filters/mbfilter_cp1254.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_cp850.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_cp850.c n = cp850_ucs_table_len-1;
n 115 ext/mbstring/libmbfl/filters/mbfilter_cp850.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_cp850.c if (c == cp850_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_cp850.c s = cp850_ucs_table_min + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_cp850.c n--;
n 112 ext/mbstring/libmbfl/filters/mbfilter_cp866.c int s, n;
n 118 ext/mbstring/libmbfl/filters/mbfilter_cp866.c n = cp866_ucs_table_len-1;
n 119 ext/mbstring/libmbfl/filters/mbfilter_cp866.c while (n >= 0) {
n 120 ext/mbstring/libmbfl/filters/mbfilter_cp866.c if (c == cp866_ucs_table[n]) {
n 121 ext/mbstring/libmbfl/filters/mbfilter_cp866.c s = cp866_ucs_table_min + n;
n 124 ext/mbstring/libmbfl/filters/mbfilter_cp866.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_euc_jp_win.c int c1, s, w, n;
n 213 ext/mbstring/libmbfl/filters/mbfilter_euc_jp_win.c n = 0;
n 214 ext/mbstring/libmbfl/filters/mbfilter_euc_jp_win.c while (n < cp932ext3_eucjp_table_size) {
n 215 ext/mbstring/libmbfl/filters/mbfilter_euc_jp_win.c if (s == cp932ext3_eucjp_table[n]) {
n 216 ext/mbstring/libmbfl/filters/mbfilter_euc_jp_win.c if (n < (cp932ext3_ucs_table_max - cp932ext3_ucs_table_min)) {
n 217 ext/mbstring/libmbfl/filters/mbfilter_euc_jp_win.c w = cp932ext3_ucs_table[n];
n 221 ext/mbstring/libmbfl/filters/mbfilter_euc_jp_win.c n++;
n 84 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c int k, k1 = 0, k2 = n-1;
n 102 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c int k, k1 = 0, k2 = n;
n 108 ext/mbstring/libmbfl/filters/mbfilter_iso8859_10.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_10.c n = 95;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_10.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_10.c if (c == iso8859_10_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_10.c s = 0xa0 + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_iso8859_10.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_iso8859_13.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_13.c n = 95;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_13.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_13.c if (c == iso8859_13_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_13.c s = 0xa0 + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_iso8859_13.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_iso8859_14.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_14.c n = 95;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_14.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_14.c if (c == iso8859_14_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_14.c s = 0xa0 + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_iso8859_14.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_iso8859_15.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_15.c n = 95;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_15.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_15.c if (c == iso8859_15_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_15.c s = 0xa0 + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_iso8859_15.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_iso8859_16.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_16.c n = 95;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_16.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_16.c if (c == iso8859_16_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_16.c s = 0xa0 + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_iso8859_16.c n--;
n 109 ext/mbstring/libmbfl/filters/mbfilter_iso8859_2.c int s, n;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_2.c n = 95;
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_2.c while (n >= 0) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_2.c if (c == iso8859_2_ucs_table[n]) {
n 118 ext/mbstring/libmbfl/filters/mbfilter_iso8859_2.c s = 0xa0 + n;
n 121 ext/mbstring/libmbfl/filters/mbfilter_iso8859_2.c n--;
n 109 ext/mbstring/libmbfl/filters/mbfilter_iso8859_3.c int s, n;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_3.c n = 95;
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_3.c while (n >= 0) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_3.c if (c == iso8859_3_ucs_table[n]) {
n 118 ext/mbstring/libmbfl/filters/mbfilter_iso8859_3.c s = 0xa0 + n;
n 121 ext/mbstring/libmbfl/filters/mbfilter_iso8859_3.c n--;
n 107 ext/mbstring/libmbfl/filters/mbfilter_iso8859_4.c int s, n;
n 113 ext/mbstring/libmbfl/filters/mbfilter_iso8859_4.c n = 95;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_4.c while (n >= 0) {
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_4.c if (c == iso8859_4_ucs_table[n]) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_4.c s = 0xa0 + n;
n 119 ext/mbstring/libmbfl/filters/mbfilter_iso8859_4.c n--;
n 109 ext/mbstring/libmbfl/filters/mbfilter_iso8859_5.c int s, n;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_5.c n = 95;
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_5.c while (n >= 0) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_5.c if (c == iso8859_5_ucs_table[n]) {
n 118 ext/mbstring/libmbfl/filters/mbfilter_iso8859_5.c s = 0xa0 + n;
n 121 ext/mbstring/libmbfl/filters/mbfilter_iso8859_5.c n--;
n 109 ext/mbstring/libmbfl/filters/mbfilter_iso8859_6.c int s, n;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_6.c n = 95;
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_6.c while (n >= 0) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_6.c if (c == iso8859_6_ucs_table[n]) {
n 118 ext/mbstring/libmbfl/filters/mbfilter_iso8859_6.c s = 0xa0 + n;
n 121 ext/mbstring/libmbfl/filters/mbfilter_iso8859_6.c n--;
n 109 ext/mbstring/libmbfl/filters/mbfilter_iso8859_7.c int s, n;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_7.c n = 95;
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_7.c while (n >= 0) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_7.c if (c == iso8859_7_ucs_table[n]) {
n 118 ext/mbstring/libmbfl/filters/mbfilter_iso8859_7.c s = 0xa0 + n;
n 121 ext/mbstring/libmbfl/filters/mbfilter_iso8859_7.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_iso8859_8.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_8.c n = 95;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_8.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_8.c if (c == iso8859_8_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_8.c s = 0xa0 + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_iso8859_8.c n--;
n 108 ext/mbstring/libmbfl/filters/mbfilter_iso8859_9.c int s, n;
n 114 ext/mbstring/libmbfl/filters/mbfilter_iso8859_9.c n = 95;
n 115 ext/mbstring/libmbfl/filters/mbfilter_iso8859_9.c while (n >= 0) {
n 116 ext/mbstring/libmbfl/filters/mbfilter_iso8859_9.c if (c == iso8859_9_ucs_table[n]) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_iso8859_9.c s = 0xa0 + n;
n 120 ext/mbstring/libmbfl/filters/mbfilter_iso8859_9.c n--;
n 112 ext/mbstring/libmbfl/filters/mbfilter_koi8r.c int s, n;
n 118 ext/mbstring/libmbfl/filters/mbfilter_koi8r.c n = koi8r_ucs_table_len-1;
n 119 ext/mbstring/libmbfl/filters/mbfilter_koi8r.c while (n >= 0) {
n 120 ext/mbstring/libmbfl/filters/mbfilter_koi8r.c if (c == koi8r_ucs_table[n]) {
n 121 ext/mbstring/libmbfl/filters/mbfilter_koi8r.c s = koi8r_ucs_table_min + n;
n 124 ext/mbstring/libmbfl/filters/mbfilter_koi8r.c n--;
n 109 ext/mbstring/libmbfl/filters/mbfilter_koi8u.c int s, n;
n 115 ext/mbstring/libmbfl/filters/mbfilter_koi8u.c n = koi8u_ucs_table_len-1;
n 116 ext/mbstring/libmbfl/filters/mbfilter_koi8u.c while (n >= 0) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_koi8u.c if (c == koi8u_ucs_table[n]) {
n 118 ext/mbstring/libmbfl/filters/mbfilter_koi8u.c s = koi8u_ucs_table_min + n;
n 121 ext/mbstring/libmbfl/filters/mbfilter_koi8u.c n--;
n 74 ext/mbstring/libmbfl/filters/mbfilter_qprint.c int s, n;
n 84 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n = (filter->status & 0xff00) >> 8;
n 103 ext/mbstring/libmbfl/filters/mbfilter_qprint.c if ((filter->status & MBFL_QPRINT_STS_MIME_HEADER) == 0 && n >= 72) { /* soft line feed */
n 115 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n = (s >> 4) & 0xf;
n 116 ext/mbstring/libmbfl/filters/mbfilter_qprint.c if (n < 10) {
n 117 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n += 48; /* '0' */
n 119 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n += 55; /* 'A' - 10 */
n 121 ext/mbstring/libmbfl/filters/mbfilter_qprint.c CK((*filter->output_function)(n, filter->data));
n 122 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n = s & 0xf;
n 123 ext/mbstring/libmbfl/filters/mbfilter_qprint.c if (n < 10) {
n 124 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n += 48;
n 126 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n += 55;
n 128 ext/mbstring/libmbfl/filters/mbfilter_qprint.c CK((*filter->output_function)(n, filter->data));
n 158 ext/mbstring/libmbfl/filters/mbfilter_qprint.c int n, m;
n 199 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n = c;
n 201 ext/mbstring/libmbfl/filters/mbfilter_qprint.c n = hex2code_map[filter->cache] << 4 | m;
n 203 ext/mbstring/libmbfl/filters/mbfilter_qprint.c CK((*filter->output_function)(n, filter->data));
n 134 ext/mbstring/libmbfl/filters/mbfilter_sjis_mac.c int i, j, n;
n 208 ext/mbstring/libmbfl/filters/mbfilter_sjis_mac.c n = 4;
n 210 ext/mbstring/libmbfl/filters/mbfilter_sjis_mac.c n = 5;
n 212 ext/mbstring/libmbfl/filters/mbfilter_sjis_mac.c n = 6;
n 214 ext/mbstring/libmbfl/filters/mbfilter_sjis_mac.c for (j=1; j<n-1; j++) {
n 217 ext/mbstring/libmbfl/filters/mbfilter_sjis_mac.c w = code_tbl_m[i][n-1];
n 252 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.c for (i = 0; i < n; i++) {
n 267 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.c for (i = 0; i < n; i++) {
n 43 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c int s, n;
n 73 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c n = (filt->cache - 0xff60) & 0x3f;
n 74 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c if (c == 0xff9e && ((n >= 22 && n <= 36) || (n >= 42 && n <= 46))) {
n 76 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0x3001 + hankana2zenkana_table[n];
n 77 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c } else if (c == 0xff9e && n == 19) {
n 80 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c } else if (c == 0xff9f && (n >= 42 && n <= 46)) {
n 82 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0x3002 + hankana2zenkana_table[n];
n 86 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0x3000 + hankana2zenkana_table[n];
n 95 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c n = (filt->cache - 0xff60) & 0x3f;
n 97 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c (*filt->output_function)(0x3000 + hankana2zenkana_table[n], filt->data);
n 105 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c n = (filt->cache - 0xff60) & 0x3f;
n 106 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c if (c == 0xff9e && ((n >= 22 && n <= 36) || (n >= 42 && n <= 46))) {
n 108 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0x3001 + hankana2zenhira_table[n];
n 109 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c } else if (c == 0xff9f && (n >= 42 && n <= 46)) {
n 111 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0x3002 + hankana2zenhira_table[n];
n 115 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0x3000 + hankana2zenhira_table[n];
n 124 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c n = (filt->cache - 0xff60) & 0x3f;
n 126 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c (*filt->output_function)(0x3000 + hankana2zenhira_table[n], filt->data);
n 188 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c n = c - 0x30a1;
n 189 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c if (zenkana2hankana_table[n][1] != 0) {
n 190 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c (filt->output_function)(0xff00 + zenkana2hankana_table[n][0], filt->data);
n 191 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0xff00 + zenkana2hankana_table[n][1];
n 193 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0xff00 + zenkana2hankana_table[n][0];
n 198 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c n = c - 0x3041;
n 199 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c if (zenkana2hankana_table[n][1] != 0) {
n 200 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c (filt->output_function)(0xff00 + zenkana2hankana_table[n][0], filt->data);
n 201 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0xff00 + zenkana2hankana_table[n][1];
n 203 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c s = 0xff00 + zenkana2hankana_table[n][0];
n 273 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c int ret, n;
n 278 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c n = (filt->cache - 0xff60) & 0x3f;
n 280 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c ret = (*filt->output_function)(0x3000 + hankana2zenkana_table[n], filt->data);
n 282 ext/mbstring/libmbfl/filters/mbfilter_tl_jisx0201_jisx0208.c ret = (*filt->output_function)(0x3000 + hankana2zenhira_table[n], filt->data);
n 127 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c int n, endian;
n 133 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = c & 0xff;
n 135 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = (c & 0xff) << 8;
n 137 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c filter->cache = n;
n 142 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = (c & 0xff) << 8;
n 144 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = c & 0xff;
n 146 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n |= filter->cache;
n 147 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c if (n == 0xfffe) {
n 156 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c CK((*filter->output_function)(n, filter->data));
n 169 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c int n;
n 173 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = (c & 0xff) << 8;
n 174 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c filter->cache = n;
n 177 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = (c & 0xff) | filter->cache;
n 178 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c CK((*filter->output_function)(n, filter->data));
n 205 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c int n;
n 209 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = c & 0xff;
n 210 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c filter->cache = n;
n 213 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c n = ((c & 0xff) << 8) | filter->cache;
n 214 ext/mbstring/libmbfl/filters/mbfilter_ucs2.c CK((*filter->output_function)(n, filter->data));
n 128 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c int n, endian;
n 134 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = c & 0xff;
n 136 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 24;
n 138 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache = n;
n 143 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 8;
n 145 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 16;
n 147 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache |= n;
n 152 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 16;
n 154 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 8;
n 156 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache |= n;
n 161 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 24;
n 163 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = c & 0xff;
n 165 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n |= filter->cache;
n 166 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c if ((n & 0xffff) == 0 && ((n >> 16) & 0xffff) == 0xfffe) {
n 175 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c CK((*filter->output_function)(n, filter->data));
n 188 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c int n;
n 192 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 24;
n 193 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache = n;
n 196 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 16;
n 197 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache |= n;
n 200 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 8;
n 201 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache |= n;
n 204 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) | filter->cache;
n 205 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c CK((*filter->output_function)(n, filter->data));
n 234 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c int n;
n 238 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff);
n 239 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache = n;
n 242 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 8;
n 243 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache |= n;
n 246 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = (c & 0xff) << 16;
n 247 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c filter->cache |= n;
n 250 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c n = ((c & 0xff) << 24) | filter->cache;
n 251 ext/mbstring/libmbfl/filters/mbfilter_ucs4.c CK((*filter->output_function)(n, filter->data));
n 127 ext/mbstring/libmbfl/filters/mbfilter_utf16.c int n, endian;
n 133 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = c & 0xff;
n 135 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = (c & 0xff) << 8;
n 137 ext/mbstring/libmbfl/filters/mbfilter_utf16.c filter->cache |= n;
n 142 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = (c & 0xff) << 8;
n 144 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = c & 0xff;
n 146 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n |= filter->cache & 0xffff;
n 148 ext/mbstring/libmbfl/filters/mbfilter_utf16.c if (n >= 0xd800 && n < 0xdc00) {
n 149 ext/mbstring/libmbfl/filters/mbfilter_utf16.c filter->cache = ((n & 0x3ff) << 16) + 0x400000;
n 150 ext/mbstring/libmbfl/filters/mbfilter_utf16.c } else if (n >= 0xdc00 && n < 0xe000) {
n 151 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n &= 0x3ff;
n 152 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n |= (filter->cache & 0xfff0000) >> 6;
n 154 ext/mbstring/libmbfl/filters/mbfilter_utf16.c if (n >= MBFL_WCSPLANE_SUPMIN && n < MBFL_WCSPLANE_SUPMAX) {
n 155 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 157 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n &= MBFL_WCSGROUP_MASK;
n 158 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n |= MBFL_WCSGROUP_THROUGH;
n 159 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 166 ext/mbstring/libmbfl/filters/mbfilter_utf16.c if (n == 0xfffe) {
n 173 ext/mbstring/libmbfl/filters/mbfilter_utf16.c } else if (n == 0xfeff) {
n 177 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 190 ext/mbstring/libmbfl/filters/mbfilter_utf16.c int n;
n 195 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = (c & 0xff) << 8;
n 196 ext/mbstring/libmbfl/filters/mbfilter_utf16.c filter->cache |= n;
n 200 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = (filter->cache & 0xff00) | (c & 0xff);
n 201 ext/mbstring/libmbfl/filters/mbfilter_utf16.c if (n >= 0xd800 && n < 0xdc00) {
n 202 ext/mbstring/libmbfl/filters/mbfilter_utf16.c filter->cache = ((n & 0x3ff) << 16) + 0x400000;
n 203 ext/mbstring/libmbfl/filters/mbfilter_utf16.c } else if (n >= 0xdc00 && n < 0xe000) {
n 204 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n &= 0x3ff;
n 205 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n |= (filter->cache & 0xfff0000) >> 6;
n 207 ext/mbstring/libmbfl/filters/mbfilter_utf16.c if (n >= MBFL_WCSPLANE_SUPMIN && n < MBFL_WCSPLANE_SUPMAX) {
n 208 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 210 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n &= MBFL_WCSGROUP_MASK;
n 211 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n |= MBFL_WCSGROUP_THROUGH;
n 212 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 216 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 229 ext/mbstring/libmbfl/filters/mbfilter_utf16.c int n;
n 235 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = ((c >> 10) - 0x40) | 0xd800;
n 236 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)((n >> 8) & 0xff, filter->data));
n 237 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n & 0xff, filter->data));
n 238 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = (c & 0x3ff) | 0xdc00;
n 239 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)((n >> 8) & 0xff, filter->data));
n 240 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n & 0xff, filter->data));
n 255 ext/mbstring/libmbfl/filters/mbfilter_utf16.c int n;
n 260 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = c & 0xff;
n 261 ext/mbstring/libmbfl/filters/mbfilter_utf16.c filter->cache |= n;
n 265 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = (filter->cache & 0xff) | ((c & 0xff) << 8);
n 266 ext/mbstring/libmbfl/filters/mbfilter_utf16.c if (n >= 0xd800 && n < 0xdc00) {
n 267 ext/mbstring/libmbfl/filters/mbfilter_utf16.c filter->cache = ((n & 0x3ff) << 16) + 0x400000;
n 268 ext/mbstring/libmbfl/filters/mbfilter_utf16.c } else if (n >= 0xdc00 && n < 0xe000) {
n 269 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n &= 0x3ff;
n 270 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n |= (filter->cache & 0xfff0000) >> 6;
n 272 ext/mbstring/libmbfl/filters/mbfilter_utf16.c if (n >= MBFL_WCSPLANE_SUPMIN && n < MBFL_WCSPLANE_SUPMAX) {
n 273 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 275 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n &= MBFL_WCSGROUP_MASK;
n 276 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n |= MBFL_WCSGROUP_THROUGH;
n 277 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 281 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n, filter->data));
n 294 ext/mbstring/libmbfl/filters/mbfilter_utf16.c int n;
n 300 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = ((c >> 10) - 0x40) | 0xd800;
n 301 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n & 0xff, filter->data));
n 302 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)((n >> 8) & 0xff, filter->data));
n 303 ext/mbstring/libmbfl/filters/mbfilter_utf16.c n = (c & 0x3ff) | 0xdc00;
n 304 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)(n & 0xff, filter->data));
n 305 ext/mbstring/libmbfl/filters/mbfilter_utf16.c CK((*filter->output_function)((n >> 8) & 0xff, filter->data));
n 127 ext/mbstring/libmbfl/filters/mbfilter_utf32.c int n, endian;
n 133 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = c & 0xff;
n 135 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 24;
n 137 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache = n;
n 142 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 8;
n 144 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 16;
n 146 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache |= n;
n 151 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 16;
n 153 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 8;
n 155 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache |= n;
n 160 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 24;
n 162 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = c & 0xff;
n 164 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n |= filter->cache;
n 165 ext/mbstring/libmbfl/filters/mbfilter_utf32.c if ((n & 0xffff) == 0 && ((n >> 16) & 0xffff) == 0xfffe) {
n 174 ext/mbstring/libmbfl/filters/mbfilter_utf32.c if (n < MBFL_WCSPLANE_UTF32MAX && (n < 0xd800 || n > 0xdfff)) {
n 175 ext/mbstring/libmbfl/filters/mbfilter_utf32.c CK((*filter->output_function)(n, filter->data));
n 177 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (n & MBFL_WCSGROUP_MASK) | MBFL_WCSGROUP_THROUGH;
n 178 ext/mbstring/libmbfl/filters/mbfilter_utf32.c CK((*filter->output_function)(n, filter->data));
n 192 ext/mbstring/libmbfl/filters/mbfilter_utf32.c int n;
n 196 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 24;
n 197 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache = n;
n 200 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 16;
n 201 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache |= n;
n 204 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 8;
n 205 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache |= n;
n 208 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) | filter->cache;
n 209 ext/mbstring/libmbfl/filters/mbfilter_utf32.c if (n < MBFL_WCSPLANE_UTF32MAX && (n < 0xd800 || n > 0xdfff)) {
n 210 ext/mbstring/libmbfl/filters/mbfilter_utf32.c CK((*filter->output_function)(n, filter->data));
n 212 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (n & MBFL_WCSGROUP_MASK) | MBFL_WCSGROUP_THROUGH;
n 213 ext/mbstring/libmbfl/filters/mbfilter_utf32.c CK((*filter->output_function)(n, filter->data));
n 243 ext/mbstring/libmbfl/filters/mbfilter_utf32.c int n;
n 247 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff);
n 248 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache = n;
n 251 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 8;
n 252 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache |= n;
n 255 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (c & 0xff) << 16;
n 256 ext/mbstring/libmbfl/filters/mbfilter_utf32.c filter->cache |= n;
n 259 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = ((c & 0xff) << 24) | filter->cache;
n 260 ext/mbstring/libmbfl/filters/mbfilter_utf32.c if (n < MBFL_WCSPLANE_UTF32MAX && (n < 0xd800 || n > 0xdfff)) {
n 261 ext/mbstring/libmbfl/filters/mbfilter_utf32.c CK((*filter->output_function)(n, filter->data));
n 263 ext/mbstring/libmbfl/filters/mbfilter_utf32.c n = (n & MBFL_WCSGROUP_MASK) | MBFL_WCSGROUP_THROUGH;
n 264 ext/mbstring/libmbfl/filters/mbfilter_utf32.c CK((*filter->output_function)(n, filter->data));
n 96 ext/mbstring/libmbfl/filters/mbfilter_utf7.c int s, n;
n 98 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = -1;
n 101 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = c - 65;
n 103 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = c - 71;
n 105 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = c + 4;
n 107 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 62;
n 109 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 63;
n 111 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n < 0 || n > 63) {
n 146 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache |= n << 10;
n 150 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache |= n << 4;
n 154 ext/mbstring/libmbfl/filters/mbfilter_utf7.c s = ((n >> 2) & 0xf) | (filter->cache & 0xffff);
n 155 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = (n & 0x3) << 14;
n 158 ext/mbstring/libmbfl/filters/mbfilter_utf7.c s = (((s & 0x3ff) << 16) + 0x400000) | n;
n 163 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache = n;
n 172 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache = n;
n 178 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache |= n << 8;
n 182 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache |= n << 2;
n 186 ext/mbstring/libmbfl/filters/mbfilter_utf7.c s = ((n >> 4) & 0x3) | (filter->cache & 0xffff);
n 187 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = (n & 0xf) << 12;
n 190 ext/mbstring/libmbfl/filters/mbfilter_utf7.c s = (((s & 0x3ff) << 16) + 0x400000) | n;
n 195 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache = n;
n 204 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache = n;
n 210 ext/mbstring/libmbfl/filters/mbfilter_utf7.c filter->cache |= n << 6;
n 214 ext/mbstring/libmbfl/filters/mbfilter_utf7.c s = n | (filter->cache & 0xffff);
n 249 ext/mbstring/libmbfl/filters/mbfilter_utf7.c int s, n;
n 251 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 0;
n 254 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 256 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 258 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 260 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 262 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 264 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 266 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 268 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 270 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 272 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 274 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 276 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 278 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 280 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 282 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 284 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 286 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 2;
n 305 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n != 0) { /* directly encode characters */
n 319 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n != 0) {
n 321 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n == 1) {
n 337 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n != 0) {
n 339 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n == 1) {
n 355 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n != 0) {
n 356 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n == 1) {
n 418 ext/mbstring/libmbfl/filters/mbfilter_utf7.c int n;
n 433 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 0;
n 435 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 437 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 439 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 441 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 443 ext/mbstring/libmbfl/filters/mbfilter_utf7.c n = 1;
n 445 ext/mbstring/libmbfl/filters/mbfilter_utf7.c if (n <= 0) {
n 69 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c int s, n;
n 71 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = -1;
n 74 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = c - 65;
n 76 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = c - 71;
n 78 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = c + 4;
n 80 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = 62;
n 82 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = 63;
n 84 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n < 0 || n > 63) {
n 119 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache |= n << 10;
n 123 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache |= n << 4;
n 127 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c s = ((n >> 2) & 0xf) | (filter->cache & 0xffff);
n 128 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = (n & 0x3) << 14;
n 131 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c s = (((s & 0x3ff) << 16) + 0x400000) | n;
n 136 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache = n;
n 145 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache = n;
n 151 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache |= n << 8;
n 155 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache |= n << 2;
n 159 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c s = ((n >> 4) & 0x3) | (filter->cache & 0xffff);
n 160 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = (n & 0xf) << 12;
n 163 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c s = (((s & 0x3ff) << 16) + 0x400000) | n;
n 168 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache = n;
n 177 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache = n;
n 183 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c filter->cache |= n << 6;
n 187 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c s = n | (filter->cache & 0xffff);
n 236 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c int n, s;
n 238 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = 0;
n 240 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = 1;
n 242 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c n = 2;
n 260 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n != 0) { /* directly encode characters */
n 262 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n == 1) {
n 277 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n != 0) {
n 281 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n == 1) {
n 296 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n != 0) {
n 300 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n == 1) {
n 315 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n != 0) {
n 318 ext/mbstring/libmbfl/filters/mbfilter_utf7imap.c if (n == 1) {
n 67 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c int n;
n 101 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c n = UUDEC(c);
n 102 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c filter->cache = n << 24;
n 107 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c n = UUDEC(c);
n 108 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c filter->cache |= (n << 16);
n 113 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c n = UUDEC(c);
n 114 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c filter->cache |= (n << 8);
n 119 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c n = UUDEC(c);
n 120 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c filter->cache |= n;
n 130 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c n = (filter->cache >> 24) & 0xff;
n 131 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c if (n-- > 0)
n 133 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c if (n-- > 0)
n 135 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c if (n-- > 0)
n 137 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c filter->cache = n << 24;
n 139 ext/mbstring/libmbfl/filters/mbfilter_uuencode.c if (n == 0)
n 246 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 250 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 255 ext/mbstring/libmbfl/mbfl/mbfilter.c return n;
n 267 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 277 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 283 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 290 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 487 ext/mbstring/libmbfl/mbfl/mbfilter.c int i, n, num, bad, res;
n 495 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 498 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 513 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 524 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 528 ext/mbstring/libmbfl/mbfl/mbfilter.c n = identd->filter_list_size - 1;
n 529 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n >= 0) {
n 530 ext/mbstring/libmbfl/mbfl/mbfilter.c filter = identd->filter_list[n];
n 536 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 541 ext/mbstring/libmbfl/mbfl/mbfilter.c n = identd->filter_list_size - 1;
n 542 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n >= 0) {
n 543 ext/mbstring/libmbfl/mbfl/mbfilter.c filter = identd->filter_list[n];
n 547 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 571 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 609 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 612 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 616 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 637 ext/mbstring/libmbfl/mbfl/mbfilter.c int i, n, num, bad;
n 658 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 663 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 677 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 720 ext/mbstring/libmbfl/mbfl/mbfilter.c int i, n, num, bad;
n 741 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 746 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 760 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 813 ext/mbstring/libmbfl/mbfl/mbfilter.c int len, n, m, k;
n 832 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 837 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n < k) {
n 839 ext/mbstring/libmbfl/mbfl/mbfilter.c n += m;
n 854 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 857 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 859 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 886 ext/mbstring/libmbfl/mbfl/mbfilter.c int *p, *h, *m, n;
n 908 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pc->needle_pos - 1;
n 909 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0 && *p == *m) {
n 910 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 914 ext/mbstring/libmbfl/mbfl/mbfilter.c if (n <= 0) {
n 937 ext/mbstring/libmbfl/mbfl/mbfilter.c int len, n, m, k;
n 960 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 965 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n < k) {
n 967 ext/mbstring/libmbfl/mbfl/mbfilter.c n += m;
n 971 ext/mbstring/libmbfl/mbfl/mbfilter.c return n-k;
n 1196 ext/mbstring/libmbfl/mbfl/mbfilter.c int n, result = 0;
n 1214 ext/mbstring/libmbfl/mbfl/mbfilter.c n = needle->len;
n 1216 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1220 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1250 ext/mbstring/libmbfl/mbfl/mbfilter.c n = haystack->len;
n 1252 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1262 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1308 ext/mbstring/libmbfl/mbfl/mbfilter.c int n, m, k, len, start, end;
n 1335 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 1341 ext/mbstring/libmbfl/mbfl/mbfilter.c start = n;
n 1342 ext/mbstring/libmbfl/mbfl/mbfilter.c if (n >= len) {
n 1346 ext/mbstring/libmbfl/mbfl/mbfilter.c n += m;
n 1354 ext/mbstring/libmbfl/mbfl/mbfilter.c end = n;
n 1355 ext/mbstring/libmbfl/mbfl/mbfilter.c if (n >= len) {
n 1359 ext/mbstring/libmbfl/mbfl/mbfilter.c n += m;
n 1383 ext/mbstring/libmbfl/mbfl/mbfilter.c n = end - start;
n 1385 ext/mbstring/libmbfl/mbfl/mbfilter.c result->val = w = (unsigned char*)mbfl_malloc((n + 8)*sizeof(unsigned char));
n 1390 ext/mbstring/libmbfl/mbfl/mbfilter.c result->len = n;
n 1391 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1393 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1435 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 1437 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1441 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1780 ext/mbstring/libmbfl/mbfl/mbfilter.c int len, n;
n 1798 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 1799 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1801 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1869 ext/mbstring/libmbfl/mbfl/mbfilter.c int n, mkwidth;
n 1913 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 1915 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1916 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1924 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1928 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1937 ext/mbstring/libmbfl/mbfl/mbfilter.c n = marker->len;
n 1938 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 1942 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 1966 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 2034 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 2036 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 2040 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 2092 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 2103 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pe->outdev.pos - pe->linehead + pe->firstindent;
n 2107 ext/mbstring/libmbfl/mbfl/mbfilter.c if (n >= 74) {
n 2153 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 2169 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pe->outdev.pos - pe->linehead + pe->tmpdev.pos + pe->firstindent;
n 2170 ext/mbstring/libmbfl/mbfl/mbfilter.c if (n > 74) {
n 2181 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pe->outdev.pos - pe->linehead + pe->encnamelen + pe->firstindent;
n 2182 ext/mbstring/libmbfl/mbfl/mbfilter.c if (n > 60) {
n 2233 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 2258 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 2259 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n++] = 0x3d;
n 2260 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n++] = 0x3f;
n 2263 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n++] = *s++;
n 2265 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n++] = 0x3f;
n 2267 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n++] = 0x51;
n 2269 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n++] = 0x42;
n 2272 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n++] = 0x3f;
n 2273 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encname[n] = '\0';
n 2274 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->encnamelen = n;
n 2276 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 2277 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsp[n++] = 0x0d;
n 2278 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsp[n++] = 0x0a;
n 2279 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsp[n++] = 0x20;
n 2280 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsp[n] = '\0';
n 2281 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsplen = n;
n 2348 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 2362 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 2363 ext/mbstring/libmbfl/mbfl/mbfilter.c while (*linefeed && n < 8) {
n 2364 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsp[n++] = *linefeed++;
n 2366 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsp[n++] = 0x20;
n 2367 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsp[n] = '\0';
n 2368 ext/mbstring/libmbfl/mbfl/mbfilter.c pe->lwsplen = n;
n 2374 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 2376 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 2378 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 2645 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 2659 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 2661 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 2663 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 2690 ext/mbstring/libmbfl/mbfl/mbfilter.c int f, n, s, r, d, size, *mapelm;
n 2694 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 2695 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n < size) {
n 2696 ext/mbstring/libmbfl/mbfl/mbfilter.c mapelm = &(pc->convmap[n*4]);
n 2723 ext/mbstring/libmbfl/mbfl/mbfilter.c n++;
n 2736 ext/mbstring/libmbfl/mbfl/mbfilter.c int f, n, s, r, d, size, *mapelm;
n 2779 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 2781 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n < size) {
n 2782 ext/mbstring/libmbfl/mbfl/mbfilter.c mapelm = &(pc->convmap[n*4]);
n 2792 ext/mbstring/libmbfl/mbfl/mbfilter.c n++;
n 2799 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pc->digit;
n 2800 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 2802 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 2861 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 2863 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n < size) {
n 2864 ext/mbstring/libmbfl/mbfl/mbfilter.c mapelm = &(pc->convmap[n*4]);
n 2874 ext/mbstring/libmbfl/mbfl/mbfilter.c n++;
n 2882 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pc->digit;
n 2883 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 2885 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 2914 ext/mbstring/libmbfl/mbfl/mbfilter.c int f, n, s, r, d, size, *mapelm;
n 2918 ext/mbstring/libmbfl/mbfl/mbfilter.c n = 0;
n 2919 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n < size) {
n 2920 ext/mbstring/libmbfl/mbfl/mbfilter.c mapelm = &(pc->convmap[n*4]);
n 2948 ext/mbstring/libmbfl/mbfl/mbfilter.c n++;
n 2960 ext/mbstring/libmbfl/mbfl/mbfilter.c int n, s, r, d;
n 2977 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pc->digit;
n 2978 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 2980 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 3004 ext/mbstring/libmbfl/mbfl/mbfilter.c n = pc->digit;
n 3005 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 3007 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 3042 ext/mbstring/libmbfl/mbfl/mbfilter.c int n;
n 3089 ext/mbstring/libmbfl/mbfl/mbfilter.c n = string->len;
n 3091 ext/mbstring/libmbfl/mbfl/mbfilter.c while (n > 0) {
n 3095 ext/mbstring/libmbfl/mbfl/mbfilter.c n--;
n 438 ext/mbstring/libmbfl/mbfl/mbfl_convert.c int n;
n 442 ext/mbstring/libmbfl/mbfl/mbfl_convert.c n = src->pos;
n 443 ext/mbstring/libmbfl/mbfl/mbfl_convert.c while (n > 0) {
n 447 ext/mbstring/libmbfl/mbfl/mbfl_convert.c n--;
n 450 ext/mbstring/libmbfl/mbfl/mbfl_convert.c return n;
n 470 ext/mbstring/libmbfl/mbfl/mbfl_convert.c int mode_backup, ret, n, m, r;
n 519 ext/mbstring/libmbfl/mbfl/mbfl_convert.c n = (c >> r) & 0xf;
n 520 ext/mbstring/libmbfl/mbfl/mbfl_convert.c if (n || m) {
n 522 ext/mbstring/libmbfl/mbfl/mbfl_convert.c ret = (*filter->filter_function)(mbfl_hexchar_table[n], filter);
n 545 ext/mbstring/libmbfl/mbfl/mbfl_convert.c n = (c >> r) & 0xf;
n 546 ext/mbstring/libmbfl/mbfl/mbfl_convert.c if (n || m) {
n 548 ext/mbstring/libmbfl/mbfl/mbfl_convert.c ret = (*filter->filter_function)(mbfl_hexchar_table[n], filter);
n 278 ext/mbstring/libmbfl/mbfl/mbfl_memory_device.c int n;
n 294 ext/mbstring/libmbfl/mbfl/mbfl_memory_device.c n = src->pos;
n 295 ext/mbstring/libmbfl/mbfl/mbfl_memory_device.c dest->pos += n;
n 296 ext/mbstring/libmbfl/mbfl/mbfl_memory_device.c while (n > 0) {
n 298 ext/mbstring/libmbfl/mbfl/mbfl_memory_device.c n--;
n 301 ext/mbstring/libmbfl/mbfl/mbfl_memory_device.c return n;
n 9 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c int n;
n 14 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c size_t n;
n 21 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c map->n = 0;
n 34 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (map->n >= map->nalloc) {
n 36 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c size_t n = map->nalloc << 1, a;
n 37 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (n == 0)
n 38 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c n = 1;
n 39 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c else if (n <= map->n)
n 41 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c a = sizeof(*map->entries) * n;
n 42 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (a / n != sizeof(*map->entries))
n 48 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c map->nalloc = n;
n 56 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c size_t s = 0, e = map->n;
n 67 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (map->n > i) {
n 68 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c size_t n = map->n - i, a = sizeof(*map->entries) * n;
n 69 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (a / n != sizeof(*map->entries))
n 73 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c ++map->n;
n 76 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c entry->n = 0;
n 85 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (map->n > i + 1) {
n 86 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c size_t n = (map->n - i - 1), a = sizeof(*map->entries) * n;
n 87 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (a / n != sizeof(*map->entries))
n 91 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c ++map->n;
n 94 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c entry->n = 0;
n 102 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c if (entry->n >= sizeof(entry->cp_932) / sizeof(*entry->cp_932))
n 104 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c entry->cp_932[entry->n++] = cp_932;
n 220 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c for (i = 0; i < entry->n; ++i) {
n 254 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c for (i = 0; i < entry->n; ++i) {
n 293 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c for (i = 0; i < entry->n; ++i) {
n 347 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c for (i = 0; i < entry->n; ++i) {
n 485 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c for (i = 0; i < map.n; ++i)
n 201 ext/mbstring/mb_gpc.c int n, num, *len_list = NULL;
n 233 ext/mbstring/mb_gpc.c n = 0;
n 239 ext/mbstring/mb_gpc.c len_list[n] = php_url_decode(var, val-var);
n 240 ext/mbstring/mb_gpc.c val_list[n] = var;
n 241 ext/mbstring/mb_gpc.c n++;
n 244 ext/mbstring/mb_gpc.c val_list[n] = val;
n 245 ext/mbstring/mb_gpc.c len_list[n] = php_url_decode(val, strlen(val));
n 247 ext/mbstring/mb_gpc.c len_list[n] = php_url_decode(var, strlen(var));
n 248 ext/mbstring/mb_gpc.c val_list[n] = var;
n 249 ext/mbstring/mb_gpc.c n++;
n 251 ext/mbstring/mb_gpc.c val_list[n] = "";
n 252 ext/mbstring/mb_gpc.c len_list[n] = 0;
n 254 ext/mbstring/mb_gpc.c n++;
n 258 ext/mbstring/mb_gpc.c if (n > (PG(max_input_vars) * 2)) {
n 263 ext/mbstring/mb_gpc.c num = n; /* make sure to process initilized vars only */
n 275 ext/mbstring/mb_gpc.c n = 0;
n 276 ext/mbstring/mb_gpc.c while (n < num) {
n 277 ext/mbstring/mb_gpc.c string.val = (unsigned char *)val_list[n];
n 278 ext/mbstring/mb_gpc.c string.len = len_list[n];
n 282 ext/mbstring/mb_gpc.c n++;
n 312 ext/mbstring/mb_gpc.c n = 0;
n 313 ext/mbstring/mb_gpc.c while (n < num) {
n 314 ext/mbstring/mb_gpc.c string.val = (unsigned char *)val_list[n];
n 315 ext/mbstring/mb_gpc.c string.len = len_list[n];
n 319 ext/mbstring/mb_gpc.c var = val_list[n];
n 321 ext/mbstring/mb_gpc.c n++;
n 322 ext/mbstring/mb_gpc.c string.val = (unsigned char *)val_list[n];
n 323 ext/mbstring/mb_gpc.c string.len = len_list[n];
n 328 ext/mbstring/mb_gpc.c val = val_list[n];
n 329 ext/mbstring/mb_gpc.c val_len = len_list[n];
n 331 ext/mbstring/mb_gpc.c n++;
n 668 ext/mbstring/mbstring.c size_t n;
n 694 ext/mbstring/mbstring.c n = 1;
n 698 ext/mbstring/mbstring.c n++;
n 700 ext/mbstring/mbstring.c size = n + MBSTRG(default_detect_order_list_size);
n 705 ext/mbstring/mbstring.c n = 0;
n 732 ext/mbstring/mbstring.c n++;
n 739 ext/mbstring/mbstring.c n++;
n 745 ext/mbstring/mbstring.c } while (n < size && p2 != NULL);
n 746 ext/mbstring/mbstring.c if (n > 0) {
n 760 ext/mbstring/mbstring.c *return_size = n;
n 788 ext/mbstring/mbstring.c int i, n, size, bauto, ret = SUCCESS;
n 801 ext/mbstring/mbstring.c n = 0;
n 816 ext/mbstring/mbstring.c n++;
n 823 ext/mbstring/mbstring.c n++;
n 831 ext/mbstring/mbstring.c if (n > 0) {
n 845 ext/mbstring/mbstring.c *return_size = n;
n 1805 ext/mbstring/mbstring.c const size_t n = MBSTRG(http_input_list_size);
n 1808 ext/mbstring/mbstring.c for (i = 0; i < n; i++) {
n 1819 ext/mbstring/mbstring.c const size_t n = MBSTRG(http_input_list_size);
n 1822 ext/mbstring/mbstring.c for (i = 0; i < n; i++) {
n 1902 ext/mbstring/mbstring.c size_t n = MBSTRG(current_detect_order_list_size);
n 1905 ext/mbstring/mbstring.c for (i = 0; i < n; i++) {
n 2190 ext/mbstring/mbstring.c int n;
n 2212 ext/mbstring/mbstring.c n = mbfl_strlen(&string);
n 2213 ext/mbstring/mbstring.c if (n >= 0) {
n 2214 ext/mbstring/mbstring.c RETVAL_LONG(n);
n 2225 ext/mbstring/mbstring.c int n, reverse = 0;
n 2260 ext/mbstring/mbstring.c n = mbfl_strpos(&haystack, &needle, offset, reverse);
n 2261 ext/mbstring/mbstring.c if (n >= 0) {
n 2262 ext/mbstring/mbstring.c RETVAL_LONG(n);
n 2264 ext/mbstring/mbstring.c switch (-n) {
n 2289 ext/mbstring/mbstring.c int n;
n 2374 ext/mbstring/mbstring.c n = mbfl_strpos(&haystack, &needle, offset, 1);
n 2375 ext/mbstring/mbstring.c if (n >= 0) {
n 2376 ext/mbstring/mbstring.c RETVAL_LONG(n);
n 2387 ext/mbstring/mbstring.c int n;
n 2392 ext/mbstring/mbstring.c n = -1;
n 2402 ext/mbstring/mbstring.c n = php_mb_stripos(0, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, offset, from_encoding TSRMLS_CC);
n 2404 ext/mbstring/mbstring.c if (n >= 0) {
n 2405 ext/mbstring/mbstring.c RETVAL_LONG(n);
n 2416 ext/mbstring/mbstring.c int n;
n 2421 ext/mbstring/mbstring.c n = -1;
n 2428 ext/mbstring/mbstring.c n = php_mb_stripos(1, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, offset, from_encoding TSRMLS_CC);
n 2430 ext/mbstring/mbstring.c if (n >= 0) {
n 2431 ext/mbstring/mbstring.c RETVAL_LONG(n);
n 2442 ext/mbstring/mbstring.c int n, len, mblen;
n 2471 ext/mbstring/mbstring.c n = mbfl_strpos(&haystack, &needle, 0, 0);
n 2472 ext/mbstring/mbstring.c if (n >= 0) {
n 2475 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, 0, n);
n 2482 ext/mbstring/mbstring.c len = (mblen - n);
n 2483 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, n, len);
n 2500 ext/mbstring/mbstring.c int n, len, mblen;
n 2531 ext/mbstring/mbstring.c n = mbfl_strpos(&haystack, &needle, 0, 1);
n 2532 ext/mbstring/mbstring.c if (n >= 0) {
n 2535 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, 0, n);
n 2542 ext/mbstring/mbstring.c len = (mblen - n);
n 2543 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, n, len);
n 2562 ext/mbstring/mbstring.c int n;
n 2588 ext/mbstring/mbstring.c n = php_mb_stripos(0, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, 0, from_encoding TSRMLS_CC);
n 2590 ext/mbstring/mbstring.c if (n <0) {
n 2597 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, 0, n);
n 2604 ext/mbstring/mbstring.c len = (mblen - n);
n 2605 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, n, len);
n 2620 ext/mbstring/mbstring.c int n, from_encoding_len, len, mblen;
n 2641 ext/mbstring/mbstring.c n = php_mb_stripos(1, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, 0, from_encoding TSRMLS_CC);
n 2643 ext/mbstring/mbstring.c if (n <0) {
n 2650 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, 0, n);
n 2657 ext/mbstring/mbstring.c len = (mblen - n);
n 2658 ext/mbstring/mbstring.c ret = mbfl_substr(&haystack, &result, n, len);
n 2672 ext/mbstring/mbstring.c int n;
n 2701 ext/mbstring/mbstring.c n = mbfl_substr_count(&haystack, &needle);
n 2702 ext/mbstring/mbstring.c if (n >= 0) {
n 2703 ext/mbstring/mbstring.c RETVAL_LONG(n);
n 2858 ext/mbstring/mbstring.c int n;
n 2880 ext/mbstring/mbstring.c n = mbfl_strwidth(&string);
n 2881 ext/mbstring/mbstring.c if (n >= 0) {
n 2882 ext/mbstring/mbstring.c RETVAL_LONG(n);
n 3042 ext/mbstring/mbstring.c size_t size, l, n;
n 3069 ext/mbstring/mbstring.c n = strlen(Z_STRVAL_PP(hash_entry));
n 3070 ext/mbstring/mbstring.c _from_encodings = erealloc(_from_encodings, l+n+2);
n 3405 ext/mbstring/mbstring.c int n = optstr_len;
n 3408 ext/mbstring/mbstring.c while (i < n) {
n 3498 ext/mbstring/mbstring.c int n, to_enc_len, argc, stack_level, stack_max;
n 3547 ext/mbstring/mbstring.c n = 0;
n 3548 ext/mbstring/mbstring.c while (n < argc || stack_level > 0) {
n 3550 ext/mbstring/mbstring.c var = args[n++];
n 3628 ext/mbstring/mbstring.c n = 0;
n 3629 ext/mbstring/mbstring.c while (n < argc || stack_level > 0) {
n 3631 ext/mbstring/mbstring.c var = args[n++];
n 4020 ext/mbstring/mbstring.c int n;
n 4236 ext/mbstring/mbstring.c n = headers_len;
n 4237 ext/mbstring/mbstring.c mbfl_memory_device_strncat(&device, p, n);
n 4238 ext/mbstring/mbstring.c if (n > 0 && p[n - 1] != '\n') {
n 4316 ext/mbstring/mbstring.c size_t n;
n 4376 ext/mbstring/mbstring.c n = MBSTRG(current_detect_order_list_size);
n 4378 ext/mbstring/mbstring.c if (n > 0) {
n 4382 ext/mbstring/mbstring.c for (i = 0; i < n; i++) {
n 4458 ext/mbstring/mbstring.c n = MBSTRG(current_detect_order_list_size);
n 4460 ext/mbstring/mbstring.c if (n > 0) {
n 4463 ext/mbstring/mbstring.c for (i = 0; i < n; i++) {
n 4659 ext/mbstring/mbstring.c int n;
n 4661 ext/mbstring/mbstring.c n = -1;
n 4717 ext/mbstring/mbstring.c n = mbfl_strpos(&haystack, &needle, offset, mode);
n 4728 ext/mbstring/mbstring.c return n;
n 63 ext/mbstring/oniguruma/enc/euc_jp.c OnigCodePoint n;
n 66 ext/mbstring/oniguruma/enc/euc_jp.c n = (OnigCodePoint )*p++;
n 67 ext/mbstring/oniguruma/enc/euc_jp.c if (len == 1) return n;
n 72 ext/mbstring/oniguruma/enc/euc_jp.c n <<= 8; n += c;
n 74 ext/mbstring/oniguruma/enc/euc_jp.c return n;
n 99 ext/mbstring/oniguruma/enc/sjis.c OnigCodePoint n;
n 103 ext/mbstring/oniguruma/enc/sjis.c n = c;
n 104 ext/mbstring/oniguruma/enc/sjis.c if (len == 1) return n;
n 109 ext/mbstring/oniguruma/enc/sjis.c n <<= 8; n += c;
n 111 ext/mbstring/oniguruma/enc/sjis.c return n;
n 8528 ext/mbstring/oniguruma/enc/unicode.c int n;
n 8543 ext/mbstring/oniguruma/enc/unicode.c int n;
n 10988 ext/mbstring/oniguruma/enc/unicode.c if (to->n == 1) {
n 10998 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < to->n; i++) {
n 11026 ext/mbstring/oniguruma/enc/unicode.c for (j = 0; j < p11->to.n; j++) {
n 11067 ext/mbstring/oniguruma/enc/unicode.c for (j = 0; j < p11->to.n; j++) {
n 11094 ext/mbstring/oniguruma/enc/unicode.c for (j = 0; j < CaseUnfold_12[i].to.n; j++) {
n 11099 ext/mbstring/oniguruma/enc/unicode.c for (k = 0; k < CaseUnfold_12[i].to.n; k++) {
n 11115 ext/mbstring/oniguruma/enc/unicode.c for (j = 0; j < CaseUnfold_12_Locale[i].to.n; j++) {
n 11120 ext/mbstring/oniguruma/enc/unicode.c for (k = 0; k < CaseUnfold_12_Locale[i].to.n; k++) {
n 11136 ext/mbstring/oniguruma/enc/unicode.c for (j = 0; j < CaseUnfold_13[i].to.n; j++) {
n 11141 ext/mbstring/oniguruma/enc/unicode.c for (k = 0; k < CaseUnfold_13[i].to.n; k++) {
n 11160 ext/mbstring/oniguruma/enc/unicode.c int n, i, j, k, len;
n 11167 ext/mbstring/oniguruma/enc/unicode.c n = 0;
n 11202 ext/mbstring/oniguruma/enc/unicode.c if (to->n == 1) {
n 11208 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11212 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < to->n; i++) {
n 11214 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11215 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 1;
n 11216 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = to->code[i];
n 11217 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11226 ext/mbstring/oniguruma/enc/unicode.c for (fn = 0; fn < to->n; fn++) {
n 11230 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < z3->n; i++) {
n 11233 ext/mbstring/oniguruma/enc/unicode.c ncs[fn] = z3->n + 1;
n 11242 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11243 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 2;
n 11244 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = cs[0][i];
n 11245 ext/mbstring/oniguruma/enc/unicode.c items[n].code[1] = cs[1][j];
n 11246 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11252 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < z2->n; i++) {
n 11255 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11256 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 1;
n 11257 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = z2->code[i];
n 11258 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11266 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11267 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 3;
n 11268 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = cs[0][i];
n 11269 ext/mbstring/oniguruma/enc/unicode.c items[n].code[1] = cs[1][j];
n 11270 ext/mbstring/oniguruma/enc/unicode.c items[n].code[2] = cs[2][k];
n 11271 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11278 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < z2->n; i++) {
n 11281 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11282 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 1;
n 11283 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = z2->code[i];
n 11284 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11295 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < to->n; i++) {
n 11296 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11297 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 1;
n 11298 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = to->code[i];
n 11299 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11313 ext/mbstring/oniguruma/enc/unicode.c && to->n == 1) {
n 11322 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < z2->n; i++) {
n 11323 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11324 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 1;
n 11325 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = z2->code[i];
n 11326 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11334 ext/mbstring/oniguruma/enc/unicode.c && to->n == 1) {
n 11344 ext/mbstring/oniguruma/enc/unicode.c for (i = 0; i < z2->n; i++) {
n 11345 ext/mbstring/oniguruma/enc/unicode.c items[n].byte_len = len;
n 11346 ext/mbstring/oniguruma/enc/unicode.c items[n].code_len = 1;
n 11347 ext/mbstring/oniguruma/enc/unicode.c items[n].code[0] = z2->code[i];
n 11348 ext/mbstring/oniguruma/enc/unicode.c n++;
n 11355 ext/mbstring/oniguruma/enc/unicode.c return n;
n 97 ext/mbstring/oniguruma/enc/utf8.c OnigCodePoint n;
n 103 ext/mbstring/oniguruma/enc/utf8.c n = c & ((1 << (6 - len)) - 1);
n 106 ext/mbstring/oniguruma/enc/utf8.c n = (n << 6) | (c & ((1 << 6) - 1));
n 108 ext/mbstring/oniguruma/enc/utf8.c return n;
n 286 ext/mbstring/oniguruma/oniguruma.h onigenc_step_back((enc),(start),(s),(n))
n 334 ext/mbstring/oniguruma/oniguruma.h OnigUChar* onigenc_step_back P_((OnigEncoding enc, const OnigUChar* start, const OnigUChar* s, int n));
n 755 ext/mbstring/oniguruma/oniguruma.h int onig_region_resize P_((OnigRegion* region, int n));
n 128 ext/mbstring/oniguruma/regcomp.c int i, n;
n 130 ext/mbstring/oniguruma/regcomp.c n = 0;
n 132 ext/mbstring/oniguruma/regcomp.c if (BITSET_AT(bs, i)) n++;
n 134 ext/mbstring/oniguruma/regcomp.c return n;
n 211 ext/mbstring/oniguruma/regcomp.c StateCheckNumType n = (StateCheckNumType )num;
n 213 ext/mbstring/oniguruma/regcomp.c BBUF_ADD(reg, &n, SIZE_STATE_CHECK_NUM);
n 248 ext/mbstring/oniguruma/regcomp.c MemNumType n = (MemNumType )num;
n 250 ext/mbstring/oniguruma/regcomp.c BBUF_ADD(reg, &n, SIZE_MEMNUM);
n 411 ext/mbstring/oniguruma/regcomp.c for (i = 0; i < n; i++) {
n 663 ext/mbstring/oniguruma/regcomp.c int n;
n 664 ext/mbstring/oniguruma/regcomp.c n = reg->repeat_range_alloc + REPEAT_RANGE_ALLOC;
n 666 ext/mbstring/oniguruma/regcomp.c sizeof(OnigRepeatRange) * n);
n 669 ext/mbstring/oniguruma/regcomp.c reg->repeat_range_alloc = n;
n 1131 ext/mbstring/oniguruma/regcomp.c int n = qn->upper - qn->lower;
n 1136 ext/mbstring/oniguruma/regcomp.c for (i = 0; i < n; i++) {
n 1138 ext/mbstring/oniguruma/regcomp.c (n - i) * tlen + (n - i - 1) * SIZE_OP_PUSH);
n 1444 ext/mbstring/oniguruma/regcomp.c int n;
n 1448 ext/mbstring/oniguruma/regcomp.c r = get_char_length_tree(node->target, reg, &n);
n 1452 ext/mbstring/oniguruma/regcomp.c n = node->char_len;
n 1453 ext/mbstring/oniguruma/regcomp.c r = add_length(reg, n);
n 1461 ext/mbstring/oniguruma/regcomp.c int n;
n 1467 ext/mbstring/oniguruma/regcomp.c r = get_char_length_tree(node->target, reg, &n);
n 1471 ext/mbstring/oniguruma/regcomp.c n = node->char_len;
n 1472 ext/mbstring/oniguruma/regcomp.c r = add_length(reg, n);
n 1507 ext/mbstring/oniguruma/regcomp.c int n;
n 1509 ext/mbstring/oniguruma/regcomp.c n = r = 0;
n 1512 ext/mbstring/oniguruma/regcomp.c n++;
n 1514 ext/mbstring/oniguruma/regcomp.c r += (SIZE_OP_PUSH + SIZE_OP_JUMP) * (n - 1);
n 1584 ext/mbstring/oniguruma/regcomp.c int n, type, len, pos, r = 0;
n 1676 ext/mbstring/oniguruma/regcomp.c n = br->back_static[0];
n 1680 ext/mbstring/oniguruma/regcomp.c r = add_mem_num(reg, n);
n 1683 ext/mbstring/oniguruma/regcomp.c switch (n) {
n 1689 ext/mbstring/oniguruma/regcomp.c r = add_mem_num(reg, n);
n 1807 ext/mbstring/oniguruma/regcomp.c int i, pos, n, old_num;
n 1821 ext/mbstring/oniguruma/regcomp.c n = map[backs[i]].new_val;
n 1822 ext/mbstring/oniguruma/regcomp.c if (n > 0) {
n 1823 ext/mbstring/oniguruma/regcomp.c backs[pos] = n;
n 2575 ext/mbstring/oniguruma/regcomp.c Node* n = NULL_NODE;
n 2589 ext/mbstring/oniguruma/regcomp.c n = node;
n 2594 ext/mbstring/oniguruma/regcomp.c n = get_head_value_node(NCAR(node), exact, reg);
n 2608 ext/mbstring/oniguruma/regcomp.c n = node;
n 2618 ext/mbstring/oniguruma/regcomp.c n = qn->head_exact;
n 2620 ext/mbstring/oniguruma/regcomp.c n = get_head_value_node(qn->target, exact, reg);
n 2634 ext/mbstring/oniguruma/regcomp.c n = get_head_value_node(NENCLOSE(node)->target, exact, reg);
n 2641 ext/mbstring/oniguruma/regcomp.c n = get_head_value_node(en->target, exact, reg);
n 2649 ext/mbstring/oniguruma/regcomp.c n = get_head_value_node(NANCHOR(node)->target, exact, reg);
n 2656 ext/mbstring/oniguruma/regcomp.c return n;
n 3042 ext/mbstring/oniguruma/regcomp.c int n = onig_name_to_group_numbers(env->reg, cn->name, cn->name_end,
n 3044 ext/mbstring/oniguruma/regcomp.c if (n <= 0) {
n 3049 ext/mbstring/oniguruma/regcomp.c else if (n > 1) {
n 3152 ext/mbstring/oniguruma/regcomp.c Node* n = get_head_value_node(next_node, 1, reg);
n 3154 ext/mbstring/oniguruma/regcomp.c if (IS_NOT_NULL(n) && NSTR(n)->s[0] != '\0') {
n 3155 ext/mbstring/oniguruma/regcomp.c qn->next_head_exact = n;
n 3370 ext/mbstring/oniguruma/regcomp.c int r, n, len, alt_num;
n 3387 ext/mbstring/oniguruma/regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(reg->enc, reg->case_fold_flag,
n 3389 ext/mbstring/oniguruma/regcomp.c if (n < 0) {
n 3390 ext/mbstring/oniguruma/regcomp.c r = n;
n 3396 ext/mbstring/oniguruma/regcomp.c if (n == 0) {
n 3420 ext/mbstring/oniguruma/regcomp.c alt_num *= (n + 1);
n 3431 ext/mbstring/oniguruma/regcomp.c r = expand_case_fold_string_alt(n, items, p, len, end, reg, &prev_node);
n 3772 ext/mbstring/oniguruma/regcomp.c int i, n = qn->lower;
n 3774 ext/mbstring/oniguruma/regcomp.c for (i = 0; i < n; i++) {
n 4364 ext/mbstring/oniguruma/regcomp.c int i, n;
n 4369 ext/mbstring/oniguruma/regcomp.c n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, case_fold_flag, p, end, items);
n 4370 ext/mbstring/oniguruma/regcomp.c if (n < 0) return n;
n 4372 ext/mbstring/oniguruma/regcomp.c for (i = 0; i < n; i++) {
n 4599 ext/mbstring/oniguruma/regcomp.c int n = onigenc_strlen(env->enc, sn->s, sn->end);
n 4600 ext/mbstring/oniguruma/regcomp.c max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
n 5154 ext/mbstring/oniguruma/regcomp.c int c, i, n = 0;
n 5157 ext/mbstring/oniguruma/regcomp.c if (reg->map[i]) n++;
n 5159 ext/mbstring/oniguruma/regcomp.c fprintf(f, "map: n=%d\n", n);
n 5160 ext/mbstring/oniguruma/regcomp.c if (n > 0) {
n 5606 ext/mbstring/oniguruma/regcomp.c OnigCodePoint n, *data;
n 5609 ext/mbstring/oniguruma/regcomp.c GET_CODE_POINT(n, p);
n 5613 ext/mbstring/oniguruma/regcomp.c for (low = 0, high = n; low < high; ) {
n 5621 ext/mbstring/oniguruma/regcomp.c return ((low < n && code >= data[low * 2]) ? 1 : 0);
n 5818 ext/mbstring/oniguruma/regcomp.c int i, n, arg_type;
n 5908 ext/mbstring/oniguruma/regcomp.c n = len * mb_len;
n 5909 ext/mbstring/oniguruma/regcomp.c while (n-- > 0) { fputc(*bp++, f); }
n 5925 ext/mbstring/oniguruma/regcomp.c n = bitset_on_num((BitSetRef )bp);
n 5927 ext/mbstring/oniguruma/regcomp.c fprintf(f, ":%d", n);
n 5931 ext/mbstring/oniguruma/regcomp.c n = bitset_on_num((BitSetRef )bp);
n 5933 ext/mbstring/oniguruma/regcomp.c fprintf(f, ":%d", n);
n 5950 ext/mbstring/oniguruma/regcomp.c n = bitset_on_num((BitSetRef )bp);
n 5959 ext/mbstring/oniguruma/regcomp.c fprintf(f, ":%d:%d:%d", n, (int )code, len);
n 5967 ext/mbstring/oniguruma/regcomp.c n = bitset_on_num(cc->bs);
n 5968 ext/mbstring/oniguruma/regcomp.c fprintf(f, ":%u:%d", (unsigned int )cc, n);
n 91 ext/mbstring/oniguruma/regenc.c while (ONIG_IS_NOT_NULL(s) && n-- > 0) {
n 104 ext/mbstring/oniguruma/regenc.c while (n-- > 0) {
n 113 ext/mbstring/oniguruma/regenc.c int n = 0;
n 118 ext/mbstring/oniguruma/regenc.c n++;
n 120 ext/mbstring/oniguruma/regenc.c return n;
n 126 ext/mbstring/oniguruma/regenc.c int n = 0;
n 134 ext/mbstring/oniguruma/regenc.c if (len == 1) return n;
n 141 ext/mbstring/oniguruma/regenc.c if (len == 1) return n;
n 144 ext/mbstring/oniguruma/regenc.c n++;
n 645 ext/mbstring/oniguruma/regenc.c OnigCodePoint n;
n 648 ext/mbstring/oniguruma/regenc.c n = (OnigCodePoint )(*p++);
n 649 ext/mbstring/oniguruma/regenc.c if (len == 1) return n;
n 654 ext/mbstring/oniguruma/regenc.c n <<= 8; n += c;
n 656 ext/mbstring/oniguruma/regenc.c return n;
n 827 ext/mbstring/oniguruma/regenc.c while (n-- > 0) {
n 330 ext/mbstring/oniguruma/regerror.c int n, need, len;
n 336 ext/mbstring/oniguruma/regerror.c n = xvsnprintf((char* )buf, bufsize, (const char* )fmt, args);
n 341 ext/mbstring/oniguruma/regerror.c if (n + need < bufsize) {
n 103 ext/mbstring/oniguruma/regexec.c int n, i;
n 106 ext/mbstring/oniguruma/regexec.c n = HISTORY_TREE_INIT_ALLOC_SIZE;
n 108 ext/mbstring/oniguruma/regexec.c (OnigCaptureTreeNode** )xmalloc(sizeof(OnigCaptureTreeNode*) * n);
n 111 ext/mbstring/oniguruma/regexec.c n = parent->allocated * 2;
n 114 ext/mbstring/oniguruma/regexec.c sizeof(OnigCaptureTreeNode*) * n);
n 117 ext/mbstring/oniguruma/regexec.c for (i = parent->allocated; i < n; i++) {
n 120 ext/mbstring/oniguruma/regexec.c parent->allocated = n;
n 174 ext/mbstring/oniguruma/regexec.c region->num_regs = n;
n 176 ext/mbstring/oniguruma/regexec.c if (n < ONIG_NREGION)
n 177 ext/mbstring/oniguruma/regexec.c n = ONIG_NREGION;
n 180 ext/mbstring/oniguruma/regexec.c region->beg = (int* )xmalloc(n * sizeof(int));
n 181 ext/mbstring/oniguruma/regexec.c region->end = (int* )xmalloc(n * sizeof(int));
n 186 ext/mbstring/oniguruma/regexec.c region->allocated = n;
n 188 ext/mbstring/oniguruma/regexec.c else if (region->allocated < n) {
n 189 ext/mbstring/oniguruma/regexec.c region->beg = (int* )xrealloc(region->beg, n * sizeof(int));
n 190 ext/mbstring/oniguruma/regexec.c region->end = (int* )xrealloc(region->end, n * sizeof(int));
n 195 ext/mbstring/oniguruma/regexec.c region->allocated = n;
n 206 ext/mbstring/oniguruma/regexec.c r = onig_region_resize(region, n);
n 431 ext/mbstring/oniguruma/regexec.c unsigned int n;
n 438 ext/mbstring/oniguruma/regexec.c n = stk_end - stk_base;
n 440 ext/mbstring/oniguruma/regexec.c x = (OnigStackType* )xmalloc(sizeof(OnigStackType) * n * 2);
n 445 ext/mbstring/oniguruma/regexec.c xmemcpy(x, stk_base, n * sizeof(OnigStackType));
n 446 ext/mbstring/oniguruma/regexec.c n *= 2;
n 449 ext/mbstring/oniguruma/regexec.c n *= 2;
n 450 ext/mbstring/oniguruma/regexec.c if (MatchStackLimitSize != 0 && n > MatchStackLimitSize) {
n 454 ext/mbstring/oniguruma/regexec.c n = MatchStackLimitSize;
n 456 ext/mbstring/oniguruma/regexec.c x = (OnigStackType* )xrealloc(stk_base, sizeof(OnigStackType) * n);
n 464 ext/mbstring/oniguruma/regexec.c *arg_stk_end = x + n;
n 469 ext/mbstring/oniguruma/regexec.c if (stk_end - stk < (n)) {\
n 1026 ext/mbstring/oniguruma/regexec.c #define DATA_ENSURE_CHECK(n) (s + (n) <= right_range)
n 1027 ext/mbstring/oniguruma/regexec.c #define DATA_ENSURE(n) if (s + (n) > right_range) goto fail
n 1030 ext/mbstring/oniguruma/regexec.c #define DATA_ENSURE_CHECK(n) (s + (n) <= end)
n 1031 ext/mbstring/oniguruma/regexec.c #define DATA_ENSURE(n) if (s + (n) > end) goto fail
n 1040 ext/mbstring/oniguruma/regexec.c int n, r;
n 1046 ext/mbstring/oniguruma/regexec.c n = k->u.mem.num;
n 1047 ext/mbstring/oniguruma/regexec.c if (n <= ONIG_MAX_CAPTURE_HISTORY_GROUP &&
n 1048 ext/mbstring/oniguruma/regexec.c BIT_STATUS_AT(reg->capture_history, n) != 0) {
n 1051 ext/mbstring/oniguruma/regexec.c child->group = n;
n 1246 ext/mbstring/oniguruma/regexec.c int i, n, num_mem, best_len, pop_level;
n 1266 ext/mbstring/oniguruma/regexec.c n = reg->num_repeat + reg->num_mem * 2;
n 1268 ext/mbstring/oniguruma/regexec.c STACK_INIT(alloca_base, n, INIT_MATCH_STACK_SIZE);
n 1317 ext/mbstring/oniguruma/regexec.c n = s - sstart;
n 1318 ext/mbstring/oniguruma/regexec.c if (n > best_len) {
n 1322 ext/mbstring/oniguruma/regexec.c if (n > msa->best_len) {
n 1323 ext/mbstring/oniguruma/regexec.c msa->best_len = n;
n 1330 ext/mbstring/oniguruma/regexec.c best_len = n;
n 1786 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1787 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1789 ext/mbstring/oniguruma/regexec.c s += n;
n 1795 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1796 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1797 ext/mbstring/oniguruma/regexec.c s += n;
n 1804 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1805 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1808 ext/mbstring/oniguruma/regexec.c s += n;
n 1816 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1817 ext/mbstring/oniguruma/regexec.c if (n > 1) {
n 1818 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1820 ext/mbstring/oniguruma/regexec.c s += n;
n 1835 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1836 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1839 ext/mbstring/oniguruma/regexec.c s += n;
n 1850 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1851 ext/mbstring/oniguruma/regexec.c if (n > 1) {
n 1852 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1854 ext/mbstring/oniguruma/regexec.c s += n;
n 1873 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1874 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1877 ext/mbstring/oniguruma/regexec.c s += n;
n 1891 ext/mbstring/oniguruma/regexec.c n = enclen(encode, s);
n 1892 ext/mbstring/oniguruma/regexec.c if (n > 1) {
n 1893 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 1895 ext/mbstring/oniguruma/regexec.c s += n;
n 2158 ext/mbstring/oniguruma/regexec.c n = pend - pstart;
n 2159 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 2161 ext/mbstring/oniguruma/regexec.c STRING_CMP(pstart, s, n);
n 2190 ext/mbstring/oniguruma/regexec.c n = pend - pstart;
n 2191 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 2193 ext/mbstring/oniguruma/regexec.c STRING_CMP_IC(case_fold_flag, pstart, &s, n);
n 2222 ext/mbstring/oniguruma/regexec.c n = pend - pstart;
n 2223 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 2226 ext/mbstring/oniguruma/regexec.c STRING_CMP_VALUE(pstart, swork, n, is_fail);
n 2261 ext/mbstring/oniguruma/regexec.c n = pend - pstart;
n 2262 ext/mbstring/oniguruma/regexec.c DATA_ENSURE(n);
n 2265 ext/mbstring/oniguruma/regexec.c STRING_CMP_VALUE_IC(case_fold_flag, pstart, &swork, n, is_fail);
n 3067 ext/mbstring/oniguruma/regexec.c int n;
n 3070 ext/mbstring/oniguruma/regexec.c n = 0;
n 3072 ext/mbstring/oniguruma/regexec.c if (++n > THREAD_PASS_LIMIT_COUNT)
n 3372 ext/mbstring/oniguruma/regexec.c int n;
n 3375 ext/mbstring/oniguruma/regexec.c n = 0;
n 3377 ext/mbstring/oniguruma/regexec.c if (++n > THREAD_PASS_LIMIT_COUNT)
n 3785 ext/mbstring/oniguruma/regexec.c int i, n;
n 3787 ext/mbstring/oniguruma/regexec.c n = 0;
n 3790 ext/mbstring/oniguruma/regexec.c n++;
n 3792 ext/mbstring/oniguruma/regexec.c return n;
n 265 ext/mbstring/oniguruma/regint.h ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & (1 << n)) : ((stats) & 1))
n 268 ext/mbstring/oniguruma/regint.h if ((n) < (int )BIT_STATUS_BITS_NUM) \
n 269 ext/mbstring/oniguruma/regint.h (stats) |= (1 << (n));\
n 275 ext/mbstring/oniguruma/regint.h if ((n) < (int )BIT_STATUS_BITS_NUM)\
n 276 ext/mbstring/oniguruma/regint.h (stats) |= (1 << (n));\
n 311 ext/mbstring/oniguruma/regint.h #define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE)
n 374 ext/mbstring/oniguruma/regint.h int used = (pos) + (n);\
n 376 ext/mbstring/oniguruma/regint.h xmemcpy((buf)->p + (pos), (bytes), (n));\
n 387 ext/mbstring/oniguruma/regint.h #define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n))
n 394 ext/mbstring/oniguruma/regint.h if ((unsigned int )((to)+(n)) > (buf)->alloc) BBUF_EXPAND((buf),(to) + (n));\
n 395 ext/mbstring/oniguruma/regint.h xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
n 396 ext/mbstring/oniguruma/regint.h if ((unsigned int )((to)+(n)) > (buf)->used) (buf)->used = (to) + (n);\
n 401 ext/mbstring/oniguruma/regint.h xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
n 412 ext/mbstring/oniguruma/regint.h BBUF_WRITE(buf,pos,bytes,n);\
n 415 ext/mbstring/oniguruma/regint.h BBUF_MOVE_RIGHT((buf),(pos),(pos) + (n),((buf)->used - (pos)));\
n 416 ext/mbstring/oniguruma/regint.h xmemcpy((buf)->p + (pos), (bytes), (n));\
n 211 ext/mbstring/oniguruma/regparse.c while (n-- > 0) {
n 845 ext/mbstring/oniguruma/regparse.c int i, n, *nums;
n 847 ext/mbstring/oniguruma/regparse.c n = onig_name_to_group_numbers(reg, name, name_end, &nums);
n 848 ext/mbstring/oniguruma/regparse.c if (n < 0)
n 849 ext/mbstring/oniguruma/regparse.c return n;
n 850 ext/mbstring/oniguruma/regparse.c else if (n == 0)
n 852 ext/mbstring/oniguruma/regparse.c else if (n == 1)
n 856 ext/mbstring/oniguruma/regparse.c for (i = n - 1; i >= 0; i--) {
n 861 ext/mbstring/oniguruma/regparse.c return nums[n - 1];
n 1019 ext/mbstring/oniguruma/regparse.c FreeNode* n = (FreeNode* )node;
n 1022 ext/mbstring/oniguruma/regparse.c n->next = FreeNodeList;
n 1023 ext/mbstring/oniguruma/regparse.c FreeNodeList = n;
n 1067 ext/mbstring/oniguruma/regparse.c FreeNode* n = (FreeNode* )node;
n 1070 ext/mbstring/oniguruma/regparse.c n->next = FreeNodeList;
n 1071 ext/mbstring/oniguruma/regparse.c FreeNodeList = n;
n 1083 ext/mbstring/oniguruma/regparse.c FreeNode* n;
n 1087 ext/mbstring/oniguruma/regparse.c n = FreeNodeList;
n 1089 ext/mbstring/oniguruma/regparse.c xfree(n);
n 1142 ext/mbstring/oniguruma/regparse.c int n, i;
n 1154 ext/mbstring/oniguruma/regparse.c n = ONIGENC_CODE_RANGE_NUM(ranges);
n 1155 ext/mbstring/oniguruma/regparse.c for (i = 0; i < n; i++) {
n 1173 ext/mbstring/oniguruma/regparse.c n = ONIGENC_CODE_RANGE_NUM(ranges);
n 1174 ext/mbstring/oniguruma/regparse.c if (n == 0) goto is_null;
n 1178 ext/mbstring/oniguruma/regparse.c bbuf->alloc = n + 1;
n 1179 ext/mbstring/oniguruma/regparse.c bbuf->used = n + 1;
n 1231 ext/mbstring/oniguruma/regparse.c Node *n;
n 1233 ext/mbstring/oniguruma/regparse.c n = onig_node_new_list(x, NULL);
n 1234 ext/mbstring/oniguruma/regparse.c if (IS_NULL(n)) return NULL_NODE;
n 1240 ext/mbstring/oniguruma/regparse.c NCDR(list) = n;
n 1243 ext/mbstring/oniguruma/regparse.c return n;
n 1538 ext/mbstring/oniguruma/regparse.c Node* n = NULL_NODE;
n 1543 ext/mbstring/oniguruma/regparse.c n = node_new_str(p, sn->end);
n 1545 ext/mbstring/oniguruma/regparse.c NSTRING_SET_RAW(n);
n 1549 ext/mbstring/oniguruma/regparse.c return n;
n 1675 ext/mbstring/oniguruma/regparse.c OnigCodePoint n;
n 1683 ext/mbstring/oniguruma/regparse.c n = 0;
n 1684 ext/mbstring/oniguruma/regparse.c BBUF_WRITE_CODE_POINT(bbuf, 0, n);
n 1693 ext/mbstring/oniguruma/regparse.c OnigCodePoint n, *data;
n 1697 ext/mbstring/oniguruma/regparse.c n = from; from = to; to = n;
n 1704 ext/mbstring/oniguruma/regparse.c n = 0;
n 1708 ext/mbstring/oniguruma/regparse.c GET_CODE_POINT(n, bbuf->p);
n 1713 ext/mbstring/oniguruma/regparse.c for (low = 0, bound = n; low < bound; ) {
n 1721 ext/mbstring/oniguruma/regparse.c for (high = low, bound = n; high < bound; ) {
n 1730 ext/mbstring/oniguruma/regparse.c if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM)
n 1740 ext/mbstring/oniguruma/regparse.c if (inc_n != 0 && (OnigCodePoint )high < n) {
n 1743 ext/mbstring/oniguruma/regparse.c int size = (n - high) * 2 * SIZE_CODE_POINT;
n 1757 ext/mbstring/oniguruma/regparse.c n += inc_n;
n 1758 ext/mbstring/oniguruma/regparse.c BBUF_WRITE_CODE_POINT(bbuf, 0, n);
n 1779 ext/mbstring/oniguruma/regparse.c int r, i, n;
n 1789 ext/mbstring/oniguruma/regparse.c GET_CODE_POINT(n, data);
n 1791 ext/mbstring/oniguruma/regparse.c if (n <= 0) goto set_all;
n 1795 ext/mbstring/oniguruma/regparse.c for (i = 0; i < n; i++) {
n 1882 ext/mbstring/oniguruma/regparse.c for (i = 0; i < n; i++) {
n 2848 ext/mbstring/oniguruma/regparse.c for (i = 1; i < n && q < to; i++) {
n 2853 ext/mbstring/oniguruma/regparse.c if (i >= n) {
n 2883 ext/mbstring/oniguruma/regparse.c for (i = 1; i < n && q < to; i++) {
n 2888 ext/mbstring/oniguruma/regparse.c if (i >= n) return 1;
n 3758 ext/mbstring/oniguruma/regparse.c int n = ONIGENC_CODE_RANGE_NUM(mbr);
n 3761 ext/mbstring/oniguruma/regparse.c for (i = 0; i < n; i++) {
n 3780 ext/mbstring/oniguruma/regparse.c for ( ; i < n; i++) {
n 3790 ext/mbstring/oniguruma/regparse.c for (i = 0; i < n; i++) {
n 3807 ext/mbstring/oniguruma/regparse.c for (i = 0; i < n; i++) {
n 4769 ext/mbstring/oniguruma/regparse.c Node* n = str_node_split_last_char(sn, env->enc);
n 4770 ext/mbstring/oniguruma/regparse.c if (IS_NOT_NULL(n)) {
n 4771 ext/mbstring/oniguruma/regparse.c qn->target = n;
n 55 ext/mbstring/oniguruma/st.c #define Calloc(n,s) (char*)xcalloc((n),(s))
n 577 ext/mbstring/oniguruma/st.c return n;
n 196 ext/mbstring/oniguruma/testc.c n(".", "");
n 199 ext/mbstring/oniguruma/testc.c n("\\W", "e");
n 203 ext/mbstring/oniguruma/testc.c n("\\D", "4");
n 210 ext/mbstring/oniguruma/testc.c n("[ab]", "c");
n 212 ext/mbstring/oniguruma/testc.c n("[^a]", "a");
n 215 ext/mbstring/oniguruma/testc.c n("[^]]", "]");
n 220 ext/mbstring/oniguruma/testc.c n("[\\w]", " ");
n 223 ext/mbstring/oniguruma/testc.c n("[\\d]", "e");
n 225 ext/mbstring/oniguruma/testc.c n("[\\D]", "3");
n 227 ext/mbstring/oniguruma/testc.c n("[\\s]", "a");
n 229 ext/mbstring/oniguruma/testc.c n("[\\S]", " ");
n 231 ext/mbstring/oniguruma/testc.c n("[\\w\\d]", " ");
n 236 ext/mbstring/oniguruma/testc.c n("[[:upper]]", "A");
n 241 ext/mbstring/oniguruma/testc.c n("[\\x6A-\\x6D]", "\x6E");
n 242 ext/mbstring/oniguruma/testc.c n("^[0-9A-F]+ 0+ UNDEF ", "75F 00000000 SECT14A notype () External | _rb_apply");
n 248 ext/mbstring/oniguruma/testc.c n("[[^a]]", "a");
n 249 ext/mbstring/oniguruma/testc.c n("[^[a]]", "a");
n 251 ext/mbstring/oniguruma/testc.c n("[[ab]&&bc]", "a");
n 252 ext/mbstring/oniguruma/testc.c n("[[ab]&&bc]", "c");
n 254 ext/mbstring/oniguruma/testc.c n("[^a-z&&b-y&&c-x]", "w");
n 256 ext/mbstring/oniguruma/testc.c n("[[^a&&a]&&a-z]", "a");
n 258 ext/mbstring/oniguruma/testc.c n("[[^a-z&&bcdef]&&[^c-g]]", "c");
n 261 ext/mbstring/oniguruma/testc.c n("[^[^abc]&&[^cde]]", "f");
n 263 ext/mbstring/oniguruma/testc.c n("[a\\-&&\\-a]", "&");
n 264 ext/mbstring/oniguruma/testc.c n("\\wabc", " abc");
n 270 ext/mbstring/oniguruma/testc.c n(".a", "ab");
n 275 ext/mbstring/oniguruma/testc.c n("^\\w$", " ");
n 286 ext/mbstring/oniguruma/testc.c n("\\Gz", "bza");
n 287 ext/mbstring/oniguruma/testc.c n("az\\G", "az");
n 288 ext/mbstring/oniguruma/testc.c n("az\\A", "az");
n 289 ext/mbstring/oniguruma/testc.c n("a\\Az", "az");
n 294 ext/mbstring/oniguruma/testc.c n("\\W", "_");
n 296 ext/mbstring/oniguruma/testc.c n("(?=z).", "a");
n 298 ext/mbstring/oniguruma/testc.c n("(?!z)a", "z");
n 302 ext/mbstring/oniguruma/testc.c n("(?i:A)", "b");
n 306 ext/mbstring/oniguruma/testc.c n("(?i:[f-m])", "e");
n 308 ext/mbstring/oniguruma/testc.c n("(?i:[^a-z])", "A");
n 309 ext/mbstring/oniguruma/testc.c n("(?i:[^a-z])", "a");
n 316 ext/mbstring/oniguruma/testc.c n(".", "\n");
n 322 ext/mbstring/oniguruma/testc.c n("(?i)(?-i)a", "A");
n 323 ext/mbstring/oniguruma/testc.c n("(?i)(?-i:a)", "A");
n 331 ext/mbstring/oniguruma/testc.c n("a+", "");
n 358 ext/mbstring/oniguruma/testc.c n("a|b|cd|efg|h|ijk|lmn|o|pq|rstuvwx|yz", "mn");
n 370 ext/mbstring/oniguruma/testc.c n("\\w|\\w", " ");
n 379 ext/mbstring/oniguruma/testc.c n("(?>a|abd)c", "abdc");
n 390 ext/mbstring/oniguruma/testc.c n("a+|b+", "");
n 406 ext/mbstring/oniguruma/testc.c n("ax{2}*a", "0axxxa1");
n 407 ext/mbstring/oniguruma/testc.c n("a.{0,2}a", "0aXXXa0");
n 408 ext/mbstring/oniguruma/testc.c n("a.{0,2}?a", "0aXXXa0");
n 409 ext/mbstring/oniguruma/testc.c n("a.{0,2}?a", "0aXXXXa0");
n 413 ext/mbstring/oniguruma/testc.c n("(?:a+|\\Ab*)cc", "abcc");
n 420 ext/mbstring/oniguruma/testc.c n("(?i:c)|a", "A");
n 424 ext/mbstring/oniguruma/testc.c n("[^abc]+", "abc");
n 442 ext/mbstring/oniguruma/testc.c n("(?:ab){3,}", "abab");
n 488 ext/mbstring/oniguruma/testc.c n("(\\Abb)cc", "zbbcc");
n 490 ext/mbstring/oniguruma/testc.c n("(^bb)cc", "zbbcc");
n 492 ext/mbstring/oniguruma/testc.c n("cc(bb$)", "ccbbb");
n 493 ext/mbstring/oniguruma/testc.c n("(\\1)", "");
n 494 ext/mbstring/oniguruma/testc.c n("\\1(a)", "aa");
n 495 ext/mbstring/oniguruma/testc.c n("(a(b)\\1)\\2+", "ababb");
n 496 ext/mbstring/oniguruma/testc.c n("(?:(?:\\1|z)(a))+$", "zaa");
n 499 ext/mbstring/oniguruma/testc.c n("(a)$|\\1", "az");
n 501 ext/mbstring/oniguruma/testc.c n("(a)\\1", "ab");
n 515 ext/mbstring/oniguruma/testc.c n("(\\w\\d\\s)\\1", "f5 f5");
n 520 ext/mbstring/oniguruma/testc.c n("(^a)\\1", "baa");
n 521 ext/mbstring/oniguruma/testc.c n("(a$)\\1", "aa");
n 522 ext/mbstring/oniguruma/testc.c n("(ab\\Z)\\1", "ab");
n 528 ext/mbstring/oniguruma/testc.c n("((?i:az))\\1", "Azaz");
n 530 ext/mbstring/oniguruma/testc.c n("(?<=a)b", "bb");
n 537 ext/mbstring/oniguruma/testc.c n("(?<!a)b", "ab");
n 539 ext/mbstring/oniguruma/testc.c n("(?<!a|bc)z", "bcz");
n 556 ext/mbstring/oniguruma/testc.c n("(?:(?<x>abc)|(?<x>efg))\\k<x>", "abcefg");
n 581 ext/mbstring/oniguruma/testc.c n("¤¤", "¤¢");
n 591 ext/mbstring/oniguruma/testc.c n("\\W", "¤¢");
n 601 ext/mbstring/oniguruma/testc.c n("[¤Ê¤Ë]", "¤Ì");
n 603 ext/mbstring/oniguruma/testc.c n("[^¤±]", "¤±");
n 605 ext/mbstring/oniguruma/testc.c n("[\\d]", "¤Õ");
n 607 ext/mbstring/oniguruma/testc.c n("[\\s]", "¤¯");
n 611 ext/mbstring/oniguruma/testc.c n("\\wµ´¼Ö", " µ´¼Ö");
n 617 ext/mbstring/oniguruma/testc.c n(".¤¤", "¤¤¤¨");
n 630 ext/mbstring/oniguruma/testc.c n("\\G¤¨", "¤¦¤¨¤ª");
n 631 ext/mbstring/oniguruma/testc.c n("¤È¤Æ\\G", "¤È¤Æ");
n 632 ext/mbstring/oniguruma/testc.c n("¤Þ¤ß\\A", "¤Þ¤ß");
n 633 ext/mbstring/oniguruma/testc.c n("¤Þ\\A¤ß", "¤Þ¤ß");
n 635 ext/mbstring/oniguruma/testc.c n("(?=¤¦).", "¤¤");
n 637 ext/mbstring/oniguruma/testc.c n("(?!¤È)¤¢", "¤È");
n 640 ext/mbstring/oniguruma/testc.c n("(?i:¤¤)", "¤¦");
n 650 ext/mbstring/oniguruma/testc.c n("»³+", "");
n 668 ext/mbstring/oniguruma/testc.c n("¤¢|¤¤|¤¦¤¨|¤ª¤«¤|¤¯|¤±¤³¤µ|¤·¤¹¤»|¤½|¤¿¤Á|¤Ä¤Æ¤È¤Ê¤Ë|¤Ì¤Í", "¤¹¤»");
n 693 ext/mbstring/oniguruma/testc.c n("(?>¤¢|¤¢¤¤¤¨)¤¦", "¤¢¤¤¤¨¤¦");
n 706 ext/mbstring/oniguruma/testc.c n("¤¢+|¤¤+", "");
n 724 ext/mbstring/oniguruma/testc.c n("(?:¤¢+|\\A¤¤*)¤¦¤¦", "¤¢¤¤¤¦¤¦");
n 731 ext/mbstring/oniguruma/testc.c n("(?i:¤¢)|a", "A");
n 735 ext/mbstring/oniguruma/testc.c n("[^¤¢¤¤¤¦]+", "¤¢¤¤¤¦");
n 753 ext/mbstring/oniguruma/testc.c n("(?:µ´¼Ö){3,}", "µ´¼Öµ´¼Ö");
n 793 ext/mbstring/oniguruma/testc.c n("(\\A¤¤¤¤)¤¦¤¦", "¤ó¤¤¤¤¤¦¤¦");
n 795 ext/mbstring/oniguruma/testc.c n("(^¤¤¤¤)¤¦¤¦", "¤ó¤¤¤¤¤¦¤¦");
n 797 ext/mbstring/oniguruma/testc.c n("¤í¤í(¤ë¤ë$)", "¤í¤í¤ë¤ë¤ë");
n 799 ext/mbstring/oniguruma/testc.c n("(̵)\\1", "̵Éð");
n 814 ext/mbstring/oniguruma/testc.c n("(\\w\\d\\s)\\1", "¤¢5 ¤¢5");
n 819 ext/mbstring/oniguruma/testc.c n("(^¤à)\\1", "¤á¤à¤à");
n 820 ext/mbstring/oniguruma/testc.c n("(¤¢$)\\1", "¤¢¤¢");
n 821 ext/mbstring/oniguruma/testc.c n("(¤¢¤¤\\Z)\\1", "¤¢¤¤");
n 831 ext/mbstring/oniguruma/testc.c n("[[^¤¢]]", "¤¢");
n 832 ext/mbstring/oniguruma/testc.c n("[^[¤¢]]", "¤¢");
n 835 ext/mbstring/oniguruma/testc.c n("[[¤«¤¤¯]&&¤¤¯]", "¤«");
n 836 ext/mbstring/oniguruma/testc.c n("[[¤«¤¤¯]&&¤¤¯]", "¤±");
n 838 ext/mbstring/oniguruma/testc.c n("[^¤¢-¤ó&&¤¤-¤ò&&¤¦-¤ñ]", "¤ñ");
n 840 ext/mbstring/oniguruma/testc.c n("[[^¤¢&&¤¢]&&¤¢-¤ó]", "¤¢");
n 842 ext/mbstring/oniguruma/testc.c n("[[^¤¢-¤ó&&¤¤¤¦¤¨¤ª]&&[^¤¦-¤«]]", "¤¤");
n 845 ext/mbstring/oniguruma/testc.c n("[^[^¤¢¤¤¤¦]&&[^¤¦¤¨¤ª]]", "¤«");
n 850 ext/mbstring/oniguruma/testc.c n("[^[^a-z¤¢¤¤¤¦]&&[^bcdefg¤¦¤¨¤ª]g-w]", "2");
n 244 ext/mbstring/oniguruma/testu.c n("\000.\000\000", "\000\000");
n 247 ext/mbstring/oniguruma/testu.c n("\000\134\000W\000\000", "\000e\000\000");
n 251 ext/mbstring/oniguruma/testu.c n("\000\134\000D\000\000", "\0004\000\000");
n 258 ext/mbstring/oniguruma/testu.c n("\000[\000a\000b\000]\000\000", "\000c\000\000");
n 260 ext/mbstring/oniguruma/testu.c n("\000[\000^\000a\000]\000\000", "\000a\000\000");
n 263 ext/mbstring/oniguruma/testu.c n("\000[\000^\000]\000]\000\000", "\000]\000\000");
n 268 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000w\000]\000\000", "\000 \000\000");
n 271 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000d\000]\000\000", "\000e\000\000");
n 273 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000D\000]\000\000", "\0003\000\000");
n 275 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000s\000]\000\000", "\000a\000\000");
n 277 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000S\000]\000\000", "\000 \000\000");
n 279 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000w\000\134\000d\000]\000\000", "\000 \000\000");
n 284 ext/mbstring/oniguruma/testu.c n("\000[\000[\000:\000u\000p\000p\000e\000r\000]\000]\000\000", "\000A\000\000");
n 289 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000x\0000\0000\000\134\000x\0006\000A\000-\000\134\000x\0000\0000\000\134\000x\0006\000D\000]\000\000", "\000n\000\000");
n 290 ext/mbstring/oniguruma/testu.c n("\000^\000[\0000\000-\0009\000A\000-\000F\000]\000+\000 \0000\000+\000 \000U\000N\000D\000E\000F\000 \000\000", "\0007\0005\000F\000 \0000\0000\0000\0000\0000\0000\0000\0000\000 \000S\000E\000C\000T\0001\0004\000A\000 \000n\000o\000t\000y\000p\000e\000 \000(\000)\000 \000 \000 \000 \000E\000x\000t\000e\000r\000n\000a\000l\000 \000 \000 \000 \000|\000 \000_\000r\000b\000_\000a\000p\000p\000l\000y\000\000");
n 296 ext/mbstring/oniguruma/testu.c n("\000[\000[\000^\000a\000]\000]\000\000", "\000a\000\000");
n 297 ext/mbstring/oniguruma/testu.c n("\000[\000^\000[\000a\000]\000]\000\000", "\000a\000\000");
n 299 ext/mbstring/oniguruma/testu.c n("\000[\000[\000a\000b\000]\000&\000&\000b\000c\000]\000\000", "\000a\000\000");
n 300 ext/mbstring/oniguruma/testu.c n("\000[\000[\000a\000b\000]\000&\000&\000b\000c\000]\000\000", "\000c\000\000");
n 302 ext/mbstring/oniguruma/testu.c n("\000[\000^\000a\000-\000z\000&\000&\000b\000-\000y\000&\000&\000c\000-\000x\000]\000\000", "\000w\000\000");
n 304 ext/mbstring/oniguruma/testu.c n("\000[\000[\000^\000a\000&\000&\000a\000]\000&\000&\000a\000-\000z\000]\000\000", "\000a\000\000");
n 306 ext/mbstring/oniguruma/testu.c n("\000[\000[\000^\000a\000-\000z\000&\000&\000b\000c\000d\000e\000f\000]\000&\000&\000[\000^\000c\000-\000g\000]\000]\000\000", "\000c\000\000");
n 309 ext/mbstring/oniguruma/testu.c n("\000[\000^\000[\000^\000a\000b\000c\000]\000&\000&\000[\000^\000c\000d\000e\000]\000]\000\000", "\000f\000\000");
n 311 ext/mbstring/oniguruma/testu.c n("\000[\000a\000\134\000-\000&\000&\000\134\000-\000a\000]\000\000", "\000&\000\000");
n 312 ext/mbstring/oniguruma/testu.c n("\000\134\000w\000a\000b\000c\000\000", "\000 \000a\000b\000c\000\000");
n 318 ext/mbstring/oniguruma/testu.c n("\000.\000a\000\000", "\000a\000b\000\000");
n 323 ext/mbstring/oniguruma/testu.c n("\000^\000\134\000w\000$\000\000", "\000 \000\000");
n 334 ext/mbstring/oniguruma/testu.c n("\000\134\000G\000z\000\000", "\000b\000z\000a\000\000");
n 335 ext/mbstring/oniguruma/testu.c n("\000a\000z\000\134\000G\000\000", "\000a\000z\000\000");
n 336 ext/mbstring/oniguruma/testu.c n("\000a\000z\000\134\000A\000\000", "\000a\000z\000\000");
n 337 ext/mbstring/oniguruma/testu.c n("\000a\000\134\000A\000z\000\000", "\000a\000z\000\000");
n 342 ext/mbstring/oniguruma/testu.c n("\000\134\000W\000\000", "\000_\000\000");
n 344 ext/mbstring/oniguruma/testu.c n("\000(\000?\000=\000z\000)\000.\000\000", "\000a\000\000");
n 346 ext/mbstring/oniguruma/testu.c n("\000(\000?\000!\000z\000)\000a\000\000", "\000z\000\000");
n 350 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000:\000A\000)\000\000", "\000b\000\000");
n 354 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000:\000[\000f\000-\000m\000]\000)\000\000", "\000e\000\000");
n 356 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000:\000[\000^\000a\000-\000z\000]\000)\000\000", "\000A\000\000");
n 357 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000:\000[\000^\000a\000-\000z\000]\000)\000\000", "\000a\000\000");
n 364 ext/mbstring/oniguruma/testu.c n("\000.\000\000", "\000\012\000\000");
n 370 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000)\000(\000?\000-\000i\000)\000a\000\000", "\000A\000\000");
n 371 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000)\000(\000?\000-\000i\000:\000a\000)\000\000", "\000A\000\000");
n 379 ext/mbstring/oniguruma/testu.c n("\000a\000+\000\000", "\000\000");
n 406 ext/mbstring/oniguruma/testu.c n("\000a\000|\000b\000|\000c\000d\000|\000e\000f\000g\000|\000h\000|\000i\000j\000k\000|\000l\000m\000n\000|\000o\000|\000p\000q\000|\000r\000s\000t\000u\000v\000w\000x\000|\000y\000z\000\000", "\000m\000n\000\000");
n 418 ext/mbstring/oniguruma/testu.c n("\000\134\000w\000|\000\134\000w\000\000", "\000 \000\000");
n 427 ext/mbstring/oniguruma/testu.c n("\000(\000?\000>\000a\000|\000a\000b\000d\000)\000c\000\000", "\000a\000b\000d\000c\000\000");
n 438 ext/mbstring/oniguruma/testu.c n("\000a\000+\000|\000b\000+\000\000", "\000\000");
n 454 ext/mbstring/oniguruma/testu.c n("\000a\000x\000{\0002\000}\000*\000a\000\000", "\0000\000a\000x\000x\000x\000a\0001\000\000");
n 455 ext/mbstring/oniguruma/testu.c n("\000a\000.\000{\0000\000,\0002\000}\000a\000\000", "\0000\000a\000X\000X\000X\000a\0000\000\000");
n 456 ext/mbstring/oniguruma/testu.c n("\000a\000.\000{\0000\000,\0002\000}\000?\000a\000\000", "\0000\000a\000X\000X\000X\000a\0000\000\000");
n 457 ext/mbstring/oniguruma/testu.c n("\000a\000.\000{\0000\000,\0002\000}\000?\000a\000\000", "\0000\000a\000X\000X\000X\000X\000a\0000\000\000");
n 461 ext/mbstring/oniguruma/testu.c n("\000(\000?\000:\000a\000+\000|\000\134\000A\000b\000*\000)\000c\000c\000\000", "\000a\000b\000c\000c\000\000");
n 468 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000:\000c\000)\000|\000a\000\000", "\000A\000\000");
n 472 ext/mbstring/oniguruma/testu.c n("\000[\000^\000a\000b\000c\000]\000+\000\000", "\000a\000b\000c\000\000");
n 490 ext/mbstring/oniguruma/testu.c n("\000(\000?\000:\000a\000b\000)\000{\0003\000,\000}\000\000", "\000a\000b\000a\000b\000\000");
n 536 ext/mbstring/oniguruma/testu.c n("\000(\000\134\000A\000b\000b\000)\000c\000c\000\000", "\000z\000b\000b\000c\000c\000\000");
n 538 ext/mbstring/oniguruma/testu.c n("\000(\000^\000b\000b\000)\000c\000c\000\000", "\000z\000b\000b\000c\000c\000\000");
n 540 ext/mbstring/oniguruma/testu.c n("\000c\000c\000(\000b\000b\000$\000)\000\000", "\000c\000c\000b\000b\000b\000\000");
n 541 ext/mbstring/oniguruma/testu.c n("\000(\000\134\0001\000)\000\000", "\000\000");
n 542 ext/mbstring/oniguruma/testu.c n("\000\134\0001\000(\000a\000)\000\000", "\000a\000a\000\000");
n 543 ext/mbstring/oniguruma/testu.c n("\000(\000a\000(\000b\000)\000\134\0001\000)\000\134\0002\000+\000\000", "\000a\000b\000a\000b\000b\000\000");
n 544 ext/mbstring/oniguruma/testu.c n("\000(\000?\000:\000(\000?\000:\000\134\0001\000|\000z\000)\000(\000a\000)\000)\000+\000$\000\000", "\000z\000a\000a\000\000");
n 547 ext/mbstring/oniguruma/testu.c n("\000(\000a\000)\000$\000|\000\134\0001\000\000", "\000a\000z\000\000");
n 549 ext/mbstring/oniguruma/testu.c n("\000(\000a\000)\000\134\0001\000\000", "\000a\000b\000\000");
n 563 ext/mbstring/oniguruma/testu.c n("\000(\000\134\000w\000\134\000d\000\134\000s\000)\000\134\0001\000\000", "\000f\0005\000 \000f\0005\000\000");
n 568 ext/mbstring/oniguruma/testu.c n("\000(\000^\000a\000)\000\134\0001\000\000", "\000b\000a\000a\000\000");
n 569 ext/mbstring/oniguruma/testu.c n("\000(\000a\000$\000)\000\134\0001\000\000", "\000a\000a\000\000");
n 570 ext/mbstring/oniguruma/testu.c n("\000(\000a\000b\000\134\000Z\000)\000\134\0001\000\000", "\000a\000b\000\000");
n 576 ext/mbstring/oniguruma/testu.c n("\000(\000(\000?\000i\000:\000a\000z\000)\000)\000\134\0001\000\000", "\000A\000z\000a\000z\000\000");
n 578 ext/mbstring/oniguruma/testu.c n("\000(\000?\000<\000=\000a\000)\000b\000\000", "\000b\000b\000\000");
n 585 ext/mbstring/oniguruma/testu.c n("\000(\000?\000<\000!\000a\000)\000b\000\000", "\000a\000b\000\000");
n 587 ext/mbstring/oniguruma/testu.c n("\000(\000?\000<\000!\000a\000|\000b\000c\000)\000z\000\000", "\000b\000c\000z\000\000");
n 604 ext/mbstring/oniguruma/testu.c n("\000(\000?\000:\000(\000?\000<\000x\000>\000a\000b\000c\000)\000|\000(\000?\000<\000x\000>\000e\000f\000g\000)\000)\000\134\000k\000<\000x\000>\000\000", "\000a\000b\000c\000e\000f\000g\000\000");
n 629 ext/mbstring/oniguruma/testu.c n("0D\000\000", "0B\000\000");
n 639 ext/mbstring/oniguruma/testu.c n("\000\134\000W\000\000", "0B\000\000");
n 649 ext/mbstring/oniguruma/testu.c n("\000[0j0k\000]\000\000", "0l\000\000");
n 651 ext/mbstring/oniguruma/testu.c n("\000[\000^0Q\000]\000\000", "0Q\000\000");
n 653 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000d\000]\000\000", "0u\000\000");
n 655 ext/mbstring/oniguruma/testu.c n("\000[\000\134\000s\000]\000\000", "0O\000\000");
n 659 ext/mbstring/oniguruma/testu.c n("\000\134\000w\233<\216\312\000\000", "\000 \233<\216\312\000\000");
n 665 ext/mbstring/oniguruma/testu.c n("\000.0D\000\000", "0D0H\000\000");
n 678 ext/mbstring/oniguruma/testu.c n("\000\134\000G0H\000\000", "0F0H0J\000\000");
n 679 ext/mbstring/oniguruma/testu.c n("0h0f\000\134\000G\000\000", "0h0f\000\000");
n 680 ext/mbstring/oniguruma/testu.c n("0~0\177\000\134\000A\000\000", "0~0\177\000\000");
n 681 ext/mbstring/oniguruma/testu.c n("0~\000\134\000A0\177\000\000", "0~0\177\000\000");
n 683 ext/mbstring/oniguruma/testu.c n("\000(\000?\000=0F\000)\000.\000\000", "0D\000\000");
n 685 ext/mbstring/oniguruma/testu.c n("\000(\000?\000!0h\000)0B\000\000", "0h\000\000");
n 688 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000:0D\000)\000\000", "0F\000\000");
n 698 ext/mbstring/oniguruma/testu.c n("\134q\000+\000\000", "\000\000");
n 716 ext/mbstring/oniguruma/testu.c n("0B\000|0D\000|0F0H\000|0J0K0M\000|0O\000|0Q0S0U\000|0W0Y0[\000|0]\000|0_0a\000|0d0f0h0j0k\000|0l0m\000\000", "0Y0[\000\000");
n 741 ext/mbstring/oniguruma/testu.c n("\000(\000?\000>0B\000|0B0D0H\000)0F\000\000", "0B0D0H0F\000\000");
n 754 ext/mbstring/oniguruma/testu.c n("0B\000+\000|0D\000+\000\000", "\000\000");
n 772 ext/mbstring/oniguruma/testu.c n("\000(\000?\000:0B\000+\000|\000\134\000A0D\000*\000)0F0F\000\000", "0B0D0F0F\000\000");
n 779 ext/mbstring/oniguruma/testu.c n("\000(\000?\000i\000:0B\000)\000|\000a\000\000", "\000A\000\000");
n 783 ext/mbstring/oniguruma/testu.c n("\000[\000^0B0D0F\000]\000+\000\000", "0B0D0F\000\000");
n 801 ext/mbstring/oniguruma/testu.c n("\000(\000?\000:\233<\216\312\000)\000{\0003\000,\000}\000\000", "\233<\216\312\233<\216\312\000\000");
n 841 ext/mbstring/oniguruma/testu.c n("\000(\000\134\000A0D0D\000)0F0F\000\000", "0\2230D0D0F0F\000\000");
n 843 ext/mbstring/oniguruma/testu.c n("\000(\000^0D0D\000)0F0F\000\000", "0\2230D0D0F0F\000\000");
n 845 ext/mbstring/oniguruma/testu.c n("0\2150\215\000(0\2130\213\000$\000)\000\000", "0\2150\2150\2130\2130\213\000\000");
n 847 ext/mbstring/oniguruma/testu.c n("\000(q!\000)\000\134\0001\000\000", "q!kf\000\000");
n 862 ext/mbstring/oniguruma/testu.c n("\000(\000\134\000w\000\134\000d\000\134\000s\000)\000\134\0001\000\000", "0B\0005\000 0B\0005\000\000");
n 867 ext/mbstring/oniguruma/testu.c n("\000(\000^0\200\000)\000\134\0001\000\000", "0\2010\2000\200\000\000");
n 868 ext/mbstring/oniguruma/testu.c n("\000(0B\000$\000)\000\134\0001\000\000", "0B0B\000\000");
n 869 ext/mbstring/oniguruma/testu.c n("\000(0B0D\000\134\000Z\000)\000\134\0001\000\000", "0B0D\000\000");
n 879 ext/mbstring/oniguruma/testu.c n("\000[\000[\000^0B\000]\000]\000\000", "0B\000\000");
n 880 ext/mbstring/oniguruma/testu.c n("\000[\000^\000[0B\000]\000]\000\000", "0B\000\000");
n 883 ext/mbstring/oniguruma/testu.c n("\000[\000[0K0M0O\000]\000&\000&0M0O\000]\000\000", "0K\000\000");
n 884 ext/mbstring/oniguruma/testu.c n("\000[\000[0K0M0O\000]\000&\000&0M0O\000]\000\000", "0Q\000\000");
n 886 ext/mbstring/oniguruma/testu.c n("\000[\000^0B\000-0\223\000&\000&0D\000-0\222\000&\000&0F\000-0\221\000]\000\000", "0\221\000\000");
n 888 ext/mbstring/oniguruma/testu.c n("\000[\000[\000^0B\000&\000&0B\000]\000&\000&0B\000-0\223\000]\000\000", "0B\000\000");
n 890 ext/mbstring/oniguruma/testu.c n("\000[\000[\000^0B\000-0\223\000&\000&0D0F0H0J\000]\000&\000&\000[\000^0F\000-0K\000]\000]\000\000", "0D\000\000");
n 893 ext/mbstring/oniguruma/testu.c n("\000[\000^\000[\000^0B0D0F\000]\000&\000&\000[\000^0F0H0J\000]\000]\000\000", "0K\000\000");
n 898 ext/mbstring/oniguruma/testu.c n("\000[\000^\000[\000^\000a\000-\000z0B0D0F\000]\000&\000&\000[\000^\000b\000c\000d\000e\000f\000g0F0H0J\000]\000g\000-\000w\000]\000\000", "\0002\000\000");
n 196 ext/mbstring/oniguruma/win32/testc.c n(".", "");
n 199 ext/mbstring/oniguruma/win32/testc.c n("\\W", "e");
n 203 ext/mbstring/oniguruma/win32/testc.c n("\\D", "4");
n 210 ext/mbstring/oniguruma/win32/testc.c n("[ab]", "c");
n 212 ext/mbstring/oniguruma/win32/testc.c n("[^a]", "a");
n 215 ext/mbstring/oniguruma/win32/testc.c n("[^]]", "]");
n 220 ext/mbstring/oniguruma/win32/testc.c n("[\\w]", " ");
n 223 ext/mbstring/oniguruma/win32/testc.c n("[\\d]", "e");
n 225 ext/mbstring/oniguruma/win32/testc.c n("[\\D]", "3");
n 227 ext/mbstring/oniguruma/win32/testc.c n("[\\s]", "a");
n 229 ext/mbstring/oniguruma/win32/testc.c n("[\\S]", " ");
n 231 ext/mbstring/oniguruma/win32/testc.c n("[\\w\\d]", " ");
n 236 ext/mbstring/oniguruma/win32/testc.c n("[[:upper]]", "A");
n 241 ext/mbstring/oniguruma/win32/testc.c n("[\\x6A-\\x6D]", "\x6E");
n 242 ext/mbstring/oniguruma/win32/testc.c n("^[0-9A-F]+ 0+ UNDEF ", "75F 00000000 SECT14A notype () External | _rb_apply");
n 248 ext/mbstring/oniguruma/win32/testc.c n("[[^a]]", "a");
n 249 ext/mbstring/oniguruma/win32/testc.c n("[^[a]]", "a");
n 251 ext/mbstring/oniguruma/win32/testc.c n("[[ab]&&bc]", "a");
n 252 ext/mbstring/oniguruma/win32/testc.c n("[[ab]&&bc]", "c");
n 254 ext/mbstring/oniguruma/win32/testc.c n("[^a-z&&b-y&&c-x]", "w");
n 256 ext/mbstring/oniguruma/win32/testc.c n("[[^a&&a]&&a-z]", "a");
n 258 ext/mbstring/oniguruma/win32/testc.c n("[[^a-z&&bcdef]&&[^c-g]]", "c");
n 261 ext/mbstring/oniguruma/win32/testc.c n("[^[^abc]&&[^cde]]", "f");
n 263 ext/mbstring/oniguruma/win32/testc.c n("[a\\-&&\\-a]", "&");
n 264 ext/mbstring/oniguruma/win32/testc.c n("\\wabc", " abc");
n 270 ext/mbstring/oniguruma/win32/testc.c n(".a", "ab");
n 275 ext/mbstring/oniguruma/win32/testc.c n("^\\w$", " ");
n 286 ext/mbstring/oniguruma/win32/testc.c n("\\Gz", "bza");
n 287 ext/mbstring/oniguruma/win32/testc.c n("az\\G", "az");
n 288 ext/mbstring/oniguruma/win32/testc.c n("az\\A", "az");
n 289 ext/mbstring/oniguruma/win32/testc.c n("a\\Az", "az");
n 294 ext/mbstring/oniguruma/win32/testc.c n("\\W", "_");
n 296 ext/mbstring/oniguruma/win32/testc.c n("(?=z).", "a");
n 298 ext/mbstring/oniguruma/win32/testc.c n("(?!z)a", "z");
n 302 ext/mbstring/oniguruma/win32/testc.c n("(?i:A)", "b");
n 306 ext/mbstring/oniguruma/win32/testc.c n("(?i:[f-m])", "e");
n 308 ext/mbstring/oniguruma/win32/testc.c n("(?i:[^a-z])", "A");
n 309 ext/mbstring/oniguruma/win32/testc.c n("(?i:[^a-z])", "a");
n 316 ext/mbstring/oniguruma/win32/testc.c n(".", "\n");
n 322 ext/mbstring/oniguruma/win32/testc.c n("(?i)(?-i)a", "A");
n 323 ext/mbstring/oniguruma/win32/testc.c n("(?i)(?-i:a)", "A");
n 331 ext/mbstring/oniguruma/win32/testc.c n("a+", "");
n 358 ext/mbstring/oniguruma/win32/testc.c n("a|b|cd|efg|h|ijk|lmn|o|pq|rstuvwx|yz", "mn");
n 370 ext/mbstring/oniguruma/win32/testc.c n("\\w|\\w", " ");
n 379 ext/mbstring/oniguruma/win32/testc.c n("(?>a|abd)c", "abdc");
n 390 ext/mbstring/oniguruma/win32/testc.c n("a+|b+", "");
n 406 ext/mbstring/oniguruma/win32/testc.c n("ax{2}*a", "0axxxa1");
n 407 ext/mbstring/oniguruma/win32/testc.c n("a.{0,2}a", "0aXXXa0");
n 408 ext/mbstring/oniguruma/win32/testc.c n("a.{0,2}?a", "0aXXXa0");
n 409 ext/mbstring/oniguruma/win32/testc.c n("a.{0,2}?a", "0aXXXXa0");
n 413 ext/mbstring/oniguruma/win32/testc.c n("(?:a+|\\Ab*)cc", "abcc");
n 420 ext/mbstring/oniguruma/win32/testc.c n("(?i:c)|a", "A");
n 424 ext/mbstring/oniguruma/win32/testc.c n("[^abc]+", "abc");
n 442 ext/mbstring/oniguruma/win32/testc.c n("(?:ab){3,}", "abab");
n 488 ext/mbstring/oniguruma/win32/testc.c n("(\\Abb)cc", "zbbcc");
n 490 ext/mbstring/oniguruma/win32/testc.c n("(^bb)cc", "zbbcc");
n 492 ext/mbstring/oniguruma/win32/testc.c n("cc(bb$)", "ccbbb");
n 493 ext/mbstring/oniguruma/win32/testc.c n("(\\1)", "");
n 494 ext/mbstring/oniguruma/win32/testc.c n("\\1(a)", "aa");
n 495 ext/mbstring/oniguruma/win32/testc.c n("(a(b)\\1)\\2+", "ababb");
n 496 ext/mbstring/oniguruma/win32/testc.c n("(?:(?:\\1|z)(a))+$", "zaa");
n 499 ext/mbstring/oniguruma/win32/testc.c n("(a)$|\\1", "az");
n 501 ext/mbstring/oniguruma/win32/testc.c n("(a)\\1", "ab");
n 515 ext/mbstring/oniguruma/win32/testc.c n("(\\w\\d\\s)\\1", "f5 f5");
n 520 ext/mbstring/oniguruma/win32/testc.c n("(^a)\\1", "baa");
n 521 ext/mbstring/oniguruma/win32/testc.c n("(a$)\\1", "aa");
n 522 ext/mbstring/oniguruma/win32/testc.c n("(ab\\Z)\\1", "ab");
n 528 ext/mbstring/oniguruma/win32/testc.c n("((?i:az))\\1", "Azaz");
n 530 ext/mbstring/oniguruma/win32/testc.c n("(?<=a)b", "bb");
n 537 ext/mbstring/oniguruma/win32/testc.c n("(?<!a)b", "ab");
n 539 ext/mbstring/oniguruma/win32/testc.c n("(?<!a|bc)z", "bcz");
n 556 ext/mbstring/oniguruma/win32/testc.c n("(?:(?<x>abc)|(?<x>efg))\\k<x>", "abcefg");
n 581 ext/mbstring/oniguruma/win32/testc.c n("‚¢", "‚ ");
n 591 ext/mbstring/oniguruma/win32/testc.c n("\\W", "‚ ");
n 601 ext/mbstring/oniguruma/win32/testc.c n("[‚È‚É]", "‚Ê");
n 603 ext/mbstring/oniguruma/win32/testc.c n("[^‚¯]", "‚¯");
n 605 ext/mbstring/oniguruma/win32/testc.c n("[\\d]", "‚Ó");
n 607 ext/mbstring/oniguruma/win32/testc.c n("[\\s]", "‚");
n 611 ext/mbstring/oniguruma/win32/testc.c n("\\w‹SŽÔ", " ‹SŽÔ");
n 617 ext/mbstring/oniguruma/win32/testc.c n(".‚¢", "‚¢‚¦");
n 630 ext/mbstring/oniguruma/win32/testc.c n("\\G‚¦", "‚¤‚¦‚¨");
n 631 ext/mbstring/oniguruma/win32/testc.c n("‚Æ‚Ä\\G", "‚Æ‚Ä");
n 632 ext/mbstring/oniguruma/win32/testc.c n("‚Ü‚Ý\\A", "‚Ü‚Ý");
n 633 ext/mbstring/oniguruma/win32/testc.c n("‚Ü\\A‚Ý", "‚Ü‚Ý");
n 635 ext/mbstring/oniguruma/win32/testc.c n("(?=‚¤).", "‚¢");
n 637 ext/mbstring/oniguruma/win32/testc.c n("(?!‚Æ)‚ ", "‚Æ");
n 640 ext/mbstring/oniguruma/win32/testc.c n("(?i:‚¢)", "‚¤");
n 650 ext/mbstring/oniguruma/win32/testc.c n("ŽR+", "");
n 668 ext/mbstring/oniguruma/win32/testc.c n("‚ |‚¢|‚¤‚¦|‚¨‚©‚«|‚|‚¯‚±‚³|‚µ‚·‚¹|‚»|‚½‚¿|‚‚ĂƂȂÉ|‚Ê‚Ë", "‚·‚¹");
n 693 ext/mbstring/oniguruma/win32/testc.c n("(?>‚ |‚ ‚¢‚¦)‚¤", "‚ ‚¢‚¦‚¤");
n 706 ext/mbstring/oniguruma/win32/testc.c n("‚ +|‚¢+", "");
n 724 ext/mbstring/oniguruma/win32/testc.c n("(?:‚ +|\\A‚¢*)‚¤‚¤", "‚ ‚¢‚¤‚¤");
n 731 ext/mbstring/oniguruma/win32/testc.c n("(?i:‚ )|a", "A");
n 735 ext/mbstring/oniguruma/win32/testc.c n("[^‚ ‚¢‚¤]+", "‚ ‚¢‚¤");
n 753 ext/mbstring/oniguruma/win32/testc.c n("(?:‹SŽÔ){3,}", "‹SŽÔ‹SŽÔ");
n 793 ext/mbstring/oniguruma/win32/testc.c n("(\\A‚¢‚¢)‚¤‚¤", "‚ñ‚¢‚¢‚¤‚¤");
n 795 ext/mbstring/oniguruma/win32/testc.c n("(^‚¢‚¢)‚¤‚¤", "‚ñ‚¢‚¢‚¤‚¤");
n 797 ext/mbstring/oniguruma/win32/testc.c n("‚ë‚ë(‚é‚é$)", "‚ë‚ë‚é‚é‚é");
n 799 ext/mbstring/oniguruma/win32/testc.c n("(–³)\\1", "–³•");
n 814 ext/mbstring/oniguruma/win32/testc.c n("(\\w\\d\\s)\\1", "‚ 5 ‚ 5");
n 819 ext/mbstring/oniguruma/win32/testc.c n("(^‚Þ)\\1", "‚ß‚Þ‚Þ");
n 820 ext/mbstring/oniguruma/win32/testc.c n("(‚ $)\\1", "‚ ‚ ");
n 821 ext/mbstring/oniguruma/win32/testc.c n("(‚ ‚¢\\Z)\\1", "‚ ‚¢");
n 831 ext/mbstring/oniguruma/win32/testc.c n("[[^‚ ]]", "‚ ");
n 832 ext/mbstring/oniguruma/win32/testc.c n("[^[‚ ]]", "‚ ");
n 835 ext/mbstring/oniguruma/win32/testc.c n("[[‚©‚«‚]&&‚«‚]", "‚©");
n 836 ext/mbstring/oniguruma/win32/testc.c n("[[‚©‚«‚]&&‚«‚]", "‚¯");
n 838 ext/mbstring/oniguruma/win32/testc.c n("[^‚ -‚ñ&&‚¢-‚ð&&‚¤-‚ï]", "‚ï");
n 840 ext/mbstring/oniguruma/win32/testc.c n("[[^‚ &&‚ ]&&‚ -‚ñ]", "‚ ");
n 842 ext/mbstring/oniguruma/win32/testc.c n("[[^‚ -‚ñ&&‚¢‚¤‚¦‚¨]&&[^‚¤-‚©]]", "‚¢");
n 845 ext/mbstring/oniguruma/win32/testc.c n("[^[^‚ ‚¢‚¤]&&[^‚¤‚¦‚¨]]", "‚©");
n 850 ext/mbstring/oniguruma/win32/testc.c n("[^[^a-z‚ ‚¢‚¤]&&[^bcdefg‚¤‚¦‚¨]g-w]", "2");
n 582 ext/mbstring/php_mbregex.c int n;
n 589 ext/mbstring/php_mbregex.c n = 0;
n 590 ext/mbstring/php_mbregex.c while(n < narg) {
n 591 ext/mbstring/php_mbregex.c c = parg[n++];
n 810 ext/mbstring/php_mbregex.c int i, err, eval, n;
n 919 ext/mbstring/php_mbregex.c n = -1;
n 922 ext/mbstring/php_mbregex.c n = p[1] - '0';
n 924 ext/mbstring/php_mbregex.c if (n >= 0 && n < regs->num_regs) {
n 925 ext/mbstring/php_mbregex.c if (regs->beg[n] >= 0 && regs->beg[n] < regs->end[n] && regs->end[n] <= string_len) {
n 926 ext/mbstring/php_mbregex.c smart_str_appendl(pbuf, string + regs->beg[n], regs->end[n] - regs->beg[n]);
n 989 ext/mbstring/php_mbregex.c n = regs->end[0];
n 990 ext/mbstring/php_mbregex.c if ((pos - (OnigUChar *)string) < n) {
n 991 ext/mbstring/php_mbregex.c pos = (OnigUChar *)string + n;
n 1061 ext/mbstring/php_mbregex.c int n, err;
n 1119 ext/mbstring/php_mbregex.c n = ((OnigUChar *)(string + string_len) - chunk_pos);
n 1120 ext/mbstring/php_mbregex.c if (n > 0) {
n 1121 ext/mbstring/php_mbregex.c add_next_index_stringl(return_value, (char *)chunk_pos, n, 1);
n 1183 ext/mbstring/php_mbregex.c int n, i, err, pos, len, beg, end;
n 1252 ext/mbstring/php_mbregex.c n = MBREX(search_regs)->num_regs;
n 1253 ext/mbstring/php_mbregex.c for (i = 0; i < n; i++) {
n 1365 ext/mbstring/php_mbregex.c int n, i, len, beg, end;
n 1373 ext/mbstring/php_mbregex.c n = MBREX(search_regs)->num_regs;
n 1374 ext/mbstring/php_mbregex.c for (i = 0; i < n; i++) {
n 71 ext/mbstring/php_unicode.c if ((l = _ucprop_offsets[n]) == 0xffff)
n 78 ext/mbstring/php_unicode.c for (m = 1; n + m < _ucprop_size && _ucprop_offsets[n + m] == 0xffff; m++)
n 81 ext/mbstring/php_unicode.c r = _ucprop_offsets[n + m] - 1;
n 742 ext/mbstring/ucgendat/ucgendat.c ac_uint4 n;
n 747 ext/mbstring/ucgendat/ucgendat.c for (n = 0; n < nums_used; n++) {
n 748 ext/mbstring/ucgendat/ucgendat.c if (nums[n].numerator == num && nums[n].denominator == denom)
n 749 ext/mbstring/ucgendat/ucgendat.c return n << 1;
n 761 ext/mbstring/ucgendat/ucgendat.c n = nums_used++;
n 762 ext/mbstring/ucgendat/ucgendat.c nums[n].numerator = num;
n 763 ext/mbstring/ucgendat/ucgendat.c nums[n].denominator = denom;
n 765 ext/mbstring/ucgendat/ucgendat.c return n << 1;
n 1378 ext/mcrypt/mcrypt.c int n = 0;
n 1400 ext/mcrypt/mcrypt.c n = size;
n 1412 ext/mcrypt/mcrypt.c n = read(fd, iv + read_bytes, size - read_bytes);
n 1413 ext/mcrypt/mcrypt.c if (n < 0) {
n 1416 ext/mcrypt/mcrypt.c read_bytes += n;
n 1418 ext/mcrypt/mcrypt.c n = read_bytes;
n 1420 ext/mcrypt/mcrypt.c if (n < size) {
n 1427 ext/mcrypt/mcrypt.c n = size;
n 1432 ext/mcrypt/mcrypt.c RETURN_STRINGL(iv, n, 0);
n 63 ext/mcrypt/mcrypt_filter.c int chunklen = bucket->buflen + data->block_used, n;
n 72 ext/mcrypt/mcrypt_filter.c for(n=0; (n + data->blocksize) <= chunklen; n += data->blocksize) {
n 75 ext/mcrypt/mcrypt_filter.c mcrypt_generic(data->module, outchunk + n, data->blocksize);
n 77 ext/mcrypt/mcrypt_filter.c mdecrypt_generic(data->module, outchunk + n, data->blocksize);
n 80 ext/mcrypt/mcrypt_filter.c data->block_used = chunklen - n;
n 81 ext/mcrypt/mcrypt_filter.c memcpy(data->block_buffer, outchunk + n, data->block_used);
n 83 ext/mcrypt/mcrypt_filter.c newbucket = php_stream_bucket_new(stream, outchunk, n, 1, data->persistent TSRMLS_CC);
n 42 ext/mysqli/mysqli_warning.c MYSQLI_WARNING *n;
n 45 ext/mysqli/mysqli_warning.c n = w;
n 49 ext/mysqli/mysqli_warning.c efree(n);
n 238 ext/mysqlnd/mysqlnd.h #define mysqlnd_stmt_bind_one_param(stmt,n,z,t) (stmt)->m->bind_one_parameter((stmt), (n), (z), (t) TSRMLS_CC)
n 304 ext/mysqlnd/mysqlnd_enum_n_def.h #define IS_PRI_KEY(n) ((n) & PRI_KEY_FLAG)
n 305 ext/mysqlnd/mysqlnd_enum_n_def.h #define IS_NOT_NULL(n) ((n) & NOT_NULL_FLAG)
n 306 ext/mysqlnd/mysqlnd_enum_n_def.h #define IS_BLOB(n) ((n) & BLOB_FLAG)
n 41 ext/mysqlnd/mysqlnd_ext_plugin.h #define mysqlnd_plugin_get_plugin_net_data(n, p_id) _mysqlnd_plugin_get_plugin_net_data((n), (p_id) TSRMLS_CC)
n 64 ext/mysqlnd/mysqlnd_libmysql_compat.h #define mysql_kill(r,n) mysqlnd_kill((r), (n))
n 67 ext/odbc/php_odbc.c #define SAFE_SQL_NTS(n) ((SQLSMALLINT) ((n)?(SQL_NTS):0))
n 500 ext/opcache/Optimizer/block_pass.c zend_block_source *n = cs->next;
n 502 ext/opcache/Optimizer/block_pass.c cs = n;
n 2084 ext/opcache/Optimizer/block_pass.c zend_block_source *n = cs->next;
n 2086 ext/opcache/Optimizer/block_pass.c cs = n;
n 1236 ext/opcache/ZendAccelerator.c int n = 1;
n 1241 ext/opcache/ZendAccelerator.c mask |= n;
n 1243 ext/opcache/ZendAccelerator.c n += n;
n 1261 ext/opcache/ZendAccelerator.c int n = 1;
n 1264 ext/opcache/ZendAccelerator.c if (mask & n) {
n 1267 ext/opcache/ZendAccelerator.c n += n;
n 362 ext/opcache/ZendAccelerator.h (IS_INTERNED(s) ? (s) : estrndup(s, n))
n 381 ext/opcache/ZendAccelerator.h # define interned_estrndup(s, n) estrndup(s, n)
n 3080 ext/openssl/openssl.c OPENSSL_PKEY_SET_BN(Z_ARRVAL_PP(data), rsa, n);
n 3088 ext/openssl/openssl.c if (rsa->n && rsa->d) {
n 3381 ext/openssl/openssl.c OPENSSL_PKEY_GET_BN(rsa, n);
n 249 ext/openssl/xp_ssl.c int n;
n 280 ext/openssl/xp_ssl.c n = php_pollfd_for_ms(sslsock->s.socket, POLLOUT, 500);
n 281 ext/openssl/xp_ssl.c } while (n == -1 && php_socket_errno() == EINTR);
n 439 ext/openssl/xp_ssl.c int n, retry = 1;
n 478 ext/openssl/xp_ssl.c n = SSL_connect(sslsock->ssl_handle);
n 480 ext/openssl/xp_ssl.c n = SSL_accept(sslsock->ssl_handle);
n 500 ext/openssl/xp_ssl.c if (n <= 0) {
n 502 ext/openssl/xp_ssl.c retry = handle_ssl_error(stream, n, blocked TSRMLS_CC);
n 506 ext/openssl/xp_ssl.c int err = SSL_get_error(sslsock->ssl_handle, n);
n 529 ext/openssl/xp_ssl.c if (n == 1) {
n 536 ext/openssl/xp_ssl.c n = -1;
n 601 ext/openssl/xp_ssl.c n = errno == EAGAIN ? 0 : -1;
n 604 ext/openssl/xp_ssl.c return n;
n 719 ext/openssl/xp_ssl.c int n;
n 722 ext/openssl/xp_ssl.c n = SSL_peek(sslsock->ssl_handle, &buf, sizeof(buf));
n 723 ext/openssl/xp_ssl.c if (n <= 0) {
n 724 ext/openssl/xp_ssl.c int err = SSL_get_error(sslsock->ssl_handle, n);
n 668 ext/pcre/pcrelib/pcre_compile.c for (; n > 0; n--)
n 2095 ext/pcre/pcrelib/pcre_compile.c int n = (int)GET2(code, 1+LINK_SIZE);
n 2096 ext/pcre/pcrelib/pcre_compile.c if (n == number) return (pcre_uchar *)code;
n 3613 ext/pcre/pcrelib/pcre_compile.c int n = 0;
n 3616 ext/pcre/pcrelib/pcre_compile.c while(p[n+1] == p[0] + n + 1) n++;
n 3617 ext/pcre/pcrelib/pcre_compile.c n8 += add_to_class(classbits, uchardptr, options, cd, p[0], p[n]);
n 3619 ext/pcre/pcrelib/pcre_compile.c p += n + 1;
n 6015 ext/pcre/pcrelib/pcre_compile.c int n = 0;
n 6018 ext/pcre/pcrelib/pcre_compile.c n = n * 10 + *ptr++ - CHAR_0;
n 6024 ext/pcre/pcrelib/pcre_compile.c if (n > 255)
n 6029 ext/pcre/pcrelib/pcre_compile.c *code++ = n;
n 7454 ext/pcre/pcrelib/pcre_compile.c int n = GET2(scode, 1+LINK_SIZE);
n 7455 ext/pcre/pcrelib/pcre_compile.c int new_map = bracket_map | ((n < 32)? (1 << n) : 1);
n 7572 ext/pcre/pcrelib/pcre_compile.c int n = GET2(scode, 1+LINK_SIZE);
n 7573 ext/pcre/pcrelib/pcre_compile.c int new_map = bracket_map | ((n < 32)? (1 << n) : 1);
n 297 ext/pcre/pcrelib/pcre_get.c int n = GET2(entry, 0);
n 298 ext/pcre/pcrelib/pcre_get.c if (ovector[n*2] >= 0) return n;
n 405 ext/pcre/pcrelib/pcre_get.c int n = get_first_set(code, stringname, ovector);
n 406 ext/pcre/pcrelib/pcre_get.c if (n <= 0) return n;
n 408 ext/pcre/pcrelib/pcre_get.c return pcre_copy_substring(subject, ovector, stringcount, n, buffer, size);
n 410 ext/pcre/pcrelib/pcre_get.c return pcre16_copy_substring(subject, ovector, stringcount, n, buffer, size);
n 412 ext/pcre/pcrelib/pcre_get.c return pcre32_copy_substring(subject, ovector, stringcount, n, buffer, size);
n 622 ext/pcre/pcrelib/pcre_get.c int n = get_first_set(code, stringname, ovector);
n 623 ext/pcre/pcrelib/pcre_get.c if (n <= 0) return n;
n 625 ext/pcre/pcrelib/pcre_get.c return pcre_get_substring(subject, ovector, stringcount, n, stringptr);
n 627 ext/pcre/pcrelib/pcre_get.c return pcre16_get_substring(subject, ovector, stringcount, n, stringptr);
n 629 ext/pcre/pcrelib/pcre_get.c return pcre32_get_substring(subject, ovector, stringcount, n, stringptr);
n 365 ext/pcre/pcrelib/pcre_internal.h #define memcmp(s,c,n) _memcmp(s,c,n)
n 366 ext/pcre/pcrelib/pcre_internal.h #define memcpy(d,s,n) _memcpy(d,s,n)
n 367 ext/pcre/pcrelib/pcre_internal.h #define memmove(d,s,n) _memmove(d,s,n)
n 368 ext/pcre/pcrelib/pcre_internal.h #define memset(s,c,n) _memset(s,c,n)
n 389 ext/pcre/pcrelib/pcre_internal.h dest += n;
n 390 ext/pcre/pcrelib/pcre_internal.h src += n;
n 391 ext/pcre/pcrelib/pcre_internal.h for (i = 0; i < n; ++i) *(--dest) = *(--src);
n 396 ext/pcre/pcrelib/pcre_internal.h for (i = 0; i < n; ++i) *dest++ = *src++;
n 397 ext/pcre/pcrelib/pcre_internal.h return (void *)(dest - n);
n 424 ext/pcre/pcrelib/pcre_internal.h (a[n] = (d) >> 8), \
n 425 ext/pcre/pcrelib/pcre_internal.h (a[(n)+1] = (d) & 255)
n 428 ext/pcre/pcrelib/pcre_internal.h (((a)[n] << 8) | (a)[(n)+1])
n 436 ext/pcre/pcrelib/pcre_internal.h (a[n] = (d) >> 16), \
n 437 ext/pcre/pcrelib/pcre_internal.h (a[(n)+1] = (d) >> 8), \
n 438 ext/pcre/pcrelib/pcre_internal.h (a[(n)+2] = (d) & 255)
n 441 ext/pcre/pcrelib/pcre_internal.h (((a)[n] << 16) | ((a)[(n)+1] << 8) | (a)[(n)+2])
n 449 ext/pcre/pcrelib/pcre_internal.h (a[n] = (d) >> 24), \
n 450 ext/pcre/pcrelib/pcre_internal.h (a[(n)+1] = (d) >> 16), \
n 451 ext/pcre/pcrelib/pcre_internal.h (a[(n)+2] = (d) >> 8), \
n 452 ext/pcre/pcrelib/pcre_internal.h (a[(n)+3] = (d) & 255)
n 455 ext/pcre/pcrelib/pcre_internal.h (((a)[n] << 24) | ((a)[(n)+1] << 16) | ((a)[(n)+2] << 8) | (a)[(n)+3])
n 473 ext/pcre/pcrelib/pcre_internal.h (a[n] = (d))
n 476 ext/pcre/pcrelib/pcre_internal.h (a[n])
n 487 ext/pcre/pcrelib/pcre_internal.h (a[n] = (d) >> 16), \
n 488 ext/pcre/pcrelib/pcre_internal.h (a[(n)+1] = (d) & 65535)
n 491 ext/pcre/pcrelib/pcre_internal.h (((a)[n] << 16) | (a)[(n)+1])
n 508 ext/pcre/pcrelib/pcre_internal.h (a[n] = (d))
n 511 ext/pcre/pcrelib/pcre_internal.h (a[n])
n 522 ext/pcre/pcrelib/pcre_internal.h #define PUTINC(a,n,d) PUT(a,n,d), a += LINK_SIZE
n 534 ext/pcre/pcrelib/pcre_internal.h a[n] = (d) >> 8; \
n 535 ext/pcre/pcrelib/pcre_internal.h a[(n)+1] = (d) & 255
n 542 ext/pcre/pcrelib/pcre_internal.h (unsigned int)(((a)[n] << 8) | (a)[(n)+1])
n 549 ext/pcre/pcrelib/pcre_internal.h a[n] = d
n 552 ext/pcre/pcrelib/pcre_internal.h a[n]
n 559 ext/pcre/pcrelib/pcre_internal.h a[n] = d
n 562 ext/pcre/pcrelib/pcre_internal.h a[n]
n 568 ext/pcre/pcrelib/pcre_internal.h #define PUT2INC(a,n,d) PUT2(a,n,d), a += IMM2_SIZE
n 219 ext/pcre/pcrelib/pcredemo.c int n = (tabptr[0] << 8) | tabptr[1];
n 220 ext/pcre/pcrelib/pcredemo.c printf("(%d) %*s: %.*s\n", n, name_entry_size - 3, tabptr + 2,
n 221 ext/pcre/pcrelib/pcredemo.c ovector[2*n+1] - ovector[2*n], subject + ovector[2*n]);
n 393 ext/pcre/pcrelib/pcredemo.c int n = (tabptr[0] << 8) | tabptr[1];
n 394 ext/pcre/pcrelib/pcredemo.c printf("(%d) %*s: %.*s\n", n, name_entry_size - 3, tabptr + 2,
n 395 ext/pcre/pcrelib/pcredemo.c ovector[2*n+1] - ovector[2*n], subject + ovector[2*n]);
n 329 ext/pdo_firebird/firebird_statement.c ISC_INT64 n, f = scales[-var->sqlscale];
n 333 ext/pdo_firebird/firebird_statement.c n = *(short*)var->sqldata;
n 336 ext/pdo_firebird/firebird_statement.c n = *(ISC_LONG*)var->sqldata;
n 339 ext/pdo_firebird/firebird_statement.c n = *(ISC_INT64*)var->sqldata;
n 344 ext/pdo_firebird/firebird_statement.c if (n >= 0) {
n 346 ext/pdo_firebird/firebird_statement.c n / f, -var->sqlscale, n % f);
n 347 ext/pdo_firebird/firebird_statement.c } else if (n <= -f) {
n 349 ext/pdo_firebird/firebird_statement.c n / f, -var->sqlscale, -n % f);
n 351 ext/pdo_firebird/firebird_statement.c *len = slprintf(*ptr, CHAR_BUF_LEN, "-0.%0*" LL_MASK "d", -var->sqlscale, -n % f);
n 383 ext/pdo_oci/oci_statement.c size_t n;
n 392 ext/pdo_oci/oci_statement.c n = php_stream_read(stm, buf, sizeof(buf));
n 393 ext/pdo_oci/oci_statement.c if ((int)n <= 0) {
n 398 ext/pdo_oci/oci_statement.c amt = n;
n 400 ext/pdo_oci/oci_statement.c &amt, offset, consume, n,
n 404 ext/pdo_oci/oci_statement.c n -= amt;
n 406 ext/pdo_oci/oci_statement.c } while (n);
n 413 ext/pdo_oci/oci_statement.c n = Z_STRLEN_P(param->parameter);
n 414 ext/pdo_oci/oci_statement.c if (n) {
n 416 ext/pdo_oci/oci_statement.c while (n) {
n 417 ext/pdo_oci/oci_statement.c amt = n;
n 419 ext/pdo_oci/oci_statement.c &amt, offset, consume, n,
n 423 ext/pdo_oci/oci_statement.c n -= amt;
n 463 ext/phar/func_interceptors.c int groups, n, i;
n 469 ext/phar/func_interceptors.c n=getgroups(groups, gids);
n 470 ext/phar/func_interceptors.c for(i=0;i<n;++i){
n 2076 ext/phar/phar.c for(n--; n >= 0; --n) {
n 2077 ext/phar/phar.c if (element[n] != '.') {
n 73 ext/session/mod_files.c int n;
n 83 ext/session/mod_files.c n = data->basedir_len;
n 84 ext/session/mod_files.c buf[n++] = PHP_DIR_SEPARATOR;
n 86 ext/session/mod_files.c buf[n++] = *p++;
n 87 ext/session/mod_files.c buf[n++] = PHP_DIR_SEPARATOR;
n 89 ext/session/mod_files.c memcpy(buf + n, FILE_PREFIX, sizeof(FILE_PREFIX) - 1);
n 90 ext/session/mod_files.c n += sizeof(FILE_PREFIX) - 1;
n 91 ext/session/mod_files.c memcpy(buf + n, key, key_len);
n 92 ext/session/mod_files.c n += key_len;
n 93 ext/session/mod_files.c buf[n] = '\0';
n 325 ext/session/mod_files.c long n;
n 366 ext/session/mod_files.c n = pread(data->fd, *val, sbuf.st_size, 0);
n 369 ext/session/mod_files.c n = read(data->fd, *val, sbuf.st_size);
n 372 ext/session/mod_files.c if (n != sbuf.st_size) {
n 373 ext/session/mod_files.c if (n == -1) {
n 387 ext/session/mod_files.c long n;
n 402 ext/session/mod_files.c n = pwrite(data->fd, val, vallen, 0);
n 405 ext/session/mod_files.c n = write(data->fd, val, vallen);
n 408 ext/session/mod_files.c if (n != vallen) {
n 409 ext/session/mod_files.c if (n == -1) {
n 371 ext/session/session.c int n;
n 375 ext/session/session.c n = read(fd, rbuf, MIN(to_read, sizeof(rbuf)));
n 376 ext/session/session.c if (n <= 0) break;
n 380 ext/session/session.c PHP_MD5Update(&md5_context, rbuf, n);
n 383 ext/session/session.c PHP_SHA1Update(&sha1_context, rbuf, n);
n 387 ext/session/session.c PS(hash_ops)->hash_update(hash_context, rbuf, n);
n 391 ext/session/session.c to_read -= n;
n 1133 ext/session/session.c int n;
n 1142 ext/session/session.c n = slprintf(buf, sizeof(buf), "%s, %02d %s %d %02d:%02d:%02d GMT", /* SAFE */
n 1147 ext/session/session.c memcpy(ubuf, buf, n);
n 1148 ext/session/session.c ubuf[n] = '\0';
n 1203 ext/simplexml/simplexml.c *n = 0;
n 1132 ext/snmp/snmp.c int n;
n 1180 ext/snmp/snmp.c if ((n = php_network_getaddresses(host_ptr, SOCK_DGRAM, &psal, NULL TSRMLS_CC)) == 0) { /* some resolver error */
n 1188 ext/snmp/snmp.c while (n-- > 0) {
n 692 ext/soap/php_encoding.c int n = xmlCharEncOutFunc(SOAP_GLOBAL(encoding), out, in);
n 694 ext/soap/php_encoding.c if (n >= 0) {
n 726 ext/soap/php_encoding.c int n = xmlCharEncOutFunc(SOAP_GLOBAL(encoding), out, in);
n 728 ext/soap/php_encoding.c if (n >= 0) {
n 760 ext/soap/php_encoding.c int n = xmlCharEncOutFunc(SOAP_GLOBAL(encoding), out, in);
n 762 ext/soap/php_encoding.c if (n >= 0) {
n 888 ext/soap/php_encoding.c int n = xmlCharEncInFunc(SOAP_GLOBAL(encoding), out, in);
n 890 ext/soap/php_encoding.c if (n >= 0) {
n 893 ext/soap/php_encoding.c new_len = n;
n 383 ext/soap/php_http.c int n;
n 394 ext/soap/php_http.c n = 2;
n 398 ext/soap/php_http.c n = 3;
n 403 ext/soap/php_http.c if (call_user_function(CG(function_table), (zval**)NULL, &func, &retval, n, params TSRMLS_CC) == SUCCESS &&
n 810 ext/soap/php_http.c int i, n;
n 813 ext/soap/php_http.c n = zend_hash_num_elements(Z_ARRVAL_PP(cookies));
n 814 ext/soap/php_http.c if (n > 0) {
n 817 ext/soap/php_http.c for (i = 0; i < n; i++) {
n 734 ext/soap/php_sdl.c int i,n;
n 751 ext/soap/php_sdl.c n = zend_hash_num_elements(&ctx.services);
n 752 ext/soap/php_sdl.c if (n > 0) {
n 754 ext/soap/php_sdl.c for (i = 0; i < n; i++) {
n 820 ext/soap/php_sdl.c if (has_soap_port || trav->next || i < n-1) {
n 1188 ext/soap/php_sdl.c #define WSDL_CACHE_GET_N(ret,n,buf) memcpy(ret,*buf,n); *buf += n;
n 1189 ext/soap/php_sdl.c #define WSDL_CACHE_SKIP(n,buf) *buf += n;
n 1196 ext/soap/php_sdl.c #define WSDL_CACHE_PUT_N(val,n,buf) smart_str_appendl(buf,(char*)val,n);
n 1453 ext/soap/php_sdl.c int i, j, n;
n 1478 ext/soap/php_sdl.c WSDL_CACHE_GET_INT(n, in);
n 1479 ext/soap/php_sdl.c tmp->encode = encoders[n];
n 1480 ext/soap/php_sdl.c WSDL_CACHE_GET_INT(n, in);
n 1481 ext/soap/php_sdl.c tmp->element = types[n];
n 1499 ext/soap/php_sdl.c WSDL_CACHE_GET_INT(n, in);
n 1500 ext/soap/php_sdl.c tmp2->encode = encoders[n];
n 1501 ext/soap/php_sdl.c WSDL_CACHE_GET_INT(n, in);
n 1502 ext/soap/php_sdl.c tmp2->element = types[n];
n 1512 ext/soap/php_sdl.c int i, n;
n 1524 ext/soap/php_sdl.c WSDL_CACHE_GET_INT(n, in);
n 1525 ext/soap/php_sdl.c param->encode = encoders[n];
n 1526 ext/soap/php_sdl.c WSDL_CACHE_GET_INT(n, in);
n 1527 ext/soap/php_sdl.c param->element = types[n];
n 47 ext/soap/php_xml.h #define FOREACHATTRNODE(n,c,i) FOREACHATTRNODEEX(n,c,NULL,i)
n 50 ext/soap/php_xml.h if (n == NULL) { \
n 54 ext/soap/php_xml.h i = get_attribute_ex(n,c,ns); \
n 56 ext/soap/php_xml.h i = n; \
n 59 ext/soap/php_xml.h n = i;
n 61 ext/soap/php_xml.h #define FOREACHNODE(n,c,i) FOREACHNODEEX(n,c,NULL,i)
n 64 ext/soap/php_xml.h if (n == NULL) { \
n 68 ext/soap/php_xml.h i = get_node_ex(n,c,NULL); \
n 70 ext/soap/php_xml.h i = n; \
n 73 ext/soap/php_xml.h n = i;
n 77 ext/soap/php_xml.h } while ((n = n->next));
n 4286 ext/soap/soap.c int n = zend_hash_num_elements(function->requestParameters);
n 4288 ext/soap/soap.c if (n > arg_count) {
n 4289 ext/soap/soap.c for (i = arg_count; i < n; i++) {
n 277 ext/sockets/sendrecvmsg.c n = 0;
n 281 ext/sockets/sendrecvmsg.c &level, &type, &n) == FAILURE) {
n 287 ext/sockets/sendrecvmsg.c LONG_CHECK_VALID_INT(n);
n 289 ext/sockets/sendrecvmsg.c if (n < 0) {
n 302 ext/sockets/sendrecvmsg.c if (entry->var_el_size > 0 && n > (LONG_MAX - (long)entry->size -
n 306 ext/sockets/sendrecvmsg.c "third argument (%ld) is too large", n);
n 310 ext/sockets/sendrecvmsg.c RETURN_LONG((long)CMSG_SPACE(entry->size + n * entry->var_el_size));
n 495 ext/sockets/sockets.c size_t n = 0;
n 513 ext/sockets/sockets.c while (*t != '\n' && *t != '\r' && n < maxlen) {
n 516 ext/sockets/sockets.c n++;
n 520 ext/sockets/sockets.c return n;
n 532 ext/sockets/sockets.c if (n < maxlen) {
n 543 ext/sockets/sockets.c if (n < maxlen) {
n 544 ext/sockets/sockets.c n++;
n 552 ext/sockets/sockets.c return n;
n 157 ext/spl/spl_fixedarray.c *n = intern->array->size;
n 160 ext/spl/spl_fixedarray.c *n = 0;
n 377 ext/spl/spl_observer.c *n = 0;
n 1240 ext/sqlite3/libsqlite/sqlite3.c int (*xShmLock)(sqlite3_file*, int offset, int n, int flags);
n 10124 ext/sqlite3/libsqlite/sqlite3.c unsigned int n; /* Number of characters in this token */
n 12444 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 12446 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3Strlen30(zOptName);
n 12451 ext/sqlite3/libsqlite/sqlite3.c if( (sqlite3StrNICmp(zOptName, azCompileOpt[i], n)==0)
n 12452 ext/sqlite3/libsqlite/sqlite3.c && ( (azCompileOpt[i][n]==0) || (azCompileOpt[i][n]=='=') ) ) return 1;
n 12636 ext/sqlite3/libsqlite/sqlite3.c int n; /* Number of characters in string value, excluding '\0' */
n 13662 ext/sqlite3/libsqlite/sqlite3.c int n;
n 13666 ext/sqlite3/libsqlite/sqlite3.c for(n=0; n<ArraySize(zBuf)-1 && zMod[n]; n++){
n 13667 ext/sqlite3/libsqlite/sqlite3.c z[n] = (char)sqlite3UpperToLower[(u8)zMod[n]];
n 13669 ext/sqlite3/libsqlite/sqlite3.c z[n] = 0;
n 13722 ext/sqlite3/libsqlite/sqlite3.c && (n=(int)r)==r && n>=0 && r<7 ){
n 13729 ext/sqlite3/libsqlite/sqlite3.c if( Z>n ) Z -= 7;
n 13730 ext/sqlite3/libsqlite/sqlite3.c p->iJD += (n - Z)*86400000;
n 13777 ext/sqlite3/libsqlite/sqlite3.c for(n=1; z[n] && z[n]!=':' && !sqlite3Isspace(z[n]); n++){}
n 13778 ext/sqlite3/libsqlite/sqlite3.c if( !sqlite3AtoF(z, &r, n, SQLITE_UTF8) ){
n 13782 ext/sqlite3/libsqlite/sqlite3.c if( z[n]==':' ){
n 13805 ext/sqlite3/libsqlite/sqlite3.c z += n;
n 13807 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3Strlen30(z);
n 13808 ext/sqlite3/libsqlite/sqlite3.c if( n>10 || n<3 ) break;
n 13809 ext/sqlite3/libsqlite/sqlite3.c if( z[n-1]=='s' ){ z[n-1] = 0; n--; }
n 13813 ext/sqlite3/libsqlite/sqlite3.c if( n==3 && strcmp(z,"day")==0 ){
n 13815 ext/sqlite3/libsqlite/sqlite3.c }else if( n==4 && strcmp(z,"hour")==0 ){
n 13817 ext/sqlite3/libsqlite/sqlite3.c }else if( n==6 && strcmp(z,"minute")==0 ){
n 13819 ext/sqlite3/libsqlite/sqlite3.c }else if( n==6 && strcmp(z,"second")==0 ){
n 13821 ext/sqlite3/libsqlite/sqlite3.c }else if( n==5 && strcmp(z,"month")==0 ){
n 13834 ext/sqlite3/libsqlite/sqlite3.c }else if( n==4 && strcmp(z,"year")==0 ){
n 14000 ext/sqlite3/libsqlite/sqlite3.c u64 n;
n 14008 ext/sqlite3/libsqlite/sqlite3.c for(i=0, n=1; zFmt[i]; i++, n++){
n 14017 ext/sqlite3/libsqlite/sqlite3.c n++;
n 14023 ext/sqlite3/libsqlite/sqlite3.c n += 8;
n 14026 ext/sqlite3/libsqlite/sqlite3.c n += 3;
n 14029 ext/sqlite3/libsqlite/sqlite3.c n += 8;
n 14033 ext/sqlite3/libsqlite/sqlite3.c n += 50;
n 14041 ext/sqlite3/libsqlite/sqlite3.c testcase( n==sizeof(zBuf)-1 );
n 14042 ext/sqlite3/libsqlite/sqlite3.c testcase( n==sizeof(zBuf) );
n 14043 ext/sqlite3/libsqlite/sqlite3.c testcase( n==(u64)db->aLimit[SQLITE_LIMIT_LENGTH]+1 );
n 14044 ext/sqlite3/libsqlite/sqlite3.c testcase( n==(u64)db->aLimit[SQLITE_LIMIT_LENGTH] );
n 14045 ext/sqlite3/libsqlite/sqlite3.c if( n<sizeof(zBuf) ){
n 14047 ext/sqlite3/libsqlite/sqlite3.c }else if( n>(u64)db->aLimit[SQLITE_LIMIT_LENGTH] ){
n 14051 ext/sqlite3/libsqlite/sqlite3.c z = sqlite3DbMallocRaw(db, (int)n);
n 14352 ext/sqlite3/libsqlite/sqlite3.c return id->pMethods->xShmLock(id, offset, n, flags);
n 14705 ext/sqlite3/libsqlite/sqlite3.c static int sqlite3MemRoundup(int n){ return n; }
n 14842 ext/sqlite3/libsqlite/sqlite3.c return ROUND8(n);
n 15093 ext/sqlite3/libsqlite/sqlite3.c return ROUND8(n);
n 15336 ext/sqlite3/libsqlite/sqlite3.c unsigned int n = sqlite3Strlen30(zTitle) + 1;
n 15338 ext/sqlite3/libsqlite/sqlite3.c if( n>=sizeof(mem.zTitle) ) n = sizeof(mem.zTitle)-1;
n 15339 ext/sqlite3/libsqlite/sqlite3.c memcpy(mem.zTitle, zTitle, n);
n 15340 ext/sqlite3/libsqlite/sqlite3.c mem.zTitle[n] = 0;
n 15341 ext/sqlite3/libsqlite/sqlite3.c mem.nTitle = ROUND8(n);
n 15901 ext/sqlite3/libsqlite/sqlite3.c if( n<=12 ){
n 15904 ext/sqlite3/libsqlite/sqlite3.c return ((n+11)&~7) - 4;
n 16529 ext/sqlite3/libsqlite/sqlite3.c if( n > 0x40000000 ) return 0;
n 16530 ext/sqlite3/libsqlite/sqlite3.c for(iFullSz=mem5.szAtom; iFullSz<n; iFullSz *= 2);
n 16627 ext/sqlite3/libsqlite/sqlite3.c int i, j, n;
n 16643 ext/sqlite3/libsqlite/sqlite3.c for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){}
n 16644 ext/sqlite3/libsqlite/sqlite3.c fprintf(out, "freelist items of size %d: %d\n", mem5.szAtom << i, n);
n 18034 ext/sqlite3/libsqlite/sqlite3.c return sqlite3PcacheReleaseMemory(n);
n 18039 ext/sqlite3/libsqlite/sqlite3.c UNUSED_PARAMETER(n);
n 18147 ext/sqlite3/libsqlite/sqlite3.c if( n<0 ) return priorLimit;
n 18148 ext/sqlite3/libsqlite/sqlite3.c if( n>0 ){
n 18149 ext/sqlite3/libsqlite/sqlite3.c sqlite3MemoryAlarm(softHeapLimitEnforcer, 0, n);
n 18153 ext/sqlite3/libsqlite/sqlite3.c excess = sqlite3_memory_used() - n;
n 18158 ext/sqlite3/libsqlite/sqlite3.c if( n<0 ) n = 0;
n 18159 ext/sqlite3/libsqlite/sqlite3.c sqlite3_soft_heap_limit64(n);
n 18175 ext/sqlite3/libsqlite/sqlite3.c int i, n, sz;
n 18180 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3GlobalConfig.nScratch;
n 18182 ext/sqlite3/libsqlite/sqlite3.c mem0.nScratchFree = n;
n 18183 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<n-1; i++){
n 18227 ext/sqlite3/libsqlite/sqlite3.c int n, mx;
n 18229 ext/sqlite3/libsqlite/sqlite3.c sqlite3_status(SQLITE_STATUS_MEMORY_USED, &n, &mx, 0);
n 18230 ext/sqlite3/libsqlite/sqlite3.c res = (sqlite3_int64)n; /* Work around bug in Borland C. Ticket #3216 */
n 18240 ext/sqlite3/libsqlite/sqlite3.c int n, mx;
n 18242 ext/sqlite3/libsqlite/sqlite3.c sqlite3_status(SQLITE_STATUS_MEMORY_USED, &n, &mx, resetFlag);
n 18274 ext/sqlite3/libsqlite/sqlite3.c nFull = sqlite3GlobalConfig.m.xRoundup(n);
n 18275 ext/sqlite3/libsqlite/sqlite3.c sqlite3StatusSet(SQLITE_STATUS_MALLOC_SIZE, n);
n 18307 ext/sqlite3/libsqlite/sqlite3.c if( n<=0 /* IMP: R-65312-04917 */
n 18308 ext/sqlite3/libsqlite/sqlite3.c || n>=0x7fffff00
n 18318 ext/sqlite3/libsqlite/sqlite3.c mallocWithAlarm(n, &p);
n 18321 ext/sqlite3/libsqlite/sqlite3.c p = sqlite3GlobalConfig.m.xMalloc(n);
n 18336 ext/sqlite3/libsqlite/sqlite3.c return sqlite3Malloc(n);
n 18360 ext/sqlite3/libsqlite/sqlite3.c assert( n>0 );
n 18363 ext/sqlite3/libsqlite/sqlite3.c if( mem0.nScratchFree && sqlite3GlobalConfig.szScratch>=n ){
n 18368 ext/sqlite3/libsqlite/sqlite3.c sqlite3StatusSet(SQLITE_STATUS_SCRATCH_SIZE, n);
n 18372 ext/sqlite3/libsqlite/sqlite3.c sqlite3StatusSet(SQLITE_STATUS_SCRATCH_SIZE, n);
n 18373 ext/sqlite3/libsqlite/sqlite3.c n = mallocWithAlarm(n, &p);
n 18374 ext/sqlite3/libsqlite/sqlite3.c if( p ) sqlite3StatusAdd(SQLITE_STATUS_SCRATCH_OVERFLOW, n);
n 18378 ext/sqlite3/libsqlite/sqlite3.c p = sqlite3GlobalConfig.m.xMalloc(n);
n 18574 ext/sqlite3/libsqlite/sqlite3.c return sqlite3Realloc(pOld, n);
n 18582 ext/sqlite3/libsqlite/sqlite3.c void *p = sqlite3Malloc(n);
n 18584 ext/sqlite3/libsqlite/sqlite3.c memset(p, 0, n);
n 18594 ext/sqlite3/libsqlite/sqlite3.c void *p = sqlite3DbMallocRaw(db, n);
n 18596 ext/sqlite3/libsqlite/sqlite3.c memset(p, 0, n);
n 18630 ext/sqlite3/libsqlite/sqlite3.c if( n>db->lookaside.sz ){
n 18650 ext/sqlite3/libsqlite/sqlite3.c p = sqlite3Malloc(n);
n 18669 ext/sqlite3/libsqlite/sqlite3.c return sqlite3DbMallocRaw(db, n);
n 18672 ext/sqlite3/libsqlite/sqlite3.c if( n<=db->lookaside.sz ){
n 18675 ext/sqlite3/libsqlite/sqlite3.c pNew = sqlite3DbMallocRaw(db, n);
n 18684 ext/sqlite3/libsqlite/sqlite3.c pNew = sqlite3_realloc(p, n);
n 18702 ext/sqlite3/libsqlite/sqlite3.c pNew = sqlite3DbRealloc(db, p, n);
n 18718 ext/sqlite3/libsqlite/sqlite3.c size_t n;
n 18722 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3Strlen30(z) + 1;
n 18723 ext/sqlite3/libsqlite/sqlite3.c assert( (n&0x7fffffff)==n );
n 18724 ext/sqlite3/libsqlite/sqlite3.c zNew = sqlite3DbMallocRaw(db, (int)n);
n 18726 ext/sqlite3/libsqlite/sqlite3.c memcpy(zNew, z, n);
n 18735 ext/sqlite3/libsqlite/sqlite3.c assert( (n&0x7fffffff)==n );
n 18736 ext/sqlite3/libsqlite/sqlite3.c zNew = sqlite3DbMallocRaw(db, n+1);
n 18738 ext/sqlite3/libsqlite/sqlite3.c memcpy(zNew, z, n);
n 18739 ext/sqlite3/libsqlite/sqlite3.c zNew[n] = 0;
n 19442 ext/sqlite3/libsqlite/sqlite3.c int i, j, k, n, isnull;
n 19450 ext/sqlite3/libsqlite/sqlite3.c for(i=n=0; k!=0 && (ch=escarg[i])!=0; i++, k--){
n 19451 ext/sqlite3/libsqlite/sqlite3.c if( ch==q ) n++;
n 19454 ext/sqlite3/libsqlite/sqlite3.c n += i + 1 + needQuote*2;
n 19455 ext/sqlite3/libsqlite/sqlite3.c if( n>etBUFSIZE ){
n 19456 ext/sqlite3/libsqlite/sqlite3.c bufpt = zExtra = sqlite3Malloc( n );
n 19482 ext/sqlite3/libsqlite/sqlite3.c sqlite3StrAccumAppend(pAccum, (const char*)pToken->z, pToken->n);
n 19632 ext/sqlite3/libsqlite/sqlite3.c p->nAlloc = n;
n 19739 ext/sqlite3/libsqlite/sqlite3.c if( n<=0 ) return zBuf;
n 19740 ext/sqlite3/libsqlite/sqlite3.c sqlite3StrAccumInit(&acc, zBuf, n, 0);
n 19749 ext/sqlite3/libsqlite/sqlite3.c z = sqlite3_vsnprintf(n, zBuf, zFormat, ap);
n 20180 ext/sqlite3/libsqlite/sqlite3.c assert( pMem->n>=0 );
n 20203 ext/sqlite3/libsqlite/sqlite3.c zTerm = &zIn[pMem->n&~1];
n 20221 ext/sqlite3/libsqlite/sqlite3.c pMem->n &= ~1;
n 20222 ext/sqlite3/libsqlite/sqlite3.c len = pMem->n * 2 + 1;
n 20229 ext/sqlite3/libsqlite/sqlite3.c len = pMem->n * 2 + 2;
n 20239 ext/sqlite3/libsqlite/sqlite3.c zTerm = &zIn[pMem->n];
n 20263 ext/sqlite3/libsqlite/sqlite3.c pMem->n = (int)(z - zOut);
n 20280 ext/sqlite3/libsqlite/sqlite3.c pMem->n = (int)(z - zOut);
n 20283 ext/sqlite3/libsqlite/sqlite3.c assert( (pMem->n+(desiredEnc==SQLITE_UTF8?1:2))<=len );
n 20316 ext/sqlite3/libsqlite/sqlite3.c assert( pMem->n>=0 );
n 20317 ext/sqlite3/libsqlite/sqlite3.c if( pMem->n>1 ){
n 20331 ext/sqlite3/libsqlite/sqlite3.c pMem->n -= 2;
n 20332 ext/sqlite3/libsqlite/sqlite3.c memmove(pMem->z, &pMem->z[2], pMem->n);
n 20333 ext/sqlite3/libsqlite/sqlite3.c pMem->z[pMem->n] = '\0';
n 20334 ext/sqlite3/libsqlite/sqlite3.c pMem->z[pMem->n+1] = '\0';
n 20436 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeMemSetStr(&m, z, n, SQLITE_UTF8, SQLITE_STATIC);
n 20442 ext/sqlite3/libsqlite/sqlite3.c *pnOut = m.n;
n 20455 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 20458 ext/sqlite3/libsqlite/sqlite3.c while( n<nChar ){
n 20460 ext/sqlite3/libsqlite/sqlite3.c n++;
n 20463 ext/sqlite3/libsqlite/sqlite3.c while( n<nChar ){
n 20465 ext/sqlite3/libsqlite/sqlite3.c n++;
n 20481 ext/sqlite3/libsqlite/sqlite3.c int n;
n 20487 ext/sqlite3/libsqlite/sqlite3.c n = (int)(z-zBuf);
n 20488 ext/sqlite3/libsqlite/sqlite3.c assert( n>0 && n<=4 );
n 20496 ext/sqlite3/libsqlite/sqlite3.c assert( (z-zBuf)==n );
n 20502 ext/sqlite3/libsqlite/sqlite3.c n = (int)(z-zBuf);
n 20503 ext/sqlite3/libsqlite/sqlite3.c assert( n>0 && n<=4 );
n 20508 ext/sqlite3/libsqlite/sqlite3.c assert( (z-zBuf)==n );
n 20514 ext/sqlite3/libsqlite/sqlite3.c n = (int)(z-zBuf);
n 20515 ext/sqlite3/libsqlite/sqlite3.c assert( n>0 && n<=4 );
n 20520 ext/sqlite3/libsqlite/sqlite3.c assert( (z-zBuf)==n );
n 21129 ext/sqlite3/libsqlite/sqlite3.c int i, j, n;
n 21140 ext/sqlite3/libsqlite/sqlite3.c n = 0;
n 21142 ext/sqlite3/libsqlite/sqlite3.c buf[n++] = (u8)((v & 0x7f) | 0x80);
n 21146 ext/sqlite3/libsqlite/sqlite3.c assert( n<=9 );
n 21147 ext/sqlite3/libsqlite/sqlite3.c for(i=0, j=n-1; j>=0; j--, i++){
n 21150 ext/sqlite3/libsqlite/sqlite3.c return n;
n 21419 ext/sqlite3/libsqlite/sqlite3.c u8 n;
n 21422 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3GetVarint(p, &v64);
n 21423 ext/sqlite3/libsqlite/sqlite3.c assert( n>3 && n<=9 );
n 21429 ext/sqlite3/libsqlite/sqlite3.c return n;
n 21471 ext/sqlite3/libsqlite/sqlite3.c u8 n;
n 21474 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3GetVarint(p, &v64);
n 21475 ext/sqlite3/libsqlite/sqlite3.c assert( n>5 && n<=9 );
n 21477 ext/sqlite3/libsqlite/sqlite3.c return n;
n 21538 ext/sqlite3/libsqlite/sqlite3.c zBlob = (char *)sqlite3DbMallocRaw(db, n/2 + 1);
n 21539 ext/sqlite3/libsqlite/sqlite3.c n--;
n 21541 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<n; i+=2){
n 23417 ext/sqlite3/libsqlite/sqlite3.c int n, rc = SQLITE_OK;
n 23466 ext/sqlite3/libsqlite/sqlite3.c for( n = pNode->nRegion; n <= iRegion; n++ )
n 23467 ext/sqlite3/libsqlite/sqlite3.c pNode->apRegion[n] = NULL;
n 23560 ext/sqlite3/libsqlite/sqlite3.c assert( ofst>=0 && ofst+n<=SQLITE_SHM_NLOCK );
n 23561 ext/sqlite3/libsqlite/sqlite3.c assert( n>=1 );
n 23566 ext/sqlite3/libsqlite/sqlite3.c assert( n==1 || (flags & SQLITE_SHM_EXCLUSIVE)!=0 );
n 23568 ext/sqlite3/libsqlite/sqlite3.c mask = (u32)((1U<<(ofst+n)) - (1U<<ofst));
n 23569 ext/sqlite3/libsqlite/sqlite3.c assert( n>1 || mask==(1<<ofst) );
n 23586 ext/sqlite3/libsqlite/sqlite3.c rc = os2ShmSystemLock(pShmNode, _SHM_UNLCK, ofst+OS2_SHM_BASE, n);
n 23614 ext/sqlite3/libsqlite/sqlite3.c rc = os2ShmSystemLock(pShmNode, _SHM_RDLCK, ofst+OS2_SHM_BASE, n);
n 23639 ext/sqlite3/libsqlite/sqlite3.c rc = os2ShmSystemLock(pShmNode, _SHM_WRLCK, ofst+OS2_SHM_BASE, n);
n 23654 ext/sqlite3/libsqlite/sqlite3.c ofst, n, flags, rc))
n 24066 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 24068 ext/sqlite3/libsqlite/sqlite3.c n = nBuf;
n 24082 ext/sqlite3/libsqlite/sqlite3.c if( (int)sizeof(dt)-3 <= nBuf - n ){
n 24086 ext/sqlite3/libsqlite/sqlite3.c memcpy(&zBuf[n], &dt, sizeof(dt)-3);
n 24087 ext/sqlite3/libsqlite/sqlite3.c n += sizeof(dt)-3;
n 24091 ext/sqlite3/libsqlite/sqlite3.c if( (int)sizeof(ULONG) <= nBuf - n ){
n 24093 ext/sqlite3/libsqlite/sqlite3.c *(PULONG)&zBuf[n] = MAKELONG(ppib->pib_ulpid,
n 24095 ext/sqlite3/libsqlite/sqlite3.c n += sizeof(ULONG);
n 24099 ext/sqlite3/libsqlite/sqlite3.c for( i = 0; i < 6 && (int)sizeof(ULONG) <= nBuf - n; i++ ){
n 24101 ext/sqlite3/libsqlite/sqlite3.c (PULONG)&zBuf[n], sizeof(ULONG));
n 24102 ext/sqlite3/libsqlite/sqlite3.c n += sizeof(ULONG);
n 24106 ext/sqlite3/libsqlite/sqlite3.c return n;
n 25207 ext/sqlite3/libsqlite/sqlite3.c while( n>1 && z[n-1]=='/' ){ n--; }
n 25208 ext/sqlite3/libsqlite/sqlite3.c for(i=j=0; i<n; i++){
n 25211 ext/sqlite3/libsqlite/sqlite3.c if( z[i+1]=='.' && i+2<n && z[i+2]=='/' ){
n 25215 ext/sqlite3/libsqlite/sqlite3.c if( z[i+1]=='.' && i+3<n && z[i+2]=='.' && z[i+3]=='/' ){
n 25242 ext/sqlite3/libsqlite/sqlite3.c int n; /* Length of zAbsoluteName string */
n 25245 ext/sqlite3/libsqlite/sqlite3.c n = (int)strlen(zAbsoluteName);
n 25246 ext/sqlite3/libsqlite/sqlite3.c pNew = sqlite3_malloc( sizeof(*pNew) + (n+1) );
n 25249 ext/sqlite3/libsqlite/sqlite3.c memcpy(pNew->zCanonicalName, zAbsoluteName, n+1);
n 25250 ext/sqlite3/libsqlite/sqlite3.c n = vxworksSimplifyName(pNew->zCanonicalName, n);
n 25258 ext/sqlite3/libsqlite/sqlite3.c if( pCandidate->nName==n
n 25259 ext/sqlite3/libsqlite/sqlite3.c && memcmp(pCandidate->zCanonicalName, pNew->zCanonicalName, n)==0
n 25270 ext/sqlite3/libsqlite/sqlite3.c pNew->nName = n;
n 28077 ext/sqlite3/libsqlite/sqlite3.c assert( n==1 || lockType!=F_RDLCK );
n 28080 ext/sqlite3/libsqlite/sqlite3.c assert( n>=1 && n<SQLITE_SHM_NLOCK );
n 28088 ext/sqlite3/libsqlite/sqlite3.c f.l_len = n;
n 28098 ext/sqlite3/libsqlite/sqlite3.c mask = (1<<(ofst+n)) - (1<<ofst);
n 28468 ext/sqlite3/libsqlite/sqlite3.c assert( ofst>=0 && ofst+n<=SQLITE_SHM_NLOCK );
n 28469 ext/sqlite3/libsqlite/sqlite3.c assert( n>=1 );
n 28474 ext/sqlite3/libsqlite/sqlite3.c assert( n==1 || (flags & SQLITE_SHM_EXCLUSIVE)!=0 );
n 28478 ext/sqlite3/libsqlite/sqlite3.c mask = (1<<(ofst+n)) - (1<<ofst);
n 28479 ext/sqlite3/libsqlite/sqlite3.c assert( n>1 || mask==(1<<ofst) );
n 28493 ext/sqlite3/libsqlite/sqlite3.c rc = unixShmSystemLock(pShmNode, F_UNLCK, ofst+UNIX_SHM_BASE, n);
n 28521 ext/sqlite3/libsqlite/sqlite3.c rc = unixShmSystemLock(pShmNode, F_RDLCK, ofst+UNIX_SHM_BASE, n);
n 28546 ext/sqlite3/libsqlite/sqlite3.c rc = unixShmSystemLock(pShmNode, F_WRLCK, ofst+UNIX_SHM_BASE, n);
n 29074 ext/sqlite3/libsqlite/sqlite3.c int n;
n 29077 ext/sqlite3/libsqlite/sqlite3.c for( n=1; zSemName[n]; n++ )
n 29078 ext/sqlite3/libsqlite/sqlite3.c if( zSemName[n]=='/' ) zSemName[n] = '_';
n 33139 ext/sqlite3/libsqlite/sqlite3.c assert( ofst>=0 && ofst+n<=SQLITE_SHM_NLOCK );
n 33140 ext/sqlite3/libsqlite/sqlite3.c assert( n>=1 );
n 33145 ext/sqlite3/libsqlite/sqlite3.c assert( n==1 || (flags & SQLITE_SHM_EXCLUSIVE)!=0 );
n 33147 ext/sqlite3/libsqlite/sqlite3.c mask = (u16)((1U<<(ofst+n)) - (1U<<ofst));
n 33148 ext/sqlite3/libsqlite/sqlite3.c assert( n>1 || mask==(1<<ofst) );
n 33162 ext/sqlite3/libsqlite/sqlite3.c rc = winShmSystemLock(pShmNode, _SHM_UNLCK, ofst+WIN_SHM_BASE, n);
n 33190 ext/sqlite3/libsqlite/sqlite3.c rc = winShmSystemLock(pShmNode, _SHM_RDLCK, ofst+WIN_SHM_BASE, n);
n 33215 ext/sqlite3/libsqlite/sqlite3.c rc = winShmSystemLock(pShmNode, _SHM_WRLCK, ofst+WIN_SHM_BASE, n);
n 34079 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 34082 ext/sqlite3/libsqlite/sqlite3.c n = nBuf;
n 34085 ext/sqlite3/libsqlite/sqlite3.c if( sizeof(SYSTEMTIME)<=nBuf-n ){
n 34088 ext/sqlite3/libsqlite/sqlite3.c memcpy(&zBuf[n], &x, sizeof(x));
n 34089 ext/sqlite3/libsqlite/sqlite3.c n += sizeof(x);
n 34091 ext/sqlite3/libsqlite/sqlite3.c if( sizeof(DWORD)<=nBuf-n ){
n 34093 ext/sqlite3/libsqlite/sqlite3.c memcpy(&zBuf[n], &pid, sizeof(pid));
n 34094 ext/sqlite3/libsqlite/sqlite3.c n += sizeof(pid);
n 34096 ext/sqlite3/libsqlite/sqlite3.c if( sizeof(DWORD)<=nBuf-n ){
n 34098 ext/sqlite3/libsqlite/sqlite3.c memcpy(&zBuf[n], &cnt, sizeof(cnt));
n 34099 ext/sqlite3/libsqlite/sqlite3.c n += sizeof(cnt);
n 34101 ext/sqlite3/libsqlite/sqlite3.c if( sizeof(LARGE_INTEGER)<=nBuf-n ){
n 34104 ext/sqlite3/libsqlite/sqlite3.c memcpy(&zBuf[n], &i, sizeof(i));
n 34105 ext/sqlite3/libsqlite/sqlite3.c n += sizeof(i);
n 34108 ext/sqlite3/libsqlite/sqlite3.c return n;
n 35463 ext/sqlite3/libsqlite/sqlite3.c pcache1.nSlot = pcache1.nFreeSlot = n;
n 35464 ext/sqlite3/libsqlite/sqlite3.c pcache1.nReserve = n>90 ? 10 : (n/10 + 1);
n 35468 ext/sqlite3/libsqlite/sqlite3.c while( n-- ){
n 35895 ext/sqlite3/libsqlite/sqlite3.c int n;
n 35898 ext/sqlite3/libsqlite/sqlite3.c n = pCache->nPage;
n 35900 ext/sqlite3/libsqlite/sqlite3.c return n;
n 39864 ext/sqlite3/libsqlite/sqlite3.c i64 n = 0; /* Size of db file in bytes */
n 39867 ext/sqlite3/libsqlite/sqlite3.c int rc = sqlite3OsFileSize(pPager->fd, &n);
n 39872 ext/sqlite3/libsqlite/sqlite3.c nPage = (Pgno)(n / pPager->pageSize);
n 39873 ext/sqlite3/libsqlite/sqlite3.c if( nPage==0 && n>0 ){
n 44415 ext/sqlite3/libsqlite/sqlite3.c rc = sqlite3OsShmLock(pWal->pDbFd, lockIdx, n,
n 44418 ext/sqlite3/libsqlite/sqlite3.c walLockName(lockIdx), n, rc ? "failed" : "ok"));
n 44424 ext/sqlite3/libsqlite/sqlite3.c (void)sqlite3OsShmLock(pWal->pDbFd, lockIdx, n,
n 44427 ext/sqlite3/libsqlite/sqlite3.c walLockName(lockIdx), n));
n 45224 ext/sqlite3/libsqlite/sqlite3.c rc = walLockExclusive(pWal, lockIdx, n);
n 48414 ext/sqlite3/libsqlite/sqlite3.c u16 n; /* Number bytes in cell content header */
n 48421 ext/sqlite3/libsqlite/sqlite3.c n = pPage->childPtrSize;
n 48422 ext/sqlite3/libsqlite/sqlite3.c assert( n==4-4*pPage->leaf );
n 48425 ext/sqlite3/libsqlite/sqlite3.c n += getVarint32(&pCell[n], nPayload);
n 48429 ext/sqlite3/libsqlite/sqlite3.c n += getVarint(&pCell[n], (u64*)&pInfo->nKey);
n 48433 ext/sqlite3/libsqlite/sqlite3.c n += getVarint32(&pCell[n], nPayload);
n 48437 ext/sqlite3/libsqlite/sqlite3.c pInfo->nHeader = n;
n 48444 ext/sqlite3/libsqlite/sqlite3.c if( (pInfo->nSize = (u16)(n+nPayload))<4 ) pInfo->nSize = 4;
n 48471 ext/sqlite3/libsqlite/sqlite3.c pInfo->iOverflow = (u16)(pInfo->nLocal + n);
n 49714 ext/sqlite3/libsqlite/sqlite3.c int n;
n 49716 ext/sqlite3/libsqlite/sqlite3.c n = p->pBt->pageSize - p->pBt->usableSize;
n 49718 ext/sqlite3/libsqlite/sqlite3.c return n;
n 49727 ext/sqlite3/libsqlite/sqlite3.c int n;
n 49729 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3PagerMaxPageCount(p->pBt->pPager, mxPage);
n 49731 ext/sqlite3/libsqlite/sqlite3.c return n;
n 52279 ext/sqlite3/libsqlite/sqlite3.c u32 n; /* Number of pages on the freelist */
n 52288 ext/sqlite3/libsqlite/sqlite3.c n = get4byte(&pPage1->aData[36]);
n 52289 ext/sqlite3/libsqlite/sqlite3.c testcase( n==mxPage-1 );
n 52290 ext/sqlite3/libsqlite/sqlite3.c if( n>=mxPage ){
n 52293 ext/sqlite3/libsqlite/sqlite3.c if( n>0 ){
n 52321 ext/sqlite3/libsqlite/sqlite3.c put4byte(&pPage1->aData[36], n-1);
n 52359 ext/sqlite3/libsqlite/sqlite3.c TRACE(("ALLOCATE: %d trunk - %d free pages left\n", *pPgno, n-1));
n 52423 ext/sqlite3/libsqlite/sqlite3.c TRACE(("ALLOCATE: %d trunk - %d free pages left\n", *pPgno, n-1));
n 52458 ext/sqlite3/libsqlite/sqlite3.c *pPgno, closest+1, k, pTrunk->pgno, n-1));
n 52761 ext/sqlite3/libsqlite/sqlite3.c int nSrc, n, rc;
n 52868 ext/sqlite3/libsqlite/sqlite3.c n = nPayload;
n 52869 ext/sqlite3/libsqlite/sqlite3.c if( n>spaceLeft ) n = spaceLeft;
n 52881 ext/sqlite3/libsqlite/sqlite3.c if( n>nSrc ) n = nSrc;
n 52883 ext/sqlite3/libsqlite/sqlite3.c memcpy(pPayload, pSrc, n);
n 52885 ext/sqlite3/libsqlite/sqlite3.c memset(pPayload, 0, n);
n 52887 ext/sqlite3/libsqlite/sqlite3.c nPayload -= n;
n 52888 ext/sqlite3/libsqlite/sqlite3.c pPayload += n;
n 52889 ext/sqlite3/libsqlite/sqlite3.c pSrc += n;
n 52890 ext/sqlite3/libsqlite/sqlite3.c nSrc -= n;
n 52891 ext/sqlite3/libsqlite/sqlite3.c spaceLeft -= n;
n 53225 ext/sqlite3/libsqlite/sqlite3.c Pgno n;
n 53239 ext/sqlite3/libsqlite/sqlite3.c ptrmapGet(pBt, ovfl, &e, &n);
n 53240 ext/sqlite3/libsqlite/sqlite3.c assert( n==pPage->pgno && e==PTRMAP_OVERFLOW1 );
n 53244 ext/sqlite3/libsqlite/sqlite3.c ptrmapGet(pBt, child, &e, &n);
n 53245 ext/sqlite3/libsqlite/sqlite3.c assert( n==pPage->pgno && e==PTRMAP_BTREE );
n 53250 ext/sqlite3/libsqlite/sqlite3.c ptrmapGet(pBt, child, &e, &n);
n 53251 ext/sqlite3/libsqlite/sqlite3.c assert( n==pPage->pgno && e==PTRMAP_BTREE );
n 54391 ext/sqlite3/libsqlite/sqlite3.c Pgno n = pCur->apPage[iCellDepth+1]->pgno;
n 54402 ext/sqlite3/libsqlite/sqlite3.c insertCell(pPage, iCellIdx, pCell-4, nCell+4, pTmp, n, &rc);
n 55055 ext/sqlite3/libsqlite/sqlite3.c int n = get4byte(&pOvflData[4]);
n 55061 ext/sqlite3/libsqlite/sqlite3.c if( n>(int)pCheck->pBt->usableSize/4-2 ){
n 55066 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<n; i++){
n 55075 ext/sqlite3/libsqlite/sqlite3.c N -= n;
n 56474 ext/sqlite3/libsqlite/sqlite3.c if( n<32 ) n = 32;
n 56475 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3DbMallocSize(pMem->db, pMem->zMalloc)<n ){
n 56477 ext/sqlite3/libsqlite/sqlite3.c pMem->z = pMem->zMalloc = sqlite3DbReallocOrFree(pMem->db, pMem->z, n);
n 56481 ext/sqlite3/libsqlite/sqlite3.c pMem->zMalloc = sqlite3DbMallocRaw(pMem->db, n);
n 56486 ext/sqlite3/libsqlite/sqlite3.c memcpy(pMem->zMalloc, pMem->z, pMem->n);
n 56517 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3VdbeMemGrow(pMem, pMem->n + 2, 1) ){
n 56520 ext/sqlite3/libsqlite/sqlite3.c pMem->z[pMem->n] = 0;
n 56521 ext/sqlite3/libsqlite/sqlite3.c pMem->z[pMem->n+1] = 0;
n 56544 ext/sqlite3/libsqlite/sqlite3.c nByte = pMem->n + pMem->u.nZero;
n 56552 ext/sqlite3/libsqlite/sqlite3.c memset(&pMem->z[pMem->n], 0, pMem->u.nZero);
n 56553 ext/sqlite3/libsqlite/sqlite3.c pMem->n += pMem->u.nZero;
n 56569 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3VdbeMemGrow(pMem, pMem->n+2, 1) ){
n 56572 ext/sqlite3/libsqlite/sqlite3.c pMem->z[pMem->n] = 0;
n 56573 ext/sqlite3/libsqlite/sqlite3.c pMem->z[pMem->n+1] = 0;
n 56620 ext/sqlite3/libsqlite/sqlite3.c pMem->n = sqlite3Strlen30(pMem->z);
n 56759 ext/sqlite3/libsqlite/sqlite3.c assert( pMem->z || pMem->n==0 );
n 56761 ext/sqlite3/libsqlite/sqlite3.c sqlite3Atoi64(pMem->z, &value, pMem->n, pMem->enc);
n 56784 ext/sqlite3/libsqlite/sqlite3.c sqlite3AtoF(pMem->z, &val, pMem->n, pMem->enc);
n 56860 ext/sqlite3/libsqlite/sqlite3.c if( 0==sqlite3Atoi64(pMem->z, &pMem->u.i, pMem->n, pMem->enc) ){
n 56897 ext/sqlite3/libsqlite/sqlite3.c pMem->n = 0;
n 56898 ext/sqlite3/libsqlite/sqlite3.c if( n<0 ) n = 0;
n 56899 ext/sqlite3/libsqlite/sqlite3.c pMem->u.nZero = n;
n 56903 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeMemGrow(pMem, n, 0);
n 56905 ext/sqlite3/libsqlite/sqlite3.c pMem->n = n;
n 56906 ext/sqlite3/libsqlite/sqlite3.c memset(pMem->z, 0, n);
n 56967 ext/sqlite3/libsqlite/sqlite3.c int n = p->n;
n 56969 ext/sqlite3/libsqlite/sqlite3.c n += p->u.nZero;
n 56971 ext/sqlite3/libsqlite/sqlite3.c return n>p->db->aLimit[SQLITE_LIMIT_LENGTH];
n 57083 ext/sqlite3/libsqlite/sqlite3.c int nByte = n; /* New value for pMem->n */
n 57139 ext/sqlite3/libsqlite/sqlite3.c pMem->n = nByte;
n 57243 ext/sqlite3/libsqlite/sqlite3.c return pColl->xCmp(pColl->pUser,pMem1->n,pMem1->z,pMem2->n,pMem2->z);
n 57254 ext/sqlite3/libsqlite/sqlite3.c n1 = v1==0 ? 0 : c1.n;
n 57256 ext/sqlite3/libsqlite/sqlite3.c n2 = v2==0 ? 0 : c2.n;
n 57268 ext/sqlite3/libsqlite/sqlite3.c rc = memcmp(pMem1->z, pMem2->z, (pMem1->n>pMem2->n)?pMem2->n:pMem1->n);
n 57270 ext/sqlite3/libsqlite/sqlite3.c rc = pMem1->n - pMem2->n;
n 57330 ext/sqlite3/libsqlite/sqlite3.c pMem->n = amt;
n 57521 ext/sqlite3/libsqlite/sqlite3.c if( v ) sqlite3VdbeMemSetStr((Mem *)v, z, n, enc, xDel);
n 57541 ext/sqlite3/libsqlite/sqlite3.c return p->n + p->u.nZero;
n 57543 ext/sqlite3/libsqlite/sqlite3.c return p->n;
n 57608 ext/sqlite3/libsqlite/sqlite3.c p->zSql = sqlite3DbStrNDup(p->db, z, n);
n 57794 ext/sqlite3/libsqlite/sqlite3.c int n = p->nLabelAlloc*2 + 5;
n 57796 ext/sqlite3/libsqlite/sqlite3.c n*sizeof(p->aLabel[0]));
n 57978 ext/sqlite3/libsqlite/sqlite3.c int n;
n 57981 ext/sqlite3/libsqlite/sqlite3.c n = pOp[-1].p1;
n 57982 ext/sqlite3/libsqlite/sqlite3.c if( n>nMaxArgs ) nMaxArgs = n;
n 58265 ext/sqlite3/libsqlite/sqlite3.c if ( n!=P4_KEYINFO && n!=P4_VTAB ) {
n 58266 ext/sqlite3/libsqlite/sqlite3.c freeP4(db, n, (void*)*(char**)&zP4);
n 58278 ext/sqlite3/libsqlite/sqlite3.c if( n==P4_INT32 ){
n 58286 ext/sqlite3/libsqlite/sqlite3.c }else if( n==P4_KEYINFO ){
n 58307 ext/sqlite3/libsqlite/sqlite3.c }else if( n==P4_KEYINFO_HANDOFF ){
n 58310 ext/sqlite3/libsqlite/sqlite3.c }else if( n==P4_VTAB ){
n 58315 ext/sqlite3/libsqlite/sqlite3.c }else if( n<0 ){
n 58317 ext/sqlite3/libsqlite/sqlite3.c pOp->p4type = (signed char)n;
n 58319 ext/sqlite3/libsqlite/sqlite3.c if( n==0 ) n = sqlite3Strlen30(zP4);
n 58320 ext/sqlite3/libsqlite/sqlite3.c pOp->p4.z = sqlite3DbStrNDup(p->db, zP4, n);
n 58420 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(pColl->zName);
n 58421 ext/sqlite3/libsqlite/sqlite3.c if( i+n>nTemp-6 ){
n 58429 ext/sqlite3/libsqlite/sqlite3.c memcpy(&zTemp[i], pColl->zName,n+1);
n 58430 ext/sqlite3/libsqlite/sqlite3.c i += n;
n 58726 ext/sqlite3/libsqlite/sqlite3.c nSub = pSub->n/sizeof(Vdbe*);
n 58770 ext/sqlite3/libsqlite/sqlite3.c pMem->n = sqlite3Strlen30(pMem->z);
n 58790 ext/sqlite3/libsqlite/sqlite3.c pSub->n = nSub*sizeof(SubProgram*);
n 58820 ext/sqlite3/libsqlite/sqlite3.c pMem->n = sqlite3Strlen30(pMem->z);
n 58832 ext/sqlite3/libsqlite/sqlite3.c pMem->n = 2;
n 58842 ext/sqlite3/libsqlite/sqlite3.c pMem->n = sqlite3Strlen30(pMem->z);
n 59015 ext/sqlite3/libsqlite/sqlite3.c int n; /* Loop counter */
n 59086 ext/sqlite3/libsqlite/sqlite3.c for(n=0; n<nVar; n++){
n 59087 ext/sqlite3/libsqlite/sqlite3.c p->aVar[n].flags = MEM_Null;
n 59088 ext/sqlite3/libsqlite/sqlite3.c p->aVar[n].db = db;
n 59099 ext/sqlite3/libsqlite/sqlite3.c for(n=1; n<=nMem; n++){
n 59100 ext/sqlite3/libsqlite/sqlite3.c p->aMem[n].flags = MEM_Null;
n 59101 ext/sqlite3/libsqlite/sqlite3.c p->aMem[n].db = db;
n 59220 ext/sqlite3/libsqlite/sqlite3.c int n;
n 59225 ext/sqlite3/libsqlite/sqlite3.c n = nResColumn*COLNAME_N;
n 59227 ext/sqlite3/libsqlite/sqlite3.c p->aColName = pColName = (Mem*)sqlite3DbMallocZero(db, sizeof(Mem)*n );
n 59229 ext/sqlite3/libsqlite/sqlite3.c while( n-- > 0 ){
n 60108 ext/sqlite3/libsqlite/sqlite3.c int n;
n 60139 ext/sqlite3/libsqlite/sqlite3.c n = pMem->n;
n 60141 ext/sqlite3/libsqlite/sqlite3.c n += pMem->u.nZero;
n 60143 ext/sqlite3/libsqlite/sqlite3.c assert( n>=0 );
n 60144 ext/sqlite3/libsqlite/sqlite3.c return ((n*2) + 12 + ((flags&MEM_Str)!=0));
n 60256 ext/sqlite3/libsqlite/sqlite3.c assert( pMem->n + ((pMem->flags & MEM_Zero)?pMem->u.nZero:0)
n 60258 ext/sqlite3/libsqlite/sqlite3.c assert( pMem->n<=nBuf );
n 60259 ext/sqlite3/libsqlite/sqlite3.c len = pMem->n;
n 60267 ext/sqlite3/libsqlite/sqlite3.c memset(&buf[pMem->n], 0, len-pMem->n);
n 60360 ext/sqlite3/libsqlite/sqlite3.c pMem->n = len;
n 60634 ext/sqlite3/libsqlite/sqlite3.c testcase( szHdr==m.n );
n 60635 ext/sqlite3/libsqlite/sqlite3.c if( unlikely(szHdr<3 || (int)szHdr>m.n) ){
n 60654 ext/sqlite3/libsqlite/sqlite3.c testcase( (u32)m.n==szHdr+lenRowid );
n 60655 ext/sqlite3/libsqlite/sqlite3.c if( unlikely((u32)m.n<szHdr+lenRowid) ){
n 60660 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeSerialGet((u8*)&m.z[m.n-lenRowid], typeRowid, &v);
n 60709 ext/sqlite3/libsqlite/sqlite3.c *res = sqlite3VdbeRecordCompare(m.n, m.z, pUnpacked);
n 60940 ext/sqlite3/libsqlite/sqlite3.c return p->n ? p->z : 0;
n 60993 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3VdbeMemSetStr(&pCtx->s, z, n, enc, xDel)==SQLITE_TOOBIG ){
n 61003 ext/sqlite3/libsqlite/sqlite3.c assert( n>=0 );
n 61005 ext/sqlite3/libsqlite/sqlite3.c setResultStrOrError(pCtx, z, n, 0, xDel);
n 61014 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeMemSetStr(&pCtx->s, z, n, SQLITE_UTF8, SQLITE_TRANSIENT);
n 61020 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeMemSetStr(&pCtx->s, z, n, SQLITE_UTF16NATIVE, SQLITE_TRANSIENT);
n 61042 ext/sqlite3/libsqlite/sqlite3.c setResultStrOrError(pCtx, z, n, SQLITE_UTF8, xDel);
n 61052 ext/sqlite3/libsqlite/sqlite3.c setResultStrOrError(pCtx, z, n, SQLITE_UTF16NATIVE, xDel);
n 61061 ext/sqlite3/libsqlite/sqlite3.c setResultStrOrError(pCtx, z, n, SQLITE_UTF16BE, xDel);
n 61070 ext/sqlite3/libsqlite/sqlite3.c setResultStrOrError(pCtx, z, n, SQLITE_UTF16LE, xDel);
n 61079 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeMemSetZeroBlob(&pCtx->s, n);
n 61456 ext/sqlite3/libsqlite/sqlite3.c return p->pMem->n;
n 61653 ext/sqlite3/libsqlite/sqlite3.c int n;
n 61657 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_column_count(pStmt);
n 61658 ext/sqlite3/libsqlite/sqlite3.c if( N<n && N>=0 ){
n 61659 ext/sqlite3/libsqlite/sqlite3.c N += useType*n;
n 61936 ext/sqlite3/libsqlite/sqlite3.c rc = sqlite3_bind_blob(pStmt, i, pValue->z, pValue->n,SQLITE_TRANSIENT);
n 61941 ext/sqlite3/libsqlite/sqlite3.c rc = bindText(pStmt,i, pValue->z, pValue->n, SQLITE_TRANSIENT,
n 61957 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeMemSetZeroBlob(&p->aVar[i-1], n);
n 62131 ext/sqlite3/libsqlite/sqlite3.c int n;
n 62135 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3GetToken((u8*)zSql, &tokenType);
n 62136 ext/sqlite3/libsqlite/sqlite3.c assert( n>0 && tokenType!=TK_ILLEGAL );
n 62138 ext/sqlite3/libsqlite/sqlite3.c *pnToken = n;
n 62141 ext/sqlite3/libsqlite/sqlite3.c nTotal += n;
n 62142 ext/sqlite3/libsqlite/sqlite3.c zSql += n;
n 62173 ext/sqlite3/libsqlite/sqlite3.c int n; /* Length of a token prefix */
n 62193 ext/sqlite3/libsqlite/sqlite3.c n = findNextHostParameter(zRawSql, &nToken);
n 62194 ext/sqlite3/libsqlite/sqlite3.c assert( n>0 );
n 62195 ext/sqlite3/libsqlite/sqlite3.c sqlite3StrAccumAppend(&out, zRawSql, n);
n 62196 ext/sqlite3/libsqlite/sqlite3.c zRawSql += n;
n 62231 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeMemSetStr(&utf8, pVar->z, pVar->n, enc, SQLITE_STATIC);
n 62233 ext/sqlite3/libsqlite/sqlite3.c sqlite3XPrintf(&out, "'%.*q'", utf8.n, utf8.z);
n 62238 ext/sqlite3/libsqlite/sqlite3.c sqlite3XPrintf(&out, "'%.*q'", pVar->n, pVar->z);
n 62245 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<pVar->n; i++){
n 62360 ext/sqlite3/libsqlite/sqlite3.c if( (p->flags & (MEM_Str|MEM_Blob))!=0 && p->n>sqlite3_max_blobsize ){
n 62361 ext/sqlite3/libsqlite/sqlite3.c sqlite3_max_blobsize = p->n;
n 62512 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3AtoF(pRec->z, &rValue, pRec->n, enc)==0 ) return;
n 62513 ext/sqlite3/libsqlite/sqlite3.c if( 0==sqlite3Atoi64(pRec->z, &iValue, pRec->n, enc) ){
n 62621 ext/sqlite3/libsqlite/sqlite3.c sqlite3_snprintf(100, zCsr, "%d[", pMem->n);
n 62623 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<16 && i<pMem->n; i++){
n 62627 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<16 && i<pMem->n; i++){
n 62656 ext/sqlite3/libsqlite/sqlite3.c sqlite3_snprintf(100, &zBuf[k], "%d", pMem->n);
n 62659 ext/sqlite3/libsqlite/sqlite3.c for(j=0; j<15 && j<pMem->n; j++){
n 62838 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 62840 ext/sqlite3/libsqlite/sqlite3.c for(p=db->pSavepoint; p; p=p->pNext) n++;
n 62841 ext/sqlite3/libsqlite/sqlite3.c assert( n==(db->nSavepoint + db->isTransactionSavepoint) );
n 62934 ext/sqlite3/libsqlite/sqlite3.c int n; /* Number of registers left to copy */
n 62957 ext/sqlite3/libsqlite/sqlite3.c int n;
n 62972 ext/sqlite3/libsqlite/sqlite3.c int n;
n 63144 ext/sqlite3/libsqlite/sqlite3.c u32 n;
n 63247 ext/sqlite3/libsqlite/sqlite3.c int n;
n 63689 ext/sqlite3/libsqlite/sqlite3.c pOp->p1 = pOut->n;
n 63706 ext/sqlite3/libsqlite/sqlite3.c pOut->n = pOp->p1;
n 63768 ext/sqlite3/libsqlite/sqlite3.c int n; /* Number of registers left to copy */
n 63773 ext/sqlite3/libsqlite/sqlite3.c u.ac.n = pOp->p3;
n 63776 ext/sqlite3/libsqlite/sqlite3.c assert( u.ac.n>0 && u.ac.p1>0 && u.ac.p2>0 );
n 63777 ext/sqlite3/libsqlite/sqlite3.c assert( u.ac.p1+u.ac.n<=u.ac.p2 || u.ac.p2+u.ac.n<=u.ac.p1 );
n 63781 ext/sqlite3/libsqlite/sqlite3.c while( u.ac.n-- ){
n 63939 ext/sqlite3/libsqlite/sqlite3.c u.ae.nByte = pIn1->n + pIn2->n;
n 63948 ext/sqlite3/libsqlite/sqlite3.c memcpy(pOut->z, pIn2->z, pIn2->n);
n 63950 ext/sqlite3/libsqlite/sqlite3.c memcpy(&pOut->z[pIn2->n], pIn1->z, pIn1->n);
n 63954 ext/sqlite3/libsqlite/sqlite3.c pOut->n = (int)u.ae.nByte;
n 64117 ext/sqlite3/libsqlite/sqlite3.c int n;
n 64120 ext/sqlite3/libsqlite/sqlite3.c u.ag.n = pOp->p5;
n 64122 ext/sqlite3/libsqlite/sqlite3.c assert( u.ag.apVal || u.ag.n==0 );
n 64127 ext/sqlite3/libsqlite/sqlite3.c assert( u.ag.n==0 || (pOp->p2>0 && pOp->p2+u.ag.n<=p->nMem+1) );
n 64128 ext/sqlite3/libsqlite/sqlite3.c assert( pOp->p3<pOp->p2 || pOp->p3>=pOp->p2+u.ag.n );
n 64130 ext/sqlite3/libsqlite/sqlite3.c for(u.ag.i=0; u.ag.i<u.ag.n; u.ag.i++, u.ag.pArg++){
n 64167 ext/sqlite3/libsqlite/sqlite3.c (*u.ag.ctx.pFunc->xFunc)(&u.ag.ctx, u.ag.n, u.ag.apVal); /* IMP: R-24505-23230 */
n 64636 ext/sqlite3/libsqlite/sqlite3.c int n;
n 64646 ext/sqlite3/libsqlite/sqlite3.c u.aj.n = pOp->p3;
n 64648 ext/sqlite3/libsqlite/sqlite3.c assert( u.aj.n>0 );
n 64655 ext/sqlite3/libsqlite/sqlite3.c for(k=0; k<u.aj.n; k++) if( aPermute[k]>mx ) mx = aPermute[k];
n 64659 ext/sqlite3/libsqlite/sqlite3.c assert( u.aj.p1>0 && u.aj.p1+u.aj.n<=p->nMem+1 );
n 64660 ext/sqlite3/libsqlite/sqlite3.c assert( u.aj.p2>0 && u.aj.p2+u.aj.n<=p->nMem+1 );
n 64663 ext/sqlite3/libsqlite/sqlite3.c for(u.aj.i=0; u.aj.i<u.aj.n; u.aj.i++){
n 64947 ext/sqlite3/libsqlite/sqlite3.c u.am.payloadSize = u.am.pReg->n;
n 65252 ext/sqlite3/libsqlite/sqlite3.c if( u.ao.pRec->flags&MEM_Zero && u.ao.pRec->n>0 ){
n 65300 ext/sqlite3/libsqlite/sqlite3.c pOut->n = (int)u.ao.nByte;
n 66332 ext/sqlite3/libsqlite/sqlite3.c u.bb.pIdxKey = sqlite3VdbeRecordUnpack(u.bb.pC->pKeyInfo, pIn3->n, pIn3->z,
n 66751 ext/sqlite3/libsqlite/sqlite3.c u.bf.pData->n = 0;
n 66763 ext/sqlite3/libsqlite/sqlite3.c u.bf.pData->z, u.bf.pData->n, u.bf.nZero,
n 66886 ext/sqlite3/libsqlite/sqlite3.c u32 n;
n 66921 ext/sqlite3/libsqlite/sqlite3.c u.bh.n = (u32)u.bh.n64;
n 66923 ext/sqlite3/libsqlite/sqlite3.c rc = sqlite3BtreeDataSize(u.bh.pCrsr, &u.bh.n);
n 66925 ext/sqlite3/libsqlite/sqlite3.c if( u.bh.n>(u32)db->aLimit[SQLITE_LIMIT_LENGTH] ){
n 66929 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3VdbeMemGrow(pOut, u.bh.n, 0) ){
n 66932 ext/sqlite3/libsqlite/sqlite3.c pOut->n = u.bh.n;
n 66935 ext/sqlite3/libsqlite/sqlite3.c rc = sqlite3BtreeKey(u.bh.pCrsr, 0, u.bh.n, pOut->z);
n 66937 ext/sqlite3/libsqlite/sqlite3.c rc = sqlite3BtreeData(u.bh.pCrsr, 0, u.bh.n, pOut->z);
n 67197 ext/sqlite3/libsqlite/sqlite3.c u.bn.nKey = pIn2->n;
n 68047 ext/sqlite3/libsqlite/sqlite3.c int n;
n 68055 ext/sqlite3/libsqlite/sqlite3.c u.cb.n = pOp->p5;
n 68056 ext/sqlite3/libsqlite/sqlite3.c assert( u.cb.n>=0 );
n 68059 ext/sqlite3/libsqlite/sqlite3.c assert( u.cb.apVal || u.cb.n==0 );
n 68060 ext/sqlite3/libsqlite/sqlite3.c for(u.cb.i=0; u.cb.i<u.cb.n; u.cb.i++, u.cb.pRec++){
n 68069 ext/sqlite3/libsqlite/sqlite3.c u.cb.pMem->n++;
n 68083 ext/sqlite3/libsqlite/sqlite3.c (u.cb.ctx.pFunc->xStep)(&u.cb.ctx, u.cb.n, u.cb.apVal); /* IMP: R-24505-23230 */
n 68260 ext/sqlite3/libsqlite/sqlite3.c pOut->n = sqlite3Strlen30(pOut->z);
n 69284 ext/sqlite3/libsqlite/sqlite3.c if( n<0 || iOffset<0 || (iOffset+n)>p->nByte ){
n 69299 ext/sqlite3/libsqlite/sqlite3.c rc = xCall(p->pCsr, iOffset+p->iOffset, n, z);
n 69318 ext/sqlite3/libsqlite/sqlite3.c return blobReadWrite(pBlob, z, n, iOffset, sqlite3BtreeData);
n 69325 ext/sqlite3/libsqlite/sqlite3.c return blobReadWrite(pBlob, (void *)z, n, iOffset, sqlite3BtreePutData);
n 70387 ext/sqlite3/libsqlite/sqlite3.c int n = pExpr->iColumn;
n 70388 ext/sqlite3/libsqlite/sqlite3.c testcase( n==BMS-1 );
n 70389 ext/sqlite3/libsqlite/sqlite3.c if( n>=BMS ){
n 70390 ext/sqlite3/libsqlite/sqlite3.c n = BMS-1;
n 70393 ext/sqlite3/libsqlite/sqlite3.c pMatch->colUsed |= ((Bitmask)1)<<n;
n 70531 ext/sqlite3/libsqlite/sqlite3.c int n = pList ? pList->nExpr : 0; /* Number of arguments */
n 70545 ext/sqlite3/libsqlite/sqlite3.c pDef = sqlite3FindFunction(pParse->db, zId, nId, n, enc, 0);
n 71613 ext/sqlite3/libsqlite/sqlite3.c nExtra = pToken->n+1;
n 71628 ext/sqlite3/libsqlite/sqlite3.c memcpy(pNew->u.zToken, pToken->z, pToken->n);
n 71629 ext/sqlite3/libsqlite/sqlite3.c pNew->u.zToken[pToken->n] = 0;
n 71655 ext/sqlite3/libsqlite/sqlite3.c x.n = zToken ? sqlite3Strlen30(zToken) : 0;
n 71782 ext/sqlite3/libsqlite/sqlite3.c u32 n = sqlite3Strlen30(z);
n 71787 ext/sqlite3/libsqlite/sqlite3.c int bOk = 0==sqlite3Atoi64(&z[1], &i, n-1, SQLITE_UTF8);
n 71808 ext/sqlite3/libsqlite/sqlite3.c if( pParse->azVar[i] && memcmp(pParse->azVar[i],z,n+1)==0 ){
n 71826 ext/sqlite3/libsqlite/sqlite3.c pParse->azVar[x-1] = sqlite3DbStrNDup(db, z, n);
n 72216 ext/sqlite3/libsqlite/sqlite3.c int n = pList->nAlloc*2 + 4;
n 72217 ext/sqlite3/libsqlite/sqlite3.c a = sqlite3DbRealloc(db, pList->a, n*sizeof(pList->a[0]));
n 72259 ext/sqlite3/libsqlite/sqlite3.c pItem->zName = sqlite3DbStrNDup(pParse->db, pName->z, pName->n);
n 73550 ext/sqlite3/libsqlite/sqlite3.c int n;
n 73557 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3Strlen30(z) - 1;
n 73558 ext/sqlite3/libsqlite/sqlite3.c assert( z[n]=='\'' );
n 73559 ext/sqlite3/libsqlite/sqlite3.c zBlob = sqlite3HexToBlob(sqlite3VdbeDb(v), z, n);
n 73560 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeAddOp4(v, OP_Blob, n/2, target, 0, zBlob, P4_DYNAMIC);
n 74301 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 74305 ext/sqlite3/libsqlite/sqlite3.c n = pList->nExpr;
n 74306 ext/sqlite3/libsqlite/sqlite3.c for(pItem=pList->a, i=0; i<n; i++, pItem++){
n 74314 ext/sqlite3/libsqlite/sqlite3.c return n;
n 74801 ext/sqlite3/libsqlite/sqlite3.c int j, n;
n 74804 ext/sqlite3/libsqlite/sqlite3.c n = pGB->nExpr;
n 74805 ext/sqlite3/libsqlite/sqlite3.c for(j=0; j<n; j++, pTerm++){
n 74960 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 74962 ext/sqlite3/libsqlite/sqlite3.c n = pParse->nRangeReg;
n 74963 ext/sqlite3/libsqlite/sqlite3.c if( nReg<=n ){
n 74964 ext/sqlite3/libsqlite/sqlite3.c assert( !usedAsColumnCache(pParse, i, i+n-1) );
n 75049 ext/sqlite3/libsqlite/sqlite3.c tname.n = len;
n 75062 ext/sqlite3/libsqlite/sqlite3.c zTableName, tname.z+tname.n);
n 75096 ext/sqlite3/libsqlite/sqlite3.c int n; /* Length of token z */
n 75100 ext/sqlite3/libsqlite/sqlite3.c for(z=zInput; *z; z=z+n){
n 75101 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3GetToken(z, &token);
n 75105 ext/sqlite3/libsqlite/sqlite3.c z += n;
n 75106 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3GetToken(z, &token);
n 75109 ext/sqlite3/libsqlite/sqlite3.c zParent = sqlite3DbStrNDup(db, (const char *)z, n);
n 75118 ext/sqlite3/libsqlite/sqlite3.c zInput = &z[n];
n 75171 ext/sqlite3/libsqlite/sqlite3.c tname.n = len;
n 75201 ext/sqlite3/libsqlite/sqlite3.c zTableName, tname.z+tname.n);
n 75684 ext/sqlite3/libsqlite/sqlite3.c zCol = sqlite3DbStrNDup(db, (char*)pColDef->z, pColDef->n);
n 75686 ext/sqlite3/libsqlite/sqlite3.c char *zEnd = &zCol[pColDef->n-1];
n 76270 ext/sqlite3/libsqlite/sqlite3.c }else if( pName2->n==0 ){
n 76329 ext/sqlite3/libsqlite/sqlite3.c int i, c, n;
n 76348 ext/sqlite3/libsqlite/sqlite3.c n = pIndex ? pIndex->nColumn : 0;
n 76350 ext/sqlite3/libsqlite/sqlite3.c for(i=0; *z && i<=n; i++){
n 76497 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3_column_bytes(pStmt, 2);
n 76498 ext/sqlite3/libsqlite/sqlite3.c if( n>24 ){
n 76499 ext/sqlite3/libsqlite/sqlite3.c n = 24;
n 76501 ext/sqlite3/libsqlite/sqlite3.c pSample->nByte = (u8)n;
n 76502 ext/sqlite3/libsqlite/sqlite3.c if( n < 1){
n 76505 ext/sqlite3/libsqlite/sqlite3.c pSample->u.z = sqlite3DbStrNDup(0, z, n);
n 77924 ext/sqlite3/libsqlite/sqlite3.c zName = sqlite3DbStrNDup(db, (char*)pName->z, pName->n);
n 77956 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(zName);
n 77958 ext/sqlite3/libsqlite/sqlite3.c if( (!OMIT_TEMPDB || i!=1 ) && n==sqlite3Strlen30(pDb->zName) &&
n 78007 ext/sqlite3/libsqlite/sqlite3.c if( ALWAYS(pName2!=0) && pName2->n>0 ){
n 78096 ext/sqlite3/libsqlite/sqlite3.c if( !OMIT_TEMPDB && isTemp && pName2->n>0 && iDb!=1 ){
n 78663 ext/sqlite3/libsqlite/sqlite3.c int n;
n 78664 ext/sqlite3/libsqlite/sqlite3.c for(n=0; *z; n++, z++){
n 78665 ext/sqlite3/libsqlite/sqlite3.c if( *z=='"' ){ n++; }
n 78667 ext/sqlite3/libsqlite/sqlite3.c return n + 2;
n 78712 ext/sqlite3/libsqlite/sqlite3.c int i, k, n;
n 78716 ext/sqlite3/libsqlite/sqlite3.c n = 0;
n 78718 ext/sqlite3/libsqlite/sqlite3.c n += identLength(pCol->zName) + 5;
n 78720 ext/sqlite3/libsqlite/sqlite3.c n += identLength(p->zName);
n 78721 ext/sqlite3/libsqlite/sqlite3.c if( n<50 ){
n 78730 ext/sqlite3/libsqlite/sqlite3.c n += 35 + 6*p->nCol;
n 78731 ext/sqlite3/libsqlite/sqlite3.c zStmt = sqlite3DbMallocRaw(0, n);
n 78736 ext/sqlite3/libsqlite/sqlite3.c sqlite3_snprintf(n, zStmt, "CREATE TABLE ");
n 78751 ext/sqlite3/libsqlite/sqlite3.c sqlite3_snprintf(n-k, &zStmt[k], zSep);
n 78769 ext/sqlite3/libsqlite/sqlite3.c assert( k<=n );
n 78771 ext/sqlite3/libsqlite/sqlite3.c sqlite3_snprintf(n-k, &zStmt[k], "%s", zEnd);
n 78854 ext/sqlite3/libsqlite/sqlite3.c int n;
n 78920 ext/sqlite3/libsqlite/sqlite3.c n = (int)(pEnd->z - pParse->sNameToken.z) + 1;
n 78922 ext/sqlite3/libsqlite/sqlite3.c "CREATE %s %.*s", zType2, n, pParse->sNameToken.z
n 79013 ext/sqlite3/libsqlite/sqlite3.c int n;
n 79060 ext/sqlite3/libsqlite/sqlite3.c sEnd.z += sEnd.n;
n 79062 ext/sqlite3/libsqlite/sqlite3.c sEnd.n = 0;
n 79063 ext/sqlite3/libsqlite/sqlite3.c n = (int)(sEnd.z - pBegin->z);
n 79065 ext/sqlite3/libsqlite/sqlite3.c while( ALWAYS(n>0) && sqlite3Isspace(z[n-1]) ){ n--; }
n 79066 ext/sqlite3/libsqlite/sqlite3.c sEnd.z = &z[n-1];
n 79067 ext/sqlite3/libsqlite/sqlite3.c sEnd.n = 1;
n 79085 ext/sqlite3/libsqlite/sqlite3.c int n; /* Temporarily holds the number of cursors assigned */
n 79136 ext/sqlite3/libsqlite/sqlite3.c n = pParse->nTab;
n 79149 ext/sqlite3/libsqlite/sqlite3.c pParse->nTab = n;
n 79542 ext/sqlite3/libsqlite/sqlite3.c nByte = sizeof(*pFKey) + (nCol-1)*sizeof(pFKey->aCol[0]) + pTo->n + 1;
n 79556 ext/sqlite3/libsqlite/sqlite3.c memcpy(z, pTo->z, pTo->n);
n 79557 ext/sqlite3/libsqlite/sqlite3.c z[pTo->n] = 0;
n 79559 ext/sqlite3/libsqlite/sqlite3.c z += pTo->n+1;
n 79582 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(pToCol->a[i].zName);
n 79584 ext/sqlite3/libsqlite/sqlite3.c memcpy(z, pToCol->a[i].zName, n);
n 79585 ext/sqlite3/libsqlite/sqlite3.c z[n] = 0;
n 79586 ext/sqlite3/libsqlite/sqlite3.c z += n+1;
n 79790 ext/sqlite3/libsqlite/sqlite3.c if( pName2->n==0 && pTab && pTab->pSchema==db->aDb[1].pSchema ){
n 79870 ext/sqlite3/libsqlite/sqlite3.c int n;
n 79872 ext/sqlite3/libsqlite/sqlite3.c for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
n 79873 ext/sqlite3/libsqlite/sqlite3.c zName = sqlite3MPrintf(db, "sqlite_autoindex_%s_%d", pTab->zName, n);
n 79901 ext/sqlite3/libsqlite/sqlite3.c nullId.n = sqlite3Strlen30((char*)nullId.z);
n 80222 ext/sqlite3/libsqlite/sqlite3.c unsigned n;
n 80226 ext/sqlite3/libsqlite/sqlite3.c n = 10;
n 80228 ext/sqlite3/libsqlite/sqlite3.c a[i] = n;
n 80229 ext/sqlite3/libsqlite/sqlite3.c if( n>5 ) n--;
n 80621 ext/sqlite3/libsqlite/sqlite3.c if( pAlias->n ){
n 80646 ext/sqlite3/libsqlite/sqlite3.c if( pIndexedBy->n==1 && !pIndexedBy->z ){
n 82466 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 82472 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_value_int(argv[1]);
n 82473 ext/sqlite3/libsqlite/sqlite3.c if( n>30 ) n = 30;
n 82474 ext/sqlite3/libsqlite/sqlite3.c if( n<0 ) n = 0;
n 82482 ext/sqlite3/libsqlite/sqlite3.c if( n==0 && r>=0 && r<LARGEST_INT64-1 ){
n 82484 ext/sqlite3/libsqlite/sqlite3.c }else if( n==0 && r<0 && (-r)<LARGEST_INT64-1 ){
n 82487 ext/sqlite3/libsqlite/sqlite3.c zBuf = sqlite3_mprintf("%.*f",n,r);
n 82530 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 82533 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_value_bytes(argv[0]);
n 82537 ext/sqlite3/libsqlite/sqlite3.c z1 = contextMalloc(context, ((i64)n)+1);
n 82539 ext/sqlite3/libsqlite/sqlite3.c memcpy(z1, z2, n+1);
n 82550 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 82553 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_value_bytes(argv[0]);
n 82557 ext/sqlite3/libsqlite/sqlite3.c z1 = contextMalloc(context, ((i64)n)+1);
n 82559 ext/sqlite3/libsqlite/sqlite3.c memcpy(z1, z2, n+1);
n 82631 ext/sqlite3/libsqlite/sqlite3.c int n;
n 82635 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_value_int(argv[0]);
n 82636 ext/sqlite3/libsqlite/sqlite3.c if( n<1 ){
n 82637 ext/sqlite3/libsqlite/sqlite3.c n = 1;
n 82639 ext/sqlite3/libsqlite/sqlite3.c p = contextMalloc(context, n);
n 82641 ext/sqlite3/libsqlite/sqlite3.c sqlite3_randomness(n, p);
n 82642 ext/sqlite3/libsqlite/sqlite3.c sqlite3_result_blob(context, (char*)p, n, sqlite3_free);
n 83031 ext/sqlite3/libsqlite/sqlite3.c int n;
n 83037 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_value_int(argv[0]);
n 83038 ext/sqlite3/libsqlite/sqlite3.c sqlite3_result_text(context, sqlite3_compileoption_get(n), -1, SQLITE_STATIC);
n 83092 ext/sqlite3/libsqlite/sqlite3.c u64 n;
n 83097 ext/sqlite3/libsqlite/sqlite3.c for(i=0, n=0; zArg[i]; i++){ if( zArg[i]=='\'' ) n++; }
n 83098 ext/sqlite3/libsqlite/sqlite3.c z = contextMalloc(context, ((i64)i)+((i64)n)+3);
n 83130 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 83136 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_value_bytes(argv[0]);
n 83138 ext/sqlite3/libsqlite/sqlite3.c z = zHex = contextMalloc(context, ((i64)n)*2 + 1);
n 83140 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<n; i++, pBlob++){
n 83146 ext/sqlite3/libsqlite/sqlite3.c sqlite3_result_text(context, zHex, n*2, sqlite3_free);
n 83158 ext/sqlite3/libsqlite/sqlite3.c i64 n;
n 83162 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3_value_int64(argv[0]);
n 83163 ext/sqlite3/libsqlite/sqlite3.c testcase( n==db->aLimit[SQLITE_LIMIT_LENGTH] );
n 83164 ext/sqlite3/libsqlite/sqlite3.c testcase( n==db->aLimit[SQLITE_LIMIT_LENGTH]+1 );
n 83165 ext/sqlite3/libsqlite/sqlite3.c if( n>db->aLimit[SQLITE_LIMIT_LENGTH] ){
n 83168 ext/sqlite3/libsqlite/sqlite3.c sqlite3_result_zeroblob(context, (int)n); /* IMP: R-00293-64994 */
n 83503 ext/sqlite3/libsqlite/sqlite3.c i64 n;
n 83513 ext/sqlite3/libsqlite/sqlite3.c p->n++;
n 83521 ext/sqlite3/libsqlite/sqlite3.c assert( argc==1 || p==0 || p->n>0x7fffffff
n 83522 ext/sqlite3/libsqlite/sqlite3.c || p->n==sqlite3_aggregate_count(context) );
n 83528 ext/sqlite3/libsqlite/sqlite3.c sqlite3_result_int64(context, p ? p->n : 0);
n 84808 ext/sqlite3/libsqlite/sqlite3.c tToCol.n = sqlite3Strlen30(tToCol.z);
n 84809 ext/sqlite3/libsqlite/sqlite3.c tFromCol.n = sqlite3Strlen30(tFromCol.z);
n 84874 ext/sqlite3/libsqlite/sqlite3.c tFrom.n = nFrom;
n 84900 ext/sqlite3/libsqlite/sqlite3.c pStep->target.n = nFrom;
n 85083 ext/sqlite3/libsqlite/sqlite3.c int n;
n 85091 ext/sqlite3/libsqlite/sqlite3.c for(n=0; n<pIdx->nColumn; n++){
n 85092 ext/sqlite3/libsqlite/sqlite3.c pIdx->zColAff[n] = pTab->aCol[pIdx->aiColumn[n]].affinity;
n 85094 ext/sqlite3/libsqlite/sqlite3.c pIdx->zColAff[n++] = SQLITE_AFF_NONE;
n 85095 ext/sqlite3/libsqlite/sqlite3.c pIdx->zColAff[n] = 0;
n 87065 ext/sqlite3/libsqlite/sqlite3.c int (*bind_blob)(sqlite3_stmt*,int,const void*,int n,void(*)(void*));
n 87073 ext/sqlite3/libsqlite/sqlite3.c int (*bind_text)(sqlite3_stmt*,int,const char*,int n,void(*)(void*));
n 88114 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 88118 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3Strlen30(z);
n 88120 ext/sqlite3/libsqlite/sqlite3.c if( iLength[i]==n && sqlite3StrNICmp(&zText[iOffset[i]],z,n)==0 ){
n 88426 ext/sqlite3/libsqlite/sqlite3.c zDb = pId2->n>0 ? pDb->zName : 0;
n 88522 ext/sqlite3/libsqlite/sqlite3.c if( pId2->n==0 && b>=0 ){
n 88570 ext/sqlite3/libsqlite/sqlite3.c if( pId2->n==0 && eMode==PAGER_LOCKINGMODE_QUERY ){
n 88578 ext/sqlite3/libsqlite/sqlite3.c if( pId2->n==0 ){
n 88633 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(zRight);
n 88635 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3StrNICmp(zRight, zMode, n)==0 ) break;
n 88643 ext/sqlite3/libsqlite/sqlite3.c if( eMode==PAGER_JOURNALMODE_QUERY && pId2->n==0 ){
n 88646 ext/sqlite3/libsqlite/sqlite3.c pId2->n = 1;
n 88649 ext/sqlite3/libsqlite/sqlite3.c if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
n 90619 ext/sqlite3/libsqlite/sqlite3.c if( p->n==aKeyword[j].nChar
n 90620 ext/sqlite3/libsqlite/sqlite3.c && sqlite3StrNICmp((char*)p->z, &zKeyText[aKeyword[j].i], p->n)==0 ){
n 91890 ext/sqlite3/libsqlite/sqlite3.c int addr1, n;
n 91905 ext/sqlite3/libsqlite/sqlite3.c if( sqlite3ExprIsInteger(p->pLimit, &n) ){
n 91906 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeAddOp2(v, OP_Integer, n, iLimit);
n 91908 ext/sqlite3/libsqlite/sqlite3.c if( n==0 ){
n 91911 ext/sqlite3/libsqlite/sqlite3.c if( p->nSelectRow > (double)n ) p->nSelectRow = (double)n;
n 93823 ext/sqlite3/libsqlite/sqlite3.c sColname.n = sqlite3Strlen30(zColname);
n 95029 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(argv[i])+1;
n 95030 ext/sqlite3/libsqlite/sqlite3.c z = sqlite3_malloc( n );
n 95032 ext/sqlite3/libsqlite/sqlite3.c memcpy(z, argv[i], n);
n 95125 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 95128 ext/sqlite3/libsqlite/sqlite3.c n = SQLITE_PTR_TO_INT(azResult[0]);
n 95129 ext/sqlite3/libsqlite/sqlite3.c for(i=1; i<n; i++){ if( azResult[i] ) sqlite3_free(azResult[i]); }
n 95243 ext/sqlite3/libsqlite/sqlite3.c if( pName2->n>0 ){
n 95266 ext/sqlite3/libsqlite/sqlite3.c if( db->init.busy==0 && pName2->n==0 && pTab
n 95416 ext/sqlite3/libsqlite/sqlite3.c nameToken.n = sqlite3Strlen30(nameToken.z);
n 95433 ext/sqlite3/libsqlite/sqlite3.c z = sqlite3DbStrNDup(db, (char*)pAll->z, pAll->n);
n 95453 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(pLink->table);
n 95454 ext/sqlite3/libsqlite/sqlite3.c pTab = sqlite3HashFind(&pLink->pTabSchema->tblHash, pLink->table, n);
n 95499 ext/sqlite3/libsqlite/sqlite3.c pTriggerStep = sqlite3DbMallocZero(db, sizeof(TriggerStep) + pName->n);
n 95502 ext/sqlite3/libsqlite/sqlite3.c memcpy(z, pName->z, pName->n);
n 95504 ext/sqlite3/libsqlite/sqlite3.c pTriggerStep->target.n = pName->n;
n 95657 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(pTrigger->table);
n 95658 ext/sqlite3/libsqlite/sqlite3.c return sqlite3HashFind(&pTrigger->pTabSchema->tblHash, pTrigger->table, n);
n 97565 ext/sqlite3/libsqlite/sqlite3.c pParse->sNameToken.n = (int)(&pModuleName->z[pModuleName->n] - pName1->z);
n 97588 ext/sqlite3/libsqlite/sqlite3.c int n = pParse->sArg.n;
n 97590 ext/sqlite3/libsqlite/sqlite3.c addModuleArgument(db, pParse->pNewTable, sqlite3DbStrNDup(db, z, n));
n 97621 ext/sqlite3/libsqlite/sqlite3.c pParse->sNameToken.n = (int)(pEnd->z - pParse->sNameToken.z) + pEnd->n;
n 97683 ext/sqlite3/libsqlite/sqlite3.c pParse->sArg.n = 0;
n 97694 ext/sqlite3/libsqlite/sqlite3.c pArg->n = p->n;
n 97697 ext/sqlite3/libsqlite/sqlite3.c pArg->n = (int)(&p->z[p->n] - pArg->z);
n 98262 ext/sqlite3/libsqlite/sqlite3.c int i, n;
n 98269 ext/sqlite3/libsqlite/sqlite3.c n = (pToplevel->nVtabLock+1)*sizeof(pToplevel->apVtabLock[0]);
n 98270 ext/sqlite3/libsqlite/sqlite3.c apVtabLock = sqlite3_realloc(pToplevel->apVtabLock, n);
n 98522 ext/sqlite3/libsqlite/sqlite3.c int n; /* Number of assigned cursor values */
n 98734 ext/sqlite3/libsqlite/sqlite3.c assert( pMaskSet->n<=(int)sizeof(Bitmask)*8 );
n 98735 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<pMaskSet->n; i++){
n 98752 ext/sqlite3/libsqlite/sqlite3.c assert( pMaskSet->n < ArraySize(pMaskSet->ix) );
n 98753 ext/sqlite3/libsqlite/sqlite3.c pMaskSet->ix[pMaskSet->n++] = iCursor;
n 100149 ext/sqlite3/libsqlite/sqlite3.c int n; /* Column counter */
n 100219 ext/sqlite3/libsqlite/sqlite3.c n = 0;
n 100228 ext/sqlite3/libsqlite/sqlite3.c pIdx->aiColumn[n] = pTerm->u.leftColumn;
n 100230 ext/sqlite3/libsqlite/sqlite3.c pIdx->azColl[n] = ALWAYS(pColl) ? pColl->zName : "BINARY";
n 100231 ext/sqlite3/libsqlite/sqlite3.c n++;
n 100235 ext/sqlite3/libsqlite/sqlite3.c assert( (u32)n==pLevel->plan.nEq );
n 100241 ext/sqlite3/libsqlite/sqlite3.c pIdx->aiColumn[n] = i;
n 100242 ext/sqlite3/libsqlite/sqlite3.c pIdx->azColl[n] = "BINARY";
n 100243 ext/sqlite3/libsqlite/sqlite3.c n++;
n 100248 ext/sqlite3/libsqlite/sqlite3.c pIdx->aiColumn[n] = i;
n 100249 ext/sqlite3/libsqlite/sqlite3.c pIdx->azColl[n] = "BINARY";
n 100250 ext/sqlite3/libsqlite/sqlite3.c n++;
n 100253 ext/sqlite3/libsqlite/sqlite3.c assert( n==nColumn );
n 100641 ext/sqlite3/libsqlite/sqlite3.c int n;
n 100663 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3ValueBytes(pVal, pColl->enc);
n 100680 ext/sqlite3/libsqlite/sqlite3.c c = pColl->xCmp(pColl->pUser, nSample, zSample, n, z);
n 100685 ext/sqlite3/libsqlite/sqlite3.c c = pColl->xCmp(pColl->pUser, aSample[i].nByte, aSample[i].u.z, n, z);
n 101567 ext/sqlite3/libsqlite/sqlite3.c while( n>0 && zAff[0]==SQLITE_AFF_NONE ){
n 101568 ext/sqlite3/libsqlite/sqlite3.c n--;
n 101572 ext/sqlite3/libsqlite/sqlite3.c while( n>1 && zAff[n-1]==SQLITE_AFF_NONE ){
n 101573 ext/sqlite3/libsqlite/sqlite3.c n--;
n 101577 ext/sqlite3/libsqlite/sqlite3.c if( n>0 ){
n 101578 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeAddOp2(v, OP_Affinity, base, n);
n 101579 ext/sqlite3/libsqlite/sqlite3.c sqlite3VdbeChangeP4(v, -1, zAff, n);
n 101580 ext/sqlite3/libsqlite/sqlite3.c sqlite3ExprCacheAffinityChange(pParse, base, n);
n 102800 ext/sqlite3/libsqlite/sqlite3.c assert( pWC->vmask==0 && pMaskSet->n==0 );
n 103087 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 103088 ext/sqlite3/libsqlite/sqlite3.c for(; b; b=b>>1, n++){}
n 103090 ext/sqlite3/libsqlite/sqlite3.c SQLITE_INT_TO_PTR(n), P4_INT32);
n 103091 ext/sqlite3/libsqlite/sqlite3.c assert( n<=pTab->nCol );
n 103138 ext/sqlite3/libsqlite/sqlite3.c int n;
n 103143 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3Strlen30(z);
n 103144 ext/sqlite3/libsqlite/sqlite3.c if( n+nQPlan < sizeof(sqlite3_query_plan)-10 ){
n 103149 ext/sqlite3/libsqlite/sqlite3.c memcpy(&sqlite3_query_plan[nQPlan], z, n);
n 103150 ext/sqlite3/libsqlite/sqlite3.c nQPlan += n;
n 103160 ext/sqlite3/libsqlite/sqlite3.c n = sqlite3Strlen30(pLevel->plan.u.pIdx->zName);
n 103161 ext/sqlite3/libsqlite/sqlite3.c if( n+nQPlan < sizeof(sqlite3_query_plan)-2 ){
n 103162 ext/sqlite3/libsqlite/sqlite3.c memcpy(&sqlite3_query_plan[nQPlan], pLevel->plan.u.pIdx->zName, n);
n 103163 ext/sqlite3/libsqlite/sqlite3.c nQPlan += n;
n 103386 ext/sqlite3/libsqlite/sqlite3.c pOut->zEnd = &pEnd->z[pEnd->n];
n 103396 ext/sqlite3/libsqlite/sqlite3.c pOut->zEnd = &pValue->z[pValue->n];
n 103425 ext/sqlite3/libsqlite/sqlite3.c pOut->zEnd = &pPostOp->z[pPostOp->n];
n 105491 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy0.n = (int)(pParse->sLastToken.z-yymsp[-2].minor.yy0.z) + pParse->sLastToken.n;
n 105530 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy0.n = (int)(&yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n] - yymsp[-3].minor.yy0.z);
n 105536 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy0.n = (int)(&yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n] - yymsp[-5].minor.yy0.z);
n 105540 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.z=yymsp[-1].minor.yy0.z; yygotominor.yy0.n=yymsp[0].minor.yy0.n+(int)(yymsp[0].minor.yy0.z-yymsp[-1].minor.yy0.z);}
n 105624 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.n = 0; yygotominor.yy0.z = 0;}
n 105717 ext/sqlite3/libsqlite/sqlite3.c if( yymsp[0].minor.yy0.n>0 ) sqlite3ExprListSetName(pParse, yygotominor.yy322, &yymsp[0].minor.yy0, 1);
n 105736 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.n = 0;}
n 105769 ext/sqlite3/libsqlite/sqlite3.c if( yymsp[-6].minor.yy259==0 && yymsp[-2].minor.yy0.n==0 && yymsp[-1].minor.yy314==0 && yymsp[0].minor.yy384==0 ){
n 105781 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.z=0; yygotominor.yy0.n=0;}
n 105814 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.z=0; yygotominor.yy0.n=1;}
n 105973 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106121 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106135 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106150 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106166 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = yymsp[0].minor.yy0.z ? &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n] : &yymsp[-1].minor.yy0.z[yymsp[-1].minor.yy0.n];
n 106180 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106193 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106225 ext/sqlite3/libsqlite/sqlite3.c if( yymsp[-1].minor.yy0.n>0 ){
n 106238 ext/sqlite3/libsqlite/sqlite3.c if( yymsp[-1].minor.yy0.n>0 ){
n 106249 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.z = 0; yygotominor.yy0.n = 0;}
n 106277 ext/sqlite3/libsqlite/sqlite3.c all.n = (int)(yymsp[0].minor.yy0.z - yymsp[-3].minor.yy0.z) + yymsp[0].minor.yy0.n;
n 106284 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy0 = (yymsp[-6].minor.yy0.n==0?yymsp[-7].minor.yy0:yymsp[-6].minor.yy0);
n 106371 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106381 ext/sqlite3/libsqlite/sqlite3.c yygotominor.yy118.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n 106948 ext/sqlite3/libsqlite/sqlite3.c if( n<2 ) return TK_ID;
n 106950 ext/sqlite3/libsqlite/sqlite3.c (charMap(z[n-1])*3) ^
n 106951 ext/sqlite3/libsqlite/sqlite3.c n) % 127;
n 106953 ext/sqlite3/libsqlite/sqlite3.c if( aLen[i]==n && sqlite3StrNICmp(&zText[aOffset[i]],z,n)==0 ){
n 107081 ext/sqlite3/libsqlite/sqlite3.c return keywordCode((char*)z, n);
n 107345 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 107350 ext/sqlite3/libsqlite/sqlite3.c n++;
n 107352 ext/sqlite3/libsqlite/sqlite3.c }else if( c=='(' && n>0 ){
n 107369 ext/sqlite3/libsqlite/sqlite3.c if( n==0 ) *tokenType = TK_ILLEGAL;
n 107442 ext/sqlite3/libsqlite/sqlite3.c pParse->sLastToken.n = sqlite3GetToken((unsigned char*)&zSql[i],&tokenType);
n 107443 ext/sqlite3/libsqlite/sqlite3.c i += pParse->sLastToken.n;
n 108493 ext/sqlite3/libsqlite/sqlite3.c while( n>0 && z[n-1]==' ' ){ n--; }
n 108494 ext/sqlite3/libsqlite/sqlite3.c return n==0;
n 108509 ext/sqlite3/libsqlite/sqlite3.c int rc, n;
n 108510 ext/sqlite3/libsqlite/sqlite3.c n = nKey1<nKey2 ? nKey1 : nKey2;
n 108511 ext/sqlite3/libsqlite/sqlite3.c rc = memcmp(pKey1, pKey2, n);
n 108514 ext/sqlite3/libsqlite/sqlite3.c && allSpaces(((char*)pKey1)+n, nKey1-n)
n 108515 ext/sqlite3/libsqlite/sqlite3.c && allSpaces(((char*)pKey2)+n, nKey2-n)
n 110797 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Strlen30(zWord);
n 110798 ext/sqlite3/libsqlite/sqlite3.c rc = (sqlite3KeywordCode((u8*)zWord, n)!=TK_ID) ? SQLITE_N_KEYWORD : 0;
n 112070 ext/sqlite3/libsqlite/sqlite3.c int n; /* Number of bytes in buffer z */
n 113085 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 113086 ext/sqlite3/libsqlite/sqlite3.c z = (char *)sqlite3Fts3NextToken(aCol[iCol], &n);
n 113087 ext/sqlite3/libsqlite/sqlite3.c memcpy(zCsr, z, n);
n 113088 ext/sqlite3/libsqlite/sqlite3.c zCsr[n] = '\0';
n 113091 ext/sqlite3/libsqlite/sqlite3.c zCsr += n+1;
n 113534 ext/sqlite3/libsqlite/sqlite3.c int n = (int)(pEnd - *ppPoslist);
n 113536 ext/sqlite3/libsqlite/sqlite3.c memcpy(p, *ppPoslist, n);
n 113537 ext/sqlite3/libsqlite/sqlite3.c p += n;
n 113572 ext/sqlite3/libsqlite/sqlite3.c int n = (int)(pEnd - *ppPoslist);
n 113574 ext/sqlite3/libsqlite/sqlite3.c memcpy(p, *ppPoslist, n);
n 113575 ext/sqlite3/libsqlite/sqlite3.c p += n;
n 113627 ext/sqlite3/libsqlite/sqlite3.c int n = 0; /* Number of bytes written */
n 113630 ext/sqlite3/libsqlite/sqlite3.c n = 1 + sqlite3Fts3PutVarint(&p[1], iCol);
n 113632 ext/sqlite3/libsqlite/sqlite3.c *pp = &p[n];
n 113634 ext/sqlite3/libsqlite/sqlite3.c return n;
n 113669 ext/sqlite3/libsqlite/sqlite3.c int n = fts3PutColNumber(&p, iCol1);
n 113670 ext/sqlite3/libsqlite/sqlite3.c p1 += n;
n 113671 ext/sqlite3/libsqlite/sqlite3.c p2 += n;
n 114390 ext/sqlite3/libsqlite/sqlite3.c filter.nTerm = pTok->n;
n 115166 ext/sqlite3/libsqlite/sqlite3.c pToken->z, pToken->n, pToken->isPrefix, &pToken->pSegcsr
n 115379 ext/sqlite3/libsqlite/sqlite3.c pTab, pFirst->pSegcsr, iCol, pFirst->z, pFirst->n);
n 116697 ext/sqlite3/libsqlite/sqlite3.c int n = (pCsr->nStop<pCsr->csr.nTerm) ? pCsr->nStop : pCsr->csr.nTerm;
n 116698 ext/sqlite3/libsqlite/sqlite3.c int mc = memcmp(pCsr->zStop, pCsr->csr.zTerm, n);
n 117067 ext/sqlite3/libsqlite/sqlite3.c rc = pModule->xOpen(pTokenizer, z, n, &pCursor);
n 117086 ext/sqlite3/libsqlite/sqlite3.c pRet->pPhrase->aToken[0].n = nToken;
n 117090 ext/sqlite3/libsqlite/sqlite3.c if( iEnd<n && z[iEnd]=='*' ){
n 117193 ext/sqlite3/libsqlite/sqlite3.c pToken->n = nByte;
n 117221 ext/sqlite3/libsqlite/sqlite3.c zBuf += p->pPhrase->aToken[jj].n;
n 117261 ext/sqlite3/libsqlite/sqlite3.c unsigned char n; /* Length of the keyword */
n 117277 ext/sqlite3/libsqlite/sqlite3.c int nInput = n;
n 117300 ext/sqlite3/libsqlite/sqlite3.c if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
n 117302 ext/sqlite3/libsqlite/sqlite3.c int nKey = pKey->n;
n 117401 ext/sqlite3/libsqlite/sqlite3.c rc = getNextToken(pParse, iCol, &z[iColLen], n-iColLen, ppExpr, pnConsumed);
n 117486 ext/sqlite3/libsqlite/sqlite3.c int nIn = n;
n 117603 ext/sqlite3/libsqlite/sqlite3.c *pnConsumed = n - nIn;
n 117659 ext/sqlite3/libsqlite/sqlite3.c if( n<0 ){
n 117660 ext/sqlite3/libsqlite/sqlite3.c n = (int)strlen(z);
n 117662 ext/sqlite3/libsqlite/sqlite3.c rc = fts3ExprParse(&sParse, z, n, ppExpr, &nParsed);
n 117743 ext/sqlite3/libsqlite/sqlite3.c pPhrase->aToken[i].n, pPhrase->aToken[i].z,
n 117911 ext/sqlite3/libsqlite/sqlite3.c void *p = sqlite3_malloc(n);
n 117913 ext/sqlite3/libsqlite/sqlite3.c memset(p, 0, n);
n 118856 ext/sqlite3/libsqlite/sqlite3.c int n = c->iOffset-iStartOffset;
n 118857 ext/sqlite3/libsqlite/sqlite3.c if( n>c->nAllocated ){
n 118859 ext/sqlite3/libsqlite/sqlite3.c c->nAllocated = n+20;
n 118864 ext/sqlite3/libsqlite/sqlite3.c porter_stemmer(&z[iStartOffset], n, c->zToken, pnBytes);
n 118972 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3_value_bytes(argv[1]);
n 118973 ext/sqlite3/libsqlite/sqlite3.c if( n!=sizeof(pPtr) ){
n 119055 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 119064 ext/sqlite3/libsqlite/sqlite3.c z = (char *)sqlite3Fts3NextToken(zCopy, &n);
n 119065 ext/sqlite3/libsqlite/sqlite3.c z[n] = '\0';
n 119075 ext/sqlite3/libsqlite/sqlite3.c z = &z[n+1];
n 119076 ext/sqlite3/libsqlite/sqlite3.c while( z<zEnd && (NULL!=(z = (char *)sqlite3Fts3NextToken(z, &n))) ){
n 119086 ext/sqlite3/libsqlite/sqlite3.c z[n] = '\0';
n 119088 ext/sqlite3/libsqlite/sqlite3.c z = &z[n+1];
n 119462 ext/sqlite3/libsqlite/sqlite3.c int i, n = (int)strlen(argv[1]);
n 119463 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<n; i++){
n 119569 ext/sqlite3/libsqlite/sqlite3.c int i, n = c->iOffset-iStartOffset;
n 119570 ext/sqlite3/libsqlite/sqlite3.c if( n>c->nTokenAllocated ){
n 119572 ext/sqlite3/libsqlite/sqlite3.c c->nTokenAllocated = n+20;
n 119577 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<n; i++){
n 119585 ext/sqlite3/libsqlite/sqlite3.c *pnBytes = n;
n 120819 ext/sqlite3/libsqlite/sqlite3.c int n = sqlite3Fts3GetVarint(pReader->aDoclist, &pReader->iDocid);
n 120820 ext/sqlite3/libsqlite/sqlite3.c pReader->pOffsetList = &pReader->aDoclist[n];
n 121033 ext/sqlite3/libsqlite/sqlite3.c int n = (n1<n2 ? n1 : n2);
n 121034 ext/sqlite3/libsqlite/sqlite3.c int c = memcmp(z1, z2, n);
n 121285 ext/sqlite3/libsqlite/sqlite3.c sqlite3_bind_blob(pStmt, 2, z, n, SQLITE_STATIC);
n 121334 ext/sqlite3/libsqlite/sqlite3.c int n;
n 121336 ext/sqlite3/libsqlite/sqlite3.c for(n=0; n<nPrev && zPrev[n]==zNext[n]; n++);
n 121337 ext/sqlite3/libsqlite/sqlite3.c return n;
n 122628 ext/sqlite3/libsqlite/sqlite3.c && (pPT->n==nToken || (pPT->isPrefix && pPT->n<nToken))
n 122629 ext/sqlite3/libsqlite/sqlite3.c && (0==memcmp(zToken, pPT->z, pPT->n))
n 122989 ext/sqlite3/libsqlite/sqlite3.c int n; /* Length of z in bytes (excl. nul-term) */
n 123379 ext/sqlite3/libsqlite/sqlite3.c if( pStr->n+nAppend+1>=pStr->nAlloc ){
n 123390 ext/sqlite3/libsqlite/sqlite3.c memcpy(&pStr->z[pStr->n], zAppend, nAppend);
n 123391 ext/sqlite3/libsqlite/sqlite3.c pStr->n += nAppend;
n 123392 ext/sqlite3/libsqlite/sqlite3.c pStr->z[pStr->n] = '\0';
n 123543 ext/sqlite3/libsqlite/sqlite3.c int n = nDoc - iBegin;
n 123544 ext/sqlite3/libsqlite/sqlite3.c rc = fts3SnippetShift(pTab, nSnippet, &zDoc[iBegin], n, &iPos, &hlmask);
n 124335 ext/sqlite3/libsqlite/sqlite3.c sqlite3_result_text(pCtx, res.z, res.n-1, sqlite3_free);
n 124379 ext/sqlite3/libsqlite/sqlite3.c int n = pCsr->nMatchinfo * sizeof(u32);
n 124380 ext/sqlite3/libsqlite/sqlite3.c sqlite3_result_blob(pContext, pCsr->aMatchinfo, n, SQLITE_TRANSIENT);
n 128219 ext/sqlite3/libsqlite/sqlite3.c int n = 0;
n 128222 ext/sqlite3/libsqlite/sqlite3.c n = strlen(argv[0])+1;
n 128224 ext/sqlite3/libsqlite/sqlite3.c p = (IcuTokenizer *)sqlite3_malloc(sizeof(IcuTokenizer)+n);
n 128230 ext/sqlite3/libsqlite/sqlite3.c if( n ){
n 128232 ext/sqlite3/libsqlite/sqlite3.c memcpy(p->zLocale, argv[0], n);
n 693 ext/sqlite3/libsqlite/sqlite3.h int (*xShmLock)(sqlite3_file*, int offset, int n, int flags);
n 3036 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API int sqlite3_bind_blob(sqlite3_stmt*, int, const void*, int n, void(*)(void*));
n 3041 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API int sqlite3_bind_text(sqlite3_stmt*, int, const char*, int n, void(*)(void*));
n 3044 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API int sqlite3_bind_zeroblob(sqlite3_stmt*, int, int n);
n 4053 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API void sqlite3_result_zeroblob(sqlite3_context*, int n);
n 5203 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API int sqlite3_blob_write(sqlite3_blob *, const void *z, int n, int iOffset);
n 37 ext/sqlite3/libsqlite/sqlite3ext.h int (*bind_blob)(sqlite3_stmt*,int,const void*,int n,void(*)(void*));
n 45 ext/sqlite3/libsqlite/sqlite3ext.h int (*bind_text)(sqlite3_stmt*,int,const char*,int n,void(*)(void*));
n 3983 ext/standard/basic_functions.c unsigned long n;
n 3993 ext/standard/basic_functions.c n = strtoul(ip, NULL, 0);
n 3995 ext/standard/basic_functions.c myaddr.s_addr = htonl(n);
n 141 ext/standard/crypt.c while (--n >= 0) {
n 49 ext/standard/crypt_sha256.c size_t n = strlen(src);
n 50 ext/standard/crypt_sha256.c if (n > len) {
n 51 ext/standard/crypt_sha256.c n = len;
n 53 ext/standard/crypt_sha256.c return strncpy(dst, src, len) + n;
n 79 ext/standard/crypt_sha256.c (((n) << 24) | (((n) & 0xff00) << 8) | (((n) >> 8) & 0xff00) | ((n) >> 24))
n 81 ext/standard/crypt_sha256.c # define SWAP(n) (n)
n 529 ext/standard/crypt_sha256.c int n = _snprintf(cp, MAX(0, buflen), "%s%u$", sha256_rounds_prefix, rounds);
n 531 ext/standard/crypt_sha256.c int n = snprintf(cp, MAX(0, buflen), "%s%zu$", sha256_rounds_prefix, rounds);
n 533 ext/standard/crypt_sha256.c cp += n;
n 534 ext/standard/crypt_sha256.c buflen -= n;
n 548 ext/standard/crypt_sha256.c int n = (N); \
n 549 ext/standard/crypt_sha256.c while (n-- > 0 && buflen > 0) \
n 74 ext/standard/crypt_sha512.c (((n) << 56) \
n 75 ext/standard/crypt_sha512.c | (((n) & 0xff00) << 40) \
n 76 ext/standard/crypt_sha512.c | (((n) & 0xff0000) << 24) \
n 77 ext/standard/crypt_sha512.c | (((n) & 0xff000000) << 8) \
n 78 ext/standard/crypt_sha512.c | (((n) >> 8) & 0xff000000) \
n 79 ext/standard/crypt_sha512.c | (((n) >> 24) & 0xff0000) \
n 80 ext/standard/crypt_sha512.c | (((n) >> 40) & 0xff00) \
n 81 ext/standard/crypt_sha512.c | ((n) >> 56))
n 83 ext/standard/crypt_sha512.c # define SWAP(n) (n)
n 564 ext/standard/crypt_sha512.c int n = _snprintf(cp, MAX(0, buflen), "%s%u$", sha512_rounds_prefix, rounds);
n 566 ext/standard/crypt_sha512.c int n = snprintf(cp, MAX(0, buflen), "%s%zu$", sha512_rounds_prefix, rounds);
n 568 ext/standard/crypt_sha512.c cp += n;
n 569 ext/standard/crypt_sha512.c buflen -= n;
n 583 ext/standard/crypt_sha512.c int n = (N); \
n 584 ext/standard/crypt_sha512.c while (n-- > 0 && buflen > 0) \
n 435 ext/standard/dir.c int n;
n 506 ext/standard/dir.c for (n = 0; n < globbuf.gl_pathc; n++) {
n 508 ext/standard/dir.c if (php_check_open_basedir_ex(globbuf.gl_pathv[n], 0 TSRMLS_CC)) {
n 524 ext/standard/dir.c if (0 != VCWD_STAT(globbuf.gl_pathv[n], &s)) {
n 532 ext/standard/dir.c add_next_index_string(return_value, globbuf.gl_pathv[n]+cwd_skip, 1);
n 553 ext/standard/dir.c int n, i;
n 571 ext/standard/dir.c n = php_stream_scandir(dirn, &namelist, context, (void *) php_stream_dirent_alphasort);
n 573 ext/standard/dir.c n = php_stream_scandir(dirn, &namelist, context, NULL);
n 575 ext/standard/dir.c n = php_stream_scandir(dirn, &namelist, context, (void *) php_stream_dirent_alphasortr);
n 577 ext/standard/dir.c if (n < 0) {
n 584 ext/standard/dir.c for (i = 0; i < n; i++) {
n 588 ext/standard/dir.c if (n) {
n 420 ext/standard/dns.c long n, i;
n 428 ext/standard/dns.c n = dn_expand(answer->qb2, answer->qb2+65536, cp, name, sizeof(name) - 2);
n 429 ext/standard/dns.c if (n < 0) {
n 432 ext/standard/dns.c cp += n;
n 471 ext/standard/dns.c GETSHORT(n, cp);
n 472 ext/standard/dns.c add_assoc_long(*subarray, "pri", n);
n 488 ext/standard/dns.c n = dn_expand(answer->qb2, answer->qb2+65536, cp, name, (sizeof name) - 2);
n 489 ext/standard/dns.c if (n < 0) {
n 492 ext/standard/dns.c cp += n;
n 498 ext/standard/dns.c n = *cp & 0xFF;
n 500 ext/standard/dns.c add_assoc_stringl(*subarray, "cpu", (char*)cp, n, 1);
n 501 ext/standard/dns.c cp += n;
n 502 ext/standard/dns.c n = *cp & 0xFF;
n 504 ext/standard/dns.c add_assoc_stringl(*subarray, "os", (char*)cp, n, 1);
n 505 ext/standard/dns.c cp += n;
n 519 ext/standard/dns.c n = cp[ll];
n 520 ext/standard/dns.c memcpy(tp + ll , cp + ll + 1, n);
n 521 ext/standard/dns.c add_next_index_stringl(entries, cp + ll + 1, n, 1);
n 522 ext/standard/dns.c ll = ll + n + 1;
n 533 ext/standard/dns.c n = dn_expand(answer->qb2, answer->qb2+65536, cp, name, (sizeof name) -2);
n 534 ext/standard/dns.c if (n < 0) {
n 537 ext/standard/dns.c cp += n;
n 539 ext/standard/dns.c n = dn_expand(answer->qb2, answer->qb2+65536, cp, name, (sizeof name) -2);
n 540 ext/standard/dns.c if (n < 0) {
n 543 ext/standard/dns.c cp += n;
n 545 ext/standard/dns.c GETLONG(n, cp);
n 546 ext/standard/dns.c add_assoc_long(*subarray, "serial", n);
n 547 ext/standard/dns.c GETLONG(n, cp);
n 548 ext/standard/dns.c add_assoc_long(*subarray, "refresh", n);
n 549 ext/standard/dns.c GETLONG(n, cp);
n 550 ext/standard/dns.c add_assoc_long(*subarray, "retry", n);
n 551 ext/standard/dns.c GETLONG(n, cp);
n 552 ext/standard/dns.c add_assoc_long(*subarray, "expire", n);
n 553 ext/standard/dns.c GETLONG(n, cp);
n 554 ext/standard/dns.c add_assoc_long(*subarray, "minimum-ttl", n);
n 592 ext/standard/dns.c n = ((int)cp[0]) & 0xFF;
n 594 ext/standard/dns.c add_assoc_long(*subarray, "masklen", n);
n 596 ext/standard/dns.c if (n > 15) {
n 602 ext/standard/dns.c if (n % 16 > 8) {
n 626 ext/standard/dns.c for (i = (n + 8) / 16; i < 8; i++) {
n 656 ext/standard/dns.c n = dn_expand(answer->qb2, answer->qb2+65536, cp, name, (sizeof name) - 2);
n 657 ext/standard/dns.c if (n < 0) {
n 660 ext/standard/dns.c cp += n;
n 666 ext/standard/dns.c GETSHORT(n, cp);
n 667 ext/standard/dns.c add_assoc_long(*subarray, "pri", n);
n 668 ext/standard/dns.c GETSHORT(n, cp);
n 669 ext/standard/dns.c add_assoc_long(*subarray, "weight", n);
n 670 ext/standard/dns.c GETSHORT(n, cp);
n 671 ext/standard/dns.c add_assoc_long(*subarray, "port", n);
n 672 ext/standard/dns.c n = dn_expand(answer->qb2, answer->qb2+65536, cp, name, (sizeof name) - 2);
n 673 ext/standard/dns.c if (n < 0) {
n 676 ext/standard/dns.c cp += n;
n 681 ext/standard/dns.c GETSHORT(n, cp);
n 682 ext/standard/dns.c add_assoc_long(*subarray, "order", n);
n 683 ext/standard/dns.c GETSHORT(n, cp);
n 684 ext/standard/dns.c add_assoc_long(*subarray, "pref", n);
n 685 ext/standard/dns.c n = (cp[0] & 0xFF);
n 686 ext/standard/dns.c add_assoc_stringl(*subarray, "flags", (char*)++cp, n, 1);
n 687 ext/standard/dns.c cp += n;
n 688 ext/standard/dns.c n = (cp[0] & 0xFF);
n 689 ext/standard/dns.c add_assoc_stringl(*subarray, "services", (char*)++cp, n, 1);
n 690 ext/standard/dns.c cp += n;
n 691 ext/standard/dns.c n = (cp[0] & 0xFF);
n 692 ext/standard/dns.c add_assoc_stringl(*subarray, "regex", (char*)++cp, n, 1);
n 693 ext/standard/dns.c cp += n;
n 694 ext/standard/dns.c n = dn_expand(answer->qb2, answer->qb2+65536, cp, name, (sizeof name) - 2);
n 695 ext/standard/dns.c if (n < 0) {
n 698 ext/standard/dns.c cp += n;
n 732 ext/standard/dns.c int n, qd, an, ns = 0, ar = 0;
n 856 ext/standard/dns.c n = php_dns_search(handle, hostname, C_IN, type_to_fetch, answer.qb2, sizeof answer);
n 858 ext/standard/dns.c if (n < 0) {
n 864 ext/standard/dns.c end = answer.qb2 + n;
n 873 ext/standard/dns.c n = dn_skipname(cp, end);
n 874 ext/standard/dns.c if (n < 0) {
n 880 ext/standard/dns.c cp += n + QFIXEDSZ;
n 928 ext/standard/filestat.c int groups, n, i;
n 934 ext/standard/filestat.c n=getgroups(groups, gids);
n 935 ext/standard/filestat.c for(i=0;i<n;i++){
n 303 ext/standard/formatted_print.c register int andbits = (1 << n) - 1;
n 306 ext/standard/formatted_print.c *buffer, pos, size, number, width, padding, alignment, n,
n 308 ext/standard/formatted_print.c PRINTF_DEBUG(("sprintf: append2n 2^%d andbits=%x\n", n, andbits));
n 315 ext/standard/formatted_print.c num >>= n;
n 834 ext/standard/ftp_fopen_wrapper.c int n;
n 846 ext/standard/ftp_fopen_wrapper.c n = sscanf(p, "%4u%2u%2u%2u%2u%2u", &tm.tm_year, &tm.tm_mon, &tm.tm_mday, &tm.tm_hour, &tm.tm_min, &tm.tm_sec);
n 847 ext/standard/ftp_fopen_wrapper.c if (n != 6) {
n 85 ext/standard/md5.c int n;
n 99 ext/standard/md5.c while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n 100 ext/standard/md5.c PHP_MD5Update(&context, buf, n);
n 107 ext/standard/md5.c if (n<0) {
n 169 ext/standard/md5.c (*(php_uint32 *)&ptr[(n) * 4])
n 171 ext/standard/md5.c SET(n)
n 174 ext/standard/md5.c (ctx->block[(n)] = \
n 175 ext/standard/md5.c (php_uint32)ptr[(n) * 4] | \
n 176 ext/standard/md5.c ((php_uint32)ptr[(n) * 4 + 1] << 8) | \
n 177 ext/standard/md5.c ((php_uint32)ptr[(n) * 4 + 2] << 16) | \
n 178 ext/standard/md5.c ((php_uint32)ptr[(n) * 4 + 3] << 24))
n 180 ext/standard/md5.c (ctx->block[(n)])
n 116 ext/standard/metaphone.c #define Look_Back_Letter(n) (w_idx >= n ? toupper(word[w_idx-n]) : '\0')
n 122 ext/standard/metaphone.c #define Look_Ahead_Letter(n) (toupper(Lookahead(word+w_idx, n)))
n 359 ext/standard/pack.c char n = *v++;
n 361 ext/standard/pack.c if (n >= '0' && n <= '9') {
n 362 ext/standard/pack.c n -= '0';
n 363 ext/standard/pack.c } else if (n >= 'A' && n <= 'F') {
n 364 ext/standard/pack.c n -= ('A' - 10);
n 365 ext/standard/pack.c } else if (n >= 'a' && n <= 'f') {
n 366 ext/standard/pack.c n -= ('a' - 10);
n 368 ext/standard/pack.c php_error_docref(NULL TSRMLS_CC, E_WARNING, "Type %c: illegal hex digit %c", code, n);
n 369 ext/standard/pack.c n = 0;
n 378 ext/standard/pack.c output[outputpos] |= (n << nibbleshift);
n 660 ext/standard/pack.c char n[256];
n 664 ext/standard/pack.c snprintf(n, sizeof(n), "%.*s%d", namelen, name, i + 1);
n 667 ext/standard/pack.c snprintf(n, sizeof(n), "%.*s", namelen, name);
n 688 ext/standard/pack.c add_assoc_stringl(return_value, n, &input[inputpos], len, 1);
n 714 ext/standard/pack.c add_assoc_stringl(return_value, n, &input[inputpos], len + 1, 1);
n 738 ext/standard/pack.c add_assoc_stringl(return_value, n, &input[inputpos], len, 1);
n 781 ext/standard/pack.c add_assoc_stringl(return_value, n, buf, len, 1);
n 790 ext/standard/pack.c add_assoc_long(return_value, n, v);
n 811 ext/standard/pack.c add_assoc_long(return_value, n, v);
n 825 ext/standard/pack.c add_assoc_long(return_value, n, v);
n 859 ext/standard/pack.c add_assoc_long(return_value, n, v);
n 867 ext/standard/pack.c add_assoc_double(return_value, n, (double)v);
n 875 ext/standard/pack.c add_assoc_double(return_value, n, v);
n 136 ext/standard/password.c int fd, n;
n 141 ext/standard/password.c n = read(fd, buffer + read_bytes, raw_length - read_bytes);
n 142 ext/standard/password.c if (n < 0) {
n 145 ext/standard/password.c read_bytes += (size_t) n;
n 120 ext/standard/php_crypt_r.c while (--n >= 0) {
n 57 ext/standard/php_smart_str.h newlen = (n); \
n 63 ext/standard/php_smart_str.h newlen = (d)->len + (n); \
n 72 ext/standard/php_smart_str.h smart_str_alloc4((d), (n), (what), newlen)
n 75 ext/standard/sha1.c int n;
n 89 ext/standard/sha1.c while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n 90 ext/standard/sha1.c PHP_SHA1Update(&context, buf, n);
n 97 ext/standard/sha1.c if (n<0) {
n 131 ext/standard/sha1.c #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
n 3157 ext/standard/string.c char *e, *n, *p;
n 3164 ext/standard/string.c n = emalloc(str_len+1);
n 3165 ext/standard/string.c p = n;
n 3175 ext/standard/string.c RETVAL_STRINGL(n, str_len, 0);
n 3703 ext/standard/string.c char *o, *n, *endp;
n 3707 ext/standard/string.c n = needle;
n 3710 ext/standard/string.c n = needle_dup;
n 3714 ext/standard/string.c while ((o = php_memnstr(o, n, needle_len, endp))) {
n 4482 ext/standard/string.c char c, *n, *t;
n 4492 ext/standard/string.c n = norm;
n 4503 ext/standard/string.c *(n++) = c;
n 4514 ext/standard/string.c *(n++) = c;
n 4524 ext/standard/string.c *(n++) = '>';
n 4525 ext/standard/string.c *n = '\0';
n 29 ext/standard/versioning.c #define sign(n) ((n)<0?-1:((n)>0?1:0))
n 76 ext/xmlrpc/libxmlrpc/base64.c int c, n;
n 79 ext/xmlrpc/libxmlrpc/base64.c for (n = 0; n < 3; n++) {
n 86 ext/xmlrpc/libxmlrpc/base64.c igroup[n] = (unsigned char) c;
n 88 ext/xmlrpc/libxmlrpc/base64.c if (n > 0) {
n 98 ext/xmlrpc/libxmlrpc/base64.c if (n < 3) {
n 100 ext/xmlrpc/libxmlrpc/base64.c if (n < 2) {
n 289 ext/xmlrpc/libxmlrpc/queue.c node *n;
n 296 ext/xmlrpc/libxmlrpc/queue.c n = q->head;
n 306 ext/xmlrpc/libxmlrpc/queue.c q->head->next = (datanode*)n;
n 307 ext/xmlrpc/libxmlrpc/queue.c n->prev = q->head;
n 342 ext/xmlrpc/libxmlrpc/queue.c datanode *n;
n 344 ext/xmlrpc/libxmlrpc/queue.c n = malloc(sizeof(datanode));
n 345 ext/xmlrpc/libxmlrpc/queue.c if(n == NULL)
n 349 ext/xmlrpc/libxmlrpc/queue.c q->tail = (node *)n;
n 392 ext/xmlrpc/libxmlrpc/queue.c datanode *n;
n 399 ext/xmlrpc/libxmlrpc/queue.c n = q->head->next;
n 407 ext/xmlrpc/libxmlrpc/queue.c q->head = (node *)n;
n 524 ext/xmlrpc/libxmlrpc/queue.c datanode *n, *p;
n 538 ext/xmlrpc/libxmlrpc/queue.c n = ((node*)iter)->next;
n 545 ext/xmlrpc/libxmlrpc/queue.c p->next = n;
n 551 ext/xmlrpc/libxmlrpc/queue.c q->cursor = n;
n 556 ext/xmlrpc/libxmlrpc/queue.c if (n != NULL) {
n 557 ext/xmlrpc/libxmlrpc/queue.c n->prev = p;
n 187 ext/xmlrpc/libxmlrpc/xmlrpc.c int n;
n 212 ext/xmlrpc/libxmlrpc/xmlrpc.c n = 1000;
n 216 ext/xmlrpc/libxmlrpc/xmlrpc.c tm.tm_year += (text[i]-'0')*n;
n 217 ext/xmlrpc/libxmlrpc/xmlrpc.c n /= 10;
n 219 ext/xmlrpc/libxmlrpc/xmlrpc.c n = 10;
n 223 ext/xmlrpc/libxmlrpc/xmlrpc.c tm.tm_mon += (text[i+4]-'0')*n;
n 224 ext/xmlrpc/libxmlrpc/xmlrpc.c n /= 10;
n 228 ext/xmlrpc/libxmlrpc/xmlrpc.c n = 10;
n 232 ext/xmlrpc/libxmlrpc/xmlrpc.c tm.tm_mday += (text[i+6]-'0')*n;
n 233 ext/xmlrpc/libxmlrpc/xmlrpc.c n /= 10;
n 236 ext/xmlrpc/libxmlrpc/xmlrpc.c n = 10;
n 240 ext/xmlrpc/libxmlrpc/xmlrpc.c tm.tm_hour += (text[i+9]-'0')*n;
n 241 ext/xmlrpc/libxmlrpc/xmlrpc.c n /= 10;
n 244 ext/xmlrpc/libxmlrpc/xmlrpc.c n = 10;
n 248 ext/xmlrpc/libxmlrpc/xmlrpc.c tm.tm_min += (text[i+12]-'0')*n;
n 249 ext/xmlrpc/libxmlrpc/xmlrpc.c n /= 10;
n 252 ext/xmlrpc/libxmlrpc/xmlrpc.c n = 10;
n 256 ext/xmlrpc/libxmlrpc/xmlrpc.c tm.tm_sec += (text[i+15]-'0')*n;
n 257 ext/xmlrpc/libxmlrpc/xmlrpc.c n /= 10;
n 447 ext/zip/lib/zip_close.c int n, nn;
n 454 ext/zip/lib/zip_close.c if ((n=fread(buf, 1, nn, fs)) < 0) {
n 458 ext/zip/lib/zip_close.c else if (n == 0) {
n 463 ext/zip/lib/zip_close.c if (fwrite(buf, 1, n, ft) != (size_t)n) {
n 468 ext/zip/lib/zip_close.c len -= n;
n 480 ext/zip/lib/zip_close.c zip_int64_t n;
n 489 ext/zip/lib/zip_close.c while ((n=zip_source_read(src, buf, sizeof(buf))) > 0) {
n 490 ext/zip/lib/zip_close.c if (fwrite(buf, 1, n, ft) != (size_t)n) {
n 497 ext/zip/lib/zip_close.c if (n < 0) {
n 49 ext/zip/lib/zip_filerange_crc.c size_t n;
n 59 ext/zip/lib/zip_filerange_crc.c n = len > BUFSIZE ? BUFSIZE : len;
n 60 ext/zip/lib/zip_filerange_crc.c if ((n=fread(buf, 1, n, fp)) <= 0) {
n 65 ext/zip/lib/zip_filerange_crc.c *crcp = crc32(*crcp, buf, n);
n 67 ext/zip/lib/zip_filerange_crc.c len-= n;
n 163 ext/zip/lib/zip_fopen_index_encrypted.c int n;
n 171 ext/zip/lib/zip_fopen_index_encrypted.c n = za->nfile_alloc + 10;
n 173 ext/zip/lib/zip_fopen_index_encrypted.c n*sizeof(struct zip_file *));
n 179 ext/zip/lib/zip_fopen_index_encrypted.c za->nfile_alloc = n;
n 43 ext/zip/lib/zip_fread.c zip_int64_t n;
n 59 ext/zip/lib/zip_fread.c if ((n=zip_source_read(zf->src, outbuf, toread)) < 0) {
n 64 ext/zip/lib/zip_fread.c return n;
n 56 ext/zip/lib/zip_name_locate.c int i, n;
n 73 ext/zip/lib/zip_name_locate.c n = (flags & ZIP_FL_UNCHANGED) ? za->cdir->nentry : za->nentry;
n 74 ext/zip/lib/zip_name_locate.c for (i=0; i<n; i++) {
n 90 ext/zip/lib/zip_source_buffer.c zip_uint64_t n;
n 103 ext/zip/lib/zip_source_buffer.c n = z->end - z->buf;
n 104 ext/zip/lib/zip_source_buffer.c if (n > len)
n 105 ext/zip/lib/zip_source_buffer.c n = len;
n 107 ext/zip/lib/zip_source_buffer.c if (n) {
n 108 ext/zip/lib/zip_source_buffer.c memcpy(buf, z->buf, n);
n 109 ext/zip/lib/zip_source_buffer.c z->buf += n;
n 112 ext/zip/lib/zip_source_buffer.c return n;
n 81 ext/zip/lib/zip_source_crc.c zip_int64_t n;
n 97 ext/zip/lib/zip_source_crc.c if ((n=zip_source_read(src, data, len)) < 0)
n 100 ext/zip/lib/zip_source_crc.c if (n == 0) {
n 123 ext/zip/lib/zip_source_crc.c ctx->size += n;
n 124 ext/zip/lib/zip_source_crc.c ctx->crc = crc32(ctx->crc, data, n);
n 126 ext/zip/lib/zip_source_crc.c return n;
n 107 ext/zip/lib/zip_source_deflate.c zip_int64_t n;
n 139 ext/zip/lib/zip_source_deflate.c if ((n=zip_source_read(src, ctx->buffer,
n 145 ext/zip/lib/zip_source_deflate.c else if (n == 0) {
n 152 ext/zip/lib/zip_source_deflate.c ctx->zstr.avail_in = n;
n 182 ext/zip/lib/zip_source_deflate.c zip_int64_t n;
n 213 ext/zip/lib/zip_source_deflate.c if ((n=zip_source_read(src, ctx->buffer,
n 219 ext/zip/lib/zip_source_deflate.c else if (n == 0)
n 223 ext/zip/lib/zip_source_deflate.c ctx->zstr.avail_in = n;
n 323 ext/zip/lib/zip_source_deflate.c zip_int64_t n;
n 330 ext/zip/lib/zip_source_deflate.c if ((n=zip_source_read(src, ctx->buffer, sizeof(ctx->buffer))) < 0)
n 337 ext/zip/lib/zip_source_deflate.c ctx->zstr.avail_in = n;
n 128 ext/zip/lib/zip_source_filep.c int i, n;
n 156 ext/zip/lib/zip_source_filep.c n = len > z->remain ? z->remain : len;
n 158 ext/zip/lib/zip_source_filep.c n = len;
n 170 ext/zip/lib/zip_source_filep.c if ((i=fread(buf, 1, n, z->f)) < 0) {
n 145 ext/zip/lib/zip_source_pkware.c zip_int64_t n;
n 148 ext/zip/lib/zip_source_pkware.c if ((n=zip_source_read(src, header, HEADERLEN)) < 0) {
n 153 ext/zip/lib/zip_source_pkware.c if (n != HEADERLEN) {
n 185 ext/zip/lib/zip_source_pkware.c zip_int64_t n;
n 196 ext/zip/lib/zip_source_pkware.c if ((n=zip_source_read(src, data, len)) < 0)
n 199 ext/zip/lib/zip_source_pkware.c decrypt(ud, (zip_uint8_t *)data, (zip_uint8_t *)data, (zip_uint64_t)n,
n 201 ext/zip/lib/zip_source_pkware.c return n;
n 125 ext/zip/lib/zip_source_zip.c zip_uint64_t n;
n 132 ext/zip/lib/zip_source_zip.c for (n=0; n<z->off; n+= i) {
n 133 ext/zip/lib/zip_source_zip.c i = (z->off-n > sizeof(b) ? sizeof(b) : z->off-n);
n 144 ext/zip/lib/zip_source_zip.c n = len > z->len ? z->len : len;
n 146 ext/zip/lib/zip_source_zip.c n = len;
n 149 ext/zip/lib/zip_source_zip.c if ((i=zip_fread(z->zf, buf, n)) < 0)
n 144 ext/zip/php_zip.c int n, len, ret;
n 264 ext/zip/php_zip.c n = -1;
n 270 ext/zip/php_zip.c n = -1;
n 275 ext/zip/php_zip.c n = 0;
n 277 ext/zip/php_zip.c while ((n=zip_fread(zf, b, sizeof(b))) > 0) {
n 278 ext/zip/php_zip.c php_stream_write(stream, b, n);
n 282 ext/zip/php_zip.c n = zip_fclose(zf);
n 290 ext/zip/php_zip.c if (n<0) {
n 529 ext/zip/php_zip.c int n;
n 593 ext/zip/php_zip.c for (n = 0; n < globbuf.gl_pathc; n++) {
n 605 ext/zip/php_zip.c if (0 != VCWD_STAT(globbuf.gl_pathv[n], &s)) {
n 613 ext/zip/php_zip.c add_next_index_string(return_value, globbuf.gl_pathv[n]+cwd_skip, 1);
n 1362 ext/zip/php_zip.c int n = 0;
n 1376 ext/zip/php_zip.c n = zip_fread(zr_rsrc->zf, buffer, len);
n 1377 ext/zip/php_zip.c if (n > 0) {
n 1378 ext/zip/php_zip.c buffer[n] = 0;
n 1379 ext/zip/php_zip.c RETURN_STRINGL(buffer, n, 0);
n 2516 ext/zip/php_zip.c int n = 0;
n 2554 ext/zip/php_zip.c n = zip_fread(zf, buffer, len);
n 2555 ext/zip/php_zip.c if (n < 1) {
n 2561 ext/zip/php_zip.c buffer[n] = 0;
n 2562 ext/zip/php_zip.c RETURN_STRINGL(buffer, n, 0);
n 33 ext/zip/zip_stream.c ssize_t n = 0;
n 37 ext/zip/zip_stream.c n = zip_fread(self->zf, buf, count);
n 38 ext/zip/zip_stream.c if (n < 0) {
n 47 ext/zip/zip_stream.c if (n == 0 || n < (ssize_t)count) {
n 50 ext/zip/zip_stream.c self->cursor += n;
n 53 ext/zip/zip_stream.c return (n < 1 ? 0 : (size_t)n);
n 271 main/mergesort.c if (n <= 5) {
n 272 main/mergesort.c insertionsort(list1, n, size, cmp TSRMLS_CC);
n 273 main/mergesort.c *EVAL(list2) = (u_char*) list2 + n*size;
n 280 main/mergesort.c i = 4 + (n & 1);
n 281 main/mergesort.c insertionsort(list1 + (n - i) * size, i, size, cmp TSRMLS_CC);
n 282 main/mergesort.c last = list1 + size * (n - i);
n 283 main/mergesort.c *EVAL(list2 + (last - list1)) = list2 + n * size;
n 319 main/mergesort.c p2 = *EVAL(p2) = list2 + n*size;
n 341 main/mergesort.c for (ai = a+size; --n >= 1; ai += size)
n 172 main/network.c int n;
n 213 main/network.c if ((n = getaddrinfo(host, NULL, &hints, &res))) {
n 215 main/network.c spprintf(error_string, 0, "php_network_getaddresses: getaddrinfo failed: %s", PHP_GAI_STRERROR(n));
n 218 main/network.c php_error_docref(NULL TSRMLS_CC, E_WARNING, "php_network_getaddresses: getaddrinfo failed: %s", PHP_GAI_STRERROR(n));
n 232 main/network.c for (n = 1; (sai = sai->ai_next) != NULL; n++)
n 235 main/network.c *sal = safe_emalloc((n + 1), sizeof(*sal), 0);
n 268 main/network.c n = 1;
n 272 main/network.c return n;
n 313 main/network.c int n;
n 320 main/network.c if ((n = connect(sockfd, addr, addrlen)) != 0) {
n 340 main/network.c if (n == 0) {
n 351 main/network.c if ((n = php_pollfd_for(sockfd, POLLOUT|POLLPRI, timeout)) == 0) {
n 353 main/network.c if ((n = php_pollfd_for(sockfd, PHP_POLLREADABLE|POLLOUT, timeout)) == 0) {
n 358 main/network.c if (n > 0) {
n 422 main/network.c int num_addrs, n, err = 0;
n 473 main/network.c n = bind(sock, sa, socklen);
n 475 main/network.c if (n != SOCK_CONN_ERR) {
n 510 main/network.c int n;
n 553 main/network.c n = php_network_getaddresses(tmp, SOCK_DGRAM, &psal, &errstr TSRMLS_CC);
n 555 main/network.c if (n == 0) {
n 718 main/network.c int error = 0, n;
n 722 main/network.c n = php_pollfd_for(srvsock, PHP_POLLREADABLE, timeout);
n 724 main/network.c if (n == 0) {
n 726 main/network.c } else if (n == -1) {
n 768 main/network.c int num_addrs, n, fatal = 0;
n 881 main/network.c n = php_network_connect_socket(sock, sa, socklen, asynchronous,
n 885 main/network.c if (n != -1) {
n 1137 main/network.c int n;
n 1174 main/network.c n = select(max_fd + 1, &rset, &wset, &eset, timeout >= 0 ? &tv : NULL);
n 1176 main/network.c if (n >= 0) {
n 1192 main/network.c return n;
n 159 main/php_network.h int n;
n 165 main/php_network.h n = php_poll2(&p, 1, php_tvtoto(timeouttv));
n 167 main/php_network.h if (n > 0) {
n 171 main/php_network.h return n;
n 177 main/php_network.h int n;
n 183 main/php_network.h n = php_poll2(&p, 1, timeout);
n 185 main/php_network.h if (n > 0) {
n 189 main/php_network.h return n;
n 201 main/php_network.h # define PHP_SAFE_MAX_FD(m, n) do { if (n + 1 >= FD_SETSIZE) { _php_emit_fd_setsize_warning(n); }} while(0)
n 257 main/streams/filter.c int n;
n 260 main/streams/filter.c n = strlen(filtername);
n 262 main/streams/filter.c if (SUCCESS == zend_hash_find(filter_hash, (char*)filtername, n + 1, (void**)&factory)) {
n 268 main/streams/filter.c wildname = emalloc(n+3);
n 269 main/streams/filter.c memcpy(wildname, filtername, n+1);
n 1190 main/streams/plain_wrapper.c int n = 0;
n 1194 main/streams/plain_wrapper.c ++n;
n 1201 main/streams/plain_wrapper.c if (!n) break;
n 1202 main/streams/plain_wrapper.c --n;
n 1753 main/streams/streams.c int n = 0;
n 1764 main/streams/streams.c n++;
n 1767 main/streams/streams.c if ((*p == ':') && (n > 1) && (!strncmp("//", p+1, 2) || (n == 4 && !memcmp("data:", path, 5)))) {
n 1769 main/streams/streams.c } else if (n == 5 && strncasecmp(path, "zlib:", 5) == 0) {
n 1772 main/streams/streams.c n = 13;
n 1777 main/streams/streams.c char *tmp = estrndup(protocol, n);
n 1778 main/streams/streams.c if (FAILURE == zend_hash_find(wrapper_hash, (char*)tmp, n + 1, (void**)&wrapperpp)) {
n 1779 main/streams/streams.c php_strtolower(tmp, n);
n 1780 main/streams/streams.c if (FAILURE == zend_hash_find(wrapper_hash, (char*)tmp, n + 1, (void**)&wrapperpp)) {
n 1783 main/streams/streams.c if (n >= sizeof(wrapper_name)) {
n 1784 main/streams/streams.c n = sizeof(wrapper_name) - 1;
n 1786 main/streams/streams.c PHP_STRLCPY(wrapper_name, protocol, sizeof(wrapper_name), n);
n 1797 main/streams/streams.c if (!protocol || !strncasecmp(protocol, "file", n)) {
n 1809 main/streams/streams.c if (localhost == 0 && path[n+3] != '\0' && path[n+3] != '/' && path[n+4] != ':') {
n 1811 main/streams/streams.c if (localhost == 0 && path[n+3] != '\0' && path[n+3] != '/') {
n 1821 main/streams/streams.c *path_for_open = (char*)path + n + 1;
n 1866 main/streams/streams.c char *protocol_dup = estrndup(protocol, n);
n 63 main/streams/transports.c int n = 0, failed = 0;
n 96 main/streams/transports.c n++;
n 99 main/streams/transports.c if ((*p == ':') && (n > 1) && !strncmp("://", p, 3)) {
n 102 main/streams/transports.c namelen -= n + 3;
n 105 main/streams/transports.c n = 3;
n 109 main/streams/transports.c char *tmp = estrndup(protocol, n);
n 110 main/streams/transports.c if (FAILURE == zend_hash_find(&xport_hash, (char*)tmp, n + 1, (void**)&factory)) {
n 113 main/streams/transports.c if (n >= sizeof(wrapper_name))
n 114 main/streams/transports.c n = sizeof(wrapper_name) - 1;
n 115 main/streams/transports.c PHP_STRLCPY(wrapper_name, protocol, sizeof(wrapper_name), n);
n 132 main/streams/transports.c stream = (*factory)(protocol, n,
n 179 main/streams/xp_socket.c int n;
n 200 main/streams/xp_socket.c n = php_pollfd_for_ms(sock->socket, POLLOUT, 500);
n 201 main/streams/xp_socket.c } while (n == -1 && php_socket_errno() == EINTR);
n 74 main/strlcat.c register size_t n = siz;
n 78 main/strlcat.c while (*d != '\0' && n-- != 0)
n 81 main/strlcat.c n = siz - dlen;
n 83 main/strlcat.c if (n == 0)
n 86 main/strlcat.c if (n != 1) {
n 88 main/strlcat.c n--;
n 73 main/strlcpy.c register size_t n = siz;
n 76 main/strlcpy.c if (n != 0 && --n != 0) {
n 80 main/strlcpy.c } while (--n != 0);
n 84 main/strlcpy.c if (n == 0) {
n 266 run-tests.php define('TESTED_PHP_VERSION', `$php -n -r "echo PHP_VERSION;"`);
n 1477 run-tests.php $loaded = explode(",", `$php -n -r 'echo join(",", get_loaded_extensions());'`);
n 91 sapi/aolserver/aolserver.c int n;
n 95 sapi/aolserver/aolserver.c n = Ns_ConnWrite(NSG(conn), (void *) str, str_length);
n 97 sapi/aolserver/aolserver.c if (n == -1)
n 100 sapi/aolserver/aolserver.c str += n;
n 101 sapi/aolserver/aolserver.c sent += n;
n 102 sapi/aolserver/aolserver.c str_length -= n;
n 575 sapi/apache/php_apache.c int n;
n 580 sapi/apache/php_apache.c for (n = 0; ap_loaded_modules[n]; ++n) {
n 581 sapi/apache/php_apache.c char *s = (char *) ap_loaded_modules[n]->name;
n 123 sapi/apache2filter/apache_config.c php_conf_rec *d = base_conf, *e = new_conf, *n = NULL;
n 130 sapi/apache2filter/apache_config.c n = create_php_config(p, "merge_php_config");
n 131 sapi/apache2filter/apache_config.c zend_hash_copy(&n->config, &e->config, NULL, NULL, sizeof(php_dir_entry));
n 133 sapi/apache2filter/apache_config.c phpapdebug((stderr, "Merge dir (%p)+(%p)=(%p)\n", base_conf, new_conf, n));
n 140 sapi/apache2filter/apache_config.c if (zend_hash_find(&n->config, str, str_len, (void **) &pe) == SUCCESS) {
n 143 sapi/apache2filter/apache_config.c zend_hash_update(&n->config, str, str_len, data, sizeof(*data), NULL);
n 147 sapi/apache2filter/apache_config.c return n;
n 308 sapi/apache2filter/php_functions.c int n;
n 313 sapi/apache2filter/php_functions.c for (n = 0; ap_loaded_modules[n]; ++n) {
n 314 sapi/apache2filter/php_functions.c char *s = (char *) ap_loaded_modules[n]->name;
n 328 sapi/apache2filter/php_functions.c int n;
n 331 sapi/apache2filter/php_functions.c for (n = 0; ap_loaded_modules[n]; ++n) {
n 332 sapi/apache2filter/php_functions.c char *s = (char *) ap_loaded_modules[n]->name;
n 158 sapi/apache2filter/sapi_apache2.c int n;
n 163 sapi/apache2filter/sapi_apache2.c n = MIN(to_read, count_bytes);
n 165 sapi/apache2filter/sapi_apache2.c if (n > 0) {
n 166 sapi/apache2filter/sapi_apache2.c memcpy(buf, ctx->post_data + ctx->post_idx, n);
n 167 sapi/apache2filter/sapi_apache2.c ctx->post_idx += n;
n 173 sapi/apache2filter/sapi_apache2.c return n;
n 366 sapi/apache2filter/sapi_apache2.c apr_size_t n;
n 386 sapi/apache2filter/sapi_apache2.c apr_bucket_read(b, &str, &n, APR_NONBLOCK_READ);
n 387 sapi/apache2filter/sapi_apache2.c if (n > 0) {
n 389 sapi/apache2filter/sapi_apache2.c ctx->post_len += n;
n 391 sapi/apache2filter/sapi_apache2.c memcpy(ctx->post_data + old_index, str, n);
n 140 sapi/apache2handler/apache_config.c php_conf_rec *d = base_conf, *e = new_conf, *n = NULL;
n 149 sapi/apache2handler/apache_config.c n = create_php_config(p, "merge_php_config");
n 151 sapi/apache2handler/apache_config.c zend_hash_copy(&n->config, &d->config, NULL, NULL, sizeof(php_dir_entry));
n 153 sapi/apache2handler/apache_config.c phpapdebug((stderr, "Merge dir (%p)+(%p)=(%p)\n", base_conf, new_conf, n));
n 154 sapi/apache2handler/apache_config.c zend_hash_merge_ex(&n->config, &e->config, NULL, sizeof(php_dir_entry), (merge_checker_func_t) should_overwrite_per_dir_entry, NULL);
n 162 sapi/apache2handler/apache_config.c if (zend_hash_find(&n->config, str, str_len, (void **) &pe) == SUCCESS) {
n 166 sapi/apache2handler/apache_config.c zend_hash_update(&n->config, str, str_len, data, sizeof(*data), NULL);
n 169 sapi/apache2handler/apache_config.c return n;
n 350 sapi/apache2handler/php_functions.c int n;
n 355 sapi/apache2handler/php_functions.c for (n = 0; ap_loaded_modules[n]; ++n) {
n 356 sapi/apache2handler/php_functions.c char *s = (char *) ap_loaded_modules[n]->name;
n 371 sapi/apache2handler/php_functions.c int n, max_requests;
n 382 sapi/apache2handler/php_functions.c for (n = 0; ap_loaded_modules[n]; ++n) {
n 383 sapi/apache2handler/php_functions.c char *s = (char *) ap_loaded_modules[n]->name;
n 1949 sapi/apache_hooks/php_apache.c int n;
n 1954 sapi/apache_hooks/php_apache.c for (n = 0; ap_loaded_modules[n]; ++n) {
n 1955 sapi/apache_hooks/php_apache.c char *s = (char *) ap_loaded_modules[n]->name;
n 688 sapi/cgi/fastcgi.c int n;
n 693 sapi/cgi/fastcgi.c n = 0;
n 695 sapi/cgi/fastcgi.c if (*cur == ',') n++;
n 698 sapi/cgi/fastcgi.c allowed_clients = malloc(sizeof(in_addr_t) * (n+2));
n 699 sapi/cgi/fastcgi.c n = 0;
n 707 sapi/cgi/fastcgi.c allowed_clients[n] = inet_addr(cur);
n 708 sapi/cgi/fastcgi.c if (allowed_clients[n] == INADDR_NONE) {
n 711 sapi/cgi/fastcgi.c n++;
n 714 sapi/cgi/fastcgi.c allowed_clients[n] = INADDR_NONE;
n 769 sapi/cgi/fastcgi.c size_t n = 0;
n 775 sapi/cgi/fastcgi.c ret = write(req->fd, ((char*)buf)+n, count-n);
n 777 sapi/cgi/fastcgi.c ret = send(req->fd, ((char*)buf)+n, count-n, 0);
n 783 sapi/cgi/fastcgi.c ret = write(req->fd, ((char*)buf)+n, count-n);
n 786 sapi/cgi/fastcgi.c n += ret;
n 790 sapi/cgi/fastcgi.c } while (n != count);
n 791 sapi/cgi/fastcgi.c return n;
n 797 sapi/cgi/fastcgi.c size_t n = 0;
n 803 sapi/cgi/fastcgi.c ret = read(req->fd, ((char*)buf)+n, count-n);
n 805 sapi/cgi/fastcgi.c ret = recv(req->fd, ((char*)buf)+n, count-n, 0);
n 811 sapi/cgi/fastcgi.c ret = read(req->fd, ((char*)buf)+n, count-n);
n 814 sapi/cgi/fastcgi.c n += ret;
n 816 sapi/cgi/fastcgi.c return n;
n 820 sapi/cgi/fastcgi.c } while (n != count);
n 821 sapi/cgi/fastcgi.c return n;
n 1036 sapi/cgi/fastcgi.c int ret, n, rest;
n 1040 sapi/cgi/fastcgi.c n = 0;
n 1053 sapi/cgi/fastcgi.c return n;
n 1068 sapi/cgi/fastcgi.c n += ret;
n 1078 sapi/cgi/fastcgi.c return n;
n 1081 sapi/cgi/fastcgi.c return n;
n 1084 sapi/cgi/fastcgi.c return n;
n 1188 sapi/cgi/fastcgi.c int n = 0;
n 1191 sapi/cgi/fastcgi.c while (allowed_clients[n] != INADDR_NONE) {
n 1192 sapi/cgi/fastcgi.c if (allowed_clients[n] == sa.sa_inet.sin_addr.s_addr) {
n 1196 sapi/cgi/fastcgi.c n++;
n 911 sapi/cli/php_cli_server.c struct socket_entry *n = entries, *m;
n 914 sapi/cli/php_cli_server.c n->events = POLLIN;
n 915 sapi/cli/php_cli_server.c n->fd = poller->active.rfds.fd_array[i];
n 916 sapi/cli/php_cli_server.c n++;
n 919 sapi/cli/php_cli_server.c m = n;
n 929 sapi/cli/php_cli_server.c assert(n < entries + FD_SETSIZE * 2);
n 930 sapi/cli/php_cli_server.c n->events = POLLOUT;
n 931 sapi/cli/php_cli_server.c n->fd = fd;
n 932 sapi/cli/php_cli_server.c n++;
n 938 sapi/cli/php_cli_server.c for (; e < n; e++) {
n 1573 sapi/cli/php_cli_server.c char *n = p;
n 1574 sapi/cli/php_cli_server.c while (n < decoded_vpath_end && *n == '/') n++;
n 1575 sapi/cli/php_cli_server.c memmove(++p, n, decoded_vpath_end - n);
n 1576 sapi/cli/php_cli_server.c decoded_vpath_end -= n - p;
n 1580 sapi/cli/php_cli_server.c char *n = p;
n 1581 sapi/cli/php_cli_server.c while (n < decoded_vpath_end && *n != '/') n++;
n 1582 sapi/cli/php_cli_server.c if (n - p == 2 && p[0] == '.' && p[1] == '.') {
n 1598 sapi/cli/php_cli_server.c while (n < decoded_vpath_end && *n == '/') n++;
n 1599 sapi/cli/php_cli_server.c memmove(p, n, decoded_vpath_end - n);
n 1600 sapi/cli/php_cli_server.c decoded_vpath_end -= n - p;
n 1601 sapi/cli/php_cli_server.c } else if (n - p == 1 && p[0] == '.') {
n 1602 sapi/cli/php_cli_server.c while (n < decoded_vpath_end && *n == '/') n++;
n 1603 sapi/cli/php_cli_server.c memmove(p, n, decoded_vpath_end - n);
n 1604 sapi/cli/php_cli_server.c decoded_vpath_end -= n - p;
n 1606 sapi/cli/php_cli_server.c if (n < decoded_vpath_end) {
n 1607 sapi/cli/php_cli_server.c char *nn = n;
n 1609 sapi/cli/php_cli_server.c p = n + 1;
n 1613 sapi/cli/php_cli_server.c p = n;
n 2477 sapi/cli/php_cli_server.c int n = php_cli_server_poller_poll(&server->poller, &tv);
n 2478 sapi/cli/php_cli_server.c if (n > 0) {
n 2482 sapi/cli/php_cli_server.c } else if (n == 0) {
n 249 sapi/fpm/fpm/fastcgi.c int n;
n 254 sapi/fpm/fpm/fastcgi.c n = 0;
n 256 sapi/fpm/fpm/fastcgi.c if (*cur == ',') n++;
n 260 sapi/fpm/fpm/fastcgi.c allowed_clients = malloc(sizeof(in_addr_t) * (n+2));
n 261 sapi/fpm/fpm/fastcgi.c n = 0;
n 269 sapi/fpm/fpm/fastcgi.c allowed_clients[n] = inet_addr(cur);
n 270 sapi/fpm/fpm/fastcgi.c if (allowed_clients[n] == INADDR_NONE) {
n 273 sapi/fpm/fpm/fastcgi.c n++;
n 276 sapi/fpm/fpm/fastcgi.c allowed_clients[n] = INADDR_NONE;
n 302 sapi/fpm/fpm/fastcgi.c size_t n = 0;
n 308 sapi/fpm/fpm/fastcgi.c ret = write(req->fd, ((char*)buf)+n, count-n);
n 310 sapi/fpm/fpm/fastcgi.c ret = send(req->fd, ((char*)buf)+n, count-n, 0);
n 316 sapi/fpm/fpm/fastcgi.c ret = write(req->fd, ((char*)buf)+n, count-n);
n 319 sapi/fpm/fpm/fastcgi.c n += ret;
n 323 sapi/fpm/fpm/fastcgi.c } while (n != count);
n 324 sapi/fpm/fpm/fastcgi.c return n;
n 330 sapi/fpm/fpm/fastcgi.c size_t n = 0;
n 336 sapi/fpm/fpm/fastcgi.c ret = read(req->fd, ((char*)buf)+n, count-n);
n 338 sapi/fpm/fpm/fastcgi.c ret = recv(req->fd, ((char*)buf)+n, count-n, 0);
n 344 sapi/fpm/fpm/fastcgi.c ret = read(req->fd, ((char*)buf)+n, count-n);
n 347 sapi/fpm/fpm/fastcgi.c n += ret;
n 349 sapi/fpm/fpm/fastcgi.c return n;
n 353 sapi/fpm/fpm/fastcgi.c } while (n != count);
n 354 sapi/fpm/fpm/fastcgi.c return n;
n 665 sapi/fpm/fpm/fastcgi.c int ret, n, rest;
n 669 sapi/fpm/fpm/fastcgi.c n = 0;
n 682 sapi/fpm/fpm/fastcgi.c return n;
n 697 sapi/fpm/fpm/fastcgi.c n += ret;
n 707 sapi/fpm/fpm/fastcgi.c return n;
n 710 sapi/fpm/fpm/fastcgi.c return n;
n 713 sapi/fpm/fpm/fastcgi.c return n;
n 813 sapi/fpm/fpm/fastcgi.c int n = 0;
n 816 sapi/fpm/fpm/fastcgi.c while (allowed_clients[n] != INADDR_NONE) {
n 817 sapi/fpm/fpm/fastcgi.c if (allowed_clients[n] == sa.sa_inet.sin_addr.s_addr) {
n 821 sapi/fpm/fpm/fastcgi.c n++;
n 52 sapi/fpm/fpm/fpm_arrays.h ret = (char *) a->data + a->sz * n;
n 68 sapi/fpm/fpm/fpm_arrays.h if (n < a->used - 1) {
n 70 sapi/fpm/fpm/fpm_arrays.h void *to_remove = fpm_array_item(a, n);
n 74 sapi/fpm/fpm/fpm_arrays.h ret = n;
n 1469 sapi/fpm/fpm/fpm_conf.c int fd, n;
n 1496 sapi/fpm/fpm/fpm_conf.c for (n = 0; n < 1024 && (nb_read = read(fd, &c, sizeof(char))) == sizeof(char) && c != '\n'; n++) {
n 1497 sapi/fpm/fpm/fpm_conf.c buf[n] = c;
n 1499 sapi/fpm/fpm/fpm_conf.c buf[n++] = '\n';
n 700 sapi/litespeed/lsapi_main.c int n;
n 232 sapi/litespeed/lsapilib.c int n = count;
n 234 sapi/litespeed/lsapilib.c ret = writev( fd, *pVec, n );
n 283 sapi/litespeed/lsapilib.c pReq->m_pIovec, sizeof(struct iovec) * n );
n 290 sapi/litespeed/lsapilib.c pReq->m_pIovecEnd = p + n;
n 1008 sapi/litespeed/lsapilib.c int n;
n 1012 sapi/litespeed/lsapilib.c n = pReq->m_pIovecCur - pReq->m_pIovecToWrite;
n 1013 sapi/litespeed/lsapilib.c if (( 0 == n )&&( pReq->m_pRespBufPos == pReq->m_pRespBuf )) {
n 1029 sapi/litespeed/lsapilib.c n = pReq->m_pIovecCur - pReq->m_pIovecToWrite;
n 1030 sapi/litespeed/lsapilib.c if ( n > 0 ) {
n 1033 sapi/litespeed/lsapilib.c n, pReq->m_totalLen );
n 1277 sapi/litespeed/lsapilib.c struct LSAPI_key_value_pair * pEnd = pEnv + n;
n 1290 sapi/litespeed/lsapilib.c return n;
n 2111 sapi/litespeed/lsapilib.c int n;
n 2118 sapi/litespeed/lsapilib.c n = atoi( p );
n 2119 sapi/litespeed/lsapilib.c if ( n > 0 ) {
n 2120 sapi/litespeed/lsapilib.c LSAPI_Set_Max_Reqs( n );
n 2139 sapi/litespeed/lsapilib.c n = atoi( p );
n 2140 sapi/litespeed/lsapilib.c LSAPI_Set_Max_Idle( n );
n 2144 sapi/litespeed/lsapilib.c n = 0;
n 2150 sapi/litespeed/lsapilib.c n = atoi( p );
n 2152 sapi/litespeed/lsapilib.c if ( n > 1 ) {
n 2153 sapi/litespeed/lsapilib.c LSAPI_Init_Prefork_Server( n, fp, avoidFork );
n 53 sapi/thttpd/thttpd.c #define PHP_SYS_CALL(x) do { x } while (n == -1 && errno == EINTR)
n 69 sapi/thttpd/thttpd.c int n;
n 78 sapi/thttpd/thttpd.c PHP_SYS_CALL(n = send(TG(hc)->conn_fd, str, str_length, 0););
n 80 sapi/thttpd/thttpd.c if (n == -1) {
n 89 sapi/thttpd/thttpd.c TG(hc)->bytes_sent += n;
n 90 sapi/thttpd/thttpd.c str += n;
n 91 sapi/thttpd/thttpd.c sent += n;
n 92 sapi/thttpd/thttpd.c str_length -= n;
n 108 sapi/thttpd/thttpd.c int n;
n 113 sapi/thttpd/thttpd.c PHP_SYS_CALL(n = writev(TG(hc)->conn_fd, vec, nvec););
n 115 sapi/thttpd/thttpd.c if (n == -1) {
n 117 sapi/thttpd/thttpd.c n = 0;
n 124 sapi/thttpd/thttpd.c TG(hc)->bytes_sent += n;
n 126 sapi/thttpd/thttpd.c n = 0;
n 129 sapi/thttpd/thttpd.c if (n < len) {
n 135 sapi/thttpd/thttpd.c if (n >= vec->iov_len) {
n 137 sapi/thttpd/thttpd.c n -= vec->iov_len;
n 141 sapi/thttpd/thttpd.c if (n > 0) {
n 143 sapi/thttpd/thttpd.c vec->iov_base = (char *) vec->iov_base + n;
n 144 sapi/thttpd/thttpd.c vec->iov_len -= n;
n 145 sapi/thttpd/thttpd.c n = 0;
n 160 sapi/thttpd/thttpd.c # define ADD_VEC(str,l) vec[n].iov_base=str;len += (vec[n].iov_len=l); n++
n 177 sapi/thttpd/thttpd.c int n = 0;
n 213 sapi/thttpd/thttpd.c if (n >= COMBINE_HEADERS - 1) {
n 214 sapi/thttpd/thttpd.c len = do_writev(vec, n, len TSRMLS_CC);
n 215 sapi/thttpd/thttpd.c n = 0;
n 235 sapi/thttpd/thttpd.c do_writev(vec, n, len TSRMLS_CC);
n 245 sapi/thttpd/thttpd.c #define CONSUME_BYTES(n) do { TG(hc)->checked_idx += (n); } while (0)
n 482 sapi/thttpd/thttpd.c #define thread_create_simple_detached(n) st_thread_create(n, NULL, 0, 0)
n 483 sapi/thttpd/thttpd.c #define thread_usleep(n) st_usleep(n)
n 486 sapi/thttpd/thttpd.c #define thread_atomic_inc(n) (++n)
n 487 sapi/thttpd/thttpd.c #define thread_atomic_dec(n) (--n)
n 54 sapi/tux/php_tux.c int n;
n 62 sapi/tux/php_tux.c n = TG(number_vec);
n 63 sapi/tux/php_tux.c vec[n].iov_base = (void *) str;
n 64 sapi/tux/php_tux.c vec[n++].iov_len = str_length;
n 67 sapi/tux/php_tux.c if ((m = writev(TG(req)->sock, vec, n)) == -1 && errno == EPIPE)
n 80 sapi/tux/php_tux.c n = send(TG(req)->sock, str, estr - str, 0);
n 82 sapi/tux/php_tux.c if (n == -1 && errno == EPIPE)
n 84 sapi/tux/php_tux.c if (n == -1 && errno == EAGAIN)
n 86 sapi/tux/php_tux.c if (n <= 0)
n 87 sapi/tux/php_tux.c return n;
n 89 sapi/tux/php_tux.c str += n;
n 92 sapi/tux/php_tux.c n = str_length - (estr - str);
n 94 sapi/tux/php_tux.c TG(req)->bytes_sent += n;
n 96 sapi/tux/php_tux.c return n;
n 103 sapi/tux/php_tux.c int n;
n 113 sapi/tux/php_tux.c n = 1;
n 139 sapi/tux/php_tux.c vec[n].iov_base = h->header;
n 140 sapi/tux/php_tux.c vec[n++].iov_len = h->header_len;
n 141 sapi/tux/php_tux.c if (n >= max_headers - 3) {
n 145 sapi/tux/php_tux.c vec[n].iov_base = "\r\n";
n 146 sapi/tux/php_tux.c vec[n++].iov_len = 2;
n 151 sapi/tux/php_tux.c vec[n].iov_base = "\r\n";
n 152 sapi/tux/php_tux.c vec[n++].iov_len = 2;
n 154 sapi/tux/php_tux.c TG(number_vec) = n;