Lines Matching refs:ptr
628 static void mainSimpleSort(UInt32* ptr, in mainSimpleSort() argument
656 v = ptr[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()
664 ptr[j] = v; in mainSimpleSort()
670 v = ptr[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()
678 ptr[j] = v; in mainSimpleSort()
684 v = ptr[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()
692 ptr[j] = v; in mainSimpleSort()
723 mswap(ptr[yyp1], ptr[yyp2]); \
783 static void mainQSort3(UInt32* ptr, in mainQSort3() argument
810 mainSimpleSort(ptr, block, quadrant, nblock, lo, hi, d, budget); in mainQSort3()
816 med = (Int32)mmed3(block[ptr[lo] + d], block[ptr[hi] + d], block[ptr[(lo + hi) >> 1] + d]); in mainQSort3()
825 n = ((Int32)block[ptr[unLo] + d]) - med; in mainQSort3()
827 mswap(ptr[unLo], ptr[ltLo]); in mainQSort3()
839 n = ((Int32)block[ptr[unHi] + d]) - med; in mainQSort3()
841 mswap(ptr[unHi], ptr[gtHi]); in mainQSort3()
852 mswap(ptr[unLo], ptr[unHi]); in mainQSort3()
928 static void mainSort(UInt32* ptr, in mainSort() argument
991 ptr[j] = i; in mainSort()
995 ptr[j] = i - 1; in mainSort()
999 ptr[j] = i - 2; in mainSort()
1003 ptr[j] = i - 3; in mainSort()
1009 ptr[j] = i; in mainSort()
1082 mainQSort3(ptr, block, quadrant, nblock, lo, hi, BZ_N_RADIX, budget); in mainSort()
1107 k = ptr[j] - 1; in mainSort()
1112 ptr[copyStart[c1]++] = k; in mainSort()
1115 k = ptr[j] - 1; in mainSort()
1120 ptr[copyEnd[c1]--] = k; in mainSort()
1184 Int32 a2update = ptr[bbStart + j]; in mainSort()
1219 UInt32* ptr = s->ptr; in BZ2_blockSort() local
1258 mainSort(ptr, block, quadrant, ftab, nblock, verb, &budget); in BZ2_blockSort()
1274 if (ptr[i] == 0) { in BZ2_blockSort()