Lines Matching refs:j
37 Int32 i, j, tmp; in fallbackSimpleSort() local
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
47 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
48 fmap[j-4] = tmp; in fallbackSimpleSort()
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
56 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
57 fmap[j-1] = tmp; in fallbackSimpleSort()
220 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort() local
237 j = eclass8[i]; in fallbackSort()
238 k = ftab[j] - 1; in fallbackSort()
239 ftab[j] = k; in fallbackSort()
266 j = 0; in fallbackSort()
268 if (ISSET_BH(i)) j = i; in fallbackSort()
270 eclass[k] = j; in fallbackSort()
322 j = 0; in fallbackSort()
324 while (ftabCopy[j] == 0) j++; in fallbackSort()
325 ftabCopy[j]--; in fallbackSort()
326 eclass8[fmap[i]] = (UChar)j; in fallbackSort()
328 AssertH ( j < 256, 1005 ); in fallbackSort()
494 Int32 i, j, h, bigN, hp; in mainSimpleSort() local
513 j = i; in mainSimpleSort()
515 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort()
517 ptr[j] = ptr[j-h]; in mainSimpleSort()
518 j = j - h; in mainSimpleSort()
519 if (j <= (lo + h - 1)) break; in mainSimpleSort()
521 ptr[j] = v; in mainSimpleSort()
527 j = i; in mainSimpleSort()
529 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort()
531 ptr[j] = ptr[j-h]; in mainSimpleSort()
532 j = j - h; in mainSimpleSort()
533 if (j <= (lo + h - 1)) break; in mainSimpleSort()
535 ptr[j] = v; in mainSimpleSort()
541 j = i; in mainSimpleSort()
543 ptr[j-h]+d, v+d, block, quadrant, nblock, budget in mainSimpleSort()
545 ptr[j] = ptr[j-h]; in mainSimpleSort()
546 j = j - h; in mainSimpleSort()
547 if (j <= (lo + h - 1)) break; in mainSimpleSort()
549 ptr[j] = v; in mainSimpleSort()
759 Int32 i, j, k, ss, sb; in mainSort() local
772 j = block[0] << 8; in mainSort()
776 j = (j >> 8) | ( ((UInt16)block[i]) << 8); in mainSort()
777 ftab[j]++; in mainSort()
779 j = (j >> 8) | ( ((UInt16)block[i-1]) << 8); in mainSort()
780 ftab[j]++; in mainSort()
782 j = (j >> 8) | ( ((UInt16)block[i-2]) << 8); in mainSort()
783 ftab[j]++; in mainSort()
785 j = (j >> 8) | ( ((UInt16)block[i-3]) << 8); in mainSort()
786 ftab[j]++; in mainSort()
790 j = (j >> 8) | ( ((UInt16)block[i]) << 8); in mainSort()
791 ftab[j]++; in mainSort()
809 j = ftab[s] -1; in mainSort()
810 ftab[s] = j; in mainSort()
811 ptr[j] = i; in mainSort()
813 j = ftab[s] -1; in mainSort()
814 ftab[s] = j; in mainSort()
815 ptr[j] = i-1; in mainSort()
817 j = ftab[s] -1; in mainSort()
818 ftab[s] = j; in mainSort()
819 ptr[j] = i-2; in mainSort()
821 j = ftab[s] -1; in mainSort()
822 ftab[s] = j; in mainSort()
823 ptr[j] = i-3; in mainSort()
827 j = ftab[s] -1; in mainSort()
828 ftab[s] = j; in mainSort()
829 ptr[j] = i; in mainSort()
850 j = i; in mainSort()
851 while ( BIGFREQ(runningOrder[j-h]) > BIGFREQ(vv) ) { in mainSort()
852 runningOrder[j] = runningOrder[j-h]; in mainSort()
853 j = j - h; in mainSort()
854 if (j <= (h - 1)) goto zero; in mainSort()
857 runningOrder[j] = vv; in mainSort()
886 for (j = 0; j <= 255; j++) { in mainSort()
887 if (j != ss) { in mainSort()
888 sb = (ss << 8) + j; in mainSort()
896 ss, j, numQSorted, hi - lo + 1 ); in mainSort()
919 for (j = 0; j <= 255; j++) { in mainSort()
920 copyStart[j] = ftab[(j << 8) + ss] & CLEARMASK; in mainSort()
921 copyEnd [j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1; in mainSort()
923 for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) { in mainSort()
924 k = ptr[j]-1; if (k < 0) k += nblock; in mainSort()
929 for (j = (ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) { in mainSort()
930 k = ptr[j]-1; if (k < 0) k += nblock; in mainSort()
946 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK; in mainSort()
996 for (j = bbSize-1; j >= 0; j--) { in mainSort()
997 Int32 a2update = ptr[bbStart + j]; in mainSort()
998 UInt16 qVal = (UInt16)(j >> shifts); in mainSort()