busybox

/*

 * bzip2 is written by Julian Seward <jseward@bzip.org>.

 * Adapted for busybox by Denys Vlasenko <vda.linux@googlemail.com>.

 * See README and LICENSE files in this directory for more information.

 */

​

/*-------------------------------------------------------------*/

/*--- Huffman coding low-level stuff                        ---*/

/*---                                             huffman.c ---*/

/*-------------------------------------------------------------*/

​

/* ------------------------------------------------------------------

This file is part of bzip2/libbzip2, a program and library for

lossless, block-sorting data compression.

​

bzip2/libbzip2 version 1.0.4 of 20 December 2006

Copyright (C) 1996-2006 Julian Seward <jseward@bzip.org>

​

Please read the WARNING, DISCLAIMER and PATENTS sections in the

README file.

​

This program is released under the terms of the license contained

in the file LICENSE.

------------------------------------------------------------------ */

​

/* #include "bzlib_private.h" */

​

/*---------------------------------------------------*/

#define WEIGHTOF(zz0)  ((zz0) & 0xffffff00)

#define DEPTHOF(zz1)   ((zz1) & 0x000000ff)

#define MYMAX(zz2,zz3) ((zz2) > (zz3) ? (zz2) : (zz3))

​

#define ADDWEIGHTS(zw1,zw2) \

    (WEIGHTOF(zw1)+WEIGHTOF(zw2)) | \

    (1 + MYMAX(DEPTHOF(zw1),DEPTHOF(zw2)))

​

#define UPHEAP(z) \

{ \

    int32_t zz, tmp; \

    zz = z; \

    tmp = heap[zz]; \

    while (weight[tmp] < weight[heap[zz >> 1]]) { \

        heap[zz] = heap[zz >> 1]; \

        zz >>= 1; \

    } \

    heap[zz] = tmp; \

}

​

​

/* 90 bytes, 0.3% of overall compress speed */

#if BZIP2_SPEED >= 1

​

/* macro works better than inline (gcc 4.2.1) */

#define DOWNHEAP1(heap, weight, Heap) \

{ \

    int32_t zz, yy, tmp; \

    zz = 1; \

    tmp = heap[zz]; \

    while (1) { \

        yy = zz << 1; \

        if (yy > nHeap) \

            break; \

        if (yy < nHeap \