// File: /workspace/github_c_makefile_star2_O0/snej[P]zdelta/inftrees.c
// Function: huft_build
local int huft_build(b, n, s, d, e, t, m, hp, hn, v)
uIntf *b;               /* code lengths in bits (all assumed <= BMAX) */
uInt n;                 /* number of codes (assumed <= 288) */
uInt s;                 /* number of simple-valued codes (0..s-1) */
const uIntf *d;         /* list of base values for non-simple codes */
const uIntf *e;         /* list of extra bits for non-simple codes */
inflate_huft * FAR *t;  /* result: starting table */
uIntf *m;               /* maximum lookup bits, returns actual */
inflate_huft *hp;       /* space for trees */
uInt *hn;               /* hufts used in space */
uIntf *v;               /* working area: values in order of bit length */
/* Given a list of code lengths and a maximum table size, make a set of
   tables to decode that set of codes.  Return Z_OK on success, Z_BUF_ERROR
   if the given code set is incomplete (the tables are still built in this
   case), Z_DATA_ERROR if the input is invalid (an over-subscribed set of
   lengths), or Z_MEM_ERROR if not enough memory. */
{

  uInt a;                       /* counter for codes of length k */
  uInt c[BMAX+1];               /* bit length count table */
  uInt f;                       /* i repeats in table every f entries */
  int g;                        /* maximum code length */
  int h;                        /* table level */
  register uInt i;              /* counter, current code */
  register uInt j;              /* counter */
  register int k;               /* number of bits in current code */
  int l;                        /* bits per table (returned in m) */
  uInt mask;                    /* (1 << w) - 1, to avoid cc -O bug on HP */
  register uIntf *p;            /* pointer into c[], b[], or v[] */
  inflate_huft *q;              /* points to current table */
  struct inflate_huft_s r;      /* table entry for structure assignment */
   inflate_huft *u[BMAX];        /* table stack */
  register int w;               /* bits before this table == (l * h) */
  uInt x[BMAX+1];               /* bit offsets, then code stack */
  uIntf *xp;                    /* pointer into x */
  int y;                        /* number of dummy codes added */
  uInt z;                       /* number of entries in current table */


  /* Generate counts for each bit length */
  p = c;
#define C0 *p++ = 0;
#define C2 C0 C0 C0 C0
#define C4 C2 C2 C2 C2
  C4                            /* clear c[]--assume BMAX+1 is 16 */
  p = b;  i = n;
  do {
    c[*p++]++;                  /* assume all entries <= BMAX */
  } while (--i);
  if (c[0] == n)                /* null input--all zero length codes */
  {
    *t = (inflate_huft *)ZD_NULL;
    *m = 0;
    return ZD_OK;
  }


  /* Find minimum and maximum length, bound *m by those */
  l = *m;
  for (j = 1; j <= BMAX; j++)
    if (c[j])
      break;
  k = j;                        /* minimum code length */
  if ((uInt)l < j)
    l = j;
  for (i = BMAX; i; i--) 
    if (c[i])
      break;
  g = i;                        /* maximum code length */
  if ((uInt)l > i)
    l = i;
  *m = l;


  /* Adjust last length count to fill out codes, if needed */
  for (y = 1 << j; j < i; j++, y <<= 1)
    if ((y -= c[j]) < 0)
      return ZD_DATA_ERROR;
  if ((y -= c[i]) < 0)
    return ZD_DATA_ERROR;
  c[i] += y;


  /* Generate starting offsets into the value table for each length */
  x[1] = j = 0;
  p = c + 1;  xp = x + 2;
  while (--i) {                 /* note that i == g from above */
    *xp++ = (j += *p++);
  }


  /* Make a table of values in order of bit lengths */
  p = b;  i = 0;
  do {
    if ((j = *p++) != 0)
      v[x[j]++] = i;
  } while (++i < n);
  n = x[g];                     /* set n to length of v */


  /* Generate the Huffman codes and for each, make the table entries */
  x[0] = i = 0;                 /* first Huffman code is zero */
  p = v;                        /* grab values in bit order */
  h = -1;                       /* no tables yet--level -1 */
  w = -l;                       /* bits decoded == (l * h) */
  u[0] = (inflate_huft *)ZD_NULL;        /* just to keep compilers happy */
  q = (inflate_huft *)ZD_NULL;   /* ditto */
  z = 0;                        /* ditto */

  /* go through the bit lengths (k already is bits in shortest code) */
  for (; k <= g; k++)
  {
    a = c[k];
    while (a--)
    {
      /* here i is the Huffman code of length k bits for value *p */
      /* make tables up to required level */
      while (k > w + l)
      {
        h++;
        w += l;                 /* previous table always l bits */

        /* compute minimum size table less than or equal to l bits */
        z = g - w;
        z = z > (uInt)l ? (uInt) l : z;         /* table size upper limit */
        if ((f = 1 << (j = k - w)) > a + 1)     /* try a k-w bit table */
        {                       /* too few codes for k-w bit table */
          f -= a + 1;           /* deduct codes from patterns left */
          xp = c + k;
          if (j < z)
            while (++j < z)     /* try smaller tables up to z bits */
            {
              if ((f <<= 1) <= *++xp)
                break;          /* enough codes to use up j bits */
              f -= *xp;         /* else deduct codes from patterns */
            }
        }
        z = 1 << j;             /* table entries for j-bit table */

        /* allocate new table */
        if (*hn + z > MANY)     /* (note: doesn't matter for fixed) */
          return ZD_MEM_ERROR;   /* not enough memory */
        u[h] = q = hp + *hn;
        *hn += z;

        /* connect to last table, if there is one */
        if (h)
        {
          x[h] = i;             /* save pattern for backing up */
          r.bits = (Byte)l;     /* bits to dump before this table */
          r.exop = (Byte)j;     /* bits in this table */
          j = i >> (w - l);
          r.base = (uInt)(q - u[h-1] - j);   /* offset to this table */
          u[h-1][j] = r;        /* connect to last table */
        }
        else
          *t = q;               /* first table is returned result */
      }

      /* set up table entry in r */
      r.bits = (Byte)(k - w);
      if (p >= v + n)
        r.exop = 128 + 64;      /* out of values--invalid code */
      else if (*p < s)
      {
        r.exop = (Byte)(*p < 256 ? 0 : 32 + 64);     /* 256 is end-of-block */
        r.base = *p++;          /* simple code is just the value */
      }
      else
      {
        r.exop = (Byte)(e[*p - s] + 16 + 64);/* non-simple--look up in lists */
        r.base = d[*p++ - s];
      }

      /* fill code-like entries with r */
      f = 1 << (k - w);
      for (j = i >> w; j < z; j += f)
        q[j] = r;

      /* backwards increment the k-bit code i */
      for (j = 1 << (k - 1); i & j; j >>= 1)
        i ^= j;
      i ^= j;

      /* backup over finished tables */
      mask = (1 << w) - 1;      /* needed on HP, cc -O bug */
      while ((i & mask) != x[h])
      {
        h--;                    /* don't need to update q */
        w -= l;
        mask = (1 << w) - 1;
      }
    }
  }


  /* Return Z_BUF_ERROR if we were given an incomplete table */
  return y != 0 && g != 1 ? ZD_BUF_ERROR : ZD_OK;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
subq $0x120, %rsp            # imm = 0x120
movq 0x28(%rbp), %rax
movq 0x20(%rbp), %rax
movq 0x18(%rbp), %rax
movq 0x10(%rbp), %rax
movq %rdi, -0x10(%rbp)
movl %esi, -0x14(%rbp)
movl %edx, -0x18(%rbp)
movq %rcx, -0x20(%rbp)
movq %r8, -0x28(%rbp)
movq %r9, -0x30(%rbp)
leaq -0x80(%rbp), %rax
movq %rax, -0xa8(%rbp)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl $0x0, (%rax)
movq -0x10(%rbp), %rax
movq %rax, -0xa8(%rbp)
movl -0x14(%rbp), %eax
movl %eax, -0x90(%rbp)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl (%rax), %eax
movl -0x80(%rbp,%rax,4), %ecx
addl $0x1, %ecx
movl %ecx, -0x80(%rbp,%rax,4)
movl -0x90(%rbp), %eax
addl $-0x1, %eax
movl %eax, -0x90(%rbp)
cmpl $0x0, %eax
jne 0xf1c0
movl -0x80(%rbp), %eax
cmpl -0x14(%rbp), %eax
jne 0xf21f
movq -0x30(%rbp), %rax
movq $0x0, (%rax)
movq 0x10(%rbp), %rax
movl $0x0, (%rax)
movl $0x0, -0x4(%rbp)
jmp 0xf9ed
movq 0x10(%rbp), %rax
movl (%rax), %eax
movl %eax, -0x9c(%rbp)
movl $0x1, -0x94(%rbp)
cmpl $0xf, -0x94(%rbp)
ja 0xf260
movl -0x94(%rbp), %eax
cmpl $0x0, -0x80(%rbp,%rax,4)
je 0xf24d
jmp 0xf260
jmp 0xf24f
movl -0x94(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x94(%rbp)
jmp 0xf235
movl -0x94(%rbp), %eax
movl %eax, -0x98(%rbp)
movl -0x9c(%rbp), %eax
cmpl -0x94(%rbp), %eax
jae 0xf286
movl -0x94(%rbp), %eax
movl %eax, -0x9c(%rbp)
movl $0xf, -0x90(%rbp)
cmpl $0x0, -0x90(%rbp)
je 0xf2bb
movl -0x90(%rbp), %eax
cmpl $0x0, -0x80(%rbp,%rax,4)
je 0xf2a8
jmp 0xf2bb
jmp 0xf2aa
movl -0x90(%rbp), %eax
addl $-0x1, %eax
movl %eax, -0x90(%rbp)
jmp 0xf290
movl -0x90(%rbp), %eax
movl %eax, -0x88(%rbp)
movl -0x9c(%rbp), %eax
cmpl -0x90(%rbp), %eax
jbe 0xf2e1
movl -0x90(%rbp), %eax
movl %eax, -0x9c(%rbp)
movl -0x9c(%rbp), %ecx
movq 0x10(%rbp), %rax
movl %ecx, (%rax)
movl -0x94(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x18c(%rbp)
movl -0x94(%rbp), %eax
cmpl -0x90(%rbp), %eax
jae 0xf358
movl -0x94(%rbp), %eax
movl -0x80(%rbp,%rax,4), %ecx
movl -0x18c(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x18c(%rbp)
cmpl $0x0, %eax
jge 0xf337
movl $0xfffffffd, -0x4(%rbp) # imm = 0xFFFFFFFD
jmp 0xf9ed
jmp 0xf339
movl -0x94(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x94(%rbp)
movl -0x18c(%rbp), %eax
shll %eax
movl %eax, -0x18c(%rbp)
jmp 0xf300
movl -0x90(%rbp), %eax
movl -0x80(%rbp,%rax,4), %ecx
movl -0x18c(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x18c(%rbp)
cmpl $0x0, %eax
jge 0xf381
movl $0xfffffffd, -0x4(%rbp) # imm = 0xFFFFFFFD
jmp 0xf9ed
movl -0x18c(%rbp), %ecx
movl -0x90(%rbp), %eax
addl -0x80(%rbp,%rax,4), %ecx
movl %ecx, -0x80(%rbp,%rax,4)
movl $0x0, -0x94(%rbp)
movl $0x0, -0x17c(%rbp)
leaq -0x80(%rbp), %rax
addq $0x4, %rax
movq %rax, -0xa8(%rbp)
leaq -0x180(%rbp), %rax
addq $0x8, %rax
movq %rax, -0x188(%rbp)
movl -0x90(%rbp), %eax
addl $-0x1, %eax
movl %eax, -0x90(%rbp)
cmpl $0x0, %eax
je 0xf41a
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl (%rax), %ecx
addl -0x94(%rbp), %ecx
movl %ecx, -0x94(%rbp)
movq -0x188(%rbp), %rax
movq %rax, %rdx
addq $0x4, %rdx
movq %rdx, -0x188(%rbp)
movl %ecx, (%rax)
jmp 0xf3ca
movq -0x10(%rbp), %rax
movq %rax, -0xa8(%rbp)
movl $0x0, -0x90(%rbp)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl (%rax), %eax
movl %eax, -0x94(%rbp)
cmpl $0x0, %eax
je 0xf47b
movl -0x90(%rbp), %edx
movq 0x28(%rbp), %rax
movl -0x94(%rbp), %ecx
movl %ecx, %esi
movl -0x180(%rbp,%rsi,4), %ecx
movl %ecx, %edi
addl $0x1, %edi
movl %edi, -0x180(%rbp,%rsi,4)
movl %ecx, %ecx
movl %edx, (%rax,%rcx,4)
jmp 0xf47d
movl -0x90(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x90(%rbp)
cmpl -0x14(%rbp), %eax
jb 0xf42f
movslq -0x88(%rbp), %rax
movl -0x180(%rbp,%rax,4), %eax
movl %eax, -0x14(%rbp)
movl $0x0, -0x90(%rbp)
movl $0x0, -0x180(%rbp)
movq 0x28(%rbp), %rax
movq %rax, -0xa8(%rbp)
movl $0xffffffff, -0x8c(%rbp) # imm = 0xFFFFFFFF
xorl %eax, %eax
subl -0x9c(%rbp), %eax
movl %eax, -0x134(%rbp)
movq $0x0, -0x130(%rbp)
movq $0x0, -0xb0(%rbp)
movl $0x0, -0x190(%rbp)
movl -0x98(%rbp), %eax
cmpl -0x88(%rbp), %eax
jg 0xf9b6
movslq -0x98(%rbp), %rax
movl -0x80(%rbp,%rax,4), %eax
movl %eax, -0x34(%rbp)
movl -0x34(%rbp), %eax
movl %eax, %ecx
addl $-0x1, %ecx
movl %ecx, -0x34(%rbp)
cmpl $0x0, %eax
je 0xf9a0
jmp 0xf52f
movl -0x98(%rbp), %eax
movl -0x134(%rbp), %ecx
addl -0x9c(%rbp), %ecx
cmpl %ecx, %eax
jle 0xf79c
movl -0x8c(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x8c(%rbp)
movl -0x9c(%rbp), %eax
addl -0x134(%rbp), %eax
movl %eax, -0x134(%rbp)
movl -0x88(%rbp), %eax
subl -0x134(%rbp), %eax
movl %eax, -0x190(%rbp)
movl -0x190(%rbp), %eax
cmpl -0x9c(%rbp), %eax
jbe 0xf598
movl -0x9c(%rbp), %eax
movl %eax, -0x194(%rbp)
jmp 0xf5a4
movl -0x190(%rbp), %eax
movl %eax, -0x194(%rbp)
movl -0x194(%rbp), %eax
movl %eax, -0x190(%rbp)
movl -0x98(%rbp), %ecx
subl -0x134(%rbp), %ecx
movl %ecx, -0x94(%rbp)
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x84(%rbp)
movl -0x34(%rbp), %ecx
addl $0x1, %ecx
cmpl %ecx, %eax
jbe 0xf678
movl -0x34(%rbp), %ecx
addl $0x1, %ecx
movl -0x84(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x84(%rbp)
leaq -0x80(%rbp), %rax
movslq -0x98(%rbp), %rcx
shlq $0x2, %rcx
addq %rcx, %rax
movq %rax, -0x188(%rbp)
movl -0x94(%rbp), %eax
cmpl -0x190(%rbp), %eax
jae 0xf676
jmp 0xf61a
movl -0x94(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x94(%rbp)
cmpl -0x190(%rbp), %eax
jae 0xf674
movl -0x84(%rbp), %eax
shll %eax
movl %eax, -0x84(%rbp)
movq -0x188(%rbp), %rcx
movq %rcx, %rdx
addq $0x4, %rdx
movq %rdx, -0x188(%rbp)
cmpl 0x4(%rcx), %eax
ja 0xf65b
jmp 0xf674
movq -0x188(%rbp), %rax
movl (%rax), %ecx
movl -0x84(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x84(%rbp)
jmp 0xf61a
jmp 0xf676
jmp 0xf678
movl -0x94(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x190(%rbp)
movq 0x20(%rbp), %rax
movl (%rax), %eax
addl -0x190(%rbp), %eax
cmpl $0x5a0, %eax            # imm = 0x5A0
jbe 0xf6aa
movl $0xfffffffc, -0x4(%rbp) # imm = 0xFFFFFFFC
jmp 0xf9ed
movq 0x18(%rbp), %rcx
movq 0x20(%rbp), %rax
movl (%rax), %eax
shlq $0x3, %rax
addq %rax, %rcx
movq %rcx, -0xb0(%rbp)
movslq -0x8c(%rbp), %rax
movq %rcx, -0x130(%rbp,%rax,8)
movl -0x190(%rbp), %ecx
movq 0x20(%rbp), %rax
addl (%rax), %ecx
movl %ecx, (%rax)
cmpl $0x0, -0x8c(%rbp)
je 0xf789
movl -0x90(%rbp), %ecx
movslq -0x8c(%rbp), %rax
movl %ecx, -0x180(%rbp,%rax,4)
movl -0x9c(%rbp), %eax
movb %al, -0xb7(%rbp)
movl -0x94(%rbp), %eax
movb %al, -0xb8(%rbp)
movl -0x90(%rbp), %eax
movl -0x134(%rbp), %ecx
subl -0x9c(%rbp), %ecx
shrl %cl, %eax
movl %eax, -0x94(%rbp)
movq -0xb0(%rbp), %rax
movl -0x8c(%rbp), %ecx
subl $0x1, %ecx
movslq %ecx, %rcx
movq -0x130(%rbp,%rcx,8), %rcx
subq %rcx, %rax
sarq $0x3, %rax
movl -0x94(%rbp), %ecx
subq %rcx, %rax
movl %eax, -0xb4(%rbp)
movl -0x8c(%rbp), %eax
subl $0x1, %eax
cltq
movq -0x130(%rbp,%rax,8), %rax
movl -0x94(%rbp), %ecx
movq -0xb8(%rbp), %rdx
movq %rdx, (%rax,%rcx,8)
jmp 0xf797
movq -0xb0(%rbp), %rcx
movq -0x30(%rbp), %rax
movq %rcx, (%rax)
jmp 0xf52f
movl -0x98(%rbp), %eax
subl -0x134(%rbp), %eax
movb %al, -0xb7(%rbp)
movq -0xa8(%rbp), %rax
movq 0x28(%rbp), %rcx
movl -0x14(%rbp), %edx
shlq $0x2, %rdx
addq %rdx, %rcx
cmpq %rcx, %rax
jb 0xf7d4
movb $-0x40, -0xb8(%rbp)
jmp 0xf86c
movq -0xa8(%rbp), %rax
movl (%rax), %eax
cmpl -0x18(%rbp), %eax
jae 0xf820
movq -0xa8(%rbp), %rax
movl (%rax), %edx
movl $0x60, %eax
xorl %ecx, %ecx
cmpl $0x100, %edx            # imm = 0x100
cmovbl %ecx, %eax
movb %al, -0xb8(%rbp)
movq -0xa8(%rbp), %rax
movq %rax, %rcx
addq $0x4, %rcx
movq %rcx, -0xa8(%rbp)
movl (%rax), %eax
movl %eax, -0xb4(%rbp)
jmp 0xf86a
movq -0x28(%rbp), %rax
movq -0xa8(%rbp), %rcx
movl (%rcx), %ecx
subl -0x18(%rbp), %ecx
movl %ecx, %ecx
movl (%rax,%rcx,4), %eax
addl $0x10, %eax
addl $0x40, %eax
movb %al, -0xb8(%rbp)
movq -0x20(%rbp), %rax
movq -0xa8(%rbp), %rcx
movq %rcx, %rdx
addq $0x4, %rdx
movq %rdx, -0xa8(%rbp)
movl (%rcx), %ecx
subl -0x18(%rbp), %ecx
movl %ecx, %ecx
movl (%rax,%rcx,4), %eax
movl %eax, -0xb4(%rbp)
jmp 0xf86c
movl -0x98(%rbp), %ecx
subl -0x134(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x84(%rbp)
movl -0x90(%rbp), %eax
movl -0x134(%rbp), %ecx
shrl %cl, %eax
movl %eax, -0x94(%rbp)
movl -0x94(%rbp), %eax
cmpl -0x190(%rbp), %eax
jae 0xf8d3
movq -0xb0(%rbp), %rax
movl -0x94(%rbp), %ecx
movq -0xb8(%rbp), %rdx
movq %rdx, (%rax,%rcx,8)
movl -0x84(%rbp), %eax
addl -0x94(%rbp), %eax
movl %eax, -0x94(%rbp)
jmp 0xf899
movl -0x98(%rbp), %ecx
subl $0x1, %ecx
movl $0x1, %eax
shll %cl, %eax
movl %eax, -0x94(%rbp)
movl -0x90(%rbp), %eax
andl -0x94(%rbp), %eax
cmpl $0x0, %eax
je 0xf91c
movl -0x94(%rbp), %eax
xorl -0x90(%rbp), %eax
movl %eax, -0x90(%rbp)
movl -0x94(%rbp), %eax
shrl %eax
movl %eax, -0x94(%rbp)
jmp 0xf8e9
movl -0x94(%rbp), %eax
xorl -0x90(%rbp), %eax
movl %eax, -0x90(%rbp)
movl -0x134(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
subl $0x1, %eax
movl %eax, -0xa0(%rbp)
movl -0x90(%rbp), %eax
andl -0xa0(%rbp), %eax
movslq -0x8c(%rbp), %rcx
cmpl -0x180(%rbp,%rcx,4), %eax
je 0xf99b
movl -0x8c(%rbp), %eax
addl $-0x1, %eax
movl %eax, -0x8c(%rbp)
movl -0x9c(%rbp), %ecx
movl -0x134(%rbp), %eax
subl %ecx, %eax
movl %eax, -0x134(%rbp)
movl -0x134(%rbp), %ecx
movl $0x1, %eax
shll %cl, %eax
subl $0x1, %eax
movl %eax, -0xa0(%rbp)
jmp 0xf944
jmp 0xf519
jmp 0xf9a2
movl -0x98(%rbp), %eax
addl $0x1, %eax
movl %eax, -0x98(%rbp)
jmp 0xf4f9
xorl %eax, %eax
cmpl $0x0, -0x18c(%rbp)
movb %al, -0x195(%rbp)
je 0xf9d7
cmpl $0x1, -0x88(%rbp)
setne %al
movb %al, -0x195(%rbp)
movb -0x195(%rbp), %dl
xorl %eax, %eax
movl $0xfffffffb, %ecx       # imm = 0xFFFFFFFB
testb $0x1, %dl
cmovnel %ecx, %eax
movl %eax, -0x4(%rbp)
movl -0x4(%rbp), %eax
addq $0x120, %rsp            # imm = 0x120
popq %rbp
retq
nopl (%rax)