// File: /workspace/github_c_makefile_star2_O0/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
movq %rsp, %rbp
subq $0x60, %rsp
movl %edi, -0x8(%rbp)
movq %rsi, -0x10(%rbp)
movl %edx, -0x14(%rbp)
movq %rcx, -0x20(%rbp)
movq %r8, -0x28(%rbp)
movq %r9, -0x30(%rbp)
movl $0x0, -0x34(%rbp)
cmpl $0xf, -0x34(%rbp)
ja 0xcf03
movl -0x34(%rbp), %eax
movw $0x0, -0xb0(%rbp,%rax,2)
movl -0x34(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x34(%rbp)
jmp 0xcee5
movl $0x0, -0x38(%rbp)
movl -0x38(%rbp), %eax
cmpl -0x14(%rbp), %eax
jae 0xcf3c
movq -0x10(%rbp), %rax
movl -0x38(%rbp), %ecx
movzwl (%rax,%rcx,2), %eax
movw -0xb0(%rbp,%rax,2), %cx
addw $0x1, %cx
movw %cx, -0xb0(%rbp,%rax,2)
movl -0x38(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x38(%rbp)
jmp 0xcf0a
movq -0x28(%rbp), %rax
movl (%rax), %eax
movl %eax, -0x44(%rbp)
movl $0xf, -0x40(%rbp)
cmpl $0x1, -0x40(%rbp)
jb 0xcf71
movl -0x40(%rbp), %eax
movzwl -0xb0(%rbp,%rax,2), %eax
cmpl $0x0, %eax
je 0xcf64
jmp 0xcf71
jmp 0xcf66
movl -0x40(%rbp), %eax
addl $-0x1, %eax
movl %eax, -0x40(%rbp)
jmp 0xcf4c
movl -0x44(%rbp), %eax
cmpl -0x40(%rbp), %eax
jbe 0xcf7f
movl -0x40(%rbp), %eax
movl %eax, -0x44(%rbp)
cmpl $0x0, -0x40(%rbp)
jne 0xcfd5
movb $0x40, -0x68(%rbp)
movb $0x1, -0x67(%rbp)
movw $0x0, -0x66(%rbp)
movq -0x20(%rbp), %rcx
movq (%rcx), %rax
movq %rax, %rdx
addq $0x4, %rdx
movq %rdx, (%rcx)
movl -0x68(%rbp), %ecx
movl %ecx, (%rax)
movq -0x20(%rbp), %rcx
movq (%rcx), %rax
movq %rax, %rdx
addq $0x4, %rdx
movq %rdx, (%rcx)
movl -0x68(%rbp), %ecx
movl %ecx, (%rax)
movq -0x28(%rbp), %rax
movl $0x1, (%rax)
movl $0x0, -0x4(%rbp)
jmp 0xd520
movl $0x1, -0x3c(%rbp)
movl -0x3c(%rbp), %eax
cmpl -0x40(%rbp), %eax
jae 0xd003
movl -0x3c(%rbp), %eax
movzwl -0xb0(%rbp,%rax,2), %eax
cmpl $0x0, %eax
je 0xcff6
jmp 0xd003
jmp 0xcff8
movl -0x3c(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x3c(%rbp)
jmp 0xcfdc
movl -0x44(%rbp), %eax
cmpl -0x3c(%rbp), %eax
jae 0xd011
movl -0x3c(%rbp), %eax
movl %eax, -0x44(%rbp)
movl $0x1, -0x50(%rbp)
movl $0x1, -0x34(%rbp)
cmpl $0xf, -0x34(%rbp)
ja 0xd05f
movl -0x50(%rbp), %eax
shll %eax
movl %eax, -0x50(%rbp)
movl -0x34(%rbp), %eax
movzwl -0xb0(%rbp,%rax,2), %ecx
movl -0x50(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x50(%rbp)
cmpl $0x0, -0x50(%rbp)
jge 0xd052
movl $0xffffffff, -0x4(%rbp) # imm = 0xFFFFFFFF
jmp 0xd520
jmp 0xd054
movl -0x34(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x34(%rbp)
jmp 0xd01f
cmpl $0x0, -0x50(%rbp)
jle 0xd07d
cmpl $0x0, -0x8(%rbp)
je 0xd071
cmpl $0x1, -0x40(%rbp)
je 0xd07d
movl $0xffffffff, -0x4(%rbp) # imm = 0xFFFFFFFF
jmp 0xd520
movw $0x0, -0xce(%rbp)
movl $0x1, -0x34(%rbp)
cmpl $0xf, -0x34(%rbp)
jae 0xd0c9
movl -0x34(%rbp), %eax
movzwl -0xd0(%rbp,%rax,2), %eax
movl -0x34(%rbp), %ecx
movzwl -0xb0(%rbp,%rcx,2), %ecx
addl %ecx, %eax
movw %ax, %cx
movl -0x34(%rbp), %eax
addl $0x1, %eax
movl %eax, %eax
movw %cx, -0xd0(%rbp,%rax,2)
movl -0x34(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x34(%rbp)
jmp 0xd08d
movl $0x0, -0x38(%rbp)
movl -0x38(%rbp), %eax
cmpl -0x14(%rbp), %eax
jae 0xd12a
movq -0x10(%rbp), %rax
movl -0x38(%rbp), %ecx
movzwl (%rax,%rcx,2), %eax
cmpl $0x0, %eax
je 0xd11d
movl -0x38(%rbp), %eax
movw %ax, %dx
movq -0x30(%rbp), %rax
movq -0x10(%rbp), %rcx
movl -0x38(%rbp), %esi
movzwl (%rcx,%rsi,2), %ecx
movl %ecx, %esi
movw -0xd0(%rbp,%rsi,2), %cx
movw %cx, %di
addw $0x1, %di
movw %di, -0xd0(%rbp,%rsi,2)
movzwl %cx, %ecx
movw %dx, (%rax,%rcx,2)
jmp 0xd11f
movl -0x38(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x38(%rbp)
jmp 0xd0d0
movl -0x8(%rbp), %eax
movl %eax, -0xd8(%rbp)
testl %eax, %eax
je 0xd153
jmp 0xd139
movl -0xd8(%rbp), %eax
subl $0x1, %eax
je 0xd16b
jmp 0xd146
movl -0xd8(%rbp), %eax
subl $0x2, %eax
je 0xd1a9
jmp 0xd1ab
movq -0x30(%rbp), %rax
movq %rax, -0x80(%rbp)
movq %rax, -0x78(%rbp)
movl $0x13, -0x84(%rbp)
jmp 0xd1cb
leaq 0x1923e(%rip), %rax     # 0x263b0
movq %rax, -0x78(%rbp)
movq -0x78(%rbp), %rax
addq $-0x202, %rax           # imm = 0xFDFE
movq %rax, -0x78(%rbp)
leaq 0x19265(%rip), %rax     # 0x263f0
movq %rax, -0x80(%rbp)
movq -0x80(%rbp), %rax
addq $-0x202, %rax           # imm = 0xFDFE
movq %rax, -0x80(%rbp)
movl $0x100, -0x84(%rbp)     # imm = 0x100
jmp 0xd1cb
jmp 0xd1ab
leaq 0x1927e(%rip), %rax     # 0x26430
movq %rax, -0x78(%rbp)
leaq 0x192b3(%rip), %rax     # 0x26470
movq %rax, -0x80(%rbp)
movl $0xffffffff, -0x84(%rbp) # imm = 0xFFFFFFFF
movl $0x0, -0x58(%rbp)
movl $0x0, -0x38(%rbp)
movl -0x3c(%rbp), %eax
movl %eax, -0x34(%rbp)
movq -0x20(%rbp), %rax
movq (%rax), %rax
movq %rax, -0x70(%rbp)
movl -0x44(%rbp), %eax
movl %eax, -0x48(%rbp)
movl $0x0, -0x4c(%rbp)
movl $0xffffffff, -0x60(%rbp) # imm = 0xFFFFFFFF
movl -0x44(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x54(%rbp)
movl -0x54(%rbp), %eax
subl $0x1, %eax
movl %eax, -0x64(%rbp)
cmpl $0x1, -0x8(%rbp)
jne 0xd223
cmpl $0x354, -0x54(%rbp)     # imm = 0x354
ja 0xd232
cmpl $0x2, -0x8(%rbp)
jne 0xd23e
cmpl $0x250, -0x54(%rbp)     # imm = 0x250
jbe 0xd23e
movl $0x1, -0x4(%rbp)
jmp 0xd520
jmp 0xd240
movl -0x34(%rbp), %eax
subl -0x4c(%rbp), %eax
movb %al, -0x67(%rbp)
movq -0x30(%rbp), %rax
movl -0x38(%rbp), %ecx
movzwl (%rax,%rcx,2), %eax
cmpl -0x84(%rbp), %eax
jge 0xd271
movb $0x0, -0x68(%rbp)
movq -0x30(%rbp), %rax
movl -0x38(%rbp), %ecx
movw (%rax,%rcx,2), %ax
movw %ax, -0x66(%rbp)
jmp 0xd2bf
movq -0x30(%rbp), %rax
movl -0x38(%rbp), %ecx
movzwl (%rax,%rcx,2), %eax
cmpl -0x84(%rbp), %eax
jle 0xd2b3
movq -0x80(%rbp), %rax
movq -0x30(%rbp), %rcx
movl -0x38(%rbp), %edx
movzwl (%rcx,%rdx,2), %ecx
movw (%rax,%rcx,2), %ax
movb %al, -0x68(%rbp)
movq -0x78(%rbp), %rax
movq -0x30(%rbp), %rcx
movl -0x38(%rbp), %edx
movzwl (%rcx,%rdx,2), %ecx
movw (%rax,%rcx,2), %ax
movw %ax, -0x66(%rbp)
jmp 0xd2bd
movb $0x60, -0x68(%rbp)
movw $0x0, -0x66(%rbp)
jmp 0xd2bf
movl -0x34(%rbp), %ecx
subl -0x4c(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x5c(%rbp)
movl -0x48(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0xd4(%rbp)
movl -0xd4(%rbp), %eax
movl %eax, -0x3c(%rbp)
movl -0x5c(%rbp), %ecx
movl -0xd4(%rbp), %eax
subl %ecx, %eax
movl %eax, -0xd4(%rbp)
movq -0x70(%rbp), %rax
movl -0x58(%rbp), %edx
movl -0x4c(%rbp), %ecx
shrl %cl, %edx
movl %edx, %ecx
addl -0xd4(%rbp), %ecx
movl %ecx, %ecx
movl -0x68(%rbp), %edx
movl %edx, (%rax,%rcx,4)
cmpl $0x0, -0xd4(%rbp)
jne 0xd2e8
movl -0x34(%rbp), %ecx
subl $0x1, %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x5c(%rbp)
movl -0x58(%rbp), %eax
andl -0x5c(%rbp), %eax
cmpl $0x0, %eax
je 0xd343
movl -0x5c(%rbp), %eax
shrl %eax
movl %eax, -0x5c(%rbp)
jmp 0xd32e
cmpl $0x0, -0x5c(%rbp)
je 0xd360
movl -0x5c(%rbp), %eax
subl $0x1, %eax
andl -0x58(%rbp), %eax
movl %eax, -0x58(%rbp)
movl -0x5c(%rbp), %eax
addl -0x58(%rbp), %eax
movl %eax, -0x58(%rbp)
jmp 0xd367
movl $0x0, -0x58(%rbp)
movl -0x38(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x38(%rbp)
movl -0x34(%rbp), %eax
movl %eax, %ecx
movw -0xb0(%rbp,%rcx,2), %ax
addw $-0x1, %ax
movw %ax, -0xb0(%rbp,%rcx,2)
movzwl %ax, %eax
cmpl $0x0, %eax
jne 0xd3b4
movl -0x34(%rbp), %eax
cmpl -0x40(%rbp), %eax
jne 0xd39e
jmp 0xd4d4
movq -0x10(%rbp), %rax
movq -0x30(%rbp), %rcx
movl -0x38(%rbp), %edx
movzwl (%rcx,%rdx,2), %ecx
movzwl (%rax,%rcx,2), %eax
movl %eax, -0x34(%rbp)
movl -0x34(%rbp), %eax
cmpl -0x44(%rbp), %eax
jbe 0xd4cf
movl -0x58(%rbp), %eax
andl -0x64(%rbp), %eax
cmpl -0x60(%rbp), %eax
je 0xd4cf
cmpl $0x0, -0x4c(%rbp)
jne 0xd3db
movl -0x44(%rbp), %eax
movl %eax, -0x4c(%rbp)
movl -0x3c(%rbp), %ecx
movq -0x70(%rbp), %rax
movl %ecx, %ecx
shlq $0x2, %rcx
addq %rcx, %rax
movq %rax, -0x70(%rbp)
movl -0x34(%rbp), %eax
subl -0x4c(%rbp), %eax
movl %eax, -0x48(%rbp)
movl -0x48(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x50(%rbp)
movl -0x48(%rbp), %eax
addl -0x4c(%rbp), %eax
cmpl -0x40(%rbp), %eax
jae 0xd443
movl -0x48(%rbp), %eax
addl -0x4c(%rbp), %eax
movl %eax, %eax
movzwl -0xb0(%rbp,%rax,2), %ecx
movl -0x50(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x50(%rbp)
cmpl $0x0, -0x50(%rbp)
jg 0xd430
jmp 0xd443
movl -0x48(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x48(%rbp)
movl -0x50(%rbp), %eax
shll %eax
movl %eax, -0x50(%rbp)
jmp 0xd405
movl -0x48(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
addl -0x54(%rbp), %eax
movl %eax, -0x54(%rbp)
cmpl $0x1, -0x8(%rbp)
jne 0xd462
cmpl $0x354, -0x54(%rbp)     # imm = 0x354
ja 0xd471
cmpl $0x2, -0x8(%rbp)
jne 0xd47d
cmpl $0x250, -0x54(%rbp)     # imm = 0x250
jbe 0xd47d
movl $0x1, -0x4(%rbp)
jmp 0xd520
movl -0x58(%rbp), %eax
andl -0x64(%rbp), %eax
movl %eax, -0x60(%rbp)
movl -0x48(%rbp), %eax
movb %al, %dl
movq -0x20(%rbp), %rax
movq (%rax), %rax
movl -0x60(%rbp), %ecx
movb %dl, (%rax,%rcx,4)
movl -0x44(%rbp), %eax
movb %al, %dl
movq -0x20(%rbp), %rax
movq (%rax), %rax
movl -0x60(%rbp), %ecx
movb %dl, 0x1(%rax,%rcx,4)
movq -0x70(%rbp), %rax
movq -0x20(%rbp), %rcx
movq (%rcx), %rcx
subq %rcx, %rax
sarq $0x2, %rax
movw %ax, %dx
movq -0x20(%rbp), %rax
movq (%rax), %rax
movl -0x60(%rbp), %ecx
movw %dx, 0x2(%rax,%rcx,4)
jmp 0xd240
cmpl $0x0, -0x58(%rbp)
je 0xd4fa
movb $0x40, -0x68(%rbp)
movl -0x34(%rbp), %eax
subl -0x4c(%rbp), %eax
movb %al, -0x67(%rbp)
movw $0x0, -0x66(%rbp)
movq -0x70(%rbp), %rax
movl -0x58(%rbp), %ecx
movl -0x68(%rbp), %edx
movl %edx, (%rax,%rcx,4)
movl -0x54(%rbp), %edx
movq -0x20(%rbp), %rax
movq (%rax), %rcx
movl %edx, %edx
shlq $0x2, %rdx
addq %rdx, %rcx
movq %rcx, (%rax)
movl -0x44(%rbp), %ecx
movq -0x28(%rbp), %rax
movl %ecx, (%rax)
movl $0x0, -0x4(%rbp)
movl -0x4(%rbp), %eax
addq $0x60, %rsp
popq %rbp
retq
nopl (%rax)