k                 178 Zend/zend_sort.c 				char *i, *j, *k;
k                 195 Zend/zend_sort.c 					for (k = i; k > j; k -= siz) {
k                 196 Zend/zend_sort.c 						swp(k, k - siz);
k                 224 Zend/zend_sort.c 					for (k = i; k > j; k -= siz) {
k                 225 Zend/zend_sort.c 						swp(k, k - siz);
k                 540 Zend/zend_strtod.c 	int k, maxwds, sign, wds;
k                 581 Zend/zend_strtod.c 	(k) int k;
k                 583 Zend/zend_strtod.c 	(int k)
k                 595 Zend/zend_strtod.c 	if (k <= Kmax && (rv = freelist[k]))
k                 596 Zend/zend_strtod.c 		freelist[k] = rv->next;
k                 598 Zend/zend_strtod.c 		x = 1 << k;
k                 608 Zend/zend_strtod.c 		if (k <= Kmax && pmem_next - private_mem + len <= PRIVATE_mem) {
k                 619 Zend/zend_strtod.c 		rv->k = k;
k                 636 Zend/zend_strtod.c 		if (v->k > Kmax)
k                 644 Zend/zend_strtod.c 			v->next = freelist[v->k];
k                 645 Zend/zend_strtod.c 			freelist[v->k] = v;
k                 700 Zend/zend_strtod.c 			b1 = Balloc(b->k+1);
k                 720 Zend/zend_strtod.c 	int i, k;
k                 724 Zend/zend_strtod.c 	for(k = 0, y = 1; x > y; y <<= 1, k++) ;
k                 726 Zend/zend_strtod.c 	b = Balloc(k);
k                 730 Zend/zend_strtod.c 	b = Balloc(k+1);
k                 757 Zend/zend_strtod.c 	int k = 0;
k                 760 Zend/zend_strtod.c 		k = 16;
k                 764 Zend/zend_strtod.c 		k += 8;
k                 768 Zend/zend_strtod.c 		k += 4;
k                 772 Zend/zend_strtod.c 		k += 2;
k                 776 Zend/zend_strtod.c 		k++;
k                 780 Zend/zend_strtod.c 	return k;
k                 791 Zend/zend_strtod.c 	int k;
k                 804 Zend/zend_strtod.c 	k = 0;
k                 806 Zend/zend_strtod.c 		k = 16;
k                 810 Zend/zend_strtod.c 		k += 8;
k                 814 Zend/zend_strtod.c 		k += 4;
k                 818 Zend/zend_strtod.c 		k += 2;
k                 822 Zend/zend_strtod.c 		k++;
k                 828 Zend/zend_strtod.c 	return k;
k                 856 Zend/zend_strtod.c 	int k, wa, wb, wc;
k                 873 Zend/zend_strtod.c 	k = a->k;
k                 878 Zend/zend_strtod.c 		k++;
k                 879 Zend/zend_strtod.c 	c = Balloc(k);
k                 962 Zend/zend_strtod.c 	(b, k) Bigint *b; int k;
k                 964 Zend/zend_strtod.c 	(Bigint *b, int k)
k                 971 Zend/zend_strtod.c 	if ((i = k & 3))
k                 974 Zend/zend_strtod.c 	if (!(k >>= 2))
k                 991 Zend/zend_strtod.c 		if (k & 1) {
k                 996 Zend/zend_strtod.c 		if (!(k >>= 1))
k                1019 Zend/zend_strtod.c 	(b, k) Bigint *b; int k;
k                1021 Zend/zend_strtod.c 	(Bigint *b, int k)
k                1029 Zend/zend_strtod.c 	n = k >> 5;
k                1031 Zend/zend_strtod.c 	n = k >> 4;
k                1033 Zend/zend_strtod.c 	k1 = b->k;
k                1044 Zend/zend_strtod.c 	if (k &= 0x1f) {
k                1045 Zend/zend_strtod.c 		k1 = 32 - k;
k                1048 Zend/zend_strtod.c 			*x1++ = *x << k | z;
k                1056 Zend/zend_strtod.c 	if (k &= 0xf) {
k                1057 Zend/zend_strtod.c 		k1 = 16 - k;
k                1060 Zend/zend_strtod.c 			*x1++ = *x << k  & 0xffff | z;
k                1145 Zend/zend_strtod.c 	c = Balloc(a->k);
k                1255 Zend/zend_strtod.c 	int k;
k                1270 Zend/zend_strtod.c 	k = hi0bits(y);
k                1271 Zend/zend_strtod.c 	*e = 32 - k;
k                1273 Zend/zend_strtod.c 	if (k < Ebits) {
k                1274 Zend/zend_strtod.c 		d0 = Exp_1 | y >> (Ebits - k);
k                1276 Zend/zend_strtod.c 		d1 = y << ((32-Ebits) + k) | w >> (Ebits - k);
k                1280 Zend/zend_strtod.c 	if (k -= Ebits) {
k                1281 Zend/zend_strtod.c 		d0 = Exp_1 | y << k | z >> (32 - k);
k                1283 Zend/zend_strtod.c 		d1 = z << k | y >> (32 - k);
k                1290 Zend/zend_strtod.c 	if (k < Ebits + 16) {
k                1292 Zend/zend_strtod.c 		d0 = Exp_1 | y << k - Ebits | z >> Ebits + 16 - k;
k                1295 Zend/zend_strtod.c 		d1 = z << k + 16 - Ebits | w << k - Ebits | y >> 16 + Ebits - k;
k                1300 Zend/zend_strtod.c 	k -= Ebits + 16;
k                1301 Zend/zend_strtod.c 	d0 = Exp_1 | y << k + 16 | z << k | w >> 16 - k;
k                1303 Zend/zend_strtod.c 	d1 = w << k + 16 | y << k;
k                1325 Zend/zend_strtod.c 	int de, k;
k                1359 Zend/zend_strtod.c 		if ((k = lo0bits(&y))) {
k                1360 Zend/zend_strtod.c 			x[0] = y | z << (32 - k);
k                1361 Zend/zend_strtod.c 			z >>= k;
k                1371 Zend/zend_strtod.c 		k = lo0bits(&z);
k                1377 Zend/zend_strtod.c 		k += 32;
k                1381 Zend/zend_strtod.c 		if (k = lo0bits(&y))
k                1382 Zend/zend_strtod.c 			if (k >= 16) {
k                1383 Zend/zend_strtod.c 				x[0] = y | z << 32 - k & 0xffff;
k                1384 Zend/zend_strtod.c 				x[1] = z >> k - 16 & 0xffff;
k                1385 Zend/zend_strtod.c 				x[2] = z >> k;
k                1390 Zend/zend_strtod.c 				x[1] = y >> 16 | z << 16 - k & 0xffff;
k                1391 Zend/zend_strtod.c 				x[2] = z >> k & 0xffff;
k                1392 Zend/zend_strtod.c 				x[3] = z >> k+16;
k                1408 Zend/zend_strtod.c 		k = lo0bits(&z);
k                1409 Zend/zend_strtod.c 		if (k >= 16) {
k                1418 Zend/zend_strtod.c 		k += 32;
k                1428 Zend/zend_strtod.c 		*e = (de - Bias - (P-1) << 2) + k;
k                1429 Zend/zend_strtod.c 		*bits = 4*P + 8 - k - hi0bits(word0(d) & Frac_mask);
k                1431 Zend/zend_strtod.c 		*e = de - Bias - (P-1) + k;
k                1432 Zend/zend_strtod.c 		*bits = P - k;
k                1437 Zend/zend_strtod.c 		*e = de - Bias - (P-1) + 1 + k;
k                1459 Zend/zend_strtod.c 	int k, ka, kb;
k                1464 Zend/zend_strtod.c 	k = ka - kb + 32*(a->wds - b->wds);
k                1466 Zend/zend_strtod.c 	k = ka - kb + 16*(a->wds - b->wds);
k                1469 Zend/zend_strtod.c 	if (k > 0) {
k                1470 Zend/zend_strtod.c 		word0(&da) += (k >> 2)*Exp_msk1;
k                1471 Zend/zend_strtod.c 		if (k &= 3)
k                1472 Zend/zend_strtod.c 			dval(&da) *= 1 << k;
k                1475 Zend/zend_strtod.c 		k = -k;
k                1476 Zend/zend_strtod.c 		word0(&db) += (k >> 2)*Exp_msk1;
k                1477 Zend/zend_strtod.c 		if (k &= 3)
k                1478 Zend/zend_strtod.c 			dval(&db) *= 1 << k;
k                1481 Zend/zend_strtod.c 	if (k > 0)
k                1482 Zend/zend_strtod.c 		word0(&da) += k*Exp_msk1;
k                1484 Zend/zend_strtod.c 		k = -k;
k                1485 Zend/zend_strtod.c 		word0(&db) += k*Exp_msk1;
k                1716 Zend/zend_strtod.c 			b1 = Balloc(b->k+1);
k                1732 Zend/zend_strtod.c rshift(b, k) Bigint *b; int k;
k                1734 Zend/zend_strtod.c rshift(Bigint *b, int k)
k                1741 Zend/zend_strtod.c 	n = k >> kshift;
k                1745 Zend/zend_strtod.c 		if (k &= kmask) {
k                1746 Zend/zend_strtod.c 			n = 32 - k;
k                1747 Zend/zend_strtod.c 			y = *x++ >> k;
k                1750 Zend/zend_strtod.c 				y = *x++ >> k;
k                1765 Zend/zend_strtod.c any_on(b, k) Bigint *b; int k;
k                1767 Zend/zend_strtod.c any_on(Bigint *b, int k)
k                1775 Zend/zend_strtod.c 	n = k >> kshift;
k                1778 Zend/zend_strtod.c 	else if (n < nwds && (k &= kmask)) {
k                1780 Zend/zend_strtod.c 		x1 >>= k;
k                1781 Zend/zend_strtod.c 		x1 <<= k;
k                1812 Zend/zend_strtod.c 	int big, denorm, esign, havedig, k, n, nbits, up, zret;
k                1979 Zend/zend_strtod.c 	for(k = 0; n > (1 << (kshift-2)) - 1; n >>= 1)
k                1980 Zend/zend_strtod.c 		k++;
k                1981 Zend/zend_strtod.c 	b = Balloc(k);
k                2016 Zend/zend_strtod.c 			k = n - 1;
k                2017 Zend/zend_strtod.c 			if (x[k>>kshift] & 1 << (k & kmask)) {
k                2019 Zend/zend_strtod.c 				if (k > 0 && any_on(b,k))
k                2072 Zend/zend_strtod.c 		k = n - 1;
k                2075 Zend/zend_strtod.c 		else if (k > 0)
k                2076 Zend/zend_strtod.c 			lostbits = any_on(b,k);
k                2077 Zend/zend_strtod.c 		if (x[k>>kshift] & 1 << (k & kmask))
k                2100 Zend/zend_strtod.c 			k = b->wds;
k                2110 Zend/zend_strtod.c 			else if (b->wds > k
k                2112 Zend/zend_strtod.c 			     && hi0bits(x[k-1]) < 32-n)) {
k                2128 Zend/zend_strtod.c 		k = b->x[0] & ((1 << j) - 1);
k                2130 Zend/zend_strtod.c 		if (k) {
k                2142 Zend/zend_strtod.c 				if (k & j && ((k & (j-1)) | lostbits))
k                2540 Zend/zend_strtod.c 	int esign, i, j, k, nd, nd0, nf, nz, nz0, nz1, sign;
k                2762 Zend/zend_strtod.c 	k = nd < DBL_DIG + 2 ? nd : DBL_DIG + 2;
k                2764 Zend/zend_strtod.c 	if (k > 9) {
k                2766 Zend/zend_strtod.c 		if (k > DBL_DIG)
k                2769 Zend/zend_strtod.c 		dval(&rv) = tens[k - 9] * dval(&rv) + z;
k                2844 Zend/zend_strtod.c 	e1 += nd - k;
k                2849 Zend/zend_strtod.c 	if (k <= DBL_DIG)
k                3027 Zend/zend_strtod.c 		bd = Balloc(bd0->k);
k                3614 Zend/zend_strtod.c 	int j, k, *r;
k                3617 Zend/zend_strtod.c 	for(k = 0;
k                3620 Zend/zend_strtod.c 			k++;
k                3621 Zend/zend_strtod.c 	r = (int*)Balloc(k);
k                3622 Zend/zend_strtod.c 	*r = k;
k                3660 Zend/zend_strtod.c 	b->maxwds = 1 << (b->k = *(int*)b);
k                3746 Zend/zend_strtod.c 		j, j1, k, k0, k_check, leftright, m2, m5, s2, s5,
k                3890 Zend/zend_strtod.c 	k = (int)ds;
k                3891 Zend/zend_strtod.c 	if (ds < 0. && ds != k)
k                3892 Zend/zend_strtod.c 		k--;	/* want k = floor(ds) */
k                3894 Zend/zend_strtod.c 	if (k >= 0 && k <= Ten_pmax) {
k                3895 Zend/zend_strtod.c 		if (dval(&u) < tens[k])
k                3896 Zend/zend_strtod.c 			k--;
k                3908 Zend/zend_strtod.c 	if (k >= 0) {
k                3910 Zend/zend_strtod.c 		s5 = k;
k                3911 Zend/zend_strtod.c 		s2 += k;
k                3914 Zend/zend_strtod.c 		b2 -= k;
k                3915 Zend/zend_strtod.c 		b5 = -k;
k                3954 Zend/zend_strtod.c 			i = ndigits + k + 1;
k                3973 Zend/zend_strtod.c 		k0 = k;
k                3976 Zend/zend_strtod.c 		if (k > 0) {
k                3977 Zend/zend_strtod.c 			ds = tens[k&0xf];
k                3978 Zend/zend_strtod.c 			j = k >> 4;
k                3992 Zend/zend_strtod.c 		else if ((j1 = -k)) {
k                4004 Zend/zend_strtod.c 			k--;
k                4077 Zend/zend_strtod.c 		k = k0;
k                4083 Zend/zend_strtod.c 	if (be >= 0 && k <= Int_max) {
k                4085 Zend/zend_strtod.c 		ds = tens[k];
k                4127 Zend/zend_strtod.c 							k++;
k                4217 Zend/zend_strtod.c 			k--;
k                4228 Zend/zend_strtod.c 			k = -1 - ndigits;
k                4233 Zend/zend_strtod.c 		k++;
k                4246 Zend/zend_strtod.c 			mhi = Balloc(mhi->k);
k                4372 Zend/zend_strtod.c 				k++;
k                4406 Zend/zend_strtod.c 	*decpt = k + 1;
k                 392 ext/fileinfo/libmagic/cdf.c 	size_t i, j, k;
k                 444 ext/fileinfo/libmagic/cdf.c 		for (k = 0; k < nsatpersec; k++, i++) {
k                 445 ext/fileinfo/libmagic/cdf.c 			sec = CDF_TOLE4((uint32_t)msa[k]);
k                 457 ext/fileinfo/libmagic/cdf.c 				    CDF_TOLE4(msa[k])));
k                1042 ext/fileinfo/libmagic/cdf.c 	size_t nr, i, k;
k                1085 ext/fileinfo/libmagic/cdf.c 		for (k = 0; k < cep->ce_namlen; k++)
k                1086 ext/fileinfo/libmagic/cdf.c 			cep->ce_name[k] = np[k]; /* XXX: CDF_TOLE2? */
k                 185 ext/fileinfo/libmagic/readcdf.c                                 size_t j, k = 1;
k                 188 ext/fileinfo/libmagic/readcdf.c                                     k++;
k                 190 ext/fileinfo/libmagic/readcdf.c                                 for (j = 0; j < sizeof(vbuf) && len--; s += k) {
k                 556 ext/fileinfo/libmagic/readcdf.c 		size_t j, k;
k                 560 ext/fileinfo/libmagic/readcdf.c 			for (k = 0; k < sizeof(name); k++)
k                 561 ext/fileinfo/libmagic/readcdf.c 				name[k] = (char)cdf_tole2(d->d_name[k]);
k                1441 ext/gd/libgd/gd_interpolation.c 			long k;
k                1568 ext/gd/libgd/gd_interpolation.c 			for (k = -1; k < 3; k++) {
k                1569 ext/gd/libgd/gd_interpolation.c 				const gdFixed f = gd_itofx(k)-f_f;
k                1592 ext/gd/libgd/gd_interpolation.c 					const int _k = ((k+1)*4) + (l+1);
k                1941 ext/gd/libgd/gd_interpolation.c 				int k;
k                2065 ext/gd/libgd/gd_interpolation.c 				for (k=-1; k<3; k++) {
k                2066 ext/gd/libgd/gd_interpolation.c 					const gdFixed f = gd_itofx(k)-f_f;
k                2098 ext/gd/libgd/gd_interpolation.c 						const int _k = ((k + 1) * 4) + (l + 1);
k                 308 ext/gd/libgd/gd_jpeg.c static int CMYKToRGB(int c, int m, int y, int k, int inverted);
k                 499 ext/gd/libgd/gd_jpeg.c static int CMYKToRGB(int c, int m, int y, int k, int inverted)
k                 505 ext/gd/libgd/gd_jpeg.c 		k = 255 - k;
k                 507 ext/gd/libgd/gd_jpeg.c 	return gdTrueColor((255 - c) * (255 - k) / 255, (255 - m) * (255 - k) / 255, (255 - y) * (255 - k) / 255);
k                 602 ext/gd/libgd/gd_png.c 		int k;
k                 624 ext/gd/libgd/gd_png.c 			k = colors - 1;
k                 633 ext/gd/libgd/gd_png.c 						mapping[i] = k--;
k                  22 ext/gd/libgd/gdxpm.c 	int i, j, k, number;
k                 128 ext/gd/libgd/gdxpm.c 			k = *pointer++;
k                 129 ext/gd/libgd/gdxpm.c 			gdImageSetPixel(im, j, i, colors[k]);
k                 454 ext/hash/hash_md.c #define MD4_R1(a,b,c,d,k,s)		a = ROTL32(s, a + MD4_F(b,c,d) + x[k])
k                 455 ext/hash/hash_md.c #define MD4_R2(a,b,c,d,k,s)		a = ROTL32(s, a + MD4_G(b,c,d) + x[k] + 0x5A827999)
k                 456 ext/hash/hash_md.c #define MD4_R3(a,b,c,d,k,s)		a = ROTL32(s, a + MD4_H(b,c,d) + x[k] + 0x6ED9EBA1)
k                1653 ext/ldap/ldap.c 	int i, j, k;
k                1816 ext/ldap/ldap.c 					for (k = 0; k < num_modvals; k++) {
k                1817 ext/ldap/ldap.c 						if ((fetched = zend_hash_index_find(Z_ARRVAL_P(modinfo), k)) == NULL) {
k                 147 ext/mbstring/libmbfl/filters/mbfilter_big5.c 	int k;
k                 195 ext/mbstring/libmbfl/filters/mbfilter_big5.c 					for (k = 0; k < sizeof(cp950_pua_tbl)/(sizeof(unsigned short)*4); k++) {
k                 196 ext/mbstring/libmbfl/filters/mbfilter_big5.c 						if (c2 >= cp950_pua_tbl[k][2] && c2 <= cp950_pua_tbl[k][3]) {
k                 201 ext/mbstring/libmbfl/filters/mbfilter_big5.c 					if ((cp950_pua_tbl[k][2] & 0xff) == 0x40) {
k                 202 ext/mbstring/libmbfl/filters/mbfilter_big5.c 						w = 157*(c1 - (cp950_pua_tbl[k][2]>>8)) + c - (c >= 0xa1 ? 0x62 : 0x40)
k                 203 ext/mbstring/libmbfl/filters/mbfilter_big5.c 							+ cp950_pua_tbl[k][0];
k                 205 ext/mbstring/libmbfl/filters/mbfilter_big5.c 						w = c2 - cp950_pua_tbl[k][2] + cp950_pua_tbl[k][0];
k                 240 ext/mbstring/libmbfl/filters/mbfilter_big5.c 	int k;
k                 262 ext/mbstring/libmbfl/filters/mbfilter_big5.c 			for (k = 0; k < sizeof(cp950_pua_tbl)/(sizeof(unsigned short)*4); k++) {
k                 263 ext/mbstring/libmbfl/filters/mbfilter_big5.c 				if (c <= cp950_pua_tbl[k][1]) {
k                 267 ext/mbstring/libmbfl/filters/mbfilter_big5.c 			c1 = c - cp950_pua_tbl[k][0];
k                 268 ext/mbstring/libmbfl/filters/mbfilter_big5.c 			if ((cp950_pua_tbl[k][2] & 0xff) == 0x40) {
k                 269 ext/mbstring/libmbfl/filters/mbfilter_big5.c 				c2 = cp950_pua_tbl[k][2] >> 8;
k                 273 ext/mbstring/libmbfl/filters/mbfilter_big5.c 				s = c1 + cp950_pua_tbl[k][2];
k                 105 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 	int k;
k                 143 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 			for (k = 0; k < mbfl_cp936_pua_tbl_max; k++) {
k                 144 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 				if (c2 >= mbfl_cp936_pua_tbl[k][2] &&
k                 145 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 					c2 <= mbfl_cp936_pua_tbl[k][2] +
k                 146 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 					mbfl_cp936_pua_tbl[k][1] -  mbfl_cp936_pua_tbl[k][0]) {
k                 147 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 					w = c2 -  mbfl_cp936_pua_tbl[k][2] + mbfl_cp936_pua_tbl[k][0];
k                 193 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 	int k, k1, k2;
k                 231 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 				k = (k1 + k2) >> 1;
k                 232 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 				if (c < mbfl_cp936_pua_tbl[k][0]) {
k                 233 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 					k2 = k;
k                 234 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 				} else if (c > mbfl_cp936_pua_tbl[k][1]) {
k                 235 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 					k1 = k + 1;
k                 237 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 					s = c - mbfl_cp936_pua_tbl[k][0] + mbfl_cp936_pua_tbl[k][2];
k                  84 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k, k1 = 0, k2 = n-1;
k                  87 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		k = (k1+k2) >> 1;
k                  88 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		if (w <= tbl[2*k+1]) {
k                  89 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			k2 = k;
k                  90 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		} else if (w >= tbl[2*k+2]) {
k                  91 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			k1 = k + 1;
k                 102 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k, k1 = 0, k2 = n;
k                 109 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		k = (k1 + k2) >> 1;
k                 110 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		if (w < tbl[k]) {
k                 111 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			k2 = k;
k                 112 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		} else if (w > tbl[k]) {
k                 113 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			k1 = k;
k                 115 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			return k;
k                 127 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k;
k                 177 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			for (k = 0; k < mbfl_gb18030_pua_tbl_max; k++) {
k                 178 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 				if (c2 >= mbfl_gb18030_pua_tbl[k][2] &&
k                 179 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					c2 <= mbfl_gb18030_pua_tbl[k][2] +  mbfl_gb18030_pua_tbl[k][1]
k                 180 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					-  mbfl_gb18030_pua_tbl[k][0]) {
k                 181 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					w = c2 -  mbfl_gb18030_pua_tbl[k][2] + mbfl_gb18030_pua_tbl[k][0];
k                 246 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					k = mbfl_bisec_srch(w, mbfl_gb2uni_tbl, mbfl_gb_uni_max);
k                 247 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					if (k<0) {
k                 255 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					w += mbfl_gb_uni_ofst[k];
k                 287 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k, k1, k2;
k                 359 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 				k = (k1 + k2) >> 1;
k                 360 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 				if (c < mbfl_gb18030_pua_tbl[k][0]) {
k                 361 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					k2 = k;
k                 362 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 				} else if (c > mbfl_gb18030_pua_tbl[k][1]) {
k                 363 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					k1 = k + 1;
k                 365 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					s = c - mbfl_gb18030_pua_tbl[k][0] + mbfl_gb18030_pua_tbl[k][2];
k                 136 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 	int k;
k                 227 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				k = mbfl_bisec_srch2(w1, jisx0213_u2_key, jisx0213_u2_tbl_len);
k                 228 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				if (k >= 0) {
k                 229 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 					w = jisx0213_u2_tbl[2*k];
k                 231 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 					w = jisx0213_u2_tbl[2*k+1];
k                 246 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				k = mbfl_bisec_srch2(w1, jisx0213_jis_u5_key, jisx0213_u5_tbl_len);
k                 247 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				if (k >= 0) {
k                 248 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 					w = jisx0213_jis_u5_tbl[k] + 0x20000;
k                 332 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			for (k = 0; k < jisx0213_p2_ofst_len; k++) {
k                 333 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				if (s1 == jisx0213_p2_ofst[k]-1) {
k                 337 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			k = k - (jisx0213_p2_ofst[k]-1);
k                 340 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			s = (s1 + 94 + k)*94 + s2;
k                 349 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				w1 = ((c1 + k + 94) << 8) | c2;
k                 350 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				k = mbfl_bisec_srch2(w1, jisx0213_jis_u5_key, jisx0213_u5_tbl_len);
k                 351 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				if (k >= 0) {
k                 352 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 					w = jisx0213_jis_u5_tbl[k] + 0x20000;
k                 486 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 	int k;
k                 498 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		for (k=0;k<jisx0213_u2_tbl_len;k++) {
k                 499 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			if (c == jisx0213_u2_tbl[2*k]) {
k                 501 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				filter->cache = k;
k                 510 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		k = filter->cache;
k                 514 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		c1 = jisx0213_u2_tbl[2*k];
k                 517 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			k++;
k                 519 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		if (c == jisx0213_u2_tbl[2*k+1]) {
k                 520 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			s1 = jisx0213_u2_key[k];
k                 522 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			s1 = jisx0213_u2_fb_tbl[k];
k                 552 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		for (k=0; k < uni2jis_tbl_len ;k++) {
k                 553 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			if (c >= uni2jis_tbl_range[k][0] && c <= uni2jis_tbl_range[k][1]) {
k                 554 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				s1 = uni2jis_tbl[k][c-uni2jis_tbl_range[k][0]];
k                 562 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		k = mbfl_bisec_srch(c, ucs_c1_jisx0213_tbl, ucs_c1_jisx0213_tbl_len);
k                 563 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		if (k >= 0) {
k                 564 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			s1 = ucs_c1_jisx0213_ofst[k] + c - ucs_c1_jisx0213_tbl[2*k];
k                 570 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		k = mbfl_bisec_srch2(c - 0x20000, jisx0213_u5_jis_key, jisx0213_u5_tbl_len);
k                 571 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		if (k >= 0) {
k                 572 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			s1 = jisx0213_u5_jis_tbl[k];
k                 584 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			k = mbfl_bisec_srch2(c, ucs_r2b_jisx0213_cmap_key, ucs_r2b_jisx0213_cmap_len);
k                 585 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 			if (k >= 0) {
k                 586 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				s1 = ucs_r2b_jisx0213_cmap_val[k];
k                 648 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				k = ((s1 >> 8) & 0xff) - 0x7f;
k                 649 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 				if (k >= 0 && k < jisx0213_p2_ofst_len) {
k                 650 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 					s1  = jisx0213_p2_ofst[k] - 1 + 0x21;
k                 680 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 	int k, c1, c2, s1, s2;
k                 682 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 	k = filter->cache;
k                 685 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 	if (filter->status == 1 && k >= 0 && k <= jisx0213_u2_tbl_len) {
k                 686 ext/mbstring/libmbfl/filters/mbfilter_sjis_2004.c 		s1 = jisx0213_u2_fb_tbl[k];
k                 813 ext/mbstring/libmbfl/mbfl/mbfilter.c 	int len, n, m, k;
k                 834 ext/mbstring/libmbfl/mbfl/mbfilter.c 		k = string->len;
k                 837 ext/mbstring/libmbfl/mbfl/mbfilter.c 			while (n < k) {
k                 937 ext/mbstring/libmbfl/mbfl/mbfilter.c 	int len, n, m, k;
k                 962 ext/mbstring/libmbfl/mbfl/mbfilter.c 		k = string->len;
k                 965 ext/mbstring/libmbfl/mbfl/mbfilter.c 			while (n < k) {
k                 971 ext/mbstring/libmbfl/mbfl/mbfilter.c 		return n-k;
k                1308 ext/mbstring/libmbfl/mbfl/mbfilter.c 	int n, m, k, len, start, end;
k                1336 ext/mbstring/libmbfl/mbfl/mbfilter.c 			k = 0;
k                1340 ext/mbstring/libmbfl/mbfl/mbfilter.c 				while (k <= from) {
k                1348 ext/mbstring/libmbfl/mbfl/mbfilter.c 					k++;
k                1351 ext/mbstring/libmbfl/mbfl/mbfilter.c 				k = 0;
k                1353 ext/mbstring/libmbfl/mbfl/mbfilter.c 				while (k < length) {
k                1361 ext/mbstring/libmbfl/mbfl/mbfilter.c 					k++;
k                 115 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c static int utf32_utf8(char *buf, int k)
k                 119 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 	if (k < 0x80) {
k                 120 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[0] = k;
k                 122 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 	} else if (k < 0x800) {
k                 123 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[0] = 0xc0 | (k >> 6);
k                 124 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[1] = 0x80 | (k & 0x3f);
k                 126 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 	} else if (k < 0x10000) {
k                 127 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[0] = 0xe0 | (k >> 12);
k                 128 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[1] = 0x80 | ((k >> 6) & 0x3f);
k                 129 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[2] = 0x80 | (k & 0x3f);
k                 131 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 	} else if (k < 0x200000) {
k                 132 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[0] = 0xf0 | (k >> 18);
k                 133 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[1] = 0x80 | ((k >> 12) & 0x3f);
k                 134 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[2] = 0x80 | ((k >> 6) & 0x3f);
k                 135 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[3] = 0x80 | (k & 0x3f);
k                 137 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 	} else if (k < 0x4000000) {
k                 138 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[0] = 0xf8 | (k >> 24);
k                 139 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[1] = 0x80 | ((k >> 18) & 0x3f);
k                 140 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[2] = 0x80 | ((k >> 12) & 0x3f);
k                 141 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[3] = 0x80 | ((k >> 6) & 0x3f);
k                 142 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[4] = 0x80 | (k & 0x3f);
k                 145 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[0] = 0xfc | (k >> 30);
k                 146 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[1] = 0x80 | ((k >> 24) & 0x3f);
k                 147 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[2] = 0x80 | ((k >> 18) & 0x3f);
k                 148 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[3] = 0x80 | ((k >> 12) & 0x3f);
k                 149 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[4] = 0x80 | ((k >> 6) & 0x3f);
k                 150 ext/mbstring/libmbfl/tests/conv_encoding.tests/gen_exp.c 		buf[5] = 0x80 | (k & 0x3f);
k                11037 ext/mbstring/oniguruma/enc/unicode.c   int i, j, k, r;
k                11053 ext/mbstring/oniguruma/enc/unicode.c       for (k = 0; k < j; k++) {
k                11054 ext/mbstring/oniguruma/enc/unicode.c 	r = (*f)(p11->to.code[j], (OnigCodePoint* )(&p11->to.code[k]), 1, arg);
k                11057 ext/mbstring/oniguruma/enc/unicode.c 	r = (*f)(p11->to.code[k], (OnigCodePoint* )(&p11->to.code[j]), 1, arg);
k                11094 ext/mbstring/oniguruma/enc/unicode.c 	for (k = 0; k < j; k++) {
k                11095 ext/mbstring/oniguruma/enc/unicode.c 	  r = (*f)(p11->to.code[j], (OnigCodePoint* )(&p11->to.code[k]),
k                11099 ext/mbstring/oniguruma/enc/unicode.c 	  r = (*f)(p11->to.code[k], (OnigCodePoint* )(&p11->to.code[j]),
k                11117 ext/mbstring/oniguruma/enc/unicode.c 	for (k = 0; k < CaseUnfold_12[i].to.n; k++) {
k                11118 ext/mbstring/oniguruma/enc/unicode.c 	  if (k == j) continue;
k                11121 ext/mbstring/oniguruma/enc/unicode.c 		   (OnigCodePoint* )(&CaseUnfold_12[i].to.code[k]), 1, arg);
k                11138 ext/mbstring/oniguruma/enc/unicode.c 	  for (k = 0; k < CaseUnfold_12_Locale[i].to.n; k++) {
k                11139 ext/mbstring/oniguruma/enc/unicode.c 	    if (k == j) continue;
k                11142 ext/mbstring/oniguruma/enc/unicode.c 		     (OnigCodePoint* )(&CaseUnfold_12_Locale[i].to.code[k]),
k                11159 ext/mbstring/oniguruma/enc/unicode.c 	for (k = 0; k < CaseUnfold_13[i].to.n; k++) {
k                11160 ext/mbstring/oniguruma/enc/unicode.c 	  if (k == j) continue;
k                11163 ext/mbstring/oniguruma/enc/unicode.c 		   (OnigCodePoint* )(&CaseUnfold_13[i].to.code[k]), 1, arg);
k                11178 ext/mbstring/oniguruma/enc/unicode.c   int n, i, j, k, len;
k                11283 ext/mbstring/oniguruma/enc/unicode.c 	    for (k = 0; k < ncs[2]; k++) {
k                11288 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code[2]  = cs[2][k];
k                 614 ext/mbstring/oniguruma/regexec.c #define STACK_GET_MEM_START(mnum, k) do {\
k                 616 ext/mbstring/oniguruma/regexec.c   k = stk;\
k                 617 ext/mbstring/oniguruma/regexec.c   while (k > stk_base) {\
k                 618 ext/mbstring/oniguruma/regexec.c     k--;\
k                 619 ext/mbstring/oniguruma/regexec.c     if ((k->type & STK_MASK_MEM_END_OR_MARK) != 0 \
k                 620 ext/mbstring/oniguruma/regexec.c       && k->u.mem.num == (mnum)) {\
k                 623 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_MEM_START && k->u.mem.num == (mnum)) {\
k                 630 ext/mbstring/oniguruma/regexec.c #define STACK_GET_MEM_RANGE(k, mnum, start, end) do {\
k                 632 ext/mbstring/oniguruma/regexec.c   while (k < stk) {\
k                 633 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_MEM_START && k->u.mem.num == (mnum)) {\
k                 634 ext/mbstring/oniguruma/regexec.c       if (level == 0) (start) = k->u.mem.pstr;\
k                 637 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_MEM_END && k->u.mem.num == (mnum)) {\
k                 640 ext/mbstring/oniguruma/regexec.c         (end) = k->u.mem.pstr;\
k                 644 ext/mbstring/oniguruma/regexec.c     k++;\
k                 776 ext/mbstring/oniguruma/regexec.c #define STACK_POS_END(k) do {\
k                 777 ext/mbstring/oniguruma/regexec.c   k = stk;\
k                 779 ext/mbstring/oniguruma/regexec.c     k--;\
k                 780 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_POS_END"); \
k                 781 ext/mbstring/oniguruma/regexec.c     if (IS_TO_VOID_TARGET(k)) {\
k                 782 ext/mbstring/oniguruma/regexec.c       k->type = STK_VOID;\
k                 784 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_POS) {\
k                 785 ext/mbstring/oniguruma/regexec.c       k->type = STK_VOID;\
k                 792 ext/mbstring/oniguruma/regexec.c   OnigStackType *k = stk;\
k                 794 ext/mbstring/oniguruma/regexec.c     k--;\
k                 795 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_STOP_BT_END"); \
k                 796 ext/mbstring/oniguruma/regexec.c     if (IS_TO_VOID_TARGET(k)) {\
k                 797 ext/mbstring/oniguruma/regexec.c       k->type = STK_VOID;\
k                 799 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_STOP_BT) {\
k                 800 ext/mbstring/oniguruma/regexec.c       k->type = STK_VOID;\
k                 807 ext/mbstring/oniguruma/regexec.c   OnigStackType* k = stk;\
k                 809 ext/mbstring/oniguruma/regexec.c     k--;\
k                 810 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_NULL_CHECK"); \
k                 811 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_NULL_CHECK_START) {\
k                 812 ext/mbstring/oniguruma/regexec.c       if (k->u.null_check.num == (id)) {\
k                 813 ext/mbstring/oniguruma/regexec.c         (isnull) = (k->u.null_check.pstr == (s));\
k                 822 ext/mbstring/oniguruma/regexec.c   OnigStackType* k = stk;\
k                 824 ext/mbstring/oniguruma/regexec.c     k--;\
k                 825 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_NULL_CHECK_REC"); \
k                 826 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_NULL_CHECK_START) {\
k                 827 ext/mbstring/oniguruma/regexec.c       if (k->u.null_check.num == (id)) {\
k                 829 ext/mbstring/oniguruma/regexec.c           (isnull) = (k->u.null_check.pstr == (s));\
k                 835 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_NULL_CHECK_END) {\
k                 842 ext/mbstring/oniguruma/regexec.c   OnigStackType* k = stk;\
k                 844 ext/mbstring/oniguruma/regexec.c     k--;\
k                 845 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_NULL_CHECK_MEMST"); \
k                 846 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_NULL_CHECK_START) {\
k                 847 ext/mbstring/oniguruma/regexec.c       if (k->u.null_check.num == (id)) {\
k                 848 ext/mbstring/oniguruma/regexec.c         if (k->u.null_check.pstr != (s)) {\
k                 855 ext/mbstring/oniguruma/regexec.c           while (k < stk) {\
k                 856 ext/mbstring/oniguruma/regexec.c             if (k->type == STK_MEM_START) {\
k                 857 ext/mbstring/oniguruma/regexec.c               if (k->u.mem.end == INVALID_STACK_INDEX) {\
k                 860 ext/mbstring/oniguruma/regexec.c               if (BIT_STATUS_AT(reg->bt_mem_end, k->u.mem.num))\
k                 861 ext/mbstring/oniguruma/regexec.c                 endp = STACK_AT(k->u.mem.end)->u.mem.pstr;\
k                 863 ext/mbstring/oniguruma/regexec.c                 endp = (UChar* )k->u.mem.end;\
k                 864 ext/mbstring/oniguruma/regexec.c               if (STACK_AT(k->u.mem.start)->u.mem.pstr != endp) {\
k                 871 ext/mbstring/oniguruma/regexec.c             k++;\
k                 882 ext/mbstring/oniguruma/regexec.c   OnigStackType* k = stk;\
k                 884 ext/mbstring/oniguruma/regexec.c     k--;\
k                 885 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_NULL_CHECK_MEMST_REC"); \
k                 886 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_NULL_CHECK_START) {\
k                 887 ext/mbstring/oniguruma/regexec.c       if (k->u.null_check.num == (id)) {\
k                 889 ext/mbstring/oniguruma/regexec.c           if (k->u.null_check.pstr != (s)) {\
k                 896 ext/mbstring/oniguruma/regexec.c             while (k < stk) {\
k                 897 ext/mbstring/oniguruma/regexec.c               if (k->type == STK_MEM_START) {\
k                 898 ext/mbstring/oniguruma/regexec.c                 if (k->u.mem.end == INVALID_STACK_INDEX) {\
k                 901 ext/mbstring/oniguruma/regexec.c                 if (BIT_STATUS_AT(reg->bt_mem_end, k->u.mem.num))\
k                 902 ext/mbstring/oniguruma/regexec.c                   endp = STACK_AT(k->u.mem.end)->u.mem.pstr;\
k                 904 ext/mbstring/oniguruma/regexec.c                   endp = (UChar* )k->u.mem.end;\
k                 905 ext/mbstring/oniguruma/regexec.c                 if (STACK_AT(k->u.mem.start)->u.mem.pstr != endp) {\
k                 912 ext/mbstring/oniguruma/regexec.c               k++;\
k                 922 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_NULL_CHECK_END) {\
k                 923 ext/mbstring/oniguruma/regexec.c       if (k->u.null_check.num == (id)) level++;\
k                 928 ext/mbstring/oniguruma/regexec.c #define STACK_GET_REPEAT(id, k) do {\
k                 930 ext/mbstring/oniguruma/regexec.c   k = stk;\
k                 932 ext/mbstring/oniguruma/regexec.c     k--;\
k                 933 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_GET_REPEAT"); \
k                 934 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_REPEAT) {\
k                 936 ext/mbstring/oniguruma/regexec.c         if (k->u.repeat.num == (id)) {\
k                 941 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_CALL_FRAME) level--;\
k                 942 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_RETURN)     level++;\
k                 948 ext/mbstring/oniguruma/regexec.c   OnigStackType* k = stk;\
k                 950 ext/mbstring/oniguruma/regexec.c     k--;\
k                 951 ext/mbstring/oniguruma/regexec.c     STACK_BASE_CHECK(k, "STACK_RETURN"); \
k                 952 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_CALL_FRAME) {\
k                 954 ext/mbstring/oniguruma/regexec.c         (addr) = k->u.call_frame.ret_addr;\
k                 959 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_RETURN)\
k                1042 ext/mbstring/oniguruma/regexec.c   OnigStackType* k = *kp;
k                1044 ext/mbstring/oniguruma/regexec.c   while (k < stk_top) {
k                1045 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_MEM_START) {
k                1046 ext/mbstring/oniguruma/regexec.c       n = k->u.mem.num;
k                1052 ext/mbstring/oniguruma/regexec.c         child->beg = (int )(k->u.mem.pstr - str);
k                1055 ext/mbstring/oniguruma/regexec.c         *kp = (k + 1);
k                1059 ext/mbstring/oniguruma/regexec.c         k = *kp;
k                1060 ext/mbstring/oniguruma/regexec.c         child->end = (int )(k->u.mem.pstr - str);
k                1063 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_MEM_END) {
k                1064 ext/mbstring/oniguruma/regexec.c       if (k->u.mem.num == node->group) {
k                1065 ext/mbstring/oniguruma/regexec.c         node->end = (int )(k->u.mem.pstr - str);
k                1066 ext/mbstring/oniguruma/regexec.c         *kp = k;
k                1070 ext/mbstring/oniguruma/regexec.c     k++;
k                1097 ext/mbstring/oniguruma/regexec.c   OnigStackType* k;
k                1100 ext/mbstring/oniguruma/regexec.c   k = top;
k                1101 ext/mbstring/oniguruma/regexec.c   k--;
k                1102 ext/mbstring/oniguruma/regexec.c   while (k >= stk_base) {
k                1103 ext/mbstring/oniguruma/regexec.c     if (k->type == STK_CALL_FRAME) {
k                1106 ext/mbstring/oniguruma/regexec.c     else if (k->type == STK_RETURN) {
k                1110 ext/mbstring/oniguruma/regexec.c       if (k->type == STK_MEM_START) {
k                1111 ext/mbstring/oniguruma/regexec.c 	if (mem_is_in_memp(k->u.mem.num, mem_num, memp)) {
k                1112 ext/mbstring/oniguruma/regexec.c 	  pstart = k->u.mem.pstr;
k                1134 ext/mbstring/oniguruma/regexec.c       else if (k->type == STK_MEM_END) {
k                1135 ext/mbstring/oniguruma/regexec.c 	if (mem_is_in_memp(k->u.mem.num, mem_num, memp)) {
k                1136 ext/mbstring/oniguruma/regexec.c 	  pend = k->u.mem.pstr;
k                1140 ext/mbstring/oniguruma/regexec.c     k--;
k                 227 ext/mbstring/ucgendat/ucgendat.c     int i, j, k, len;
k                 231 ext/mbstring/ucgendat/ucgendat.c     for (k = 0; k < 2; k++) {
k                 232 ext/mbstring/ucgendat/ucgendat.c         if (k == 0) {
k                1305 ext/mbstring/ucgendat/ucgendat.c     int j, k;
k                1388 ext/mbstring/ucgendat/ucgendat.c     k = 0;
k                1392 ext/mbstring/ucgendat/ucgendat.c 	    if (k) fprintf(out, ",");
k                1393 ext/mbstring/ucgendat/ucgendat.c 	    if (!(k&3)) fprintf(out,"\n\t");
k                1395 ext/mbstring/ucgendat/ucgendat.c 	    k++;
k                1614 ext/mbstring/ucgendat/ucgendat.c 	k = 0;
k                1617 ext/mbstring/ucgendat/ucgendat.c 	    if (k) fprintf(out, ",");
k                1618 ext/mbstring/ucgendat/ucgendat.c 	    if (!(k&3)) fprintf(out,"\n\t");
k                1620 ext/mbstring/ucgendat/ucgendat.c 	    k++;
k                1707 ext/mbstring/ucgendat/ucgendat.c 	k = 0;
k                1710 ext/mbstring/ucgendat/ucgendat.c 	    if (k) fprintf(out, ",");
k                1711 ext/mbstring/ucgendat/ucgendat.c 	    if (!(k&3)) fprintf(out,"\n\t");
k                1713 ext/mbstring/ucgendat/ucgendat.c 	    k++;
k                 208 ext/mysqlnd/mysqlnd.h #define mysqlnd_options4(conn, opt, k, v)	((conn)->data)->m->set_client_option_2d((conn)->data, (opt), (k), (v))
k                 110 ext/mysqlnd/mysqlnd_libmysql_compat.h #define mysql_options4(c,a,k,v)			mysqlnd_options4((c), (a), (k), (v))
k                21996 ext/sqlite3/libsqlite/sqlite3.c         int i, j, k, n, isnull;
k                22009 ext/sqlite3/libsqlite/sqlite3.c         k = precision;
k                22010 ext/sqlite3/libsqlite/sqlite3.c         for(i=n=0; k!=0 && (ch=escarg[i])!=0; i++, k--){
k                22026 ext/sqlite3/libsqlite/sqlite3.c         k = i;
k                22027 ext/sqlite3/libsqlite/sqlite3.c         for(i=0; i<k; i++){
k                22050 ext/sqlite3/libsqlite/sqlite3.c         int k = va_arg(ap, int);
k                22051 ext/sqlite3/libsqlite/sqlite3.c         struct SrcList_item *pItem = &pSrc->a[k];
k                22053 ext/sqlite3/libsqlite/sqlite3.c         assert( k>=0 && k<pSrc->nSrc );
k                22573 ext/sqlite3/libsqlite/sqlite3.c     char k[256];
k                22576 ext/sqlite3/libsqlite/sqlite3.c     sqlite3OsRandomness(sqlite3_vfs_find(0), 256, k);
k                22581 ext/sqlite3/libsqlite/sqlite3.c       wsdPrng.j += wsdPrng.s[i] + k[i];
k                24031 ext/sqlite3/libsqlite/sqlite3.c     int i, k;
k                24033 ext/sqlite3/libsqlite/sqlite3.c     for(k=i; sqlite3Isxdigit(z[k]); k++){
k                24034 ext/sqlite3/libsqlite/sqlite3.c       u = u*16 + sqlite3HexToInt(z[k]);
k                24037 ext/sqlite3/libsqlite/sqlite3.c     return (z[k]==0 && k-i<=16) ? 0 : 1;
k                54021 ext/sqlite3/libsqlite/sqlite3.c     int k;
k                54022 ext/sqlite3/libsqlite/sqlite3.c     k = pPage->aiOvfl[i];
k                54023 ext/sqlite3/libsqlite/sqlite3.c     if( k<=iCell ){
k                54024 ext/sqlite3/libsqlite/sqlite3.c       if( k==iCell ){
k                58321 ext/sqlite3/libsqlite/sqlite3.c   u32 k;     /* Number of leaves on the trunk of the freelist */
k                58402 ext/sqlite3/libsqlite/sqlite3.c       k = get4byte(&pTrunk->aData[4]);
k                58403 ext/sqlite3/libsqlite/sqlite3.c       if( k==0 && !searchList ){
k                58417 ext/sqlite3/libsqlite/sqlite3.c       }else if( k>(u32)(pBt->usableSize/4 - 2) ){
k                58435 ext/sqlite3/libsqlite/sqlite3.c         if( k==0 ){
k                58467 ext/sqlite3/libsqlite/sqlite3.c           put4byte(&pNewTrunk->aData[4], k-1);
k                58468 ext/sqlite3/libsqlite/sqlite3.c           memcpy(&pNewTrunk->aData[8], &pTrunk->aData[12], (k-1)*4);
k                58484 ext/sqlite3/libsqlite/sqlite3.c       }else if( k>0 ){
k                58493 ext/sqlite3/libsqlite/sqlite3.c             for(i=0; i<k; i++){
k                58503 ext/sqlite3/libsqlite/sqlite3.c             for(i=1; i<k; i++){
k                58529 ext/sqlite3/libsqlite/sqlite3.c                  *pPgno, closest+1, k, pTrunk->pgno, n-1));
k                58532 ext/sqlite3/libsqlite/sqlite3.c           if( closest<k-1 ){
k                58533 ext/sqlite3/libsqlite/sqlite3.c             memcpy(&aData[8+closest*4], &aData[4+k*4], 4);
k                58535 ext/sqlite3/libsqlite/sqlite3.c           put4byte(&aData[4], k-1);
k                59725 ext/sqlite3/libsqlite/sqlite3.c   int i, j, k;                 /* Loop counters */
k                59970 ext/sqlite3/libsqlite/sqlite3.c   for(subtotal=k=i=0; i<nCell; i++){
k                59974 ext/sqlite3/libsqlite/sqlite3.c       szNew[k] = subtotal - szCell[i] - 2;
k                59975 ext/sqlite3/libsqlite/sqlite3.c       cntNew[k] = i;
k                59978 ext/sqlite3/libsqlite/sqlite3.c       k++;
k                59979 ext/sqlite3/libsqlite/sqlite3.c       if( k>NB+1 ){ rc = SQLITE_CORRUPT_BKPT; goto balance_cleanup; }
k                59982 ext/sqlite3/libsqlite/sqlite3.c   szNew[k] = subtotal;
k                59983 ext/sqlite3/libsqlite/sqlite3.c   cntNew[k] = nCell;
k                59984 ext/sqlite3/libsqlite/sqlite3.c   k++;
k                59997 ext/sqlite3/libsqlite/sqlite3.c   for(i=k-1; i>0; i--){
k                60042 ext/sqlite3/libsqlite/sqlite3.c   for(i=0; i<k; i++){
k                71158 ext/sqlite3/libsqlite/sqlite3.c     int j, k;
k                71172 ext/sqlite3/libsqlite/sqlite3.c     k = 2;
k                71173 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_snprintf(100, &zBuf[k], "%d", pMem->n);
k                71174 ext/sqlite3/libsqlite/sqlite3.c     k += sqlite3Strlen30(&zBuf[k]);
k                71175 ext/sqlite3/libsqlite/sqlite3.c     zBuf[k++] = '[';
k                71179 ext/sqlite3/libsqlite/sqlite3.c         zBuf[k++] = c;
k                71181 ext/sqlite3/libsqlite/sqlite3.c         zBuf[k++] = '.';
k                71184 ext/sqlite3/libsqlite/sqlite3.c     zBuf[k++] = ']';
k                71185 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_snprintf(100,&zBuf[k], encnames[pMem->enc]);
k                71186 ext/sqlite3/libsqlite/sqlite3.c     k += sqlite3Strlen30(&zBuf[k]);
k                71187 ext/sqlite3/libsqlite/sqlite3.c     zBuf[k++] = 0;
k                72886 ext/sqlite3/libsqlite/sqlite3.c     int k, mx = 0;
k                72887 ext/sqlite3/libsqlite/sqlite3.c     for(k=0; k<n; k++) if( aPermute[k]>mx ) mx = aPermute[k];
k                81442 ext/sqlite3/libsqlite/sqlite3.c     int k;
k                81443 ext/sqlite3/libsqlite/sqlite3.c     for(k=0; k<pUsing->nId; k++){
k                81444 ext/sqlite3/libsqlite/sqlite3.c       if( sqlite3StrICmp(pUsing->a[k].zName, zCol)==0 ) return 1;
k                87022 ext/sqlite3/libsqlite/sqlite3.c             int k;
k                87024 ext/sqlite3/libsqlite/sqlite3.c             for(k=0; k<pAggInfo->nColumn; k++, pCol++){
k                87030 ext/sqlite3/libsqlite/sqlite3.c             if( (k>=pAggInfo->nColumn)
k                87031 ext/sqlite3/libsqlite/sqlite3.c              && (k = addAggInfoColumn(pParse->db, pAggInfo))>=0 
k                87033 ext/sqlite3/libsqlite/sqlite3.c               pCol = &pAggInfo->aCol[k];
k                87066 ext/sqlite3/libsqlite/sqlite3.c             pExpr->iAgg = (i16)k;
k                89246 ext/sqlite3/libsqlite/sqlite3.c       int j, k, regKey;
k                89249 ext/sqlite3/libsqlite/sqlite3.c         k = sqlite3ColumnOfIndex(pIdx, pPk->aiColumn[j]);
k                89250 ext/sqlite3/libsqlite/sqlite3.c         sqlite3VdbeAddOp3(v, OP_Column, iIdxCur, k, regKey+j);
k                89356 ext/sqlite3/libsqlite/sqlite3.c   HashElem *k;
k                89368 ext/sqlite3/libsqlite/sqlite3.c   for(k=sqliteHashFirst(&pSchema->tblHash); k; k=sqliteHashNext(k)){
k                89369 ext/sqlite3/libsqlite/sqlite3.c     Table *pTab = (Table*)sqliteHashData(k);
k                92327 ext/sqlite3/libsqlite/sqlite3.c   int i, k, n;
k                92352 ext/sqlite3/libsqlite/sqlite3.c   k = sqlite3Strlen30(zStmt);
k                92353 ext/sqlite3/libsqlite/sqlite3.c   identPut(zStmt, &k, p->zName);
k                92354 ext/sqlite3/libsqlite/sqlite3.c   zStmt[k++] = '(';
k                92366 ext/sqlite3/libsqlite/sqlite3.c     sqlite3_snprintf(n-k, &zStmt[k], zSep);
k                92367 ext/sqlite3/libsqlite/sqlite3.c     k += sqlite3Strlen30(&zStmt[k]);
k                92369 ext/sqlite3/libsqlite/sqlite3.c     identPut(zStmt, &k, pCol->zName);
k                92382 ext/sqlite3/libsqlite/sqlite3.c     memcpy(&zStmt[k], zType, len);
k                92383 ext/sqlite3/libsqlite/sqlite3.c     k += len;
k                92384 ext/sqlite3/libsqlite/sqlite3.c     assert( k<=n );
k                92386 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_snprintf(n-k, &zStmt[k], "%s", zEnd);
k                93960 ext/sqlite3/libsqlite/sqlite3.c       int k;
k                93966 ext/sqlite3/libsqlite/sqlite3.c       for(k=0; k<pIdx->nKeyCol; k++){
k                93969 ext/sqlite3/libsqlite/sqlite3.c         if( pIdx->aiColumn[k]!=pIndex->aiColumn[k] ) break;
k                93970 ext/sqlite3/libsqlite/sqlite3.c         z1 = pIdx->azColl[k];
k                93971 ext/sqlite3/libsqlite/sqlite3.c         z2 = pIndex->azColl[k];
k                93974 ext/sqlite3/libsqlite/sqlite3.c       if( k==pIdx->nKeyCol ){
k                94915 ext/sqlite3/libsqlite/sqlite3.c   HashElem *k;                /* For looping over tables in pDb */
k                94921 ext/sqlite3/libsqlite/sqlite3.c     for(k=sqliteHashFirst(&pDb->pSchema->tblHash);  k; k=sqliteHashNext(k)){
k                94922 ext/sqlite3/libsqlite/sqlite3.c       pTab = (Table*)sqliteHashData(k);
k                104602 ext/sqlite3/libsqlite/sqlite3.c       int i, k;
k                104632 ext/sqlite3/libsqlite/sqlite3.c           k = 0;
k                104634 ext/sqlite3/libsqlite/sqlite3.c           k = 1;
k                104636 ext/sqlite3/libsqlite/sqlite3.c           for(k=1; k<=pTab->nCol && pPk->aiColumn[k-1]!=i; k++){}
k                104638 ext/sqlite3/libsqlite/sqlite3.c         sqlite3VdbeAddOp2(v, OP_Integer, k, 6);
k                104844 ext/sqlite3/libsqlite/sqlite3.c     HashElem *k;           /* Loop counter:  Next table in schema */
k                104864 ext/sqlite3/libsqlite/sqlite3.c     k = sqliteHashFirst(&db->aDb[iDb].pSchema->tblHash);
k                104865 ext/sqlite3/libsqlite/sqlite3.c     while( k ){
k                104868 ext/sqlite3/libsqlite/sqlite3.c         k = 0;
k                104870 ext/sqlite3/libsqlite/sqlite3.c         pTab = (Table*)sqliteHashData(k);
k                104871 ext/sqlite3/libsqlite/sqlite3.c         k = sqliteHashNext(k);
k                104893 ext/sqlite3/libsqlite/sqlite3.c           k = 0;
k                108111 ext/sqlite3/libsqlite/sqlite3.c         int k;
k                108112 ext/sqlite3/libsqlite/sqlite3.c         for(k=nName-1; k>1 && sqlite3Isdigit(zName[k]); k--){}
k                108113 ext/sqlite3/libsqlite/sqlite3.c         if( k>=0 && zName[k]==':' ) nName = k;
k                110584 ext/sqlite3/libsqlite/sqlite3.c   int i, j, k;
k                110694 ext/sqlite3/libsqlite/sqlite3.c   for(k=0; k<pEList->nExpr; k++){
k                110695 ext/sqlite3/libsqlite/sqlite3.c     pE = pEList->a[k].pExpr;
k                110701 ext/sqlite3/libsqlite/sqlite3.c   if( k<pEList->nExpr ){
k                110720 ext/sqlite3/libsqlite/sqlite3.c     for(k=0; k<pEList->nExpr; k++){
k                110721 ext/sqlite3/libsqlite/sqlite3.c       pE = a[k].pExpr;
k                110727 ext/sqlite3/libsqlite/sqlite3.c         pNew = sqlite3ExprListAppend(pParse, pNew, a[k].pExpr);
k                110729 ext/sqlite3/libsqlite/sqlite3.c           pNew->a[pNew->nExpr-1].zName = a[k].zName;
k                110730 ext/sqlite3/libsqlite/sqlite3.c           pNew->a[pNew->nExpr-1].zSpan = a[k].zSpan;
k                110731 ext/sqlite3/libsqlite/sqlite3.c           a[k].zName = 0;
k                110732 ext/sqlite3/libsqlite/sqlite3.c           a[k].zSpan = 0;
k                110734 ext/sqlite3/libsqlite/sqlite3.c         a[k].pExpr = 0;
k                111516 ext/sqlite3/libsqlite/sqlite3.c       int k;                        /* Loop counter */
k                111519 ext/sqlite3/libsqlite/sqlite3.c       for(k=p->pEList->nExpr, pItem=p->pEList->a; k>0; k--, pItem++){
k                111522 ext/sqlite3/libsqlite/sqlite3.c       for(k=pGroupBy->nExpr, pItem=pGroupBy->a; k>0; k--, pItem++){
k                116017 ext/sqlite3/libsqlite/sqlite3.c   int k;                     /* Resume scanning at this->pWC->a[this->k] */
k                116618 ext/sqlite3/libsqlite/sqlite3.c   int k = pScan->k;    /* Where to start scanning */
k                116624 ext/sqlite3/libsqlite/sqlite3.c       for(pTerm=pWC->a+k; k<pWC->nTerm; k++, pTerm++){
k                116671 ext/sqlite3/libsqlite/sqlite3.c             pScan->k = k+1;
k                116677 ext/sqlite3/libsqlite/sqlite3.c       k = 0;
k                116680 ext/sqlite3/libsqlite/sqlite3.c     k = 0;
k                116726 ext/sqlite3/libsqlite/sqlite3.c   pScan->k = 0;
k                119422 ext/sqlite3/libsqlite/sqlite3.c   int j, k;            /* Loop counters */
k                119896 ext/sqlite3/libsqlite/sqlite3.c         k = sqlite3ColumnOfIndex(pIdx, pPk->aiColumn[j]);
k                119897 ext/sqlite3/libsqlite/sqlite3.c         sqlite3VdbeAddOp3(v, OP_Column, iIdxCur, k, iRowidReg+j);
k                120006 ext/sqlite3/libsqlite/sqlite3.c       for(k=1; k<=nNotReady; k++){
k                120007 ext/sqlite3/libsqlite/sqlite3.c         memcpy(&pOrTab->a[k], &origSrc[pLevel[k].iFrom], sizeof(pOrTab->a[k]));
k                120804 ext/sqlite3/libsqlite/sqlite3.c   int i, j, k;
k                120829 ext/sqlite3/libsqlite/sqlite3.c           if( sqlite3ExprIsInteger(pRight, &k) && k>=(-1) && k<=1 ){
k                120830 ext/sqlite3/libsqlite/sqlite3.c             k = 10;
k                120832 ext/sqlite3/libsqlite/sqlite3.c             k = 20;
k                120834 ext/sqlite3/libsqlite/sqlite3.c           if( iReduce<k ) iReduce = k;
k                123128 ext/sqlite3/libsqlite/sqlite3.c     int k, last;
k                123142 ext/sqlite3/libsqlite/sqlite3.c       k = pLevel->addrBody;
k                123143 ext/sqlite3/libsqlite/sqlite3.c       pOp = sqlite3VdbeGetOp(v, k);
k                123144 ext/sqlite3/libsqlite/sqlite3.c       for(; k<last; k++, pOp++){
k                123199 ext/sqlite3/libsqlite/sqlite3.c       k = pLevel->addrBody;
k                123200 ext/sqlite3/libsqlite/sqlite3.c       pOp = sqlite3VdbeGetOp(v, k);
k                123201 ext/sqlite3/libsqlite/sqlite3.c       for(; k<last; k++, pOp++){
k                134307 ext/sqlite3/libsqlite/sqlite3.c             int k;
k                134308 ext/sqlite3/libsqlite/sqlite3.c             for(k=j; k<nCol; k++) aCol[k] = aCol[k+1];
k                152238 ext/sqlite3/libsqlite/sqlite3.c   int i, j, k, n;
k                152258 ext/sqlite3/libsqlite/sqlite3.c       k = j+1;
k                152259 ext/sqlite3/libsqlite/sqlite3.c       if( k<n && rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[j])<0 ){
k                152260 ext/sqlite3/libsqlite/sqlite3.c         if( rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[i])<0 ){
k                152261 ext/sqlite3/libsqlite/sqlite3.c           rtreeSearchPointSwap(p, i, k);
k                152262 ext/sqlite3/libsqlite/sqlite3.c           i = k;
k                2682 ext/standard/array.c 		uint32_t k = 0;
k                2688 ext/standard/array.c 				if (idx != k) {
k                2689 ext/standard/array.c 					Bucket *q = Z_ARRVAL_P(stack)->arData + k;
k                2690 ext/standard/array.c 					q->h = k;
k                2695 ext/standard/array.c 				k++;
k                2703 ext/standard/array.c 				if (idx != k) {
k                2704 ext/standard/array.c 					Bucket *q = Z_ARRVAL_P(stack)->arData + k;
k                2705 ext/standard/array.c 					q->h = k;
k                2710 ext/standard/array.c 						zend_hash_iterators_update(Z_ARRVAL_P(stack), idx, k);
k                2714 ext/standard/array.c 				k++;
k                2717 ext/standard/array.c 		Z_ARRVAL_P(stack)->nNumUsed = k;
k                2718 ext/standard/array.c 		Z_ARRVAL_P(stack)->nNextFreeElement = k;
k                2720 ext/standard/array.c 		uint32_t k = 0;
k                2727 ext/standard/array.c 				if (p->h != k) {
k                2728 ext/standard/array.c 					p->h = k++;
k                2731 ext/standard/array.c 					k++;
k                2735 ext/standard/array.c 		Z_ARRVAL_P(stack)->nNextFreeElement = k;
k                4815 ext/standard/array.c 	int				i, k, n;
k                4849 ext/standard/array.c 			for (k = 0; k < MULTISORT_LAST; k++) {
k                4850 ext/standard/array.c 				parse_state[k] = 1;
k                4924 ext/standard/array.c 		k = 0;
k                4928 ext/standard/array.c 			indirect[k][i] = *p;
k                4929 ext/standard/array.c 			k++;
k                4932 ext/standard/array.c 	for (k = 0; k < array_size; k++) {
k                4933 ext/standard/array.c 		ZVAL_UNDEF(&indirect[k][num_arrays].val);
k                4949 ext/standard/array.c 		for (n = 0, k = 0; k < array_size; k++) {
k                4950 ext/standard/array.c 			hash->arData[k] = indirect[k][i];
k                4951 ext/standard/array.c 			if (hash->arData[k].key == NULL) {
k                4952 ext/standard/array.c 				hash->arData[k].h = n++;
k                5259 ext/standard/array.c 	uint32_t k, maxlen = 0;
k                5334 ext/standard/array.c 			for (k = 0; k < maxlen; k++) {
k                5365 ext/standard/array.c 			for (k = 0; k < maxlen; k++) {
k                 139 ext/standard/base64.c 	int ch, i = 0, j = 0, k;
k                 190 ext/standard/base64.c 	k = j;
k                 198 ext/standard/base64.c 			k++;
k                 200 ext/standard/base64.c 			ZSTR_VAL(result)[k] = 0;
k                 866 ext/standard/crypt_blowfish.c 		const char *k = "\xff\xa3" "34" "\xff\xff\xff\xa3" "345";
k                 868 ext/standard/crypt_blowfish.c 		BF_set_key(k, ae, ai, 2); /* $2a$ */
k                 869 ext/standard/crypt_blowfish.c 		BF_set_key(k, ye, yi, 4); /* $2y$ */
k                 217 ext/standard/crypt_freesec.c 	int i, j, b, k, inbit, obit;
k                 277 ext/standard/crypt_freesec.c 	for (k = 0; k < 8; k++) {
k                 279 ext/standard/crypt_freesec.c 			*(il = &ip_maskl[k][i]) = 0;
k                 280 ext/standard/crypt_freesec.c 			*(ir = &ip_maskr[k][i]) = 0;
k                 281 ext/standard/crypt_freesec.c 			*(fl = &fp_maskl[k][i]) = 0;
k                 282 ext/standard/crypt_freesec.c 			*(fr = &fp_maskr[k][i]) = 0;
k                 284 ext/standard/crypt_freesec.c 				inbit = 8 * k + j;
k                 298 ext/standard/crypt_freesec.c 			*(il = &key_perm_maskl[k][i]) = 0;
k                 299 ext/standard/crypt_freesec.c 			*(ir = &key_perm_maskr[k][i]) = 0;
k                 301 ext/standard/crypt_freesec.c 				inbit = 8 * k + j;
k                 311 ext/standard/crypt_freesec.c 			*(il = &comp_maskl[k][i]) = 0;
k                 312 ext/standard/crypt_freesec.c 			*(ir = &comp_maskr[k][i]) = 0;
k                 314 ext/standard/crypt_freesec.c 				inbit = 7 * k + j;
k                 440 ext/standard/exec.c 		int k = 0, n = y - 1;
k                 441 ext/standard/exec.c 		for (; n >= 0 && '\\' == ZSTR_VAL(cmd)[n]; n--, k++);
k                 442 ext/standard/exec.c 		if (k % 2) {
k                  36 ext/standard/ftok.c 	key_t k;
k                  56 ext/standard/ftok.c 	k = ftok(pathname, proj[0]);
k                  57 ext/standard/ftok.c 	if (k == -1) {
k                  61 ext/standard/ftok.c 	RETURN_LONG(k);
k                 472 ext/standard/html.c static inline size_t php_utf32_utf8(unsigned char *buf, unsigned k)
k                 478 ext/standard/html.c 	if (k < 0x80) {
k                 479 ext/standard/html.c 		buf[0] = k;
k                 481 ext/standard/html.c 	} else if (k < 0x800) {
k                 482 ext/standard/html.c 		buf[0] = 0xc0 | (k >> 6);
k                 483 ext/standard/html.c 		buf[1] = 0x80 | (k & 0x3f);
k                 485 ext/standard/html.c 	} else if (k < 0x10000) {
k                 486 ext/standard/html.c 		buf[0] = 0xe0 | (k >> 12);
k                 487 ext/standard/html.c 		buf[1] = 0x80 | ((k >> 6) & 0x3f);
k                 488 ext/standard/html.c 		buf[2] = 0x80 | (k & 0x3f);
k                 491 ext/standard/html.c 		buf[0] = 0xf0 | (k >> 18);
k                 492 ext/standard/html.c 		buf[1] = 0x80 | ((k >> 12) & 0x3f);
k                 493 ext/standard/html.c 		buf[2] = 0x80 | ((k >> 6) & 0x3f);
k                 494 ext/standard/html.c 		buf[3] = 0x80 | (k & 0x3f);
k                 505 ext/standard/html.c static inline size_t php_mb2_int_to_char(unsigned char *buf, unsigned k)
k                 507 ext/standard/html.c 	assert(k <= 0xFFFFU);
k                 509 ext/standard/html.c 	if (k <= 0xFFU) { /* 1 */
k                 510 ext/standard/html.c 		buf[0] = k;
k                 513 ext/standard/html.c 		buf[0] = k >> 8;
k                 514 ext/standard/html.c 		buf[1] = k & 0xFFU;
k                 523 ext/standard/html.c static inline size_t php_mb3_int_to_char(unsigned char *buf, unsigned k)
k                 525 ext/standard/html.c 	assert(k <= 0xFFFFFFU);
k                 527 ext/standard/html.c 	if (k <= 0xFFU) { /* 1 */
k                 528 ext/standard/html.c 		buf[0] = k;
k                 530 ext/standard/html.c 	} else if (k <= 0xFFFFU) { /* 2 */
k                 531 ext/standard/html.c 		buf[0] = k >> 8;
k                 532 ext/standard/html.c 		buf[1] = k & 0xFFU;
k                 535 ext/standard/html.c 		buf[0] = k >> 16;
k                 536 ext/standard/html.c 		buf[1] = (k >> 8) & 0xFFU;
k                 537 ext/standard/html.c 		buf[2] = k & 0xFFU;
k                1145 ext/standard/html.c 	unsigned int k,
k                1154 ext/standard/html.c 	unsigned stage1_idx = ENT_STAGE1_INDEX(k);
k                1163 ext/standard/html.c 	c = &table[stage1_idx][ENT_STAGE2_INDEX(k)][ENT_STAGE3_INDEX(k)];
k                1208 ext/standard/html.c 	unsigned int k,
k                1213 ext/standard/html.c 	if (k >= 64U) {
k                1219 ext/standard/html.c 	*entity     = (const unsigned char *) table[k].data.ent.entity;
k                1220 ext/standard/html.c 	*entity_len = table[k].data.ent.entity_len;
k                1662 ext/standard/html.c 			unsigned i, j, k,
k                1677 ext/standard/html.c 					for (k = 0; k < max_k; k++) {
k                1678 ext/standard/html.c 						const entity_stage3_row *r = &ms_table[i][j][k];
k                1684 ext/standard/html.c 						code = ENT_CODE_POINT_FROM_STAGES(i, j, k);
k                  95 ext/standard/html_tables.h #define ENT_ENC_TO_UNI_STAGE1(k) ((k & 0xC0) >> 6)
k                  97 ext/standard/html_tables.h #define ENT_ENC_TO_UNI_STAGE2(k) ((k) & 0x3F)
k                1092 ext/standard/html_tables.h #define ENT_STAGE1_INDEX(k) (((k) & 0xFFF000) >> 12) /* > 1D, we have no mapping */
k                1093 ext/standard/html_tables.h #define ENT_STAGE2_INDEX(k) (((k) & 0xFC0) >> 6)
k                1094 ext/standard/html_tables.h #define ENT_STAGE3_INDEX(k) ((k) & 0x3F)
k                1095 ext/standard/html_tables.h #define ENT_CODE_POINT_FROM_STAGES(i,j,k) (((i) << 12) | ((j) << 6) | (k))
k                 207 ext/standard/quot_print.c 	size_t i = 0, j = 0, k;
k                 231 ext/standard/quot_print.c 				k = 1;
k                 232 ext/standard/quot_print.c 				while (str_in[i + k] && ((str_in[i + k] == 32) || (str_in[i + k] == 9))) {
k                 234 ext/standard/quot_print.c 					k++;
k                 236 ext/standard/quot_print.c 				if (!str_in[i + k]) {
k                 238 ext/standard/quot_print.c 					i += k;
k                 240 ext/standard/quot_print.c 				else if ((str_in[i + k] == 13) && (str_in[i + k + 1] == 10)) {
k                 242 ext/standard/quot_print.c 					i += k + 2;
k                 244 ext/standard/quot_print.c 				else if ((str_in[i + k] == 13) || (str_in[i + k] == 10)) {
k                 246 ext/standard/quot_print.c 					i += k + 1;
k                 163 sapi/fpm/fpm/events/kqueue.c 	struct kevent k;
k                 170 sapi/fpm/fpm/events/kqueue.c 	EV_SET(&k, ev->fd, EVFILT_READ, flags, 0, 0, (void *)ev);
k                 172 sapi/fpm/fpm/events/kqueue.c 	if (kevent(kfd, &k, 1, NULL, 0, NULL) < 0) {
k                 188 sapi/fpm/fpm/events/kqueue.c 	struct kevent k;
k                 195 sapi/fpm/fpm/events/kqueue.c 	EV_SET(&k, ev->fd, EVFILT_READ, flags, 0, 0, (void *)ev);
k                 197 sapi/fpm/fpm/events/kqueue.c 	if (kevent(kfd, &k, 1, NULL, 0, NULL) < 0) {
k                 771 win32/glob.c   	Char c, k;
k                 791 win32/glob.c   			if ((k = *name++) == EOS)
k                 797 win32/glob.c   					if (c <= k && k <= pat[1])
k                 800 win32/glob.c   				} else if (c == k)