Lines Matching refs:ss
759 Int32 i, j, k, ss, sb;
873 mainQSort3 to sort the small buckets [ss, j], but
876 ss = runningOrder[i];
880 Complete the big bucket [ss] by quicksorting
881 any unsorted small buckets [ss, j], for j != ss.
883 completed many of the small buckets [ss, j], so
887 if (j != ss) {
888 sb = (ss << 8) + j;
896 ss, j, numQSorted, hi - lo + 1 );
909 AssertH ( !bigDone[ss], 1006 );
913 Now scan this big bucket [ss] so as to synthesise the
914 sorted order for small buckets [t, ss] for all t,
915 including, magically, the bucket [ss,ss] too.
920 copyStart[j] = ftab[(j << 8) + ss] & CLEARMASK;
921 copyEnd [j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1;
923 for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) {
929 for (j = (ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) {
937 AssertH ( (copyStart[ss]-1 == copyEnd[ss])
943 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
946 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK;
950 The [ss] big bucket is now done. Record this fact,
987 bigDone[ss] = True;
990 Int32 bbStart = ftab[ss << 8] & CLEARMASK;
991 Int32 bbSize = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart;
