n                1326 Zend/zend_API.c ZEND_API int add_assoc_long_ex(zval *arg, const char *key, size_t key_len, zend_long n) /* {{{ */
n                1330 Zend/zend_API.c 	ZVAL_LONG(&tmp, n);
n                1415 Zend/zend_API.c ZEND_API int add_index_long(zval *arg, zend_ulong index, zend_long n) /* {{{ */
n                1419 Zend/zend_API.c 	ZVAL_LONG(&tmp, n);
n                1493 Zend/zend_API.c ZEND_API int add_next_index_long(zval *arg, zend_long n) /* {{{ */
n                1497 Zend/zend_API.c 	ZVAL_LONG(&tmp, n);
n                1679 Zend/zend_API.c ZEND_API int add_property_long_ex(zval *arg, const char *key, size_t key_len, zend_long n) /* {{{ */
n                1684 Zend/zend_API.c 	ZVAL_LONG(&tmp, n);
n                3472 Zend/zend_API.c 	uint32_t n = 1;
n                3488 Zend/zend_API.c 		if (func && !Z_ISREF_P(arg) && ARG_SHOULD_BE_SENT_BY_REF(func, n)) {
n                3497 Zend/zend_API.c 		n++;
n                 390 Zend/zend_API.h ZEND_API int add_assoc_long_ex(zval *arg, const char *key, size_t key_len, zend_long n);
n                 416 Zend/zend_API.h ZEND_API int add_index_long(zval *arg, zend_ulong idx, zend_long n);
n                 426 Zend/zend_API.h ZEND_API int add_next_index_long(zval *arg, zend_long n);
n                 531 Zend/zend_alloc.c 	int n;
n                 535 Zend/zend_alloc.c 	n = 0;
n                 538 Zend/zend_alloc.c 		if ((bitset & 0xffffffff) == 0xffffffff) {n += 32; bitset = bitset >> Z_UL(32);}
n                 541 Zend/zend_alloc.c 	if ((bitset & 0x0000ffff) == 0x0000ffff) {n += 16; bitset = bitset >> 16;}
n                 542 Zend/zend_alloc.c 	if ((bitset & 0x000000ff) == 0x000000ff) {n +=  8; bitset = bitset >>  8;}
n                 543 Zend/zend_alloc.c 	if ((bitset & 0x0000000f) == 0x0000000f) {n +=  4; bitset = bitset >>  4;}
n                 544 Zend/zend_alloc.c 	if ((bitset & 0x00000003) == 0x00000003) {n +=  2; bitset = bitset >>  2;}
n                 545 Zend/zend_alloc.c 	return n + (bitset & 1);
n                 570 Zend/zend_alloc.c 	int n;
n                 574 Zend/zend_alloc.c 	n = 1;
n                 577 Zend/zend_alloc.c 		if ((bitset & 0xffffffff) == 0) {n += 32; bitset = bitset >> Z_UL(32);}
n                 580 Zend/zend_alloc.c 	if ((bitset & 0x0000ffff) == 0) {n += 16; bitset = bitset >> 16;}
n                 581 Zend/zend_alloc.c 	if ((bitset & 0x000000ff) == 0) {n +=  8; bitset = bitset >>  8;}
n                 582 Zend/zend_alloc.c 	if ((bitset & 0x0000000f) == 0) {n +=  4; bitset = bitset >>  4;}
n                 583 Zend/zend_alloc.c 	if ((bitset & 0x00000003) == 0) {n +=  2; bitset = bitset >>  2;}
n                 584 Zend/zend_alloc.c 	return n - (bitset & 1);
n                 623 Zend/zend_alloc.c 			int n = zend_mm_bitset_nts(tmp);
n                 624 Zend/zend_alloc.c 			bitset[i] |= Z_UL(1) << n;
n                 625 Zend/zend_alloc.c 			return i * ZEND_MM_BITSET_LEN + n;
n                1180 Zend/zend_alloc.c 	int n = 16;
n                1181 Zend/zend_alloc.c 	if (size <= 0x00ff) {n -= 8; size = size << 8;}
n                1182 Zend/zend_alloc.c 	if (size <= 0x0fff) {n -= 4; size = size << 4;}
n                1183 Zend/zend_alloc.c 	if (size <= 0x3fff) {n -= 2; size = size << 2;}
n                1184 Zend/zend_alloc.c 	if (size <= 0x7fff) {n -= 1;}
n                1185 Zend/zend_alloc.c 	return n;
n                1200 Zend/zend_alloc.c 	int n;
n                1206 Zend/zend_alloc.c 	n = zend_mm_small_size_to_bit(size - 1);
n                1207 Zend/zend_alloc.c 	return ((size-1) >> f1[n]) + f2[n];
n                 166 Zend/zend_ast.c static inline zend_bool is_power_of_two(uint32_t n) {
n                 167 Zend/zend_ast.c 	return ((n != 0) && (n == (n & (~n + 1))));
n                 962 Zend/zend_ast.c #define APPEND_DEFAULT_VALUE(n) do { \
n                 963 Zend/zend_ast.c 		p = n; \
n                  29 Zend/zend_bitset.h # define ZEND_BITSET_ELM_NUM(n)		((n) >> 5)
n                  30 Zend/zend_bitset.h # define ZEND_BITSET_BIT_NUM(n)		((zend_ulong)(n) & Z_UL(0x1f))
n                  32 Zend/zend_bitset.h # define ZEND_BITSET_ELM_NUM(n)		((n) >> 6)
n                  33 Zend/zend_bitset.h # define ZEND_BITSET_BIT_NUM(n)		((zend_ulong)(n) & Z_UL(0x3f))
n                  35 Zend/zend_bitset.h # define ZEND_BITSET_ELM_NUM(n)		((n) / (sizeof(zend_long) * 8))
n                  36 Zend/zend_bitset.h # define ZEND_BITSET_BIT_NUM(n)		((n) % (sizeof(zend_long) * 8))
n                  41 Zend/zend_bitset.h static inline uint32_t zend_bitset_len(uint32_t n)
n                  43 Zend/zend_bitset.h 	return (n + ((sizeof(zend_long) * 8) - 1)) / (sizeof(zend_long) * 8);
n                  46 Zend/zend_bitset.h #define ZEND_BITSET_ALLOCA(n, use_heap) \
n                  47 Zend/zend_bitset.h 	(zend_bitset)do_alloca((n) * ZEND_BITSET_ELM_SIZE, use_heap)
n                  49 Zend/zend_bitset.h static inline zend_bool zend_bitset_in(zend_bitset set, uint32_t n)
n                  51 Zend/zend_bitset.h 	return (set[ZEND_BITSET_ELM_NUM(n)] & (Z_UL(1) << ZEND_BITSET_BIT_NUM(n))) != Z_UL(0);
n                  54 Zend/zend_bitset.h static inline void zend_bitset_incl(zend_bitset set, uint32_t n)
n                  56 Zend/zend_bitset.h 	set[ZEND_BITSET_ELM_NUM(n)] |= Z_UL(1) << ZEND_BITSET_BIT_NUM(n);
n                  59 Zend/zend_bitset.h static inline void zend_bitset_excl(zend_bitset set, uint32_t n)
n                  61 Zend/zend_bitset.h 	set[ZEND_BITSET_ELM_NUM(n)] &= ~(Z_UL(1) << ZEND_BITSET_BIT_NUM(n));
n                 487 Zend/zend_builtin_functions.c 	uint32_t i, n;
n                 503 Zend/zend_builtin_functions.c 			n = 0;
n                 513 Zend/zend_builtin_functions.c 						n++;
n                 528 Zend/zend_builtin_functions.c 					n++;
n                 535 Zend/zend_builtin_functions.c 		Z_ARRVAL_P(return_value)->nNumOfElements = n;
n                2249 Zend/zend_builtin_functions.c 		uint32_t n = 0;
n                2263 Zend/zend_builtin_functions.c 							n++;
n                2278 Zend/zend_builtin_functions.c 					n++;
n                2285 Zend/zend_builtin_functions.c 		Z_ARRVAL_P(arg_array)->nNumOfElements = n;
n                 473 Zend/zend_closures.c static HashTable *zend_closure_get_gc(zval *obj, zval **table, int *n) /* {{{ */
n                 478 Zend/zend_closures.c 	*n = Z_TYPE(closure->this_ptr) != IS_NULL ? 1 : 0;
n                 412 Zend/zend_compile.c void zend_del_literal(zend_op_array *op_array, int n) /* {{{ */
n                 414 Zend/zend_compile.c 	zval_dtor(CT_CONSTANT_EX(op_array, n));
n                 415 Zend/zend_compile.c 	if (n + 1 == op_array->last_literal) {
n                 418 Zend/zend_compile.c 		ZVAL_UNDEF(CT_CONSTANT_EX(op_array, n));
n                1437 Zend/zend_compile.c 	size_t n = 0;
n                1440 Zend/zend_compile.c 		while (list[n]) {
n                1441 Zend/zend_compile.c 			n++;
n                1445 Zend/zend_compile.c 	list = erealloc(list, sizeof(void*) * (n+2));
n                1447 Zend/zend_compile.c 	list[n]   = item;
n                1448 Zend/zend_compile.c 	list[n+1] = NULL;
n                1623 Zend/zend_compile.c 		int n = zend_hash_num_elements(CG(class_table));
n                1625 Zend/zend_compile.c 		if (CG(static_members_table) && n >= CG(last_static_member)) {
n                1627 Zend/zend_compile.c 			CG(last_static_member) = n+1;
n                1628 Zend/zend_compile.c 			CG(static_members_table) = realloc(CG(static_members_table), (n+1)*sizeof(zval*));
n                1629 Zend/zend_compile.c 			CG(static_members_table)[n] = NULL;
n                1631 Zend/zend_compile.c 		ce->static_members_table = (zval*)(zend_intptr_t)n;
n                4365 Zend/zend_compile.c 	uint32_t i, n;
n                4371 Zend/zend_compile.c 		n = MIN(func->common.num_args, MAX_ARG_FLAG_NUM);
n                4373 Zend/zend_compile.c 		while (i < n) {
n                 485 Zend/zend_compile.h #define ZEND_CALL_VAR(call, n) \
n                 486 Zend/zend_compile.h 	((zval*)(((char*)(call)) + ((int)(n))))
n                 488 Zend/zend_compile.h #define ZEND_CALL_VAR_NUM(call, n) \
n                 489 Zend/zend_compile.h 	(((zval*)(call)) + (ZEND_CALL_FRAME_SLOT + ((int)(n))))
n                 491 Zend/zend_compile.h #define ZEND_CALL_ARG(call, n) \
n                 492 Zend/zend_compile.h 	ZEND_CALL_VAR_NUM(call, ((int)(n)) - 1)
n                 514 Zend/zend_compile.h #define EX_VAR(n)				ZEND_CALL_VAR(execute_data, n)
n                 515 Zend/zend_compile.h #define EX_VAR_NUM(n)			ZEND_CALL_VAR_NUM(execute_data, n)
n                 517 Zend/zend_compile.h #define EX_VAR_TO_NUM(n)		(ZEND_CALL_VAR(NULL, n) - ZEND_CALL_VAR_NUM(NULL, 0))
n                  54 Zend/zend_config.w32.h #define strncasecmp(s1, s2, n) _strnicmp(s1, s2, n)
n                 317 Zend/zend_gc.c 			int n;
n                 322 Zend/zend_gc.c 			ht = get_gc(&tmp, &zv, &n);
n                 323 Zend/zend_gc.c 			end = zv + n;
n                 325 Zend/zend_gc.c 				if (!n) return;
n                 427 Zend/zend_gc.c 				int n;
n                 432 Zend/zend_gc.c 				ht = get_gc(&tmp, &zv, &n);
n                 433 Zend/zend_gc.c 				end = zv + n;
n                 435 Zend/zend_gc.c 					if (!n) return;
n                 555 Zend/zend_gc.c 					int n;
n                 560 Zend/zend_gc.c 					ht = get_gc(&tmp, &zv, &n);
n                 561 Zend/zend_gc.c 					end = zv + n;
n                 563 Zend/zend_gc.c 						if (!n) return;
n                 720 Zend/zend_gc.c 				int n;
n                 738 Zend/zend_gc.c 				ht = get_gc(&tmp, &zv, &n);
n                 739 Zend/zend_gc.c 				end = zv + n;
n                 741 Zend/zend_gc.c 					if (!n) return count;
n                 907 Zend/zend_gc.c 				int n;
n                 912 Zend/zend_gc.c 				ht = get_gc(&tmp, &zv, &n);
n                 913 Zend/zend_gc.c 				end = zv + n;
n                 915 Zend/zend_gc.c 					if (!n) return;
n                 193 Zend/zend_generators.c static HashTable *zend_generator_get_gc(zval *object, zval **table, int *n) /* {{{ */
n                 197 Zend/zend_generators.c 	*n = 3;
n                  67 Zend/zend_hash.c #define SET_INCONSISTENT(n) do { \
n                  68 Zend/zend_hash.c 		(ht)->u.flags |= n; \
n                  72 Zend/zend_hash.c #define SET_INCONSISTENT(n)
n                 246 Zend/zend_hash.h #define ZEND_INIT_SYMTABLE_EX(ht, n, persistent)			\
n                 247 Zend/zend_hash.h 	zend_hash_init(ht, n, NULL, ZVAL_PTR_DTOR, persistent)
n                  49 Zend/zend_ini_scanner.c #define YYFILL(n) { if (YYCURSOR > YYLIMIT) return 0; }
n                  56 Zend/zend_language_scanner.c #define YYFILL(n) { if ((YYCURSOR + n) >= (YYLIMIT + ZEND_MMAP_AHEAD)) { return 0; } }
n                 129 Zend/zend_object_handlers.c ZEND_API HashTable *zend_std_get_gc(zval *object, zval **table, int *n) /* {{{ */
n                 133 Zend/zend_object_handlers.c 		*n = 0;
n                 140 Zend/zend_object_handlers.c 			*n = 0;
n                 144 Zend/zend_object_handlers.c 			*n = zobj->ce->default_properties_count;
n                 120 Zend/zend_object_handlers.h typedef HashTable *(*zend_object_get_gc_t)(zval *object, zval **table, int *n);
n                  36 Zend/zend_objects_API.h #define SET_OBJ_BUCKET_NUMBER(o, n)	do { \
n                  37 Zend/zend_objects_API.h 		(o) = (zend_object*)((((zend_uintptr_t)(n)) << 1) | OBJ_BUCKET_INVALID); \
n                 186 Zend/zend_operators.h static zend_always_inline const void *zend_memrchr(const void *s, int c, size_t n)
n                 189 Zend/zend_operators.h 	if (n <= 0) {
n                 193 Zend/zend_operators.h 	for (e = (const unsigned char *)s + n - 1; e >= (const unsigned char *)s; e--) {
n                 425 Zend/zend_portability.h #define ZEND_NORMALIZE_BOOL(n)			\
n                 426 Zend/zend_portability.h 	((n) ? (((n)>0) ? 1 : -1) : 0)
n                  25 Zend/zend_stack.c #define ZEND_STACK_ELEMENT(stack, n) ((void *)((char *) (stack)->elements + (stack)->size * (n)))
n                 157 Zend/zend_stream.c 		size_t n;
n                 165 Zend/zend_stream.c 		for (n = 0; n < len && (c = zend_stream_getc(file_handle)) != EOF && c != 4 && c != '\n'; ++n) {
n                 167 Zend/zend_stream.c 		for (n = 0; n < len && (c = zend_stream_getc(file_handle)) != EOF && c != '\n'; ++n)  {
n                 169 Zend/zend_stream.c 			buf[n] = (char)c;
n                 172 Zend/zend_stream.c 			buf[n++] = (char)c;
n                 175 Zend/zend_stream.c 		return n;
n                 137 Zend/zend_string.h static zend_always_inline zend_string *zend_string_safe_alloc(size_t n, size_t m, size_t l, int persistent)
n                 139 Zend/zend_string.h 	zend_string *ret = (zend_string *)safe_pemalloc(n, m, ZEND_MM_ALIGNED_SIZE(_ZSTR_STRUCT_SIZE(l)), persistent);
n                 151 Zend/zend_string.h 	ZSTR_LEN(ret) = (n * m) + l;
n                 240 Zend/zend_string.h static zend_always_inline zend_string *zend_string_safe_realloc(zend_string *s, size_t n, size_t m, size_t l, int persistent)
n                 246 Zend/zend_string.h 			ret = (zend_string *)safe_perealloc(s, n, m, ZEND_MM_ALIGNED_SIZE(_ZSTR_STRUCT_SIZE(l)), persistent);
n                 247 Zend/zend_string.h 			ZSTR_LEN(ret) = (n * m) + l;
n                 254 Zend/zend_string.h 	ret = zend_string_safe_alloc(n, m, l, persistent);
n                 255 Zend/zend_string.h 	memcpy(ZSTR_VAL(ret), ZSTR_VAL(s), MIN((n * m) + l, ZSTR_LEN(s)) + 1);
n                 525 Zend/zend_strtod.c #define ACQUIRE_DTOA_LOCK(n)	/*nothing*/
n                 526 Zend/zend_strtod.c #define FREE_DTOA_LOCK(n)	/*nothing*/
n                1024 Zend/zend_strtod.c 	int i, k1, n, n1;
n                1029 Zend/zend_strtod.c 	n = k >> 5;
n                1031 Zend/zend_strtod.c 	n = k >> 4;
n                1034 Zend/zend_strtod.c 	n1 = n + b->wds + 1;
n                1039 Zend/zend_strtod.c 	for(i = 0; i < n; i++)
n                1738 Zend/zend_strtod.c 	int n;
n                1741 Zend/zend_strtod.c 	n = k >> kshift;
n                1742 Zend/zend_strtod.c 	if (n < b->wds) {
n                1744 Zend/zend_strtod.c 		x += n;
n                1746 Zend/zend_strtod.c 			n = 32 - k;
n                1749 Zend/zend_strtod.c 				*x1++ = (y | (*x << n)) & 0xffffffff;
n                1770 Zend/zend_strtod.c 	int n, nwds;
n                1775 Zend/zend_strtod.c 	n = k >> kshift;
n                1776 Zend/zend_strtod.c 	if (n > nwds)
n                1777 Zend/zend_strtod.c 		n = nwds;
n                1778 Zend/zend_strtod.c 	else if (n < nwds && (k &= kmask)) {
n                1779 Zend/zend_strtod.c 		x1 = x2 = x[n];
n                1786 Zend/zend_strtod.c 	x += n;
n                1812 Zend/zend_strtod.c 	int big, denorm, esign, havedig, k, n, nbits, up, zret;
n                1915 Zend/zend_strtod.c 		if ((n = hexdig[*s]) == 0 || n > 0x19) {
n                1919 Zend/zend_strtod.c 		e1 = n - 0x10;
n                1920 Zend/zend_strtod.c 		while((n = hexdig[*++s]) !=0 && n <= 0x19) {
n                1923 Zend/zend_strtod.c 			e1 = 10*e1 + n - 0x10;
n                1978 Zend/zend_strtod.c 	n = s1 - s0 - 1;
n                1979 Zend/zend_strtod.c 	for(k = 0; n > (1 << (kshift-2)) - 1; n >>= 1)
n                1983 Zend/zend_strtod.c 	n = 0;
n                1998 Zend/zend_strtod.c 		if (n == ULbits) {
n                2001 Zend/zend_strtod.c 			n = 0;
n                2003 Zend/zend_strtod.c 		L |= (hexdig[*s1] & 0x0f) << n;
n                2004 Zend/zend_strtod.c 		n += 4;
n                2007 Zend/zend_strtod.c 	b->wds = n = x - b->x;
n                2008 Zend/zend_strtod.c 	n = ULbits*n - hi0bits(L);
n                2012 Zend/zend_strtod.c 	if (n > nbits) {
n                2013 Zend/zend_strtod.c 		n -= nbits;
n                2014 Zend/zend_strtod.c 		if (any_on(b,n)) {
n                2016 Zend/zend_strtod.c 			k = n - 1;
n                2023 Zend/zend_strtod.c 		rshift(b, n);
n                2024 Zend/zend_strtod.c 		e += n;
n                2026 Zend/zend_strtod.c 	else if (n < nbits) {
n                2027 Zend/zend_strtod.c 		n = nbits - n;
n                2028 Zend/zend_strtod.c 		b = lshift(b, n);
n                2029 Zend/zend_strtod.c 		e -= n;
n                2046 Zend/zend_strtod.c 		n = emin - e;
n                2047 Zend/zend_strtod.c 		if (n >= nbits) {
n                2051 Zend/zend_strtod.c 				if (n == nbits && (n < 2 || any_on(b,n-1)))
n                2072 Zend/zend_strtod.c 		k = n - 1;
n                2079 Zend/zend_strtod.c 		nbits -= n;
n                2080 Zend/zend_strtod.c 		rshift(b,n);
n                2111 Zend/zend_strtod.c 			 || ((n = nbits & kmask) !=0
n                2112 Zend/zend_strtod.c 			     && hi0bits(x[k-1]) < 32-n)) {
n                2183 Zend/zend_strtod.c 	int n;
n                2194 Zend/zend_strtod.c 	n = S->wds;
n                2196 Zend/zend_strtod.c 	/*debug*/ if (b->wds > n)
n                2199 Zend/zend_strtod.c 	if (b->wds < n)
n                2202 Zend/zend_strtod.c 	sxe = sx + --n;
n                2204 Zend/zend_strtod.c 	bxe = bx + n;
n                2250 Zend/zend_strtod.c 				--n;
n                2251 Zend/zend_strtod.c 			b->wds = n;
n                2289 Zend/zend_strtod.c 		bxe = bx + n;
n                2292 Zend/zend_strtod.c 				--n;
n                2293 Zend/zend_strtod.c 			b->wds = n;
n                3632 Zend/zend_strtod.c nrv_alloc(s, rve, n) char *s, **rve; int n;
n                3634 Zend/zend_strtod.c nrv_alloc(const char *s, char **rve, int n)
n                3639 Zend/zend_strtod.c 	t = rv = rv_alloc(n);
n                 145 Zend/zend_ts_hash.h #define ZEND_TS_INIT_SYMTABLE_EX(ht, n, persistent)			\
n                 146 Zend/zend_ts_hash.h 	zend_ts_hash_init(ht, n, NULL, ZVAL_PTR_DTOR, persistent)
n                  93 Zend/zend_virtual_cwd.c static int php_check_dots(const char *element, int n)
n                  95 Zend/zend_virtual_cwd.c 	while (n-- > 0) if (element[n] != '.') break;
n                  97 Zend/zend_virtual_cwd.c 	return (n != -1);
n                 651 Zend/zend_virtual_cwd.c 	zend_ulong n = key % (sizeof(CWDG(realpath_cache)) / sizeof(CWDG(realpath_cache)[0]));
n                 652 Zend/zend_virtual_cwd.c 	realpath_cache_bucket **bucket = &CWDG(realpath_cache)[n];
n                 689 Zend/zend_virtual_cwd.c 		zend_ulong n;
n                 714 Zend/zend_virtual_cwd.c 		n = bucket->key % (sizeof(CWDG(realpath_cache)) / sizeof(CWDG(realpath_cache)[0]));
n                 715 Zend/zend_virtual_cwd.c 		bucket->next = CWDG(realpath_cache)[n];
n                 716 Zend/zend_virtual_cwd.c 		CWDG(realpath_cache)[n] = bucket;
n                 725 Zend/zend_virtual_cwd.c 	zend_ulong n = key % (sizeof(CWDG(realpath_cache)) / sizeof(CWDG(realpath_cache)[0]));
n                 726 Zend/zend_virtual_cwd.c 	realpath_cache_bucket **bucket = &CWDG(realpath_cache)[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                 505 ext/calendar/calendar.c static char *heb_number_to_chars(int n, int fl, char **ret)
n                 514 ext/calendar/calendar.c 	if (n > 9999 || n < 1) {
n                 520 ext/calendar/calendar.c 	if (n / 1000) {
n                 521 ext/calendar/calendar.c 		*p = alef_bet[n / 1000];
n                 534 ext/calendar/calendar.c 		n = n % 1000;
n                 538 ext/calendar/calendar.c 	while (n >= 400) {
n                 541 ext/calendar/calendar.c 		n -= 400;
n                 545 ext/calendar/calendar.c 	if (n >= 100) {
n                 546 ext/calendar/calendar.c 		*p = alef_bet[18 + n / 100];
n                 548 ext/calendar/calendar.c 		n = n % 100;
n                 552 ext/calendar/calendar.c 	if (n == 15 || n == 16) {
n                 555 ext/calendar/calendar.c 		*p = alef_bet[n - 9];
n                 559 ext/calendar/calendar.c 		if (n >= 10) {
n                 560 ext/calendar/calendar.c 			*p = alef_bet[9 + n / 10];
n                 562 ext/calendar/calendar.c 			n = n % 10;
n                 566 ext/calendar/calendar.c 		if (n > 0) {
n                 567 ext/calendar/calendar.c 			*p = alef_bet[n];
n                  98 ext/curl/interface.c static void php_curl_ssl_lock(int mode, int n, const char * file, int line)
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                 511 ext/curl/interface.c 	size_t n = 0;
n                 582 ext/curl/interface.c 	n = 0;
n                 585 ext/curl/interface.c 			n += sprintf(str + n, "%s%s", *p, *(p + 1) != NULL ? ", " : "");
n                 110 ext/date/lib/parse_date.c #define   YYFILL(n)    return EOI;
n                  76 ext/date/lib/parse_iso_intervals.c #define   YYFILL(n)    return EOI;
n                 149 ext/date/lib/timelib_structs.h # define TIMELIB_LL_CONST(n) n ## i64
n                 153 ext/date/lib/timelib_structs.h # define TIMELIB_LL_CONST(n) n ## ll
n                 639 ext/date/php_date.c static HashTable *date_object_get_gc(zval *object, zval **table, int *n);
n                 641 ext/date/php_date.c static HashTable *date_object_get_gc_interval(zval *object, zval **table, int *n);
n                 643 ext/date/php_date.c static HashTable *date_object_get_gc_period(zval *object, zval **table, int *n);
n                 646 ext/date/php_date.c static HashTable *date_object_get_gc_timezone(zval *object, zval **table, int *n);
n                2148 ext/date/php_date.c static HashTable *date_object_get_gc(zval *object, zval **table, int *n) /* {{{ */
n                2151 ext/date/php_date.c 	*n = 0;
n                2155 ext/date/php_date.c static HashTable *date_object_get_gc_timezone(zval *object, zval **table, int *n) /* {{{ */
n                2158 ext/date/php_date.c        *n = 0;
n                2334 ext/date/php_date.c static HashTable *date_object_get_gc_interval(zval *object, zval **table, int *n) /* {{{ */
n                2338 ext/date/php_date.c 	*n = 0;
n                2356 ext/date/php_date.c #define PHP_DATE_INTERVAL_ADD_PROPERTY(n,f) \
n                2358 ext/date/php_date.c 	zend_hash_str_update(props, n, sizeof(n)-1, &zv);
n                3992 ext/date/php_date.c #define GET_VALUE_FROM_STRUCT(n,m)            \
n                3994 ext/date/php_date.c 		value = obj->diff->n;                 \
n                4056 ext/date/php_date.c #define SET_VALUE_FROM_STRUCT(n,m)            \
n                4058 ext/date/php_date.c 		obj->diff->n = zval_get_long(value); \
n                4833 ext/date/php_date.c static HashTable *date_object_get_gc_period(zval *object, zval **table, int *n) /* {{{ */
n                4836 ext/date/php_date.c 	*n = 0;
n                 221 ext/dba/dba_cdb.c #define CREAD(n) do { \
n                 222 ext/dba/dba_cdb.c 	if (cdb_file_read(cdb->file, buf, n) < n) return NULL; \
n                 239 ext/dba/dba_cdb.c #define CSEEK(n) do { \
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) != (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) == -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                1348 ext/dom/node.c 	xmlNode *n, *node;
n                1357 ext/dom/node.c 	DOM_GET_OBJ(n, id, xmlNodePtr, intern);
n                1359 ext/dom/node.c 	node = xmlDocCopyNode(n, n->doc, recursive);
n                1367 ext/dom/node.c 	if (n->type == XML_ELEMENT_NODE && recursive == 0) {
n                1368 ext/dom/node.c 		if (n->nsDef != NULL) {
n                1369 ext/dom/node.c 			node->nsDef = xmlCopyNamespaceList(n->nsDef);
n                1371 ext/dom/node.c 		if (n->ns != NULL) {
n                1373 ext/dom/node.c 			ns = xmlSearchNs(n->doc, node, n->ns->prefix);
n                1375 ext/dom/node.c 				ns = xmlSearchNs(n->doc, n, n->ns->prefix);
n                1388 ext/dom/node.c 		if (n->properties != NULL) {
n                1389 ext/dom/node.c 			node->properties = xmlCopyPropList(node, n->properties);
n                1394 ext/dom/node.c 	if (node->doc != n->doc) {
n                1033 ext/exif/exif.c 	int c, i, p=0, n = 5+31;
n                1037 ext/exif/exif.c 		for(i=0; i<len+15 && p+n<=sizeof(buf); i++) {
n                3428 ext/exif/exif.c 	int             n, marker;
n                3451 ext/exif/exif.c 		n = 8;
n                3452 ext/exif/exif.c 		while ((c = data[pos++]) == 0xFF && n--) {
n                1104 ext/fileinfo/libmagic/cdf.c 	const char *n;
n                1135 ext/fileinfo/libmagic/cdf.c 			return snprintf(buf, bufsiz, "%s", vn[i].n);
n                 164 ext/fileinfo/libmagic/compress.c swrite(int fd, const void *buf, size_t n)
n                 167 ext/fileinfo/libmagic/compress.c 	size_t rn = n;
n                 170 ext/fileinfo/libmagic/compress.c 		switch (rv = write(fd, buf, n)) {
n                 176 ext/fileinfo/libmagic/compress.c 			n -= rv;
n                 180 ext/fileinfo/libmagic/compress.c 	while (n > 0);
n                 189 ext/fileinfo/libmagic/compress.c sread(int fd, void *buf, size_t n, int canbepipe)
n                 195 ext/fileinfo/libmagic/compress.c 	size_t rn = n;
n                 229 ext/fileinfo/libmagic/compress.c 	if (t > 0 && (size_t)t < n) {
n                 230 ext/fileinfo/libmagic/compress.c 		n = t;
n                 231 ext/fileinfo/libmagic/compress.c 		rn = n;
n                 237 ext/fileinfo/libmagic/compress.c 		switch ((rv = FINFO_READ_FUNC(fd, buf, n))) {
n                 243 ext/fileinfo/libmagic/compress.c 			return rn - n;
n                 245 ext/fileinfo/libmagic/compress.c 			n -= rv;
n                 249 ext/fileinfo/libmagic/compress.c 	while (n > 0);
n                 331 ext/fileinfo/libmagic/compress.c     unsigned char **newch, size_t n)
n                 339 ext/fileinfo/libmagic/compress.c 		if (data_start+1 >= n)
n                 344 ext/fileinfo/libmagic/compress.c 		while(data_start < n && old[data_start])
n                 349 ext/fileinfo/libmagic/compress.c 		while(data_start < n && old[data_start])
n                 356 ext/fileinfo/libmagic/compress.c 	if (data_start >= n)
n                 365 ext/fileinfo/libmagic/compress.c 	z.avail_in = CAST(uint32_t, (n - data_start));
n                 385 ext/fileinfo/libmagic/compress.c 	n = (size_t)z.total_out;
n                 389 ext/fileinfo/libmagic/compress.c 	(*newch)[n] = '\0';
n                 391 ext/fileinfo/libmagic/compress.c 	return n;
n                 397 ext/fileinfo/libmagic/compress.c     const unsigned char *old, unsigned char **newch, size_t n)
n                 406 ext/fileinfo/libmagic/compress.c 		return uncompressgzipped(ms, old, newch, n);
n                 459 ext/fileinfo/libmagic/compress.c 				if (swrite(fdin[1], old, n) != (ssize_t)n) {
n                 493 ext/fileinfo/libmagic/compress.c 			n = NODATA-;
n                 497 ext/fileinfo/libmagic/compress.c 			n = r;
n                 500 ext/fileinfo/libmagic/compress.c  		(*newch)[n] = '\0';
n                 514 ext/fileinfo/libmagic/compress.c 		return n;
n                 297 ext/fileinfo/libmagic/encoding.c 	int n;
n                 339 ext/fileinfo/libmagic/encoding.c 			for (n = 0; n < following; n++) {
n                 315 ext/fileinfo/libmagic/funcs.c #define OCTALIFY(n, o)	\
n                 317 ext/fileinfo/libmagic/funcs.c 	(void)(*(n)++ = '\\', \
n                 318 ext/fileinfo/libmagic/funcs.c 	*(n)++ = (((uint32_t)*(o) >> 6) & 3) + '0', \
n                 319 ext/fileinfo/libmagic/funcs.c 	*(n)++ = (((uint32_t)*(o) >> 3) & 7) + '0', \
n                 320 ext/fileinfo/libmagic/funcs.c 	*(n)++ = (((uint32_t)*(o) >> 0) & 7) + '0', \
n                  73 ext/fileinfo/libmagic/softmagic.c #define OFFSET_OOB(n, o, i)	((n) < (o) || (i) > ((n) - (o)))
n                  49 ext/fileinfo/libmagic/strcasestr.c _strncasecmp(const char *s1, const char *s2, size_t n)
n                  51 ext/fileinfo/libmagic/strcasestr.c 	if (n != 0) {
n                  60 ext/fileinfo/libmagic/strcasestr.c 		} while (--n != 0);
n                 144 ext/filter/logical_filters.c 			zend_ulong n = ((*(str++)) - '0');
n                 147 ext/filter/logical_filters.c 				((ctx_value = ctx_value * 8) > ((zend_ulong)(~(zend_long)0)) - n)) {
n                 150 ext/filter/logical_filters.c 			ctx_value += n;
n                 164 ext/filter/logical_filters.c 	zend_ulong n;
n                 168 ext/filter/logical_filters.c 			n = ((*(str++)) - '0');
n                 170 ext/filter/logical_filters.c 			n = ((*(str++)) - ('a' - 10));
n                 172 ext/filter/logical_filters.c 			n = ((*(str++)) - ('A' - 10));
n                 177 ext/filter/logical_filters.c 			((ctx_value = ctx_value * 16) > ((zend_ulong)(~(zend_long)0)) - n)) {
n                 180 ext/filter/logical_filters.c 		ctx_value += n;
n                 338 ext/filter/logical_filters.c 	int first, n;
n                 363 ext/filter/logical_filters.c 		n = 0;
n                 365 ext/filter/logical_filters.c 			++n;
n                 369 ext/filter/logical_filters.c 			if (!first && n != 3) {
n                 391 ext/filter/logical_filters.c 			if (first?(n < 1 || n > 3):(n != 3)) {
n                 636 ext/filter/logical_filters.c 	int n = 0;
n                 656 ext/filter/logical_filters.c 		ip[n++] = num;
n                 657 ext/filter/logical_filters.c 		if (n == 4) {
n                 671 ext/filter/logical_filters.c 	int n;
n                 728 ext/filter/logical_filters.c 		n = 0;
n                 733 ext/filter/logical_filters.c 			n++;
n                 736 ext/filter/logical_filters.c 		if (n < 1 || n > 4) {
n                 739 ext/ftp/ftp.c  	socklen_t			n;
n                 753 ext/ftp/ftp.c  	n = sizeof(ftp->pasvaddr);
n                 754 ext/ftp/ftp.c  	memset(&ftp->pasvaddr, 0, n);
n                 757 ext/ftp/ftp.c  	if (getpeername(ftp->fd, sa, &n) < 0) {
n                 780 ext/ftp/ftp.c  			for (n = 0; *ptr && n < 3; ptr++) {
n                 782 ext/ftp/ftp.c  					n++;
n                 806 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                 807 ext/ftp/ftp.c  	if (n != 6) {
n                 810 ext/ftp/ftp.c  	for (n = 0; n < 6; n++) {
n                 811 ext/ftp/ftp.c  		ipbox.c[n] = (unsigned char) b[n];
n                1025 ext/ftp/ftp.c  	int		n;
n                1038 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                1039 ext/ftp/ftp.c  	if (n != 6) {
n                1265 ext/ftp/ftp.c      int         n;
n                1276 ext/ftp/ftp.c  		n = php_pollfd_for_ms(s, POLLOUT, ftp->timeout_sec * 1000);
n                1278 ext/ftp/ftp.c  		if (n < 1) {
n                1280 ext/ftp/ftp.c  			if (n == 0) {
n                1284 ext/ftp/ftp.c  			if (n == 0) {
n                1358 ext/ftp/ftp.c  	int		n, nr_bytes;
n                1366 ext/ftp/ftp.c  	n = php_pollfd_for_ms(s, PHP_POLLREADABLE, ftp->timeout_sec * 1000);
n                1367 ext/ftp/ftp.c  	if (n < 1) {
n                1369 ext/ftp/ftp.c  		if (n == 0) {
n                1373 ext/ftp/ftp.c  		if (n == 0) {
n                1439 ext/ftp/ftp.c  	int		n;
n                1441 ext/ftp/ftp.c  	n = php_pollfd_for_ms(s, PHP_POLLREADABLE, 1000);
n                1442 ext/ftp/ftp.c  	if (n < 1) {
n                1444 ext/ftp/ftp.c  		if (n == 0) {
n                1448 ext/ftp/ftp.c  		if (n == 0) {
n                1463 ext/ftp/ftp.c  	int		n;
n                1465 ext/ftp/ftp.c  	n = php_pollfd_for_ms(s, POLLOUT, 1000);
n                1466 ext/ftp/ftp.c  	if (n < 1) {
n                1468 ext/ftp/ftp.c  		if (n == 0) {
n                1472 ext/ftp/ftp.c  		if (n == 0) {
n                1488 ext/ftp/ftp.c  	int		n;
n                1490 ext/ftp/ftp.c  	n = php_pollfd_for_ms(s, PHP_POLLREADABLE, ftp->timeout_sec * 1000);
n                1491 ext/ftp/ftp.c  	if (n < 1) {
n                1493 ext/ftp/ftp.c  		if (n == 0) {
n                1497 ext/ftp/ftp.c  		if (n == 0) {
n                1326 ext/gd/gd.c    	int body_size, n = 0, b, i, body_size_check;
n                1353 ext/gd/gd.c    	while (b < hdr_size && (n = php_stream_read(stream, (char*)&font[b], hdr_size - b))) {
n                1354 ext/gd/gd.c    		b += n;
n                1357 ext/gd/gd.c    	if (!n) {
n                1396 ext/gd/gd.c    	while (b < body_size && (n = php_stream_read(stream, &font->data[b], body_size - b))) {
n                1397 ext/gd/gd.c    		b += n;
n                1400 ext/gd/gd.c    	if (!n) {
n                 397 ext/gd/libgd/gd.c 	float h = HWB.H, w = HWB.W, b = HWB.B, v, n, f;
n                 409 ext/gd/libgd/gd.c 	n = w + f * (v - w);		/* linear interpolation between w and v */
n                 413 ext/gd/libgd/gd.c 			RETURN_RGB(v, n, w);
n                 415 ext/gd/libgd/gd.c 			RETURN_RGB(n, v, w);
n                 417 ext/gd/libgd/gd.c 			RETURN_RGB(w, v, n);
n                 419 ext/gd/libgd/gd.c 			RETURN_RGB(w, n, v);
n                 421 ext/gd/libgd/gd.c 			RETURN_RGB(n, w, v);
n                 423 ext/gd/libgd/gd.c 			RETURN_RGB(v, w, n);
n                1652 ext/gd/libgd/gd.c long lsqrt (long n)
n                1654 ext/gd/libgd/gd.c  	long result = (long) sqrt ((double) n);
n                2565 ext/gd/libgd/gd.c void gdImagePolygon (gdImagePtr im, gdPointPtr p, int n, int c)
n                2572 ext/gd/libgd/gd.c 	if (n <= 0) {
n                2590 ext/gd/libgd/gd.c 	draw_line(im, lx, ly, p[n - 1].x, p[n - 1].y, c);
n                2591 ext/gd/libgd/gd.c 	for (i = 1; i < n; i++) {
n                2614 ext/gd/libgd/gd.c void gdImageFilledPolygon (gdImagePtr im, gdPointPtr p, int n, int c)
n                2625 ext/gd/libgd/gd.c 	if (n <= 0) {
n                2629 ext/gd/libgd/gd.c 	if (overflow2(sizeof(int), n)) {
n                2640 ext/gd/libgd/gd.c 		im->polyInts = (int *) gdMalloc(sizeof(int) * n);
n                2641 ext/gd/libgd/gd.c 		im->polyAllocated = n;
n                2643 ext/gd/libgd/gd.c 	if (im->polyAllocated < n) {
n                2644 ext/gd/libgd/gd.c 		while (im->polyAllocated < n) {
n                2654 ext/gd/libgd/gd.c 	for (i = 1; i < n; i++) {
n                2677 ext/gd/libgd/gd.c 		for (i = 0; i < n; i++) {
n                2679 ext/gd/libgd/gd.c 				ind1 = n - 1;
n                2717 ext/gd/libgd/gd.c 		gdImagePolygon(im, p, n, c);
n                 504 ext/gd/libgd/gd.h void gdImagePolygon(gdImagePtr im, gdPointPtr p, int n, int c);
n                 505 ext/gd/libgd/gd.h void gdImageFilledPolygon(gdImagePtr im, gdPointPtr p, int n, int c);
n                1139 ext/gd/libgd/gd_interpolation.c 				const long n = gd_fxtoi(f_b);
n                1141 ext/gd/libgd/gd_interpolation.c 				dst_img->tpixels[dst_offset_y][dst_offset_x++] = im->tpixels[m][n];
n                1150 ext/gd/libgd/gd_interpolation.c 				const long n = gd_fxtoi(f_b);
n                1152 ext/gd/libgd/gd_interpolation.c 				dst_img->tpixels[dst_offset_y][dst_offset_x++] = colorIndex2RGBA(im->pixels[m][n]);
n                1243 ext/gd/libgd/gd_interpolation.c 			const long n = gd_fxtoi(f_b);
n                1245 ext/gd/libgd/gd_interpolation.c 			gdFixed f_g = f_b - gd_itofx(n);
n                1261 ext/gd/libgd/gd_interpolation.c 			pixel1 = getPixelOverflowPalette(im, n, m, 0);
n                1262 ext/gd/libgd/gd_interpolation.c 			pixel2 = getPixelOverflowPalette(im, n + 1, m, 0);
n                1263 ext/gd/libgd/gd_interpolation.c 			pixel3 = getPixelOverflowPalette(im, n, m + 1, 0);
n                1264 ext/gd/libgd/gd_interpolation.c 			pixel4 = getPixelOverflowPalette(im, n + 1, m + 1, 0);
n                1331 ext/gd/libgd/gd_interpolation.c 			const gdFixed n = gd_fxtoi(f_b);
n                1333 ext/gd/libgd/gd_interpolation.c 			gdFixed f_g = f_b - gd_itofx(n);
n                1347 ext/gd/libgd/gd_interpolation.c 			dwSrcTotalOffset = m + n;
n                1349 ext/gd/libgd/gd_interpolation.c 			pixel1 = getPixelOverflowTC(im, n, m, 0);
n                1350 ext/gd/libgd/gd_interpolation.c 			pixel2 = getPixelOverflowTC(im, n + 1, m, 0);
n                1351 ext/gd/libgd/gd_interpolation.c 			pixel3 = getPixelOverflowTC(im, n, m + 1, 0);
n                1352 ext/gd/libgd/gd_interpolation.c 			pixel4 = getPixelOverflowTC(im, n + 1, m + 1, 0);
n                1437 ext/gd/libgd/gd_interpolation.c 			const long n = gd_fxtoi(f_b);
n                1439 ext/gd/libgd/gd_interpolation.c 			const gdFixed f_g = f_b - gd_itofx(n);
n                1446 ext/gd/libgd/gd_interpolation.c 			if ((m < 1) || (n < 1)) {
n                1447 ext/gd/libgd/gd_interpolation.c 				src_offset_x[0] = n;
n                1450 ext/gd/libgd/gd_interpolation.c 				src_offset_x[0] = n - 1;
n                1455 ext/gd/libgd/gd_interpolation.c 				src_offset_x[1] = n;
n                1458 ext/gd/libgd/gd_interpolation.c 				src_offset_x[1] = n;
n                1462 ext/gd/libgd/gd_interpolation.c 			if ((m < 1) || (n >= src_w - 1)) {
n                1463 ext/gd/libgd/gd_interpolation.c 				src_offset_x[2] = n;
n                1466 ext/gd/libgd/gd_interpolation.c 				src_offset_x[2] = n + 1;
n                1470 ext/gd/libgd/gd_interpolation.c 			if ((m < 1) || (n >= src_w - 2)) {
n                1471 ext/gd/libgd/gd_interpolation.c 				src_offset_x[3] = n;
n                1474 ext/gd/libgd/gd_interpolation.c 				src_offset_x[3] = n + 1 + 1;
n                1478 ext/gd/libgd/gd_interpolation.c 			if (n < 1) {
n                1479 ext/gd/libgd/gd_interpolation.c 				src_offset_x[4] = n;
n                1482 ext/gd/libgd/gd_interpolation.c 				src_offset_x[4] = n - 1;
n                1486 ext/gd/libgd/gd_interpolation.c 			src_offset_x[5] = n;
n                1488 ext/gd/libgd/gd_interpolation.c 			if (n >= src_w-1) {
n                1489 ext/gd/libgd/gd_interpolation.c 				src_offset_x[6] = n;
n                1492 ext/gd/libgd/gd_interpolation.c 				src_offset_x[6] = n + 1;
n                1496 ext/gd/libgd/gd_interpolation.c 			if (n >= src_w - 2) {
n                1497 ext/gd/libgd/gd_interpolation.c 				src_offset_x[7] = n;
n                1500 ext/gd/libgd/gd_interpolation.c 				src_offset_x[7] = n + 1 + 1;
n                1504 ext/gd/libgd/gd_interpolation.c 			if ((m >= src_h - 1) || (n < 1)) {
n                1505 ext/gd/libgd/gd_interpolation.c 				src_offset_x[8] = n;
n                1508 ext/gd/libgd/gd_interpolation.c 				src_offset_x[8] = n - 1;
n                1513 ext/gd/libgd/gd_interpolation.c 				src_offset_x[8] = n;
n                1516 ext/gd/libgd/gd_interpolation.c 				src_offset_x[9] = n;
n                1520 ext/gd/libgd/gd_interpolation.c 			if ((m >= src_h-1) || (n >= src_w-1)) {
n                1521 ext/gd/libgd/gd_interpolation.c 				src_offset_x[10] = n;
n                1524 ext/gd/libgd/gd_interpolation.c 				src_offset_x[10] = n + 1;
n                1528 ext/gd/libgd/gd_interpolation.c 			if ((m >= src_h - 1) || (n >= src_w - 2)) {
n                1529 ext/gd/libgd/gd_interpolation.c 				src_offset_x[11] = n;
n                1532 ext/gd/libgd/gd_interpolation.c 				src_offset_x[11] = n + 1 + 1;
n                1536 ext/gd/libgd/gd_interpolation.c 			if ((m >= src_h - 2) || (n < 1)) {
n                1537 ext/gd/libgd/gd_interpolation.c 				src_offset_x[12] = n;
n                1540 ext/gd/libgd/gd_interpolation.c 				src_offset_x[12] = n - 1;
n                1545 ext/gd/libgd/gd_interpolation.c 				src_offset_x[13] = n;
n                1548 ext/gd/libgd/gd_interpolation.c 				src_offset_x[13] = n;
n                1552 ext/gd/libgd/gd_interpolation.c 			if ((m >= src_h - 2) || (n >= src_w - 1)) {
n                1553 ext/gd/libgd/gd_interpolation.c 				src_offset_x[14] = n;
n                1556 ext/gd/libgd/gd_interpolation.c 				src_offset_x[14] = n + 1;
n                1560 ext/gd/libgd/gd_interpolation.c 			if ((m >= src_h - 2) || (n >= src_w - 2)) {
n                1561 ext/gd/libgd/gd_interpolation.c 				src_offset_x[15] = n;
n                1564 ext/gd/libgd/gd_interpolation.c 				src_offset_x[15] = n  + 1 + 1;
n                1697 ext/gd/libgd/gd_interpolation.c 			long n = gd_fxtoi(f_n);
n                1699 ext/gd/libgd/gd_interpolation.c 			if ((m > 0) && (m < src_h-1) && (n > 0) && (n < src_w-1)) {
n                1701 ext/gd/libgd/gd_interpolation.c 					dst->tpixels[dst_offset_y][dst_offset_x++] = src->tpixels[m][n];
n                1759 ext/gd/libgd/gd_interpolation.c 			long n = gd_fxtoi(f_n);
n                1761 ext/gd/libgd/gd_interpolation.c 			if ((n <= 0) || (m <= 0) || (m >= src_h) || (n >= src_w)) {
n                1763 ext/gd/libgd/gd_interpolation.c 			} else if ((n <= 1) || (m <= 1) || (m >= src_h - 1) || (n >= src_w - 1)) {
n                1765 ext/gd/libgd/gd_interpolation.c 				register int c = getPixelInterpolated(src, n, m, bgColor);
n                1770 ext/gd/libgd/gd_interpolation.c 				dst->tpixels[dst_offset_y][dst_offset_x++] = getPixelInterpolated(src, n, m, bgColor);
n                1813 ext/gd/libgd/gd_interpolation.c 			const unsigned int n = gd_fxtoi(f_n);
n                1815 ext/gd/libgd/gd_interpolation.c 			if ((m > 0) && (m < src_h - 1) && (n > 0) && (n < src_w - 1)) {
n                1817 ext/gd/libgd/gd_interpolation.c 				const gdFixed f_g = f_n - gd_itofx(n);
n                1823 ext/gd/libgd/gd_interpolation.c 				if (n < src_w - 1) {
n                1824 ext/gd/libgd/gd_interpolation.c 					src_offset_x = n + 1;
n                1829 ext/gd/libgd/gd_interpolation.c 					src_offset_x = n;
n                1833 ext/gd/libgd/gd_interpolation.c 				if (!((n >= src_w-1) || (m >= src_h-1))) {
n                1834 ext/gd/libgd/gd_interpolation.c 					src_offset_x = n + 1;
n                1933 ext/gd/libgd/gd_interpolation.c 			const int n = gd_fxtoi(f_n);
n                1935 ext/gd/libgd/gd_interpolation.c 			if ((m > 0) && (m < src_h - 1) && (n > 0) && (n < src_w-1)) {
n                1937 ext/gd/libgd/gd_interpolation.c 				const gdFixed f_g = f_n - gd_itofx(n);
n                1943 ext/gd/libgd/gd_interpolation.c 				if ((m < 1) || (n < 1)) {
n                1944 ext/gd/libgd/gd_interpolation.c 					src_offset_x[0] = n;
n                1947 ext/gd/libgd/gd_interpolation.c 					src_offset_x[0] = n - 1;
n                1952 ext/gd/libgd/gd_interpolation.c 					src_offset_x[1] = n;
n                1955 ext/gd/libgd/gd_interpolation.c 					src_offset_x[1] = n;
n                1959 ext/gd/libgd/gd_interpolation.c 				if ((m < 1) || (n >= src_w-1)) {
n                1963 ext/gd/libgd/gd_interpolation.c 					src_offset_x[2] = n + 1;
n                1967 ext/gd/libgd/gd_interpolation.c 				if ((m < 1) || (n >= src_w-2)) {
n                1971 ext/gd/libgd/gd_interpolation.c 					src_offset_x[3] = n + 1 + 1;
n                1975 ext/gd/libgd/gd_interpolation.c 				if (n < 1) {
n                1979 ext/gd/libgd/gd_interpolation.c 					src_offset_x[4] = n - 1;
n                1983 ext/gd/libgd/gd_interpolation.c 				src_offset_x[5] = n;
n                1985 ext/gd/libgd/gd_interpolation.c 				if (n >= src_w-1) {
n                1989 ext/gd/libgd/gd_interpolation.c 					src_offset_x[6] = n + 1;
n                1993 ext/gd/libgd/gd_interpolation.c 				if (n >= src_w-2) {
n                1997 ext/gd/libgd/gd_interpolation.c 					src_offset_x[7] = n + 1 + 1;
n                2001 ext/gd/libgd/gd_interpolation.c 				if ((m >= src_h-1) || (n < 1)) {
n                2005 ext/gd/libgd/gd_interpolation.c 					src_offset_x[8] = n - 1;
n                2013 ext/gd/libgd/gd_interpolation.c 					src_offset_x[9] = n;
n                2017 ext/gd/libgd/gd_interpolation.c 				if ((m >= src_h-1) || (n >= src_w-1)) {
n                2021 ext/gd/libgd/gd_interpolation.c 					src_offset_x[10] = n + 1;
n                2025 ext/gd/libgd/gd_interpolation.c 				if ((m >= src_h-1) || (n >= src_w-2)) {
n                2029 ext/gd/libgd/gd_interpolation.c 					src_offset_x[11] = n + 1 + 1;
n                2033 ext/gd/libgd/gd_interpolation.c 				if ((m >= src_h-2) || (n < 1)) {
n                2037 ext/gd/libgd/gd_interpolation.c 					src_offset_x[12] = n - 1;
n                2045 ext/gd/libgd/gd_interpolation.c 					src_offset_x[13] = n;
n                2049 ext/gd/libgd/gd_interpolation.c 				if ((m >= src_h-2) || (n >= src_w - 1)) {
n                2053 ext/gd/libgd/gd_interpolation.c 					src_offset_x[14] = n + 1;
n                2057 ext/gd/libgd/gd_interpolation.c 				if ((m >= src_h-2) || (n >= src_w-2)) {
n                2061 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                  42 ext/gd/libgd/gd_webp.c 	size_t size = 0, n;
n                  62 ext/gd/libgd/gd_webp.c 		n = gdGetBuf(read, GD_WEBP_ALLOC_STEP, infile);
n                  63 ext/gd/libgd/gd_webp.c 		if (n>0 && n!=EOF) {
n                  64 ext/gd/libgd/gd_webp.c 			size += n;
n                  66 ext/gd/libgd/gd_webp.c 	} while (n>0 && n!=EOF);
n                 217 ext/gd/libgd/gdft.c 		int i, n = 0;
n                 233 ext/gd/libgd/gdft.c 					n = (n * 16) + byte;
n                 239 ext/gd/libgd/gdft.c 						n = (n * 10) + (byte - '0');
n                 246 ext/gd/libgd/gdft.c 				*chPtr = (Tcl_UniChar) n;
n                 368 ext/gd/libgd/gdft.c 	int n;
n                 478 ext/gd/libgd/gdft.c 	for (n = 0; n < a->face->num_charmaps; n++) {
n                 479 ext/gd/libgd/gdft.c 		charmap = a->face->charmaps[n];
n                 155 ext/hash/hash.c 		size_t n;
n                 157 ext/hash/hash.c 		while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n                 158 ext/hash/hash.c 			ops->hash_update(context, (unsigned char *) buf, n);
n                 278 ext/hash/hash.c 		int n;
n                 281 ext/hash/hash.c 		while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n                 282 ext/hash/hash.c 			ops->hash_update(context, (unsigned char *) buf, n);
n                 442 ext/hash/hash.c 		zend_long n, toread = 1024;
n                 448 ext/hash/hash.c 		if ((n = php_stream_read(stream, buf, toread)) <= 0) {
n                 452 ext/hash/hash.c 		hash->ops->hash_update(hash->context, (unsigned char *) buf, n);
n                 453 ext/hash/hash.c 		length -= n;
n                 454 ext/hash/hash.c 		didread += n;
n                 470 ext/hash/hash.c 	size_t filename_len, n;
n                 487 ext/hash/hash.c 	while ((n = php_stream_read(stream, buf, sizeof(buf))) > 0) {
n                 488 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                2776 ext/imap/php_imap.c #define B64(n)	("ABCDEFGHIJKLMNOPQRSTUVWXYZ" \
n                2777 ext/imap/php_imap.c 				"abcdefghijklmnopqrstuvwxyz0123456789+,"[(n) & 0x3f])
n                 207 ext/interbase/ibase_query.c 	unsigned short i, n;
n                 220 ext/interbase/ibase_query.c 	for (i = n = 0; i < sqlda->sqld; ++i) {
n                 226 ext/interbase/ibase_query.c 			ibase_array *a = &ar[n++];
n                 534 ext/interbase/ibase_query.c 				unsigned short n;
n                 586 ext/interbase/ibase_query.c 					n = sscanf(Z_STRVAL_P(val), "%d%*[/]%d%*[/]%d %d%*[:]%d%*[:]%d",
n                 589 ext/interbase/ibase_query.c 					if (n != 3 && n != 6) {
n                 591 ext/interbase/ibase_query.c 							" Use format 'm/d/Y H:i:s'. You gave '%s')", n, Z_STRVAL_P(val));
n                 604 ext/interbase/ibase_query.c 					n = sscanf(Z_STRVAL_P(val), "%d%*[/]%d%*[/]%d", &t.tm_mon, &t.tm_mday, &t.tm_year);
n                 606 ext/interbase/ibase_query.c 					if (n != 3) {
n                 608 ext/interbase/ibase_query.c 							"Use format 'm/d/Y' You gave '%s')", n, Z_STRVAL_P(val));
n                 621 ext/interbase/ibase_query.c 					n = sscanf(Z_STRVAL_P(val), "%d%*[:]%d%*[:]%d", &t.tm_hour, &t.tm_min, &t.tm_sec);
n                 623 ext/interbase/ibase_query.c 					if (n != 3) {
n                 625 ext/interbase/ibase_query.c 							"Use format 'H:i:s'. You gave '%s')", n, Z_STRVAL_P(val));
n                1318 ext/interbase/ibase_query.c 		zend_long n;
n                1331 ext/interbase/ibase_query.c 			n = *(short *) data;
n                1335 ext/interbase/ibase_query.c 			n = *(zend_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), ZEND_LONG_FMT ".%0*" ZEND_LONG_FMT_SPEC, 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), ZEND_LONG_FMT ".%0*" ZEND_LONG_FMT_SPEC, n / f, -scale,  -n % f);
n                1368 ext/interbase/ibase_query.c 					l = slprintf(string_data, sizeof(string_data), "-0.%0*" ZEND_LONG_FMT_SPEC, -scale, -n % f);
n                  71 ext/intl/breakiterator/codepointiterator_internal.h 		virtual int32_t next(int32_t n);
n                  37 ext/intl/grapheme/grapheme_util.h inline void *grapheme_memrchr_grapheme(const void *s, int c, int32_t n);
n                  35 ext/json/json_scanner.c #define	YYFILL(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                  82 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c mbfl_bisec_srch(int w, const unsigned short *tbl, int n)
n                  84 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k, k1 = 0, k2 = n-1;
n                 100 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c mbfl_bisec_srch2(int w, const unsigned short tbl[], int n)
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                  45 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c extern int mbfl_bisec_srch(int w, const unsigned short *tbl, int n);
n                  46 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c extern int mbfl_bisec_srch2(int w, const unsigned short tbl[], int n);
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                  43 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.c extern int mbfl_bisec_srch2(int w, const unsigned short tbl[], int n);
n                 248 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.c mbfilter_conv_map_tbl(int c, int *w, const unsigned short map[][3], int n)
n                 252 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.c 	for (i = 0; i < n; i++) {
n                 263 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.c mbfilter_conv_r_map_tbl(int c, int *w, const unsigned short map[][3], int n)
n                 267 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.c 	for (i = 0; i < n; i++) {
n                  67 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.h int mbfilter_conv_map_tbl(int c, int *w, const unsigned short map[][3], int n);
n                  68 ext/mbstring/libmbfl/filters/mbfilter_sjis_mobile.h int mbfilter_conv_r_map_tbl(int c, int *w, const unsigned short map[][3], int n);
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                 237 ext/mbstring/libmbfl/mbfl/mbfilter.c mbfl_buffer_converter_strncat(mbfl_buffer_converter *convd, const unsigned char *p, int n)
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                 135 ext/mbstring/libmbfl/mbfl/mbfilter.h MBFLAPI extern int mbfl_buffer_converter_strncat(mbfl_buffer_converter *convd, const unsigned char *p, int 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                 199 ext/mbstring/mb_gpc.c 	int n, num, *len_list = NULL;
n                 231 ext/mbstring/mb_gpc.c 	n = 0;
n                 237 ext/mbstring/mb_gpc.c 			len_list[n] = php_url_decode(var, val-var);
n                 238 ext/mbstring/mb_gpc.c 			val_list[n] = var;
n                 239 ext/mbstring/mb_gpc.c 			n++;
n                 242 ext/mbstring/mb_gpc.c 			val_list[n] = val;
n                 243 ext/mbstring/mb_gpc.c 			len_list[n] = php_url_decode(val, strlen(val));
n                 245 ext/mbstring/mb_gpc.c 			len_list[n] = php_url_decode(var, strlen(var));
n                 246 ext/mbstring/mb_gpc.c 			val_list[n] = var;
n                 247 ext/mbstring/mb_gpc.c 			n++;
n                 249 ext/mbstring/mb_gpc.c 			val_list[n] = "";
n                 250 ext/mbstring/mb_gpc.c 			len_list[n] = 0;
n                 252 ext/mbstring/mb_gpc.c 		n++;
n                 256 ext/mbstring/mb_gpc.c 	if (n > (PG(max_input_vars) * 2)) {
n                 261 ext/mbstring/mb_gpc.c 	num = n; /* make sure to process initialized vars only */
n                 273 ext/mbstring/mb_gpc.c 			n = 0;
n                 274 ext/mbstring/mb_gpc.c 			while (n < num) {
n                 275 ext/mbstring/mb_gpc.c 				string.val = (unsigned char *)val_list[n];
n                 276 ext/mbstring/mb_gpc.c 				string.len = len_list[n];
n                 280 ext/mbstring/mb_gpc.c 				n++;
n                 310 ext/mbstring/mb_gpc.c 	n = 0;
n                 311 ext/mbstring/mb_gpc.c 	while (n < num) {
n                 312 ext/mbstring/mb_gpc.c 		string.val = (unsigned char *)val_list[n];
n                 313 ext/mbstring/mb_gpc.c 		string.len = len_list[n];
n                 317 ext/mbstring/mb_gpc.c 			var = val_list[n];
n                 319 ext/mbstring/mb_gpc.c 		n++;
n                 320 ext/mbstring/mb_gpc.c 		string.val = (unsigned char *)val_list[n];
n                 321 ext/mbstring/mb_gpc.c 		string.len = len_list[n];
n                 326 ext/mbstring/mb_gpc.c 			val = val_list[n];
n                 327 ext/mbstring/mb_gpc.c 			val_len = len_list[n];
n                 329 ext/mbstring/mb_gpc.c 		n++;
n                 691 ext/mbstring/mbstring.c 	size_t n;
n                 717 ext/mbstring/mbstring.c 		n = 1;
n                 721 ext/mbstring/mbstring.c 			n++;
n                 723 ext/mbstring/mbstring.c 		size = n + MBSTRG(default_detect_order_list_size);
n                 728 ext/mbstring/mbstring.c 			n = 0;
n                 755 ext/mbstring/mbstring.c 							n++;
n                 762 ext/mbstring/mbstring.c 						n++;
n                 768 ext/mbstring/mbstring.c 			} while (n < size && p2 != NULL);
n                 769 ext/mbstring/mbstring.c 			if (n > 0) {
n                 783 ext/mbstring/mbstring.c 				*return_size = n;
n                 811 ext/mbstring/mbstring.c 	int i, n, size, bauto, ret = SUCCESS;
n                 823 ext/mbstring/mbstring.c 			n = 0;
n                 835 ext/mbstring/mbstring.c 							n++;
n                 842 ext/mbstring/mbstring.c 						n++;
n                 849 ext/mbstring/mbstring.c 			if (n > 0) {
n                 863 ext/mbstring/mbstring.c 				*return_size = n;
n                1833 ext/mbstring/mbstring.c 				const size_t n = MBSTRG(http_input_list_size);
n                1836 ext/mbstring/mbstring.c 				for (i = 0; i < n; i++) {
n                1847 ext/mbstring/mbstring.c 				const size_t n = MBSTRG(http_input_list_size);
n                1850 ext/mbstring/mbstring.c 				for (i = 0; i < n; i++) {
n                1931 ext/mbstring/mbstring.c 		size_t n = MBSTRG(current_detect_order_list_size);
n                1934 ext/mbstring/mbstring.c 		for (i = 0; i < n; i++) {
n                2222 ext/mbstring/mbstring.c 	int n;
n                2251 ext/mbstring/mbstring.c 	n = mbfl_strlen(&string);
n                2252 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2253 ext/mbstring/mbstring.c 		RETVAL_LONG(n);
n                2264 ext/mbstring/mbstring.c 	int n, reverse = 0;
n                2309 ext/mbstring/mbstring.c 	n = mbfl_strpos(&haystack, &needle, offset, reverse);
n                2310 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2311 ext/mbstring/mbstring.c 		RETVAL_LONG(n);
n                2313 ext/mbstring/mbstring.c 		switch (-n) {
n                2338 ext/mbstring/mbstring.c 	int n;
n                2434 ext/mbstring/mbstring.c 	n = mbfl_strpos(&haystack, &needle, offset, 1);
n                2435 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2436 ext/mbstring/mbstring.c 		RETVAL_LONG(n);
n                2447 ext/mbstring/mbstring.c 	int n = -1;
n                2472 ext/mbstring/mbstring.c 	n = php_mb_stripos(0, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, offset, from_encoding);
n                2474 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2475 ext/mbstring/mbstring.c 		RETVAL_LONG(n);
n                2486 ext/mbstring/mbstring.c 	int n = -1;
n                2507 ext/mbstring/mbstring.c 	n = php_mb_stripos(1, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, offset, from_encoding);
n                2509 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2510 ext/mbstring/mbstring.c 		RETVAL_LONG(n);
n                2521 ext/mbstring/mbstring.c 	int n, len, mblen;
n                2561 ext/mbstring/mbstring.c 	n = mbfl_strpos(&haystack, &needle, 0, 0);
n                2562 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2565 ext/mbstring/mbstring.c 			ret = mbfl_substr(&haystack, &result, 0, n);
n                2574 ext/mbstring/mbstring.c 			len = (mblen - n);
n                2575 ext/mbstring/mbstring.c 			ret = mbfl_substr(&haystack, &result, n, len);
n                2594 ext/mbstring/mbstring.c 	int n, len, mblen;
n                2636 ext/mbstring/mbstring.c 	n = mbfl_strpos(&haystack, &needle, 0, 1);
n                2637 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2640 ext/mbstring/mbstring.c 			ret = mbfl_substr(&haystack, &result, 0, n);
n                2649 ext/mbstring/mbstring.c 			len = (mblen - n);
n                2650 ext/mbstring/mbstring.c 			ret = mbfl_substr(&haystack, &result, n, len);
n                2671 ext/mbstring/mbstring.c 	int n;
n                2708 ext/mbstring/mbstring.c 	n = php_mb_stripos(0, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, 0, from_encoding);
n                2710 ext/mbstring/mbstring.c 	if (n <0) {
n                2717 ext/mbstring/mbstring.c 		ret = mbfl_substr(&haystack, &result, 0, n);
n                2726 ext/mbstring/mbstring.c 		len = (mblen - n);
n                2727 ext/mbstring/mbstring.c 		ret = mbfl_substr(&haystack, &result, n, len);
n                2744 ext/mbstring/mbstring.c 	int n, len, mblen;
n                2777 ext/mbstring/mbstring.c 	n = php_mb_stripos(1, (char *)haystack.val, haystack.len, (char *)needle.val, needle.len, 0, from_encoding);
n                2779 ext/mbstring/mbstring.c 	if (n <0) {
n                2786 ext/mbstring/mbstring.c 		ret = mbfl_substr(&haystack, &result, 0, n);
n                2795 ext/mbstring/mbstring.c 		len = (mblen - n);
n                2796 ext/mbstring/mbstring.c 		ret = mbfl_substr(&haystack, &result, n, len);
n                2812 ext/mbstring/mbstring.c 	int n;
n                2852 ext/mbstring/mbstring.c 	n = mbfl_substr_count(&haystack, &needle);
n                2853 ext/mbstring/mbstring.c 	if (n >= 0) {
n                2854 ext/mbstring/mbstring.c 		RETVAL_LONG(n);
n                3013 ext/mbstring/mbstring.c 	int n;
n                3042 ext/mbstring/mbstring.c 	n = mbfl_strwidth(&string);
n                3043 ext/mbstring/mbstring.c 	if (n >= 0) {
n                3044 ext/mbstring/mbstring.c 		RETVAL_LONG(n);
n                3204 ext/mbstring/mbstring.c 	size_t size, l, n;
n                3226 ext/mbstring/mbstring.c 						n = strlen(Z_STRVAL_P(hash_entry));
n                3227 ext/mbstring/mbstring.c 						_from_encodings = erealloc(_from_encodings, l+n+2);
n                3596 ext/mbstring/mbstring.c 		int n = optstr_len;
n                3599 ext/mbstring/mbstring.c 		while (i < n) {
n                3691 ext/mbstring/mbstring.c 	int n, argc, stack_level, stack_max;
n                3741 ext/mbstring/mbstring.c 			n = 0;
n                3742 ext/mbstring/mbstring.c 			while (n < argc || stack_level > 0) {
n                3744 ext/mbstring/mbstring.c 					var = &args[n++];
n                3828 ext/mbstring/mbstring.c 		n = 0;
n                3829 ext/mbstring/mbstring.c 		while (n < argc || stack_level > 0) {
n                3831 ext/mbstring/mbstring.c 				var = &args[n++];
n                4185 ext/mbstring/mbstring.c 	int n;
n                4397 ext/mbstring/mbstring.c 		n = headers_len;
n                4398 ext/mbstring/mbstring.c 		mbfl_memory_device_strncat(&device, p, n);
n                4399 ext/mbstring/mbstring.c 		if (n > 0 && p[n - 1] != '\n') {
n                4476 ext/mbstring/mbstring.c 	size_t n;
n                4535 ext/mbstring/mbstring.c 		n = MBSTRG(current_detect_order_list_size);
n                4537 ext/mbstring/mbstring.c 		if (n > 0) {
n                4540 ext/mbstring/mbstring.c 			for (i = 0; i < n; i++) {
n                4616 ext/mbstring/mbstring.c 		n = MBSTRG(current_detect_order_list_size);
n                4618 ext/mbstring/mbstring.c 		if (n > 0) {
n                4621 ext/mbstring/mbstring.c 			for (i = 0; i < n; i++) {
n                4817 ext/mbstring/mbstring.c 	int n;
n                4819 ext/mbstring/mbstring.c 	n = -1;
n                4875 ext/mbstring/mbstring.c 		n = mbfl_strpos(&haystack, &needle, offset, mode);
n                4886 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                11006 ext/mbstring/oniguruma/enc/unicode.c     if (to->n == 1) {
n                11016 ext/mbstring/oniguruma/enc/unicode.c       for (i = 0; i < to->n; i++) {
n                11044 ext/mbstring/oniguruma/enc/unicode.c     for (j = 0; j < p11->to.n; j++) {
n                11085 ext/mbstring/oniguruma/enc/unicode.c       for (j = 0; j < p11->to.n; j++) {
n                11112 ext/mbstring/oniguruma/enc/unicode.c       for (j = 0; j < CaseUnfold_12[i].to.n; j++) {
n                11117 ext/mbstring/oniguruma/enc/unicode.c 	for (k = 0; k < CaseUnfold_12[i].to.n; k++) {
n                11133 ext/mbstring/oniguruma/enc/unicode.c 	for (j = 0; j < CaseUnfold_12_Locale[i].to.n; j++) {
n                11138 ext/mbstring/oniguruma/enc/unicode.c 	  for (k = 0; k < CaseUnfold_12_Locale[i].to.n; k++) {
n                11154 ext/mbstring/oniguruma/enc/unicode.c       for (j = 0; j < CaseUnfold_13[i].to.n; j++) {
n                11159 ext/mbstring/oniguruma/enc/unicode.c 	for (k = 0; k < CaseUnfold_13[i].to.n; k++) {
n                11178 ext/mbstring/oniguruma/enc/unicode.c   int n, i, j, k, len;
n                11185 ext/mbstring/oniguruma/enc/unicode.c   n = 0;
n                11220 ext/mbstring/oniguruma/enc/unicode.c     if (to->n == 1) {
n                11226 ext/mbstring/oniguruma/enc/unicode.c       n++;
n                11230 ext/mbstring/oniguruma/enc/unicode.c 	for (i = 0; i < to->n; i++) {
n                11232 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].byte_len = len;
n                11233 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code_len = 1;
n                11234 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[0]  = to->code[i];
n                11235 ext/mbstring/oniguruma/enc/unicode.c 	    n++;
n                11244 ext/mbstring/oniguruma/enc/unicode.c       for (fn = 0; fn < to->n; fn++) {
n                11248 ext/mbstring/oniguruma/enc/unicode.c 	  for (i = 0; i < z3->n; i++) {
n                11251 ext/mbstring/oniguruma/enc/unicode.c 	  ncs[fn] = z3->n + 1;
n                11260 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].byte_len = len;
n                11261 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code_len = 2;
n                11262 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[0]  = cs[0][i];
n                11263 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[1]  = cs[1][j];
n                11264 ext/mbstring/oniguruma/enc/unicode.c 	    n++;
n                11270 ext/mbstring/oniguruma/enc/unicode.c 	  for (i = 0; i < z2->n; i++) {
n                11273 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].byte_len = len;
n                11274 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code_len = 1;
n                11275 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[0]  = z2->code[i];
n                11276 ext/mbstring/oniguruma/enc/unicode.c 	    n++;
n                11284 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].byte_len = len;
n                11285 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code_len = 3;
n                11286 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code[0]  = cs[0][i];
n                11287 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code[1]  = cs[1][j];
n                11288 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code[2]  = cs[2][k];
n                11289 ext/mbstring/oniguruma/enc/unicode.c 	      n++;
n                11296 ext/mbstring/oniguruma/enc/unicode.c 	  for (i = 0; i < z2->n; i++) {
n                11299 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].byte_len = len;
n                11300 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code_len = 1;
n                11301 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[0]  = z2->code[i];
n                11302 ext/mbstring/oniguruma/enc/unicode.c 	    n++;
n                11313 ext/mbstring/oniguruma/enc/unicode.c       for (i = 0; i < to->n; i++) {
n                11314 ext/mbstring/oniguruma/enc/unicode.c 	items[n].byte_len = len;
n                11315 ext/mbstring/oniguruma/enc/unicode.c 	items[n].code_len = 1;
n                11316 ext/mbstring/oniguruma/enc/unicode.c 	items[n].code[0]  = to->code[i];
n                11317 ext/mbstring/oniguruma/enc/unicode.c 	n++;
n                11331 ext/mbstring/oniguruma/enc/unicode.c 	  && to->n == 1) {
n                11340 ext/mbstring/oniguruma/enc/unicode.c 	for (i = 0; i < z2->n; i++) {
n                11341 ext/mbstring/oniguruma/enc/unicode.c 	  items[n].byte_len = len;
n                11342 ext/mbstring/oniguruma/enc/unicode.c 	  items[n].code_len = 1;
n                11343 ext/mbstring/oniguruma/enc/unicode.c 	  items[n].code[0]  = z2->code[i];
n                11344 ext/mbstring/oniguruma/enc/unicode.c 	  n++;
n                11352 ext/mbstring/oniguruma/enc/unicode.c 	    && to->n == 1) {
n                11362 ext/mbstring/oniguruma/enc/unicode.c 	  for (i = 0; i < z2->n; i++) {
n                11363 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].byte_len = len;
n                11364 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code_len = 1;
n                11365 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[0]  = z2->code[i];
n                11366 ext/mbstring/oniguruma/enc/unicode.c 	    n++;
n                11373 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                 285 ext/mbstring/oniguruma/oniguruma.h #define ONIGENC_STEP_BACK(enc,start,s,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                 407 ext/mbstring/oniguruma/regcomp.c compile_tree_n_times(Node* node, int n, regex_t* reg)
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                3369 ext/mbstring/oniguruma/regcomp.c   int r, n, len, alt_num;
n                3386 ext/mbstring/oniguruma/regcomp.c     n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(reg->enc, reg->case_fold_flag,
n                3388 ext/mbstring/oniguruma/regcomp.c     if (n < 0) {
n                3389 ext/mbstring/oniguruma/regcomp.c       r = n;
n                3395 ext/mbstring/oniguruma/regcomp.c     if (n == 0) {
n                3419 ext/mbstring/oniguruma/regcomp.c       alt_num *= (n + 1);
n                3430 ext/mbstring/oniguruma/regcomp.c       r = expand_case_fold_string_alt(n, items, p, len, end, reg, &prev_node);
n                3771 ext/mbstring/oniguruma/regcomp.c 	    int i, n = qn->lower;
n                3773 ext/mbstring/oniguruma/regcomp.c 	    for (i = 0; i < n; i++) {
n                4363 ext/mbstring/oniguruma/regcomp.c   int i, n;
n                4368 ext/mbstring/oniguruma/regcomp.c   n = ONIGENC_GET_CASE_FOLD_CODES_BY_STR(enc, case_fold_flag, p, end, items);
n                4369 ext/mbstring/oniguruma/regcomp.c   if (n < 0) return n;
n                4371 ext/mbstring/oniguruma/regcomp.c   for (i = 0; i < n; i++) {
n                4598 ext/mbstring/oniguruma/regcomp.c           int n = onigenc_strlen(env->enc, sn->s, sn->end);
n                4599 ext/mbstring/oniguruma/regcomp.c           max = ONIGENC_MBC_MAXLEN_DIST(env->enc) * n;
n                5153 ext/mbstring/oniguruma/regcomp.c     int c, i, n = 0;
n                5156 ext/mbstring/oniguruma/regcomp.c       if (reg->map[i]) n++;
n                5158 ext/mbstring/oniguruma/regcomp.c     fprintf(f, "map: n=%d\n", n);
n                5159 ext/mbstring/oniguruma/regcomp.c     if (n > 0) {
n                5638 ext/mbstring/oniguruma/regcomp.c   OnigCodePoint n, *data;
n                5641 ext/mbstring/oniguruma/regcomp.c   GET_CODE_POINT(n, p);
n                5645 ext/mbstring/oniguruma/regcomp.c   for (low = 0, high = n; low < high; ) {
n                5653 ext/mbstring/oniguruma/regcomp.c   return ((low < n && code >= data[low * 2]) ? 1 : 0);
n                5850 ext/mbstring/oniguruma/regcomp.c   int i, n, arg_type;
n                5940 ext/mbstring/oniguruma/regcomp.c 	n = len * mb_len;
n                5941 ext/mbstring/oniguruma/regcomp.c 	while (n-- > 0) { fputc(*bp++, f); }
n                5957 ext/mbstring/oniguruma/regcomp.c       n = bitset_on_num((BitSetRef )bp);
n                5959 ext/mbstring/oniguruma/regcomp.c       fprintf(f, ":%d", n);
n                5963 ext/mbstring/oniguruma/regcomp.c       n = bitset_on_num((BitSetRef )bp);
n                5965 ext/mbstring/oniguruma/regcomp.c       fprintf(f, ":%d", n);
n                5982 ext/mbstring/oniguruma/regcomp.c       n = bitset_on_num((BitSetRef )bp);
n                5991 ext/mbstring/oniguruma/regcomp.c       fprintf(f, ":%d:%d:%d", n, (int )code, len);
n                5999 ext/mbstring/oniguruma/regcomp.c         n = bitset_on_num(cc->bs);
n                6000 ext/mbstring/oniguruma/regcomp.c         fprintf(f, ":%u:%d", (unsigned int )cc, n);
n                  89 ext/mbstring/oniguruma/regenc.c onigenc_step_back(OnigEncoding enc, const UChar* start, const UChar* s, int n)
n                  91 ext/mbstring/oniguruma/regenc.c   while (ONIG_IS_NOT_NULL(s) && n-- > 0) {
n                 101 ext/mbstring/oniguruma/regenc.c onigenc_step(OnigEncoding enc, const UChar* p, const UChar* end, int n)
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                 823 ext/mbstring/oniguruma/regenc.c                            const UChar* sascii /* ascii */, int n)
n                 827 ext/mbstring/oniguruma/regenc.c   while (n-- > 0) {
n                 167 ext/mbstring/oniguruma/regenc.h onigenc_with_ascii_strncmp P_((OnigEncoding enc, const UChar* p, const UChar* end, const UChar* sascii /* ascii */, int n));
n                 169 ext/mbstring/oniguruma/regenc.h onigenc_step P_((OnigEncoding enc, const UChar* p, const UChar* end, int n));
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                 172 ext/mbstring/oniguruma/regexec.c onig_region_resize(OnigRegion* region, int 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                 202 ext/mbstring/oniguruma/regexec.c onig_region_resize_clear(OnigRegion* region, int 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                 468 ext/mbstring/oniguruma/regexec.c #define STACK_ENSURE(n)	do {\
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                 268 ext/mbstring/oniguruma/regint.h #define BIT_STATUS_AT(stats,n) \
n                 269 ext/mbstring/oniguruma/regint.h   ((n) < (int )BIT_STATUS_BITS_NUM  ?  ((stats) & (1 << n)) : ((stats) & 1))
n                 271 ext/mbstring/oniguruma/regint.h #define BIT_STATUS_ON_AT(stats,n) do {\
n                 272 ext/mbstring/oniguruma/regint.h     if ((n) < (int )BIT_STATUS_BITS_NUM)	\
n                 273 ext/mbstring/oniguruma/regint.h     (stats) |= (1 << (n));\
n                 278 ext/mbstring/oniguruma/regint.h #define BIT_STATUS_ON_AT_SIMPLE(stats,n) do {\
n                 279 ext/mbstring/oniguruma/regint.h     if ((n) < (int )BIT_STATUS_BITS_NUM)\
n                 280 ext/mbstring/oniguruma/regint.h     (stats) |= (1 << (n));\
n                 315 ext/mbstring/oniguruma/regint.h #define IS_REPEAT_INFINITE(n)   ((n) == REPEAT_INFINITE)
n                 377 ext/mbstring/oniguruma/regint.h #define BBUF_WRITE(buf,pos,bytes,n) do{\
n                 378 ext/mbstring/oniguruma/regint.h   int used = (pos) + (n);\
n                 380 ext/mbstring/oniguruma/regint.h   xmemcpy((buf)->p + (pos), (bytes), (n));\
n                 391 ext/mbstring/oniguruma/regint.h #define BBUF_ADD(buf,bytes,n)       BBUF_WRITE((buf),(buf)->used,(bytes),(n))
n                 397 ext/mbstring/oniguruma/regint.h #define BBUF_MOVE_RIGHT(buf,from,to,n) do {\
n                 398 ext/mbstring/oniguruma/regint.h   if ((unsigned int )((to)+(n)) > (buf)->alloc) BBUF_EXPAND((buf),(to) + (n));\
n                 399 ext/mbstring/oniguruma/regint.h   xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
n                 400 ext/mbstring/oniguruma/regint.h   if ((unsigned int )((to)+(n)) > (buf)->used) (buf)->used = (to) + (n);\
n                 404 ext/mbstring/oniguruma/regint.h #define BBUF_MOVE_LEFT(buf,from,to,n) do {\
n                 405 ext/mbstring/oniguruma/regint.h   xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
n                 414 ext/mbstring/oniguruma/regint.h #define BBUF_INSERT(buf,pos,bytes,n) do {\
n                 416 ext/mbstring/oniguruma/regint.h     BBUF_WRITE(buf,pos,bytes,n);\
n                 419 ext/mbstring/oniguruma/regint.h     BBUF_MOVE_RIGHT((buf),(pos),(pos) + (n),((buf)->used - (pos)));\
n                 420 ext/mbstring/oniguruma/regint.h     xmemcpy((buf)->p + (pos), (bytes), (n));\
n                 207 ext/mbstring/oniguruma/regparse.c onig_strncmp(const UChar* s1, const UChar* s2, int n)
n                 211 ext/mbstring/oniguruma/regparse.c   while (n-- > 0) {
n                 853 ext/mbstring/oniguruma/regparse.c   int i, n, *nums;
n                 855 ext/mbstring/oniguruma/regparse.c   n = onig_name_to_group_numbers(reg, name, name_end, &nums);
n                 856 ext/mbstring/oniguruma/regparse.c   if (n < 0)
n                 857 ext/mbstring/oniguruma/regparse.c     return n;
n                 858 ext/mbstring/oniguruma/regparse.c   else if (n == 0)
n                 860 ext/mbstring/oniguruma/regparse.c   else if (n == 1)
n                 864 ext/mbstring/oniguruma/regparse.c       for (i = n - 1; i >= 0; i--) {
n                 869 ext/mbstring/oniguruma/regparse.c     return nums[n - 1];
n                1027 ext/mbstring/oniguruma/regparse.c 	FreeNode* n = (FreeNode* )node;
n                1030 ext/mbstring/oniguruma/regparse.c 	n->next = FreeNodeList;
n                1031 ext/mbstring/oniguruma/regparse.c 	FreeNodeList = n;
n                1075 ext/mbstring/oniguruma/regparse.c     FreeNode* n = (FreeNode* )node;
n                1078 ext/mbstring/oniguruma/regparse.c     n->next = FreeNodeList;
n                1079 ext/mbstring/oniguruma/regparse.c     FreeNodeList = n;
n                1091 ext/mbstring/oniguruma/regparse.c   FreeNode* n;
n                1095 ext/mbstring/oniguruma/regparse.c     n = FreeNodeList;
n                1097 ext/mbstring/oniguruma/regparse.c     xfree(n);
n                1150 ext/mbstring/oniguruma/regparse.c   int n, i;
n                1162 ext/mbstring/oniguruma/regparse.c     n = ONIGENC_CODE_RANGE_NUM(ranges);
n                1163 ext/mbstring/oniguruma/regparse.c     for (i = 0; i < n; i++) {
n                1181 ext/mbstring/oniguruma/regparse.c     n = ONIGENC_CODE_RANGE_NUM(ranges);
n                1182 ext/mbstring/oniguruma/regparse.c     if (n == 0) goto is_null;
n                1186 ext/mbstring/oniguruma/regparse.c     bbuf->alloc = n + 1;
n                1187 ext/mbstring/oniguruma/regparse.c     bbuf->used  = n + 1;
n                1239 ext/mbstring/oniguruma/regparse.c   Node *n;
n                1241 ext/mbstring/oniguruma/regparse.c   n = onig_node_new_list(x, NULL);
n                1242 ext/mbstring/oniguruma/regparse.c   if (IS_NULL(n)) return NULL_NODE;
n                1248 ext/mbstring/oniguruma/regparse.c     NCDR(list) = n;
n                1251 ext/mbstring/oniguruma/regparse.c   return n;
n                1546 ext/mbstring/oniguruma/regparse.c   Node* n = NULL_NODE;
n                1551 ext/mbstring/oniguruma/regparse.c       n = node_new_str(p, sn->end);
n                1553 ext/mbstring/oniguruma/regparse.c 	NSTRING_SET_RAW(n);
n                1557 ext/mbstring/oniguruma/regparse.c   return n;
n                1683 ext/mbstring/oniguruma/regparse.c   OnigCodePoint n;
n                1691 ext/mbstring/oniguruma/regparse.c   n = 0;
n                1692 ext/mbstring/oniguruma/regparse.c   BBUF_WRITE_CODE_POINT(bbuf, 0, n);
n                1701 ext/mbstring/oniguruma/regparse.c   OnigCodePoint n, *data;
n                1705 ext/mbstring/oniguruma/regparse.c     n = from; from = to; to = n;
n                1712 ext/mbstring/oniguruma/regparse.c     n = 0;
n                1716 ext/mbstring/oniguruma/regparse.c     GET_CODE_POINT(n, bbuf->p);
n                1721 ext/mbstring/oniguruma/regparse.c   for (low = 0, bound = n; low < bound; ) {
n                1729 ext/mbstring/oniguruma/regparse.c   for (high = low, bound = n; high < bound; ) {
n                1738 ext/mbstring/oniguruma/regparse.c   if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM)
n                1748 ext/mbstring/oniguruma/regparse.c   if (inc_n != 0 && (OnigCodePoint )high < n) {
n                1751 ext/mbstring/oniguruma/regparse.c     int size = (n - high) * 2 * SIZE_CODE_POINT;
n                1765 ext/mbstring/oniguruma/regparse.c   n += inc_n;
n                1766 ext/mbstring/oniguruma/regparse.c   BBUF_WRITE_CODE_POINT(bbuf, 0, n);
n                1787 ext/mbstring/oniguruma/regparse.c   int r, i, n;
n                1797 ext/mbstring/oniguruma/regparse.c   GET_CODE_POINT(n, data);
n                1799 ext/mbstring/oniguruma/regparse.c   if (n <= 0) goto set_all;
n                1803 ext/mbstring/oniguruma/regparse.c   for (i = 0; i < n; i++) {
n                1885 ext/mbstring/oniguruma/regparse.c 	        OnigCodePoint* data, int n)
n                1890 ext/mbstring/oniguruma/regparse.c   for (i = 0; i < n; i++) {
n                2841 ext/mbstring/oniguruma/regparse.c find_str_position(OnigCodePoint s[], int n, UChar* from, UChar* to,
n                2853 ext/mbstring/oniguruma/regparse.c       for (i = 1; i < n && q < to; i++) {
n                2858 ext/mbstring/oniguruma/regparse.c       if (i >= n) {
n                2870 ext/mbstring/oniguruma/regparse.c str_exist_check_with_esc(OnigCodePoint s[], int n, UChar* from, UChar* to,
n                2888 ext/mbstring/oniguruma/regparse.c 	for (i = 1; i < n && q < to; i++) {
n                2893 ext/mbstring/oniguruma/regparse.c 	if (i >= n) return 1;
n                3763 ext/mbstring/oniguruma/regparse.c   int n = ONIGENC_CODE_RANGE_NUM(mbr);
n                3766 ext/mbstring/oniguruma/regparse.c     for (i = 0; i < n; i++) {
n                3785 ext/mbstring/oniguruma/regparse.c     for ( ; i < n; i++) {
n                3795 ext/mbstring/oniguruma/regparse.c     for (i = 0; i < n; i++) {
n                3812 ext/mbstring/oniguruma/regparse.c     for (i = 0; i < n; i++) {
n                4771 ext/mbstring/oniguruma/regparse.c 	Node* n = str_node_split_last_char(sn, env->enc);
n                4772 ext/mbstring/oniguruma/regparse.c 	if (IS_NOT_NULL(n)) {
n                4773 ext/mbstring/oniguruma/regparse.c 	  qn->target = n;
n                 324 ext/mbstring/oniguruma/regparse.h extern int    onig_strncmp P_((const UChar* s1, const UChar* s2, int n));
n                  55 ext/mbstring/oniguruma/st.c #define Calloc(n,s) (char*)xcalloc((n),(s))
n                 574 ext/mbstring/oniguruma/st.c numhash(n)
n                 575 ext/mbstring/oniguruma/st.c     long n;
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                 580 ext/mbstring/php_mbregex.c 	int n;
n                 587 ext/mbstring/php_mbregex.c 		n = 0;
n                 588 ext/mbstring/php_mbregex.c 		while(n < narg) {
n                 589 ext/mbstring/php_mbregex.c 			c = parg[n++];
n                 806 ext/mbstring/php_mbregex.c 	int i, err, eval, n;
n                 917 ext/mbstring/php_mbregex.c 					n = -1;
n                 920 ext/mbstring/php_mbregex.c 						n = p[1] - '0';
n                 922 ext/mbstring/php_mbregex.c 					if (n >= 0 && n < regs->num_regs) {
n                 923 ext/mbstring/php_mbregex.c 						if (regs->beg[n] >= 0 && regs->beg[n] < regs->end[n] && regs->end[n] <= string_len) {
n                 924 ext/mbstring/php_mbregex.c 							smart_str_appendl(pbuf, string + regs->beg[n], regs->end[n] - regs->beg[n]);
n                 987 ext/mbstring/php_mbregex.c 			n = regs->end[0];
n                 988 ext/mbstring/php_mbregex.c 			if ((pos - (OnigUChar *)string) < n) {
n                 989 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);
n                1182 ext/mbstring/php_mbregex.c 	int n, i, err, pos, len, beg, end;
n                1251 ext/mbstring/php_mbregex.c 			n = MBREX(search_regs)->num_regs;
n                1252 ext/mbstring/php_mbregex.c 			for (i = 0; i < n; i++) {
n                1361 ext/mbstring/php_mbregex.c 	int n, i, len, beg, end;
n                1369 ext/mbstring/php_mbregex.c 		n = MBREX(search_regs)->num_regs;
n                1370 ext/mbstring/php_mbregex.c 		for (i = 0; i < n; i++) {
n                  62 ext/mbstring/php_unicode.c static int prop_lookup(unsigned long code, unsigned long n)
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                1346 ext/mcrypt/mcrypt.c 	int n = 0;
n                1368 ext/mcrypt/mcrypt.c 		n = (int)size;
n                1383 ext/mcrypt/mcrypt.c 			n = read(*fd, iv + read_bytes, size - read_bytes);
n                1384 ext/mcrypt/mcrypt.c 			if (n <= 0) {
n                1387 ext/mcrypt/mcrypt.c 			read_bytes += n;
n                1389 ext/mcrypt/mcrypt.c 		n = read_bytes;
n                1391 ext/mcrypt/mcrypt.c 		if (n < size) {
n                1398 ext/mcrypt/mcrypt.c 		n = (int)size;
n                1403 ext/mcrypt/mcrypt.c 	RETVAL_STRINGL(iv, n);
n                  63 ext/mcrypt/mcrypt_filter.c 			int chunklen = (int)(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);
n                  41 ext/mysqli/mysqli_warning.c 	MYSQLI_WARNING *n;
n                  44 ext/mysqli/mysqli_warning.c 		n = w;
n                  48 ext/mysqli/mysqli_warning.c 		efree(n);
n                 233 ext/mysqlnd/mysqlnd.h #define mysqlnd_stmt_bind_one_param(stmt,n,z,t)		(stmt)->m->bind_one_parameter((stmt), (n), (z), (t))
n                 338 ext/mysqlnd/mysqlnd_enum_n_def.h #define IS_PRI_KEY(n)	((n) & PRI_KEY_FLAG)
n                 339 ext/mysqlnd/mysqlnd_enum_n_def.h #define IS_NOT_NULL(n)	((n) & NOT_NULL_FLAG)
n                 340 ext/mysqlnd/mysqlnd_enum_n_def.h #define IS_BLOB(n)		((n) & BLOB_FLAG)
n                  50 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))
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                  66 ext/opcache/Optimizer/compact_literals.c #define LITERAL_INFO(n, kind, merge, slots, related) do { \
n                  67 ext/opcache/Optimizer/compact_literals.c 		info[n].flags = (((merge) ? LITERAL_MAY_MERGE : 0) | LITERAL_FLAGS(kind, slots, related)); \
n                  70 ext/opcache/Optimizer/compact_literals.c #define LITERAL_INFO_CLASS(n, kind, merge, slots, related, _num) do { \
n                  71 ext/opcache/Optimizer/compact_literals.c 		info[n].flags = (LITERAL_EX_CLASS | ((merge) ? LITERAL_MAY_MERGE : 0) | LITERAL_FLAGS(kind, slots, related)); \
n                  72 ext/opcache/Optimizer/compact_literals.c 		info[n].u.num = (_num); \
n                  75 ext/opcache/Optimizer/compact_literals.c #define LITERAL_INFO_OBJ(n, kind, merge, slots, related, _num) do { \
n                  76 ext/opcache/Optimizer/compact_literals.c 		info[n].flags = (LITERAL_EX_OBJ | ((merge) ? LITERAL_MAY_MERGE : 0) | LITERAL_FLAGS(kind, slots, related)); \
n                  77 ext/opcache/Optimizer/compact_literals.c 		info[n].u.num = (_num); \
n                 120 ext/opcache/Optimizer/compact_literals.c 	int i, j, n, *map, cache_size;
n                 452 ext/opcache/Optimizer/compact_literals.c 						n = LITERAL_NUM_RELATED(info[i].flags);
n                 453 ext/opcache/Optimizer/compact_literals.c 						while (n > 1) {
n                 456 ext/opcache/Optimizer/compact_literals.c 							n--;
n                 474 ext/opcache/Optimizer/compact_literals.c 						n = LITERAL_NUM_RELATED(info[i].flags);
n                 475 ext/opcache/Optimizer/compact_literals.c 						while (n > 1) {
n                 479 ext/opcache/Optimizer/compact_literals.c 							n--;
n                 415 ext/opcache/Optimizer/zend_optimizer.c 					zend_op *m, *n;
n                 434 ext/opcache/Optimizer/zend_optimizer.c 					n = op_array->opcodes + op_array->brk_cont_array[brk].brk + 1;
n                 435 ext/opcache/Optimizer/zend_optimizer.c 					while (m < n) {
n                1356 ext/opcache/ZendAccelerator.c 	int n = 1;
n                1361 ext/opcache/ZendAccelerator.c 			mask |= n;
n                1363 ext/opcache/ZendAccelerator.c 		n += n;
n                1379 ext/opcache/ZendAccelerator.c 	int n = 1;
n                1382 ext/opcache/ZendAccelerator.c 		if ((mask & n) && !(ZCG(auto_globals_mask) & n)) {
n                1383 ext/opcache/ZendAccelerator.c 			ZCG(auto_globals_mask) |= n;
n                1386 ext/opcache/ZendAccelerator.c 		n += n;
n                1818 ext/openssl/openssl.c 	unsigned int n;
n                1824 ext/openssl/openssl.c 	} else if (!X509_digest(peer, mdtype, md, &n)) {
n                1830 ext/openssl/openssl.c 		ret = zend_string_init((char*)md, n, 0);
n                1832 ext/openssl/openssl.c 		ret = zend_string_alloc(n * 2, 0);
n                1833 ext/openssl/openssl.c 		make_digest_ex(ZSTR_VAL(ret), md, n);
n                1834 ext/openssl/openssl.c 		ZSTR_VAL(ret)[n * 2] = '\0';
n                3588 ext/openssl/openssl.c 					OPENSSL_PKEY_SET_BN(Z_ARRVAL_P(data), rsa, n);
n                3596 ext/openssl/openssl.c 					if (rsa->n && rsa->d) {
n                3920 ext/openssl/openssl.c 				OPENSSL_PKEY_GET_BN(rsa, n);
n                1771 ext/openssl/xp_ssl.c 	int n;
n                1813 ext/openssl/xp_ssl.c 				n = SSL_connect(sslsock->ssl_handle);
n                1815 ext/openssl/xp_ssl.c 				n = SSL_accept(sslsock->ssl_handle);
n                1828 ext/openssl/xp_ssl.c 			if (n <= 0) {
n                1830 ext/openssl/xp_ssl.c 				retry = handle_ssl_error(stream, n, blocked);
n                1834 ext/openssl/xp_ssl.c 					int err = SSL_get_error(sslsock->ssl_handle, n);
n                1852 ext/openssl/xp_ssl.c 		if (n == 1) {
n                1860 ext/openssl/xp_ssl.c 				n = -1;
n                1883 ext/openssl/xp_ssl.c 			n = 0;
n                1885 ext/openssl/xp_ssl.c 			n = -1;
n                1893 ext/openssl/xp_ssl.c 		if (n && peer_cert && cert_captured == 0) {
n                1897 ext/openssl/xp_ssl.c 		return n;
n                2122 ext/openssl/xp_ssl.c 	int n;
n                2155 ext/openssl/xp_ssl.c 				n = php_pollfd_for_ms(sslsock->s.socket, POLLOUT, 500);
n                2156 ext/openssl/xp_ssl.c 			} while (n == -1 && php_socket_errno() == EINTR);
n                2346 ext/openssl/xp_ssl.c 						int n;
n                2349 ext/openssl/xp_ssl.c 							n = SSL_peek(sslsock->ssl_handle, &buf, sizeof(buf));
n                2350 ext/openssl/xp_ssl.c 							if (n <= 0) {
n                2351 ext/openssl/xp_ssl.c 								int err = SSL_get_error(sslsock->ssl_handle, n);
n                 892 ext/pcre/pcrelib/pcre_compile.c find_error_text(int n)
n                 895 ext/pcre/pcrelib/pcre_compile.c for (; n > 0; n--)
n                2105 ext/pcre/pcrelib/pcre_compile.c     int n = (int)GET2(code, 1+LINK_SIZE);
n                2106 ext/pcre/pcrelib/pcre_compile.c     if (n == number) return (pcre_uchar *)code;
n                3375 ext/pcre/pcrelib/pcre_compile.c         int n;
n                3391 ext/pcre/pcrelib/pcre_compile.c         n = propposstab[base_list[2]][list[2]];
n                3392 ext/pcre/pcrelib/pcre_compile.c         switch(n)
n                3429 ext/pcre/pcrelib/pcre_compile.c           p = posspropstab[n-6];
n                3439 ext/pcre/pcrelib/pcre_compile.c           p = posspropstab[n-9];
n                3449 ext/pcre/pcrelib/pcre_compile.c           p = posspropstab[n-12];
n                3459 ext/pcre/pcrelib/pcre_compile.c           p = posspropstab[n-15];
n                4369 ext/pcre/pcrelib/pcre_compile.c   int n = 0;
n                4372 ext/pcre/pcrelib/pcre_compile.c     while(p[n+1] == p[0] + n + 1) n++;
n                4373 ext/pcre/pcrelib/pcre_compile.c     n8 += add_to_class(classbits, uchardptr, options, cd, p[0], p[n]);
n                4375 ext/pcre/pcrelib/pcre_compile.c   p += n + 1;
n                7038 ext/pcre/pcrelib/pcre_compile.c           int n = 0;
n                7041 ext/pcre/pcrelib/pcre_compile.c             n = n * 10 + *ptr++ - CHAR_0;
n                7047 ext/pcre/pcrelib/pcre_compile.c           if (n > 255)
n                7052 ext/pcre/pcrelib/pcre_compile.c           *code++ = n;
n                8616 ext/pcre/pcrelib/pcre_compile.c      int n = GET2(scode, 1+LINK_SIZE);
n                8617 ext/pcre/pcrelib/pcre_compile.c      int new_map = bracket_map | ((n < 32)? (1 << n) : 1);
n                8735 ext/pcre/pcrelib/pcre_compile.c      int n = GET2(scode, 1+LINK_SIZE);
n                8736 ext/pcre/pcrelib/pcre_compile.c      int new_map = bracket_map | ((n < 32)? (1 << n) : 1);
n                 295 ext/pcre/pcrelib/pcre_get.c   int n = GET2(entry, 0);
n                 296 ext/pcre/pcrelib/pcre_get.c   if (ovector[n*2] >= 0) return n;
n                 403 ext/pcre/pcrelib/pcre_get.c int n = get_first_set(code, stringname, ovector);
n                 404 ext/pcre/pcrelib/pcre_get.c if (n <= 0) return n;
n                 406 ext/pcre/pcrelib/pcre_get.c return pcre_copy_substring(subject, ovector, stringcount, n, buffer, size);
n                 408 ext/pcre/pcrelib/pcre_get.c return pcre16_copy_substring(subject, ovector, stringcount, n, buffer, size);
n                 410 ext/pcre/pcrelib/pcre_get.c return pcre32_copy_substring(subject, ovector, stringcount, n, buffer, size);
n                 620 ext/pcre/pcrelib/pcre_get.c int n = get_first_set(code, stringname, ovector);
n                 621 ext/pcre/pcrelib/pcre_get.c if (n <= 0) return n;
n                 623 ext/pcre/pcrelib/pcre_get.c return pcre_get_substring(subject, ovector, stringcount, n, stringptr);
n                 625 ext/pcre/pcrelib/pcre_get.c return pcre16_get_substring(subject, ovector, stringcount, n, stringptr);
n                 627 ext/pcre/pcrelib/pcre_get.c return pcre32_get_substring(subject, ovector, stringcount, n, stringptr);
n                 371 ext/pcre/pcrelib/pcre_internal.h #define memcmp(s,c,n)    _memcmp(s,c,n)
n                 372 ext/pcre/pcrelib/pcre_internal.h #define memcpy(d,s,n)    _memcpy(d,s,n)
n                 373 ext/pcre/pcrelib/pcre_internal.h #define memmove(d,s,n)   _memmove(d,s,n)
n                 374 ext/pcre/pcrelib/pcre_internal.h #define memset(s,c,n)    _memset(s,c,n)
n                 388 ext/pcre/pcrelib/pcre_internal.h pcre_memmove(void *d, const void *s, size_t n)
n                 395 ext/pcre/pcrelib/pcre_internal.h   dest += n;
n                 396 ext/pcre/pcrelib/pcre_internal.h   src += n;
n                 397 ext/pcre/pcrelib/pcre_internal.h   for (i = 0; i < n; ++i) *(--dest) = *(--src);
n                 402 ext/pcre/pcrelib/pcre_internal.h   for (i = 0; i < n; ++i) *dest++ = *src++;
n                 403 ext/pcre/pcrelib/pcre_internal.h   return (void *)(dest - n);
n                 429 ext/pcre/pcrelib/pcre_internal.h #define PUT(a,n,d)   \
n                 430 ext/pcre/pcrelib/pcre_internal.h   (a[n] = (d) >> 8), \
n                 431 ext/pcre/pcrelib/pcre_internal.h   (a[(n)+1] = (d) & 255)
n                 433 ext/pcre/pcrelib/pcre_internal.h #define GET(a,n) \
n                 434 ext/pcre/pcrelib/pcre_internal.h   (((a)[n] << 8) | (a)[(n)+1])
n                 441 ext/pcre/pcrelib/pcre_internal.h #define PUT(a,n,d)       \
n                 442 ext/pcre/pcrelib/pcre_internal.h   (a[n] = (d) >> 16),    \
n                 443 ext/pcre/pcrelib/pcre_internal.h   (a[(n)+1] = (d) >> 8), \
n                 444 ext/pcre/pcrelib/pcre_internal.h   (a[(n)+2] = (d) & 255)
n                 446 ext/pcre/pcrelib/pcre_internal.h #define GET(a,n) \
n                 447 ext/pcre/pcrelib/pcre_internal.h   (((a)[n] << 16) | ((a)[(n)+1] << 8) | (a)[(n)+2])
n                 454 ext/pcre/pcrelib/pcre_internal.h #define PUT(a,n,d)        \
n                 455 ext/pcre/pcrelib/pcre_internal.h   (a[n] = (d) >> 24),     \
n                 456 ext/pcre/pcrelib/pcre_internal.h   (a[(n)+1] = (d) >> 16), \
n                 457 ext/pcre/pcrelib/pcre_internal.h   (a[(n)+2] = (d) >> 8),  \
n                 458 ext/pcre/pcrelib/pcre_internal.h   (a[(n)+3] = (d) & 255)
n                 460 ext/pcre/pcrelib/pcre_internal.h #define GET(a,n) \
n                 461 ext/pcre/pcrelib/pcre_internal.h   (((a)[n] << 24) | ((a)[(n)+1] << 16) | ((a)[(n)+2] << 8) | (a)[(n)+3])
n                 478 ext/pcre/pcrelib/pcre_internal.h #define PUT(a,n,d)   \
n                 479 ext/pcre/pcrelib/pcre_internal.h   (a[n] = (d))
n                 481 ext/pcre/pcrelib/pcre_internal.h #define GET(a,n) \
n                 482 ext/pcre/pcrelib/pcre_internal.h   (a[n])
n                 492 ext/pcre/pcrelib/pcre_internal.h #define PUT(a,n,d)   \
n                 493 ext/pcre/pcrelib/pcre_internal.h   (a[n] = (d) >> 16), \
n                 494 ext/pcre/pcrelib/pcre_internal.h   (a[(n)+1] = (d) & 65535)
n                 496 ext/pcre/pcrelib/pcre_internal.h #define GET(a,n) \
n                 497 ext/pcre/pcrelib/pcre_internal.h   (((a)[n] << 16) | (a)[(n)+1])
n                 513 ext/pcre/pcrelib/pcre_internal.h #define PUT(a,n,d)   \
n                 514 ext/pcre/pcrelib/pcre_internal.h   (a[n] = (d))
n                 516 ext/pcre/pcrelib/pcre_internal.h #define GET(a,n) \
n                 517 ext/pcre/pcrelib/pcre_internal.h   (a[n])
n                 528 ext/pcre/pcrelib/pcre_internal.h #define PUTINC(a,n,d)   PUT(a,n,d), a += LINK_SIZE
n                 539 ext/pcre/pcrelib/pcre_internal.h #define PUT2(a,n,d)   \
n                 540 ext/pcre/pcrelib/pcre_internal.h   a[n] = (d) >> 8; \
n                 541 ext/pcre/pcrelib/pcre_internal.h   a[(n)+1] = (d) & 255
n                 547 ext/pcre/pcrelib/pcre_internal.h #define GET2(a,n) \
n                 548 ext/pcre/pcrelib/pcre_internal.h   (unsigned int)(((a)[n] << 8) | (a)[(n)+1])
n                 554 ext/pcre/pcrelib/pcre_internal.h #define PUT2(a,n,d)   \
n                 555 ext/pcre/pcrelib/pcre_internal.h    a[n] = d
n                 557 ext/pcre/pcrelib/pcre_internal.h #define GET2(a,n) \
n                 558 ext/pcre/pcrelib/pcre_internal.h    a[n]
n                 564 ext/pcre/pcrelib/pcre_internal.h #define PUT2(a,n,d)   \
n                 565 ext/pcre/pcrelib/pcre_internal.h    a[n] = d
n                 567 ext/pcre/pcrelib/pcre_internal.h #define GET2(a,n) \
n                 568 ext/pcre/pcrelib/pcre_internal.h    a[n]
n                 574 ext/pcre/pcrelib/pcre_internal.h #define PUT2INC(a,n,d)  PUT2(a,n,d), a += IMM2_SIZE
n                2416 ext/pcre/pcrelib/pcre_jit_compile.c int n;
n                2460 ext/pcre/pcrelib/pcre_jit_compile.c   n = GET_EXTRALEN(*cc);
n                2463 ext/pcre/pcrelib/pcre_jit_compile.c     n--;
n                2466 ext/pcre/pcrelib/pcre_jit_compile.c   return (n << 8) | bit;
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                1259 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1260 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0x3f);
n                1266 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1267 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 24)) & 0xf);
n                1273 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1274 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 18)) & 0x3f);
n                1278 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_BrOff_X1(tilegx_bundle_bits n)
n                1280 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 31)) & 0x0000003f) |
n                1281 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((unsigned int)(n >> 37)) & 0x0001ffc0);
n                1285 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_BrType_X1(tilegx_bundle_bits n)
n                1287 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 54)) & 0x1f);
n                1291 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Dest_Imm8_X1(tilegx_bundle_bits n)
n                1293 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 31)) & 0x0000003f) |
n                1294 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((unsigned int)(n >> 43)) & 0x000000c0);
n                1300 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1301 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 0)) & 0x3f);
n                1305 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Dest_X1(tilegx_bundle_bits n)
n                1307 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 31)) & 0x3f);
n                1313 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1314 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 0)) & 0x3f);
n                1318 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Dest_Y1(tilegx_bundle_bits n)
n                1320 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 31)) & 0x3f);
n                1326 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1327 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0xffff);
n                1331 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Imm16_X1(tilegx_bundle_bits n)
n                1333 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0xffff);
n                1339 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1340 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 20)) & 0xff);
n                1344 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Imm8OpcodeExtension_X1(tilegx_bundle_bits n)
n                1346 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 51)) & 0xff);
n                1352 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1353 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0xff);
n                1357 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Imm8_X1(tilegx_bundle_bits n)
n                1359 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0xff);
n                1365 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1366 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0xff);
n                1370 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Imm8_Y1(tilegx_bundle_bits n)
n                1372 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0xff);
n                1376 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_JumpOff_X1(tilegx_bundle_bits n)
n                1378 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 31)) & 0x7ffffff);
n                1382 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_JumpOpcodeExtension_X1(tilegx_bundle_bits n)
n                1384 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 58)) & 0x1);
n                1388 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_MF_Imm14_X1(tilegx_bundle_bits n)
n                1390 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 37)) & 0x3fff);
n                1394 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_MT_Imm14_X1(tilegx_bundle_bits n)
n                1396 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 31)) & 0x0000003f) |
n                1397 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((unsigned int)(n >> 37)) & 0x00003fc0);
n                1401 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Mode(tilegx_bundle_bits n)
n                1403 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 62)) & 0x3);
n                1409 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1410 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 28)) & 0x7);
n                1414 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Opcode_X1(tilegx_bundle_bits n)
n                1416 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 59)) & 0x7);
n                1422 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1423 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 27)) & 0xf);
n                1427 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Opcode_Y1(tilegx_bundle_bits n)
n                1429 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 58)) & 0xf);
n                1433 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_Opcode_Y2(tilegx_bundle_bits n)
n                1435 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 26)) & 0x00000001) |
n                1436 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((unsigned int)(n >> 56)) & 0x00000002);
n                1442 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1443 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 18)) & 0x3ff);
n                1447 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_RRROpcodeExtension_X1(tilegx_bundle_bits n)
n                1449 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 49)) & 0x3ff);
n                1455 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1456 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 18)) & 0x3);
n                1460 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_RRROpcodeExtension_Y1(tilegx_bundle_bits n)
n                1462 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 49)) & 0x3);
n                1468 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1469 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0x3f);
n                1473 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_ShAmt_X1(tilegx_bundle_bits n)
n                1475 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0x3f);
n                1481 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1482 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0x3f);
n                1486 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_ShAmt_Y1(tilegx_bundle_bits n)
n                1488 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0x3f);
n                1494 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1495 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 18)) & 0x3ff);
n                1499 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_ShiftOpcodeExtension_X1(tilegx_bundle_bits n)
n                1501 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 49)) & 0x3ff);
n                1507 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1508 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 18)) & 0x3);
n                1512 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_ShiftOpcodeExtension_Y1(tilegx_bundle_bits n)
n                1514 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 49)) & 0x3);
n                1520 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1521 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 6)) & 0x3f);
n                1525 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_SrcA_X1(tilegx_bundle_bits n)
n                1527 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 37)) & 0x3f);
n                1533 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1534 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 6)) & 0x3f);
n                1538 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_SrcA_Y1(tilegx_bundle_bits n)
n                1540 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 37)) & 0x3f);
n                1546 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1547 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 20)) & 0x3f);
n                1551 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_SrcBDest_Y2(tilegx_bundle_bits n)
n                1553 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 51)) & 0x3f);
n                1559 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1560 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0x3f);
n                1564 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_SrcB_X1(tilegx_bundle_bits n)
n                1566 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0x3f);
n                1572 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1573 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0x3f);
n                1577 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_SrcB_Y1(tilegx_bundle_bits n)
n                1579 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0x3f);
n                1585 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1586 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0x3f);
n                1590 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_UnaryOpcodeExtension_X1(tilegx_bundle_bits n)
n                1592 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0x3f);
n                1598 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1599 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((n >> 12)) & 0x3f);
n                1603 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c get_UnaryOpcodeExtension_Y1(tilegx_bundle_bits n)
n                1605 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((unsigned int)(n >> 43)) & 0x3f);
n                1609 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c sign_extend(int n, int num_bits)
n                1612 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (n << shift) >> shift;
n                1618 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1619 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 12);
n                1625 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1626 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0xf) << 24);
n                1632 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1633 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 18);
n                1639 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1640 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x0000003f)) << 31) |
n                1641 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((tilegx_bundle_bits)(n & 0x0001ffc0)) << 37);
n                1647 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1648 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x1f)) << 54);
n                1654 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1655 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x0000003f)) << 31) |
n                1656 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((tilegx_bundle_bits)(n & 0x000000c0)) << 43);
n                1662 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1663 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 0);
n                1669 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1670 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 31);
n                1676 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1677 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 0);
n                1683 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1684 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 31);
n                1690 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1691 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0xffff) << 12);
n                1697 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1698 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0xffff)) << 43);
n                1704 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1705 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0xff) << 20);
n                1711 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1712 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0xff)) << 51);
n                1718 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1719 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0xff) << 12);
n                1725 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1726 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0xff)) << 43);
n                1732 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1733 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0xff) << 12);
n                1739 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1740 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0xff)) << 43);
n                1746 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1747 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x7ffffff)) << 31);
n                1753 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1754 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x1)) << 58);
n                1760 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1761 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3fff)) << 37);
n                1767 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1768 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x0000003f)) << 31) |
n                1769 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((tilegx_bundle_bits)(n & 0x00003fc0)) << 37);
n                1775 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1776 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3)) << 62);
n                1782 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1783 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x7) << 28);
n                1789 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1790 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x7)) << 59);
n                1796 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1797 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0xf) << 27);
n                1803 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1804 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0xf)) << 58);
n                1810 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1811 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x00000001) << 26) |
n                1812 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c          (((tilegx_bundle_bits)(n & 0x00000002)) << 56);
n                1818 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1819 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3ff) << 18);
n                1825 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1826 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3ff)) << 49);
n                1832 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1833 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3) << 18);
n                1839 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1840 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3)) << 49);
n                1846 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1847 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 12);
n                1853 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1854 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
n                1860 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1861 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 12);
n                1867 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1868 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
n                1874 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1875 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3ff) << 18);
n                1881 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1882 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3ff)) << 49);
n                1888 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1889 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3) << 18);
n                1895 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1896 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3)) << 49);
n                1902 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1903 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 6);
n                1909 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1910 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 37);
n                1916 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1917 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 6);
n                1923 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1924 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 37);
n                1930 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1931 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 20);
n                1937 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1938 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 51);
n                1944 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1945 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 12);
n                1951 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1952 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
n                1958 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1959 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 12);
n                1965 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1966 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
n                1972 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1973 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 12);
n                1979 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1980 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
n                1986 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1987 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return ((n & 0x3f) << 12);
n                1993 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   const unsigned int n = (unsigned int)num;
n                1994 ext/pcre/pcrelib/sljit/sljitNativeTILEGX-encoder.c   return (((tilegx_bundle_bits)(n & 0x3f)) << 43);
n                 264 ext/pcre/pcrelib/sljit/sljitNativeX86_common.c #define RET_I16(n)			(*inst++ = (RET_i16), *inst++ = n, *inst++ = 0)
n                  38 ext/pdo/pdo_sql_parser.c #define YYFILL(n)		{ RET(PDO_PARSER_EOI); }
n                 327 ext/pdo_firebird/firebird_statement.c 			ISC_INT64 n, f = scales[-var->sqlscale];
n                 331 ext/pdo_firebird/firebird_statement.c 					n = *(short*)var->sqldata;
n                 334 ext/pdo_firebird/firebird_statement.c 					n = *(ISC_LONG*)var->sqldata;
n                 337 ext/pdo_firebird/firebird_statement.c 					n = *(ISC_INT64*)var->sqldata;
n                 342 ext/pdo_firebird/firebird_statement.c 			if (n >= 0) {
n                 344 ext/pdo_firebird/firebird_statement.c 					n / f, -var->sqlscale, n % f);
n                 345 ext/pdo_firebird/firebird_statement.c 			} else if (n <= -f) {
n                 347 ext/pdo_firebird/firebird_statement.c 					n / f, -var->sqlscale, -n % f);
n                 349 ext/pdo_firebird/firebird_statement.c 				*len = slprintf(*ptr, CHAR_BUF_LEN, "-0.%0*" LL_MASK "d", -var->sqlscale, -n % f);
n                 404 ext/pdo_oci/oci_statement.c 						size_t n;
n                 413 ext/pdo_oci/oci_statement.c 								n = php_stream_read(stm, buf, sizeof(buf));
n                 414 ext/pdo_oci/oci_statement.c 								if ((int)n <= 0) {
n                 419 ext/pdo_oci/oci_statement.c 									amt = (ub4) n;
n                 421 ext/pdo_oci/oci_statement.c 											&amt, offset, consume, (ub4) n,
n                 425 ext/pdo_oci/oci_statement.c 									n -= amt;
n                 427 ext/pdo_oci/oci_statement.c 								} while (n);
n                 434 ext/pdo_oci/oci_statement.c 							n = Z_STRLEN_P(parameter);
n                 435 ext/pdo_oci/oci_statement.c 							if (n) {
n                 437 ext/pdo_oci/oci_statement.c 								while (n) {
n                 438 ext/pdo_oci/oci_statement.c 									amt = (ub4) n;
n                 440 ext/pdo_oci/oci_statement.c 											&amt, offset, consume, (ub4) n,
n                 444 ext/pdo_oci/oci_statement.c 									n -= amt;
n                 460 ext/phar/func_interceptors.c 			int   groups, n, i;
n                 466 ext/phar/func_interceptors.c 				n=getgroups(groups, gids);
n                 467 ext/phar/func_interceptors.c 				for(i=0;i<n;++i){
n                2055 ext/phar/phar.c static int php_check_dots(const char *element, int n) /* {{{ */
n                2057 ext/phar/phar.c 	for(n--; n >= 0; --n) {
n                2058 ext/phar/phar.c 		if (element[n] != '.') {
n                  42 ext/phar/phar_path_check.c #define YYFILL(n)
n                 114 ext/session/mod_files.c 	size_t n;
n                 124 ext/session/mod_files.c 	n = data->basedir_len;
n                 125 ext/session/mod_files.c 	buf[n++] = PHP_DIR_SEPARATOR;
n                 127 ext/session/mod_files.c 		buf[n++] = *p++;
n                 128 ext/session/mod_files.c 		buf[n++] = PHP_DIR_SEPARATOR;
n                 130 ext/session/mod_files.c 	memcpy(buf + n, FILE_PREFIX, sizeof(FILE_PREFIX) - 1);
n                 131 ext/session/mod_files.c 	n += sizeof(FILE_PREFIX) - 1;
n                 132 ext/session/mod_files.c 	memcpy(buf + n, key, key_len);
n                 133 ext/session/mod_files.c 	n += key_len;
n                 134 ext/session/mod_files.c 	buf[n] = '\0';
n                 225 ext/session/mod_files.c 	zend_long n = 0;
n                 241 ext/session/mod_files.c 	n = pwrite(data->fd, ZSTR_VAL(val), ZSTR_LEN(val), 0);
n                 253 ext/session/mod_files.c 			n += wrote;
n                 255 ext/session/mod_files.c 			to_write = wrote > -1 ? (ZSTR_LEN(val) - n > UINT_MAX ? UINT_MAX : (unsigned int)(ZSTR_LEN(val) - n)): 0;
n                 260 ext/session/mod_files.c 	n = write(data->fd, ZSTR_VAL(val), ZSTR_LEN(val));
n                 264 ext/session/mod_files.c 	if (n != ZSTR_LEN(val)) {
n                 265 ext/session/mod_files.c 		if (n == -1) {
n                 464 ext/session/mod_files.c 	zend_long n = 0;
n                 487 ext/session/mod_files.c 	n = pread(data->fd, ZSTR_VAL(*val), ZSTR_LEN(*val), 0);
n                 499 ext/session/mod_files.c 			n += read_in;
n                 501 ext/session/mod_files.c 			to_read = read_in > -1 ? (ZSTR_LEN(*val) - n > UINT_MAX ? UINT_MAX : (unsigned int)(ZSTR_LEN(*val) - n)): 0;
n                 507 ext/session/mod_files.c 	n = read(data->fd, ZSTR_VAL(*val), ZSTR_LEN(*val));
n                 511 ext/session/mod_files.c 	if (n != (zend_long)sbuf.st_size) {
n                 512 ext/session/mod_files.c 		if (n == -1) {
n                 388 ext/session/session.c 			int n;
n                 392 ext/session/session.c 				n = read(fd, rbuf, MIN(to_read, sizeof(rbuf)));
n                 393 ext/session/session.c 				if (n <= 0) break;
n                 397 ext/session/session.c 						PHP_MD5Update(&md5_context, rbuf, n);
n                 400 ext/session/session.c 						PHP_SHA1Update(&sha1_context, rbuf, n);
n                 404 ext/session/session.c 						PS(hash_ops)->hash_update(hash_context, rbuf, n);
n                 408 ext/session/session.c 				to_read -= n;
n                1190 ext/session/session.c 	int n;
n                1199 ext/session/session.c 	n = slprintf(buf, sizeof(buf), "%s, %02d %s %d %02d:%02d:%02d GMT", /* SAFE */
n                1204 ext/session/session.c 	memcpy(ubuf, buf, n);
n                1205 ext/session/session.c 	ubuf[n] = '\0';
n                1251 ext/simplexml/simplexml.c static HashTable *sxe_get_gc(zval *object, zval **table, int *n) /* {{{ */ {
n                1256 ext/simplexml/simplexml.c 	*n = 0;
n                1120 ext/snmp/snmp.c 	int n;
n                1168 ext/snmp/snmp.c 	if ((n = php_network_getaddresses(host_ptr, SOCK_DGRAM, &psal, NULL)) == 0) { /* some resolver error */
n                1176 ext/snmp/snmp.c 	while (n-- > 0) {
n                 666 ext/soap/php_encoding.c 				int n = xmlCharEncOutFunc(SOAP_GLOBAL(encoding), out, in);
n                 668 ext/soap/php_encoding.c 				if (n >= 0) {
n                 699 ext/soap/php_encoding.c 				int n = xmlCharEncOutFunc(SOAP_GLOBAL(encoding), out, in);
n                 701 ext/soap/php_encoding.c 				if (n >= 0) {
n                 732 ext/soap/php_encoding.c 				int n = xmlCharEncOutFunc(SOAP_GLOBAL(encoding), out, in);
n                 734 ext/soap/php_encoding.c 				if (n >= 0) {
n                 853 ext/soap/php_encoding.c 		int n = xmlCharEncInFunc(SOAP_GLOBAL(encoding), out, in);
n                 855 ext/soap/php_encoding.c 		if (n >= 0) {
n                 858 ext/soap/php_encoding.c 			new_len = n;
n                 381 ext/soap/php_http.c 			int n;
n                 386 ext/soap/php_http.c 				n = 2;
n                 390 ext/soap/php_http.c 				n = 3;
n                 395 ext/soap/php_http.c 			if (call_user_function(CG(function_table), (zval*)NULL, &func, &retval, n, params) == SUCCESS &&
n                 807 ext/soap/php_http.c 			int i, n;
n                 810 ext/soap/php_http.c 			n = zend_hash_num_elements(Z_ARRVAL_P(cookies));
n                 811 ext/soap/php_http.c 			if (n > 0) {
n                 814 ext/soap/php_http.c 				for (i = 0; i < n; i++) {
n                 727 ext/soap/php_sdl.c 	int i,n;
n                 744 ext/soap/php_sdl.c 	n = zend_hash_num_elements(&ctx.services);
n                 745 ext/soap/php_sdl.c 	if (n > 0) {
n                 747 ext/soap/php_sdl.c 		for (i = 0; i < n; i++) {
n                 812 ext/soap/php_sdl.c 					if (has_soap_port || trav->next || i < n-1) {
n                1182 ext/soap/php_sdl.c #define WSDL_CACHE_GET_N(ret,n,buf)    memcpy(ret,*buf,n); *buf += n;
n                1183 ext/soap/php_sdl.c #define WSDL_CACHE_SKIP(n,buf)         *buf += n;
n                1190 ext/soap/php_sdl.c #define WSDL_CACHE_PUT_N(val,n,buf)    smart_str_appendl(buf,(char*)val,n);
n                1447 ext/soap/php_sdl.c 	int i, j, n;
n                1472 ext/soap/php_sdl.c 			WSDL_CACHE_GET_INT(n, in);
n                1473 ext/soap/php_sdl.c 			tmp->encode = encoders[n];
n                1474 ext/soap/php_sdl.c 			WSDL_CACHE_GET_INT(n, in);
n                1475 ext/soap/php_sdl.c 			tmp->element = types[n];
n                1493 ext/soap/php_sdl.c 					WSDL_CACHE_GET_INT(n, in);
n                1494 ext/soap/php_sdl.c 					tmp2->encode = encoders[n];
n                1495 ext/soap/php_sdl.c 					WSDL_CACHE_GET_INT(n, in);
n                1496 ext/soap/php_sdl.c 					tmp2->element = types[n];
n                1506 ext/soap/php_sdl.c 	int i, n;
n                1518 ext/soap/php_sdl.c 		WSDL_CACHE_GET_INT(n, in);
n                1519 ext/soap/php_sdl.c 		param->encode = encoders[n];
n                1520 ext/soap/php_sdl.c 		WSDL_CACHE_GET_INT(n, in);
n                1521 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                  48 ext/soap/php_xml.h #define FOREACHATTRNODEEX(n,c,ns,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                  62 ext/soap/php_xml.h #define FOREACHNODEEX(n,c,ns,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                  75 ext/soap/php_xml.h #define ENDFOREACH(n) \
n                  77 ext/soap/php_xml.h 	} while ((n = n->next));
n                4312 ext/soap/soap.c 		int n = zend_hash_num_elements(function->requestParameters);
n                4314 ext/soap/soap.c 		if (n > arg_count) {
n                4315 ext/soap/soap.c 			for (i = arg_count; i < n; i++) {
n                 282 ext/sockets/sendrecvmsg.c 						n = 0;
n                 286 ext/sockets/sendrecvmsg.c 			&level, &type, &n) == FAILURE) {
n                 292 ext/sockets/sendrecvmsg.c 	LONG_CHECK_VALID_INT(n);
n                 294 ext/sockets/sendrecvmsg.c 	if (n < 0) {
n                 307 ext/sockets/sendrecvmsg.c 	if (entry->var_el_size > 0 && n > (ZEND_LONG_MAX - (zend_long)entry->size -
n                 311 ext/sockets/sendrecvmsg.c 				"third argument (%pd) is too large", n);
n                 315 ext/sockets/sendrecvmsg.c 	RETURN_LONG((zend_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                 146 ext/spl/spl_fixedarray.c static HashTable* spl_fixedarray_object_get_gc(zval *obj, zval **table, int *n) /* {{{{ */
n                 153 ext/spl/spl_fixedarray.c 		*n = (int)intern->array->size;
n                 156 ext/spl/spl_fixedarray.c 		*n = 0;
n                 312 ext/spl/spl_observer.c static HashTable *spl_object_storage_get_gc(zval *obj, zval **table, int *n) /* {{{ */
n                 329 ext/spl/spl_observer.c 	*n = i;
n                 954 ext/sqlite3/libsqlite/sqlite3.c   int (*xShmLock)(sqlite3_file*, int offset, int n, int flags);
n                3747 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API int SQLITE_STDCALL sqlite3_bind_blob(sqlite3_stmt*, int, const void*, int n, void(*)(void*));
n                3759 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API int SQLITE_STDCALL sqlite3_bind_zeroblob(sqlite3_stmt*, int, int n);
n                4838 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void SQLITE_STDCALL sqlite3_result_zeroblob(sqlite3_context*, int n);
n                6192 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API int SQLITE_STDCALL sqlite3_blob_write(sqlite3_blob *, const void *z, int n, int iOffset);
n                10021 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void sqlite3VdbeSetSql(Vdbe*, const char *z, int n, int);
n                10271 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE int sqlite3PagerOpenSavepoint(Pager *pPager, int n);
n                10397 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void sqlite3PCacheBufferSetup(void *, int sz, int n);
n                11783 ext/sqlite3/libsqlite/sqlite3.c   int n;            /* Size of record in bytes */
n                11799 ext/sqlite3/libsqlite/sqlite3.c   unsigned int n;    /* Number of characters in this token */
n                12121 ext/sqlite3/libsqlite/sqlite3.c #define MASKBIT(n)   (((Bitmask)1)<<(n))
n                12122 ext/sqlite3/libsqlite/sqlite3.c #define MASKBIT32(n) (((unsigned int)1)<<(n))
n                12861 ext/sqlite3/libsqlite/sqlite3.c     int n;                                     /* A counter */
n                13414 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3HexToBlob(sqlite3*, const char *z, int n);
n                14447 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                14456 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3Strlen30(zOptName);
n                14461 ext/sqlite3/libsqlite/sqlite3.c     if( sqlite3StrNICmp(zOptName, azCompileOpt[i], n)==0
n                14462 ext/sqlite3/libsqlite/sqlite3.c      && sqlite3IsIdChar((unsigned char)azCompileOpt[i][n])==0
n                14676 ext/sqlite3/libsqlite/sqlite3.c   int n;              /* Number of characters in string value, excluding '\0' */
n                14946 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE int sqlite3VdbeMemGrow(Mem *pMem, int n, int preserve);
n                14947 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE int sqlite3VdbeMemClearAndResize(Mem *pMem, int n);
n                15879 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                15883 ext/sqlite3/libsqlite/sqlite3.c   for(n=0; n<ArraySize(zBuf)-1 && zMod[n]; n++){
n                15884 ext/sqlite3/libsqlite/sqlite3.c     z[n] = (char)sqlite3UpperToLower[(u8)zMod[n]];
n                15886 ext/sqlite3/libsqlite/sqlite3.c   z[n] = 0;
n                15939 ext/sqlite3/libsqlite/sqlite3.c                && (n=(int)r)==r && n>=0 && r<7 ){
n                15946 ext/sqlite3/libsqlite/sqlite3.c         if( Z>n ) Z -= 7;
n                15947 ext/sqlite3/libsqlite/sqlite3.c         p->iJD += (n - Z)*86400000;
n                15994 ext/sqlite3/libsqlite/sqlite3.c       for(n=1; z[n] && z[n]!=':' && !sqlite3Isspace(z[n]); n++){}
n                15995 ext/sqlite3/libsqlite/sqlite3.c       if( !sqlite3AtoF(z, &r, n, SQLITE_UTF8) ){
n                15999 ext/sqlite3/libsqlite/sqlite3.c       if( z[n]==':' ){
n                16022 ext/sqlite3/libsqlite/sqlite3.c       z += n;
n                16024 ext/sqlite3/libsqlite/sqlite3.c       n = sqlite3Strlen30(z);
n                16025 ext/sqlite3/libsqlite/sqlite3.c       if( n>10 || n<3 ) break;
n                16026 ext/sqlite3/libsqlite/sqlite3.c       if( z[n-1]=='s' ){ z[n-1] = 0; n--; }
n                16030 ext/sqlite3/libsqlite/sqlite3.c       if( n==3 && strcmp(z,"day")==0 ){
n                16032 ext/sqlite3/libsqlite/sqlite3.c       }else if( n==4 && strcmp(z,"hour")==0 ){
n                16034 ext/sqlite3/libsqlite/sqlite3.c       }else if( n==6 && strcmp(z,"minute")==0 ){
n                16036 ext/sqlite3/libsqlite/sqlite3.c       }else if( n==6 && strcmp(z,"second")==0 ){
n                16038 ext/sqlite3/libsqlite/sqlite3.c       }else if( n==5 && strcmp(z,"month")==0 ){
n                16051 ext/sqlite3/libsqlite/sqlite3.c       }else if( n==4 && strcmp(z,"year")==0 ){
n                16218 ext/sqlite3/libsqlite/sqlite3.c   u64 n;
n                16228 ext/sqlite3/libsqlite/sqlite3.c   for(i=0, n=1; zFmt[i]; i++, n++){
n                16237 ext/sqlite3/libsqlite/sqlite3.c           n++;
n                16243 ext/sqlite3/libsqlite/sqlite3.c           n += 8;
n                16246 ext/sqlite3/libsqlite/sqlite3.c           n += 3;
n                16249 ext/sqlite3/libsqlite/sqlite3.c           n += 8;
n                16253 ext/sqlite3/libsqlite/sqlite3.c           n += 50;
n                16261 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==sizeof(zBuf)-1 );
n                16262 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==sizeof(zBuf) );
n                16263 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==(u64)db->aLimit[SQLITE_LIMIT_LENGTH]+1 );
n                16264 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==(u64)db->aLimit[SQLITE_LIMIT_LENGTH] );
n                16265 ext/sqlite3/libsqlite/sqlite3.c   if( n<sizeof(zBuf) ){
n                16267 ext/sqlite3/libsqlite/sqlite3.c   }else if( n>(u64)db->aLimit[SQLITE_LIMIT_LENGTH] ){
n                16271 ext/sqlite3/libsqlite/sqlite3.c     z = sqlite3DbMallocRaw(db, (int)n);
n                16603 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE int sqlite3OsShmLock(sqlite3_file *id, int offset, int n, int flags){
n                16604 ext/sqlite3/libsqlite/sqlite3.c   return id->pMethods->xShmLock(id, offset, n, flags);
n                16985 ext/sqlite3/libsqlite/sqlite3.c static int sqlite3MemRoundup(int n){ return n; }
n                17238 ext/sqlite3/libsqlite/sqlite3.c static int sqlite3MemRoundup(int n){
n                17239 ext/sqlite3/libsqlite/sqlite3.c   return ROUND8(n);
n                17518 ext/sqlite3/libsqlite/sqlite3.c static int sqlite3MemRoundup(int n){
n                17519 ext/sqlite3/libsqlite/sqlite3.c   return ROUND8(n);
n                17762 ext/sqlite3/libsqlite/sqlite3.c   unsigned int n = sqlite3Strlen30(zTitle) + 1;
n                17764 ext/sqlite3/libsqlite/sqlite3.c   if( n>=sizeof(mem.zTitle) ) n = sizeof(mem.zTitle)-1;
n                17765 ext/sqlite3/libsqlite/sqlite3.c   memcpy(mem.zTitle, zTitle, n);
n                17766 ext/sqlite3/libsqlite/sqlite3.c   mem.zTitle[n] = 0;
n                17767 ext/sqlite3/libsqlite/sqlite3.c   mem.nTitle = ROUND8(n);
n                18326 ext/sqlite3/libsqlite/sqlite3.c static int memsys3Roundup(int n){
n                18327 ext/sqlite3/libsqlite/sqlite3.c   if( n<=12 ){
n                18330 ext/sqlite3/libsqlite/sqlite3.c     return ((n+11)&~7) - 4;
n                18948 ext/sqlite3/libsqlite/sqlite3.c static int memsys5Roundup(int n){
n                18950 ext/sqlite3/libsqlite/sqlite3.c   if( n > 0x40000000 ) return 0;
n                18951 ext/sqlite3/libsqlite/sqlite3.c   for(iFullSz=mem5.szAtom; iFullSz<n; iFullSz *= 2);
n                19048 ext/sqlite3/libsqlite/sqlite3.c   int i, j, n;
n                19064 ext/sqlite3/libsqlite/sqlite3.c     for(n=0, j=mem5.aiFreelist[i]; j>=0; j = MEM5LINK(j)->next, n++){}
n                19065 ext/sqlite3/libsqlite/sqlite3.c     fprintf(out, "freelist items of size %d: %d\n", mem5.szAtom << i, n);
n                20537 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API int SQLITE_STDCALL sqlite3_release_memory(int n){
n                20539 ext/sqlite3/libsqlite/sqlite3.c   return sqlite3PcacheReleaseMemory(n);
n                20544 ext/sqlite3/libsqlite/sqlite3.c   UNUSED_PARAMETER(n);
n                20650 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API sqlite3_int64 SQLITE_STDCALL sqlite3_soft_heap_limit64(sqlite3_int64 n){
n                20660 ext/sqlite3/libsqlite/sqlite3.c   if( n<0 ) return priorLimit;
n                20661 ext/sqlite3/libsqlite/sqlite3.c   if( n>0 ){
n                20662 ext/sqlite3/libsqlite/sqlite3.c     sqlite3MemoryAlarm(softHeapLimitEnforcer, 0, n);
n                20666 ext/sqlite3/libsqlite/sqlite3.c   excess = sqlite3_memory_used() - n;
n                20670 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void SQLITE_STDCALL sqlite3_soft_heap_limit(int n){
n                20671 ext/sqlite3/libsqlite/sqlite3.c   if( n<0 ) n = 0;
n                20672 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_soft_heap_limit64(n);
n                20689 ext/sqlite3/libsqlite/sqlite3.c     int i, n, sz;
n                20694 ext/sqlite3/libsqlite/sqlite3.c     n = sqlite3GlobalConfig.nScratch;
n                20696 ext/sqlite3/libsqlite/sqlite3.c     mem0.nScratchFree = n;
n                20697 ext/sqlite3/libsqlite/sqlite3.c     for(i=0; i<n-1; i++){
n                20743 ext/sqlite3/libsqlite/sqlite3.c   int n, mx;
n                20745 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_status(SQLITE_STATUS_MEMORY_USED, &n, &mx, 0);
n                20746 ext/sqlite3/libsqlite/sqlite3.c   res = (sqlite3_int64)n;  /* Work around bug in Borland C. Ticket #3216 */
n                20756 ext/sqlite3/libsqlite/sqlite3.c   int n, mx;
n                20758 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_status(SQLITE_STATUS_MEMORY_USED, &n, &mx, resetFlag);
n                20786 ext/sqlite3/libsqlite/sqlite3.c static int mallocWithAlarm(int n, void **pp){
n                20790 ext/sqlite3/libsqlite/sqlite3.c   nFull = sqlite3GlobalConfig.m.xRoundup(n);
n                20791 ext/sqlite3/libsqlite/sqlite3.c   sqlite3StatusSet(SQLITE_STATUS_MALLOC_SIZE, n);
n                20821 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3Malloc(u64 n){
n                20823 ext/sqlite3/libsqlite/sqlite3.c   if( n==0 || n>=0x7fffff00 ){
n                20832 ext/sqlite3/libsqlite/sqlite3.c     mallocWithAlarm((int)n, &p);
n                20835 ext/sqlite3/libsqlite/sqlite3.c     p = sqlite3GlobalConfig.m.xMalloc((int)n);
n                20846 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void *SQLITE_STDCALL sqlite3_malloc(int n){
n                20850 ext/sqlite3/libsqlite/sqlite3.c   return n<=0 ? 0 : sqlite3Malloc(n);
n                20852 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void *SQLITE_STDCALL sqlite3_malloc64(sqlite3_uint64 n){
n                20856 ext/sqlite3/libsqlite/sqlite3.c   return sqlite3Malloc(n);
n                20878 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3ScratchMalloc(int n){
n                20880 ext/sqlite3/libsqlite/sqlite3.c   assert( n>0 );
n                20883 ext/sqlite3/libsqlite/sqlite3.c   sqlite3StatusSet(SQLITE_STATUS_SCRATCH_SIZE, n);
n                20884 ext/sqlite3/libsqlite/sqlite3.c   if( mem0.nScratchFree && sqlite3GlobalConfig.szScratch>=n ){
n                20892 ext/sqlite3/libsqlite/sqlite3.c     p = sqlite3Malloc(n);
n                21111 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void *SQLITE_STDCALL sqlite3_realloc(void *pOld, int n){
n                21115 ext/sqlite3/libsqlite/sqlite3.c   if( n<0 ) n = 0;  /* IMP: R-26507-47431 */
n                21116 ext/sqlite3/libsqlite/sqlite3.c   return sqlite3Realloc(pOld, n);
n                21118 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void *SQLITE_STDCALL sqlite3_realloc64(void *pOld, sqlite3_uint64 n){
n                21122 ext/sqlite3/libsqlite/sqlite3.c   return sqlite3Realloc(pOld, n);
n                21129 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3MallocZero(u64 n){
n                21130 ext/sqlite3/libsqlite/sqlite3.c   void *p = sqlite3Malloc(n);
n                21132 ext/sqlite3/libsqlite/sqlite3.c     memset(p, 0, (size_t)n);
n                21141 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3DbMallocZero(sqlite3 *db, u64 n){
n                21142 ext/sqlite3/libsqlite/sqlite3.c   void *p = sqlite3DbMallocRaw(db, n);
n                21144 ext/sqlite3/libsqlite/sqlite3.c     memset(p, 0, (size_t)n);
n                21167 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3DbMallocRaw(sqlite3 *db, u64 n){
n                21178 ext/sqlite3/libsqlite/sqlite3.c       if( n>db->lookaside.sz ){
n                21198 ext/sqlite3/libsqlite/sqlite3.c   p = sqlite3Malloc(n);
n                21211 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3DbRealloc(sqlite3 *db, void *p, u64 n){
n                21217 ext/sqlite3/libsqlite/sqlite3.c       return sqlite3DbMallocRaw(db, n);
n                21220 ext/sqlite3/libsqlite/sqlite3.c       if( n<=db->lookaside.sz ){
n                21223 ext/sqlite3/libsqlite/sqlite3.c       pNew = sqlite3DbMallocRaw(db, n);
n                21232 ext/sqlite3/libsqlite/sqlite3.c       pNew = sqlite3_realloc64(p, n);
n                21247 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3DbReallocOrFree(sqlite3 *db, void *p, u64 n){
n                21249 ext/sqlite3/libsqlite/sqlite3.c   pNew = sqlite3DbRealloc(db, p, n);
n                21265 ext/sqlite3/libsqlite/sqlite3.c   size_t n;
n                21269 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3Strlen30(z) + 1;
n                21270 ext/sqlite3/libsqlite/sqlite3.c   assert( (n&0x7fffffff)==n );
n                21271 ext/sqlite3/libsqlite/sqlite3.c   zNew = sqlite3DbMallocRaw(db, (int)n);
n                21273 ext/sqlite3/libsqlite/sqlite3.c     memcpy(zNew, z, n);
n                21277 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE char *sqlite3DbStrNDup(sqlite3 *db, const char *z, u64 n){
n                21282 ext/sqlite3/libsqlite/sqlite3.c   assert( (n&0x7fffffff)==n );
n                21283 ext/sqlite3/libsqlite/sqlite3.c   zNew = sqlite3DbMallocRaw(db, n+1);
n                21285 ext/sqlite3/libsqlite/sqlite3.c     memcpy(zNew, z, (size_t)n);
n                21286 ext/sqlite3/libsqlite/sqlite3.c     zNew[n] = 0;
n                21996 ext/sqlite3/libsqlite/sqlite3.c         int i, j, k, n, isnull;
n                22010 ext/sqlite3/libsqlite/sqlite3.c         for(i=n=0; k!=0 && (ch=escarg[i])!=0; i++, k--){
n                22011 ext/sqlite3/libsqlite/sqlite3.c           if( ch==q )  n++;
n                22014 ext/sqlite3/libsqlite/sqlite3.c         n += i + 1 + needQuote*2;
n                22015 ext/sqlite3/libsqlite/sqlite3.c         if( n>etBUFSIZE ){
n                22016 ext/sqlite3/libsqlite/sqlite3.c           bufpt = zExtra = sqlite3Malloc( n );
n                22042 ext/sqlite3/libsqlite/sqlite3.c         if( pToken && pToken->n ){
n                22043 ext/sqlite3/libsqlite/sqlite3.c           sqlite3StrAccumAppend(pAccum, (const char*)pToken->z, pToken->n);
n                22235 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void sqlite3StrAccumInit(StrAccum *p, sqlite3 *db, char *zBase, int n, int mx){
n                22239 ext/sqlite3/libsqlite/sqlite3.c   p->nAlloc = n;
n                22347 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API char *SQLITE_STDCALL sqlite3_vsnprintf(int n, char *zBuf, const char *zFormat, va_list ap){
n                22349 ext/sqlite3/libsqlite/sqlite3.c   if( n<=0 ) return zBuf;
n                22357 ext/sqlite3/libsqlite/sqlite3.c   sqlite3StrAccumInit(&acc, 0, zBuf, n, 0);
n                22361 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API char *SQLITE_CDECL sqlite3_snprintf(int n, char *zBuf, const char *zFormat, ...){
n                22365 ext/sqlite3/libsqlite/sqlite3.c   z = sqlite3_vsnprintf(n, zBuf, zFormat, ap);
n                23108 ext/sqlite3/libsqlite/sqlite3.c   assert( pMem->n>=0 );
n                23131 ext/sqlite3/libsqlite/sqlite3.c     zTerm = &zIn[pMem->n&~1];
n                23149 ext/sqlite3/libsqlite/sqlite3.c     pMem->n &= ~1;
n                23150 ext/sqlite3/libsqlite/sqlite3.c     len = pMem->n * 2 + 1;
n                23157 ext/sqlite3/libsqlite/sqlite3.c     len = pMem->n * 2 + 2;
n                23167 ext/sqlite3/libsqlite/sqlite3.c   zTerm = &zIn[pMem->n];
n                23189 ext/sqlite3/libsqlite/sqlite3.c     pMem->n = (int)(z - zOut);
n                23206 ext/sqlite3/libsqlite/sqlite3.c     pMem->n = (int)(z - zOut);
n                23209 ext/sqlite3/libsqlite/sqlite3.c   assert( (pMem->n+(desiredEnc==SQLITE_UTF8?1:2))<=len );
n                23243 ext/sqlite3/libsqlite/sqlite3.c   assert( pMem->n>=0 );
n                23244 ext/sqlite3/libsqlite/sqlite3.c   if( pMem->n>1 ){
n                23258 ext/sqlite3/libsqlite/sqlite3.c       pMem->n -= 2;
n                23259 ext/sqlite3/libsqlite/sqlite3.c       memmove(pMem->z, &pMem->z[2], pMem->n);
n                23260 ext/sqlite3/libsqlite/sqlite3.c       pMem->z[pMem->n] = '\0';
n                23261 ext/sqlite3/libsqlite/sqlite3.c       pMem->z[pMem->n+1] = '\0';
n                23355 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                23358 ext/sqlite3/libsqlite/sqlite3.c     while( n<nChar ){
n                23360 ext/sqlite3/libsqlite/sqlite3.c       n++;
n                23363 ext/sqlite3/libsqlite/sqlite3.c     while( n<nChar ){
n                23365 ext/sqlite3/libsqlite/sqlite3.c       n++;
n                23381 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                23387 ext/sqlite3/libsqlite/sqlite3.c     n = (int)(z-zBuf);
n                23388 ext/sqlite3/libsqlite/sqlite3.c     assert( n>0 && n<=4 );
n                23396 ext/sqlite3/libsqlite/sqlite3.c     assert( (z-zBuf)==n );
n                23402 ext/sqlite3/libsqlite/sqlite3.c     n = (int)(z-zBuf);
n                23403 ext/sqlite3/libsqlite/sqlite3.c     assert( n>0 && n<=4 );
n                23408 ext/sqlite3/libsqlite/sqlite3.c     assert( (z-zBuf)==n );
n                23414 ext/sqlite3/libsqlite/sqlite3.c     n = (int)(z-zBuf);
n                23415 ext/sqlite3/libsqlite/sqlite3.c     assert( n>0 && n<=4 );
n                23420 ext/sqlite3/libsqlite/sqlite3.c     assert( (z-zBuf)==n );
n                24149 ext/sqlite3/libsqlite/sqlite3.c   int i, j, n;
n                24160 ext/sqlite3/libsqlite/sqlite3.c   n = 0;
n                24162 ext/sqlite3/libsqlite/sqlite3.c     buf[n++] = (u8)((v & 0x7f) | 0x80);
n                24166 ext/sqlite3/libsqlite/sqlite3.c   assert( n<=9 );
n                24167 ext/sqlite3/libsqlite/sqlite3.c   for(i=0, j=n-1; j>=0; j--, i++){
n                24170 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                24428 ext/sqlite3/libsqlite/sqlite3.c     u8 n;
n                24431 ext/sqlite3/libsqlite/sqlite3.c     n = sqlite3GetVarint(p, &v64);
n                24432 ext/sqlite3/libsqlite/sqlite3.c     assert( n>3 && n<=9 );
n                24438 ext/sqlite3/libsqlite/sqlite3.c     return n;
n                24480 ext/sqlite3/libsqlite/sqlite3.c     u8 n;
n                24483 ext/sqlite3/libsqlite/sqlite3.c     n = sqlite3GetVarint(p, &v64);
n                24484 ext/sqlite3/libsqlite/sqlite3.c     assert( n>5 && n<=9 );
n                24486 ext/sqlite3/libsqlite/sqlite3.c     return n;
n                24544 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void *sqlite3HexToBlob(sqlite3 *db, const char *z, int n){
n                24548 ext/sqlite3/libsqlite/sqlite3.c   zBlob = (char *)sqlite3DbMallocRaw(db, n/2 + 1);
n                24549 ext/sqlite3/libsqlite/sqlite3.c   n--;
n                24551 ext/sqlite3/libsqlite/sqlite3.c     for(i=0; i<n; i+=2){
n                24791 ext/sqlite3/libsqlite/sqlite3.c   u64 n;
n                24793 ext/sqlite3/libsqlite/sqlite3.c   n = x%10;
n                24795 ext/sqlite3/libsqlite/sqlite3.c   if( n>=5 ) n -= 2;
n                24796 ext/sqlite3/libsqlite/sqlite3.c   else if( n>=1 ) n -= 1;
n                24798 ext/sqlite3/libsqlite/sqlite3.c     return x>60 ? (u64)LARGEST_INT64 : (n+8)<<(x-3);
n                24800 ext/sqlite3/libsqlite/sqlite3.c   return (n+8)>>(3-x);
n                26310 ext/sqlite3/libsqlite/sqlite3.c static int vxworksSimplifyName(char *z, int n){
n                26312 ext/sqlite3/libsqlite/sqlite3.c   while( n>1 && z[n-1]=='/' ){ n--; }
n                26313 ext/sqlite3/libsqlite/sqlite3.c   for(i=j=0; i<n; i++){
n                26316 ext/sqlite3/libsqlite/sqlite3.c       if( z[i+1]=='.' && i+2<n && z[i+2]=='/' ){
n                26320 ext/sqlite3/libsqlite/sqlite3.c       if( z[i+1]=='.' && i+3<n && z[i+2]=='.' && z[i+3]=='/' ){
n                26347 ext/sqlite3/libsqlite/sqlite3.c   int n;                              /* Length of zAbsoluteName string */
n                26350 ext/sqlite3/libsqlite/sqlite3.c   n = (int)strlen(zAbsoluteName);
n                26351 ext/sqlite3/libsqlite/sqlite3.c   pNew = sqlite3_malloc64( sizeof(*pNew) + (n+1) );
n                26354 ext/sqlite3/libsqlite/sqlite3.c   memcpy(pNew->zCanonicalName, zAbsoluteName, n+1);
n                26355 ext/sqlite3/libsqlite/sqlite3.c   n = vxworksSimplifyName(pNew->zCanonicalName, n);
n                26363 ext/sqlite3/libsqlite/sqlite3.c     if( pCandidate->nName==n 
n                26364 ext/sqlite3/libsqlite/sqlite3.c      && memcmp(pCandidate->zCanonicalName, pNew->zCanonicalName, n)==0
n                26375 ext/sqlite3/libsqlite/sqlite3.c   pNew->nName = n;
n                29556 ext/sqlite3/libsqlite/sqlite3.c   int n                  /* Number of bytes to lock */
n                29567 ext/sqlite3/libsqlite/sqlite3.c   assert( n==1 || lockType!=F_RDLCK );
n                29570 ext/sqlite3/libsqlite/sqlite3.c   assert( n>=1 && n<SQLITE_SHM_NLOCK );
n                29579 ext/sqlite3/libsqlite/sqlite3.c     f.l_len = n;
n                29591 ext/sqlite3/libsqlite/sqlite3.c   mask = ofst>31 ? 0xffff : (1<<(ofst+n)) - (1<<ofst);
n                29995 ext/sqlite3/libsqlite/sqlite3.c   int n,                     /* Number of locks to acquire or release */
n                30007 ext/sqlite3/libsqlite/sqlite3.c   assert( ofst>=0 && ofst+n<=SQLITE_SHM_NLOCK );
n                30008 ext/sqlite3/libsqlite/sqlite3.c   assert( n>=1 );
n                30013 ext/sqlite3/libsqlite/sqlite3.c   assert( n==1 || (flags & SQLITE_SHM_EXCLUSIVE)!=0 );
n                30017 ext/sqlite3/libsqlite/sqlite3.c   mask = (1<<(ofst+n)) - (1<<ofst);
n                30018 ext/sqlite3/libsqlite/sqlite3.c   assert( n>1 || mask==(1<<ofst) );
n                30032 ext/sqlite3/libsqlite/sqlite3.c       rc = unixShmSystemLock(pDbFd, F_UNLCK, ofst+UNIX_SHM_BASE, n);
n                30060 ext/sqlite3/libsqlite/sqlite3.c         rc = unixShmSystemLock(pDbFd, F_RDLCK, ofst+UNIX_SHM_BASE, n);
n                30085 ext/sqlite3/libsqlite/sqlite3.c       rc = unixShmSystemLock(pDbFd, F_WRLCK, ofst+UNIX_SHM_BASE, n);
n                30843 ext/sqlite3/libsqlite/sqlite3.c       int n;
n                30846 ext/sqlite3/libsqlite/sqlite3.c       for( n=1; zSemName[n]; n++ )
n                30847 ext/sqlite3/libsqlite/sqlite3.c         if( zSemName[n]=='/' ) zSemName[n] = '_';
n                33609 ext/sqlite3/libsqlite/sqlite3.c static int winMemRoundup(int n);
n                34684 ext/sqlite3/libsqlite/sqlite3.c   SIZE_T n;
n                34694 ext/sqlite3/libsqlite/sqlite3.c   n = osHeapSize(hHeap, SQLITE_WIN32_HEAP_FLAGS, p);
n                34695 ext/sqlite3/libsqlite/sqlite3.c   if( n==(SIZE_T)-1 ){
n                34700 ext/sqlite3/libsqlite/sqlite3.c   return (int)n;
n                34706 ext/sqlite3/libsqlite/sqlite3.c static int winMemRoundup(int n){
n                34707 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                36945 ext/sqlite3/libsqlite/sqlite3.c   int n,                     /* Number of locks to acquire or release */
n                36955 ext/sqlite3/libsqlite/sqlite3.c   assert( ofst>=0 && ofst+n<=SQLITE_SHM_NLOCK );
n                36956 ext/sqlite3/libsqlite/sqlite3.c   assert( n>=1 );
n                36961 ext/sqlite3/libsqlite/sqlite3.c   assert( n==1 || (flags & SQLITE_SHM_EXCLUSIVE)!=0 );
n                36963 ext/sqlite3/libsqlite/sqlite3.c   mask = (u16)((1U<<(ofst+n)) - (1U<<ofst));
n                36964 ext/sqlite3/libsqlite/sqlite3.c   assert( n>1 || mask==(1<<ofst) );
n                36978 ext/sqlite3/libsqlite/sqlite3.c       rc = winShmSystemLock(pShmNode, _SHM_UNLCK, ofst+WIN_SHM_BASE, n);
n                37006 ext/sqlite3/libsqlite/sqlite3.c         rc = winShmSystemLock(pShmNode, _SHM_RDLCK, ofst+WIN_SHM_BASE, n);
n                37031 ext/sqlite3/libsqlite/sqlite3.c       rc = winShmSystemLock(pShmNode, _SHM_WRLCK, ofst+WIN_SHM_BASE, n);
n                38581 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                38584 ext/sqlite3/libsqlite/sqlite3.c   n = nBuf;
n                38587 ext/sqlite3/libsqlite/sqlite3.c   if( sizeof(SYSTEMTIME)<=nBuf-n ){
n                38590 ext/sqlite3/libsqlite/sqlite3.c     memcpy(&zBuf[n], &x, sizeof(x));
n                38591 ext/sqlite3/libsqlite/sqlite3.c     n += sizeof(x);
n                38593 ext/sqlite3/libsqlite/sqlite3.c   if( sizeof(DWORD)<=nBuf-n ){
n                38595 ext/sqlite3/libsqlite/sqlite3.c     memcpy(&zBuf[n], &pid, sizeof(pid));
n                38596 ext/sqlite3/libsqlite/sqlite3.c     n += sizeof(pid);
n                38599 ext/sqlite3/libsqlite/sqlite3.c   if( sizeof(ULONGLONG)<=nBuf-n ){
n                38601 ext/sqlite3/libsqlite/sqlite3.c     memcpy(&zBuf[n], &cnt, sizeof(cnt));
n                38602 ext/sqlite3/libsqlite/sqlite3.c     n += sizeof(cnt);
n                38605 ext/sqlite3/libsqlite/sqlite3.c   if( sizeof(DWORD)<=nBuf-n ){
n                38607 ext/sqlite3/libsqlite/sqlite3.c     memcpy(&zBuf[n], &cnt, sizeof(cnt));
n                38608 ext/sqlite3/libsqlite/sqlite3.c     n += sizeof(cnt);
n                38611 ext/sqlite3/libsqlite/sqlite3.c   if( sizeof(LARGE_INTEGER)<=nBuf-n ){
n                38614 ext/sqlite3/libsqlite/sqlite3.c     memcpy(&zBuf[n], &i, sizeof(i));
n                38615 ext/sqlite3/libsqlite/sqlite3.c     n += sizeof(i);
n                38618 ext/sqlite3/libsqlite/sqlite3.c   if( sizeof(UUID)<=nBuf-n ){
n                38623 ext/sqlite3/libsqlite/sqlite3.c     n += sizeof(UUID);
n                38625 ext/sqlite3/libsqlite/sqlite3.c   if( sizeof(UUID)<=nBuf-n ){
n                38630 ext/sqlite3/libsqlite/sqlite3.c     n += sizeof(UUID);
n                38634 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                40091 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void sqlite3PCacheBufferSetup(void *pBuf, int sz, int n){
n                40096 ext/sqlite3/libsqlite/sqlite3.c     pcache1.nSlot = pcache1.nFreeSlot = n;
n                40097 ext/sqlite3/libsqlite/sqlite3.c     pcache1.nReserve = n>90 ? 10 : (n/10 + 1);
n                40101 ext/sqlite3/libsqlite/sqlite3.c     while( n-- ){
n                40583 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                40586 ext/sqlite3/libsqlite/sqlite3.c   n = pCache->nPage;
n                40588 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                44789 ext/sqlite3/libsqlite/sqlite3.c     i64 n = 0;                    /* Size of db file in bytes */
n                44792 ext/sqlite3/libsqlite/sqlite3.c       int rc = sqlite3OsFileSize(pPager->fd, &n);
n                44797 ext/sqlite3/libsqlite/sqlite3.c     nPage = (Pgno)((n+pPager->pageSize-1) / pPager->pageSize);
n                49693 ext/sqlite3/libsqlite/sqlite3.c static int walLockExclusive(Wal *pWal, int lockIdx, int n, int fBlock){
n                49697 ext/sqlite3/libsqlite/sqlite3.c   rc = sqlite3OsShmLock(pWal->pDbFd, lockIdx, n,
n                49700 ext/sqlite3/libsqlite/sqlite3.c             walLockName(lockIdx), n, rc ? "failed" : "ok"));
n                49704 ext/sqlite3/libsqlite/sqlite3.c static void walUnlockExclusive(Wal *pWal, int lockIdx, int n){
n                49706 ext/sqlite3/libsqlite/sqlite3.c   (void)sqlite3OsShmLock(pWal->pDbFd, lockIdx, n,
n                49709 ext/sqlite3/libsqlite/sqlite3.c              walLockName(lockIdx), n));
n                50512 ext/sqlite3/libsqlite/sqlite3.c   int n                           /* Number of bytes to lock */
n                50516 ext/sqlite3/libsqlite/sqlite3.c     rc = walLockExclusive(pWal, lockIdx, n, 0);
n                55513 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                55515 ext/sqlite3/libsqlite/sqlite3.c   n = p->pBt->pageSize - p->pBt->usableSize;
n                55516 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                55529 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                55531 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3BtreeGetReserveNoMutex(p);
n                55533 ext/sqlite3/libsqlite/sqlite3.c   if( n<p->pBt->optimalReserve ) n = p->pBt->optimalReserve;
n                55536 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                55546 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                55548 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3PagerMaxPageCount(p->pBt->pPager, mxPage);
n                55550 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                58320 ext/sqlite3/libsqlite/sqlite3.c   u32 n;     /* Number of pages on the freelist */
n                58332 ext/sqlite3/libsqlite/sqlite3.c   n = get4byte(&pPage1->aData[36]);
n                58333 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==mxPage-1 );
n                58334 ext/sqlite3/libsqlite/sqlite3.c   if( n>=mxPage ){
n                58337 ext/sqlite3/libsqlite/sqlite3.c   if( n>0 ){
n                58368 ext/sqlite3/libsqlite/sqlite3.c     put4byte(&pPage1->aData[36], n-1);
n                58416 ext/sqlite3/libsqlite/sqlite3.c         TRACE(("ALLOCATE: %d trunk - %d free pages left\n", *pPgno, n-1));
n                58482 ext/sqlite3/libsqlite/sqlite3.c         TRACE(("ALLOCATE: %d trunk - %d free pages left\n", *pPgno, n-1));
n                58529 ext/sqlite3/libsqlite/sqlite3.c                  *pPgno, closest+1, k, pTrunk->pgno, n-1));
n                58866 ext/sqlite3/libsqlite/sqlite3.c   int nSrc, n, rc;
n                58908 ext/sqlite3/libsqlite/sqlite3.c     n = nHeader + nPayload;
n                58909 ext/sqlite3/libsqlite/sqlite3.c     testcase( n==3 );
n                58910 ext/sqlite3/libsqlite/sqlite3.c     testcase( n==4 );
n                58911 ext/sqlite3/libsqlite/sqlite3.c     if( n<4 ) n = 4;
n                58912 ext/sqlite3/libsqlite/sqlite3.c     *pnSize = n;
n                58917 ext/sqlite3/libsqlite/sqlite3.c     n = mn + (nPayload - mn) % (pPage->pBt->usableSize - 4);
n                58918 ext/sqlite3/libsqlite/sqlite3.c     testcase( n==pPage->maxLocal );
n                58919 ext/sqlite3/libsqlite/sqlite3.c     testcase( n==pPage->maxLocal+1 );
n                58920 ext/sqlite3/libsqlite/sqlite3.c     if( n > pPage->maxLocal ) n = mn;
n                58921 ext/sqlite3/libsqlite/sqlite3.c     spaceLeft = n;
n                58922 ext/sqlite3/libsqlite/sqlite3.c     *pnSize = n + nHeader + 4;
n                58923 ext/sqlite3/libsqlite/sqlite3.c     pPrior = &pCell[nHeader+n];
n                59006 ext/sqlite3/libsqlite/sqlite3.c     n = nPayload;
n                59007 ext/sqlite3/libsqlite/sqlite3.c     if( n>spaceLeft ) n = spaceLeft;
n                59019 ext/sqlite3/libsqlite/sqlite3.c       if( n>nSrc ) n = nSrc;
n                59021 ext/sqlite3/libsqlite/sqlite3.c       memcpy(pPayload, pSrc, n);
n                59023 ext/sqlite3/libsqlite/sqlite3.c       memset(pPayload, 0, n);
n                59025 ext/sqlite3/libsqlite/sqlite3.c     nPayload -= n;
n                59026 ext/sqlite3/libsqlite/sqlite3.c     pPayload += n;
n                59027 ext/sqlite3/libsqlite/sqlite3.c     pSrc += n;
n                59028 ext/sqlite3/libsqlite/sqlite3.c     nSrc -= n;
n                59029 ext/sqlite3/libsqlite/sqlite3.c     spaceLeft -= n;
n                59579 ext/sqlite3/libsqlite/sqlite3.c     Pgno n;
n                59593 ext/sqlite3/libsqlite/sqlite3.c         ptrmapGet(pBt, ovfl, &e, &n);
n                59594 ext/sqlite3/libsqlite/sqlite3.c         assert( n==pPage->pgno && e==PTRMAP_OVERFLOW1 );
n                59598 ext/sqlite3/libsqlite/sqlite3.c         ptrmapGet(pBt, child, &e, &n);
n                59599 ext/sqlite3/libsqlite/sqlite3.c         assert( n==pPage->pgno && e==PTRMAP_BTREE );
n                59604 ext/sqlite3/libsqlite/sqlite3.c       ptrmapGet(pBt, child, &e, &n);
n                59605 ext/sqlite3/libsqlite/sqlite3.c       assert( n==pPage->pgno && e==PTRMAP_BTREE );
n                60818 ext/sqlite3/libsqlite/sqlite3.c     Pgno n = pCur->apPage[iCellDepth+1]->pgno;
n                60827 ext/sqlite3/libsqlite/sqlite3.c     insertCell(pPage, iCellIdx, pCell-4, nCell+4, pTmp, n, &rc);
n                61541 ext/sqlite3/libsqlite/sqlite3.c       int n = get4byte(&pOvflData[4]);
n                61547 ext/sqlite3/libsqlite/sqlite3.c       if( n>(int)pCheck->pBt->usableSize/4-2 ){
n                61552 ext/sqlite3/libsqlite/sqlite3.c         for(i=0; i<n; i++){
n                61561 ext/sqlite3/libsqlite/sqlite3.c         N -= n;
n                63141 ext/sqlite3/libsqlite/sqlite3.c   if( (p->flags & (MEM_Str|MEM_Blob)) && p->n>0 ){
n                63202 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE SQLITE_NOINLINE int sqlite3VdbeMemGrow(Mem *pMem, int n, int bPreserve){
n                63213 ext/sqlite3/libsqlite/sqlite3.c   if( pMem->szMalloc<n ){
n                63214 ext/sqlite3/libsqlite/sqlite3.c     if( n<32 ) n = 32;
n                63216 ext/sqlite3/libsqlite/sqlite3.c       pMem->z = pMem->zMalloc = sqlite3DbReallocOrFree(pMem->db, pMem->z, n);
n                63220 ext/sqlite3/libsqlite/sqlite3.c       pMem->zMalloc = sqlite3DbMallocRaw(pMem->db, n);
n                63233 ext/sqlite3/libsqlite/sqlite3.c     memcpy(pMem->zMalloc, pMem->z, pMem->n);
n                63283 ext/sqlite3/libsqlite/sqlite3.c     if( sqlite3VdbeMemGrow(pMem, pMem->n + 2, 1) ){
n                63286 ext/sqlite3/libsqlite/sqlite3.c     pMem->z[pMem->n] = 0;
n                63287 ext/sqlite3/libsqlite/sqlite3.c     pMem->z[pMem->n+1] = 0;
n                63311 ext/sqlite3/libsqlite/sqlite3.c     nByte = pMem->n + pMem->u.nZero;
n                63319 ext/sqlite3/libsqlite/sqlite3.c     memset(&pMem->z[pMem->n], 0, pMem->u.nZero);
n                63320 ext/sqlite3/libsqlite/sqlite3.c     pMem->n += pMem->u.nZero;
n                63332 ext/sqlite3/libsqlite/sqlite3.c   if( sqlite3VdbeMemGrow(pMem, pMem->n+2, 1) ){
n                63335 ext/sqlite3/libsqlite/sqlite3.c   pMem->z[pMem->n] = 0;
n                63336 ext/sqlite3/libsqlite/sqlite3.c   pMem->z[pMem->n+1] = 0;
n                63397 ext/sqlite3/libsqlite/sqlite3.c   pMem->n = sqlite3Strlen30(pMem->z);
n                63555 ext/sqlite3/libsqlite/sqlite3.c     assert( pMem->z || pMem->n==0 );
n                63556 ext/sqlite3/libsqlite/sqlite3.c     sqlite3Atoi64(pMem->z, &value, pMem->n, pMem->enc);
n                63579 ext/sqlite3/libsqlite/sqlite3.c     sqlite3AtoF(pMem->z, &val, pMem->n, pMem->enc);
n                63654 ext/sqlite3/libsqlite/sqlite3.c     if( 0==sqlite3Atoi64(pMem->z, &pMem->u.i, pMem->n, pMem->enc) ){
n                63751 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void sqlite3VdbeMemSetZeroBlob(Mem *pMem, int n){
n                63754 ext/sqlite3/libsqlite/sqlite3.c   pMem->n = 0;
n                63755 ext/sqlite3/libsqlite/sqlite3.c   if( n<0 ) n = 0;
n                63756 ext/sqlite3/libsqlite/sqlite3.c   pMem->u.nZero = n;
n                63828 ext/sqlite3/libsqlite/sqlite3.c     int n = p->n;
n                63830 ext/sqlite3/libsqlite/sqlite3.c       n += p->u.nZero;
n                63832 ext/sqlite3/libsqlite/sqlite3.c     return n>p->db->aLimit[SQLITE_LIMIT_LENGTH];
n                63939 ext/sqlite3/libsqlite/sqlite3.c   int n,              /* Bytes in string, or negative */
n                63943 ext/sqlite3/libsqlite/sqlite3.c   int nByte = n;      /* New value for pMem->n */
n                64003 ext/sqlite3/libsqlite/sqlite3.c   pMem->n = nByte;
n                64063 ext/sqlite3/libsqlite/sqlite3.c     pMem->n = (int)amt;
n                64076 ext/sqlite3/libsqlite/sqlite3.c         pMem->n = (int)amt;
n                64750 ext/sqlite3/libsqlite/sqlite3.c   int n,                /* Length of string z */
n                64755 ext/sqlite3/libsqlite/sqlite3.c   if( v ) sqlite3VdbeMemSetStr((Mem *)v, z, n, enc, xDel);
n                64775 ext/sqlite3/libsqlite/sqlite3.c       return p->n + p->u.nZero;
n                64777 ext/sqlite3/libsqlite/sqlite3.c       return p->n;
n                64826 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void sqlite3VdbeSetSql(Vdbe *p, const char *z, int n, int isPrepareV2){
n                64833 ext/sqlite3/libsqlite/sqlite3.c   p->zSql = sqlite3DbStrNDup(p->db, z, n);
n                64910 ext/sqlite3/libsqlite/sqlite3.c   static int n = 0;
n                64911 ext/sqlite3/libsqlite/sqlite3.c   n++;
n                65269 ext/sqlite3/libsqlite/sqlite3.c         int n;
n                65272 ext/sqlite3/libsqlite/sqlite3.c         n = pOp[-1].p1;
n                65273 ext/sqlite3/libsqlite/sqlite3.c         if( n>nMaxArgs ) nMaxArgs = n;
n                65597 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE void sqlite3VdbeChangeP4(Vdbe *p, int addr, const char *zP4, int n){
n                65604 ext/sqlite3/libsqlite/sqlite3.c     if( n!=P4_VTAB ){
n                65605 ext/sqlite3/libsqlite/sqlite3.c       freeP4(db, n, (void*)*(char**)&zP4);
n                65620 ext/sqlite3/libsqlite/sqlite3.c   if( n==P4_INT32 ){
n                65628 ext/sqlite3/libsqlite/sqlite3.c   }else if( n==P4_KEYINFO ){
n                65631 ext/sqlite3/libsqlite/sqlite3.c   }else if( n==P4_VTAB ){
n                65636 ext/sqlite3/libsqlite/sqlite3.c   }else if( n<0 ){
n                65638 ext/sqlite3/libsqlite/sqlite3.c     pOp->p4type = (signed char)n;
n                65640 ext/sqlite3/libsqlite/sqlite3.c     if( n==0 ) n = sqlite3Strlen30(zP4);
n                65641 ext/sqlite3/libsqlite/sqlite3.c     pOp->p4.z = sqlite3DbStrNDup(p->db, zP4, n);
n                65841 ext/sqlite3/libsqlite/sqlite3.c         int n = sqlite3Strlen30(zColl);
n                65842 ext/sqlite3/libsqlite/sqlite3.c         if( n==6 && memcmp(zColl,"BINARY",6)==0 ){
n                65844 ext/sqlite3/libsqlite/sqlite3.c           n = 1;
n                65846 ext/sqlite3/libsqlite/sqlite3.c         if( i+n>nTemp-6 ){
n                65854 ext/sqlite3/libsqlite/sqlite3.c         memcpy(&zTemp[i], zColl, n+1);
n                65855 ext/sqlite3/libsqlite/sqlite3.c         i += n;
n                66162 ext/sqlite3/libsqlite/sqlite3.c       nSub = pSub->n/sizeof(Vdbe*);
n                66205 ext/sqlite3/libsqlite/sqlite3.c       pMem->n = sqlite3Strlen30(pMem->z);
n                66224 ext/sqlite3/libsqlite/sqlite3.c           pSub->n = nSub*sizeof(SubProgram*);
n                66251 ext/sqlite3/libsqlite/sqlite3.c       pMem->n = sqlite3Strlen30(pMem->z);
n                66262 ext/sqlite3/libsqlite/sqlite3.c       pMem->n = 2;
n                66273 ext/sqlite3/libsqlite/sqlite3.c       pMem->n = displayComment(pOp, zP4, pMem->z, 500);
n                66446 ext/sqlite3/libsqlite/sqlite3.c   int n;                         /* Loop counter */
n                66525 ext/sqlite3/libsqlite/sqlite3.c     for(n=0; n<nVar; n++){
n                66526 ext/sqlite3/libsqlite/sqlite3.c       p->aVar[n].flags = MEM_Null;
n                66527 ext/sqlite3/libsqlite/sqlite3.c       p->aVar[n].db = db;
n                66538 ext/sqlite3/libsqlite/sqlite3.c     for(n=1; n<=nMem; n++){
n                66539 ext/sqlite3/libsqlite/sqlite3.c       p->aMem[n].flags = MEM_Undefined;
n                66540 ext/sqlite3/libsqlite/sqlite3.c       p->aMem[n].db = db;
n                66676 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                66681 ext/sqlite3/libsqlite/sqlite3.c   n = nResColumn*COLNAME_N;
n                66683 ext/sqlite3/libsqlite/sqlite3.c   p->aColName = pColName = (Mem*)sqlite3DbMallocZero(db, sizeof(Mem)*n );
n                66685 ext/sqlite3/libsqlite/sqlite3.c   while( n-- > 0 ){
n                67667 ext/sqlite3/libsqlite/sqlite3.c   u32 n;
n                67695 ext/sqlite3/libsqlite/sqlite3.c   assert( pMem->n>=0 );
n                67696 ext/sqlite3/libsqlite/sqlite3.c   n = (u32)pMem->n;
n                67698 ext/sqlite3/libsqlite/sqlite3.c     n += pMem->u.nZero;
n                67700 ext/sqlite3/libsqlite/sqlite3.c   return ((n*2) + 12 + ((flags&MEM_Str)!=0));
n                67806 ext/sqlite3/libsqlite/sqlite3.c     assert( pMem->n + ((pMem->flags & MEM_Zero)?pMem->u.nZero:0)
n                67808 ext/sqlite3/libsqlite/sqlite3.c     len = pMem->n;
n                67945 ext/sqlite3/libsqlite/sqlite3.c       pMem->n = (serial_type-12)/2;
n                67947 ext/sqlite3/libsqlite/sqlite3.c       return pMem->n;
n                68192 ext/sqlite3/libsqlite/sqlite3.c     return pColl->xCmp(pColl->pUser,pMem1->n,pMem1->z,pMem2->n,pMem2->z);
n                68204 ext/sqlite3/libsqlite/sqlite3.c     n1 = v1==0 ? 0 : c1.n;
n                68206 ext/sqlite3/libsqlite/sqlite3.c     n2 = v2==0 ? 0 : c2.n;
n                68221 ext/sqlite3/libsqlite/sqlite3.c   int c = memcmp(pB1->z, pB2->z, pB1->n>pB2->n ? pB2->n : pB1->n);
n                68223 ext/sqlite3/libsqlite/sqlite3.c   return pB1->n - pB2->n;
n                68481 ext/sqlite3/libsqlite/sqlite3.c         mem1.n = (serial_type - 12) / 2;
n                68482 ext/sqlite3/libsqlite/sqlite3.c         testcase( (d1+mem1.n)==(unsigned)nKey1 );
n                68483 ext/sqlite3/libsqlite/sqlite3.c         testcase( (d1+mem1.n+1)==(unsigned)nKey1 );
n                68484 ext/sqlite3/libsqlite/sqlite3.c         if( (d1+mem1.n) > (unsigned)nKey1 ){
n                68496 ext/sqlite3/libsqlite/sqlite3.c           int nCmp = MIN(mem1.n, pRhs->n);
n                68498 ext/sqlite3/libsqlite/sqlite3.c           if( rc==0 ) rc = mem1.n - pRhs->n; 
n                68517 ext/sqlite3/libsqlite/sqlite3.c           int nCmp = MIN(nStr, pRhs->n);
n                68519 ext/sqlite3/libsqlite/sqlite3.c           if( rc==0 ) rc = nStr - pRhs->n;
n                68692 ext/sqlite3/libsqlite/sqlite3.c     nCmp = MIN( pPKey2->aMem[0].n, nStr );
n                68696 ext/sqlite3/libsqlite/sqlite3.c       res = nStr - pPKey2->aMem[0].n;
n                68801 ext/sqlite3/libsqlite/sqlite3.c   testcase( szHdr==m.n );
n                68802 ext/sqlite3/libsqlite/sqlite3.c   if( unlikely(szHdr<3 || (int)szHdr>m.n) ){
n                68821 ext/sqlite3/libsqlite/sqlite3.c   testcase( (u32)m.n==szHdr+lenRowid );
n                68822 ext/sqlite3/libsqlite/sqlite3.c   if( unlikely((u32)m.n<szHdr+lenRowid) ){
n                68827 ext/sqlite3/libsqlite/sqlite3.c   sqlite3VdbeSerialGet((u8*)&m.z[m.n-lenRowid], typeRowid, &v);
n                68876 ext/sqlite3/libsqlite/sqlite3.c   *res = sqlite3VdbeRecordCompare(m.n, m.z, pUnpacked);
n                69114 ext/sqlite3/libsqlite/sqlite3.c     return p->n ? p->z : 0;
n                69204 ext/sqlite3/libsqlite/sqlite3.c   int n,                  /* Bytes in string, or negative */
n                69208 ext/sqlite3/libsqlite/sqlite3.c   if( sqlite3VdbeMemSetStr(pCtx->pOut, z, n, enc, xDel)==SQLITE_TOOBIG ){
n                69231 ext/sqlite3/libsqlite/sqlite3.c   int n, 
n                69234 ext/sqlite3/libsqlite/sqlite3.c   assert( n>=0 );
n                69236 ext/sqlite3/libsqlite/sqlite3.c   setResultStrOrError(pCtx, z, n, 0, xDel);
n                69241 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_uint64 n,
n                69246 ext/sqlite3/libsqlite/sqlite3.c   if( n>0x7fffffff ){
n                69249 ext/sqlite3/libsqlite/sqlite3.c     setResultStrOrError(pCtx, z, (int)n, 0, xDel);
n                69256 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void SQLITE_STDCALL sqlite3_result_error(sqlite3_context *pCtx, const char *z, int n){
n                69260 ext/sqlite3/libsqlite/sqlite3.c   sqlite3VdbeMemSetStr(pCtx->pOut, z, n, SQLITE_UTF8, SQLITE_TRANSIENT);
n                69263 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void SQLITE_STDCALL sqlite3_result_error16(sqlite3_context *pCtx, const void *z, int n){
n                69267 ext/sqlite3/libsqlite/sqlite3.c   sqlite3VdbeMemSetStr(pCtx->pOut, z, n, SQLITE_UTF16NATIVE, SQLITE_TRANSIENT);
n                69285 ext/sqlite3/libsqlite/sqlite3.c   int n,
n                69289 ext/sqlite3/libsqlite/sqlite3.c   setResultStrOrError(pCtx, z, n, SQLITE_UTF8, xDel);
n                69294 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_uint64 n,
n                69301 ext/sqlite3/libsqlite/sqlite3.c   if( n>0x7fffffff ){
n                69304 ext/sqlite3/libsqlite/sqlite3.c     setResultStrOrError(pCtx, z, (int)n, enc, xDel);
n                69311 ext/sqlite3/libsqlite/sqlite3.c   int n, 
n                69315 ext/sqlite3/libsqlite/sqlite3.c   setResultStrOrError(pCtx, z, n, SQLITE_UTF16NATIVE, xDel);
n                69320 ext/sqlite3/libsqlite/sqlite3.c   int n, 
n                69324 ext/sqlite3/libsqlite/sqlite3.c   setResultStrOrError(pCtx, z, n, SQLITE_UTF16BE, xDel);
n                69329 ext/sqlite3/libsqlite/sqlite3.c   int n, 
n                69333 ext/sqlite3/libsqlite/sqlite3.c   setResultStrOrError(pCtx, z, n, SQLITE_UTF16LE, xDel);
n                69340 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API void SQLITE_STDCALL sqlite3_result_zeroblob(sqlite3_context *pCtx, int n){
n                69342 ext/sqlite3/libsqlite/sqlite3.c   sqlite3VdbeMemSetZeroBlob(pCtx->pOut, n);
n                69774 ext/sqlite3/libsqlite/sqlite3.c   return p->pMem->n;
n                69978 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                69990 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3_column_count(pStmt);
n                69991 ext/sqlite3/libsqlite/sqlite3.c   if( N<n && N>=0 ){
n                69992 ext/sqlite3/libsqlite/sqlite3.c     N += useType*n;
n                70299 ext/sqlite3/libsqlite/sqlite3.c         rc = sqlite3_bind_blob(pStmt, i, pValue->z, pValue->n,SQLITE_TRANSIENT);
n                70304 ext/sqlite3/libsqlite/sqlite3.c       rc = bindText(pStmt,i,  pValue->z, pValue->n, SQLITE_TRANSIENT,
n                70315 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API int SQLITE_STDCALL sqlite3_bind_zeroblob(sqlite3_stmt *pStmt, int i, int n){
n                70320 ext/sqlite3/libsqlite/sqlite3.c     sqlite3VdbeMemSetZeroBlob(&p->aVar[i-1], n);
n                70586 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                70590 ext/sqlite3/libsqlite/sqlite3.c     n = sqlite3GetToken((u8*)zSql, &tokenType);
n                70591 ext/sqlite3/libsqlite/sqlite3.c     assert( n>0 && tokenType!=TK_ILLEGAL );
n                70593 ext/sqlite3/libsqlite/sqlite3.c       *pnToken = n;
n                70596 ext/sqlite3/libsqlite/sqlite3.c     nTotal += n;
n                70597 ext/sqlite3/libsqlite/sqlite3.c     zSql += n;
n                70633 ext/sqlite3/libsqlite/sqlite3.c   int n;                   /* Length of a token prefix */
n                70655 ext/sqlite3/libsqlite/sqlite3.c       n = findNextHostParameter(zRawSql, &nToken);
n                70656 ext/sqlite3/libsqlite/sqlite3.c       assert( n>0 );
n                70657 ext/sqlite3/libsqlite/sqlite3.c       sqlite3StrAccumAppend(&out, zRawSql, n);
n                70658 ext/sqlite3/libsqlite/sqlite3.c       zRawSql += n;
n                70696 ext/sqlite3/libsqlite/sqlite3.c           sqlite3VdbeMemSetStr(&utf8, pVar->z, pVar->n, enc, SQLITE_STATIC);
n                70701 ext/sqlite3/libsqlite/sqlite3.c         nOut = pVar->n;
n                70705 ext/sqlite3/libsqlite/sqlite3.c           while( nOut<pVar->n && (pVar->z[nOut]&0xc0)==0x80 ){ nOut++; }
n                70710 ext/sqlite3/libsqlite/sqlite3.c         if( nOut<pVar->n ){
n                70711 ext/sqlite3/libsqlite/sqlite3.c           sqlite3XPrintf(&out, 0, "/*+%d bytes*/", pVar->n-nOut);
n                70723 ext/sqlite3/libsqlite/sqlite3.c         nOut = pVar->n;
n                70732 ext/sqlite3/libsqlite/sqlite3.c         if( nOut<pVar->n ){
n                70733 ext/sqlite3/libsqlite/sqlite3.c           sqlite3XPrintf(&out, 0, "/*+%d bytes*/", pVar->n-nOut);
n                70826 ext/sqlite3/libsqlite/sqlite3.c   if( (p->flags & (MEM_Str|MEM_Blob))!=0 && p->n>sqlite3_max_blobsize ){
n                70827 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_max_blobsize = p->n;
n                70990 ext/sqlite3/libsqlite/sqlite3.c   if( sqlite3AtoF(pRec->z, &rValue, pRec->n, enc)==0 ) return;
n                70991 ext/sqlite3/libsqlite/sqlite3.c   if( 0==sqlite3Atoi64(pRec->z, &iValue, pRec->n, enc) ){
n                71083 ext/sqlite3/libsqlite/sqlite3.c   if( sqlite3AtoF(pMem->z, &pMem->u.r, pMem->n, pMem->enc)==0 ){
n                71086 ext/sqlite3/libsqlite/sqlite3.c   if( sqlite3Atoi64(pMem->z, &pMem->u.i, pMem->n, pMem->enc)==SQLITE_OK ){
n                71138 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_snprintf(100, zCsr, "%d[", pMem->n);
n                71140 ext/sqlite3/libsqlite/sqlite3.c     for(i=0; i<16 && i<pMem->n; i++){
n                71144 ext/sqlite3/libsqlite/sqlite3.c     for(i=0; i<16 && i<pMem->n; i++){
n                71173 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_snprintf(100, &zBuf[k], "%d", pMem->n);
n                71176 ext/sqlite3/libsqlite/sqlite3.c     for(j=0; j<15 && j<pMem->n; j++){
n                71342 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                71344 ext/sqlite3/libsqlite/sqlite3.c   for(p=db->pSavepoint; p; p=p->pNext) n++;
n                71345 ext/sqlite3/libsqlite/sqlite3.c   assert( n==(db->nSavepoint + db->isTransactionSavepoint) );
n                71892 ext/sqlite3/libsqlite/sqlite3.c     pOp->p1 = pOut->n;
n                71916 ext/sqlite3/libsqlite/sqlite3.c   pOut->n = pOp->p1;
n                72021 ext/sqlite3/libsqlite/sqlite3.c   int n;           /* Number of registers left to copy */
n                72025 ext/sqlite3/libsqlite/sqlite3.c   n = pOp->p3;
n                72028 ext/sqlite3/libsqlite/sqlite3.c   assert( n>0 && p1>0 && p2>0 );
n                72029 ext/sqlite3/libsqlite/sqlite3.c   assert( p1+n<=p2 || p2+n<=p1 );
n                72048 ext/sqlite3/libsqlite/sqlite3.c   }while( --n );
n                72061 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                72063 ext/sqlite3/libsqlite/sqlite3.c   n = pOp->p3;
n                72073 ext/sqlite3/libsqlite/sqlite3.c     REGISTER_TRACE(pOp->p2+pOp->p3-n, pOut);
n                72074 ext/sqlite3/libsqlite/sqlite3.c     if( (n--)==0 ) break;
n                72215 ext/sqlite3/libsqlite/sqlite3.c   nByte = pIn1->n + pIn2->n;
n                72224 ext/sqlite3/libsqlite/sqlite3.c     memcpy(pOut->z, pIn2->z, pIn2->n);
n                72226 ext/sqlite3/libsqlite/sqlite3.c   memcpy(&pOut->z[pIn2->n], pIn1->z, pIn1->n);
n                72230 ext/sqlite3/libsqlite/sqlite3.c   pOut->n = (int)nByte;
n                72408 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                72410 ext/sqlite3/libsqlite/sqlite3.c   n = pOp->p5;
n                72412 ext/sqlite3/libsqlite/sqlite3.c   assert( apVal || n==0 );
n                72417 ext/sqlite3/libsqlite/sqlite3.c   assert( n==0 || (pOp->p2>0 && pOp->p2+n<=(p->nMem-p->nCursor)+1) );
n                72418 ext/sqlite3/libsqlite/sqlite3.c   assert( pOp->p3<pOp->p2 || pOp->p3>=pOp->p2+n );
n                72420 ext/sqlite3/libsqlite/sqlite3.c   for(i=0; i<n; i++, pArg++){
n                72434 ext/sqlite3/libsqlite/sqlite3.c   (*ctx.pFunc->xFunc)(&ctx, n, apVal); /* IMP: R-24505-23230 */
n                72868 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                72878 ext/sqlite3/libsqlite/sqlite3.c   n = pOp->p3;
n                72880 ext/sqlite3/libsqlite/sqlite3.c   assert( n>0 );
n                72887 ext/sqlite3/libsqlite/sqlite3.c     for(k=0; k<n; k++) if( aPermute[k]>mx ) mx = aPermute[k];
n                72891 ext/sqlite3/libsqlite/sqlite3.c     assert( p1>0 && p1+n<=(p->nMem-p->nCursor)+1 );
n                72892 ext/sqlite3/libsqlite/sqlite3.c     assert( p2>0 && p2+n<=(p->nMem-p->nCursor)+1 );
n                72895 ext/sqlite3/libsqlite/sqlite3.c   for(i=0; i<n; i++){
n                73175 ext/sqlite3/libsqlite/sqlite3.c         pC->payloadSize = pC->szRow = avail = pReg->n;
n                73376 ext/sqlite3/libsqlite/sqlite3.c     len = pDest->n;
n                73561 ext/sqlite3/libsqlite/sqlite3.c   pOut->n = (int)nByte;
n                74718 ext/sqlite3/libsqlite/sqlite3.c     sqlite3VdbeRecordUnpack(pC->pKeyInfo, pIn3->n, pIn3->z, pIdxKey);
n                75036 ext/sqlite3/libsqlite/sqlite3.c     pData->n = 0;
n                75047 ext/sqlite3/libsqlite/sqlite3.c                           pData->z, pData->n, nZero,
n                75213 ext/sqlite3/libsqlite/sqlite3.c   u32 n;
n                75252 ext/sqlite3/libsqlite/sqlite3.c     n = (u32)n64;
n                75254 ext/sqlite3/libsqlite/sqlite3.c     VVA_ONLY(rc =) sqlite3BtreeDataSize(pCrsr, &n);
n                75256 ext/sqlite3/libsqlite/sqlite3.c     if( n>(u32)db->aLimit[SQLITE_LIMIT_LENGTH] ){
n                75260 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==0 );
n                75261 ext/sqlite3/libsqlite/sqlite3.c   if( sqlite3VdbeMemClearAndResize(pOut, MAX(n,32)) ){
n                75264 ext/sqlite3/libsqlite/sqlite3.c   pOut->n = n;
n                75267 ext/sqlite3/libsqlite/sqlite3.c     rc = sqlite3BtreeKey(pCrsr, 0, n, pOut->z);
n                75269 ext/sqlite3/libsqlite/sqlite3.c     rc = sqlite3BtreeData(pCrsr, 0, n, pOut->z);
n                75608 ext/sqlite3/libsqlite/sqlite3.c       nKey = pIn2->n;
n                76542 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                76550 ext/sqlite3/libsqlite/sqlite3.c   n = pOp->p5;
n                76551 ext/sqlite3/libsqlite/sqlite3.c   assert( n>=0 );
n                76554 ext/sqlite3/libsqlite/sqlite3.c   assert( apVal || n==0 );
n                76555 ext/sqlite3/libsqlite/sqlite3.c   for(i=0; i<n; i++, pRec++){
n                76563 ext/sqlite3/libsqlite/sqlite3.c   pMem->n++;
n                76570 ext/sqlite3/libsqlite/sqlite3.c   (ctx.pFunc->xStep)(&ctx, n, apVal); /* IMP: R-24505-23230 */
n                76750 ext/sqlite3/libsqlite/sqlite3.c   pOut->n = sqlite3Strlen30(pOut->z);
n                77789 ext/sqlite3/libsqlite/sqlite3.c   int n, 
n                77803 ext/sqlite3/libsqlite/sqlite3.c   if( n<0 || iOffset<0 || ((sqlite3_int64)iOffset+n)>p->nByte ){
n                77817 ext/sqlite3/libsqlite/sqlite3.c     rc = xCall(p->pCsr, iOffset+p->iOffset, n, z);
n                77835 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API int SQLITE_STDCALL sqlite3_blob_read(sqlite3_blob *pBlob, void *z, int n, int iOffset){
n                77836 ext/sqlite3/libsqlite/sqlite3.c   return blobReadWrite(pBlob, z, n, iOffset, sqlite3BtreeData);
n                77842 ext/sqlite3/libsqlite/sqlite3.c SQLITE_API int SQLITE_STDCALL sqlite3_blob_write(sqlite3_blob *pBlob, const void *z, int n, int iOffset){
n                77843 ext/sqlite3/libsqlite/sqlite3.c   return blobReadWrite(pBlob, (void *)z, n, iOffset, sqlite3BtreePutData);
n                79689 ext/sqlite3/libsqlite/sqlite3.c   nReq = pVal->n + sizeof(SorterRecord);
n                79690 ext/sqlite3/libsqlite/sqlite3.c   nPMA = pVal->n + sqlite3VarintLen(pVal->n);
n                79743 ext/sqlite3/libsqlite/sqlite3.c   memcpy(SRVAL(pNew), pVal->z, pVal->n);
n                79744 ext/sqlite3/libsqlite/sqlite3.c   pNew->nVal = pVal->n;
n                80568 ext/sqlite3/libsqlite/sqlite3.c   pOut->n = nKey;
n                80621 ext/sqlite3/libsqlite/sqlite3.c   *pRes = sqlite3VdbeRecordCompare(pVal->n, pVal->z, r2);
n                81327 ext/sqlite3/libsqlite/sqlite3.c   if( pExpr->op==TK_AGG_FUNCTION ) pExpr->op2 += pWalker->u.n;
n                81335 ext/sqlite3/libsqlite/sqlite3.c     w.u.n = N;
n                81463 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                81464 ext/sqlite3/libsqlite/sqlite3.c   for(n=0; ALWAYS(zSpan[n]) && zSpan[n]!='.'; n++){}
n                81465 ext/sqlite3/libsqlite/sqlite3.c   if( zDb && (sqlite3StrNICmp(zSpan, zDb, n)!=0 || zDb[n]!=0) ){
n                81468 ext/sqlite3/libsqlite/sqlite3.c   zSpan += n+1;
n                81469 ext/sqlite3/libsqlite/sqlite3.c   for(n=0; ALWAYS(zSpan[n]) && zSpan[n]!='.'; n++){}
n                81470 ext/sqlite3/libsqlite/sqlite3.c   if( zTab && (sqlite3StrNICmp(zSpan, zTab, n)!=0 || zTab[n]!=0) ){
n                81473 ext/sqlite3/libsqlite/sqlite3.c   zSpan += n+1;
n                81786 ext/sqlite3/libsqlite/sqlite3.c     int n = pExpr->iColumn;
n                81787 ext/sqlite3/libsqlite/sqlite3.c     testcase( n==BMS-1 );
n                81788 ext/sqlite3/libsqlite/sqlite3.c     if( n>=BMS ){
n                81789 ext/sqlite3/libsqlite/sqlite3.c       n = BMS-1;
n                81792 ext/sqlite3/libsqlite/sqlite3.c     pMatch->colUsed |= ((Bitmask)1)<<n;
n                81978 ext/sqlite3/libsqlite/sqlite3.c       int n = pList ? pList->nExpr : 0;    /* Number of arguments */
n                81992 ext/sqlite3/libsqlite/sqlite3.c       pDef = sqlite3FindFunction(pParse->db, zId, nId, n, enc, 0);
n                82004 ext/sqlite3/libsqlite/sqlite3.c           if( n==2 ){
n                82878 ext/sqlite3/libsqlite/sqlite3.c   if( pCollName->n>0 ){
n                82892 ext/sqlite3/libsqlite/sqlite3.c   s.n = sqlite3Strlen30(s.z);
n                83263 ext/sqlite3/libsqlite/sqlite3.c       nExtra = pToken->n+1;
n                83278 ext/sqlite3/libsqlite/sqlite3.c         assert( pToken->z!=0 || pToken->n==0 );
n                83279 ext/sqlite3/libsqlite/sqlite3.c         if( pToken->n ) memcpy(pNew->u.zToken, pToken->z, pToken->n);
n                83280 ext/sqlite3/libsqlite/sqlite3.c         pNew->u.zToken[pToken->n] = 0;
n                83306 ext/sqlite3/libsqlite/sqlite3.c   x.n = zToken ? sqlite3Strlen30(zToken) : 0;
n                83468 ext/sqlite3/libsqlite/sqlite3.c     u32 n = sqlite3Strlen30(z);
n                83473 ext/sqlite3/libsqlite/sqlite3.c       int bOk = 0==sqlite3Atoi64(&z[1], &i, n-1, SQLITE_UTF8);
n                83512 ext/sqlite3/libsqlite/sqlite3.c         pParse->azVar[x-1] = sqlite3DbStrNDup(db, z, n);
n                83984 ext/sqlite3/libsqlite/sqlite3.c     pItem->zName = sqlite3DbStrNDup(pParse->db, pName->z, pName->n);
n                85453 ext/sqlite3/libsqlite/sqlite3.c       int n;
n                85460 ext/sqlite3/libsqlite/sqlite3.c       n = sqlite3Strlen30(z) - 1;
n                85461 ext/sqlite3/libsqlite/sqlite3.c       assert( z[n]=='\'' );
n                85462 ext/sqlite3/libsqlite/sqlite3.c       zBlob = sqlite3HexToBlob(sqlite3VdbeDb(v), z, n);
n                85463 ext/sqlite3/libsqlite/sqlite3.c       sqlite3VdbeAddOp4(v, OP_Blob, n/2, target, 0, zBlob, P4_DYNAMIC);
n                86398 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                86403 ext/sqlite3/libsqlite/sqlite3.c   n = pList->nExpr;
n                86405 ext/sqlite3/libsqlite/sqlite3.c   for(pItem=pList->a, i=0; i<n; i++, pItem++){
n                86426 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                87041 ext/sqlite3/libsqlite/sqlite3.c                 int j, n;
n                87044 ext/sqlite3/libsqlite/sqlite3.c                 n = pGB->nExpr;
n                87045 ext/sqlite3/libsqlite/sqlite3.c                 for(j=0; j<n; j++, pTerm++){
n                87198 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                87200 ext/sqlite3/libsqlite/sqlite3.c   n = pParse->nRangeReg;
n                87201 ext/sqlite3/libsqlite/sqlite3.c   if( nReg<=n ){
n                87202 ext/sqlite3/libsqlite/sqlite3.c     assert( !usedAsColumnCache(pParse, i, i+n-1) );
n                87295 ext/sqlite3/libsqlite/sqlite3.c       tname.n = len;
n                87308 ext/sqlite3/libsqlite/sqlite3.c        zSql, zTableName, tname.z+tname.n);
n                87342 ext/sqlite3/libsqlite/sqlite3.c   int n;                          /* Length of token z */
n                87347 ext/sqlite3/libsqlite/sqlite3.c   for(z=zInput; *z; z=z+n){
n                87348 ext/sqlite3/libsqlite/sqlite3.c     n = sqlite3GetToken(z, &token);
n                87352 ext/sqlite3/libsqlite/sqlite3.c         z += n;
n                87353 ext/sqlite3/libsqlite/sqlite3.c         n = sqlite3GetToken(z, &token);
n                87357 ext/sqlite3/libsqlite/sqlite3.c       zParent = sqlite3DbStrNDup(db, (const char *)z, n);
n                87366 ext/sqlite3/libsqlite/sqlite3.c         zInput = &z[n];
n                87419 ext/sqlite3/libsqlite/sqlite3.c       tname.n = len;
n                87449 ext/sqlite3/libsqlite/sqlite3.c        zSql, zTableName, tname.z+tname.n);
n                87936 ext/sqlite3/libsqlite/sqlite3.c   zCol = sqlite3DbStrNDup(db, (char*)pColDef->z, pColDef->n);
n                87938 ext/sqlite3/libsqlite/sqlite3.c     char *zEnd = &zCol[pColDef->n-1];
n                88374 ext/sqlite3/libsqlite/sqlite3.c static void sampleSetRowid(sqlite3 *db, Stat4Sample *p, int n, const u8 *pData){
n                88377 ext/sqlite3/libsqlite/sqlite3.c   p->u.aRowid = sqlite3DbMallocRaw(db, n);
n                88379 ext/sqlite3/libsqlite/sqlite3.c     p->nRowid = n;
n                88380 ext/sqlite3/libsqlite/sqlite3.c     memcpy(p->u.aRowid, pData, n);
n                88464 ext/sqlite3/libsqlite/sqlite3.c   int n;                          /* Bytes of space to allocate */
n                88480 ext/sqlite3/libsqlite/sqlite3.c   n = sizeof(*p) 
n                88490 ext/sqlite3/libsqlite/sqlite3.c   p = sqlite3DbMallocZero(db, n);
n                88523 ext/sqlite3/libsqlite/sqlite3.c     assert( (pSpace - (u8*)p)==n );
n                89435 ext/sqlite3/libsqlite/sqlite3.c   }else if( pName2->n==0 ){
n                89831 ext/sqlite3/libsqlite/sqlite3.c     pSample->n = sqlite3_column_bytes(pStmt, 4);
n                89832 ext/sqlite3/libsqlite/sqlite3.c     pSample->p = sqlite3DbMallocZero(db, pSample->n + 2);
n                89837 ext/sqlite3/libsqlite/sqlite3.c     memcpy(pSample->p, sqlite3_column_blob(pStmt, 4), pSample->n);
n                91484 ext/sqlite3/libsqlite/sqlite3.c     zName = sqlite3DbStrNDup(db, (char*)pName->z, pName->n);
n                91515 ext/sqlite3/libsqlite/sqlite3.c     int n = sqlite3Strlen30(zName);
n                91517 ext/sqlite3/libsqlite/sqlite3.c       if( (!OMIT_TEMPDB || i!=1 ) && n==sqlite3Strlen30(pDb->zName) && 
n                91566 ext/sqlite3/libsqlite/sqlite3.c   if( ALWAYS(pName2!=0) && pName2->n>0 ){
n                91674 ext/sqlite3/libsqlite/sqlite3.c   if( !OMIT_TEMPDB && isTemp && pName2->n>0 && iDb!=1 ){
n                92162 ext/sqlite3/libsqlite/sqlite3.c     if( pParse->constraintName.n ){
n                92278 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                92279 ext/sqlite3/libsqlite/sqlite3.c   for(n=0; *z; n++, z++){
n                92280 ext/sqlite3/libsqlite/sqlite3.c     if( *z=='"' ){ n++; }
n                92282 ext/sqlite3/libsqlite/sqlite3.c   return n + 2;
n                92327 ext/sqlite3/libsqlite/sqlite3.c   int i, k, n;
n                92331 ext/sqlite3/libsqlite/sqlite3.c   n = 0;
n                92333 ext/sqlite3/libsqlite/sqlite3.c     n += identLength(pCol->zName) + 5;
n                92335 ext/sqlite3/libsqlite/sqlite3.c   n += identLength(p->zName);
n                92336 ext/sqlite3/libsqlite/sqlite3.c   if( n<50 ){ 
n                92345 ext/sqlite3/libsqlite/sqlite3.c   n += 35 + 6*p->nCol;
n                92346 ext/sqlite3/libsqlite/sqlite3.c   zStmt = sqlite3DbMallocRaw(0, n);
n                92351 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_snprintf(n, zStmt, "CREATE TABLE ");
n                92366 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_snprintf(n-k, &zStmt[k], zSep);
n                92384 ext/sqlite3/libsqlite/sqlite3.c     assert( k<=n );
n                92386 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_snprintf(n-k, &zStmt[k], "%s", zEnd);
n                92550 ext/sqlite3/libsqlite/sqlite3.c     int n;
n                92552 ext/sqlite3/libsqlite/sqlite3.c     for(i=n=0; i<nPk; i++){
n                92553 ext/sqlite3/libsqlite/sqlite3.c       if( !hasColumn(pIdx->aiColumn, pIdx->nKeyCol, pPk->aiColumn[i]) ) n++;
n                92555 ext/sqlite3/libsqlite/sqlite3.c     if( n==0 ){
n                92560 ext/sqlite3/libsqlite/sqlite3.c     if( resizeIndexObject(db, pIdx, pIdx->nKeyCol+n) ) return;
n                92568 ext/sqlite3/libsqlite/sqlite3.c     assert( pIdx->nColumn>=pIdx->nKeyCol+n );
n                92679 ext/sqlite3/libsqlite/sqlite3.c     int n;
n                92746 ext/sqlite3/libsqlite/sqlite3.c       n = (int)(pEnd2->z - pParse->sNameToken.z);
n                92747 ext/sqlite3/libsqlite/sqlite3.c       if( pEnd2->z[0]!=';' ) n += pEnd2->n;
n                92749 ext/sqlite3/libsqlite/sqlite3.c           "CREATE %s %.*s", zType2, n, pParse->sNameToken.z
n                92838 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                92884 ext/sqlite3/libsqlite/sqlite3.c     sEnd.z += sEnd.n;
n                92886 ext/sqlite3/libsqlite/sqlite3.c   sEnd.n = 0;
n                92887 ext/sqlite3/libsqlite/sqlite3.c   n = (int)(sEnd.z - pBegin->z);
n                92889 ext/sqlite3/libsqlite/sqlite3.c   while( ALWAYS(n>0) && sqlite3Isspace(z[n-1]) ){ n--; }
n                92890 ext/sqlite3/libsqlite/sqlite3.c   sEnd.z = &z[n-1];
n                92891 ext/sqlite3/libsqlite/sqlite3.c   sEnd.n = 1;
n                92909 ext/sqlite3/libsqlite/sqlite3.c   int n;            /* Temporarily holds the number of cursors assigned */
n                92960 ext/sqlite3/libsqlite/sqlite3.c     n = pParse->nTab;
n                92973 ext/sqlite3/libsqlite/sqlite3.c     pParse->nTab = n;
n                93398 ext/sqlite3/libsqlite/sqlite3.c   nByte = sizeof(*pFKey) + (nCol-1)*sizeof(pFKey->aCol[0]) + pTo->n + 1;
n                93412 ext/sqlite3/libsqlite/sqlite3.c   memcpy(z, pTo->z, pTo->n);
n                93413 ext/sqlite3/libsqlite/sqlite3.c   z[pTo->n] = 0;
n                93415 ext/sqlite3/libsqlite/sqlite3.c   z += pTo->n+1;
n                93438 ext/sqlite3/libsqlite/sqlite3.c       int n = sqlite3Strlen30(pToCol->a[i].zName);
n                93440 ext/sqlite3/libsqlite/sqlite3.c       memcpy(z, pToCol->a[i].zName, n);
n                93441 ext/sqlite3/libsqlite/sqlite3.c       z[n] = 0;
n                93442 ext/sqlite3/libsqlite/sqlite3.c       z += n+1;
n                93693 ext/sqlite3/libsqlite/sqlite3.c       if( pName2->n==0 && pTab && pTab->pSchema==db->aDb[1].pSchema ){
n                93784 ext/sqlite3/libsqlite/sqlite3.c     int n;
n                93786 ext/sqlite3/libsqlite/sqlite3.c     for(pLoop=pTab->pIndex, n=1; pLoop; pLoop=pLoop->pNext, n++){}
n                93787 ext/sqlite3/libsqlite/sqlite3.c     zName = sqlite3MPrintf(db, "sqlite_autoindex_%s_%d", pTab->zName, n);
n                94047 ext/sqlite3/libsqlite/sqlite3.c       int n = (int)(pParse->sLastToken.z - pName->z) + pParse->sLastToken.n;
n                94048 ext/sqlite3/libsqlite/sqlite3.c       if( pName->z[n-1]==';' ) n--;
n                94051 ext/sqlite3/libsqlite/sqlite3.c         onError==OE_None ? "" : " UNIQUE", n, pName->z);
n                94250 ext/sqlite3/libsqlite/sqlite3.c   int n = *pnEntry;
n                94251 ext/sqlite3/libsqlite/sqlite3.c   if( (n & (n-1))==0 ){
n                94252 ext/sqlite3/libsqlite/sqlite3.c     int sz = (n==0) ? 1 : 2*n;
n                94261 ext/sqlite3/libsqlite/sqlite3.c   memset(&z[n * szEntry], 0, szEntry);
n                94262 ext/sqlite3/libsqlite/sqlite3.c   *pIdx = n;
n                94531 ext/sqlite3/libsqlite/sqlite3.c   if( pAlias->n ){
n                94556 ext/sqlite3/libsqlite/sqlite3.c     if( pIndexedBy->n==1 && !pIndexedBy->z ){
n                96658 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                96667 ext/sqlite3/libsqlite/sqlite3.c     n = str.nChar;
n                96668 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_result_text(context, sqlite3StrAccumFinish(&str), n,
n                96781 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                96787 ext/sqlite3/libsqlite/sqlite3.c     n = sqlite3_value_int(argv[1]);
n                96788 ext/sqlite3/libsqlite/sqlite3.c     if( n>30 ) n = 30;
n                96789 ext/sqlite3/libsqlite/sqlite3.c     if( n<0 ) n = 0;
n                96797 ext/sqlite3/libsqlite/sqlite3.c   if( n==0 && r>=0 && r<LARGEST_INT64-1 ){
n                96799 ext/sqlite3/libsqlite/sqlite3.c   }else if( n==0 && r<0 && (-r)<LARGEST_INT64-1 ){
n                96802 ext/sqlite3/libsqlite/sqlite3.c     zBuf = sqlite3_mprintf("%.*f",n,r);
n                96845 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                96848 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3_value_bytes(argv[0]);
n                96852 ext/sqlite3/libsqlite/sqlite3.c     z1 = contextMalloc(context, ((i64)n)+1);
n                96854 ext/sqlite3/libsqlite/sqlite3.c       for(i=0; i<n; i++){
n                96857 ext/sqlite3/libsqlite/sqlite3.c       sqlite3_result_text(context, z1, n, sqlite3_free);
n                96864 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                96867 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3_value_bytes(argv[0]);
n                96871 ext/sqlite3/libsqlite/sqlite3.c     z1 = contextMalloc(context, ((i64)n)+1);
n                96873 ext/sqlite3/libsqlite/sqlite3.c       for(i=0; i<n; i++){
n                96876 ext/sqlite3/libsqlite/sqlite3.c       sqlite3_result_text(context, z1, n, sqlite3_free);
n                96925 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                96929 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3_value_int(argv[0]);
n                96930 ext/sqlite3/libsqlite/sqlite3.c   if( n<1 ){
n                96931 ext/sqlite3/libsqlite/sqlite3.c     n = 1;
n                96933 ext/sqlite3/libsqlite/sqlite3.c   p = contextMalloc(context, n);
n                96935 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_randomness(n, p);
n                96936 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_result_blob(context, (char*)p, n, sqlite3_free);
n                97361 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                97367 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3_value_int(argv[0]);
n                97368 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_result_text(context, sqlite3_compileoption_get(n), -1, SQLITE_STATIC);
n                97429 ext/sqlite3/libsqlite/sqlite3.c       u64 n;
n                97434 ext/sqlite3/libsqlite/sqlite3.c       for(i=0, n=0; zArg[i]; i++){ if( zArg[i]=='\'' ) n++; }
n                97435 ext/sqlite3/libsqlite/sqlite3.c       z = contextMalloc(context, ((i64)i)+((i64)n)+3);
n                97523 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                97529 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3_value_bytes(argv[0]);
n                97531 ext/sqlite3/libsqlite/sqlite3.c   z = zHex = contextMalloc(context, ((i64)n)*2 + 1);
n                97533 ext/sqlite3/libsqlite/sqlite3.c     for(i=0; i<n; i++, pBlob++){
n                97539 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_result_text(context, zHex, n*2, sqlite3_free);
n                97551 ext/sqlite3/libsqlite/sqlite3.c   i64 n;
n                97555 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3_value_int64(argv[0]);
n                97556 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==db->aLimit[SQLITE_LIMIT_LENGTH] );
n                97557 ext/sqlite3/libsqlite/sqlite3.c   testcase( n==db->aLimit[SQLITE_LIMIT_LENGTH]+1 );
n                97558 ext/sqlite3/libsqlite/sqlite3.c   if( n>db->aLimit[SQLITE_LIMIT_LENGTH] ){
n                97561 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_result_zeroblob(context, (int)n); /* IMP: R-00293-64994 */
n                97896 ext/sqlite3/libsqlite/sqlite3.c   i64 n;
n                97906 ext/sqlite3/libsqlite/sqlite3.c     p->n++;
n                97914 ext/sqlite3/libsqlite/sqlite3.c   assert( argc==1 || p==0 || p->n>0x7fffffff
n                97915 ext/sqlite3/libsqlite/sqlite3.c           || p->n==sqlite3_aggregate_count(context) );
n                97921 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_result_int64(context, p ? p->n : 0);
n                99418 ext/sqlite3/libsqlite/sqlite3.c       tToCol.n = sqlite3Strlen30(tToCol.z);
n                99419 ext/sqlite3/libsqlite/sqlite3.c       tFromCol.n = sqlite3Strlen30(tFromCol.z);
n                99484 ext/sqlite3/libsqlite/sqlite3.c       tFrom.n = nFrom;
n                99712 ext/sqlite3/libsqlite/sqlite3.c     int n;
n                99720 ext/sqlite3/libsqlite/sqlite3.c     for(n=0; n<pIdx->nColumn; n++){
n                99721 ext/sqlite3/libsqlite/sqlite3.c       i16 x = pIdx->aiColumn[n];
n                99722 ext/sqlite3/libsqlite/sqlite3.c       pIdx->zColAff[n] = x<0 ? SQLITE_AFF_INTEGER : pTab->aCol[x].affinity;
n                99724 ext/sqlite3/libsqlite/sqlite3.c     pIdx->zColAff[n] = 0;
n                101892 ext/sqlite3/libsqlite/sqlite3.c   int  (*bind_blob)(sqlite3_stmt*,int,const void*,int n,void(*)(void*));
n                101900 ext/sqlite3/libsqlite/sqlite3.c   int  (*bind_text)(sqlite3_stmt*,int,const char*,int n,void(*)(void*));
n                103052 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                103059 ext/sqlite3/libsqlite/sqlite3.c       n++;
n                103064 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                103640 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                103644 ext/sqlite3/libsqlite/sqlite3.c   n = sqlite3Strlen30(z);
n                103646 ext/sqlite3/libsqlite/sqlite3.c     if( iLength[i]==n && sqlite3StrNICmp(&zText[iOffset[i]],z,n)==0 ){
n                103777 ext/sqlite3/libsqlite/sqlite3.c     int n = db->nDb;
n                103784 ext/sqlite3/libsqlite/sqlite3.c     while( (n--) > 0 ){
n                103902 ext/sqlite3/libsqlite/sqlite3.c   zDb = pId2->n>0 ? pDb->zName : 0;
n                104069 ext/sqlite3/libsqlite/sqlite3.c     if( pId2->n==0 && b>=0 ){
n                104121 ext/sqlite3/libsqlite/sqlite3.c     if( pId2->n==0 && eMode==PAGER_LOCKINGMODE_QUERY ){
n                104129 ext/sqlite3/libsqlite/sqlite3.c       if( pId2->n==0 ){
n                104180 ext/sqlite3/libsqlite/sqlite3.c       int n = sqlite3Strlen30(zRight);
n                104182 ext/sqlite3/libsqlite/sqlite3.c         if( sqlite3StrNICmp(zRight, zMode, n)==0 ) break;
n                104190 ext/sqlite3/libsqlite/sqlite3.c     if( eMode==PAGER_JOURNALMODE_QUERY && pId2->n==0 ){
n                104193 ext/sqlite3/libsqlite/sqlite3.c       pId2->n = 1;
n                104196 ext/sqlite3/libsqlite/sqlite3.c       if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
n                104345 ext/sqlite3/libsqlite/sqlite3.c       if( pId2->n==0 ) db->szMmap = sz;
n                104347 ext/sqlite3/libsqlite/sqlite3.c         if( db->aDb[ii].pBt && (ii==iDb || pId2->n==0) ){
n                106683 ext/sqlite3/libsqlite/sqlite3.c       if( p->n==aKeyword[j].nChar 
n                106684 ext/sqlite3/libsqlite/sqlite3.c           && sqlite3StrNICmp((char*)p->z, &zKeyText[aKeyword[j].i], p->n)==0 ){
n                108267 ext/sqlite3/libsqlite/sqlite3.c   int addr1, n;
n                108282 ext/sqlite3/libsqlite/sqlite3.c     if( sqlite3ExprIsInteger(p->pLimit, &n) ){
n                108283 ext/sqlite3/libsqlite/sqlite3.c       sqlite3VdbeAddOp2(v, OP_Integer, n, iLimit);
n                108285 ext/sqlite3/libsqlite/sqlite3.c       if( n==0 ){
n                108287 ext/sqlite3/libsqlite/sqlite3.c       }else if( n>=0 && p->nSelectRow>(u64)n ){
n                108288 ext/sqlite3/libsqlite/sqlite3.c         p->nSelectRow = n;
n                110820 ext/sqlite3/libsqlite/sqlite3.c             sColname.n = sqlite3Strlen30(zColname);
n                111986 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                111992 ext/sqlite3/libsqlite/sqlite3.c   if( p->pSrc && p->pSrc->nSrc ) n++;
n                111993 ext/sqlite3/libsqlite/sqlite3.c   if( p->pWhere ) n++;
n                111994 ext/sqlite3/libsqlite/sqlite3.c   if( p->pGroupBy ) n++;
n                111995 ext/sqlite3/libsqlite/sqlite3.c   if( p->pHaving ) n++;
n                111996 ext/sqlite3/libsqlite/sqlite3.c   if( p->pOrderBy ) n++;
n                111997 ext/sqlite3/libsqlite/sqlite3.c   if( p->pLimit ) n++;
n                111998 ext/sqlite3/libsqlite/sqlite3.c   if( p->pOffset ) n++;
n                111999 ext/sqlite3/libsqlite/sqlite3.c   if( p->pPrior ) n++;
n                112000 ext/sqlite3/libsqlite/sqlite3.c   sqlite3TreeViewExprList(pView, p->pEList, (n--)>0, "result-set");
n                112003 ext/sqlite3/libsqlite/sqlite3.c     pView = sqlite3TreeViewPush(pView, (n--)>0);
n                112035 ext/sqlite3/libsqlite/sqlite3.c     sqlite3TreeViewItem(pView, "WHERE", (n--)>0);
n                112040 ext/sqlite3/libsqlite/sqlite3.c     sqlite3TreeViewExprList(pView, p->pGroupBy, (n--)>0, "GROUPBY");
n                112043 ext/sqlite3/libsqlite/sqlite3.c     sqlite3TreeViewItem(pView, "HAVING", (n--)>0);
n                112048 ext/sqlite3/libsqlite/sqlite3.c     sqlite3TreeViewExprList(pView, p->pOrderBy, (n--)>0, "ORDERBY");
n                112051 ext/sqlite3/libsqlite/sqlite3.c     sqlite3TreeViewItem(pView, "LIMIT", (n--)>0);
n                112056 ext/sqlite3/libsqlite/sqlite3.c     sqlite3TreeViewItem(pView, "OFFSET", (n--)>0);
n                112067 ext/sqlite3/libsqlite/sqlite3.c     sqlite3TreeViewItem(pView, zOp, (n--)>0);
n                112167 ext/sqlite3/libsqlite/sqlite3.c         int n = sqlite3Strlen30(argv[i])+1;
n                112168 ext/sqlite3/libsqlite/sqlite3.c         z = sqlite3_malloc64( n );
n                112170 ext/sqlite3/libsqlite/sqlite3.c         memcpy(z, argv[i], n);
n                112266 ext/sqlite3/libsqlite/sqlite3.c     int i, n;
n                112269 ext/sqlite3/libsqlite/sqlite3.c     n = SQLITE_PTR_TO_INT(azResult[0]);
n                112270 ext/sqlite3/libsqlite/sqlite3.c     for(i=1; i<n; i++){ if( azResult[i] ) sqlite3_free(azResult[i]); }
n                112384 ext/sqlite3/libsqlite/sqlite3.c     if( pName2->n>0 ){
n                112420 ext/sqlite3/libsqlite/sqlite3.c   if( db->init.busy==0 && pName2->n==0 && pTab
n                112568 ext/sqlite3/libsqlite/sqlite3.c   nameToken.n = sqlite3Strlen30(nameToken.z);
n                112587 ext/sqlite3/libsqlite/sqlite3.c     z = sqlite3DbStrNDup(db, (char*)pAll->z, pAll->n);
n                112652 ext/sqlite3/libsqlite/sqlite3.c   pTriggerStep = sqlite3DbMallocZero(db, sizeof(TriggerStep) + pName->n + 1);
n                112655 ext/sqlite3/libsqlite/sqlite3.c     memcpy(z, pName->z, pName->n);
n                114888 ext/sqlite3/libsqlite/sqlite3.c   pParse->sNameToken.n = (int)(
n                114889 ext/sqlite3/libsqlite/sqlite3.c       &pModuleName->z[pModuleName->n] - pParse->sNameToken.z
n                114913 ext/sqlite3/libsqlite/sqlite3.c     int n = pParse->sArg.n;
n                114915 ext/sqlite3/libsqlite/sqlite3.c     addModuleArgument(db, pParse->pNewTable, sqlite3DbStrNDup(db, z, n));
n                114947 ext/sqlite3/libsqlite/sqlite3.c       pParse->sNameToken.n = (int)(pEnd->z - pParse->sNameToken.z) + pEnd->n;
n                115010 ext/sqlite3/libsqlite/sqlite3.c   pParse->sArg.n = 0;
n                115021 ext/sqlite3/libsqlite/sqlite3.c     pArg->n = p->n;
n                115024 ext/sqlite3/libsqlite/sqlite3.c     pArg->n = (int)(&p->z[p->n] - pArg->z);
n                115625 ext/sqlite3/libsqlite/sqlite3.c   int i, n;
n                115632 ext/sqlite3/libsqlite/sqlite3.c   n = (pToplevel->nVtabLock+1)*sizeof(pToplevel->apVtabLock[0]);
n                115633 ext/sqlite3/libsqlite/sqlite3.c   apVtabLock = sqlite3_realloc64(pToplevel->apVtabLock, n);
n                115881 ext/sqlite3/libsqlite/sqlite3.c   u16 n;                      /* Number of valid a[] entries */
n                116091 ext/sqlite3/libsqlite/sqlite3.c   int n;                        /* Number of assigned cursor values */
n                116260 ext/sqlite3/libsqlite/sqlite3.c   pDest->n = pSrc->n;
n                116261 ext/sqlite3/libsqlite/sqlite3.c   memcpy(pDest->a, pSrc->a, pDest->n*sizeof(pDest->a[0]));
n                116279 ext/sqlite3/libsqlite/sqlite3.c   for(i=pSet->n, p=pSet->a; i>0; i--, p++){
n                116287 ext/sqlite3/libsqlite/sqlite3.c   if( pSet->n<N_OR_COST ){
n                116288 ext/sqlite3/libsqlite/sqlite3.c     p = &pSet->a[pSet->n++];
n                116292 ext/sqlite3/libsqlite/sqlite3.c     for(i=1; i<pSet->n; i++){
n                116446 ext/sqlite3/libsqlite/sqlite3.c #define initMaskSet(P)  (P)->n=0
n                116454 ext/sqlite3/libsqlite/sqlite3.c   assert( pMaskSet->n<=(int)sizeof(Bitmask)*8 );
n                116455 ext/sqlite3/libsqlite/sqlite3.c   for(i=0; i<pMaskSet->n; i++){
n                116472 ext/sqlite3/libsqlite/sqlite3.c   assert( pMaskSet->n < ArraySize(pMaskSet->ix) );
n                116473 ext/sqlite3/libsqlite/sqlite3.c   pMaskSet->ix[pMaskSet->n++] = iCursor;
n                117884 ext/sqlite3/libsqlite/sqlite3.c   int n;                      /* Column counter */
n                117971 ext/sqlite3/libsqlite/sqlite3.c   n = 0;
n                117982 ext/sqlite3/libsqlite/sqlite3.c         pIdx->aiColumn[n] = pTerm->u.leftColumn;
n                117984 ext/sqlite3/libsqlite/sqlite3.c         pIdx->azColl[n] = pColl ? pColl->zName : "BINARY";
n                117985 ext/sqlite3/libsqlite/sqlite3.c         n++;
n                117989 ext/sqlite3/libsqlite/sqlite3.c   assert( (u32)n==pLoop->u.btree.nEq );
n                117995 ext/sqlite3/libsqlite/sqlite3.c       pIdx->aiColumn[n] = i;
n                117996 ext/sqlite3/libsqlite/sqlite3.c       pIdx->azColl[n] = "BINARY";
n                117997 ext/sqlite3/libsqlite/sqlite3.c       n++;
n                118002 ext/sqlite3/libsqlite/sqlite3.c       pIdx->aiColumn[n] = i;
n                118003 ext/sqlite3/libsqlite/sqlite3.c       pIdx->azColl[n] = "BINARY";
n                118004 ext/sqlite3/libsqlite/sqlite3.c       n++;
n                118007 ext/sqlite3/libsqlite/sqlite3.c   assert( n==nKeyCol );
n                118008 ext/sqlite3/libsqlite/sqlite3.c   pIdx->aiColumn[n] = -1;
n                118009 ext/sqlite3/libsqlite/sqlite3.c   pIdx->azColl[n] = "BINARY";
n                118085 ext/sqlite3/libsqlite/sqlite3.c     int n = pOrderBy->nExpr;
n                118086 ext/sqlite3/libsqlite/sqlite3.c     for(i=0; i<n; i++){
n                118090 ext/sqlite3/libsqlite/sqlite3.c     if( i==n){
n                118091 ext/sqlite3/libsqlite/sqlite3.c       nOrderBy = n;
n                118288 ext/sqlite3/libsqlite/sqlite3.c     int n;                        /* Number of fields in test sample */
n                118296 ext/sqlite3/libsqlite/sqlite3.c       for(n=(iTest % nField) + 1; n<nField; n++){
n                118297 ext/sqlite3/libsqlite/sqlite3.c         if( aSample[iSamp-1].anLt[n-1]!=aSample[iSamp].anLt[n-1] ) break;
n                118300 ext/sqlite3/libsqlite/sqlite3.c       n = iTest + 1;
n                118303 ext/sqlite3/libsqlite/sqlite3.c     pRec->nField = n;
n                118304 ext/sqlite3/libsqlite/sqlite3.c     res = sqlite3VdbeRecordCompare(aSample[iSamp].n, aSample[iSamp].p, pRec);
n                118306 ext/sqlite3/libsqlite/sqlite3.c       iLower = aSample[iSamp].anLt[n-1] + aSample[iSamp].anEq[n-1];
n                118308 ext/sqlite3/libsqlite/sqlite3.c     }else if( res==0 && n<nField ){
n                118309 ext/sqlite3/libsqlite/sqlite3.c       iLower = aSample[iSamp].anLt[n-1];
n                118314 ext/sqlite3/libsqlite/sqlite3.c       iCol = n-1;
n                118329 ext/sqlite3/libsqlite/sqlite3.c       assert( 0==sqlite3VdbeRecordCompare(aSample[i].n, aSample[i].p, pRec) 
n                118339 ext/sqlite3/libsqlite/sqlite3.c            || sqlite3VdbeRecordCompare(aSample[i].n, aSample[i].p, pRec)>0
n                118348 ext/sqlite3/libsqlite/sqlite3.c         assert( sqlite3VdbeRecordCompare(aSample[i].n, aSample[i].p, pRec)<=0
n                118353 ext/sqlite3/libsqlite/sqlite3.c         assert( sqlite3VdbeRecordCompare(aSample[i-1].n, aSample[i-1].p, pRec)<0
n                118490 ext/sqlite3/libsqlite/sqlite3.c       rc = sqlite3Stat4Column(db, p->aSample[i].p, p->aSample[i].n, nEq, &pVal);
n                118916 ext/sqlite3/libsqlite/sqlite3.c static void codeApplyAffinity(Parse *pParse, int base, int n, char *zAff){
n                118927 ext/sqlite3/libsqlite/sqlite3.c   while( n>0 && zAff[0]==SQLITE_AFF_NONE ){
n                118928 ext/sqlite3/libsqlite/sqlite3.c     n--;
n                118932 ext/sqlite3/libsqlite/sqlite3.c   while( n>1 && zAff[n-1]==SQLITE_AFF_NONE ){
n                118933 ext/sqlite3/libsqlite/sqlite3.c     n--;
n                118937 ext/sqlite3/libsqlite/sqlite3.c   if( n>0 ){
n                118938 ext/sqlite3/libsqlite/sqlite3.c     sqlite3VdbeAddOp2(v, OP_Affinity, base, n);
n                118939 ext/sqlite3/libsqlite/sqlite3.c     sqlite3VdbeChangeP4(v, -1, zAff, n);
n                118940 ext/sqlite3/libsqlite/sqlite3.c     sqlite3ExprCacheAffinityChange(pParse, base, n);
n                120434 ext/sqlite3/libsqlite/sqlite3.c static int whereLoopResize(sqlite3 *db, WhereLoop *p, int n){
n                120436 ext/sqlite3/libsqlite/sqlite3.c   if( p->nLSlot>=n ) return SQLITE_OK;
n                120437 ext/sqlite3/libsqlite/sqlite3.c   n = (n+7)&~7;
n                120438 ext/sqlite3/libsqlite/sqlite3.c   paNew = sqlite3DbMallocRaw(db, sizeof(p->aLTerm[0])*n);
n                120443 ext/sqlite3/libsqlite/sqlite3.c   p->nLSlot = n;
n                120684 ext/sqlite3/libsqlite/sqlite3.c     u16 n = pBuilder->pOrSet->n;
n                120691 ext/sqlite3/libsqlite/sqlite3.c       sqlite3DebugPrintf(x?"   or-%d:  ":"   or-X:  ", n);
n                121653 ext/sqlite3/libsqlite/sqlite3.c         sCur.n = 0;
n                121674 ext/sqlite3/libsqlite/sqlite3.c         assert( rc==SQLITE_OK || sCur.n==0 );
n                121675 ext/sqlite3/libsqlite/sqlite3.c         if( sCur.n==0 ){
n                121676 ext/sqlite3/libsqlite/sqlite3.c           sSum.n = 0;
n                121684 ext/sqlite3/libsqlite/sqlite3.c           sSum.n = 0;
n                121685 ext/sqlite3/libsqlite/sqlite3.c           for(i=0; i<sPrev.n; i++){
n                121686 ext/sqlite3/libsqlite/sqlite3.c             for(j=0; j<sCur.n; j++){
n                121700 ext/sqlite3/libsqlite/sqlite3.c       for(i=0; rc==SQLITE_OK && i<sSum.n; i++){
n                122940 ext/sqlite3/libsqlite/sqlite3.c         int n = 0;
n                122941 ext/sqlite3/libsqlite/sqlite3.c         for(; b; b=b>>1, n++){}
n                122943 ext/sqlite3/libsqlite/sqlite3.c                             SQLITE_INT_TO_PTR(n), P4_INT32);
n                122944 ext/sqlite3/libsqlite/sqlite3.c         assert( n<=pTab->nCol );
n                123321 ext/sqlite3/libsqlite/sqlite3.c     pOut->zEnd = &pEnd->z[pEnd->n];
n                123331 ext/sqlite3/libsqlite/sqlite3.c     pOut->zEnd = &pValue->z[pValue->n];
n                123360 ext/sqlite3/libsqlite/sqlite3.c     pOut->zEnd = &pPostOp->z[pPostOp->n];
n                125423 ext/sqlite3/libsqlite/sqlite3.c   if( yymsp[0].minor.yy0.n==5 && sqlite3_strnicmp(yymsp[0].minor.yy0.z,"rowid",5)==0 ){
n                125427 ext/sqlite3/libsqlite/sqlite3.c     sqlite3ErrorMsg(pParse, "unknown table option: %.*s", yymsp[0].minor.yy0.n, yymsp[0].minor.yy0.z);
n                125434 ext/sqlite3/libsqlite/sqlite3.c   yygotominor.yy0.n = (int)(pParse->sLastToken.z-yymsp[-2].minor.yy0.z) + pParse->sLastToken.n;
n                125441 ext/sqlite3/libsqlite/sqlite3.c   pParse->constraintName.n = 0;
n                125471 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                125477 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                125481 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                125569 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.n = 0; yygotominor.yy0.z = 0;}
n                125575 ext/sqlite3/libsqlite/sqlite3.c {pParse->constraintName.n = 0;}
n                125651 ext/sqlite3/libsqlite/sqlite3.c     x.n = 0;
n                125740 ext/sqlite3/libsqlite/sqlite3.c    if( yymsp[0].minor.yy0.n>0 ) sqlite3ExprListSetName(pParse, yygotominor.yy14, &yymsp[0].minor.yy0, 1);
n                125759 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.n = 0;}
n                125792 ext/sqlite3/libsqlite/sqlite3.c     if( yymsp[-6].minor.yy65==0 && yymsp[-2].minor.yy0.n==0 && yymsp[-1].minor.yy132==0 && yymsp[0].minor.yy408==0 ){
n                125816 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.z=0; yygotominor.yy0.n=0;}
n                125848 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.z=0; yygotominor.yy0.n=1;}
n                125980 ext/sqlite3/libsqlite/sqlite3.c   if( yymsp[0].minor.yy0.n>=2 && yymsp[0].minor.yy0.z[0]=='#' && sqlite3Isdigit(yymsp[0].minor.yy0.z[1]) ){
n                126002 ext/sqlite3/libsqlite/sqlite3.c   yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126170 ext/sqlite3/libsqlite/sqlite3.c     yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126184 ext/sqlite3/libsqlite/sqlite3.c     yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126199 ext/sqlite3/libsqlite/sqlite3.c     yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126215 ext/sqlite3/libsqlite/sqlite3.c     yygotominor.yy346.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                126229 ext/sqlite3/libsqlite/sqlite3.c     yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126243 ext/sqlite3/libsqlite/sqlite3.c   yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126297 ext/sqlite3/libsqlite/sqlite3.c {yygotominor.yy0.z = 0; yygotominor.yy0.n = 0;}
n                126325 ext/sqlite3/libsqlite/sqlite3.c   all.n = (int)(yymsp[0].minor.yy0.z - yymsp[-3].minor.yy0.z) + yymsp[0].minor.yy0.n;
n                126332 ext/sqlite3/libsqlite/sqlite3.c   yygotominor.yy0 = (yymsp[-6].minor.yy0.n==0?yymsp[-7].minor.yy0:yymsp[-6].minor.yy0);
n                126416 ext/sqlite3/libsqlite/sqlite3.c   yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126426 ext/sqlite3/libsqlite/sqlite3.c   yygotominor.yy346.zEnd = &yymsp[0].minor.yy0.z[yymsp[0].minor.yy0.n];
n                126889 ext/sqlite3/libsqlite/sqlite3.c static int keywordCode(const char *z, int n){
n                127010 ext/sqlite3/libsqlite/sqlite3.c   if( n<2 ) return TK_ID;
n                127012 ext/sqlite3/libsqlite/sqlite3.c       (charMap(z[n-1])*3) ^
n                127013 ext/sqlite3/libsqlite/sqlite3.c       n) % 127;
n                127015 ext/sqlite3/libsqlite/sqlite3.c     if( aLen[i]==n && sqlite3StrNICmp(&zText[aOffset[i]],z,n)==0 ){
n                127145 ext/sqlite3/libsqlite/sqlite3.c SQLITE_PRIVATE int sqlite3KeywordCode(const unsigned char *z, int n){
n                127146 ext/sqlite3/libsqlite/sqlite3.c   return keywordCode((char*)z, n);
n                127405 ext/sqlite3/libsqlite/sqlite3.c       int n = 0;
n                127411 ext/sqlite3/libsqlite/sqlite3.c           n++;
n                127413 ext/sqlite3/libsqlite/sqlite3.c         }else if( c=='(' && n>0 ){
n                127430 ext/sqlite3/libsqlite/sqlite3.c       if( n==0 ) *tokenType = TK_ILLEGAL;
n                127503 ext/sqlite3/libsqlite/sqlite3.c     pParse->sLastToken.n = sqlite3GetToken((unsigned char*)&zSql[i],&tokenType);
n                127504 ext/sqlite3/libsqlite/sqlite3.c     i += pParse->sLastToken.n;
n                128782 ext/sqlite3/libsqlite/sqlite3.c static int allSpaces(const char *z, int n){
n                128783 ext/sqlite3/libsqlite/sqlite3.c   while( n>0 && z[n-1]==' ' ){ n--; }
n                128784 ext/sqlite3/libsqlite/sqlite3.c   return n==0;
n                128799 ext/sqlite3/libsqlite/sqlite3.c   int rc, n;
n                128800 ext/sqlite3/libsqlite/sqlite3.c   n = nKey1<nKey2 ? nKey1 : nKey2;
n                128804 ext/sqlite3/libsqlite/sqlite3.c   rc = memcmp(pKey1, pKey2, n);
n                128807 ext/sqlite3/libsqlite/sqlite3.c      && allSpaces(((char*)pKey1)+n, nKey1-n)
n                128808 ext/sqlite3/libsqlite/sqlite3.c      && allSpaces(((char*)pKey2)+n, nKey2-n)
n                131566 ext/sqlite3/libsqlite/sqlite3.c       int n = sqlite3Strlen30(zWord);
n                131567 ext/sqlite3/libsqlite/sqlite3.c       rc = (sqlite3KeywordCode((u8*)zWord, n)!=TK_ID) ? SQLITE_N_KEYWORD : 0;
n                133043 ext/sqlite3/libsqlite/sqlite3.c   int n;                          /* Number of bytes in buffer z */
n                134074 ext/sqlite3/libsqlite/sqlite3.c         int n = (int)strlen(zCol)+1;
n                134075 ext/sqlite3/libsqlite/sqlite3.c         memcpy(p, zCol, n);
n                134077 ext/sqlite3/libsqlite/sqlite3.c         p += n;
n                134390 ext/sqlite3/libsqlite/sqlite3.c     int n = 0;
n                134391 ext/sqlite3/libsqlite/sqlite3.c     z = (char *)sqlite3Fts3NextToken(aCol[iCol], &n);
n                134392 ext/sqlite3/libsqlite/sqlite3.c     memcpy(zCsr, z, n);
n                134393 ext/sqlite3/libsqlite/sqlite3.c     zCsr[n] = '\0';
n                134396 ext/sqlite3/libsqlite/sqlite3.c     zCsr += n+1;
n                134402 ext/sqlite3/libsqlite/sqlite3.c     int n = (int)strlen(p->azColumn[iCol]);
n                134405 ext/sqlite3/libsqlite/sqlite3.c       if( zNot && n==(int)strlen(zNot)
n                134406 ext/sqlite3/libsqlite/sqlite3.c        && 0==sqlite3_strnicmp(p->azColumn[iCol], zNot, n) 
n                134966 ext/sqlite3/libsqlite/sqlite3.c     int n = (int)(pEnd - *ppPoslist);
n                134968 ext/sqlite3/libsqlite/sqlite3.c     memcpy(p, *ppPoslist, n);
n                134969 ext/sqlite3/libsqlite/sqlite3.c     p += n;
n                135004 ext/sqlite3/libsqlite/sqlite3.c     int n = (int)(pEnd - *ppPoslist);
n                135006 ext/sqlite3/libsqlite/sqlite3.c     memcpy(p, *ppPoslist, n);
n                135007 ext/sqlite3/libsqlite/sqlite3.c     p += n;
n                135059 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;                      /* Number of bytes written */
n                135062 ext/sqlite3/libsqlite/sqlite3.c     n = 1 + sqlite3Fts3PutVarint(&p[1], iCol);
n                135064 ext/sqlite3/libsqlite/sqlite3.c     *pp = &p[n];
n                135066 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                135101 ext/sqlite3/libsqlite/sqlite3.c       int n = fts3PutColNumber(&p, iCol1);
n                135102 ext/sqlite3/libsqlite/sqlite3.c       p1 += n;
n                135103 ext/sqlite3/libsqlite/sqlite3.c       p2 += n;
n                136012 ext/sqlite3/libsqlite/sqlite3.c   filter.nTerm = pTok->n;
n                136974 ext/sqlite3/libsqlite/sqlite3.c             pToken->z, pToken->n, pToken->isPrefix, &pToken->pSegcsr
n                137247 ext/sqlite3/libsqlite/sqlite3.c         rc = sqlite3Fts3MsrIncrStart(pTab, pSegcsr, iCol, pToken->z, pToken->n);
n                139177 ext/sqlite3/libsqlite/sqlite3.c       int n = (pCsr->nStop<pCsr->csr.nTerm) ? pCsr->nStop : pCsr->csr.nTerm;
n                139178 ext/sqlite3/libsqlite/sqlite3.c       int mc = memcmp(pCsr->zStop, pCsr->csr.zTerm, n);
n                139575 ext/sqlite3/libsqlite/sqlite3.c   int n,
n                139582 ext/sqlite3/libsqlite/sqlite3.c   rc = pModule->xOpen(pTokenizer, z, n, &pCsr);
n                139619 ext/sqlite3/libsqlite/sqlite3.c   const char *z, int n,                   /* Input string */
n                139631 ext/sqlite3/libsqlite/sqlite3.c   for(i=0; i<n; i++){
n                139654 ext/sqlite3/libsqlite/sqlite3.c         pRet->pPhrase->aToken[0].n = nToken;
n                139658 ext/sqlite3/libsqlite/sqlite3.c         if( iEnd<n && z[iEnd]=='*' ){
n                139774 ext/sqlite3/libsqlite/sqlite3.c         pToken->n = nByte;
n                139807 ext/sqlite3/libsqlite/sqlite3.c       zBuf += p->pPhrase->aToken[jj].n;
n                139835 ext/sqlite3/libsqlite/sqlite3.c   const char *z, int n,                   /* Input string */
n                139841 ext/sqlite3/libsqlite/sqlite3.c     unsigned char n;                      /* Length of the keyword */
n                139857 ext/sqlite3/libsqlite/sqlite3.c   int nInput = n;
n                139880 ext/sqlite3/libsqlite/sqlite3.c     if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
n                139882 ext/sqlite3/libsqlite/sqlite3.c       int nKey = pKey->n;
n                139975 ext/sqlite3/libsqlite/sqlite3.c   rc = getNextToken(pParse, iCol, &z[iColLen], n-iColLen, ppExpr, pnConsumed);
n                140053 ext/sqlite3/libsqlite/sqlite3.c   const char *z, int n,                   /* Text of MATCH query */
n                140060 ext/sqlite3/libsqlite/sqlite3.c   int nIn = n;
n                140184 ext/sqlite3/libsqlite/sqlite3.c   *pnConsumed = n - nIn;
n                140381 ext/sqlite3/libsqlite/sqlite3.c   const char *z, int n,               /* Text of MATCH query */
n                140399 ext/sqlite3/libsqlite/sqlite3.c   if( n<0 ){
n                140400 ext/sqlite3/libsqlite/sqlite3.c     n = (int)strlen(z);
n                140402 ext/sqlite3/libsqlite/sqlite3.c   rc = fts3ExprParse(&sParse, z, n, ppExpr, &nParsed);
n                140444 ext/sqlite3/libsqlite/sqlite3.c   const char *z, int n,               /* Text of MATCH query */
n                140449 ext/sqlite3/libsqlite/sqlite3.c       pTokenizer, iLangid, azCol, bFts4, nCol, iDefaultCol, z, n, ppExpr
n                140575 ext/sqlite3/libsqlite/sqlite3.c             pPhrase->aToken[i].n, pPhrase->aToken[i].z,
n                140762 ext/sqlite3/libsqlite/sqlite3.c static void *fts3HashMalloc(int n){
n                140763 ext/sqlite3/libsqlite/sqlite3.c   void *p = sqlite3_malloc(n);
n                140765 ext/sqlite3/libsqlite/sqlite3.c     memset(p, 0, n);
n                141728 ext/sqlite3/libsqlite/sqlite3.c       int n = c->iOffset-iStartOffset;
n                141729 ext/sqlite3/libsqlite/sqlite3.c       if( n>c->nAllocated ){
n                141731 ext/sqlite3/libsqlite/sqlite3.c         c->nAllocated = n+20;
n                141736 ext/sqlite3/libsqlite/sqlite3.c       porter_stemmer(&z[iStartOffset], n, c->zToken, pnBytes);
n                141843 ext/sqlite3/libsqlite/sqlite3.c     int n = sqlite3_value_bytes(argv[1]);
n                141844 ext/sqlite3/libsqlite/sqlite3.c     if( zName==0 || n!=sizeof(pPtr) ){
n                141928 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                141937 ext/sqlite3/libsqlite/sqlite3.c   z = (char *)sqlite3Fts3NextToken(zCopy, &n);
n                141939 ext/sqlite3/libsqlite/sqlite3.c     assert( n==0 );
n                141942 ext/sqlite3/libsqlite/sqlite3.c   z[n] = '\0';
n                141952 ext/sqlite3/libsqlite/sqlite3.c     z = &z[n+1];
n                141953 ext/sqlite3/libsqlite/sqlite3.c     while( z<zEnd && (NULL!=(z = (char *)sqlite3Fts3NextToken(z, &n))) ){
n                141963 ext/sqlite3/libsqlite/sqlite3.c       z[n] = '\0';
n                141965 ext/sqlite3/libsqlite/sqlite3.c       z = &z[n+1];
n                142344 ext/sqlite3/libsqlite/sqlite3.c     int i, n = (int)strlen(argv[1]);
n                142345 ext/sqlite3/libsqlite/sqlite3.c     for(i=0; i<n; i++){
n                142451 ext/sqlite3/libsqlite/sqlite3.c       int i, n = c->iOffset-iStartOffset;
n                142452 ext/sqlite3/libsqlite/sqlite3.c       if( n>c->nTokenAllocated ){
n                142454 ext/sqlite3/libsqlite/sqlite3.c         c->nTokenAllocated = n+20;
n                142459 ext/sqlite3/libsqlite/sqlite3.c       for(i=0; i<n; i++){
n                142467 ext/sqlite3/libsqlite/sqlite3.c       *pnBytes = n;
n                142634 ext/sqlite3/libsqlite/sqlite3.c         int n = (int)strlen(argv[i]);
n                142636 ext/sqlite3/libsqlite/sqlite3.c         memcpy(pSpace, argv[i], n+1);
n                142638 ext/sqlite3/libsqlite/sqlite3.c         pSpace += (n+1);
n                144381 ext/sqlite3/libsqlite/sqlite3.c       int n = sqlite3Fts3GetVarint(pReader->aDoclist, &pReader->iDocid);
n                144382 ext/sqlite3/libsqlite/sqlite3.c       pReader->pOffsetList = &pReader->aDoclist[n];
n                144596 ext/sqlite3/libsqlite/sqlite3.c   int n = (n1<n2 ? n1 : n2);
n                144597 ext/sqlite3/libsqlite/sqlite3.c   int c = memcmp(z1, z2, n);
n                144847 ext/sqlite3/libsqlite/sqlite3.c   int n                           /* Size of buffer z in bytes */
n                144853 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_bind_blob(pStmt, 2, z, n, SQLITE_STATIC);
n                144930 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                144932 ext/sqlite3/libsqlite/sqlite3.c   for(n=0; n<nPrev && zPrev[n]==zNext[n]; n++);
n                144933 ext/sqlite3/libsqlite/sqlite3.c   return n;
n                146576 ext/sqlite3/libsqlite/sqlite3.c   int n;                          /* Number of valid bytes of data in a[] */
n                146659 ext/sqlite3/libsqlite/sqlite3.c   int bFirst = (p->term.n==0);    /* True for first term on the node */
n                146678 ext/sqlite3/libsqlite/sqlite3.c       p->term.n = nPrefix+nSuffix;
n                146755 ext/sqlite3/libsqlite/sqlite3.c     nPrefix = fts3PrefixCompress(pNode->key.a, pNode->key.n, zTerm, nTerm);
n                146760 ext/sqlite3/libsqlite/sqlite3.c     if( pNode->key.n==0 || (pNode->block.n + nSpace)<=p->nNodeSize ){ 
n                146766 ext/sqlite3/libsqlite/sqlite3.c       if( pBlk->n==0 ){
n                146770 ext/sqlite3/libsqlite/sqlite3.c           pBlk->n = 1 + sqlite3Fts3PutVarint(&pBlk->a[1], iPtr);
n                146773 ext/sqlite3/libsqlite/sqlite3.c       blobGrowBuffer(pBlk, pBlk->n + nSpace, &rc);
n                146777 ext/sqlite3/libsqlite/sqlite3.c         if( pNode->key.n ){
n                146778 ext/sqlite3/libsqlite/sqlite3.c           pBlk->n += sqlite3Fts3PutVarint(&pBlk->a[pBlk->n], nPrefix);
n                146780 ext/sqlite3/libsqlite/sqlite3.c         pBlk->n += sqlite3Fts3PutVarint(&pBlk->a[pBlk->n], nSuffix);
n                146781 ext/sqlite3/libsqlite/sqlite3.c         memcpy(&pBlk->a[pBlk->n], &zTerm[nPrefix], nSuffix);
n                146782 ext/sqlite3/libsqlite/sqlite3.c         pBlk->n += nSuffix;
n                146785 ext/sqlite3/libsqlite/sqlite3.c         pNode->key.n = nTerm;
n                146791 ext/sqlite3/libsqlite/sqlite3.c       rc = fts3WriteSegment(p, pNode->iBlock, pNode->block.a, pNode->block.n);
n                146795 ext/sqlite3/libsqlite/sqlite3.c       pNode->block.n = 1 + sqlite3Fts3PutVarint(&pNode->block.a[1], iPtr+1);
n                146799 ext/sqlite3/libsqlite/sqlite3.c       pNode->key.n = 0;
n                146843 ext/sqlite3/libsqlite/sqlite3.c   int bFirst = (pPrev->n==0);     /* True if this is the first term written */
n                146849 ext/sqlite3/libsqlite/sqlite3.c   assert( pNode->n>0 );
n                146855 ext/sqlite3/libsqlite/sqlite3.c   nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
n                146858 ext/sqlite3/libsqlite/sqlite3.c   pPrev->n = nTerm;
n                146861 ext/sqlite3/libsqlite/sqlite3.c     pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nPrefix);
n                146863 ext/sqlite3/libsqlite/sqlite3.c   pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nSuffix);
n                146864 ext/sqlite3/libsqlite/sqlite3.c   memcpy(&pNode->a[pNode->n], &zTerm[nPrefix], nSuffix);
n                146865 ext/sqlite3/libsqlite/sqlite3.c   pNode->n += nSuffix;
n                146868 ext/sqlite3/libsqlite/sqlite3.c     pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nDoclist);
n                146869 ext/sqlite3/libsqlite/sqlite3.c     memcpy(&pNode->a[pNode->n], aDoclist, nDoclist);
n                146870 ext/sqlite3/libsqlite/sqlite3.c     pNode->n += nDoclist;
n                146873 ext/sqlite3/libsqlite/sqlite3.c   assert( pNode->n<=pNode->nAlloc );
n                146900 ext/sqlite3/libsqlite/sqlite3.c   nPrefix = fts3PrefixCompress(pLeaf->key.a, pLeaf->key.n, zTerm, nTerm);
n                146910 ext/sqlite3/libsqlite/sqlite3.c   if( pLeaf->block.n>0 && (pLeaf->block.n + nSpace)>p->nNodeSize ){
n                146911 ext/sqlite3/libsqlite/sqlite3.c     rc = fts3WriteSegment(p, pLeaf->iBlock, pLeaf->block.a, pLeaf->block.n);
n                146932 ext/sqlite3/libsqlite/sqlite3.c     pLeaf->key.n = 0;
n                146933 ext/sqlite3/libsqlite/sqlite3.c     pLeaf->block.n = 0;
n                146942 ext/sqlite3/libsqlite/sqlite3.c   blobGrowBuffer(&pLeaf->block, pLeaf->block.n + nSpace, &rc);
n                146944 ext/sqlite3/libsqlite/sqlite3.c     if( pLeaf->block.n==0 ){
n                146945 ext/sqlite3/libsqlite/sqlite3.c       pLeaf->block.n = 1;
n                146985 ext/sqlite3/libsqlite/sqlite3.c     if( pNode->block.n>0 ) break;
n                147015 ext/sqlite3/libsqlite/sqlite3.c       pBlock->n = 1 + sqlite3Fts3PutVarint(
n                147026 ext/sqlite3/libsqlite/sqlite3.c     if( pNode->block.n>0 && rc==SQLITE_OK ){
n                147027 ext/sqlite3/libsqlite/sqlite3.c       rc = fts3WriteSegment(p, pNode->iBlock, pNode->block.a, pNode->block.n);
n                147042 ext/sqlite3/libsqlite/sqlite3.c         pRoot->block.a, pRoot->block.n      /* root */
n                147171 ext/sqlite3/libsqlite/sqlite3.c         if( fts3TermCmp(zKey, nKey, reader.term.a, reader.term.n)<=0 ){
n                147201 ext/sqlite3/libsqlite/sqlite3.c         pNode->block.n = nRoot;
n                147208 ext/sqlite3/libsqlite/sqlite3.c         rc = nodeReaderInit(&reader, pNode->block.a, pNode->block.n);
n                147210 ext/sqlite3/libsqlite/sqlite3.c         blobGrowBuffer(&pNode->key, reader.term.n, &rc);
n                147212 ext/sqlite3/libsqlite/sqlite3.c           memcpy(pNode->key.a, reader.term.a, reader.term.n);
n                147213 ext/sqlite3/libsqlite/sqlite3.c           pNode->key.n = reader.term.n;
n                147223 ext/sqlite3/libsqlite/sqlite3.c               pNode->block.n = nBlock;
n                147442 ext/sqlite3/libsqlite/sqlite3.c     pNode->n = 1 + sqlite3Fts3PutVarint(&pNode->a[1], iChild);
n                147445 ext/sqlite3/libsqlite/sqlite3.c     pNode->n = 1;
n                147473 ext/sqlite3/libsqlite/sqlite3.c   pNew->n = 0;
n                147480 ext/sqlite3/libsqlite/sqlite3.c     if( pNew->n==0 ){
n                147481 ext/sqlite3/libsqlite/sqlite3.c       int res = fts3TermCmp(reader.term.a, reader.term.n, zTerm, nTerm);
n                147487 ext/sqlite3/libsqlite/sqlite3.c         pNew, &prev, reader.term.a, reader.term.n,
n                147492 ext/sqlite3/libsqlite/sqlite3.c   if( pNew->n==0 ){
n                147496 ext/sqlite3/libsqlite/sqlite3.c   assert( pNew->n<=pNew->nAlloc );
n                147552 ext/sqlite3/libsqlite/sqlite3.c       rc = fts3WriteSegment(p, iNewStart, block.a, block.n);
n                147574 ext/sqlite3/libsqlite/sqlite3.c       sqlite3_bind_blob(pChomp, 2, root.a, root.n, SQLITE_STATIC);
n                147655 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_bind_blob(pReplace, 2, pHint->a, pHint->n, SQLITE_STATIC);
n                147675 ext/sqlite3/libsqlite/sqlite3.c   pHint->n = 0;
n                147687 ext/sqlite3/libsqlite/sqlite3.c           pHint->n = nHint;
n                147713 ext/sqlite3/libsqlite/sqlite3.c   blobGrowBuffer(pHint, pHint->n + 2*FTS3_VARINT_MAX, pRc);
n                147715 ext/sqlite3/libsqlite/sqlite3.c     pHint->n += sqlite3Fts3PutVarint(&pHint->a[pHint->n], iAbsLevel);
n                147716 ext/sqlite3/libsqlite/sqlite3.c     pHint->n += sqlite3Fts3PutVarint(&pHint->a[pHint->n], (i64)nInput);
n                147729 ext/sqlite3/libsqlite/sqlite3.c   const int nHint = pHint->n;
n                147732 ext/sqlite3/libsqlite/sqlite3.c   i = pHint->n-2;
n                147736 ext/sqlite3/libsqlite/sqlite3.c   pHint->n = i;
n                147800 ext/sqlite3/libsqlite/sqlite3.c     if( rc==SQLITE_OK && hint.n ){
n                147801 ext/sqlite3/libsqlite/sqlite3.c       int nHint = hint.n;
n                147814 ext/sqlite3/libsqlite/sqlite3.c         hint.n = nHint;
n                148331 ext/sqlite3/libsqlite/sqlite3.c                 && (pPT->n==nToken || (pPT->isPrefix && pPT->n<nToken))
n                148332 ext/sqlite3/libsqlite/sqlite3.c                 && (0==memcmp(zToken, pPT->z, pPT->n))
n                148730 ext/sqlite3/libsqlite/sqlite3.c   int n;                          /* Length of z in bytes (excl. nul-term) */
n                149126 ext/sqlite3/libsqlite/sqlite3.c   if( pStr->n+nAppend+1>=pStr->nAlloc ){
n                149135 ext/sqlite3/libsqlite/sqlite3.c   assert( pStr->z!=0 && (pStr->nAlloc >= pStr->n+nAppend+1) );
n                149138 ext/sqlite3/libsqlite/sqlite3.c   memcpy(&pStr->z[pStr->n], zAppend, nAppend);
n                149139 ext/sqlite3/libsqlite/sqlite3.c   pStr->n += nAppend;
n                149140 ext/sqlite3/libsqlite/sqlite3.c   pStr->z[pStr->n] = '\0';
n                149301 ext/sqlite3/libsqlite/sqlite3.c       int n = nDoc - iBegin;
n                149303 ext/sqlite3/libsqlite/sqlite3.c           pTab, pCsr->iLangid, nSnippet, &zDoc[iBegin], n, &iPos, &hlmask
n                150158 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_result_text(pCtx, res.z, res.n-1, sqlite3_free);
n                150202 ext/sqlite3/libsqlite/sqlite3.c     int n = pCsr->nMatchinfo * sizeof(u32);
n                150203 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_result_blob(pContext, pCsr->aMatchinfo, n, SQLITE_TRANSIENT);
n                150442 ext/sqlite3/libsqlite/sqlite3.c     int n = (int)strlen(z);
n                150444 ext/sqlite3/libsqlite/sqlite3.c     if( n==19 && memcmp("remove_diacritics=1", z, 19)==0 ){
n                150447 ext/sqlite3/libsqlite/sqlite3.c     else if( n==19 && memcmp("remove_diacritics=0", z, 19)==0 ){
n                150450 ext/sqlite3/libsqlite/sqlite3.c     else if( n>=11 && memcmp("tokenchars=", z, 11)==0 ){
n                150451 ext/sqlite3/libsqlite/sqlite3.c       rc = unicodeAddExceptions(pNew, 1, &z[11], n-11);
n                150453 ext/sqlite3/libsqlite/sqlite3.c     else if( n>=11 && memcmp("separators=", z, 11)==0 ){
n                150454 ext/sqlite3/libsqlite/sqlite3.c       rc = unicodeAddExceptions(pNew, 0, &z[11], n-11);
n                152238 ext/sqlite3/libsqlite/sqlite3.c   int i, j, k, n;
n                152250 ext/sqlite3/libsqlite/sqlite3.c     n = --p->nPoint;
n                152251 ext/sqlite3/libsqlite/sqlite3.c     p->aPoint[0] = p->aPoint[n];
n                152252 ext/sqlite3/libsqlite/sqlite3.c     if( n<RTREE_CACHE_SZ-1 ){
n                152253 ext/sqlite3/libsqlite/sqlite3.c       p->aNode[1] = p->aNode[n+1];
n                152254 ext/sqlite3/libsqlite/sqlite3.c       p->aNode[n+1] = 0;
n                152257 ext/sqlite3/libsqlite/sqlite3.c     while( (j = i*2+1)<n ){
n                152259 ext/sqlite3/libsqlite/sqlite3.c       if( k<n && rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[j])<0 ){
n                153482 ext/sqlite3/libsqlite/sqlite3.c   int n;
n                153487 ext/sqlite3/libsqlite/sqlite3.c   n = (nCell+1)&(~1);
n                153492 ext/sqlite3/libsqlite/sqlite3.c   aCell = (RtreeCell *)sqlite3_malloc(n * (
n                153501 ext/sqlite3/libsqlite/sqlite3.c   aOrder    = (int *)&aCell[n];
n                153502 ext/sqlite3/libsqlite/sqlite3.c   aSpare    = (int *)&aOrder[n];
n                153503 ext/sqlite3/libsqlite/sqlite3.c   aDistance = (RtreeDValue *)&aSpare[n];
n                155010 ext/sqlite3/libsqlite/sqlite3.c   int n = 0;
n                155013 ext/sqlite3/libsqlite/sqlite3.c     n = strlen(argv[0])+1;
n                155015 ext/sqlite3/libsqlite/sqlite3.c   p = (IcuTokenizer *)sqlite3_malloc(sizeof(IcuTokenizer)+n);
n                155021 ext/sqlite3/libsqlite/sqlite3.c   if( n ){
n                155023 ext/sqlite3/libsqlite/sqlite3.c     memcpy(p->zLocale, argv[0], n);
n                 747 ext/sqlite3/libsqlite/sqlite3.h   int (*xShmLock)(sqlite3_file*, int offset, int n, int flags);
n                3540 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API int SQLITE_STDCALL sqlite3_bind_blob(sqlite3_stmt*, int, const void*, int n, void(*)(void*));
n                3552 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API int SQLITE_STDCALL sqlite3_bind_zeroblob(sqlite3_stmt*, int, int n);
n                4631 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API void SQLITE_STDCALL sqlite3_result_zeroblob(sqlite3_context*, int n);
n                5985 ext/sqlite3/libsqlite/sqlite3.h SQLITE_API int SQLITE_STDCALL 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                4815 ext/standard/array.c 	int				i, k, n;
n                4949 ext/standard/array.c 		for (n = 0, k = 0; k < array_size; k++) {
n                4952 ext/standard/array.c 				hash->arData[k].h = n++;
n                3983 ext/standard/basic_functions.c 	uint32_t 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                 145 ext/standard/crypt.c static void php_to64(char *s, zend_long v, int n) /* {{{ */
n                 147 ext/standard/crypt.c 	while (--n >= 0) {
n                  43 ext/standard/crypt_sha256.c 	size_t n = strlen(src);
n                  44 ext/standard/crypt_sha256.c 	if (n > len) {
n                  45 ext/standard/crypt_sha256.c 		n = len;
n                  47 ext/standard/crypt_sha256.c 	return strncpy(dst, src, len) + n;
n                  72 ext/standard/crypt_sha256.c # define SWAP(n) \
n                  73 ext/standard/crypt_sha256.c     (((n) << 24) | (((n) & 0xff00) << 8) | (((n) >> 8) & 0xff00) | ((n) >> 24))
n                  75 ext/standard/crypt_sha256.c # define SWAP(n) (n)
n                 523 ext/standard/crypt_sha256.c 		int n = _snprintf(cp, MAX(0, buflen), "%s" ZEND_ULONG_FMT "$", sha256_rounds_prefix, rounds);
n                 525 ext/standard/crypt_sha256.c 		int n = snprintf(cp, MAX(0, buflen), "%s%zu$", sha256_rounds_prefix, rounds);
n                 527 ext/standard/crypt_sha256.c 		cp += n;
n                 528 ext/standard/crypt_sha256.c 		buflen -= n;
n                 542 ext/standard/crypt_sha256.c     int n = (N);							      \
n                 543 ext/standard/crypt_sha256.c     while (n-- > 0 && buflen > 0)					      \
n                  67 ext/standard/crypt_sha512.c # define SWAP(n) \
n                  68 ext/standard/crypt_sha512.c   (((n) << 56)					\
n                  69 ext/standard/crypt_sha512.c    | (((n) & 0xff00) << 40)			\
n                  70 ext/standard/crypt_sha512.c    | (((n) & 0xff0000) << 24)			\
n                  71 ext/standard/crypt_sha512.c    | (((n) & 0xff000000) << 8)			\
n                  72 ext/standard/crypt_sha512.c    | (((n) >> 8) & 0xff000000)			\
n                  73 ext/standard/crypt_sha512.c    | (((n) >> 24) & 0xff0000)			\
n                  74 ext/standard/crypt_sha512.c    | (((n) >> 40) & 0xff00)			\
n                  75 ext/standard/crypt_sha512.c    | ((n) >> 56))
n                  77 ext/standard/crypt_sha512.c # define SWAP(n) (n)
n                 558 ext/standard/crypt_sha512.c 	  int n = _snprintf(cp, MAX(0, buflen), "%s" ZEND_ULONG_FMT "$", sha512_rounds_prefix, rounds);
n                 560 ext/standard/crypt_sha512.c 	  int n = snprintf(cp, MAX(0, buflen), "%s%zu$", sha512_rounds_prefix, rounds);
n                 562 ext/standard/crypt_sha512.c 	  cp += n;
n                 563 ext/standard/crypt_sha512.c 	  buflen -= n;
n                 577 ext/standard/crypt_sha512.c 	int n = (N);							             \
n                 578 ext/standard/crypt_sha512.c 	while (n-- > 0 && buflen > 0)					     \
n                 442 ext/standard/dir.c 	int n;
n                 518 ext/standard/dir.c 	for (n = 0; n < globbuf.gl_pathc; n++) {
n                 520 ext/standard/dir.c 			if (php_check_open_basedir_ex(globbuf.gl_pathv[n], 0)) {
n                 536 ext/standard/dir.c 			if (0 != VCWD_STAT(globbuf.gl_pathv[n], &s)) {
n                 544 ext/standard/dir.c 		add_next_index_string(return_value, globbuf.gl_pathv[n]+cwd_skip);
n                 565 ext/standard/dir.c 	int n, i;
n                 583 ext/standard/dir.c 		n = php_stream_scandir(dirn, &namelist, context, (void *) php_stream_dirent_alphasort);
n                 585 ext/standard/dir.c 		n = php_stream_scandir(dirn, &namelist, context, NULL);
n                 587 ext/standard/dir.c 		n = php_stream_scandir(dirn, &namelist, context, (void *) php_stream_dirent_alphasortr);
n                 589 ext/standard/dir.c 	if (n < 0) {
n                 596 ext/standard/dir.c 	for (i = 0; i < n; i++) {
n                 600 ext/standard/dir.c 	if (n) {
n                 426 ext/standard/dns.c #define CHECKCP(n) do { \
n                 427 ext/standard/dns.c 	if (cp + n > end) { \
n                 437 ext/standard/dns.c 	long n, i;
n                 445 ext/standard/dns.c 	n = dn_expand(answer->qb2, end, cp, name, sizeof(name) - 2);
n                 446 ext/standard/dns.c 	if (n < 0) {
n                 449 ext/standard/dns.c 	cp += n;
n                 492 ext/standard/dns.c 			GETSHORT(n, cp);
n                 493 ext/standard/dns.c 			add_assoc_long(subarray, "pri", n);
n                 509 ext/standard/dns.c 			n = dn_expand(answer->qb2, end, cp, name, (sizeof name) - 2);
n                 510 ext/standard/dns.c 			if (n < 0) {
n                 513 ext/standard/dns.c 			cp += n;
n                 520 ext/standard/dns.c 			n = *cp & 0xFF;
n                 522 ext/standard/dns.c 			CHECKCP(n);
n                 523 ext/standard/dns.c 			add_assoc_stringl(subarray, "cpu", (char*)cp, n);
n                 524 ext/standard/dns.c 			cp += n;
n                 526 ext/standard/dns.c 			n = *cp & 0xFF;
n                 528 ext/standard/dns.c 			CHECKCP(n);
n                 529 ext/standard/dns.c 			add_assoc_stringl(subarray, "os", (char*)cp, n);
n                 530 ext/standard/dns.c 			cp += n;
n                 544 ext/standard/dns.c 					n = cp[l1];
n                 545 ext/standard/dns.c 					if ((l1 + n) >= dlen) {
n                 547 ext/standard/dns.c 						n = dlen - (l1 + 1);
n                 549 ext/standard/dns.c 					if (n) {
n                 550 ext/standard/dns.c 						memcpy(ZSTR_VAL(tp) + l2 , cp + l1 + 1, n);
n                 551 ext/standard/dns.c 						add_next_index_stringl(&entries, (char *) cp + l1 + 1, n);
n                 553 ext/standard/dns.c 					l1 = l1 + n + 1;
n                 554 ext/standard/dns.c 					l2 = l2 + n;
n                 566 ext/standard/dns.c 			n = dn_expand(answer->qb2, end, cp, name, (sizeof name) -2);
n                 567 ext/standard/dns.c 			if (n < 0) {
n                 570 ext/standard/dns.c 			cp += n;
n                 572 ext/standard/dns.c 			n = dn_expand(answer->qb2, end, cp, name, (sizeof name) -2);
n                 573 ext/standard/dns.c 			if (n < 0) {
n                 576 ext/standard/dns.c 			cp += n;
n                 579 ext/standard/dns.c 			GETLONG(n, cp);
n                 580 ext/standard/dns.c 			add_assoc_long(subarray, "serial", n);
n                 581 ext/standard/dns.c 			GETLONG(n, cp);
n                 582 ext/standard/dns.c 			add_assoc_long(subarray, "refresh", n);
n                 583 ext/standard/dns.c 			GETLONG(n, cp);
n                 584 ext/standard/dns.c 			add_assoc_long(subarray, "retry", n);
n                 585 ext/standard/dns.c 			GETLONG(n, cp);
n                 586 ext/standard/dns.c 			add_assoc_long(subarray, "expire", n);
n                 587 ext/standard/dns.c 			GETLONG(n, cp);
n                 588 ext/standard/dns.c 			add_assoc_long(subarray, "minimum-ttl", n);
n                 628 ext/standard/dns.c 			n = ((int)cp[0]) & 0xFF;
n                 630 ext/standard/dns.c 			add_assoc_long(subarray, "masklen", n);
n                 632 ext/standard/dns.c 			if (n > 15) {
n                 638 ext/standard/dns.c 			if (n % 16 > 8) {
n                 662 ext/standard/dns.c 			for (i = (n + 8) / 16; i < 8; i++) {
n                 693 ext/standard/dns.c 				n = dn_expand(answer->qb2, end, cp, name, (sizeof name) - 2);
n                 694 ext/standard/dns.c 				if (n < 0) {
n                 697 ext/standard/dns.c 				cp += n;
n                 704 ext/standard/dns.c 			GETSHORT(n, cp);
n                 705 ext/standard/dns.c 			add_assoc_long(subarray, "pri", n);
n                 706 ext/standard/dns.c 			GETSHORT(n, cp);
n                 707 ext/standard/dns.c 			add_assoc_long(subarray, "weight", n);
n                 708 ext/standard/dns.c 			GETSHORT(n, cp);
n                 709 ext/standard/dns.c 			add_assoc_long(subarray, "port", n);
n                 710 ext/standard/dns.c 			n = dn_expand(answer->qb2, end, cp, name, (sizeof name) - 2);
n                 711 ext/standard/dns.c 			if (n < 0) {
n                 714 ext/standard/dns.c 			cp += n;
n                 720 ext/standard/dns.c 			GETSHORT(n, cp);
n                 721 ext/standard/dns.c 			add_assoc_long(subarray, "order", n);
n                 722 ext/standard/dns.c 			GETSHORT(n, cp);
n                 723 ext/standard/dns.c 			add_assoc_long(subarray, "pref", n);
n                 726 ext/standard/dns.c 			n = (cp[0] & 0xFF);
n                 728 ext/standard/dns.c 			CHECKCP(n);
n                 729 ext/standard/dns.c 			add_assoc_stringl(subarray, "flags", (char*)cp, n);
n                 730 ext/standard/dns.c 			cp += n;
n                 733 ext/standard/dns.c 			n = (cp[0] & 0xFF);
n                 735 ext/standard/dns.c 			CHECKCP(n);
n                 736 ext/standard/dns.c 			add_assoc_stringl(subarray, "services", (char*)cp, n);
n                 737 ext/standard/dns.c 			cp += n;
n                 740 ext/standard/dns.c 			n = (cp[0] & 0xFF);
n                 742 ext/standard/dns.c 			CHECKCP(n);
n                 743 ext/standard/dns.c 			add_assoc_stringl(subarray, "regex", (char*)cp, n);
n                 744 ext/standard/dns.c 			cp += n;
n                 746 ext/standard/dns.c 			n = dn_expand(answer->qb2, end, cp, name, (sizeof name) - 2);
n                 747 ext/standard/dns.c 			if (n < 0) {
n                 750 ext/standard/dns.c 			cp += n;
n                 784 ext/standard/dns.c 	int n, qd, an, ns = 0, ar = 0;
n                 908 ext/standard/dns.c 			n = php_dns_search(handle, hostname, C_IN, type_to_fetch, answer.qb2, sizeof answer);
n                 910 ext/standard/dns.c 			if (n < 0) {
n                 933 ext/standard/dns.c 			end = answer.qb2 + n;
n                 942 ext/standard/dns.c 				n = dn_skipname(cp, end);
n                 943 ext/standard/dns.c 				if (n < 0) {
n                 949 ext/standard/dns.c 				cp += n + QFIXEDSZ;
n                 440 ext/standard/exec.c 		int k = 0, n = y - 1;
n                 441 ext/standard/exec.c 		for (; n >= 0 && '\\' == ZSTR_VAL(cmd)[n]; n--, k++);
n                 916 ext/standard/filestat.c 			int   groups, n, i;
n                 922 ext/standard/filestat.c 				n=getgroups(groups, gids);
n                 923 ext/standard/filestat.c 				for(i=0;i<n;i++){
n                 311 ext/standard/formatted_print.c 					 size_t width, char padding, size_t alignment, int n,
n                 317 ext/standard/formatted_print.c 	register int andbits = (1 << n) - 1;
n                 320 ext/standard/formatted_print.c 				  *buffer, pos, &ZSTR_LEN(*buffer), number, width, padding, alignment, n,
n                 322 ext/standard/formatted_print.c 	PRINTF_DEBUG(("sprintf: append2n 2^%d andbits=%x\n", n, andbits));
n                 329 ext/standard/formatted_print.c 		num >>= n;
n                 827 ext/standard/ftp_fopen_wrapper.c 		int n;
n                 839 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                 840 ext/standard/ftp_fopen_wrapper.c 		if (n != 6) {
n                  84 ext/standard/md5.c 	size_t           n;
n                  98 ext/standard/md5.c 	while ((n = php_stream_read(stream, (char*)buf, sizeof(buf))) > 0) {
n                  99 ext/standard/md5.c 		PHP_MD5Update(&context, buf, n);
n                 171 ext/standard/md5.c # define SET(n) \
n                 172 ext/standard/md5.c 	(*(php_uint32 *)&ptr[(n) * 4])
n                 173 ext/standard/md5.c # define GET(n) \
n                 174 ext/standard/md5.c 	SET(n)
n                 176 ext/standard/md5.c # define SET(n) \
n                 177 ext/standard/md5.c 	(ctx->block[(n)] = \
n                 178 ext/standard/md5.c 	(php_uint32)ptr[(n) * 4] | \
n                 179 ext/standard/md5.c 	((php_uint32)ptr[(n) * 4 + 1] << 8) | \
n                 180 ext/standard/md5.c 	((php_uint32)ptr[(n) * 4 + 2] << 16) | \
n                 181 ext/standard/md5.c 	((php_uint32)ptr[(n) * 4 + 3] << 24))
n                 182 ext/standard/md5.c # define GET(n) \
n                 183 ext/standard/md5.c 	(ctx->block[(n)])
n                 114 ext/standard/metaphone.c #define Look_Back_Letter(n)	(w_idx >= n ? toupper(word[w_idx-n]) : '\0')
n                 120 ext/standard/metaphone.c #define Look_Ahead_Letter(n) (toupper(Lookahead((char *) word+w_idx, n)))
n                 365 ext/standard/pack.c 					char n = *v++;
n                 367 ext/standard/pack.c 					if (n >= '0' && n <= '9') {
n                 368 ext/standard/pack.c 						n -= '0';
n                 369 ext/standard/pack.c 					} else if (n >= 'A' && n <= 'F') {
n                 370 ext/standard/pack.c 						n -= ('A' - 10);
n                 371 ext/standard/pack.c 					} else if (n >= 'a' && n <= 'f') {
n                 372 ext/standard/pack.c 						n -= ('a' - 10);
n                 374 ext/standard/pack.c 						php_error_docref(NULL, E_WARNING, "Type %c: illegal hex digit %c", code, n);
n                 375 ext/standard/pack.c 						n = 0;
n                 384 ext/standard/pack.c 					ZSTR_VAL(output)[outputpos] |= (n << nibbleshift);
n                 700 ext/standard/pack.c 			char n[256];
n                 704 ext/standard/pack.c 				snprintf(n, sizeof(n), "%.*s%d", namelen, name, i + 1);
n                 707 ext/standard/pack.c 				snprintf(n, sizeof(n), "%.*s", namelen, name);
n                 729 ext/standard/pack.c 						add_assoc_stringl(return_value, n, &input[inputpos], len);
n                 755 ext/standard/pack.c 						add_assoc_stringl(return_value, n, &input[inputpos], len + 1);
n                 779 ext/standard/pack.c 						add_assoc_stringl(return_value, n, &input[inputpos], len);
n                 822 ext/standard/pack.c 						add_assoc_stringl(return_value, n, buf, len);
n                 831 ext/standard/pack.c 						add_assoc_long(return_value, n, v);
n                 852 ext/standard/pack.c 						add_assoc_long(return_value, n, v);
n                 866 ext/standard/pack.c 						add_assoc_long(return_value, n, v);
n                 900 ext/standard/pack.c 						add_assoc_long(return_value, n, v);
n                 931 ext/standard/pack.c 						add_assoc_long(return_value, n, v);
n                 940 ext/standard/pack.c 						add_assoc_double(return_value, n, (double)v);
n                 948 ext/standard/pack.c 						add_assoc_double(return_value, n, v);
n                 118 ext/standard/php_crypt_r.c to64(char *s, int32_t v, int n)
n                 120 ext/standard/php_crypt_r.c 	while (--n >= 0) {
n                  55 ext/standard/php_smart_string.h #define smart_string_alloc4(d, n, what, newlen) do {					\
n                  58 ext/standard/php_smart_string.h 		newlen = (n);												\
n                  64 ext/standard/php_smart_string.h 		newlen = (d)->len + (n);									\
n                  72 ext/standard/php_smart_string.h #define smart_string_alloc(d, n, what) \
n                  73 ext/standard/php_smart_string.h 	smart_string_alloc4((d), (n), (what), newlen)
n                  43 ext/standard/php_var.h 	uint32_t n;
n                  68 ext/standard/php_var.h 		(d)->n = 0; \
n                 101 ext/standard/random.c 	ssize_t n;
n                 115 ext/standard/random.c 		n = syscall(SYS_getrandom, bytes + read_bytes, amount_to_read, 0);
n                 117 ext/standard/random.c 		if (n == -1) {
n                 133 ext/standard/random.c 		read_bytes += (size_t) n;
n                 139 ext/standard/random.c 	ssize_t n;
n                 169 ext/standard/random.c 		n = read(fd, bytes + read_bytes, size - read_bytes);
n                 170 ext/standard/random.c 		if (n <= 0) {
n                 173 ext/standard/random.c 		read_bytes += n;
n                  74 ext/standard/sha1.c 	size_t         n;
n                  88 ext/standard/sha1.c 	while ((n = php_stream_read(stream, (char *) buf, sizeof(buf))) > 0) {
n                  89 ext/standard/sha1.c 		PHP_SHA1Update(&context, buf, n);
n                 126 ext/standard/sha1.c #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
n                3227 ext/standard/string.c 			char *n = needle;
n                3230 ext/standard/string.c 			while ((o = (char*)php_memnstr(o, n, needle_len, endp))) {
n                3304 ext/standard/string.c 			char *n;
n                3308 ext/standard/string.c 			n = ZSTR_VAL(lc_needle);
n                3310 ext/standard/string.c 			while ((o = (char*)php_memnstr(o, n, ZSTR_LEN(lc_needle), endp))) {
n                3390 ext/standard/string.c 				char *n = needle;
n                3393 ext/standard/string.c 				while ((o = (char*)php_memnstr(o, n, needle_len, endp))) {
n                3529 ext/standard/string.c 	zend_string *n;
n                3535 ext/standard/string.c 	n = zend_string_alloc(ZSTR_LEN(str), 0);
n                3536 ext/standard/string.c 	p = ZSTR_VAL(n);
n                3546 ext/standard/string.c 	RETVAL_NEW_STR(n);
n                4630 ext/standard/string.c 	char c, *n, *t;
n                4640 ext/standard/string.c 	n = norm;
n                4651 ext/standard/string.c 				*(n++) = c;
n                4662 ext/standard/string.c 						*(n++) = c;
n                4672 ext/standard/string.c 	*(n++) = '>';
n                4673 ext/standard/string.c 	*n = '\0';
n                 104 ext/standard/url_scanner_ex.c #define YYFILL(n) goto done
n                 236 ext/standard/url_scanner_ex.c #define YYFILL(n) goto stop
n                 596 ext/standard/var.c 	data->n += 1;
n                 615 ext/standard/var.c 			data->n -= 1;
n                 621 ext/standard/var.c 		ZVAL_LONG(&zv_n, data->n);
n                 233 ext/standard/var_unserializer.c #define YYFILL(n) do { } while (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                 216 ext/xmlrpc/libxmlrpc/xmlrpc.c    n = 1000;
n                 220 ext/xmlrpc/libxmlrpc/xmlrpc.c       tm.tm_year += (text[i]-'0')*n;
n                 221 ext/xmlrpc/libxmlrpc/xmlrpc.c       n /= 10;
n                 223 ext/xmlrpc/libxmlrpc/xmlrpc.c    n = 10;
n                 227 ext/xmlrpc/libxmlrpc/xmlrpc.c       tm.tm_mon += (text[i+4]-'0')*n;
n                 228 ext/xmlrpc/libxmlrpc/xmlrpc.c       n /= 10;
n                 235 ext/xmlrpc/libxmlrpc/xmlrpc.c    n = 10;
n                 239 ext/xmlrpc/libxmlrpc/xmlrpc.c       tm.tm_mday += (text[i+6]-'0')*n;
n                 240 ext/xmlrpc/libxmlrpc/xmlrpc.c       n /= 10;
n                 243 ext/xmlrpc/libxmlrpc/xmlrpc.c    n = 10;
n                 247 ext/xmlrpc/libxmlrpc/xmlrpc.c       tm.tm_hour += (text[i+9]-'0')*n;
n                 248 ext/xmlrpc/libxmlrpc/xmlrpc.c       n /= 10;
n                 251 ext/xmlrpc/libxmlrpc/xmlrpc.c    n = 10;
n                 255 ext/xmlrpc/libxmlrpc/xmlrpc.c       tm.tm_min += (text[i+12]-'0')*n;
n                 256 ext/xmlrpc/libxmlrpc/xmlrpc.c       n /= 10;
n                 259 ext/xmlrpc/libxmlrpc/xmlrpc.c    n = 10;
n                 263 ext/xmlrpc/libxmlrpc/xmlrpc.c       tm.tm_sec += (text[i+15]-'0')*n;
n                 264 ext/xmlrpc/libxmlrpc/xmlrpc.c       n /= 10;
n                 398 ext/zip/lib/zip_close.c     size_t n;
n                 401 ext/zip/lib/zip_close.c 	n = len > sizeof(buf) ? sizeof(buf) : len;
n                 402 ext/zip/lib/zip_close.c 	if (_zip_read(za->src, buf, n, &za->error) < 0) {
n                 406 ext/zip/lib/zip_close.c 	if (_zip_write(za, buf, n) < 0) {
n                 410 ext/zip/lib/zip_close.c 	len -= n;
n                 421 ext/zip/lib/zip_close.c     zip_int64_t n;
n                 430 ext/zip/lib/zip_close.c     while ((n=zip_source_read(src, buf, sizeof(buf))) > 0) {
n                 431 ext/zip/lib/zip_close.c 	if (_zip_write(za, buf, (zip_uint64_t)n) < 0) {
n                 437 ext/zip/lib/zip_close.c     if (n < 0) {
n                 176 ext/zip/lib/zip_extra_field_api.c     zip_uint16_t n;
n                 190 ext/zip/lib/zip_extra_field_api.c     n = 0;
n                 193 ext/zip/lib/zip_extra_field_api.c 	    n++;
n                 195 ext/zip/lib/zip_extra_field_api.c     return (zip_int16_t)n;
n                 204 ext/zip/lib/zip_extra_field_api.c     zip_uint16_t n;
n                 218 ext/zip/lib/zip_extra_field_api.c     n = 0;
n                 221 ext/zip/lib/zip_extra_field_api.c 	    n++;
n                 223 ext/zip/lib/zip_extra_field_api.c     return (zip_int16_t)n;
n                  45 ext/zip/lib/zip_filerange_crc.c     zip_int64_t n;
n                  60 ext/zip/lib/zip_filerange_crc.c 	n = (zip_int64_t)(len > BUFSIZE ? BUFSIZE : len);
n                  61 ext/zip/lib/zip_filerange_crc.c 	if ((n = zip_source_read(src, buf, (zip_uint64_t)n)) < 0) {
n                  65 ext/zip/lib/zip_filerange_crc.c 	if (n == 0) {
n                  70 ext/zip/lib/zip_filerange_crc.c 	*crcp = crc32(*crcp, buf, (uInt)n);
n                  72 ext/zip/lib/zip_filerange_crc.c 	len -= (zip_uint64_t)n;
n                  41 ext/zip/lib/zip_fread.c     zip_int64_t n;
n                  57 ext/zip/lib/zip_fread.c     if ((n=zip_source_read(zf->src, outbuf, toread)) < 0) {
n                  62 ext/zip/lib/zip_fread.c     return n;
n                  41 ext/zip/lib/zip_get_num_entries.c     zip_uint64_t n;
n                  47 ext/zip/lib/zip_get_num_entries.c 	n = za->nentry;
n                  48 ext/zip/lib/zip_get_num_entries.c 	while (n>0 && za->entry[n-1].orig == NULL)
n                  49 ext/zip/lib/zip_get_num_entries.c 	    --n;
n                  50 ext/zip/lib/zip_get_num_entries.c 	return (zip_int64_t)n;
n                  42 ext/zip/lib/zip_io_util.c     zip_int64_t n;
n                  49 ext/zip/lib/zip_io_util.c     if ((n = zip_source_read(src, b, length)) < 0) {
n                  54 ext/zip/lib/zip_io_util.c     if (n < (zip_int64_t)length) {
n                 126 ext/zip/lib/zip_io_util.c     zip_int64_t n;
n                 128 ext/zip/lib/zip_io_util.c     if ((n = zip_source_write(za->src, data, length)) < 0) {
n                 132 ext/zip/lib/zip_io_util.c     if ((zip_uint64_t)n != length) {
n                 331 ext/zip/lib/zip_source_buffer.c     zip_uint64_t n, i, fragment_offset;
n                 344 ext/zip/lib/zip_source_buffer.c     n = 0;
n                 345 ext/zip/lib/zip_source_buffer.c     while (n < length) {
n                 346 ext/zip/lib/zip_source_buffer.c 	zip_uint64_t left = ZIP_MIN(length - n, buffer->fragment_size - fragment_offset);
n                 348 ext/zip/lib/zip_source_buffer.c 	memcpy(data + n, buffer->fragments[i] + fragment_offset, left);
n                 350 ext/zip/lib/zip_source_buffer.c 	n += left;
n                 355 ext/zip/lib/zip_source_buffer.c     buffer->offset += n;
n                 356 ext/zip/lib/zip_source_buffer.c     return (zip_int64_t)n;
n                 377 ext/zip/lib/zip_source_buffer.c     zip_uint64_t n, i, fragment_offset;
n                 418 ext/zip/lib/zip_source_buffer.c     n = 0;
n                 419 ext/zip/lib/zip_source_buffer.c     while (n < length) {
n                 420 ext/zip/lib/zip_source_buffer.c 	zip_uint64_t left = ZIP_MIN(length - n, buffer->fragment_size - fragment_offset);
n                 422 ext/zip/lib/zip_source_buffer.c 	memcpy(buffer->fragments[i] + fragment_offset, data + n, left);
n                 424 ext/zip/lib/zip_source_buffer.c 	n += left;
n                 429 ext/zip/lib/zip_source_buffer.c     buffer->offset += n;
n                 434 ext/zip/lib/zip_source_buffer.c     return (zip_int64_t)n;
n                  84 ext/zip/lib/zip_source_crc.c     zip_int64_t n;
n                  94 ext/zip/lib/zip_source_crc.c             if ((n = zip_source_read(src, data, len)) < 0) {
n                  99 ext/zip/lib/zip_source_crc.c             if (n == 0) {
n                 126 ext/zip/lib/zip_source_crc.c 		for (i = ctx->crc_position - ctx->position; i < (zip_uint64_t)n; i += nn) {
n                 127 ext/zip/lib/zip_source_crc.c 		    nn = ZIP_MIN(UINT_MAX, (zip_uint64_t)n-i);
n                 133 ext/zip/lib/zip_source_crc.c             ctx->position += (zip_uint64_t)n;
n                 134 ext/zip/lib/zip_source_crc.c             return n;
n                  99 ext/zip/lib/zip_source_deflate.c     zip_int64_t n;
n                 154 ext/zip/lib/zip_source_deflate.c 		if ((n=zip_source_read(src, ctx->buffer, sizeof(ctx->buffer))) < 0) {
n                 159 ext/zip/lib/zip_source_deflate.c 		else if (n == 0) {
n                 170 ext/zip/lib/zip_source_deflate.c 		    ctx->zstr.avail_in = (uInt)n;
n                 199 ext/zip/lib/zip_source_deflate.c     zip_int64_t n;
n                 245 ext/zip/lib/zip_source_deflate.c 		if ((n=zip_source_read(src, ctx->buffer, sizeof(ctx->buffer))) < 0) {
n                 250 ext/zip/lib/zip_source_deflate.c 		else if (n == 0) {
n                 255 ext/zip/lib/zip_source_deflate.c 		    ctx->zstr.avail_in = (uInt)n;
n                 349 ext/zip/lib/zip_source_deflate.c     zip_int64_t n;
n                 356 ext/zip/lib/zip_source_deflate.c             if ((n=zip_source_read(src, ctx->buffer, sizeof(ctx->buffer))) < 0) {
n                 365 ext/zip/lib/zip_source_deflate.c             ctx->zstr.avail_in = (uInt)n;
n                 226 ext/zip/lib/zip_source_filep.c     zip_uint64_t n;
n                 297 ext/zip/lib/zip_source_filep.c                 n = ctx->end-ctx->current;
n                 298 ext/zip/lib/zip_source_filep.c                 if (n > len) {
n                 299 ext/zip/lib/zip_source_filep.c                     n = len;
n                 303 ext/zip/lib/zip_source_filep.c                 n = len;
n                 306 ext/zip/lib/zip_source_filep.c             if (n > SIZE_MAX)
n                 307 ext/zip/lib/zip_source_filep.c                 n = SIZE_MAX;
n                 309 ext/zip/lib/zip_source_filep.c             if ((i=fread(buf, 1, (size_t)n, ctx->f)) == 0) {
n                 132 ext/zip/lib/zip_source_pkware.c     zip_int64_t n;
n                 135 ext/zip/lib/zip_source_pkware.c     if ((n=zip_source_read(src, header, HEADERLEN)) < 0) {
n                 140 ext/zip/lib/zip_source_pkware.c     if (n != HEADERLEN) {
n                 168 ext/zip/lib/zip_source_pkware.c     zip_int64_t n;
n                 179 ext/zip/lib/zip_source_pkware.c             if ((n=zip_source_read(src, data, len)) < 0) {
n                 184 ext/zip/lib/zip_source_pkware.c             decrypt((struct trad_pkware *)ud, (zip_uint8_t *)data, (zip_uint8_t *)data, (zip_uint64_t)n, 0);
n                 185 ext/zip/lib/zip_source_pkware.c             return n;
n                 147 ext/zip/lib/zip_source_win32handle.c     zip_uint64_t n;
n                 212 ext/zip/lib/zip_source_win32handle.c 	    n = ctx->end - ctx->current;
n                 213 ext/zip/lib/zip_source_win32handle.c 	    if (n > len) {
n                 214 ext/zip/lib/zip_source_win32handle.c 		n = len;
n                 218 ext/zip/lib/zip_source_win32handle.c 	    n = len;
n                 221 ext/zip/lib/zip_source_win32handle.c 	if (n > SIZE_MAX)
n                 222 ext/zip/lib/zip_source_win32handle.c 	    n = SIZE_MAX;
n                 230 ext/zip/lib/zip_source_win32handle.c 	if (!ReadFile(ctx->h, buf, (DWORD)n, &i, NULL)) {
n                 118 ext/zip/lib/zip_source_window.c     zip_uint64_t n, i;
n                 136 ext/zip/lib/zip_source_window.c                 for (n=0; n<ctx->start; n+=(zip_uint64_t)ret) {
n                 137 ext/zip/lib/zip_source_window.c                     i = (ctx->start-n > sizeof(b) ? sizeof(b) : ctx->start-n);
n                 239 ext/zip/lib/zip_source_window.c         unsigned int n;
n                 240 ext/zip/lib/zip_source_window.c         n = za->nopen_source_alloc + 10;
n                 241 ext/zip/lib/zip_source_window.c         open_source = (zip_source_t **)realloc(za->open_source, n*sizeof(zip_source_t *));
n                 246 ext/zip/lib/zip_source_window.c         za->nopen_source_alloc = n;
n                 141 ext/zip/php_zip.c 	int n, len, ret;
n                 244 ext/zip/php_zip.c 		n = -1;
n                 250 ext/zip/php_zip.c 		n = -1;
n                 255 ext/zip/php_zip.c 	n = 0;
n                 257 ext/zip/php_zip.c 	while ((n=zip_fread(zf, b, sizeof(b))) > 0) {
n                 258 ext/zip/php_zip.c 		php_stream_write(stream, b, n);
n                 262 ext/zip/php_zip.c 	n = zip_fclose(zf);
n                 270 ext/zip/php_zip.c 	if (n<0) {
n                 502 ext/zip/php_zip.c 	int n;
n                 566 ext/zip/php_zip.c 	for (n = 0; n < globbuf.gl_pathc; n++) {
n                 578 ext/zip/php_zip.c 			if (0 != VCWD_STAT(globbuf.gl_pathv[n], &s)) {
n                 586 ext/zip/php_zip.c 		add_next_index_string(return_value, globbuf.gl_pathv[n]+cwd_skip);
n                1269 ext/zip/php_zip.c 	int n = 0;
n                1285 ext/zip/php_zip.c 		n = zip_fread(zr_rsrc->zf, ZSTR_VAL(buffer), ZSTR_LEN(buffer));
n                1286 ext/zip/php_zip.c 		if (n > 0) {
n                1287 ext/zip/php_zip.c 			ZSTR_VAL(buffer)[n] = '\0';
n                1288 ext/zip/php_zip.c 			ZSTR_LEN(buffer) = n;
n                2694 ext/zip/php_zip.c 	int n = 0;
n                2732 ext/zip/php_zip.c 	n = zip_fread(zf, ZSTR_VAL(buffer), ZSTR_LEN(buffer));
n                2733 ext/zip/php_zip.c 	if (n < 1) {
n                2739 ext/zip/php_zip.c 	ZSTR_VAL(buffer)[n] = '\0';
n                2740 ext/zip/php_zip.c 	ZSTR_LEN(buffer) = n;
n                  48 ext/zip/zip_stream.c 	ssize_t n = 0;
n                  52 ext/zip/zip_stream.c 		n = zip_fread(self->zf, buf, count);
n                  53 ext/zip/zip_stream.c 		if (n < 0) {
n                  70 ext/zip/zip_stream.c 		if (n == 0 || n < (ssize_t)count) {
n                  73 ext/zip/zip_stream.c 			self->cursor += n;
n                  76 ext/zip/zip_stream.c 	return (n < 1 ? 0 : (size_t)n);
n                 770 main/fastcgi.c 		int n;
n                 775 main/fastcgi.c 			n = 0;
n                 777 main/fastcgi.c 				if (*cur == ',') n++;
n                 780 main/fastcgi.c 			allowed_clients = malloc(sizeof(sa_t) * (n+2));
n                 781 main/fastcgi.c 			n = 0;
n                 789 main/fastcgi.c 				if (inet_pton(AF_INET, cur, &allowed_clients[n].sa_inet.sin_addr)>0) {
n                 790 main/fastcgi.c 					allowed_clients[n].sa.sa_family = AF_INET;
n                 791 main/fastcgi.c 					n++;
n                 793 main/fastcgi.c 				} else if (inet_pton(AF_INET6, cur, &allowed_clients[n].sa_inet6.sin6_addr)>0) {
n                 794 main/fastcgi.c 					allowed_clients[n].sa.sa_family = AF_INET6;
n                 795 main/fastcgi.c 					n++;
n                 802 main/fastcgi.c 			allowed_clients[n].sa.sa_family = 0;
n                 804 main/fastcgi.c 			if (!n) {
n                 829 main/fastcgi.c 	int n;
n                 834 main/fastcgi.c 		n = 0;
n                 836 main/fastcgi.c 			if (*cur == ',') n++;
n                 840 main/fastcgi.c 		allowed_clients = malloc(sizeof(sa_t) * (n+2));
n                 841 main/fastcgi.c 		n = 0;
n                 849 main/fastcgi.c 			if (inet_pton(AF_INET, cur, &allowed_clients[n].sa_inet.sin_addr)>0) {
n                 850 main/fastcgi.c 				allowed_clients[n].sa.sa_family = AF_INET;
n                 851 main/fastcgi.c 				n++;
n                 853 main/fastcgi.c 			} else if (inet_pton(AF_INET6, cur, &allowed_clients[n].sa_inet6.sin6_addr)>0) {
n                 854 main/fastcgi.c 				allowed_clients[n].sa.sa_family = AF_INET6;
n                 855 main/fastcgi.c 				n++;
n                 862 main/fastcgi.c 		allowed_clients[n].sa.sa_family = 0;
n                 864 main/fastcgi.c 		if (!n) {
n                 918 main/fastcgi.c 	size_t n = 0;
n                 926 main/fastcgi.c 		tmp = count - n;
n                 931 main/fastcgi.c 			ret = write(req->fd, ((char*)buf)+n, out_len);
n                 935 main/fastcgi.c 			ret = send(req->fd, ((char*)buf)+n, out_len, 0);
n                 941 main/fastcgi.c 		ret = write(req->fd, ((char*)buf)+n, count-n);
n                 944 main/fastcgi.c 			n += ret;
n                 948 main/fastcgi.c 	} while (n != count);
n                 949 main/fastcgi.c 	return n;
n                 955 main/fastcgi.c 	size_t n = 0;
n                 963 main/fastcgi.c 		tmp = count - n;
n                 968 main/fastcgi.c 			ret = read(req->fd, ((char*)buf)+n, in_len);
n                 972 main/fastcgi.c 			ret = recv(req->fd, ((char*)buf)+n, in_len, 0);
n                 978 main/fastcgi.c 		ret = read(req->fd, ((char*)buf)+n, count-n);
n                 981 main/fastcgi.c 			n += ret;
n                 983 main/fastcgi.c 			return n;
n                 987 main/fastcgi.c 	} while (n != count);
n                 988 main/fastcgi.c 	return n;
n                1205 main/fastcgi.c 	int ret, n, rest;
n                1209 main/fastcgi.c 	n = 0;
n                1222 main/fastcgi.c 				return n;
n                1237 main/fastcgi.c 			n += ret;
n                1247 main/fastcgi.c 				return n;
n                1250 main/fastcgi.c 			return n;
n                1253 main/fastcgi.c 	return n;
n                  69 main/mergesort.c static void setup(u_char *list1, u_char *list2, size_t n, size_t size, int (*cmp)(const void *, const void *));
n                  70 main/mergesort.c static void insertionsort(u_char *a, size_t n, size_t size, int (*cmp)(const void *, const void *));
n                 265 main/mergesort.c static void setup(u_char *list1, u_char *list2, size_t n, size_t size, int (*cmp)(const void *, const void *))
n                 271 main/mergesort.c 	if (n <= 5) {
n                 272 main/mergesort.c 		insertionsort(list1, n, size, cmp);
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);
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                 336 main/mergesort.c static void insertionsort(u_char *a, size_t n, size_t size, int (*cmp)(const void *, const void *))
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 			*error_string = strpprintf(0, "php_network_getaddresses: getaddrinfo failed: %s", PHP_GAI_STRERROR(n));
n                 218 main/network.c 			php_error_docref(NULL, 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                 273 main/network.c 	n = 1;
n                 277 main/network.c 	return n;
n                 318 main/network.c 	int n;
n                 325 main/network.c 	if ((n = connect(sockfd, addr, addrlen)) != 0) {
n                 345 main/network.c 	if (n == 0) {
n                 356 main/network.c 	if ((n = php_pollfd_for(sockfd, POLLOUT|POLLPRI, timeout)) == 0) {
n                 358 main/network.c 	if ((n = php_pollfd_for(sockfd, PHP_POLLREADABLE|POLLOUT, timeout)) == 0) {
n                 363 main/network.c 	if (n > 0) {
n                 427 main/network.c 	int num_addrs, n, err = 0;
n                 492 main/network.c 			n = bind(sock, sa, socklen);
n                 494 main/network.c 			if (n != SOCK_CONN_ERR) {
n                 529 main/network.c 	int n;
n                 572 main/network.c 	n = php_network_getaddresses(tmp, SOCK_DGRAM, &psal, &errstr);
n                 574 main/network.c 	if (n == 0) {
n                 734 main/network.c 	int error = 0, n;
n                 738 main/network.c 	n = php_pollfd_for(srvsock, PHP_POLLREADABLE, timeout);
n                 740 main/network.c 	if (n == 0) {
n                 742 main/network.c 	} else if (n == -1) {
n                 784 main/network.c 	int num_addrs, n, fatal = 0;
n                 906 main/network.c 			n = php_network_connect_socket(sock, sa, socklen, asynchronous,
n                 910 main/network.c 			if (n != -1) {
n                1203 main/network.c 	int n;
n                1240 main/network.c 	n = select(max_fd + 1, &rset, &wset, &eset, timeout >= 0 ? &tv : NULL);
n                1242 main/network.c 	if (n >= 0) {
n                1258 main/network.c 	return n;
n                 194 main/php.h     #  define memcpy(d, s, n)	bcopy((s), (d), (n))
n                 197 main/php.h     #  define memmove(d, s, n)	bcopy ((s), (d), (n))
n                  35 main/php_network.h #define shutdown(s,n)	/* nothing */
n                 167 main/php_network.h 	int n;
n                 173 main/php_network.h 	n = php_poll2(&p, 1, php_tvtoto(timeouttv));
n                 175 main/php_network.h 	if (n > 0) {
n                 179 main/php_network.h 	return n;
n                 185 main/php_network.h 	int n;
n                 191 main/php_network.h 	n = php_poll2(&p, 1, timeout);
n                 193 main/php_network.h 	if (n > 0) {
n                 197 main/php_network.h 	return n;
n                 209 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                 214 main/php_network.h # define PHP_SAFE_MAX_FD(m, n)		do { if (m >= FD_SETSIZE) { _php_emit_fd_setsize_warning(m); m = FD_SETSIZE - 1; }} while(0)
n                 255 main/streams/filter.c 	int n;
n                 258 main/streams/filter.c 	n = (int)strlen(filtername);
n                 260 main/streams/filter.c 	if (NULL != (factory = zend_hash_str_find_ptr(filter_hash, filtername, n))) {
n                 266 main/streams/filter.c 		wildname = emalloc(n+3);
n                 267 main/streams/filter.c 		memcpy(wildname, filtername, n+1);
n                1227 main/streams/plain_wrapper.c 				int n = 0;
n                1231 main/streams/plain_wrapper.c 					++n;
n                1238 main/streams/plain_wrapper.c 						if (!n) break;
n                1239 main/streams/plain_wrapper.c 						--n;
n                1756 main/streams/streams.c 	int n = 0;
n                1767 main/streams/streams.c 		n++;
n                1770 main/streams/streams.c 	if ((*p == ':') && (n > 1) && (!strncmp("//", p+1, 2) || (n == 4 && !memcmp("data:", path, 5)))) {
n                1772 main/streams/streams.c 	} else if (n == 5 && strncasecmp(path, "zlib:", 5) == 0) {
n                1775 main/streams/streams.c 		n = 13;
n                1780 main/streams/streams.c 		char *tmp = estrndup(protocol, n);
n                1781 main/streams/streams.c 		if (NULL == (wrapper = zend_hash_str_find_ptr(wrapper_hash, (char*)tmp, n))) {
n                1782 main/streams/streams.c 			php_strtolower(tmp, n);
n                1783 main/streams/streams.c 			if (NULL == (wrapper = zend_hash_str_find_ptr(wrapper_hash, (char*)tmp, n))) {
n                1786 main/streams/streams.c 				if (n >= sizeof(wrapper_name)) {
n                1787 main/streams/streams.c 					n = sizeof(wrapper_name) - 1;
n                1789 main/streams/streams.c 				PHP_STRLCPY(wrapper_name, protocol, sizeof(wrapper_name), n);
n                1800 main/streams/streams.c 	if (!protocol || !strncasecmp(protocol, "file", n))	{
n                1812 main/streams/streams.c 			if (localhost == 0 && path[n+3] != '\0' && path[n+3] != '/' && path[n+4] != ':')	{
n                1814 main/streams/streams.c 			if (localhost == 0 && path[n+3] != '\0' && path[n+3] != '/') {
n                1824 main/streams/streams.c 				*path_for_open = (char*)path + n + 1;
n                1871 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 (NULL == (factory = zend_hash_str_find_ptr(&xport_hash, tmp, n))) {
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                 188 main/streams/xp_socket.c 	int n;
n                 213 main/streams/xp_socket.c 				n = php_pollfd_for_ms(sock->socket, POLLOUT, 500);
n                 214 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                 149 sapi/apache2handler/apache_config.c 	php_conf_rec *d = base_conf, *e = new_conf, *n = NULL;
n                 151 sapi/apache2handler/apache_config.c 	n = create_php_config(p, "merge_php_config");
n                 153 sapi/apache2handler/apache_config.c 	zend_hash_copy(&n->config, &d->config, config_entry_ctor);
n                 155 sapi/apache2handler/apache_config.c 	phpapdebug((stderr, "Merge dir (%p)+(%p)=(%p)\n", base_conf, new_conf, n));
n                 156 sapi/apache2handler/apache_config.c 	zend_hash_merge_ex(&n->config, &e->config, config_entry_ctor, should_overwrite_per_dir_entry, NULL);
n                 157 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                 794 sapi/cli/php_cli_server.c 	struct socket_entry *n = entries, *m;
n                 797 sapi/cli/php_cli_server.c 		n->events = POLLIN;
n                 798 sapi/cli/php_cli_server.c 		n->fd = poller->active.rfds.fd_array[i];
n                 799 sapi/cli/php_cli_server.c 		n++;
n                 802 sapi/cli/php_cli_server.c 	m = n;
n                 812 sapi/cli/php_cli_server.c 			assert(n < entries + FD_SETSIZE * 2);
n                 813 sapi/cli/php_cli_server.c 			n->events = POLLOUT;
n                 814 sapi/cli/php_cli_server.c 			n->fd = fd;
n                 815 sapi/cli/php_cli_server.c 			n++;
n                 821 sapi/cli/php_cli_server.c 		for (; e < n; e++) {
n                1487 sapi/cli/php_cli_server.c 		char *n = p;
n                1488 sapi/cli/php_cli_server.c 		while (n < decoded_vpath_end && *n == '/') n++;
n                1489 sapi/cli/php_cli_server.c 		memmove(++p, n, decoded_vpath_end - n);
n                1490 sapi/cli/php_cli_server.c 		decoded_vpath_end -= n - p;
n                1494 sapi/cli/php_cli_server.c 		char *n = p;
n                1495 sapi/cli/php_cli_server.c 		while (n < decoded_vpath_end && *n != '/') n++;
n                1496 sapi/cli/php_cli_server.c 		if (n - p == 2 && p[0] == '.' && p[1] == '.') {
n                1512 sapi/cli/php_cli_server.c 			while (n < decoded_vpath_end && *n == '/') n++;
n                1513 sapi/cli/php_cli_server.c 			memmove(p, n, decoded_vpath_end - n);
n                1514 sapi/cli/php_cli_server.c 			decoded_vpath_end -= n - p;
n                1515 sapi/cli/php_cli_server.c 		} else if (n - p == 1 && p[0] == '.') {
n                1516 sapi/cli/php_cli_server.c 			while (n < decoded_vpath_end && *n == '/') n++;
n                1517 sapi/cli/php_cli_server.c 			memmove(p, n, decoded_vpath_end - n);
n                1518 sapi/cli/php_cli_server.c 			decoded_vpath_end -= n - p;
n                1520 sapi/cli/php_cli_server.c 			if (n < decoded_vpath_end) {
n                1521 sapi/cli/php_cli_server.c 				char *nn = n;
n                1523 sapi/cli/php_cli_server.c 				p = n + 1;
n                1527 sapi/cli/php_cli_server.c 				p = n;
n                2439 sapi/cli/php_cli_server.c 		int n = php_cli_server_poller_poll(&server->poller, &tv);
n                2440 sapi/cli/php_cli_server.c 		if (n > 0) {
n                2444 sapi/cli/php_cli_server.c 		} else if (n == 0) {
n                  48 sapi/fpm/fpm/fpm_arrays.h static inline void *fpm_array_item(struct fpm_array_s *a, unsigned int n) /* {{{ */
n                  52 sapi/fpm/fpm/fpm_arrays.h 	ret = (char *) a->data + a->sz * n;
n                  64 sapi/fpm/fpm/fpm_arrays.h static inline int fpm_array_item_remove(struct fpm_array_s *a, unsigned int 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                1488 sapi/fpm/fpm/fpm_conf.c 	int fd, n;
n                1516 sapi/fpm/fpm/fpm_conf.c 		for (n = 0; (nb_read = read(fd, &c, sizeof(char))) == sizeof(char) && c != '\n'; n++) {
n                1517 sapi/fpm/fpm/fpm_conf.c 			if (n == bufsize) {
n                1529 sapi/fpm/fpm/fpm_conf.c 			buf[n] = c;
n                1531 sapi/fpm/fpm/fpm_conf.c 		if (n == 0) {
n                1535 sapi/fpm/fpm/fpm_conf.c 		buf[n++] = '\n';
n                1536 sapi/fpm/fpm/fpm_conf.c 		buf[n] = '\0';
n                  43 sapi/fpm/fpm/fpm_unix.c 	int n;
n                  62 sapi/fpm/fpm/fpm_unix.c 	n = 0;
n                  65 sapi/fpm/fpm/fpm_unix.c 		n++;
n                  67 sapi/fpm/fpm/fpm_unix.c 			n++;
n                  72 sapi/fpm/fpm/fpm_unix.c 		n++;
n                  74 sapi/fpm/fpm/fpm_unix.c 			n++;
n                  78 sapi/fpm/fpm/fpm_unix.c 	if (n) {
n                  84 sapi/fpm/fpm/fpm_unix.c 		acl = acl_init(n);
n                 995 sapi/litespeed/lsapi_main.c     int n;
n                1096 sapi/litespeed/lsapi_main.c             n = ((long) tv_req_end.tv_sec - tv_req_begin.tv_sec ) * 1000
n                1098 sapi/litespeed/lsapi_main.c             if ( n > slow_script_msec )
n                1102 sapi/litespeed/lsapi_main.c                          time_buf, n,  LSAPI_GetRequestMethod(),
n                 324 sapi/litespeed/lsapilib.c     int n = count;
n                 327 sapi/litespeed/lsapilib.c         ret = writev( fd, *pVec, n );
n                 392 sapi/litespeed/lsapilib.c static int allocateIovec( LSAPI_Request * pReq, int n )
n                 395 sapi/litespeed/lsapilib.c                 pReq->m_pIovec, sizeof(struct iovec) * n );
n                 401 sapi/litespeed/lsapilib.c     pReq->m_pIovecEnd = p + n;
n                 728 sapi/litespeed/lsapilib.c     int n = snprintf(achError, 1024, "%s:%s: %s\n", pErr1, (pErr2)?pErr2:"", strerror( errno ) );
n                 730 sapi/litespeed/lsapilib.c         LSAPI_Write_Stderr_r( pReq, achError, n );
n                 732 sapi/litespeed/lsapilib.c         write( STDERR_FILENO, achError, n );
n                1709 sapi/litespeed/lsapilib.c     int n = 0 ;
n                1712 sapi/litespeed/lsapilib.c     vec[n].sfv_fd   = fdIn;
n                1713 sapi/litespeed/lsapilib.c     vec[n].sfv_flag = 0;
n                1714 sapi/litespeed/lsapilib.c     vec[n].sfv_off  = *off;
n                1715 sapi/litespeed/lsapilib.c     vec[n].sfv_len  = size;
n                1716 sapi/litespeed/lsapilib.c     ++n;
n                1719 sapi/litespeed/lsapilib.c     ssize_t ret = sendfilev( fdOut, vec, n, &written );
n                1793 sapi/litespeed/lsapilib.c     int n;
n                1796 sapi/litespeed/lsapilib.c     n = pReq->m_pIovecCur - pReq->m_pIovecToWrite;
n                1797 sapi/litespeed/lsapilib.c     if (( 0 == n )&&( pReq->m_pRespBufPos == pReq->m_pRespBuf ))
n                1815 sapi/litespeed/lsapilib.c     n = pReq->m_pIovecCur - pReq->m_pIovecToWrite;
n                1816 sapi/litespeed/lsapilib.c     if ( n > 0 )
n                1820 sapi/litespeed/lsapilib.c                   n, pReq->m_totalLen );
n                2126 sapi/litespeed/lsapilib.c             int n, LSAPI_CB_EnvHandler fn, void * arg )
n                2128 sapi/litespeed/lsapilib.c     struct LSAPI_key_value_pair * pEnd = pEnv + n;
n                2140 sapi/litespeed/lsapilib.c     return n;
n                3211 sapi/litespeed/lsapilib.c     int n;
n                3218 sapi/litespeed/lsapilib.c         n = atoi( p );
n                3219 sapi/litespeed/lsapilib.c         if ( n > 0 )
n                3220 sapi/litespeed/lsapilib.c             LSAPI_Set_Max_Reqs( n );
n                3238 sapi/litespeed/lsapilib.c         n = atoi( p );
n                3239 sapi/litespeed/lsapilib.c         LSAPI_Set_Slow_Req_Msecs( n );
n                3257 sapi/litespeed/lsapilib.c         n = atoi( p );
n                3258 sapi/litespeed/lsapilib.c         LSAPI_Set_Max_Idle( n );
n                3264 sapi/litespeed/lsapilib.c         n = atoi( p );
n                3265 sapi/litespeed/lsapilib.c         s_keepListener = n;
n                3271 sapi/litespeed/lsapilib.c         n = 0;
n                3276 sapi/litespeed/lsapilib.c             n = atoi( p );
n                3277 sapi/litespeed/lsapilib.c         if ( n > 1 )
n                3279 sapi/litespeed/lsapilib.c             LSAPI_Init_Prefork_Server( n, fp, avoidFork );
n                  24 sapi/phpdbg/phpdbg_btree.c #define CHOOSE_BRANCH(n) \
n                  25 sapi/phpdbg/phpdbg_btree.c 	branch = branch->branches[!!(n)];
n                 215 sapi/phpdbg/phpdbg_help.c 	int n;
n                 223 sapi/phpdbg/phpdbg_help.c 	    n = get_command(param->str, param->len, &cmd, phpdbg_prompt_commands);
n                 225 sapi/phpdbg/phpdbg_help.c 		if (n==1) {
n                 230 sapi/phpdbg/phpdbg_help.c 		} else if (n>1) {
n                 245 sapi/phpdbg/phpdbg_help.c 		    n = get_command( param->str, param->len, &cmd, phpdbg_help_commands);
n                 247 sapi/phpdbg/phpdbg_help.c 			if (n>0) {
n                  24 sapi/phpdbg/phpdbg_lexer.c #define YYFILL(n)