Lines Matching refs:i
78 Int32 i, j, tmp; in fallbackSimpleSort() local
85 for (i = hi - 4; i >= lo; i--) { in fallbackSimpleSort()
86 tmp = fmap[i]; in fallbackSimpleSort()
88 for (j = i + 4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4) in fallbackSimpleSort()
94 for (i = hi - 1; i >= lo; i--) { in fallbackSimpleSort()
95 tmp = fmap[i]; in fallbackSimpleSort()
97 for (j = i + 1; j <= hi && ec_tmp > eclass[fmap[j]]; j++) in fallbackSimpleSort()
274 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort() local
285 for (i = 0; i < 257; i++) in fallbackSort()
286 ftab[i] = 0; in fallbackSort()
287 for (i = 0; i < nblock; i++) in fallbackSort()
288 ftab[eclass8[i]]++; in fallbackSort()
289 for (i = 0; i < 256; i++) in fallbackSort()
290 ftabCopy[i] = ftab[i]; in fallbackSort()
291 for (i = 1; i < 257; i++) in fallbackSort()
292 ftab[i] += ftab[i - 1]; in fallbackSort()
294 for (i = 0; i < nblock; i++) { in fallbackSort()
295 j = eclass8[i]; in fallbackSort()
298 fmap[k] = i; in fallbackSort()
302 for (i = 0; i < nBhtab; i++) in fallbackSort()
303 bhtab[i] = 0; in fallbackSort()
304 for (i = 0; i < 256; i++) in fallbackSort()
305 SET_BH(ftab[i]); in fallbackSort()
314 for (i = 0; i < 32; i++) { in fallbackSort()
315 SET_BH(nblock + 2 * i); in fallbackSort()
316 CLEAR_BH(nblock + 2 * i + 1); in fallbackSort()
326 for (i = 0; i < nblock; i++) { in fallbackSort()
327 if (ISSET_BH(i)) in fallbackSort()
328 j = i; in fallbackSort()
329 k = fmap[i] - H; in fallbackSort()
370 for (i = l; i <= r; i++) { in fallbackSort()
371 cc1 = eclass[fmap[i]]; in fallbackSort()
373 SET_BH(i); in fallbackSort()
396 for (i = 0; i < nblock; i++) { in fallbackSort()
400 eclass8[fmap[i]] = (UChar)j; in fallbackSort()
636 Int32 i, j, h, bigN, hp; in mainSimpleSort() local
651 i = lo + h; in mainSimpleSort()
654 if (i > hi) in mainSimpleSort()
656 v = ptr[i]; in mainSimpleSort()
657 j = i; in mainSimpleSort()
665 i++; in mainSimpleSort()
668 if (i > hi) in mainSimpleSort()
670 v = ptr[i]; in mainSimpleSort()
671 j = i; in mainSimpleSort()
679 i++; in mainSimpleSort()
682 if (i > hi) in mainSimpleSort()
684 v = ptr[i]; in mainSimpleSort()
685 j = i; in mainSimpleSort()
693 i++; in mainSimpleSort()
935 Int32 i, j, k, ss, sb; in mainSort() local
947 for (i = 65536; i >= 0; i--) in mainSort()
948 ftab[i] = 0; in mainSort()
951 i = nblock - 1; in mainSort()
952 for (; i >= 3; i -= 4) { in mainSort()
953 quadrant[i] = 0; in mainSort()
954 j = (j >> 8) | (((UInt16)block[i]) << 8); in mainSort()
956 quadrant[i - 1] = 0; in mainSort()
957 j = (j >> 8) | (((UInt16)block[i - 1]) << 8); in mainSort()
959 quadrant[i - 2] = 0; in mainSort()
960 j = (j >> 8) | (((UInt16)block[i - 2]) << 8); in mainSort()
962 quadrant[i - 3] = 0; in mainSort()
963 j = (j >> 8) | (((UInt16)block[i - 3]) << 8); in mainSort()
966 for (; i >= 0; i--) { in mainSort()
967 quadrant[i] = 0; in mainSort()
968 j = (j >> 8) | (((UInt16)block[i]) << 8); in mainSort()
973 for (i = 0; i < BZ_N_OVERSHOOT; i++) { in mainSort()
974 block[nblock + i] = block[i]; in mainSort()
975 quadrant[nblock + i] = 0; in mainSort()
982 for (i = 1; i <= 65536; i++) in mainSort()
983 ftab[i] += ftab[i - 1]; in mainSort()
986 i = nblock - 1; in mainSort()
987 for (; i >= 3; i -= 4) { in mainSort()
988 s = (s >> 8) | (block[i] << 8); in mainSort()
991 ptr[j] = i; in mainSort()
992 s = (s >> 8) | (block[i - 1] << 8); in mainSort()
995 ptr[j] = i - 1; in mainSort()
996 s = (s >> 8) | (block[i - 2] << 8); in mainSort()
999 ptr[j] = i - 2; in mainSort()
1000 s = (s >> 8) | (block[i - 3] << 8); in mainSort()
1003 ptr[j] = i - 3; in mainSort()
1005 for (; i >= 0; i--) { in mainSort()
1006 s = (s >> 8) | (block[i] << 8); in mainSort()
1009 ptr[j] = i; in mainSort()
1017 for (i = 0; i <= 255; i++) { in mainSort()
1018 bigDone[i] = False; in mainSort()
1019 runningOrder[i] = i; in mainSort()
1030 for (i = h; i <= 255; i++) { in mainSort()
1031 vv = runningOrder[i]; in mainSort()
1032 j = i; in mainSort()
1051 for (i = 0; i <= 255; i++) { in mainSort()
1058 ss = runningOrder[i]; in mainSort()
1175 if (i < 255) { in mainSort()
1228 Int32 i; in BZ2_blockSort() local
1239 i = nblock + BZ_N_OVERSHOOT; in BZ2_blockSort()
1240 if (i & 1) in BZ2_blockSort()
1241 i++; in BZ2_blockSort()
1242 quadrant = (UInt16*)(&(block[i])); in BZ2_blockSort()
1273 for (i = 0; i < s->nblock; i++) in BZ2_blockSort()
1274 if (ptr[i] == 0) { in BZ2_blockSort()
1275 s->origPtr = i; in BZ2_blockSort()