emo/busybox
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

bzip2: remove redundant loop termination check in mainSort()

Browse Source 
function                                             old     new   delta
mainSort                                            1202    1192     -10

Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>
This commit is contained in:
Denys Vlasenko 2018-02-03 16:43:33 +01:00
parent e59e5ff96e
commit aaa3818a75
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
archival/libarchive/bz/blocksort.c
View File

@ -825,7 +825,6 @@ void mainSort(EState* state,
} }
{ {
int32_t vv;
/* bbox: was: int32_t h = 1; */ /* bbox: was: int32_t h = 1; */
/* do h = 3 * h + 1; while (h <= 256); */ /* do h = 3 * h + 1; while (h <= 256); */
uint32_t h = 364; uint32_t h = 364;
@ -834,6 +833,7 @@ void mainSort(EState* state,
/*h = h / 3;*/ /*h = h / 3;*/
h = (h * 171) >> 9; /* bbox: fast h/3 */ h = (h * 171) >> 9; /* bbox: fast h/3 */
for (i = h; i <= 255; i++) { for (i = h; i <= 255; i++) {
int32_t vv;
vv = runningOrder[i]; vv = runningOrder[i];
j = i; j = i;
while (BIGFREQ(runningOrder[j-h]) > BIGFREQ(vv)) { while (BIGFREQ(runningOrder[j-h]) > BIGFREQ(vv)) {
@ -854,7 +854,7 @@ void mainSort(EState* state,
numQSorted = 0; numQSorted = 0;
for (i = 0; i <= 255; i++) { for (i = 0; /*i <= 255*/; i++) {
/* /*
* Process big buckets, starting with the least full. * Process big buckets, starting with the least full.
@ -974,7 +974,10 @@ void mainSort(EState* state,
*/ */
bigDone[ss] = True; bigDone[ss] = True;
if (i < 255) { if (i == 255)
break;
{
int32_t bbStart = ftab[ss << 8] & CLEARMASK; int32_t bbStart = ftab[ss << 8] & CLEARMASK;
int32_t bbSize = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart; int32_t bbSize = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart;
int32_t shifts = 0; int32_t shifts = 0;