Lines Matching refs:j
78 Int32 i, j, tmp; in fallbackSimpleSort() local
88 for (j = i + 4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4) in fallbackSimpleSort()
89 fmap[j - 4] = fmap[j]; in fallbackSimpleSort()
90 fmap[j - 4] = tmp; in fallbackSimpleSort()
97 for (j = i + 1; j <= hi && ec_tmp > eclass[fmap[j]]; j++) in fallbackSimpleSort()
98 fmap[j - 1] = fmap[j]; in fallbackSimpleSort()
99 fmap[j - 1] = tmp; in fallbackSimpleSort()
274 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort() local
295 j = eclass8[i]; in fallbackSort()
296 k = ftab[j] - 1; in fallbackSort()
297 ftab[j] = k; in fallbackSort()
325 j = 0; in fallbackSort()
328 j = i; in fallbackSort()
332 eclass[k] = j; in fallbackSort()
395 j = 0; in fallbackSort()
397 while (ftabCopy[j] == 0) in fallbackSort()
398 j++; in fallbackSort()
399 ftabCopy[j]--; in fallbackSort()
400 eclass8[fmap[i]] = (UChar)j; in fallbackSort()
402 AssertH(j < 256, 1005); in fallbackSort()
636 Int32 i, j, h, bigN, hp; in mainSimpleSort() local
657 j = i; in mainSimpleSort()
658 while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) { in mainSimpleSort()
659 ptr[j] = ptr[j - h]; in mainSimpleSort()
660 j = j - h; in mainSimpleSort()
661 if (j <= (lo + h - 1)) in mainSimpleSort()
664 ptr[j] = v; in mainSimpleSort()
671 j = i; in mainSimpleSort()
672 while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) { in mainSimpleSort()
673 ptr[j] = ptr[j - h]; in mainSimpleSort()
674 j = j - h; in mainSimpleSort()
675 if (j <= (lo + h - 1)) in mainSimpleSort()
678 ptr[j] = v; in mainSimpleSort()
685 j = i; in mainSimpleSort()
686 while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) { in mainSimpleSort()
687 ptr[j] = ptr[j - h]; in mainSimpleSort()
688 j = j - h; in mainSimpleSort()
689 if (j <= (lo + h - 1)) in mainSimpleSort()
692 ptr[j] = v; in mainSimpleSort()
935 Int32 i, j, k, ss, sb; in mainSort() local
950 j = block[0] << 8; in mainSort()
954 j = (j >> 8) | (((UInt16)block[i]) << 8); in mainSort()
955 ftab[j]++; in mainSort()
957 j = (j >> 8) | (((UInt16)block[i - 1]) << 8); in mainSort()
958 ftab[j]++; in mainSort()
960 j = (j >> 8) | (((UInt16)block[i - 2]) << 8); in mainSort()
961 ftab[j]++; in mainSort()
963 j = (j >> 8) | (((UInt16)block[i - 3]) << 8); in mainSort()
964 ftab[j]++; in mainSort()
968 j = (j >> 8) | (((UInt16)block[i]) << 8); in mainSort()
969 ftab[j]++; in mainSort()
989 j = ftab[s] - 1; in mainSort()
990 ftab[s] = j; in mainSort()
991 ptr[j] = i; in mainSort()
993 j = ftab[s] - 1; in mainSort()
994 ftab[s] = j; in mainSort()
995 ptr[j] = i - 1; in mainSort()
997 j = ftab[s] - 1; in mainSort()
998 ftab[s] = j; in mainSort()
999 ptr[j] = i - 2; in mainSort()
1001 j = ftab[s] - 1; in mainSort()
1002 ftab[s] = j; in mainSort()
1003 ptr[j] = i - 3; in mainSort()
1007 j = ftab[s] - 1; in mainSort()
1008 ftab[s] = j; in mainSort()
1009 ptr[j] = i; in mainSort()
1032 j = i; in mainSort()
1033 while (BIGFREQ(runningOrder[j - h]) > BIGFREQ(vv)) { in mainSort()
1034 runningOrder[j] = runningOrder[j - h]; in mainSort()
1035 j = j - h; in mainSort()
1036 if (j <= (h - 1)) in mainSort()
1040 runningOrder[j] = vv; in mainSort()
1068 for (j = 0; j <= 255; j++) { in mainSort()
1069 if (j != ss) { in mainSort()
1070 sb = (ss << 8) + j; in mainSort()
1079 j, in mainSort()
1102 for (j = 0; j <= 255; j++) { in mainSort()
1103 copyStart[j] = ftab[(j << 8) + ss] & CLEARMASK; in mainSort()
1104 copyEnd[j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1; in mainSort()
1106 for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) { in mainSort()
1107 k = ptr[j] - 1; in mainSort()
1114 for (j = (ftab[(ss + 1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) { in mainSort()
1115 k = ptr[j] - 1; in mainSort()
1132 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK; in mainSort()
1183 for (j = bbSize - 1; j >= 0; j--) { in mainSort()
1184 Int32 a2update = ptr[bbStart + j]; in mainSort()
1185 UInt16 qVal = (UInt16)(j >> shifts); in mainSort()