// File: /workspace/github_cpp_makefile_star2_O2/tomfunkhouser[P]gaps/pkgs/png/inftrees.c
// Function: inflate_table
int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
codetype type;
unsigned short FAR *lens;
unsigned codes;
code FAR * FAR *table;
unsigned FAR *bits;
unsigned short FAR *work;
{
    unsigned len;               /* a code's length in bits */
    unsigned sym;               /* index of code symbols */
    unsigned min, max;          /* minimum and maximum code lengths */
    unsigned root;              /* number of index bits for root table */
    unsigned curr;              /* number of index bits for current table */
    unsigned drop;              /* code bits to drop for sub-table */
    int left;                   /* number of prefix codes available */
    unsigned used;              /* code entries in table used */
    unsigned huff;              /* Huffman code */
    unsigned incr;              /* for incrementing code, index */
    unsigned fill;              /* index for replicating entries */
    unsigned low;               /* low bits for current root entry */
    unsigned mask;              /* mask for low root bits */
    code here;                  /* table entry for duplication */
    code FAR *next;             /* next available space in table */
    const unsigned short FAR *base;     /* base value table to use */
    const unsigned short FAR *extra;    /* extra bits table to use */
    int end;                    /* use base and extra for symbol > end */
    unsigned short count[MAXBITS+1];    /* number of codes of each length */
    unsigned short offs[MAXBITS+1];     /* offsets in table for each length */
    static const unsigned short lbase[31] = { /* Length codes 257..285 base */
        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
        35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
    static const unsigned short lext[31] = { /* Length codes 257..285 extra */
        16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
        19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 73, 195};
    static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
        257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
        8193, 12289, 16385, 24577, 0, 0};
    static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
        16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
        23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
        28, 28, 29, 29, 64, 64};

    /*
       Process a set of code lengths to create a canonical Huffman code.  The
       code lengths are lens[0..codes-1].  Each length corresponds to the
       symbols 0..codes-1.  The Huffman code is generated by first sorting the
       symbols by length from short to long, and retaining the symbol order
       for codes with equal lengths.  Then the code starts with all zero bits
       for the first code of the shortest length, and the codes are integer
       increments for the same length, and zeros are appended as the length
       increases.  For the deflate format, these bits are stored backwards
       from their more natural integer increment ordering, and so when the
       decoding tables are built in the large loop below, the integer codes
       are incremented backwards.

       This routine assumes, but does not check, that all of the entries in
       lens[] are in the range 0..MAXBITS.  The caller must assure this.
       1..MAXBITS is interpreted as that code length.  zero means that that
       symbol does not occur in this code.

       The codes are sorted by computing a count of codes for each length,
       creating from that a table of starting indices for each length in the
       sorted table, and then entering the symbols in order in the sorted
       table.  The sorted table is work[], with that space being provided by
       the caller.

       The length counts are used for other purposes as well, i.e. finding
       the minimum and maximum length codes, determining if there are any
       codes at all, checking for a valid set of lengths, and looking ahead
       at length counts to determine sub-table sizes when building the
       decoding tables.
     */

    /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
    for (len = 0; len <= MAXBITS; len++)
        count[len] = 0;
    for (sym = 0; sym < codes; sym++)
        count[lens[sym]]++;

    /* bound code lengths, force root to be within code lengths */
    root = *bits;
    for (max = MAXBITS; max >= 1; max--)
        if (count[max] != 0) break;
    if (root > max) root = max;
    if (max == 0) {                     /* no symbols to code at all */
        here.op = (unsigned char)64;    /* invalid code marker */
        here.bits = (unsigned char)1;
        here.val = (unsigned short)0;
        *(*table)++ = here;             /* make a table to force an error */
        *(*table)++ = here;
        *bits = 1;
        return 0;     /* no symbols, but wait for decoding to report error */
    }
    for (min = 1; min < max; min++)
        if (count[min] != 0) break;
    if (root < min) root = min;

    /* check for an over-subscribed or incomplete set of lengths */
    left = 1;
    for (len = 1; len <= MAXBITS; len++) {
        left <<= 1;
        left -= count[len];
        if (left < 0) return -1;        /* over-subscribed */
    }
    if (left > 0 && (type == CODES || max != 1))
        return -1;                      /* incomplete set */

    /* generate offsets into symbol table for each length for sorting */
    offs[1] = 0;
    for (len = 1; len < MAXBITS; len++)
        offs[len + 1] = offs[len] + count[len];

    /* sort symbols by length, by symbol order within each length */
    for (sym = 0; sym < codes; sym++)
        if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;

    /*
       Create and fill in decoding tables.  In this loop, the table being
       filled is at next and has curr index bits.  The code being used is huff
       with length len.  That code is converted to an index by dropping drop
       bits off of the bottom.  For codes where len is less than drop + curr,
       those top drop + curr - len bits are incremented through all values to
       fill the table with replicated entries.

       root is the number of index bits for the root table.  When len exceeds
       root, sub-tables are created pointed to by the root entry with an index
       of the low root bits of huff.  This is saved in low to check for when a
       new sub-table should be started.  drop is zero when the root table is
       being filled, and drop is root when sub-tables are being filled.

       When a new sub-table is needed, it is necessary to look ahead in the
       code lengths to determine what size sub-table is needed.  The length
       counts are used for this, and so count[] is decremented as codes are
       entered in the tables.

       used keeps track of how many table entries have been allocated from the
       provided *table space.  It is checked for LENS and DIST tables against
       the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
       the initial root table size constants.  See the comments in inftrees.h
       for more information.

       sym increments through all symbols, and the loop terminates when
       all codes of length max, i.e. all codes, have been processed.  This
       routine permits incomplete codes, so another loop after this one fills
       in the rest of the decoding tables with invalid code markers.
     */

    /* set up for code type */
    switch (type) {
    case CODES:
        base = extra = work;    /* dummy value--not used */
        end = 19;
        break;
    case LENS:
        base = lbase;
        base -= 257;
        extra = lext;
        extra -= 257;
        end = 256;
        break;
    default:            /* DISTS */
        base = dbase;
        extra = dext;
        end = -1;
    }

    /* initialize state for loop */
    huff = 0;                   /* starting code */
    sym = 0;                    /* starting code symbol */
    len = min;                  /* starting code length */
    next = *table;              /* current table to fill in */
    curr = root;                /* current table index bits */
    drop = 0;                   /* current bits to drop from code for index */
    low = (unsigned)(-1);       /* trigger new sub-table when len > root */
    used = 1U << root;          /* use root table entries */
    mask = used - 1;            /* mask for comparing low */

    /* check available table space */
    if ((type == LENS && used >= ENOUGH_LENS) ||
        (type == DISTS && used >= ENOUGH_DISTS))
        return 1;

    /* process all codes and make table entries */
    for (;;) {
        /* create table entry */
        here.bits = (unsigned char)(len - drop);
        if ((int)(work[sym]) < end) {
            here.op = (unsigned char)0;
            here.val = work[sym];
        }
        else if ((int)(work[sym]) > end) {
            here.op = (unsigned char)(extra[work[sym]]);
            here.val = base[work[sym]];
        }
        else {
            here.op = (unsigned char)(32 + 64);         /* end of block */
            here.val = 0;
        }

        /* replicate for those indices with low len bits equal to huff */
        incr = 1U << (len - drop);
        fill = 1U << curr;
        min = fill;                 /* save offset to next table */
        do {
            fill -= incr;
            next[(huff >> drop) + fill] = here;
        } while (fill != 0);

        /* backwards increment the len-bit code huff */
        incr = 1U << (len - 1);
        while (huff & incr)
            incr >>= 1;
        if (incr != 0) {
            huff &= incr - 1;
            huff += incr;
        }
        else
            huff = 0;

        /* go to next symbol, update count, len */
        sym++;
        if (--(count[len]) == 0) {
            if (len == max) break;
            len = lens[work[sym]];
        }

        /* create new sub-table if needed */
        if (len > root && (huff & mask) != low) {
            /* if first time, transition to sub-tables */
            if (drop == 0)
                drop = root;

            /* increment past last table */
            next += min;            /* here min is 1 << curr */

            /* determine length of next table */
            curr = len - drop;
            left = (int)(1 << curr);
            while (curr + drop < max) {
                left -= count[curr + drop];
                if (left <= 0) break;
                curr++;
                left <<= 1;
            }

            /* check for enough space */
            used += 1U << curr;
            if ((type == LENS && used >= ENOUGH_LENS) ||
                (type == DISTS && used >= ENOUGH_DISTS))
                return 1;

            /* point entry in root table to sub-table */
            low = huff & mask;
            (*table)[low].op = (unsigned char)curr;
            (*table)[low].bits = (unsigned char)root;
            (*table)[low].val = (unsigned short)(next - *table);
        }
    }

    /*
       Fill in rest of table for incomplete codes.  This loop is similar to the
       loop above in incrementing huff for table indices.  It is assumed that
       len is equal to curr + drop, so there is no loop needed to increment
       through high index bits.  When the current sub-table is filled, the loop
       drops back to the root table to fill in any remaining entries there.
     */
    here.op = (unsigned char)64;                /* invalid code marker */
    here.bits = (unsigned char)(len - drop);
    here.val = (unsigned short)0;
    while (huff != 0) {
        /* when done with sub-table, drop back to root table */
        if (drop != 0 && (huff & mask) != low) {
            drop = 0;
            len = root;
            next = *table;
            here.bits = (unsigned char)len;
        }

        /* put invalid code marker in table */
        next[huff >> drop] = here;

        /* backwards increment the len-bit code huff */
        incr = 1U << (len - 1);
        while (huff & incr)
            incr >>= 1;
        if (incr != 0) {
            huff &= incr - 1;
            huff += incr;
        }
        else
            huff = 0;
    }

    /* set return parameters */
    *table += used;
    *bits = root;
    return 0;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %r9, -0x70(%rsp)
