q                1118 Zend/zend_API.c 					zval *q = &CE_STATIC_MEMBERS(class_type->parent)[i];
q                1120 Zend/zend_API.c 					ZVAL_NEW_REF(q, q);
q                1121 Zend/zend_API.c 					ZVAL_COPY_VALUE(&CE_STATIC_MEMBERS(class_type)[i], q);
q                1122 Zend/zend_API.c 					Z_ADDREF_P(q);
q                1880 Zend/zend_alloc.c 	zend_mm_free_slot *p, **q;
q                1924 Zend/zend_alloc.c 		q = &heap->free_slot[i];
q                1925 Zend/zend_alloc.c 		p = *q;
q                1944 Zend/zend_alloc.c 				*q = p;
q                1946 Zend/zend_alloc.c 				q = &p->next_free_slot;
q                1947 Zend/zend_alloc.c 				p = *q;
q                2086 Zend/zend_alloc.c 		zend_mm_huge_list *q = list;
q                2104 Zend/zend_alloc.c 		zend_mm_chunk_free(heap, q->ptr, q->size);
q                2105 Zend/zend_alloc.c 		zend_mm_free_heap(heap, q, NULL, 0, NULL, 0);
q                2209 Zend/zend_alloc.c 		zend_mm_huge_list *q = list;
q                2211 Zend/zend_alloc.c 		zend_mm_chunk_free(heap, q->ptr, q->size);
q                2217 Zend/zend_alloc.c 		zend_mm_chunk *q = p->next;
q                2220 Zend/zend_alloc.c 		p = q;
q                2249 Zend/zend_alloc.c 			zend_mm_chunk *q = p->next;
q                2251 Zend/zend_alloc.c 			p->next = q;
q                2252 Zend/zend_alloc.c 			p = q;
q                 485 Zend/zend_builtin_functions.c 	zval *p, *q;
q                 507 Zend/zend_builtin_functions.c 					q = p;
q                 508 Zend/zend_builtin_functions.c 					if (EXPECTED(Z_TYPE_INFO_P(q) != IS_UNDEF)) {
q                 509 Zend/zend_builtin_functions.c 						ZVAL_DEREF(q);
q                 510 Zend/zend_builtin_functions.c 						if (Z_OPT_REFCOUNTED_P(q)) { 
q                 511 Zend/zend_builtin_functions.c 							Z_ADDREF_P(q);
q                 515 Zend/zend_builtin_functions.c 					ZEND_HASH_FILL_ADD(q);
q                 522 Zend/zend_builtin_functions.c 				q = p;
q                 523 Zend/zend_builtin_functions.c 				if (EXPECTED(Z_TYPE_INFO_P(q) != IS_UNDEF)) {
q                 524 Zend/zend_builtin_functions.c 					ZVAL_DEREF(q);
q                 525 Zend/zend_builtin_functions.c 					if (Z_OPT_REFCOUNTED_P(q)) { 
q                 526 Zend/zend_builtin_functions.c 						Z_ADDREF_P(q);
q                 530 Zend/zend_builtin_functions.c 				ZEND_HASH_FILL_ADD(q);
q                 771 Zend/zend_hash.c 				Bucket *q = ht->arData + ht->nNumUsed;
q                 772 Zend/zend_hash.c 				while (q != p) {
q                 773 Zend/zend_hash.c 					ZVAL_UNDEF(&q->val);
q                 774 Zend/zend_hash.c 					q++;
q                 930 Zend/zend_hash.c 				Bucket *q = p;
q                 936 Zend/zend_hash.c 							ZVAL_COPY_VALUE(&q->val, &p->val);
q                 937 Zend/zend_hash.c 							q->h = p->h;
q                 938 Zend/zend_hash.c 							nIndex = q->h | ht->nTableMask;
q                 939 Zend/zend_hash.c 							q->key = p->key;
q                 940 Zend/zend_hash.c 							Z_NEXT(q->val) = HT_HASH(ht, nIndex);
q                 945 Zend/zend_hash.c 							q++;
q                 955 Zend/zend_hash.c 							ZVAL_COPY_VALUE(&q->val, &p->val);
q                 956 Zend/zend_hash.c 							q->h = p->h;
q                 957 Zend/zend_hash.c 							nIndex = q->h | ht->nTableMask;
q                 958 Zend/zend_hash.c 							q->key = p->key;
q                 959 Zend/zend_hash.c 							Z_NEXT(q->val) = HT_HASH(ht, nIndex);
q                 968 Zend/zend_hash.c 							q++;
q                1684 Zend/zend_hash.c static zend_always_inline int zend_array_dup_element(HashTable *source, HashTable *target, uint32_t idx, Bucket *p, Bucket *q, int packed, int static_keys, int with_holes)
q                1718 Zend/zend_hash.c 	ZVAL_COPY_VALUE(&q->val, data);
q                1720 Zend/zend_hash.c 	q->h = p->h;
q                1722 Zend/zend_hash.c 		q->key = NULL;
q                1726 Zend/zend_hash.c 		q->key = p->key;
q                1727 Zend/zend_hash.c 		if (!static_keys && q->key) {
q                1728 Zend/zend_hash.c 			zend_string_addref(q->key);
q                1731 Zend/zend_hash.c 		nIndex = q->h | target->nTableMask;
q                1732 Zend/zend_hash.c 		Z_NEXT(q->val) = HT_HASH(target, nIndex);
q                1741 Zend/zend_hash.c 	Bucket *q = target->arData;
q                1745 Zend/zend_hash.c 		if (!zend_array_dup_element(source, target, 0, p, q, 1, 1, with_holes)) {
q                1747 Zend/zend_hash.c 				ZVAL_UNDEF(&q->val);
q                1750 Zend/zend_hash.c 		p++; q++;
q                1758 Zend/zend_hash.c 	Bucket *q = target->arData;
q                1762 Zend/zend_hash.c 		if (!zend_array_dup_element(source, target, idx, p, q, 0, static_keys, with_holes)) {
q                1767 Zend/zend_hash.c 				if (zend_array_dup_element(source, target, target_idx, p, q, 0, static_keys, with_holes)) {
q                1771 Zend/zend_hash.c 					target_idx++; q++;
q                1777 Zend/zend_hash.c 		idx++; p++; q++;
q                2218 Zend/zend_hash.c ZEND_API void zend_hash_bucket_swap(Bucket *p, Bucket *q)
q                2228 Zend/zend_hash.c 	ZVAL_COPY_VALUE(&p->val, &q->val);
q                2229 Zend/zend_hash.c 	p->h = q->h;
q                2230 Zend/zend_hash.c 	p->key = q->key;
q                2232 Zend/zend_hash.c 	ZVAL_COPY_VALUE(&q->val, &val);
q                2233 Zend/zend_hash.c 	q->h = h;
q                2234 Zend/zend_hash.c 	q->key = key;
q                2237 Zend/zend_hash.c ZEND_API void zend_hash_bucket_renum_swap(Bucket *p, Bucket *q)
q                2242 Zend/zend_hash.c 	ZVAL_COPY_VALUE(&p->val, &q->val);
q                2243 Zend/zend_hash.c 	ZVAL_COPY_VALUE(&q->val, &val);
q                2246 Zend/zend_hash.c ZEND_API void zend_hash_bucket_packed_swap(Bucket *p, Bucket *q)
q                2254 Zend/zend_hash.c 	ZVAL_COPY_VALUE(&p->val, &q->val);
q                2255 Zend/zend_hash.c 	p->h = q->h;
q                2257 Zend/zend_hash.c 	ZVAL_COPY_VALUE(&q->val, &val);
q                2258 Zend/zend_hash.c 	q->h = h;
q                 198 Zend/zend_hash.h ZEND_API void  zend_hash_bucket_swap(Bucket *p, Bucket *q);
q                 199 Zend/zend_hash.h ZEND_API void  zend_hash_bucket_renum_swap(Bucket *p, Bucket *q);
q                 200 Zend/zend_hash.h ZEND_API void  zend_hash_bucket_packed_swap(Bucket *p, Bucket *q);
q                 188 Zend/zend_llist.c static void zend_llist_swap(zend_llist_element **p, zend_llist_element **q)
q                 192 Zend/zend_llist.c 	*p = *q;
q                 193 Zend/zend_llist.c 	*q = t;
q                2184 Zend/zend_strtod.c 	ULong *bx, *bxe, q, *sx, *sxe;
q                2205 Zend/zend_strtod.c 	q = *bxe / (*sxe + 1);	/* ensure q <= true quotient */
q                2208 Zend/zend_strtod.c 	/*debug*/ if (q > 9)
q                2212 Zend/zend_strtod.c 	/*debug*/ if (q > 15)
q                2216 Zend/zend_strtod.c 	if (q) {
q                2221 Zend/zend_strtod.c 			ys = *sx++ * (ULLong)q + carry;
q                2229 Zend/zend_strtod.c 			ys = (si & 0xffff) * q + carry;
q                2230 Zend/zend_strtod.c 			zs = (si >> 16) * q + (ys >> 16);
q                2238 Zend/zend_strtod.c 			ys = *sx++ * q + carry;
q                2255 Zend/zend_strtod.c 		q++;
q                2296 Zend/zend_strtod.c 	return q;
q                2501 ext/fileinfo/libmagic/apprentice.c 			m->value.q = file_signextend(ms, m,
q                3065 ext/fileinfo/libmagic/apprentice.c 	const char *p, *q;
q                3073 ext/fileinfo/libmagic/apprentice.c 	for (q = fn; *q; q++)
q                3076 ext/fileinfo/libmagic/apprentice.c 	for (p = ext + sizeof(ext) - 1; p >= ext && q >= fn; p--, q--)
q                3077 ext/fileinfo/libmagic/apprentice.c 		if (*p != *q)
q                3082 ext/fileinfo/libmagic/apprentice.c 		while (*q)
q                3083 ext/fileinfo/libmagic/apprentice.c 			q++;
q                3085 ext/fileinfo/libmagic/apprentice.c 	q++;
q                3088 ext/fileinfo/libmagic/apprentice.c 		spprintf(&buf, MAXPATHLEN, "%.*s.mime%s", (int)(q - fn), fn, ext);
q                3099 ext/fileinfo/libmagic/apprentice.c 	spprintf(&buf, MAXPATHLEN, "%.*s%s", (int)(q - fn), fn, ext);
q                3194 ext/fileinfo/libmagic/apprentice.c 		m->value.q = swap8(m->value.q);
q                 798 ext/fileinfo/libmagic/cdf.c 	const uint8_t *p, *q, *e;
q                 858 ext/fileinfo/libmagic/cdf.c 		q = (const uint8_t *)(const void *)
q                 861 ext/fileinfo/libmagic/cdf.c 		if (q < p) {
q                 862 ext/fileinfo/libmagic/cdf.c 			DPRINTF(("Wrapped around %p < %p\n", q, p));
q                 865 ext/fileinfo/libmagic/cdf.c 		if (q > e) {
q                 866 ext/fileinfo/libmagic/cdf.c 			DPRINTF(("Ran of the end %p > %p\n", q, e));
q                 870 ext/fileinfo/libmagic/cdf.c 		inp[i].pi_type = CDF_GETUINT32(q, 0);
q                 872 ext/fileinfo/libmagic/cdf.c 		    i, inp[i].pi_id, inp[i].pi_type, q - p, offs));
q                 874 ext/fileinfo/libmagic/cdf.c 			nelements = CDF_GETUINT32(q, 1);
q                 894 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&s16, &q[o4], sizeof(s16));
q                 900 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&s32, &q[o4], sizeof(s32));
q                 907 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&u32, &q[o4], sizeof(u32));
q                 913 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&s64, &q[o4], sizeof(s64));
q                 919 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&u64, &q[o4], sizeof(u64));
q                 925 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&u32, &q[o4], sizeof(u32));
q                 932 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&u64, &q[o4], sizeof(u64));
q                 956 ext/fileinfo/libmagic/cdf.c 				uint32_t l = CDF_GETUINT32(q, o);
q                 959 ext/fileinfo/libmagic/cdf.c 				    (const void *)(&q[o4 + sizeof(l)]);
q                 967 ext/fileinfo/libmagic/cdf.c 				if (q + o >= e)
q                 976 ext/fileinfo/libmagic/cdf.c 			(void)memcpy(&tp, &q[o4], sizeof(tp));
q                 189 ext/fileinfo/libmagic/cdf_time.c 	char *p, *q;
q                 193 ext/fileinfo/libmagic/cdf_time.c 	if ((q = strchr(p, '\n')) != NULL)
q                 194 ext/fileinfo/libmagic/cdf_time.c 		*q = '\0';
q                 150 ext/fileinfo/libmagic/file.h 	uint64_t q;
q                 479 ext/fileinfo/libmagic/softmagic.c 		v = file_signextend(ms, m, p->q);
q                 564 ext/fileinfo/libmagic/softmagic.c 		    file_fmttime(p->q, 0, tbuf)) == -1)
q                 573 ext/fileinfo/libmagic/softmagic.c 		    file_fmttime(p->q, FILE_T_LOCAL, tbuf)) == -1)
q                 582 ext/fileinfo/libmagic/softmagic.c 		    file_fmttime(p->q, FILE_T_WINDOWS, tbuf)) == -1)
q                 877 ext/fileinfo/libmagic/softmagic.c 	DO_CVT(q, (uint64_t));
q                 981 ext/fileinfo/libmagic/softmagic.c 		p->q = (uint64_t)
q                1003 ext/fileinfo/libmagic/softmagic.c 		p->q = (uint64_t)
q                1034 ext/fileinfo/libmagic/softmagic.c 		p->q =  ((uint64_t)p->hq[0]<<56)|((uint64_t)p->hq[1]<<48)|
q                1041 ext/fileinfo/libmagic/softmagic.c 		p->q =  ((uint64_t)p->hq[7]<<56)|((uint64_t)p->hq[6]<<48)|
q                1240 ext/fileinfo/libmagic/softmagic.c 			const union VALUETYPE *q = CAST(const union VALUETYPE *,
q                1244 ext/fileinfo/libmagic/softmagic.c 				off = q->b;
q                1247 ext/fileinfo/libmagic/softmagic.c 				off = q->h;
q                1250 ext/fileinfo/libmagic/softmagic.c 				off = (short)((q->hs[0]<<8)|(q->hs[1]));
q                1253 ext/fileinfo/libmagic/softmagic.c 				off = (short)((q->hs[1]<<8)|(q->hs[0]));
q                1256 ext/fileinfo/libmagic/softmagic.c 				off = q->l;
q                1260 ext/fileinfo/libmagic/softmagic.c 				off = (int32_t)((q->hl[0]<<24)|(q->hl[1]<<16)|
q                1261 ext/fileinfo/libmagic/softmagic.c 						 (q->hl[2]<<8)|(q->hl[3]));
q                1265 ext/fileinfo/libmagic/softmagic.c 				off = (int32_t)((q->hl[3]<<24)|(q->hl[2]<<16)|
q                1266 ext/fileinfo/libmagic/softmagic.c 						 (q->hl[1]<<8)|(q->hl[0]));
q                1269 ext/fileinfo/libmagic/softmagic.c 				off = (int32_t)((q->hl[1]<<24)|(q->hl[0]<<16)|
q                1270 ext/fileinfo/libmagic/softmagic.c 						 (q->hl[3]<<8)|(q->hl[2]));
q                1845 ext/fileinfo/libmagic/softmagic.c 	uint64_t l = m->value.q;
q                1890 ext/fileinfo/libmagic/softmagic.c 		v = p->q;
q                2507 ext/gd/gd.c    	int q = -1, i, t = 1;
q                2524 ext/gd/gd.c    			q = quality;
q                2542 ext/gd/gd.c    				if (q == -1) {
q                2543 ext/gd/gd.c    					q = 0;
q                2544 ext/gd/gd.c    				} else if (q < 0 || q > 255) {
q                2545 ext/gd/gd.c    					php_error_docref(NULL, E_WARNING, "Invalid threshold value '%d'. It must be between 0 and 255", q);
q                2546 ext/gd/gd.c    					q = 0;
q                2548 ext/gd/gd.c    				gdImageWBMP(im, q, fp);
q                2551 ext/gd/gd.c    				(*func_p)(im, fp, q);
q                2566 ext/gd/gd.c    				if (q == -1) {
q                2567 ext/gd/gd.c    					q = 128;
q                2569 ext/gd/gd.c    				(*func_p)(im, fp, q, t);
q                2572 ext/gd/gd.c    				if (q == -1) {
q                2573 ext/gd/gd.c    					q = 128;
q                2575 ext/gd/gd.c    				(*func_p)(im, fp, q, t);
q                2594 ext/gd/gd.c     				if (q == -1) {
q                2595 ext/gd/gd.c      					q = 0;
q                2596 ext/gd/gd.c      				} else if (q < 0 || q > 255) {
q                2597 ext/gd/gd.c      					php_error_docref(NULL, E_WARNING, "Invalid threshold value '%d'. It must be between 0 and 255", q);
q                2598 ext/gd/gd.c     					q = 0;
q                2600 ext/gd/gd.c    				gdImageWBMP(im, q, tmp);
q                2603 ext/gd/gd.c    				(*func_p)(im, tmp, q);
q                2611 ext/gd/gd.c    				(*func_p)(im, q, tmp);
q                2620 ext/gd/gd.c    				if (q == -1) {
q                2621 ext/gd/gd.c    					q = 128;
q                2623 ext/gd/gd.c    				(*func_p)(im, tmp, q, t);
q                  80 ext/gd/gd_ctx.c 	int q = -1, i;
q                 111 ext/gd/gd_ctx.c 		q = quality; /* or colorindex for foreground of BW images (defaults to black) */
q                 165 ext/gd/gd_ctx.c 			if(q<0||q>255) {
q                 166 ext/gd/gd_ctx.c 				php_error_docref(NULL, E_WARNING, "Invalid threshold value '%d'. It must be between 0 and 255", q);
q                 169 ext/gd/gd_ctx.c 			(*func_p)(im, ctx, q);
q                 172 ext/gd/gd_ctx.c 			if (q == -1) {
q                 173 ext/gd/gd_ctx.c 				q = 80;
q                 175 ext/gd/gd_ctx.c 			(*func_p)(im, ctx, q);
q                 178 ext/gd/gd_ctx.c 			(*func_p)(im, ctx, q, f);
q                 186 ext/gd/gd_ctx.c 				q = i;
q                 189 ext/gd/gd_ctx.c 				(*func_p)(im, file ? file : "", q, ctx);
q                 191 ext/gd/gd_ctx.c 				(*func_p)(im, q, ctx);
q                 175 ext/gd/libgd/gd_interpolation.c 	double p, q;
q                 206 ext/gd/libgd/gd_interpolation.c 	q = Qone[8];
q                 210 ext/gd/libgd/gd_interpolation.c 		q = q*x*x+Qone[i];
q                 212 ext/gd/libgd/gd_interpolation.c 	return (double)(p/q);
q                 217 ext/gd/libgd/gd_interpolation.c 	double p, q;
q                 242 ext/gd/libgd/gd_interpolation.c 	q = Qone[5];
q                 246 ext/gd/libgd/gd_interpolation.c 		q = q*(8.0/x)*(8.0/x)+Qone[i];
q                 248 ext/gd/libgd/gd_interpolation.c 	return (double)(p/q);
q                 253 ext/gd/libgd/gd_interpolation.c 	double p, q;
q                 278 ext/gd/libgd/gd_interpolation.c 	q = Qone[5];
q                 282 ext/gd/libgd/gd_interpolation.c 		q = q*(8.0/x)*(8.0/x)+Qone[i];
q                 284 ext/gd/libgd/gd_interpolation.c 	return (double)(p/q);
q                 289 ext/gd/libgd/gd_interpolation.c 	double p, q;
q                 298 ext/gd/libgd/gd_interpolation.c 	q = (double)sqrt(2.0f/(M_PI*x))*(double)(KernelBessel_P1(x)*(1.0f/sqrt(2.0f)*(sin(x)-cos(x)))-8.0f/x*KernelBessel_Q1(x)*
q                 301 ext/gd/libgd/gd_interpolation.c 		q = (-q);
q                 302 ext/gd/libgd/gd_interpolation.c 	return (q);
q                 347 ext/intl/collator/collator_sort.c static void collator_sortkey_swap(collator_sort_key_index_t *p, collator_sort_key_index_t *q) /* {{{ */
q                 351 ext/intl/collator/collator_sort.c 	*p = *q;
q                 352 ext/intl/collator/collator_sort.c 	*q = t;
q                1040 ext/mbstring/libmbfl/mbfl/mbfilter.c 		const unsigned char *p, *q, *e;
q                1064 ext/mbstring/libmbfl/mbfl/mbfilter.c 			q = needle_u8_val + needle_u8_len;
q                1066 ext/mbstring/libmbfl/mbfl/mbfilter.c 				if (q == needle_u8_val) {
q                1078 ext/mbstring/libmbfl/mbfl/mbfilter.c 				if (*--q != *--p) {
q                1091 ext/mbstring/libmbfl/mbfl/mbfilter.c 		const unsigned char *p, *e, *q, *qe;
q                1150 ext/mbstring/libmbfl/mbfl/mbfilter.c 			q = needle_u8_val;
q                1152 ext/mbstring/libmbfl/mbfl/mbfilter.c 				if (q == qe) {
q                1165 ext/mbstring/libmbfl/mbfl/mbfilter.c 				if (*q != *p) {
q                1168 ext/mbstring/libmbfl/mbfl/mbfilter.c 				++p, ++q;
q                1528 ext/mbstring/libmbfl/mbfl/mbfilter.c 			const unsigned char *p, *q;
q                1532 ext/mbstring/libmbfl/mbfl/mbfilter.c 			for (m = 0, p = string->val, q = p + from;
q                1533 ext/mbstring/libmbfl/mbfl/mbfilter.c 					p < q; p += (m = mbtab[*p]));
q                1535 ext/mbstring/libmbfl/mbfl/mbfilter.c 			if (p > q) {
q                1545 ext/mbstring/libmbfl/mbfl/mbfilter.c 				for (q = p + length; p < q; p += (m = mbtab[*p]));
q                1547 ext/mbstring/libmbfl/mbfl/mbfilter.c 				if (p > q) {
q                1575 ext/mbstring/libmbfl/mbfl/mbfilter.c 		const unsigned char *p, *q, *r;
q                1606 ext/mbstring/libmbfl/mbfl/mbfilter.c 		for (q = string->val + from; p < q; p++) {
q                1615 ext/mbstring/libmbfl/mbfl/mbfilter.c 		q = string->val + string->len;
q                1623 ext/mbstring/libmbfl/mbfl/mbfilter.c 		if (length > q - p) {
q                1624 ext/mbstring/libmbfl/mbfl/mbfilter.c 			length = q - p;
q                1684 ext/mbstring/libmbfl/mbfl/mbfilter.c 		while (p < q) {
q                 414 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 			char *q = 0;
q                 436 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 			q = p;
q                 449 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 			fields[field++] = q;
q                2543 ext/mbstring/oniguruma/regcomp.c           UChar *q;
q                2552 ext/mbstring/oniguruma/regcomp.c             for (i = 0, p = ys->s, q = xs->s; i < len; i++, p++, q++) {
q                2553 ext/mbstring/oniguruma/regcomp.c               if (*p != *q) return 1;
q                3315 ext/mbstring/oniguruma/regcomp.c       UChar *q = p + items[i].byte_len;
q                3317 ext/mbstring/oniguruma/regcomp.c       if (q < end) {
q                3318 ext/mbstring/oniguruma/regcomp.c         r = expand_case_fold_make_rem_string(&rem, q, end, reg);
q                3557 ext/mbstring/oniguruma/regcomp.c 		  QtfrNode* q = NQTFR(en->target);
q                3558 ext/mbstring/oniguruma/regcomp.c 		  if (IS_REPEAT_INFINITE(q->upper)
q                3559 ext/mbstring/oniguruma/regcomp.c 		      && q->greedy == qn->greedy) {
q                5080 ext/mbstring/oniguruma/regcomp.c   int q = 0;
q                5086 ext/mbstring/oniguruma/regcomp.c     q = 1;
q                5089 ext/mbstring/oniguruma/regcomp.c     if (q) fprintf(f, ", ");
q                5090 ext/mbstring/oniguruma/regcomp.c     q = 1;
q                5094 ext/mbstring/oniguruma/regcomp.c     if (q) fprintf(f, ", ");
q                5095 ext/mbstring/oniguruma/regcomp.c     q = 1;
q                5099 ext/mbstring/oniguruma/regcomp.c     if (q) fprintf(f, ", ");
q                5100 ext/mbstring/oniguruma/regcomp.c     q = 1;
q                5104 ext/mbstring/oniguruma/regcomp.c     if (q) fprintf(f, ", ");
q                5105 ext/mbstring/oniguruma/regcomp.c     q = 1;
q                5109 ext/mbstring/oniguruma/regcomp.c     if (q) fprintf(f, ", ");
q                5110 ext/mbstring/oniguruma/regcomp.c     q = 1;
q                5114 ext/mbstring/oniguruma/regcomp.c     if (q) fprintf(f, ", ");
q                5115 ext/mbstring/oniguruma/regcomp.c     q = 1;
q                5119 ext/mbstring/oniguruma/regcomp.c     if (q) fprintf(f, ", ");
q                5856 ext/mbstring/oniguruma/regcomp.c   UChar *q;
q                5971 ext/mbstring/oniguruma/regcomp.c       q = bp;
q                5973 ext/mbstring/oniguruma/regcomp.c       ALIGNMENT_RIGHT(q);
q                5975 ext/mbstring/oniguruma/regcomp.c       GET_CODE_POINT(code, q);
q                5985 ext/mbstring/oniguruma/regcomp.c       q = bp;
q                5987 ext/mbstring/oniguruma/regcomp.c       ALIGNMENT_RIGHT(q);
q                5989 ext/mbstring/oniguruma/regcomp.c       GET_CODE_POINT(code, q);
q                 103 ext/mbstring/oniguruma/regenc.c   UChar* q = (UChar* )p;
q                 105 ext/mbstring/oniguruma/regenc.c     q += ONIGENC_MBC_ENC_LEN(enc, q);
q                 107 ext/mbstring/oniguruma/regenc.c   return (q <= end ? q : NULL);
q                 114 ext/mbstring/oniguruma/regenc.c   UChar* q = (UChar* )p;
q                 116 ext/mbstring/oniguruma/regenc.c   while (q < end) {
q                 117 ext/mbstring/oniguruma/regenc.c     q += ONIGENC_MBC_ENC_LEN(enc, q);
q                 131 ext/mbstring/oniguruma/regenc.c       UChar* q;
q                 135 ext/mbstring/oniguruma/regenc.c       q = p + 1;
q                 137 ext/mbstring/oniguruma/regenc.c         if (*q != '\0') break;
q                 138 ext/mbstring/oniguruma/regenc.c         q++;
q                 156 ext/mbstring/oniguruma/regenc.c       UChar* q;
q                 160 ext/mbstring/oniguruma/regenc.c       q = p + 1;
q                 162 ext/mbstring/oniguruma/regenc.c         if (*q != '\0') break;
q                 163 ext/mbstring/oniguruma/regenc.c         q++;
q                 257 ext/mbstring/oniguruma/regerror.c   UChar *p, *q;
q                 276 ext/mbstring/oniguruma/regerror.c     q = onig_error_code_to_format(code);
q                 278 ext/mbstring/oniguruma/regerror.c     while (*q != '\0') {
q                 279 ext/mbstring/oniguruma/regerror.c       if (*q == '%') {
q                 280 ext/mbstring/oniguruma/regerror.c 	q++;
q                 281 ext/mbstring/oniguruma/regerror.c 	if (*q == 'n') { /* '%n': name */
q                 288 ext/mbstring/oniguruma/regerror.c 	  q++;
q                 295 ext/mbstring/oniguruma/regerror.c 	*p++ = *q++;
q                 303 ext/mbstring/oniguruma/regerror.c     q = onig_error_code_to_format(code);
q                 304 ext/mbstring/oniguruma/regerror.c     len = onigenc_str_bytelen_null(ONIG_ENCODING_ASCII, q);
q                 305 ext/mbstring/oniguruma/regerror.c     xmemcpy(s, q, len);
q                1253 ext/mbstring/oniguruma/regexec.c   UChar *s, *q, *sbegin;
q                1296 ext/mbstring/oniguruma/regexec.c       UChar *q, *bp, buf[50];
q                1300 ext/mbstring/oniguruma/regexec.c       for (i = 0, q = s; i < 7 && q < end; i++) {
q                1301 ext/mbstring/oniguruma/regexec.c 	len = enclen(encode, q);
q                1302 ext/mbstring/oniguruma/regexec.c 	while (len-- > 0) *bp++ = *q++;
q                1304 ext/mbstring/oniguruma/regexec.c       if (q < end) { xmemcpy(bp, "...\"", 4); bp += 4; }
q                1442 ext/mbstring/oniguruma/regexec.c 	UChar *q, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
q                1450 ext/mbstring/oniguruma/regexec.c 	q = lowbuf;
q                1452 ext/mbstring/oniguruma/regexec.c 	  if (*p != *q) {
q                1455 ext/mbstring/oniguruma/regexec.c 	  p++; q++;
q                1531 ext/mbstring/oniguruma/regexec.c 	UChar *q, *endp, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
q                1544 ext/mbstring/oniguruma/regexec.c 	  q = lowbuf;
q                1546 ext/mbstring/oniguruma/regexec.c 	    if (*p != *q) goto fail;
q                1547 ext/mbstring/oniguruma/regexec.c 	    p++; q++;
q                1671 ext/mbstring/oniguruma/regexec.c 	q = p;
q                1672 ext/mbstring/oniguruma/regexec.c 	ALIGNMENT_RIGHT(q);
q                1673 ext/mbstring/oniguruma/regexec.c 	if (! onig_is_in_code_range(q, code)) goto fail;
q                1736 ext/mbstring/oniguruma/regexec.c 	q = p;
q                1737 ext/mbstring/oniguruma/regexec.c 	ALIGNMENT_RIGHT(q);
q                1738 ext/mbstring/oniguruma/regexec.c 	if (onig_is_in_code_range(q, code)) goto fail;
q                2651 ext/mbstring/oniguruma/regexec.c       q = (UChar* )ONIGENC_STEP_BACK(encode, str, s, (int )tlen);
q                2652 ext/mbstring/oniguruma/regexec.c       if (IS_NULL(q)) {
q                2660 ext/mbstring/oniguruma/regexec.c 	s = q;
q                2777 ext/mbstring/oniguruma/regexec.c   UChar *q, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
q                2781 ext/mbstring/oniguruma/regexec.c     q = lowbuf;
q                2783 ext/mbstring/oniguruma/regexec.c       if (*t++ != *q++)	return 0;
q                3130 ext/mbstring/oniguruma/regexec.c       UChar *q = p + reg->dmin;
q                3131 ext/mbstring/oniguruma/regexec.c       while (p < q) p += enclen(reg->enc, p);
q                 317 ext/mbstring/oniguruma/regparse.c   UChar *p, *q;
q                 324 ext/mbstring/oniguruma/regparse.c   q = y->s;
q                 326 ext/mbstring/oniguruma/regparse.c     c = (int )*p - (int )*q;
q                 329 ext/mbstring/oniguruma/regparse.c     p++; q++;
q                2155 ext/mbstring/oniguruma/regparse.c popular_quantifier_num(QtfrNode* q)
q                2157 ext/mbstring/oniguruma/regparse.c   if (q->greedy) {
q                2158 ext/mbstring/oniguruma/regparse.c     if (q->lower == 0) {
q                2159 ext/mbstring/oniguruma/regparse.c       if (q->upper == 1) return 0;
q                2160 ext/mbstring/oniguruma/regparse.c       else if (IS_REPEAT_INFINITE(q->upper)) return 1;
q                2162 ext/mbstring/oniguruma/regparse.c     else if (q->lower == 1) {
q                2163 ext/mbstring/oniguruma/regparse.c       if (IS_REPEAT_INFINITE(q->upper)) return 2;
q                2167 ext/mbstring/oniguruma/regparse.c     if (q->lower == 0) {
q                2168 ext/mbstring/oniguruma/regparse.c       if (q->upper == 1) return 3;
q                2169 ext/mbstring/oniguruma/regparse.c       else if (IS_REPEAT_INFINITE(q->upper)) return 4;
q                2171 ext/mbstring/oniguruma/regparse.c     else if (q->lower == 1) {
q                2172 ext/mbstring/oniguruma/regparse.c       if (IS_REPEAT_INFINITE(q->upper)) return 5;
q                2846 ext/mbstring/oniguruma/regparse.c   UChar *q;
q                2851 ext/mbstring/oniguruma/regparse.c     q = p + enclen(enc, p);
q                2853 ext/mbstring/oniguruma/regparse.c       for (i = 1; i < n && q < to; i++) {
q                2854 ext/mbstring/oniguruma/regparse.c 	x = ONIGENC_MBC_TO_CODE(enc, q, to);
q                2856 ext/mbstring/oniguruma/regparse.c 	q += enclen(enc, q);
q                2860 ext/mbstring/oniguruma/regparse.c 	  *next = q;
q                2864 ext/mbstring/oniguruma/regparse.c     p = q;
q                2875 ext/mbstring/oniguruma/regparse.c   UChar *q;
q                2886 ext/mbstring/oniguruma/regparse.c       q = p + enclen(enc, p);
q                2888 ext/mbstring/oniguruma/regparse.c 	for (i = 1; i < n && q < to; i++) {
q                2889 ext/mbstring/oniguruma/regparse.c 	  x = ONIGENC_MBC_TO_CODE(enc, q, to);
q                2891 ext/mbstring/oniguruma/regparse.c 	  q += enclen(enc, q);
q                2900 ext/mbstring/oniguruma/regparse.c 	p = q;
q                  29 ext/mbstring/oniguruma/testu.c   char *q;
q                  31 ext/mbstring/oniguruma/testu.c   q = to;
q                  38 ext/mbstring/oniguruma/testu.c         sprintf(q, "\\%03o", c);
q                  39 ext/mbstring/oniguruma/testu.c         q += 4;
q                  42 ext/mbstring/oniguruma/testu.c         sprintf(q, "%c", c);
q                  43 ext/mbstring/oniguruma/testu.c         q++;
q                  47 ext/mbstring/oniguruma/testu.c       sprintf(q, "\\%03o", c);
q                  48 ext/mbstring/oniguruma/testu.c       q += 4;
q                  50 ext/mbstring/oniguruma/testu.c       sprintf(q, "\\%03o", c);
q                  51 ext/mbstring/oniguruma/testu.c       q += 4;
q                  55 ext/mbstring/oniguruma/testu.c   *q = 0;
q                  43 ext/mysqli/mysqli_mysqlnd.h #define mysqli_async_query(c, q, l)		mysqlnd_async_query((c), (q), (l))
q                 227 ext/mysqlnd/mysqlnd.h #define mysqlnd_stmt_prepare(stmt, q, qlen)	(stmt)->m->prepare((stmt), (q), (qlen))
q                  94 ext/mysqlnd/mysqlnd_libmysql_compat.h #define mysql_stmt_prepare(s,q,l)		mysqlnd_stmt_prepare((s), (q), (l))
q                 672 ext/opcache/Optimizer/zend_optimizer.c 	Bucket *p, *q;
q                 695 ext/opcache/Optimizer/zend_optimizer.c 			q = ce->function_table.arData + j;
q                 696 ext/opcache/Optimizer/zend_optimizer.c 			if (Z_TYPE(q->val) == IS_UNDEF) continue;
q                 697 ext/opcache/Optimizer/zend_optimizer.c 			op_array = (zend_op_array*)Z_PTR(q->val);
q                 702 ext/opcache/Optimizer/zend_optimizer.c 				if ((orig_op_array = zend_hash_find_ptr(&op_array->scope->function_table, q->key)) != NULL) {
q                 726 ext/opcache/Optimizer/zend_optimizer.c 				q = ce->function_table.arData + j;
q                 727 ext/opcache/Optimizer/zend_optimizer.c 				if (Z_TYPE(q->val) == IS_UNDEF) continue;
q                 728 ext/opcache/Optimizer/zend_optimizer.c 				op_array = (zend_op_array*)Z_PTR(q->val);
q                 733 ext/opcache/Optimizer/zend_optimizer.c 					if ((orig_op_array = zend_hash_find_ptr(&op_array->scope->function_table, q->key)) != NULL) {
q                 496 ext/opcache/ZendAccelerator.c 	Bucket *p, *q;
q                 538 ext/opcache/ZendAccelerator.c 			q = ce->properties_info.arData + j;
q                 539 ext/opcache/ZendAccelerator.c 			if (Z_TYPE(q->val) == IS_UNDEF) continue;
q                 541 ext/opcache/ZendAccelerator.c 			info = (zend_property_info*)Z_PTR(q->val);
q                 543 ext/opcache/ZendAccelerator.c 			if (q->key) {
q                 544 ext/opcache/ZendAccelerator.c 				q->key = accel_new_interned_string(q->key);
q                 553 ext/opcache/ZendAccelerator.c 			q = ce->function_table.arData + j;
q                 554 ext/opcache/ZendAccelerator.c 			if (Z_TYPE(q->val) == IS_UNDEF) continue;
q                 555 ext/opcache/ZendAccelerator.c 			if (q->key) {
q                 556 ext/opcache/ZendAccelerator.c 				q->key = accel_new_interned_string(q->key);
q                 558 ext/opcache/ZendAccelerator.c 			if (Z_FUNC(q->val)->common.function_name) {
q                 559 ext/opcache/ZendAccelerator.c 				Z_FUNC(q->val)->common.function_name = accel_new_interned_string(Z_FUNC(q->val)->common.function_name);
q                 564 ext/opcache/ZendAccelerator.c 			q = ce->constants_table.arData + j;
q                 565 ext/opcache/ZendAccelerator.c 			if (!Z_TYPE(q->val) == IS_UNDEF) continue;
q                 566 ext/opcache/ZendAccelerator.c 			if (q->key) {
q                 567 ext/opcache/ZendAccelerator.c 				q->key = accel_new_interned_string(q->key);
q                 231 ext/opcache/zend_accelerator_util_funcs.c 	Bucket *p, *q, *end;
q                 259 ext/opcache/zend_accelerator_util_funcs.c 		q = ht->arData + ht->nNumUsed;
q                 260 ext/opcache/zend_accelerator_util_funcs.c 		Z_NEXT(q->val) = HT_HASH(ht, nIndex);
q                 264 ext/opcache/zend_accelerator_util_funcs.c 		q->h = p->h;
q                 265 ext/opcache/zend_accelerator_util_funcs.c 		q->key = p->key;
q                 268 ext/opcache/zend_accelerator_util_funcs.c 		ZVAL_COPY_VALUE(&q->val, &p->val);
q                 269 ext/opcache/zend_accelerator_util_funcs.c 		zend_clone_zval(&q->val);
q                 275 ext/opcache/zend_accelerator_util_funcs.c 	Bucket *p, *q, *end;
q                 305 ext/opcache/zend_accelerator_util_funcs.c 		q = ht->arData + ht->nNumUsed;
q                 306 ext/opcache/zend_accelerator_util_funcs.c 		Z_NEXT(q->val) = HT_HASH(ht, nIndex);
q                 310 ext/opcache/zend_accelerator_util_funcs.c 		q->h = p->h;
q                 312 ext/opcache/zend_accelerator_util_funcs.c 		q->key = p->key;
q                 315 ext/opcache/zend_accelerator_util_funcs.c 		ZVAL_PTR(&q->val, ARENA_REALLOC(Z_PTR(p->val)));
q                 316 ext/opcache/zend_accelerator_util_funcs.c 		new_entry = (zend_op_array*)Z_PTR(q->val);
q                 333 ext/opcache/zend_accelerator_util_funcs.c 	Bucket *p, *q, *end;
q                 363 ext/opcache/zend_accelerator_util_funcs.c 		q = ht->arData + ht->nNumUsed;
q                 364 ext/opcache/zend_accelerator_util_funcs.c 		Z_NEXT(q->val) = HT_HASH(ht, nIndex);
q                 368 ext/opcache/zend_accelerator_util_funcs.c 		q->h = p->h;
q                 370 ext/opcache/zend_accelerator_util_funcs.c 		q->key = p->key;
q                 374 ext/opcache/zend_accelerator_util_funcs.c 		ZVAL_PTR(&q->val, prop_info);
q                 555 ext/opcache/zend_file_cache.c 		zend_trait_alias **p, *q;
q                 563 ext/opcache/zend_file_cache.c 			q = *p;
q                 564 ext/opcache/zend_file_cache.c 			UNSERIALIZE_PTR(q);
q                 566 ext/opcache/zend_file_cache.c 			if (q->trait_method) {
q                 569 ext/opcache/zend_file_cache.c 				SERIALIZE_PTR(q->trait_method);
q                 570 ext/opcache/zend_file_cache.c 				m = q->trait_method;
q                 581 ext/opcache/zend_file_cache.c 			if (q->alias) {
q                 582 ext/opcache/zend_file_cache.c 				SERIALIZE_STR(q->alias);
q                 589 ext/opcache/zend_file_cache.c 		zend_trait_precedence **p, *q;
q                 597 ext/opcache/zend_file_cache.c 			q = *p;
q                 598 ext/opcache/zend_file_cache.c 			UNSERIALIZE_PTR(q);
q                 600 ext/opcache/zend_file_cache.c 			if (q->trait_method) {
q                 603 ext/opcache/zend_file_cache.c 				SERIALIZE_PTR(q->trait_method);
q                 604 ext/opcache/zend_file_cache.c 				m = q->trait_method;
q                 615 ext/opcache/zend_file_cache.c 			if (q->exclude_from_classes) {
q                 618 ext/opcache/zend_file_cache.c 				SERIALIZE_PTR(q->exclude_from_classes);
q                 619 ext/opcache/zend_file_cache.c 				s = (zend_string**)q->exclude_from_classes;
q                1101 ext/opcache/zend_file_cache.c 		zend_trait_alias **p, *q;
q                1108 ext/opcache/zend_file_cache.c 			q = *p;
q                1110 ext/opcache/zend_file_cache.c 			if (q->trait_method) {
q                1113 ext/opcache/zend_file_cache.c 				UNSERIALIZE_PTR(q->trait_method);
q                1114 ext/opcache/zend_file_cache.c 				m = q->trait_method;
q                1124 ext/opcache/zend_file_cache.c 			if (q->alias) {
q                1125 ext/opcache/zend_file_cache.c 				UNSERIALIZE_STR(q->alias);
q                1132 ext/opcache/zend_file_cache.c 		zend_trait_precedence **p, *q;
q                1139 ext/opcache/zend_file_cache.c 			q = *p;
q                1141 ext/opcache/zend_file_cache.c 			if (q->trait_method) {
q                1144 ext/opcache/zend_file_cache.c 				UNSERIALIZE_PTR(q->trait_method);
q                1145 ext/opcache/zend_file_cache.c 				m = q->trait_method;
q                1155 ext/opcache/zend_file_cache.c 			if (q->exclude_from_classes) {
q                1158 ext/opcache/zend_file_cache.c 				UNSERIALIZE_PTR(q->exclude_from_classes);
q                1159 ext/opcache/zend_file_cache.c 				s = (zend_string**)q->exclude_from_classes;
q                3501 ext/openssl/openssl.c 			if (pkey->pkey.rsa != NULL && (NULL == pkey->pkey.rsa->p || NULL == pkey->pkey.rsa->q)) {
q                3514 ext/openssl/openssl.c 			if (NULL == pkey->pkey.dsa->p || NULL == pkey->pkey.dsa->q || NULL == pkey->pkey.dsa->priv_key){
q                3592 ext/openssl/openssl.c 					OPENSSL_PKEY_SET_BN(Z_ARRVAL_P(data), rsa, q);
q                3613 ext/openssl/openssl.c 					OPENSSL_PKEY_SET_BN(Z_ARRVAL_P(data), dsa, q);
q                3617 ext/openssl/openssl.c 					if (dsa->p && dsa->q && dsa->g) {
q                3924 ext/openssl/openssl.c 				OPENSSL_PKEY_GET_BN(rsa, q);
q                3943 ext/openssl/openssl.c 				OPENSSL_PKEY_GET_BN(dsa, q);
q                1897 ext/pcre/php_pcre.c 			*q,				/* Iterator for output string */
q                1933 ext/pcre/php_pcre.c 	for (p = in_str, q = ZSTR_VAL(out_str); p != in_str_end; p++) {
q                1956 ext/pcre/php_pcre.c 				*q++ = '\\';
q                1957 ext/pcre/php_pcre.c 				*q++ = c;
q                1961 ext/pcre/php_pcre.c 				*q++ = '\\';
q                1962 ext/pcre/php_pcre.c 				*q++ = '0';
q                1963 ext/pcre/php_pcre.c 				*q++ = '0';
q                1964 ext/pcre/php_pcre.c 				*q++ = '0';
q                1969 ext/pcre/php_pcre.c 					*q++ = '\\';
q                1970 ext/pcre/php_pcre.c 				*q++ = c;
q                1974 ext/pcre/php_pcre.c 	*q = '\0';
q                1977 ext/pcre/php_pcre.c 	out_str = zend_string_truncate(out_str, q - ZSTR_VAL(out_str), 0);
q                 151 ext/pdo_dblib/dblib_driver.c 	char * q;
q                 173 ext/pdo_dblib/dblib_driver.c 		q = *quoted = emalloc(*quotedlen);
q                 175 ext/pdo_dblib/dblib_driver.c 		*q++ = '0';
q                 176 ext/pdo_dblib/dblib_driver.c 		*q++ = 'x';
q                 178 ext/pdo_dblib/dblib_driver.c 			*q++ = hex[ (*unquoted>>4)&0xF];
q                 179 ext/pdo_dblib/dblib_driver.c 			*q++ = hex[ (*unquoted++)&0xF];
q                 184 ext/pdo_dblib/dblib_driver.c 		q  = *quoted = emalloc(*quotedlen);
q                 185 ext/pdo_dblib/dblib_driver.c 		*q++ = '\'';
q                 189 ext/pdo_dblib/dblib_driver.c 				*q++ = '\'';
q                 190 ext/pdo_dblib/dblib_driver.c 				*q++ = '\'';
q                 192 ext/pdo_dblib/dblib_driver.c 				*q++ = unquoted[i];
q                 195 ext/pdo_dblib/dblib_driver.c 		*q++ = '\'';
q                 198 ext/pdo_dblib/dblib_driver.c 	*q = 0;
q                 373 ext/pdo_pgsql/pgsql_driver.c 		const char *q[1];
q                 374 ext/pdo_pgsql/pgsql_driver.c 		q[0] = name;
q                 375 ext/pdo_pgsql/pgsql_driver.c 		res = PQexecParams(H->server, "SELECT CURRVAL($1)", 1, NULL, q, NULL, NULL, 0);
q                  59 ext/pdo_pgsql/pgsql_statement.c 		char *q = NULL;
q                  63 ext/pdo_pgsql/pgsql_statement.c 			spprintf(&q, 0, "DEALLOCATE %s", S->stmt_name);
q                  64 ext/pdo_pgsql/pgsql_statement.c 			res = PQexec(H->server, q);
q                  65 ext/pdo_pgsql/pgsql_statement.c 			efree(q);
q                  96 ext/pdo_pgsql/pgsql_statement.c 		char *q = NULL;
q                  99 ext/pdo_pgsql/pgsql_statement.c 		spprintf(&q, 0, "CLOSE %s", S->cursor_name);
q                 100 ext/pdo_pgsql/pgsql_statement.c 		res = PQexec(H->server, q);
q                 101 ext/pdo_pgsql/pgsql_statement.c 		efree(q);
q                 131 ext/pdo_pgsql/pgsql_statement.c 		char *q = NULL;
q                 134 ext/pdo_pgsql/pgsql_statement.c 			spprintf(&q, 0, "CLOSE %s", S->cursor_name);
q                 135 ext/pdo_pgsql/pgsql_statement.c 			S->result = PQexec(H->server, q);
q                 136 ext/pdo_pgsql/pgsql_statement.c 			efree(q);
q                 139 ext/pdo_pgsql/pgsql_statement.c 		spprintf(&q, 0, "DECLARE %s SCROLL CURSOR WITH HOLD FOR %s", S->cursor_name, stmt->active_query_string);
q                 140 ext/pdo_pgsql/pgsql_statement.c 		S->result = PQexec(H->server, q);
q                 141 ext/pdo_pgsql/pgsql_statement.c 		efree(q);
q                 154 ext/pdo_pgsql/pgsql_statement.c 		spprintf(&q, 0, "FETCH FORWARD 0 FROM %s", S->cursor_name);
q                 155 ext/pdo_pgsql/pgsql_statement.c 		S->result = PQexec(H->server, q);
q                 156 ext/pdo_pgsql/pgsql_statement.c 		efree(q);
q                 395 ext/pdo_pgsql/pgsql_statement.c 		char *q = NULL;
q                 409 ext/pdo_pgsql/pgsql_statement.c 		spprintf(&q, 0, "FETCH %s FROM %s", ori_str, S->cursor_name);
q                 411 ext/pdo_pgsql/pgsql_statement.c 		S->result = PQexec(S->H->server, q);
q                 412 ext/pdo_pgsql/pgsql_statement.c 		efree(q);
q                 580 ext/pdo_pgsql/pgsql_statement.c 	char *q=NULL;
q                 595 ext/pdo_pgsql/pgsql_statement.c 	spprintf(&q, 0, "SELECT TYPNAME FROM PG_TYPE WHERE OID=%u", S->cols[colno].pgsql_type);
q                 596 ext/pdo_pgsql/pgsql_statement.c 	res = PQexec(S->H->server, q);
q                 597 ext/pdo_pgsql/pgsql_statement.c 	efree(q);
q                 264 ext/session/session.c 	unsigned char *p, *q;
q                 270 ext/session/session.c 	q = (unsigned char *)in + inlen;
q                 278 ext/session/session.c 			if (p < q) {
q                1034 ext/session/session.c 	const char *p, *q;
q                1048 ext/session/session.c 		q = p;
q                1049 ext/session/session.c 		while (*q != PS_DELIMITER) {
q                1050 ext/session/session.c 			if (++q >= endptr) goto break_outer_loop;
q                1059 ext/session/session.c 		namelen = q - p;
q                1061 ext/session/session.c 		q++;
q                1071 ext/session/session.c 			if (php_var_unserialize(&current, (const unsigned char **) &q, (const unsigned char *) endptr, &var_hash)) {
q                1085 ext/session/session.c 		p = q;
q                1620 ext/session/session.c 			char *q;
q                1622 ext/session/session.c 			if ((q = strpbrk(p, "/?\\"))) {
q                1623 ext/session/session.c 				PS(id) = zend_string_init(p, q - p, 0);
q                3334 ext/soap/php_sdl.c 				sdl_cache_bucket *q;
q                3338 ext/soap/php_sdl.c 				ZEND_HASH_FOREACH_STR_KEY_PTR(SOAP_GLOBAL(mem_cache), key, q) {
q                3339 ext/soap/php_sdl.c 					if (q->time < latest) {
q                3340 ext/soap/php_sdl.c 						latest = q->time;
q                21999 ext/sqlite3/libsqlite/sqlite3.c         char q = ((xtype==etSQLESCAPE3)?'"':'\'');   /* Quote character */
q                22011 ext/sqlite3/libsqlite/sqlite3.c           if( ch==q )  n++;
q                22025 ext/sqlite3/libsqlite/sqlite3.c         if( needQuote ) bufpt[j++] = q;
q                22029 ext/sqlite3/libsqlite/sqlite3.c           if( ch==q ) bufpt[j++] = ch;
q                22031 ext/sqlite3/libsqlite/sqlite3.c         if( needQuote ) bufpt[j++] = q;
q                133322 ext/sqlite3/libsqlite/sqlite3.c   unsigned char *q = (unsigned char *) p;
q                133325 ext/sqlite3/libsqlite/sqlite3.c     *q++ = (unsigned char) ((vu & 0x7f) | 0x80);
q                133328 ext/sqlite3/libsqlite/sqlite3.c   q[-1] &= 0x7f;  /* turn off high bit in final byte */
q                133329 ext/sqlite3/libsqlite/sqlite3.c   assert( q - (unsigned char *)p <= FTS3_VARINT_MAX );
q                133330 ext/sqlite3/libsqlite/sqlite3.c   return (int) (q - (unsigned char *)p);
q                2689 ext/standard/array.c 					Bucket *q = Z_ARRVAL_P(stack)->arData + k;
q                2690 ext/standard/array.c 					q->h = k;
q                2691 ext/standard/array.c 					q->key = NULL;
q                2692 ext/standard/array.c 					ZVAL_COPY_VALUE(&q->val, &p->val);
q                2704 ext/standard/array.c 					Bucket *q = Z_ARRVAL_P(stack)->arData + k;
q                2705 ext/standard/array.c 					q->h = k;
q                2706 ext/standard/array.c 					q->key = NULL;
q                2707 ext/standard/array.c 					ZVAL_COPY_VALUE(&q->val, &p->val);
q                3737 ext/standard/array.c static void array_bucketindex_swap(void *p, void *q) /* {{{ */
q                3740 ext/standard/array.c 	struct bucketindex *g = (struct bucketindex *)q;
q                4788 ext/standard/array.c static void array_bucket_p_sawp(void *p, void *q) /* {{{ */ {
q                4791 ext/standard/array.c 	Bucket **g = (Bucket **)q;
q                 619 ext/standard/crypt_freesec.c 	u_char		*p, *q;
q                 628 ext/standard/crypt_freesec.c 	q = (u_char *) keybuf;
q                 629 ext/standard/crypt_freesec.c 	while (q - (u_char *) keybuf < sizeof(keybuf)) {
q                 630 ext/standard/crypt_freesec.c 		*q++ = *key << 1;
q                 669 ext/standard/crypt_freesec.c 			q = (u_char *) keybuf;
q                 670 ext/standard/crypt_freesec.c 			while (q - (u_char *) keybuf < sizeof(keybuf) && *key)
q                 671 ext/standard/crypt_freesec.c 				*q++ ^= *key++ << 1;
q                 948 ext/standard/html.c 	char	   *q;
q                 954 ext/standard/html.c 	for (p = old, q = ZSTR_VAL(ret); p < lim;) {
q                 965 ext/standard/html.c 			*(q++) = *(p++);
q                1027 ext/standard/html.c 		q += write_octet_sequence((unsigned char*)q, charset, code);
q                1029 ext/standard/html.c 			q += write_octet_sequence((unsigned char*)q, charset, code2);
q                1038 ext/standard/html.c 			*(q++) = *p;
q                1042 ext/standard/html.c 	*q = '\0';
q                1043 ext/standard/html.c 	ZSTR_LEN(ret) = (size_t)(q - ZSTR_VAL(ret));
q                  51 ext/standard/lcg.c #define MODMULT(a, b, c, m, s) q = s/a;s=b*(s-a*q)-c*q;if(s<0)s+=m
q                  57 ext/standard/lcg.c 	php_int32 q;
q                2280 ext/standard/string.c 	char *p, *q;
q                2304 ext/standard/string.c 	for (p = src, q = ZSTR_VAL(dest); p < (src + srclen - chunklen + 1); ) {
q                2305 ext/standard/string.c 		memcpy(q, p, chunklen);
q                2306 ext/standard/string.c 		q += chunklen;
q                2307 ext/standard/string.c 		memcpy(q, end, endlen);
q                2308 ext/standard/string.c 		q += endlen;
q                2313 ext/standard/string.c 		memcpy(q, p, restlen);
q                2314 ext/standard/string.c 		q += restlen;
q                2315 ext/standard/string.c 		memcpy(q, end, endlen);
q                2316 ext/standard/string.c 		q += endlen;
q                2319 ext/standard/string.c 	*q = '\0';
q                2320 ext/standard/string.c 	ZSTR_LEN(dest) = q - ZSTR_VAL(dest);
q                2703 ext/standard/string.c 	char *p, *q;
q                2719 ext/standard/string.c 	for (p = ZSTR_VAL(old), q = ZSTR_VAL(str); p != old_end; p++) {
q                2733 ext/standard/string.c 				*q++ = '\\';
q                2736 ext/standard/string.c 				*q++ = c;
q                2740 ext/standard/string.c 	*q = '\0';
q                2742 ext/standard/string.c 	RETURN_NEW_STR(zend_string_truncate(str, q - ZSTR_VAL(str), 0));
q                3554 ext/standard/string.c 	char *p, *q;
q                3561 ext/standard/string.c 		for (q = (char *) txt2; q < end2; q++) {
q                3562 ext/standard/string.c 			for (l = 0; (p + l < end1) && (q + l < end2) && (p[l] == q[l]); l++);
q                3566 ext/standard/string.c 				*pos2 = q - txt2;
q                  80 ext/standard/url_scanner_ex.c 			char *q;
q                  84 ext/standard/url_scanner_ex.c 			for (q = key; *q; q++)
q                  85 ext/standard/url_scanner_ex.c 				*q = tolower(*q);
q                  86 ext/standard/url_scanner_ex.c 			keylen = q - key;
q                 107 ext/standard/url_scanner_ex.c #define YYLIMIT q
q                 112 ext/standard/url_scanner_ex.c 	register const char *p, *q;
q                 116 ext/standard/url_scanner_ex.c 	q = (p = ZSTR_VAL(url->s)) + ZSTR_LEN(url->s);
q                 199 ext/standard/url_scanner_ex.c 		smart_str_appendl(dest, bash, q - bash);
q                 240 ext/standard/url_scanner_ex.c #define YYMARKER q
q                 339 ext/standard/url_scanner_ex.c 	char *end, *q;
q                 244 ext/standard/var_unserializer.c static inline zend_long parse_iv2(const unsigned char *p, const unsigned char **q)
q                 267 ext/standard/var_unserializer.c 	if (q) *q = p;
q                  37 ext/standard/versioning.c     char *buf = safe_emalloc(len, 2, 1), *q, lp, lq;
q                  46 ext/standard/versioning.c     q = buf;
q                  47 ext/standard/versioning.c     *q++ = lp = *p++;
q                  58 ext/standard/versioning.c 		lq = *(q - 1);
q                  61 ext/standard/versioning.c 				*q++ = '.';
q                  65 ext/standard/versioning.c 				*q++ = '.';
q                  67 ext/standard/versioning.c 			*q++ = *p;
q                  70 ext/standard/versioning.c 				*q++ = '.';
q                  73 ext/standard/versioning.c 			*q++ = *p;
q                  77 ext/standard/versioning.c     *q++ = '\0';
q                 109 ext/xmlrpc/libxmlrpc/queue.c static int  Q_BSearch(queue *q, void *key,
q                 131 ext/xmlrpc/libxmlrpc/queue.c int Q_Init(queue  *q)
q                 133 ext/xmlrpc/libxmlrpc/queue.c    if(q) {
q                 134 ext/xmlrpc/libxmlrpc/queue.c       q->head = q->tail = NULL;
q                 135 ext/xmlrpc/libxmlrpc/queue.c       q->cursor = q->head;
q                 136 ext/xmlrpc/libxmlrpc/queue.c       q->size = 0;
q                 137 ext/xmlrpc/libxmlrpc/queue.c       q->sorted = False_;
q                 157 ext/xmlrpc/libxmlrpc/queue.c int Q_AtHead(queue *q)
q                 159 ext/xmlrpc/libxmlrpc/queue.c    return(q && q->cursor == q->head);
q                 177 ext/xmlrpc/libxmlrpc/queue.c int Q_AtTail(queue *q)
q                 179 ext/xmlrpc/libxmlrpc/queue.c    return(q && q->cursor == q->tail);
q                 197 ext/xmlrpc/libxmlrpc/queue.c inline int Q_IsEmpty(queue *q)
q                 199 ext/xmlrpc/libxmlrpc/queue.c    return(!q || q->size == 0);
q                 216 ext/xmlrpc/libxmlrpc/queue.c int Q_Size(queue *q)
q                 218 ext/xmlrpc/libxmlrpc/queue.c    return q ? q->size : 0;
q                 236 ext/xmlrpc/libxmlrpc/queue.c void *Q_Head(queue *q)
q                 238 ext/xmlrpc/libxmlrpc/queue.c    if(Q_IsEmpty(q))
q                 241 ext/xmlrpc/libxmlrpc/queue.c    q->cursor = q->head;
q                 243 ext/xmlrpc/libxmlrpc/queue.c    return  q->cursor->data;
q                 261 ext/xmlrpc/libxmlrpc/queue.c void *Q_Tail(queue *q)
q                 263 ext/xmlrpc/libxmlrpc/queue.c    if(Q_IsEmpty(q))
q                 266 ext/xmlrpc/libxmlrpc/queue.c    q->cursor = q->tail;
q                 268 ext/xmlrpc/libxmlrpc/queue.c    return  q->cursor->data;
q                 286 ext/xmlrpc/libxmlrpc/queue.c int Q_PushHead(queue *q, void *d)
q                 288 ext/xmlrpc/libxmlrpc/queue.c    if(q && d) {
q                 296 ext/xmlrpc/libxmlrpc/queue.c       n = q->head;
q                 298 ext/xmlrpc/libxmlrpc/queue.c       q->head = (node*)p;
q                 299 ext/xmlrpc/libxmlrpc/queue.c       q->head->prev = NULL;
q                 301 ext/xmlrpc/libxmlrpc/queue.c       if(q->size == 0) {
q                 302 ext/xmlrpc/libxmlrpc/queue.c          q->head->next = NULL;
q                 303 ext/xmlrpc/libxmlrpc/queue.c          q->tail = q->head;
q                 306 ext/xmlrpc/libxmlrpc/queue.c          q->head->next = (datanode*)n;
q                 307 ext/xmlrpc/libxmlrpc/queue.c          n->prev = q->head;
q                 310 ext/xmlrpc/libxmlrpc/queue.c       q->head->data = d;
q                 311 ext/xmlrpc/libxmlrpc/queue.c       q->size++;
q                 313 ext/xmlrpc/libxmlrpc/queue.c       q->cursor = q->head;
q                 315 ext/xmlrpc/libxmlrpc/queue.c       q->sorted = False_;
q                 338 ext/xmlrpc/libxmlrpc/queue.c int Q_PushTail(queue *q, void *d)
q                 340 ext/xmlrpc/libxmlrpc/queue.c    if(q && d) {
q                 348 ext/xmlrpc/libxmlrpc/queue.c       p = q->tail;
q                 349 ext/xmlrpc/libxmlrpc/queue.c       q->tail = (node *)n;
q                 351 ext/xmlrpc/libxmlrpc/queue.c       if(q->size == 0) {
q                 352 ext/xmlrpc/libxmlrpc/queue.c          q->tail->prev = NULL;
q                 353 ext/xmlrpc/libxmlrpc/queue.c          q->head = q->tail;
q                 356 ext/xmlrpc/libxmlrpc/queue.c          q->tail->prev = (datanode *)p;
q                 357 ext/xmlrpc/libxmlrpc/queue.c          p->next = q->tail;
q                 360 ext/xmlrpc/libxmlrpc/queue.c       q->tail->next = NULL;
q                 362 ext/xmlrpc/libxmlrpc/queue.c       q->tail->data =  d;
q                 363 ext/xmlrpc/libxmlrpc/queue.c       q->cursor = q->tail;
q                 364 ext/xmlrpc/libxmlrpc/queue.c       q->size++;
q                 366 ext/xmlrpc/libxmlrpc/queue.c       q->sorted = False_;
q                 390 ext/xmlrpc/libxmlrpc/queue.c void *Q_PopHead(queue *q)
q                 395 ext/xmlrpc/libxmlrpc/queue.c    if(Q_IsEmpty(q))
q                 398 ext/xmlrpc/libxmlrpc/queue.c    d = q->head->data;
q                 399 ext/xmlrpc/libxmlrpc/queue.c    n = q->head->next;
q                 400 ext/xmlrpc/libxmlrpc/queue.c    free(q->head);
q                 402 ext/xmlrpc/libxmlrpc/queue.c    q->size--;
q                 404 ext/xmlrpc/libxmlrpc/queue.c    if(q->size == 0)
q                 405 ext/xmlrpc/libxmlrpc/queue.c       q->head = q->tail = q->cursor = NULL;
q                 407 ext/xmlrpc/libxmlrpc/queue.c       q->head = (node *)n;
q                 408 ext/xmlrpc/libxmlrpc/queue.c       q->head->prev = NULL;
q                 409 ext/xmlrpc/libxmlrpc/queue.c       q->cursor = q->head;
q                 412 ext/xmlrpc/libxmlrpc/queue.c    q->sorted = False_;
q                 433 ext/xmlrpc/libxmlrpc/queue.c void *Q_PopTail(queue *q)
q                 438 ext/xmlrpc/libxmlrpc/queue.c    if(Q_IsEmpty(q))
q                 441 ext/xmlrpc/libxmlrpc/queue.c    d = q->tail->data;
q                 442 ext/xmlrpc/libxmlrpc/queue.c    p = q->tail->prev;
q                 443 ext/xmlrpc/libxmlrpc/queue.c    free(q->tail);
q                 444 ext/xmlrpc/libxmlrpc/queue.c    q->size--;
q                 446 ext/xmlrpc/libxmlrpc/queue.c    if(q->size == 0)
q                 447 ext/xmlrpc/libxmlrpc/queue.c       q->head = q->tail = q->cursor = NULL;
q                 449 ext/xmlrpc/libxmlrpc/queue.c       q->tail = (node *)p;
q                 450 ext/xmlrpc/libxmlrpc/queue.c       q->tail->next = NULL;
q                 451 ext/xmlrpc/libxmlrpc/queue.c       q->cursor = q->tail;
q                 454 ext/xmlrpc/libxmlrpc/queue.c    q->sorted = False_;
q                 477 ext/xmlrpc/libxmlrpc/queue.c void *Q_Next(queue *q)
q                 479 ext/xmlrpc/libxmlrpc/queue.c    if(!q)
q                 482 ext/xmlrpc/libxmlrpc/queue.c    if(!q->cursor || q->cursor->next == NULL)
q                 485 ext/xmlrpc/libxmlrpc/queue.c    q->cursor = (node *)q->cursor->next;
q                 487 ext/xmlrpc/libxmlrpc/queue.c    return  q->cursor->data ;
q                 507 ext/xmlrpc/libxmlrpc/queue.c void *Q_Previous(queue *q)
q                 509 ext/xmlrpc/libxmlrpc/queue.c    if(!q)
q                 512 ext/xmlrpc/libxmlrpc/queue.c    if(q->cursor->prev == NULL)
q                 515 ext/xmlrpc/libxmlrpc/queue.c    q->cursor = (node *)q->cursor->prev;
q                 517 ext/xmlrpc/libxmlrpc/queue.c    return q->cursor->data;
q                 521 ext/xmlrpc/libxmlrpc/queue.c void *Q_Iter_Del(queue *q, q_iter iter)
q                 526 ext/xmlrpc/libxmlrpc/queue.c    if(!q)
q                 532 ext/xmlrpc/libxmlrpc/queue.c    if(iter == (q_iter)q->head)
q                 533 ext/xmlrpc/libxmlrpc/queue.c       return Q_PopHead(q);
q                 535 ext/xmlrpc/libxmlrpc/queue.c    if(iter == (q_iter)q->tail)
q                 536 ext/xmlrpc/libxmlrpc/queue.c       return Q_PopTail(q);
q                 547 ext/xmlrpc/libxmlrpc/queue.c    if (q->cursor == (node*)iter) {
q                 549 ext/xmlrpc/libxmlrpc/queue.c          q->cursor = p;
q                 551 ext/xmlrpc/libxmlrpc/queue.c          q->cursor = n;
q                 560 ext/xmlrpc/libxmlrpc/queue.c    q->size--;
q                 562 ext/xmlrpc/libxmlrpc/queue.c    q->sorted = False_;
q                 586 ext/xmlrpc/libxmlrpc/queue.c void *Q_DelCur(queue* q) {
q                 587 ext/xmlrpc/libxmlrpc/queue.c    if(q) {
q                 588 ext/xmlrpc/libxmlrpc/queue.c       return Q_Iter_Del(q, (q_iter)q->cursor);
q                 610 ext/xmlrpc/libxmlrpc/queue.c void Q_Destroy(queue *q)
q                 612 ext/xmlrpc/libxmlrpc/queue.c    while(!Q_IsEmpty(q)) {
q                 613 ext/xmlrpc/libxmlrpc/queue.c       Q_PopHead(q);
q                 632 ext/xmlrpc/libxmlrpc/queue.c void *Q_Get(queue *q)
q                 634 ext/xmlrpc/libxmlrpc/queue.c    if(!q)
q                 637 ext/xmlrpc/libxmlrpc/queue.c    if(q->cursor == NULL)
q                 639 ext/xmlrpc/libxmlrpc/queue.c    return q->cursor->data;
q                 658 ext/xmlrpc/libxmlrpc/queue.c int Q_Put(queue *q, void *data)
q                 660 ext/xmlrpc/libxmlrpc/queue.c    if(q && data) {
q                 661 ext/xmlrpc/libxmlrpc/queue.c       if(q->cursor == NULL)
q                 664 ext/xmlrpc/libxmlrpc/queue.c       q->cursor->data = data;
q                 690 ext/xmlrpc/libxmlrpc/queue.c int Q_Find(queue *q, void *data,
q                 695 ext/xmlrpc/libxmlrpc/queue.c    if (q == NULL) {
q                 699 ext/xmlrpc/libxmlrpc/queue.c    d = Q_Head(q);
q                 703 ext/xmlrpc/libxmlrpc/queue.c       d = Q_Next(q);
q                 704 ext/xmlrpc/libxmlrpc/queue.c    } while(!Q_AtTail(q));
q                 777 ext/xmlrpc/libxmlrpc/queue.c int Q_Sort(queue *q, int (*Comp)(const void *, const void *))
q                 785 ext/xmlrpc/libxmlrpc/queue.c    if(q->sorted) {
q                 788 ext/xmlrpc/libxmlrpc/queue.c       q->sorted = False_;
q                 793 ext/xmlrpc/libxmlrpc/queue.c    index = malloc(q->size * sizeof(q->cursor->data));
q                 797 ext/xmlrpc/libxmlrpc/queue.c    posn_index = malloc(q->size * sizeof(q->cursor));
q                 805 ext/xmlrpc/libxmlrpc/queue.c    d = Q_Head(q);
q                 806 ext/xmlrpc/libxmlrpc/queue.c    for(i=0; i < q->size; i++) {
q                 808 ext/xmlrpc/libxmlrpc/queue.c       posn_index[i] = q->cursor;
q                 809 ext/xmlrpc/libxmlrpc/queue.c       d = Q_Next(q);
q                 814 ext/xmlrpc/libxmlrpc/queue.c    QuickSort(index, 0, q->size - 1, Comp);
q                 818 ext/xmlrpc/libxmlrpc/queue.c    dn = q->head;
q                 828 ext/xmlrpc/libxmlrpc/queue.c       Q_Find(q, d, Comp);
q                 829 ext/xmlrpc/libxmlrpc/queue.c    else  Q_Head(q);
q                 831 ext/xmlrpc/libxmlrpc/queue.c    q->sorted = True_;
q                 853 ext/xmlrpc/libxmlrpc/queue.c static int Q_BSearch( queue *q, void *key,
q                 859 ext/xmlrpc/libxmlrpc/queue.c    hi = q->size - 1;
q                 897 ext/xmlrpc/libxmlrpc/queue.c void *Q_Seek(queue *q, void *data, int (*Comp)(const void *, const void *))
q                 901 ext/xmlrpc/libxmlrpc/queue.c    if (q == NULL) {
q                 905 ext/xmlrpc/libxmlrpc/queue.c    if(!q->sorted) {
q                 906 ext/xmlrpc/libxmlrpc/queue.c       if(!Q_Sort(q, Comp))
q                 910 ext/xmlrpc/libxmlrpc/queue.c    idx = Q_BSearch(q, data, Comp);
q                 915 ext/xmlrpc/libxmlrpc/queue.c    q->cursor = posn_index[idx];
q                 941 ext/xmlrpc/libxmlrpc/queue.c int Q_Insert(queue *q, void *data, int (*Comp)(const void *, const void *))
q                 943 ext/xmlrpc/libxmlrpc/queue.c    if (q == NULL) {
q                 947 ext/xmlrpc/libxmlrpc/queue.c    Q_PushHead(q, data);
q                 949 ext/xmlrpc/libxmlrpc/queue.c    if(!Q_Sort(q, Comp))
q                 956 ext/xmlrpc/libxmlrpc/queue.c q_iter Q_Iter_Head(queue *q) {
q                 957 ext/xmlrpc/libxmlrpc/queue.c    return q ? (q_iter)q->head : NULL;
q                 960 ext/xmlrpc/libxmlrpc/queue.c q_iter Q_Iter_Tail(queue *q) {
q                 961 ext/xmlrpc/libxmlrpc/queue.c    return q ? (q_iter)q->tail : NULL;
q                  48 ext/xmlrpc/libxmlrpc/queue.h int    Q_Init(queue  *q);
q                  49 ext/xmlrpc/libxmlrpc/queue.h void   Q_Destroy(queue *q);
q                  50 ext/xmlrpc/libxmlrpc/queue.h int    Q_IsEmpty(queue *q);
q                  51 ext/xmlrpc/libxmlrpc/queue.h int    Q_Size(queue *q);
q                  52 ext/xmlrpc/libxmlrpc/queue.h int    Q_AtHead(queue *q);
q                  53 ext/xmlrpc/libxmlrpc/queue.h int    Q_AtTail(queue *q);
q                  54 ext/xmlrpc/libxmlrpc/queue.h int    Q_PushHead(queue *q, void *d);
q                  55 ext/xmlrpc/libxmlrpc/queue.h int    Q_PushTail(queue *q, void *d);
q                  56 ext/xmlrpc/libxmlrpc/queue.h void  *Q_Head(queue *q);
q                  57 ext/xmlrpc/libxmlrpc/queue.h void  *Q_Tail(queue *q);
q                  58 ext/xmlrpc/libxmlrpc/queue.h void  *Q_PopHead(queue *q);
q                  59 ext/xmlrpc/libxmlrpc/queue.h void  *Q_PopTail(queue *q);
q                  60 ext/xmlrpc/libxmlrpc/queue.h void  *Q_Next(queue *q);
q                  61 ext/xmlrpc/libxmlrpc/queue.h void  *Q_Previous(queue *q);
q                  62 ext/xmlrpc/libxmlrpc/queue.h void  *Q_DelCur(queue *q);
q                  63 ext/xmlrpc/libxmlrpc/queue.h void  *Q_Get(queue *q);
q                  64 ext/xmlrpc/libxmlrpc/queue.h int    Q_Put(queue *q, void *data);
q                  65 ext/xmlrpc/libxmlrpc/queue.h int    Q_Sort(queue *q, int (*Comp)(const void *, const void *));
q                  66 ext/xmlrpc/libxmlrpc/queue.h int    Q_Find(queue *q, void *data,
q                  68 ext/xmlrpc/libxmlrpc/queue.h void  *Q_Seek(queue *q, void *data,
q                  70 ext/xmlrpc/libxmlrpc/queue.h int    Q_Insert(queue *q, void *data,
q                  74 ext/xmlrpc/libxmlrpc/queue.h q_iter Q_Iter_Head(queue *q);
q                  75 ext/xmlrpc/libxmlrpc/queue.h q_iter Q_Iter_Tail(queue *q);
q                  80 ext/xmlrpc/libxmlrpc/queue.h void*  Q_Iter_Del(queue *q, q_iter iter); /* not read only! here for completeness. */
q                  83 ext/xmlrpc/libxmlrpc/queue.h #define Q_Iter_Head_F(q) (q ? (q_iter)((queue*)q)->head : NULL)
q                  84 ext/xmlrpc/libxmlrpc/queue.h #define Q_Iter_Tail_F(q) (q ? (q_iter)((queue*)q)->tail : NULL)
q                1050 ext/xmlrpc/libxmlrpc/xmlrpc.c 				if(!Q_Size(value->v->q)) {
q                1058 ext/xmlrpc/libxmlrpc/xmlrpc.c          value->v->q = (queue*)malloc(sizeof(queue));
q                1059 ext/xmlrpc/libxmlrpc/xmlrpc.c          if(value->v->q) {
q                1060 ext/xmlrpc/libxmlrpc/xmlrpc.c             Q_Init(value->v->q);
q                1158 ext/xmlrpc/libxmlrpc/xmlrpc.c          target->v->q && target->v->type != xmlrpc_vector_none) {
q                1173 ext/xmlrpc/libxmlrpc/xmlrpc.c 						 || Q_PushTail (target->v->q, XMLRPC_CopyValue (source))) {
q                1273 ext/xmlrpc/libxmlrpc/xmlrpc.c    if(vector && vector->v && vector->v->q) {
q                1274 ext/xmlrpc/libxmlrpc/xmlrpc.c        q_iter qi = Q_Iter_Head_F(vector->v->q);
q                1300 ext/xmlrpc/libxmlrpc/xmlrpc.c    if(vector && vector->v && vector->v->q && value) {
q                1301 ext/xmlrpc/libxmlrpc/xmlrpc.c        q_iter qi = Q_Iter_Head_F(vector->v->q);
q                1307 ext/xmlrpc/libxmlrpc/xmlrpc.c              Q_Iter_Del(vector->v->q, qi);
q                1464 ext/xmlrpc/libxmlrpc/xmlrpc.c                XMLRPC_VALUE cur = (XMLRPC_VALUE)Q_Head(value->v->q);
q                1471 ext/xmlrpc/libxmlrpc/xmlrpc.c                   if(value->v && value->v->q) {
q                1472 ext/xmlrpc/libxmlrpc/xmlrpc.c                      cur = Q_Next(value->v->q);
q                1479 ext/xmlrpc/libxmlrpc/xmlrpc.c                Q_Destroy(value->v->q);
q                1480 ext/xmlrpc/libxmlrpc/xmlrpc.c                my_free(value->v->q);
q                1650 ext/xmlrpc/libxmlrpc/xmlrpc.c 				q_iter qi = Q_Iter_Head_F (xSource->v->q);
q                2140 ext/xmlrpc/libxmlrpc/xmlrpc.c       size = Q_Size(value->v->q);
q                2168 ext/xmlrpc/libxmlrpc/xmlrpc.c       xReturn = (XMLRPC_VALUE)Q_Head(value->v->q);
q                2194 ext/xmlrpc/libxmlrpc/xmlrpc.c       xReturn = (XMLRPC_VALUE)Q_Next(value->v->q);
q                 125 ext/xmlrpc/libxmlrpc/xmlrpc_private.h    queue *q;                                          /* list of child values              */
q                 276 main/fastcgi.c 		fcgi_hash_buckets *q = b;
q                 278 main/fastcgi.c 		free(q);
q                 282 main/fastcgi.c 		fcgi_data_seg *q = p;
q                 284 main/fastcgi.c 		free(q);
q                 294 main/fastcgi.c 		fcgi_hash_buckets *q = h->buckets;
q                 297 main/fastcgi.c 		free(q);
q                 302 main/fastcgi.c 		fcgi_data_seg *q = h->data;
q                 305 main/fastcgi.c 		free(q);
q                1145 main/fastcgi.c 		fcgi_hash_bucket *q;
q                1157 main/fastcgi.c 		q = req->env.list;
q                1158 main/fastcgi.c 		while (q != NULL) {
q                1159 main/fastcgi.c 			if ((value = zend_hash_str_find(&fcgi_mgmt_vars, q->var, q->var_len)) == NULL) {
q                1160 main/fastcgi.c 				q = q->list_next;
q                1164 main/fastcgi.c 			if ((p + 4 + 4 + q->var_len + zlen) >= (buf + sizeof(buf))) {
q                1167 main/fastcgi.c 			if (q->var_len < 0x80) {
q                1168 main/fastcgi.c 				*p++ = q->var_len;
q                1170 main/fastcgi.c 				*p++ = ((q->var_len >> 24) & 0xff) | 0x80;
q                1171 main/fastcgi.c 				*p++ = (q->var_len >> 16) & 0xff;
q                1172 main/fastcgi.c 				*p++ = (q->var_len >> 8) & 0xff;
q                1173 main/fastcgi.c 				*p++ = q->var_len & 0xff;
q                1183 main/fastcgi.c 			memcpy(p, q->var, q->var_len);
q                1184 main/fastcgi.c 			p += q->var_len;
q                1187 main/fastcgi.c 			q = q->list_next;
q                 110 main/mergesort.c 	register u_char *f1, *f2, *t, *b, *tp2, *q, *l1, *l2;
q                 148 main/mergesort.c 	    			q = f2;
q                 152 main/mergesort.c 	    			q = f1;
q                 157 main/mergesort.c 				while ((b += size) < t && cmp(q, b) >sense)
q                 166 main/mergesort.c 						    (*cmp)(q, p) <= sense)
q                 171 main/mergesort.c 	    				} else if ((*cmp)(q, p) <= sense) {
q                 180 main/mergesort.c 	    				if ((*cmp)(q, p = b + i) <= sense)
q                 187 main/mergesort.c 	    				if ((*cmp)(q,
q                 195 main/mergesort.c 	    		if (q == f1) {
q                1571 sapi/cgi/cgi_main.c 		char **env, *p, *q, *var, *val, *t = buf;
q                1601 sapi/cgi/cgi_main.c 				var = q = t;
q                1603 sapi/cgi/cgi_main.c 				*q++ = *p++;
q                1609 sapi/cgi/cgi_main.c 						*q++ = '-';
q                1613 sapi/cgi/cgi_main.c 							*q++ = *p++;
q                1617 sapi/cgi/cgi_main.c 						*q++ = (*p++ - 'A' + 'a');
q                1619 sapi/cgi/cgi_main.c 						*q++ = *p++;
q                1622 sapi/cgi/cgi_main.c 				*q = 0;
q                1354 sapi/cli/php_cli_server.c 	char *p = buf, *prev_path = NULL, *q, *vpath;
q                1368 sapi/cli/php_cli_server.c 	q = request->vpath + request->vpath_len;
q                1369 sapi/cli/php_cli_server.c 	while (q > request->vpath) {
q                1370 sapi/cli/php_cli_server.c 		if (*q-- == '.') {
q                1377 sapi/cli/php_cli_server.c 	q = p + request->vpath_len;
q                1379 sapi/cli/php_cli_server.c 		if (*q == '/') {
q                1380 sapi/cli/php_cli_server.c 			*q = '\\';
q                1382 sapi/cli/php_cli_server.c 	} while (q-- > p);
q                1386 sapi/cli/php_cli_server.c 	q = p;
q                1387 sapi/cli/php_cli_server.c 	while (q > buf) {
q                1391 sapi/cli/php_cli_server.c 				if (q[-1] != DEFAULT_SLASH) {
q                1392 sapi/cli/php_cli_server.c 					*q++ = DEFAULT_SLASH;
q                1396 sapi/cli/php_cli_server.c 					memmove(q, *file, l + 1);
q                1398 sapi/cli/php_cli_server.c 						q += l;
q                1415 sapi/cli/php_cli_server.c 			*q = DEFAULT_SLASH;
q                1417 sapi/cli/php_cli_server.c 		while (q > buf && *(--q) != DEFAULT_SLASH);
q                1418 sapi/cli/php_cli_server.c 		prev_path_len = p - q;
q                1419 sapi/cli/php_cli_server.c 		prev_path = pestrndup(q, prev_path_len, 1);
q                1420 sapi/cli/php_cli_server.c 		*q = '\0';
q                1433 sapi/cli/php_cli_server.c 		request->vpath = pestrndup(vpath, q - vpath, 1);
q                1434 sapi/cli/php_cli_server.c 		request->vpath_len = q - vpath;
q                1436 sapi/cli/php_cli_server.c 		request->path_translated_len = q - buf;
q                1439 sapi/cli/php_cli_server.c 		request->vpath = pestrndup(vpath, q - vpath, 1);
q                1440 sapi/cli/php_cli_server.c 		request->vpath_len = q - vpath;
q                1442 sapi/cli/php_cli_server.c 		request->path_translated_len = q - buf;
q                 151 sapi/fpm/fpm/events/devpoll.c 	struct fpm_event_queue_s *q;
q                 175 sapi/fpm/fpm/events/devpoll.c 		q = queue;
q                 176 sapi/fpm/fpm/events/devpoll.c 		while (q) {
q                 179 sapi/fpm/fpm/events/devpoll.c 			if (q->ev && q->ev->fd == active_pollfds[i].fd) {
q                 182 sapi/fpm/fpm/events/devpoll.c 					fpm_event_fire(q->ev);
q                 190 sapi/fpm/fpm/events/devpoll.c 			q = q->next; /* iterate */
q                 136 sapi/fpm/fpm/events/poll.c 	struct fpm_event_queue_s *q;
q                 158 sapi/fpm/fpm/events/poll.c 		q = queue;
q                 159 sapi/fpm/fpm/events/poll.c 		while (q) {
q                 161 sapi/fpm/fpm/events/poll.c 			if (q->ev && q->ev->index >= 0 && q->ev->index < npollfds && q->ev->fd == active_pollfds[q->ev->index].fd) {
q                 164 sapi/fpm/fpm/events/poll.c 				if (active_pollfds[q->ev->index].revents & POLLIN) {
q                 167 sapi/fpm/fpm/events/poll.c 					fpm_event_fire(q->ev);
q                 175 sapi/fpm/fpm/events/poll.c 			q = q->next; /* iterate */
q                  89 sapi/fpm/fpm/events/select.c 	struct fpm_event_queue_s *q;
q                 115 sapi/fpm/fpm/events/select.c 		q = queue;
q                 116 sapi/fpm/fpm/events/select.c 		while (q) {
q                 117 sapi/fpm/fpm/events/select.c 			if (q->ev) { /* sanity check */
q                 120 sapi/fpm/fpm/events/select.c 				if (FD_ISSET(q->ev->fd, &current_fds)) {
q                 123 sapi/fpm/fpm/events/select.c 					fpm_event_fire(q->ev);
q                 131 sapi/fpm/fpm/events/select.c 			q = q->next; /* iterate */
q                 180 sapi/fpm/fpm/fpm_events.c 	struct fpm_event_queue_s *q;
q                 184 sapi/fpm/fpm/fpm_events.c 	q = *queue;
q                 185 sapi/fpm/fpm/fpm_events.c 	while (q) {
q                 186 sapi/fpm/fpm/fpm_events.c 		if (q->ev == ev) {
q                 187 sapi/fpm/fpm/fpm_events.c 			if (q->prev) {
q                 188 sapi/fpm/fpm/fpm_events.c 				q->prev->next = q->next;
q                 190 sapi/fpm/fpm/fpm_events.c 			if (q->next) {
q                 191 sapi/fpm/fpm/fpm_events.c 				q->next->prev = q->prev;
q                 193 sapi/fpm/fpm/fpm_events.c 			if (q == *queue) {
q                 194 sapi/fpm/fpm/fpm_events.c 				*queue = q->next;
q                 205 sapi/fpm/fpm/fpm_events.c 			free(q);
q                 208 sapi/fpm/fpm/fpm_events.c 		q = q->next;
q                 216 sapi/fpm/fpm/fpm_events.c 	struct fpm_event_queue_s *q, *tmp;
q                 226 sapi/fpm/fpm/fpm_events.c 	q = *queue;
q                 227 sapi/fpm/fpm/fpm_events.c 	while (q) {
q                 228 sapi/fpm/fpm/fpm_events.c 		tmp = q;
q                 229 sapi/fpm/fpm/fpm_events.c 		q = q->next;
q                 375 sapi/fpm/fpm/fpm_events.c 		struct fpm_event_queue_s *q, *q2;
q                 391 sapi/fpm/fpm/fpm_events.c 		q = fpm_event_queue_timer;
q                 392 sapi/fpm/fpm/fpm_events.c 		while (q) {
q                 394 sapi/fpm/fpm/fpm_events.c 				ms = q->ev->timeout;
q                 396 sapi/fpm/fpm/fpm_events.c 				if (timercmp(&q->ev->timeout, &ms, <)) {
q                 397 sapi/fpm/fpm/fpm_events.c 					ms = q->ev->timeout;
q                 400 sapi/fpm/fpm/fpm_events.c 			q = q->next;
q                 423 sapi/fpm/fpm/fpm_events.c 		q = fpm_event_queue_timer;
q                 424 sapi/fpm/fpm/fpm_events.c 		while (q) {
q                 426 sapi/fpm/fpm/fpm_events.c 			if (q->ev) {
q                 427 sapi/fpm/fpm/fpm_events.c 				if (timercmp(&now, &q->ev->timeout, >) || timercmp(&now, &q->ev->timeout, ==)) {
q                 428 sapi/fpm/fpm/fpm_events.c 					fpm_event_fire(q->ev);
q                 433 sapi/fpm/fpm/fpm_events.c 					if (q->ev->flags & FPM_EV_PERSIST) {
q                 434 sapi/fpm/fpm/fpm_events.c 						fpm_event_set_timeout(q->ev, now);
q                 436 sapi/fpm/fpm/fpm_events.c 						q2 = q;
q                 437 sapi/fpm/fpm/fpm_events.c 						if (q->prev) {
q                 438 sapi/fpm/fpm/fpm_events.c 							q->prev->next = q->next;
q                 440 sapi/fpm/fpm/fpm_events.c 						if (q->next) {
q                 441 sapi/fpm/fpm/fpm_events.c 							q->next->prev = q->prev;
q                 443 sapi/fpm/fpm/fpm_events.c 						if (q == fpm_event_queue_timer) {
q                 444 sapi/fpm/fpm/fpm_events.c 							fpm_event_queue_timer = q->next;
q                 449 sapi/fpm/fpm/fpm_events.c 						q = q->next;
q                 455 sapi/fpm/fpm/fpm_events.c 			q = q->next;
q                  46 sapi/phpdbg/phpdbg_help.c 	char *new, *p, *q;
q                  95 sapi/phpdbg/phpdbg_help.c 	for (p = text, q = new; *p; p++) {
q                  97 sapi/phpdbg/phpdbg_help.c 			last_new_blank = q;
q                  99 sapi/phpdbg/phpdbg_help.c 			*q++ = ' ';
q                 102 sapi/phpdbg/phpdbg_help.c 			*q++ = *p;
q                 108 sapi/phpdbg/phpdbg_help.c 				memcpy (q, in_bold ? bold_on_escape : bold_off_escape, bold_escape_len);
q                 109 sapi/phpdbg/phpdbg_help.c 				q += bold_escape_len;
q                 114 sapi/phpdbg/phpdbg_help.c 			memcpy (q, prompt_escape, prompt_escape_len);
q                 115 sapi/phpdbg/phpdbg_help.c 			q += prompt_escape_len;
q                 120 sapi/phpdbg/phpdbg_help.c 			*q++ = *p;
q                 123 sapi/phpdbg/phpdbg_help.c 			*q++ = *p;
q                 134 sapi/phpdbg/phpdbg_help.c 	*q++ = '\0';
q                 136 sapi/phpdbg/phpdbg_help.c 	if ((q-new)>size) {
q                 137 sapi/phpdbg/phpdbg_help.c 		phpdbg_error("help", "overrun=\"%lu\"", "Output overrun of %lu bytes", ((q - new) - size));
q                 524 win32/glob.c   compare(const void *p, const void *q)
q                 526 win32/glob.c   	return(strcmp(*(char **)p, *(char **)q));
q                 559 win32/glob.c   	Char *p, *q;
q                 587 win32/glob.c   		q = pathend;
q                 592 win32/glob.c   			if (q+1 > pathend_last)
q                 594 win32/glob.c   			*q++ = *p++;
q                 598 win32/glob.c   			pathend = q;