// File: /workspace/github_cpp_makefile_star2_O1/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 %rcx, %r10
xorps %xmm0, %xmm0
movaps %xmm0, -0x40(%rsp)
movaps %xmm0, -0x30(%rsp)
testl %edx, %edx
je 0x97c15
movl %edx, %eax
xorl %ecx, %ecx
movzwl (%rsi,%rcx,2), %r11d
incw -0x40(%rsp,%r11,2)
incq %rcx
cmpq %rcx, %rax
jne 0x97c02
movl (%r8), %r11d
cmpw $0x0, -0x22(%rsp)
je 0x97c29
movl $0xf, %eax
xorl %ecx, %ecx
jmp 0x97c4d
movl $0xe, %ebx
movl $0xe, %eax
subl $0x1, %eax
setb %cl
jb 0x97c4b
movl %ebx, %ebx
cmpw $0x0, -0x40(%rsp,%rbx,2)
movl %eax, %ebx
je 0x97c33
incl %eax
jmp 0x97c4d
xorl %eax, %eax
cmpl %eax, %r11d
cmovael %eax, %r11d
testb %cl, %cl
je 0x97c8f
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, %r11d
movl %r11d, (%r8)
xorl %eax, %eax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl %eax, %r15d
movl $0x1, %ecx
movl $0x1, %r14d
cmpl $0x2, %r15d
jb 0x97cbd
movl $0x1, %r14d
cmpw $0x0, -0x40(%rsp,%r14,2)
jne 0x97cbd
incq %r14
cmpq %r14, %r15
jne 0x97ca9
movl %r15d, %r14d
cmpl %r14d, %r11d
cmovbel %r14d, %r11d
movl $0x1, %ebx
addl %ecx, %ecx
movzwl -0x40(%rsp,%rbx,2), %eax
subl %eax, %ecx
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
js 0x97c80
incq %rbx
cmpq $0x10, %rbx
jne 0x97cc9
movq %r15, -0x70(%rsp)
movq %r8, -0x18(%rsp)
testl %ecx, %ecx
je 0x97cfb
testl %edi, %edi
je 0x97c80
cmpl $0x1, -0x70(%rsp)
jne 0x97c80
movw $0x0, -0xe(%rsp)
xorl %eax, %eax
xorl %ecx, %ecx
addw -0x3e(%rsp,%rax,2), %cx
movw %cx, -0xc(%rsp,%rax,2)
incq %rax
cmpq $0xe, %rax
jne 0x97d06
testl %edx, %edx
je 0x97d46
movl %edx, %eax
xorl %ecx, %ecx
movzwl (%rsi,%rcx,2), %edx
testq %rdx, %rdx
je 0x97d3e
movzwl -0x10(%rsp,%rdx,2), %ebx
leal 0x1(%rbx), %r8d
movw %r8w, -0x10(%rsp,%rdx,2)
movw %cx, (%r9,%rbx,2)
incq %rcx
cmpq %rcx, %rax
jne 0x97d21
testl %edi, %edi
je 0x97d7e
cmpl $0x1, %edi
jne 0x97d92
leaq 0x19e3a(%rip), %rcx     # 0xb1b90
movq $-0x202, %rax           # imm = 0xFDFE
addq %rax, %rcx
movq %rcx, -0x58(%rsp)
leaq 0x19de4(%rip), %rcx     # 0xb1b50
addq %rax, %rcx
movq %rcx, -0x60(%rsp)
movl $0x100, -0x78(%rsp)     # imm = 0x100
jmp 0x97db2
movl $0x13, -0x78(%rsp)
movq %r9, -0x60(%rsp)
movq %r9, -0x58(%rsp)
jmp 0x97db2
movl $0xffffffff, -0x78(%rsp) # imm = 0xFFFFFFFF
leaq 0x19e6f(%rip), %rax     # 0xb1c10
movq %rax, -0x58(%rsp)
leaq 0x19e23(%rip), %rax     # 0xb1bd0
movq %rax, -0x60(%rsp)
movl $0x1, %eax
movl $0x1, %edx
movl %r11d, %ecx
shll %cl, %edx
cmpl $0x1, %edi
jne 0x97dd0
cmpl $0x9, %r11d
ja 0x97c80
cmpl $0x2, %edi
jne 0x97ddf
cmpl $0x9, %r11d
ja 0x97c80
movl %edi, -0x7c(%rsp)
movq %rdx, -0x68(%rsp)
leal -0x1(%rdx), %eax
movl %eax, -0x74(%rsp)
movq %r10, -0x50(%rsp)
movq (%r10), %r13
movl $0xffffffff, -0x80(%rsp) # imm = 0xFFFFFFFF
xorl %r8d, %r8d
movl %r11d, %ecx
xorl %r10d, %r10d
xorl %r12d, %r12d
movq %r9, -0x48(%rsp)
movl $0x1, %ebp
shll %cl, %ebp
movl %r8d, %eax
movzwl (%r9,%rax,2), %ebx
movzwl %bx, %ecx
cmpl %ecx, -0x78(%rsp)
jle 0x97e2c
xorl %eax, %eax
jmp 0x97e47
jge 0x97e43
addl %ecx, %ecx
movq -0x58(%rsp), %rax
movb (%rax,%rcx), %al
movq -0x60(%rsp), %rdx
movzwl (%rdx,%rcx), %ebx
jmp 0x97e47
movb $0x60, %al
xorl %ebx, %ebx
movl %r14d, %edx
subl %r10d, %edx
movl $0xffffffff, %edi       # imm = 0xFFFFFFFF
movl %edx, %ecx
shll %cl, %edi
movl %r12d, %r15d
movl %r10d, %ecx
shrl %cl, %r15d
addl %edi, %r15d
movl %ebp, %ecx
leal (%r15,%rcx), %r9d
movb %al, (%r13,%r9,4)
movb %dl, 0x1(%r13,%r9,4)
movw %bx, 0x2(%r13,%r9,4)
addl %edi, %ecx
jne 0x97e64
leal -0x1(%r14), %ecx
movl $0x1, %edi
shll %cl, %edi
movl %edi, %eax
shrl %edi
testl %r12d, %eax
jne 0x97e87
leal -0x1(%rax), %ecx
andl %r12d, %ecx
addl %eax, %ecx
cmpl $0x1, %eax
movl %ecx, %r12d
movl $0x0, %eax
cmovbl %eax, %r12d
incl %r8d
movl %r14d, %eax
decw -0x40(%rsp,%rax,2)
movq -0x48(%rsp), %r9
jne 0x97ed1
cmpl -0x70(%rsp), %r14d
je 0x97fb3
movl %r8d, %eax
movzwl (%r9,%rax,2), %eax
movzwl (%rsi,%rax,2), %r14d
cmpl %r11d, %r14d
jbe 0x97e17
movl %r12d, %edx
andl -0x74(%rsp), %edx
cmpl -0x80(%rsp), %edx
je 0x97e17
testl %r10d, %r10d
cmovel %r11d, %r10d
movl %r14d, %ecx
subl %r10d, %ecx
movq -0x70(%rsp), %rdi
cmpl %edi, %r14d
jae 0x97f2d
movl $0x1, %eax
shll %cl, %eax
movl %edi, %ecx
subl %r10d, %ecx
movl %r14d, %ebx
movl %ebx, %edi
movzwl -0x40(%rsp,%rdi,2), %edi
subl %edi, %eax
jle 0x97f28
addl %eax, %eax
incl %ebx
cmpl -0x70(%rsp), %ebx
jb 0x97f11
jmp 0x97f2d
subl %r10d, %ebx
movl %ebx, %ecx
movl -0x7c(%rsp), %eax
cmpl $0x2, %eax
sete %r9b
cmpl $0x1, %eax
sete -0x80(%rsp)
movl $0x1, %ebx
shll %cl, %ebx
movl $0x1, %eax
movq -0x68(%rsp), %rdi
addl %ebx, %edi
cmpl $0x354, %edi            # imm = 0x354
setae %r15b
movq %rdi, -0x68(%rsp)
cmpl $0x250, %edi            # imm = 0x250
setae %bl
testb %r15b, -0x80(%rsp)
jne 0x97c80
andb %bl, %r9b
movq -0x50(%rsp), %rdi
movq -0x48(%rsp), %r9
jne 0x97c80
movl %ebp, %eax
leaq (%r13,%rax,4), %r13
movq (%rdi), %rax
movl %edx, %edi
movb %cl, (%rax,%rdi,4)
movb %r11b, 0x1(%rax,%rdi,4)
movl %r13d, %ebx
subl %eax, %ebx
shrl $0x2, %ebx
movw %bx, 0x2(%rax,%rdi,4)
movl %edx, -0x80(%rsp)
jmp 0x97e10
testl %r12d, %r12d
movq -0x18(%rsp), %r8
movq -0x50(%rsp), %r9
movq -0x68(%rsp), %rbx
je 0x98030
xorl %esi, %esi
testl %r10d, %r10d
je 0x97fe9
movl %r12d, %eax
andl -0x74(%rsp), %eax
cmpl -0x80(%rsp), %eax
je 0x97fec
movq (%r9), %r13
movl %r11d, %r14d
xorl %r10d, %r10d
movl %r11d, %edx
jmp 0x97fec
xorl %r10d, %r10d
movl %r12d, %eax
movl %r10d, %ecx
shrl %cl, %eax
movb $0x40, (%r13,%rax,4)
movb %dl, 0x1(%r13,%rax,4)
movw $0x0, 0x2(%r13,%rax,4)
leal -0x1(%r14), %ecx
movl $0x1, %edi
shll %cl, %edi
movl %edi, %eax
shrl %edi
testl %r12d, %eax
jne 0x98012
leal -0x1(%rax), %ecx
andl %r12d, %ecx
addl %eax, %ecx
cmpl $0x1, %eax
cmovbl %esi, %ecx
movl %ecx, %r12d
testl %ecx, %ecx
jne 0x97fc9
movl %ebx, %eax
shlq $0x2, %rax
addq %rax, (%r9)
jmp 0x97c7b
nop