// File: /workspace/github_c_makefile_star2_O1/Cyan4973[P]FiniteStateEntropy/programs/zlibh.c
// Function: inflate_table
int inflate_table(codetype type, unsigned short * lens, unsigned codes, code * *table, unsigned *bits, unsigned short *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 low;               /* low bits for current root entry */
    unsigned mask;              /* mask for low root bits */
    code here;                  /* table entry for duplication */
    code *next;             /* next available space in table */
    const unsigned short *base;     /* base value table to use */
    const unsigned short *extra;    /* extra bits table to use */
    int end;                    /* use base and extra for symbol > end */
    unsigned short count[ZLIBH_MAX_BITS+1];    /* number of codes of each length */
    unsigned short offs[ZLIBH_MAX_BITS+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, 72, 78};
    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..ZLIBH_MAX_BITS.  The caller must assure this.
    1..ZLIBH_MAX_BITS 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..ZLIBH_MAX_BITS) */
    for (len = 0; len <= ZLIBH_MAX_BITS; 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 = ZLIBH_MAX_BITS; 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 <= ZLIBH_MAX_BITS; 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 < ZLIBH_MAX_BITS; 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;
    case DISTS:
    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 (;;) {
        unsigned fill;              /* index for replicating entries */

        /* 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 remaining table entry if code is incomplete (guaranteed to have
    at most one remaining entry, since if the code is incomplete, the
    maximum code length that was allowed to get this far is one bit) */
    if (huff != 0) {
        here.op = (unsigned char)64;            /* invalid code marker */
        here.bits = (unsigned char)(len - drop);
        here.val = (unsigned short)0;
        next[huff] = here;
    }

    /* 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 0x66c3
movl %edx, %eax
xorl %ecx, %ecx
movzwl (%rsi,%rcx,2), %r11d
incw -0x40(%rsp,%r11,2)
incq %rcx
cmpq %rcx, %rax
jne 0x66b0
movl (%r8), %ecx
cmpw $0x0, -0x22(%rsp)
je 0x66d7
movl $0xf, %eax
xorl %ebx, %ebx
jmp 0x66ff
movl $0xe, %r11d
movl $0xe, %eax
subl $0x1, %eax
setb %bl
jb 0x66fd
movl %r11d, %r11d
cmpw $0x0, -0x40(%rsp,%r11,2)
movl %eax, %r11d
je 0x66e2
incl %eax
jmp 0x66ff
xorl %eax, %eax
cmpl %eax, %ecx
cmovael %eax, %ecx
testb %bl, %bl
je 0x673e
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, %ebx
movl %ebx, (%r8)
xorl %eax, %eax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl %eax, %r12d
movl $0x1, %ebx
movl $0x1, %r15d
cmpl $0x2, %r12d
jb 0x676c
movl $0x1, %r15d
cmpw $0x0, -0x40(%rsp,%r15,2)
jne 0x676c
incq %r15
cmpq %r15, %r12
jne 0x6758
movl %r12d, %r15d
cmpl %r15d, %ecx
cmovbel %r15d, %ecx
movl $0x1, %r11d
addl %ebx, %ebx
movzwl -0x40(%rsp,%r11,2), %eax
subl %eax, %ebx
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
js 0x672f
incq %r11
cmpq $0x10, %r11
jne 0x6779
testl %ebx, %ebx
je 0x67a1
testl %edi, %edi
je 0x672f
cmpl $0x1, %r12d
jne 0x672f
movw $0x0, -0xe(%rsp)
xorl %eax, %eax
xorl %r11d, %r11d
addw -0x3e(%rsp,%rax,2), %r11w
movw %r11w, -0xc(%rsp,%rax,2)
incq %rax
cmpq $0xe, %rax
jne 0x67ad
testl %edx, %edx
je 0x67f0
movl %edx, %eax
xorl %ebx, %ebx
movzwl (%rsi,%rbx,2), %edx
testq %rdx, %rdx
je 0x67e8
movzwl -0x10(%rsp,%rdx,2), %r14d
leal 0x1(%r14), %r11d
movw %r11w, -0x10(%rsp,%rdx,2)
movw %bx, (%r9,%r14,2)
incq %rbx
cmpq %rbx, %rax
jne 0x67ca
testl %edi, %edi
je 0x6828
cmpl $0x1, %edi
jne 0x683c
leaq 0xcaf0(%rip), %rdx      # 0x132f0
movq $-0x202, %rax           # imm = 0xFDFE
addq %rax, %rdx
movq %rdx, -0x60(%rsp)
leaq 0xca9a(%rip), %rdx      # 0x132b0
addq %rax, %rdx
movq %rdx, -0x68(%rsp)
movl $0x100, -0x74(%rsp)     # imm = 0x100
jmp 0x685c
movl $0x13, -0x74(%rsp)
movq %r9, -0x68(%rsp)
movq %r9, -0x60(%rsp)
jmp 0x685c
movl $0xffffffff, -0x74(%rsp) # imm = 0xFFFFFFFF
leaq 0xcb25(%rip), %rax      # 0x13370
movq %rax, -0x60(%rsp)
leaq 0xcad9(%rip), %rax      # 0x13330
movq %rax, -0x68(%rsp)
movl $0x1, %eax
movl $0x1, %edx
shll %cl, %edx
cmpl $0x1, %edi
jne 0x6876
cmpl $0x9, %ecx
ja 0x672f
cmpl $0x2, %edi
jne 0x6884
cmpl $0x9, %ecx
ja 0x672f
movl %edi, -0x50(%rsp)
movq %r8, -0x20(%rsp)
movq %rdx, -0x58(%rsp)
leal -0x1(%rdx), %eax
movl %eax, -0x4c(%rsp)
movq %r10, -0x48(%rsp)
movq (%r10), %r13
movl $0xffffffff, %r14d      # imm = 0xFFFFFFFF
xorl %edx, %edx
movl %ecx, -0x7c(%rsp)
xorl %r11d, %r11d
xorl %ebp, %ebp
movq %r9, -0x18(%rsp)
movl %ecx, -0x6c(%rsp)
movl %r14d, -0x70(%rsp)
movl %edx, %eax
movzwl (%r9,%rax,2), %r14d
movzwl %r14w, %eax
cmpl %eax, -0x74(%rsp)
jle 0x68d8
movl %edx, %r9d
xorl %edi, %edi
jmp 0x68fa
movl %edx, %r9d
jge 0x68f4
addl %eax, %eax
movq -0x60(%rsp), %rcx
movb (%rcx,%rax), %dil
movq -0x68(%rsp), %rcx
movzwl (%rcx,%rax), %r14d
jmp 0x68fa
movb $0x60, %dil
xorl %r14d, %r14d
movl %r15d, %eax
subl %r11d, %eax
movl $0xffffffff, %r10d      # imm = 0xFFFFFFFF
movl %eax, %ecx
shll %cl, %r10d
movl $0x1, %r8d
movl -0x7c(%rsp), %ecx
shll %cl, %r8d
movl %ebp, %edx
movl %r11d, %ebx
movl %r11d, %ecx
shrl %cl, %edx
addl %r10d, %edx
movl %r8d, %ecx
leal (%rdx,%rcx), %r11d
movb %dil, (%r13,%r11,4)
movb %al, 0x1(%r13,%r11,4)
movw %r14w, 0x2(%r13,%r11,4)
addl %r10d, %ecx
jne 0x6928
leal -0x1(%r15), %ecx
movl $0x1, %edx
shll %cl, %edx
movl %edx, %eax
shrl %edx
testl %ebp, %eax
jne 0x694c
leal -0x1(%rax), %ecx
andl %ebp, %ecx
addl %eax, %ecx
cmpl $0x1, %eax
movl %ecx, %ebp
movl $0x0, %eax
cmovbl %eax, %ebp
movl %r9d, %edx
incl %edx
movl %r15d, %eax
decw -0x40(%rsp,%rax,2)
movq -0x18(%rsp), %r9
movl -0x70(%rsp), %ecx
jne 0x69a5
movl $0x18, %eax
cmpl %r12d, %r15d
jne 0x6999
movl %ecx, %r14d
movl %ebx, %r11d
movl -0x6c(%rsp), %ebx
jmp 0x6a9a
movl %edx, %eax
movzwl (%r9,%rax,2), %eax
movzwl (%rsi,%rax,2), %r15d
movl %ebx, %r11d
xorl %eax, %eax
movl -0x6c(%rsp), %ebx
cmpl %ebx, %r15d
jbe 0x69c0
movl %ebp, %r14d
andl -0x4c(%rsp), %r14d
cmpl %ecx, %r14d
jne 0x69c8
movl %ecx, %r14d
jmp 0x6a9a
movl %edx, -0x78(%rsp)
testl %r11d, %r11d
cmovel %ebx, %r11d
movl %r15d, %ecx
subl %r11d, %ecx
cmpl %r12d, %r15d
jae 0x6a0a
movl $0x1, %edi
shll %cl, %edi
movl %r12d, %ecx
subl %r11d, %ecx
movl %ecx, -0x7c(%rsp)
movl %r15d, %ecx
movzwl -0x40(%rsp,%rcx,2), %edx
subl %edx, %edi
jle 0x6a07
addl %edi, %edi
incq %rcx
cmpl %r12d, %ecx
jb 0x69f2
jmp 0x6a0e
subl %r11d, %ecx
movl %ecx, -0x7c(%rsp)
movl -0x50(%rsp), %ecx
cmpl $0x2, %ecx
sete %dl
cmpl $0x1, %ecx
sete %dil
movl $0x1, %r10d
movl -0x7c(%rsp), %ecx
shll %cl, %r10d
movl %r8d, %ecx
leaq (%r13,%rcx,4), %r13
movq -0x58(%rsp), %rcx
addl %r10d, %ecx
cmpl $0x355, %ecx            # imm = 0x355
setae %r8b
movq %rcx, -0x58(%rsp)
cmpl $0x251, %ecx            # imm = 0x251
setae %cl
testb %r8b, %dil
jne 0x6a8c
andb %cl, %dl
movl -0x70(%rsp), %ecx
jne 0x6a87
movq -0x48(%rsp), %rcx
movq (%rcx), %rcx
movl %r14d, %edx
movl -0x7c(%rsp), %edi
movb %dil, (%rcx,%rdx,4)
movb %bl, 0x1(%rcx,%rdx,4)
movl %r13d, %edi
subl %ecx, %edi
shrl $0x2, %edi
movw %di, 0x2(%rcx,%rdx,4)
jmp 0x6a96
movl %ecx, %r14d
jmp 0x6a91
movl -0x70(%rsp), %r14d
movl $0x1, %eax
movl -0x78(%rsp), %edx
testl %eax, %eax
je 0x68bb
cmpl $0x18, %eax
jne 0x6add
testl %ebp, %ebp
je 0x6ac3
subl %r11d, %r15d
movl %ebp, %eax
movb $0x40, (%r13,%rax,4)
movb %r15b, 0x1(%r13,%rax,4)
movw $0x0, 0x2(%r13,%rax,4)
movl -0x58(%rsp), %eax
shlq $0x2, %rax
movq -0x48(%rsp), %rcx
addq %rax, (%rcx)
movq -0x20(%rsp), %r8
jmp 0x672a
movl $0x1, %eax
jmp 0x672f