k2 227 ext/dba/libinifile/inifile.c static int inifile_key_cmp(const key_type *k1, const key_type *k2) k2 229 ext/dba/libinifile/inifile.c assert(k1->group && k1->name && k2->group && k2->name); k2 231 ext/dba/libinifile/inifile.c if (!strcasecmp(k1->group, k2->group)) { k2 232 ext/dba/libinifile/inifile.c if (!strcasecmp(k1->name, k2->name)) { k2 30 ext/hash/hash_gost.c #define round(tables, k1, k2) \ k2 34 ext/hash/hash_gost.c t = (k2) + l; \ k2 193 ext/mbstring/libmbfl/filters/mbfilter_cp936.c int k, k1, k2; k2 229 ext/mbstring/libmbfl/filters/mbfilter_cp936.c k1 = 0; k2 = mbfl_cp936_pua_tbl_max; k2 230 ext/mbstring/libmbfl/filters/mbfilter_cp936.c while (k1 < k2) { k2 231 ext/mbstring/libmbfl/filters/mbfilter_cp936.c k = (k1 + k2) >> 1; k2 233 ext/mbstring/libmbfl/filters/mbfilter_cp936.c k2 = k; k2 84 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c int k, k1 = 0, k2 = n-1; k2 86 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c while (k1 < k2) { k2 87 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c k = (k1+k2) >> 1; k2 89 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c k2 = k; k2 102 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c int k, k1 = 0, k2 = n; k2 108 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c while (k2 - k1 > 1) { k2 109 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c k = (k1 + k2) >> 1; k2 111 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c k2 = k; k2 287 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c int k, k1, k2; k2 357 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c k1 = 0; k2 = mbfl_gb18030_pua_tbl_max; k2 358 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c while (k1 < k2) { k2 359 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c k = (k1 + k2) >> 1; k2 361 ext/mbstring/libmbfl/filters/mbfilter_gb18030.c k2 = k;