// File: /workspace/github_cpp_makefile_star2_O3/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 $0x28, %rsp
movq %r9, -0x58(%rsp)
xorps %xmm0, %xmm0
movaps %xmm0, -0x30(%rsp)
movaps %xmm0, -0x20(%rsp)
testl %edx, %edx
je 0x972fc
movl %edx, %eax
xorl %r10d, %r10d
movzwl (%rsi,%r10,2), %r9d
incw -0x30(%rsp,%r9,2)
incq %r10
cmpq %r10, %rax
jne 0x972e9
movl (%r8), %r11d
movl $0xf, %r14d
movl %r14d, %eax
cmpw $0x0, -0x30(%rsp,%rax,2)
jne 0x9734c
decl %r14d
jne 0x97305
movq (%rcx), %rax
leaq 0x4(%rax), %rdx
movq %rdx, (%rcx)
movl $0x140, %esi            # imm = 0x140
movl %esi, (%rax)
movq (%rcx), %rax
leaq 0x4(%rax), %rdx
movq %rdx, (%rcx)
movl %esi, (%rax)
movl $0x1, %r13d
movl %r13d, (%r8)
xorl %eax, %eax
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
cmpl %r14d, %r11d
cmovael %r14d, %r11d
movl $0x1, %r10d
movl $0x1, %r15d
cmpl $0x2, %r14d
jb 0x9737f
movl $0x1, %r15d
cmpw $0x0, -0x30(%rsp,%r15,2)
jne 0x9737f
incq %r15
cmpq %r15, %rax
jne 0x9736b
movl %r14d, %r15d
cmpl %r15d, %r11d
cmovbel %r15d, %r11d
movl $0x1, %r9d
addl %r10d, %r10d
movzwl -0x30(%rsp,%r9,2), %eax
subl %eax, %r10d
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
js 0x9733d
incq %r9
cmpq $0x10, %r9
jne 0x9738c
movq %rcx, -0x50(%rsp)
movq %r8, -0x8(%rsp)
testl %r10d, %r10d
je 0x973cd
testl %edi, %edi
sete %cl
cmpl $0x1, %r14d
setne %r8b
orb %cl, %r8b
jne 0x9733d
movw $0x0, 0x2(%rsp)
xorl %eax, %eax
xorl %ecx, %ecx
addw -0x2e(%rsp,%rax,2), %cx
movw %cx, 0x4(%rsp,%rax,2)
incq %rax
cmpq $0xe, %rax
jne 0x973d8
testl %edx, %edx
je 0x9741c
movl %edx, %eax
xorl %ecx, %ecx
movzwl (%rsi,%rcx,2), %edx
testq %rdx, %rdx
je 0x97414
movzwl (%rsp,%rdx,2), %r8d
leal 0x1(%r8), %r10d
movw %r10w, (%rsp,%rdx,2)
movq -0x58(%rsp), %rdx
movw %cx, (%rdx,%r8,2)
incq %rcx
cmpq %rcx, %rax
jne 0x973f3
testl %edi, %edi
je 0x97475
cmpl $0x1, %edi
jne 0x976e9
movl $0x1, %eax
cmpl $0x9, %r11d
ja 0x9733d
leaq 0x1a7a1(%rip), %rcx     # 0xb1be0
movq $-0x202, %rax           # imm = 0xFDFE
addq %rax, %rcx
movq %rcx, -0x40(%rsp)
leaq 0x1a74b(%rip), %rcx     # 0xb1ba0
addq %rax, %rcx
movq %rcx, -0x48(%rsp)
movb $0x1, %al
movl %eax, -0x70(%rsp)
movl $0x100, -0x68(%rsp)     # imm = 0x100
movl $0x0, -0x74(%rsp)
jmp 0x9749c
movl $0x13, -0x68(%rsp)
movl $0x0, -0x74(%rsp)
movq -0x58(%rsp), %rax
movq %rax, -0x48(%rsp)
movq %rax, -0x40(%rsp)
movl $0x0, -0x70(%rsp)
movl $0x1, %eax
movl %r11d, %ecx
shll %cl, %eax
movq %rax, -0x60(%rsp)
decl %eax
movl %eax, -0x64(%rsp)
movq -0x50(%rsp), %rax
movq (%rax), %r12
movl $0xffffffff, -0x6c(%rsp) # imm = 0xFFFFFFFF
xorl %edx, %edx
movl %r11d, %ecx
xorl %edi, %edi
xorl %ebx, %ebx
movl %r11d, -0x34(%rsp)
movl $0x1, %r9d
shll %cl, %r9d
movl %edx, %eax
movq -0x58(%rsp), %rcx
movzwl (%rcx,%rax,2), %ebp
movzwl %bp, %ecx
cmpl %ecx, -0x68(%rsp)
jle 0x974f0
xorl %eax, %eax
jmp 0x9750c
jge 0x97508
addl %ecx, %ecx
movq -0x40(%rsp), %rax
movb (%rax,%rcx), %al
movq -0x48(%rsp), %r8
movzwl (%r8,%rcx), %ebp
jmp 0x9750c
movb $0x60, %al
xorl %ebp, %ebp
movl %r15d, %r10d
subl %edi, %r10d
movl $0xffffffff, %r11d      # imm = 0xFFFFFFFF
movl %r10d, %ecx
shll %cl, %r11d
movl %ebx, %r8d
movl %edi, %ecx
shrl %cl, %r8d
addl %r11d, %r8d
movl %r9d, %ecx
leal (%r8,%rcx), %r13d
movb %al, (%r12,%r13,4)
movb %r10b, 0x1(%r12,%r13,4)
movw %bp, 0x2(%r12,%r13,4)
addl %r11d, %ecx
jne 0x9752c
leal -0x1(%r15), %ecx
movl $0x1, %r8d
shll %cl, %r8d
movl %r8d, %eax
shrl %r8d
testl %ebx, %eax
jne 0x97551
leal -0x1(%rax), %ebp
andl %ebx, %ebp
addl %eax, %ebp
cmpl $0x1, %eax
movl %ebp, %ebx
movl $0x0, %eax
cmovbl %eax, %ebx
incl %edx
movl %r15d, %eax
decw -0x30(%rsp,%rax,2)
movl -0x34(%rsp), %r13d
jne 0x97599
cmpl %r14d, %r15d
je 0x97672
movl %edx, %eax
movq -0x58(%rsp), %rcx
movzwl (%rcx,%rax,2), %eax
movzwl (%rsi,%rax,2), %r15d
cmpl %r13d, %r15d
jbe 0x974d8
movl %ebx, %r10d
andl -0x64(%rsp), %r10d
cmpl -0x6c(%rsp), %r10d
je 0x974d8
testl %edi, %edi
cmovel %r13d, %edi
movl %r15d, %ecx
subl %edi, %ecx
movl $0x1, %eax
shll %cl, %eax
cmpl %r14d, %r15d
jae 0x975f3
movl %r14d, %ecx
subl %edi, %ecx
movl %r15d, %r11d
movq -0x60(%rsp), %rbp
movl %r11d, %r8d
movzwl -0x30(%rsp,%r8,2), %r8d
subl %r8d, %eax
jle 0x975fa
addl %eax, %eax
incl %r11d
cmpl %r14d, %r11d
jb 0x975d9
jmp 0x97600
movq -0x60(%rsp), %rbp
jmp 0x97607
subl %edi, %r11d
movl %r11d, %ecx
movl $0x1, %eax
shll %cl, %eax
addl %eax, %ebp
cmpl $0x354, %ebp            # imm = 0x354
setae %r11b
cmpl $0x250, %ebp            # imm = 0x250
setae %r8b
movl $0x1, %eax
testb %r11b, -0x70(%rsp)
jne 0x9733d
andb -0x74(%rsp), %r8b
jne 0x9733d
movq %rbp, -0x60(%rsp)
movl %r9d, %eax
leaq (%r12,%rax,4), %r12
movq -0x50(%rsp), %rax
movq (%rax), %rax
movl %r10d, %r8d
movb %cl, (%rax,%r8,4)
movb %r13b, 0x1(%rax,%r8,4)
movl %r12d, %r9d
subl %eax, %r9d
shrl $0x2, %r9d
movw %r9w, 0x2(%rax,%r8,4)
movl %r10d, -0x6c(%rsp)
jmp 0x974cf
testl %ebx, %ebx
movq -0x8(%rsp), %r8
movq -0x50(%rsp), %rsi
je 0x976d9
testl %edi, %edi
je 0x9769d
movl %ebp, %eax
andl -0x64(%rsp), %eax
cmpl -0x6c(%rsp), %eax
je 0x9769f
movq (%rsi), %r12
movl %r13d, %r14d
xorl %edi, %edi
movl %r13d, %r10d
jmp 0x9769f
xorl %edi, %edi
movl %ebp, %eax
movl %edi, %ecx
shrl %cl, %eax
movb $0x40, (%r12,%rax,4)
movb %r10b, 0x1(%r12,%rax,4)
movw $0x0, 0x2(%r12,%rax,4)
leal -0x1(%r14), %ecx
movl $0x1, %edx
shll %cl, %edx
movl %edx, %eax
shrl %edx
testl %ebp, %eax
jne 0x976c2
movl %eax, %ecx
subl $0x1, %ecx
jb 0x976d9
andl %ebp, %ecx
addl %eax, %ecx
movl %ecx, %ebp
jne 0x97680
movl -0x60(%rsp), %eax
shlq $0x2, %rax
addq %rax, (%rsi)
jmp 0x97338
movl $0x0, -0x70(%rsp)
movl $0xffffffff, -0x68(%rsp) # imm = 0xFFFFFFFF
leaq 0x1a560(%rip), %rax     # 0xb1c60
movq %rax, -0x40(%rsp)
leaq 0x1a514(%rip), %rax     # 0xb1c20
movq %rax, -0x48(%rsp)
cmpl $0x2, %edi
sete %al
movl %eax, -0x74(%rsp)
jne 0x9749c
movl $0x1, %eax
cmpl $0x9, %r11d
ja 0x9733d
jmp 0x9749c
nopl (%rax)