k1               1024 Zend/zend_strtod.c 	int i, k1, n, n1;
k1               1033 Zend/zend_strtod.c 	k1 = b->k;
k1               1036 Zend/zend_strtod.c 		k1++;
k1               1037 Zend/zend_strtod.c 	b1 = Balloc(k1);
k1               1045 Zend/zend_strtod.c 		k1 = 32 - k;
k1               1049 Zend/zend_strtod.c 			z = *x++ >> k1;
k1               1057 Zend/zend_strtod.c 		k1 = 16 - k;
k1               1061 Zend/zend_strtod.c 			z = *x++ >> k1;
k1                227 ext/dba/libinifile/inifile.c static int inifile_key_cmp(const key_type *k1, const key_type *k2)
k1                229 ext/dba/libinifile/inifile.c 	assert(k1->group && k1->name && k2->group && k2->name);
k1                231 ext/dba/libinifile/inifile.c 	if (!strcasecmp(k1->group, k2->group)) {
k1                232 ext/dba/libinifile/inifile.c 		if (!strcasecmp(k1->name, k2->name)) {
k1                 30 ext/hash/hash_gost.c #define round(tables, k1, k2) \
k1                 31 ext/hash/hash_gost.c 	t = (k1) + r; \
k1                193 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 	int k, k1, k2;
k1                229 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 			k1 = 0; k2 = mbfl_cp936_pua_tbl_max;
k1                230 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 			while (k1 < k2) {
k1                231 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 				k = (k1 + k2) >> 1;
k1                235 ext/mbstring/libmbfl/filters/mbfilter_cp936.c 					k1 = k + 1;
k1                 84 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k, k1 = 0, k2 = n-1;
k1                 86 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	while (k1 < k2) {
k1                 87 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		k = (k1+k2) >> 1;
k1                 91 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			k1 = k + 1;
k1                 96 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	return k1;
k1                102 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k, k1 = 0, k2 = n;
k1                108 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	while (k2 - k1 > 1) {
k1                109 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		k = (k1 + k2) >> 1;
k1                113 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			k1 = k;
k1                287 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 	int k, k1, k2;
k1                338 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		k1 = mbfl_bisec_srch2(c, mbfl_gb18030_c_tbl_key, mbfl_gb18030_c_tbl_max);
k1                339 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 		if (k1 >= 0) {
k1                340 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			s = mbfl_gb18030_c_tbl_val[k1];
k1                357 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			k1 = 0; k2 = mbfl_gb18030_pua_tbl_max;
k1                358 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 			while (k1 < k2) {
k1                359 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 				k = (k1 + k2) >> 1;
k1                363 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c 					k1 = k + 1;
k1                379 ext/standard/crypt_freesec.c 	uint32_t	k0, k1, rawkey0, rawkey1;
k1                418 ext/standard/crypt_freesec.c 	k1 = key_perm_maskr[0][rawkey0 >> 25]
k1                436 ext/standard/crypt_freesec.c 		t1 = (k1 << shifts) | (k1 >> (28 - shifts));