Lines Matching refs:Int32

77 static __inline__ void fallbackSimpleSort(UInt32* fmap, UInt32* eclass, Int32 lo, Int32 hi) {  in fallbackSimpleSort()
78 Int32 i, j, tmp; in fallbackSimpleSort()
106 Int32 zztmp = zz1; \
113 Int32 yyp1 = (zzp1); \
114 Int32 yyp2 = (zzp2); \
115 Int32 yyn = (zzn); \
143 static void fallbackQSort3(UInt32* fmap, UInt32* eclass, Int32 loSt, Int32 hiSt) { in fallbackQSort3()
144 Int32 unLo, unHi, ltLo, gtHi, n, m; in fallbackQSort3()
145 Int32 sp, lo, hi; in fallbackQSort3()
147 Int32 stackLo[FALLBACK_QSORT_STACK_SIZE]; in fallbackQSort3()
148 Int32 stackHi[FALLBACK_QSORT_STACK_SIZE]; in fallbackQSort3()
187 n = (Int32)eclass[fmap[unLo]] - (Int32)med; in fallbackQSort3()
201 n = (Int32)eclass[fmap[unHi]] - (Int32)med; in fallbackQSort3()
271 static void fallbackSort(UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb) { in fallbackSort()
272 Int32 ftab[257]; in fallbackSort()
273 Int32 ftabCopy[256]; in fallbackSort()
274 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort()
275 Int32 nNotDone; in fallbackSort()
276 Int32 nBhtab; in fallbackSort()
423 Int32* budget) { in mainGtU()
424 Int32 k; in mainGtU()
625 static Int32 incs[14] = { 1, 4, 13, 40, 121, 364, 1093,
631 Int32 nblock, in mainSimpleSort()
632 Int32 lo, in mainSimpleSort()
633 Int32 hi, in mainSimpleSort()
634 Int32 d, in mainSimpleSort()
635 Int32* budget) { in mainSimpleSort()
636 Int32 i, j, h, bigN, hp; in mainSimpleSort()
712 Int32 zztmp = zz1; \
719 Int32 yyp1 = (zzp1); \
720 Int32 yyp2 = (zzp2); \
721 Int32 yyn = (zzn); \
767 Int32 tz; \
786 Int32 nblock, in mainQSort3()
787 Int32 loSt, in mainQSort3()
788 Int32 hiSt, in mainQSort3()
789 Int32 dSt, in mainQSort3()
790 Int32* budget) { in mainQSort3()
791 Int32 unLo, unHi, ltLo, gtHi, n, m, med; in mainQSort3()
792 Int32 sp, lo, hi, d; in mainQSort3()
794 Int32 stackLo[MAIN_QSORT_STACK_SIZE]; in mainQSort3()
795 Int32 stackHi[MAIN_QSORT_STACK_SIZE]; in mainQSort3()
796 Int32 stackD[MAIN_QSORT_STACK_SIZE]; in mainQSort3()
798 Int32 nextLo[3]; in mainQSort3()
799 Int32 nextHi[3]; in mainQSort3()
800 Int32 nextD[3]; 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()
839 n = ((Int32)block[ptr[unHi] + d]) - med; in mainQSort3()
932 Int32 nblock, in mainSort()
933 Int32 verb, in mainSort()
934 Int32* budget) { in mainSort()
935 Int32 i, j, k, ss, sb; in mainSort()
936 Int32 runningOrder[256]; in mainSort()
938 Int32 copyStart[256]; in mainSort()
939 Int32 copyEnd[256]; in mainSort()
941 Int32 numQSorted; in mainSort()
1023 Int32 vv; in mainSort()
1024 Int32 h = 1; in mainSort()
1072 Int32 lo = ftab[sb] & CLEARMASK; in mainSort()
1073 Int32 hi = (ftab[sb + 1] & CLEARMASK) - 1; in mainSort()
1176 Int32 bbStart = ftab[ss << 8] & CLEARMASK; in mainSort()
1177 Int32 bbSize = (ftab[(ss + 1) << 8] & CLEARMASK) - bbStart; in mainSort()
1178 Int32 shifts = 0; in mainSort()
1184 Int32 a2update = ptr[bbStart + j]; in mainSort()
1222 Int32 nblock = s->nblock; in BZ2_blockSort()
1223 Int32 verb = s->verbosity; in BZ2_blockSort()
1224 Int32 wfact = s->workFactor; in BZ2_blockSort()
1226 Int32 budget; in BZ2_blockSort()
1227 Int32 budgetInit; in BZ2_blockSort()
1228 Int32 i; in BZ2_blockSort()