// File: /workspace/github_cpp_makefile_star2_O2/sisong[P]ApkDiffPatch/zlib1.3.1/inftrees.c
// Function: inflate_table
int ZLIB_INTERNAL inflate_table(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 */
    unsigned match;             /* use base and extra for symbol >= match */
    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, 203, 77};
    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 */
        match = 20;
        break;
    case LENS:
        base = lbase;
        extra = lext;
        match = 257;
        break;
    default:    /* DISTS */
        base = dbase;
        extra = dext;
        match = 0;
    }

    /* 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 (work[sym] + 1U < match) {
            here.op = (unsigned char)0;
            here.val = work[sym];
        }
        else if (work[sym] >= match) {
            here.op = (unsigned char)(extra[work[sym] - match]);
            here.val = base[work[sym] - match];
        }
        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
xorl %eax, %eax
cmpq $0x10, %rax
je 0x46f50
andw $0x0, -0x40(%rsp,%rax,2)
incq %rax
jmp 0x46f3f
movl %edx, %ecx
xorl %eax, %eax
cmpq %rax, %rcx
je 0x46f67
movzwl (%rsi,%rax,2), %edx
incw -0x40(%rsp,%rdx,2)
incq %rax
jmp 0x46f54
movl (%r8), %r15d
movl $0xf, %eax
movl %eax, %ebp
subl $0x1, %eax
jb 0x46fa9
movl %ebp, %edx
cmpw $0x0, -0x40(%rsp,%rdx,2)
je 0x46f6f
movl $0x1, %ebx
cmpl %ebp, %r15d
cmovael %ebp, %r15d
movabsq $0x1, %r14
cmpq %r14, %rdx
je 0x46fd5
cmpw $0x0, -0x40(%rsp,%r14,2)
jne 0x46fd8
incq %r14
jmp 0x46f96
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, %edx
movl %edx, (%r8)
xorl %eax, %eax
jmp 0x470de
movl %ebp, %r14d
cmpl %r14d, %r15d
cmovbel %r14d, %r15d
movabsq $0x1, %r11
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
cmpq $0x10, %r11
je 0x47008
addl %ebx, %ebx
movzwl -0x40(%rsp,%r11,2), %edx
incq %r11
subl %edx, %ebx
jns 0x46fee
jmp 0x470de
testl %ebx, %ebx
je 0x47021
testl %edi, %edi
sete %r11b
cmpl $0x1, %ebp
setne %dl
orb %r11b, %dl
jne 0x470de
andw $0x0, -0xe(%rsp)
xorl %eax, %eax
cmpq $0xe, %rax
je 0x47043
movzwl -0x3e(%rsp,%rax,2), %edx
addw -0xe(%rsp,%rax,2), %dx
movw %dx, -0xc(%rsp,%rax,2)
incq %rax
jmp 0x47029
xorl %eax, %eax
cmpq %rax, %rcx
je 0x4706c
movzwl (%rsi,%rax,2), %edx
testq %rdx, %rdx
je 0x47067
movzwl -0x10(%rsp,%rdx,2), %ebx
leal 0x1(%rbx), %r11d
movw %r11w, -0x10(%rsp,%rdx,2)
movw %ax, (%r9,%rbx,2)
incq %rax
jmp 0x47045
testl %edi, %edi
je 0x4708f
cmpl $0x1, %edi
jne 0x470a0
movl $0x101, %edx            # imm = 0x101
leaq 0x13fff(%rip), %rax     # 0x5b080
movq %rax, -0x60(%rsp)
leaq 0x13fb3(%rip), %rax     # 0x5b040
jmp 0x470b5
movl $0x14, %edx
movq %r9, -0x68(%rsp)
movq %r9, -0x60(%rsp)
jmp 0x470ba
xorl %edx, %edx
leaq 0x14057(%rip), %rax     # 0x5b100
movq %rax, -0x60(%rsp)
leaq 0x1400b(%rip), %rax     # 0x5b0c0
movq %rax, -0x68(%rsp)
movl $0x1, %eax
movl %eax, %r11d
movl %r15d, %ecx
shll %cl, %r11d
cmpl $0x1, %edi
jne 0x470d3
cmpl $0x9, %r15d
ja 0x470de
cmpl $0x2, %edi
jne 0x470ed
cmpl $0x9, %r15d
jbe 0x470ed
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl %edx, -0x4c(%rsp)
movl %edi, -0x54(%rsp)
movq %r8, -0x20(%rsp)
movq %r11, -0x70(%rsp)
leal -0x1(%r11), %eax
movl %eax, -0x50(%rsp)
movq %r10, -0x48(%rsp)
movq (%r10), %r13
movl $0xffffffff, %edx       # imm = 0xFFFFFFFF
movl $0x1, %eax
xorl %r12d, %r12d
movl %r15d, %ecx
xorl %r11d, %r11d
xorl %edi, %edi
movl %edx, -0x78(%rsp)
movq %r9, -0x18(%rsp)
movl %r15d, -0x74(%rsp)
shll %cl, %eax
movl %r12d, %ecx
movzwl (%r9,%rcx,2), %r10d
movzwl %r10w, %ecx
leal 0x1(%rcx), %edx
movl -0x4c(%rsp), %r8d
cmpl %r8d, %edx
jae 0x47152
xorl %r15d, %r15d
jmp 0x47172
subl %r8d, %ecx
jae 0x4715f
movb $0x60, %r15b
xorl %r10d, %r10d
jmp 0x47172
movq -0x60(%rsp), %rdx
movb (%rdx,%rcx,2), %r15b
movq -0x68(%rsp), %rdx
movzwl (%rdx,%rcx,2), %r10d
movl %r14d, %ebx
subl %r11d, %ebx
movl $0xffffffff, %r8d       # imm = 0xFFFFFFFF
movl %ebx, %ecx
shll %cl, %r8d
movl %edi, %edx
movl %r11d, %ecx
shrl %cl, %edx
addl %r8d, %edx
movl %eax, %ecx
leal (%rdx,%rcx), %r9d
movb %r15b, (%r13,%r9,4)
movb %bl, 0x1(%r13,%r9,4)
movw %r10w, 0x2(%r13,%r9,4)
addl %r8d, %ecx
jne 0x4718f
leal -0x1(%r14), %ecx
movl $0x1, %edx
shll %cl, %edx
movl %edx, %ecx
shrl %edx
testl %edi, %ecx
jne 0x471b3
leal -0x1(%rcx), %edx
andl %edi, %edx
addl %ecx, %edx
cmpl $0x1, %ecx
movl %edx, %edi
movl $0x0, %ecx
cmovbl %ecx, %edi
incl %r12d
movl %r14d, %ecx
decw -0x40(%rsp,%rcx,2)
movq -0x18(%rsp), %r9
movl -0x74(%rsp), %edx
jne 0x471fb
cmpl %ebp, %r14d
je 0x472d7
movl %r12d, %ecx
movzwl (%r9,%rcx,2), %ecx
movzwl (%rsi,%rcx,2), %r14d
cmpl %edx, %r14d
jbe 0x47134
movl %edi, %ebx
andl -0x50(%rsp), %ebx
cmpl -0x78(%rsp), %ebx
je 0x47134
testl %r11d, %r11d
cmovel %edx, %r11d
movl %eax, %eax
leaq (%r13,%rax,4), %r13
movl %r14d, %ecx
subl %r11d, %ecx
movl $0x1, %r10d
shll %cl, %r10d
movl %r14d, %eax
cmpl %ebp, %eax
jae 0x4724b
movl %eax, %ecx
movzwl -0x40(%rsp,%rcx,2), %ecx
subl %ecx, %r10d
jle 0x4724b
addl %r10d, %r10d
incl %eax
jmp 0x47234
movl -0x54(%rsp), %ecx
cmpl $0x2, %ecx
sete %r15b
cmpl $0x1, %ecx
sete -0x78(%rsp)
movl %eax, %ecx
subl %r11d, %ecx
movl $0x1, %r8d
shll %cl, %r8d
movq -0x70(%rsp), %rdx
addl %r8d, %edx
cmpl $0x355, %edx            # imm = 0x355
setae %r10b
movq %rdx, -0x70(%rsp)
cmpl $0x251, %edx            # imm = 0x251
setae %r8b
testb %r10b, -0x78(%rsp)
jne 0x47309
andb %r8b, %r15b
jne 0x47309
movl %r11d, %edx
negb %dl
movzbl %dl, %edx
addl %eax, %edx
movq -0x48(%rsp), %rax
movq (%rax), %rax
movl %ebx, %r8d
movb %dl, (%rax,%r8,4)
movl -0x74(%rsp), %edx
movb %dl, 0x1(%rax,%r8,4)
movl %r13d, %edx
subl %eax, %edx
shrl $0x2, %edx
movw %dx, 0x2(%rax,%r8,4)
movl %ebx, -0x78(%rsp)
movl $0x1, %eax
jmp 0x47132
testl %edi, %edi
je 0x472ef
movl %edi, %eax
movb $0x40, (%r13,%rax,4)
movb %bl, 0x1(%r13,%rax,4)
andw $0x0, 0x2(%r13,%rax,4)
movl -0x70(%rsp), %eax
shlq $0x2, %rax
movq -0x48(%rsp), %rcx
addq %rax, (%rcx)
movq -0x20(%rsp), %r8
jmp 0x46fcb
movl $0x1, %eax
jmp 0x470de
nop