Lines Matching refs:j
77 Int32 i, j, tmp; in fallbackSimpleSort() local
86 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
87 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
88 fmap[j-4] = tmp; in fallbackSimpleSort()
95 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
96 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
97 fmap[j-1] = tmp; in fallbackSimpleSort()
260 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort() local
277 j = eclass8[i]; in fallbackSort()
278 k = ftab[j] - 1; in fallbackSort()
279 ftab[j] = k; in fallbackSort()
306 j = 0; in fallbackSort()
308 if (ISSET_BH(i)) j = i; in fallbackSort()
310 eclass[k] = j; in fallbackSort()
362 j = 0; in fallbackSort()
364 while (ftabCopy[j] == 0) j++; in fallbackSort()
365 ftabCopy[j]--; in fallbackSort()
366 eclass8[fmap[i]] = (UChar)j; in fallbackSort()
368 AssertH ( j < 256, 1005 ); in fallbackSort()
534 Int32 i, j, h, bigN, hp; in mainSimpleSort() local
553 j = i; in mainSimpleSort()
555 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort()
557 ptr[j] = ptr[j-h]; in mainSimpleSort()
558 j = j - h; in mainSimpleSort()
559 if (j <= (lo + h - 1)) break; in mainSimpleSort()
561 ptr[j] = v; in mainSimpleSort()
567 j = i; in mainSimpleSort()
569 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort()
571 ptr[j] = ptr[j-h]; in mainSimpleSort()
572 j = j - h; in mainSimpleSort()
573 if (j <= (lo + h - 1)) break; in mainSimpleSort()
575 ptr[j] = v; in mainSimpleSort()
581 j = i; in mainSimpleSort()
583 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort()
585 ptr[j] = ptr[j-h]; in mainSimpleSort()
586 j = j - h; in mainSimpleSort()
587 if (j <= (lo + h - 1)) break; in mainSimpleSort()
589 ptr[j] = v; in mainSimpleSort()
799 Int32 i, j, k, ss, sb; in mainSort() local
812 j = block[0] << 8; in mainSort()
816 j = (j >> 8) | ( ((UInt16)block[i]) << 8); in mainSort()
817 ftab[j]++; in mainSort()
819 j = (j >> 8) | ( ((UInt16)block[i-1]) << 8); in mainSort()
820 ftab[j]++; in mainSort()
822 j = (j >> 8) | ( ((UInt16)block[i-2]) << 8); in mainSort()
823 ftab[j]++; in mainSort()
825 j = (j >> 8) | ( ((UInt16)block[i-3]) << 8); in mainSort()
826 ftab[j]++; in mainSort()
830 j = (j >> 8) | ( ((UInt16)block[i]) << 8); in mainSort()
831 ftab[j]++; in mainSort()
849 j = ftab[s] -1; in mainSort()
850 ftab[s] = j; in mainSort()
851 ptr[j] = i; in mainSort()
853 j = ftab[s] -1; in mainSort()
854 ftab[s] = j; in mainSort()
855 ptr[j] = i-1; in mainSort()
857 j = ftab[s] -1; in mainSort()
858 ftab[s] = j; in mainSort()
859 ptr[j] = i-2; in mainSort()
861 j = ftab[s] -1; in mainSort()
862 ftab[s] = j; in mainSort()
863 ptr[j] = i-3; in mainSort()
867 j = ftab[s] -1; in mainSort()
868 ftab[s] = j; in mainSort()
869 ptr[j] = i; in mainSort()
890 j = i; in mainSort()
891 while ( BIGFREQ(runningOrder[j-h]) > BIGFREQ(vv) ) { in mainSort()
892 runningOrder[j] = runningOrder[j-h]; in mainSort()
893 j = j - h; in mainSort()
894 if (j <= (h - 1)) goto zero; in mainSort()
897 runningOrder[j] = vv; in mainSort()
926 for (j = 0; j <= 255; j++) { in mainSort()
927 if (j != ss) { in mainSort()
928 sb = (ss << 8) + j; in mainSort()
936 ss, j, numQSorted, hi - lo + 1 ); in mainSort()
959 for (j = 0; j <= 255; j++) { in mainSort()
960 copyStart[j] = ftab[(j << 8) + ss] & CLEARMASK; in mainSort()
961 copyEnd [j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1; in mainSort()
963 for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) { in mainSort()
964 k = ptr[j]-1; if (k < 0) k += nblock; in mainSort()
969 for (j = (ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) { in mainSort()
970 k = ptr[j]-1; if (k < 0) k += nblock; in mainSort()
986 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK; in mainSort()
1036 for (j = bbSize-1; j >= 0; j--) { in mainSort()
1037 Int32 a2update = ptr[bbStart + j]; in mainSort()
1038 UInt16 qVal = (UInt16)(j >> shifts); in mainSort()