movq %rcx, %r10
xorl %eax, %eax
cmpq $0x10, %rax
je 0x8989d
andw $0x0, -0x40(%rsp,%rax,2)
incq %rax
jmp 0x8988c
movl %edx, %ecx
xorl %eax, %eax
cmpq %rax, %rcx
je 0x898b4
movzwl (%rsi,%rax,2), %edx
incw -0x40(%rsp,%rdx,2)
incq %rax
jmp 0x898a1
movl (%r8), %r11d
movl $0xf, %eax
movl %eax, %r14d
subl $0x1, %eax
jb 0x898f8
movl %r14d, %edx
cmpw $0x0, -0x40(%rsp,%rdx,2)
je 0x898bc
movl $0x1, %ebx
cmpl %r14d, %r11d
cmovael %r14d, %r11d
movabsq $0x1, %r15
cmpq %r15, %rdx
je 0x89924
cmpw $0x0, -0x40(%rsp,%r15,2)
jne 0x89927
incq %r15
jmp 0x898e5
movq (%r10), %rax
leaq 0x4(%rax), %rcx
movq %rcx, (%r10)
movl $0x140, %ecx            # imm = 0x140
movl %ecx, (%rax)
movq (%r10), %rax
leaq 0x4(%rax), %rdx
movq %rdx, (%r10)
movl %ecx, (%rax)
movl $0x1, %ebp
movl %ebp, (%r8)
xorl %eax, %eax
jmp 0x89a56
movl %r14d, %r15d
cmpl %r15d, %r11d
cmovbel %r15d, %r11d
movabsq $0x1, %rdx
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
cmpq $0x10, %rdx
je 0x89958
addl %ebx, %ebx
movzwl -0x40(%rsp,%rdx,2), %r9d
incq %rdx
subl %r9d, %ebx
jns 0x8993d
jmp 0x89a56
testl %ebx, %ebx
je 0x89972
testl %edi, %edi
sete %r9b
cmpl $0x1, %r14d
setne %dl
orb %r9b, %dl
jne 0x89a56
andw $0x0, -0xe(%rsp)
xorl %eax, %eax
cmpq $0xe, %rax
je 0x89994
movzwl -0x3e(%rsp,%rax,2), %edx
addw -0xe(%rsp,%rax,2), %dx
movw %dx, -0xc(%rsp,%rax,2)
incq %rax
jmp 0x8997a
xorl %eax, %eax
cmpq %rax, %rcx
je 0x899c1
movzwl (%rsi,%rax,2), %edx
testq %rdx, %rdx
je 0x899bc
movzwl -0x10(%rsp,%rdx,2), %ebx
leal 0x1(%rbx), %r9d
movw %r9w, -0x10(%rsp,%rdx,2)
movq -0x70(%rsp), %rdx
movw %ax, (%rdx,%rbx,2)
incq %rax
jmp 0x89996
testl %edi, %edi
je 0x899f9
cmpl $0x1, %edi
jne 0x89a13
leaq 0x18eef(%rip), %rcx     # 0xa28c0
movq $-0x202, %rax           # imm = 0xFDFE
addq %rax, %rcx
movq %rcx, -0x58(%rsp)
leaq 0x18e99(%rip), %rcx     # 0xa2880
addq %rax, %rcx
movq %rcx, -0x60(%rsp)
movl $0x100, -0x78(%rsp)     # imm = 0x100
jmp 0x89a34
movl $0x13, %eax
movl %eax, -0x78(%rsp)
movq -0x70(%rsp), %rax
movq %rax, -0x60(%rsp)
movq %rax, -0x58(%rsp)
jmp 0x89a34
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
movl %eax, -0x78(%rsp)
leaq 0x18f1d(%rip), %rax     # 0xa2940
movq %rax, -0x58(%rsp)
leaq 0x18ed1(%rip), %rax     # 0xa2900
movq %rax, -0x60(%rsp)
movl $0x1, %eax
movl %eax, %edx
movl %r11d, %ecx
shll %cl, %edx
cmpl $0x1, %edi
jne 0x89a4b
cmpl $0x9, %r11d
ja 0x89a56
cmpl $0x2, %edi
jne 0x89a65
cmpl $0x9, %r11d
jbe 0x89a65
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl %edi, -0x50(%rsp)
movq %r8, -0x18(%rsp)
movq %rdx, -0x68(%rsp)
leal -0x1(%rdx), %eax
movl %eax, -0x74(%rsp)
movq %r10, -0x48(%rsp)
movq (%r10), %r13
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
movl $0x1, %r9d
xorl %r8d, %r8d
movl %r11d, %ecx
xorl %r10d, %r10d
xorl %r12d, %r12d
movl %eax, -0x7c(%rsp)
movl %r11d, -0x4c(%rsp)
shll %cl, %r9d
movl %r8d, %ecx
movq -0x70(%rsp), %rax
movzwl (%rax,%rcx,2), %r11d
movzwl %r11w, %ecx
cmpl %ecx, -0x78(%rsp)
jle 0x89ac0
xorl %edi, %edi
jmp 0x89adf
jge 0x89ad9
addl %ecx, %ecx
movq -0x58(%rsp), %rax
movb (%rax,%rcx), %dil
movq -0x60(%rsp), %rax
movzwl (%rax,%rcx), %r11d
jmp 0x89adf
movb $0x60, %dil
xorl %r11d, %r11d
movl %r15d, %ebx
subl %r10d, %ebx
movl $0xffffffff, %edx       # imm = 0xFFFFFFFF
movl %ebx, %ecx
shll %cl, %edx
movl %r12d, %ebp
movl %r10d, %ecx
shrl %cl, %ebp
addl %edx, %ebp
movl %r9d, %ecx
leal (%rcx,%rbp), %eax
movb %dil, (%r13,%rax,4)
movb %bl, 0x1(%r13,%rax,4)
movw %r11w, 0x2(%r13,%rax,4)
addl %edx, %ecx
jne 0x89afb
leal -0x1(%r15), %ecx
movl $0x1, %edx
shll %cl, %edx
movl -0x4c(%rsp), %ebp
movl %edx, %ecx
shrl %edx
testl %r12d, %ecx
jne 0x89b21
leal -0x1(%rcx), %eax
andl %r12d, %eax
addl %ecx, %eax
cmpl $0x1, %ecx
movl %eax, %r12d
movl $0x0, %eax
cmovbl %eax, %r12d
incl %r8d
movl %r15d, %eax
decw -0x40(%rsp,%rax,2)
jne 0x89b68
cmpl %r14d, %r15d
je 0x89c42
movl %r8d, %eax
movq -0x70(%rsp), %rcx
movzwl (%rcx,%rax,2), %eax
movzwl (%rsi,%rax,2), %r15d
cmpl %ebp, %r15d
jbe 0x89aa5
movl %r12d, %ebx
andl -0x74(%rsp), %ebx
cmpl -0x7c(%rsp), %ebx
je 0x89aa5
testl %r10d, %r10d
cmovel %ebp, %r10d
movl %r9d, %eax
leaq (%r13,%rax,4), %r13
movl %r15d, %ecx
subl %r10d, %ecx
movl $0x1, %edi
shll %cl, %edi
movl %r15d, %eax
cmpl %r14d, %eax
jae 0x89bb7
movl %eax, %ecx
movzwl -0x40(%rsp,%rcx,2), %ecx
subl %ecx, %edi
jle 0x89bb7
addl %edi, %edi
incl %eax
jmp 0x89ba1
movl -0x50(%rsp), %ecx
cmpl $0x2, %ecx
sete %r9b
cmpl $0x1, %ecx
sete -0x7c(%rsp)
movl %eax, %ecx
subl %r10d, %ecx
movl $0x1, %edi
shll %cl, %edi
movq -0x68(%rsp), %rdx
addl %edi, %edx
cmpl $0x354, %edx            # imm = 0x354
setae %r11b
movq %rdx, -0x68(%rsp)
cmpl $0x250, %edx            # imm = 0x250
setae %dil
testb %r11b, -0x7c(%rsp)
jne 0x89cc8
andb %dil, %r9b
jne 0x89cc8
movl %r10d, %edx
negb %dl
movzbl %dl, %edx
addl %eax, %edx
movq -0x48(%rsp), %rax
movq (%rax), %rax
movl %ebx, %edi
movb %dl, (%rax,%rdi,4)
movb %bpl, 0x1(%rax,%rdi,4)
movl %r13d, %edx
subl %eax, %edx
shrl $0x2, %edx
movw %dx, 0x2(%rax,%rdi,4)
movl %ebx, -0x7c(%rsp)
movl $0x1, %r9d
jmp 0x89aa2
movl $0x1, %eax
xorl %esi, %esi
movq -0x18(%rsp), %r8
movq -0x48(%rsp), %rdi
testl %r12d, %r12d
je 0x89cb8
testl %r10d, %r10d
je 0x89c77
movl %r12d, %ecx
andl -0x74(%rsp), %ecx
cmpl -0x7c(%rsp), %ecx
je 0x89c7a
movq (%rdi), %r13
movl %ebp, %r14d
xorl %r10d, %r10d
movl %ebp, %ebx
jmp 0x89c7a
xorl %r10d, %r10d
movl %r12d, %edx
movl %r10d, %ecx
shrl %cl, %edx
movb $0x40, (%r13,%rdx,4)
movb %bl, 0x1(%r13,%rdx,4)
andw $0x0, 0x2(%r13,%rdx,4)
leal -0x1(%r14), %ecx
movl %eax, %edx
shll %cl, %edx
movl %edx, %ecx
shrl %edx
testl %r12d, %ecx
jne 0x89c9c
leal -0x1(%rcx), %edx
andl %r12d, %edx
addl %ecx, %edx
cmpl $0x1, %ecx
cmovbl %esi, %edx
movl %edx, %r12d
jmp 0x89c53
movl -0x68(%rsp), %eax
shlq $0x2, %rax
addq %rax, (%rdi)
jmp 0x8991a
movl $0x1, %eax
jmp 0x89a56
nop