// File: /workspace/github_c_makefile_star2_O2/shifengbin[P]bishe/Output/../Persistence/sqlite3.c
// Function: wherePathSolver
static int wherePathSolver(WhereInfo *pWInfo, LogEst nRowEst){
  int mxChoice;             /* Maximum number of simultaneous paths tracked */
  int nLoop;                /* Number of terms in the join */
  Parse *pParse;            /* Parsing context */
  sqlite3 *db;              /* The database connection */
  int iLoop;                /* Loop counter over the terms of the join */
  int ii, jj;               /* Loop counters */
  int mxI = 0;              /* Index of next entry to replace */
  int nOrderBy;             /* Number of ORDER BY clause terms */
  LogEst mxCost = 0;        /* Maximum cost of a set of paths */
  LogEst mxUnsorted = 0;    /* Maximum unsorted cost of a set of path */
  int nTo, nFrom;           /* Number of valid entries in aTo[] and aFrom[] */
  WherePath *aFrom;         /* All nFrom paths at the previous level */
  WherePath *aTo;           /* The nTo best paths at the current level */
  WherePath *pFrom;         /* An element of aFrom[] that we are working on */
  WherePath *pTo;           /* An element of aTo[] that we are working on */
  WhereLoop *pWLoop;        /* One of the WhereLoop objects */
  WhereLoop **pX;           /* Used to divy up the pSpace memory */
  LogEst *aSortCost = 0;    /* Sorting and partial sorting costs */
  char *pSpace;             /* Temporary memory used by this routine */
  int nSpace;               /* Bytes of space allocated at pSpace */

  pParse = pWInfo->pParse;
  db = pParse->db;
  nLoop = pWInfo->nLevel;
  /* TUNING: For simple queries, only the best path is tracked.
  ** For 2-way joins, the 5 best paths are followed.
  ** For joins of 3 or more tables, track the 10 best paths */
  mxChoice = (nLoop<=1) ? 1 : (nLoop==2 ? 5 : 10);
  assert( nLoop<=pWInfo->pTabList->nSrc );
  WHERETRACE(0x002, ("---- begin solver.  (nRowEst=%d)\n", nRowEst));

  /* If nRowEst is zero and there is an ORDER BY clause, ignore it. In this
  ** case the purpose of this call is to estimate the number of rows returned
  ** by the overall query. Once this estimate has been obtained, the caller
  ** will invoke this function a second time, passing the estimate as the
  ** nRowEst parameter.  */
  if( pWInfo->pOrderBy==0 || nRowEst==0 ){
    nOrderBy = 0;
  }else{
    nOrderBy = pWInfo->pOrderBy->nExpr;
  }

  /* Allocate and initialize space for aTo, aFrom and aSortCost[] */
  nSpace = (sizeof(WherePath)+sizeof(WhereLoop*)*nLoop)*mxChoice*2;
  nSpace += sizeof(LogEst) * nOrderBy;
  pSpace = sqlite3DbMallocRaw(db, nSpace);
  if( pSpace==0 ) return SQLITE_NOMEM;
  aTo = (WherePath*)pSpace;
  aFrom = aTo+mxChoice;
  memset(aFrom, 0, sizeof(aFrom[0]));
  pX = (WhereLoop**)(aFrom+mxChoice);
  for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
    pFrom->aLoop = pX;
  }
  if( nOrderBy ){
    /* If there is an ORDER BY clause and it is not being ignored, set up
    ** space for the aSortCost[] array. Each element of the aSortCost array
    ** is either zero - meaning it has not yet been initialized - or the
    ** cost of sorting nRowEst rows of data where the first X terms of
    ** the ORDER BY clause are already in order, where X is the array 
    ** index.  */
    aSortCost = (LogEst*)pX;
    memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
  }
  assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
  assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX );

  /* Seed the search with a single WherePath containing zero WhereLoops.
  **
  ** TUNING: Do not let the number of iterations go above 28.  If the cost
  ** of computing an automatic index is not paid back within the first 28
  ** rows, then do not use the automatic index. */
  aFrom[0].nRow = MIN(pParse->nQueryLoop, 48);  assert( 48==sqlite3LogEst(28) );
  nFrom = 1;
  assert( aFrom[0].isOrdered==0 );
  if( nOrderBy ){
    /* If nLoop is zero, then there are no FROM terms in the query. Since
    ** in this case the query may return a maximum of one row, the results
    ** are already in the requested order. Set isOrdered to nOrderBy to
    ** indicate this. Or, if nLoop is greater than zero, set isOrdered to
    ** -1, indicating that the result set may or may not be ordered, 
    ** depending on the loops added to the current plan.  */
    aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
  }

  /* Compute successively longer WherePaths using the previous generation
  ** of WherePaths as the basis for the next.  Keep track of the mxChoice
  ** best paths at each generation */
  for(iLoop=0; iLoop<nLoop; iLoop++){
    nTo = 0;
    for(ii=0, pFrom=aFrom; ii<nFrom; ii++, pFrom++){
      for(pWLoop=pWInfo->pLoops; pWLoop; pWLoop=pWLoop->pNextLoop){
        LogEst nOut;                      /* Rows visited by (pFrom+pWLoop) */
        LogEst rCost;                     /* Cost of path (pFrom+pWLoop) */
        LogEst rUnsorted;                 /* Unsorted cost of (pFrom+pWLoop) */
        i8 isOrdered = pFrom->isOrdered;  /* isOrdered for (pFrom+pWLoop) */
        Bitmask maskNew;                  /* Mask of src visited by (..) */
        Bitmask revMask = 0;              /* Mask of rev-order loops for (..) */

        if( (pWLoop->prereq & ~pFrom->maskLoop)!=0 ) continue;
        if( (pWLoop->maskSelf & pFrom->maskLoop)!=0 ) continue;
        /* At this point, pWLoop is a candidate to be the next loop. 
        ** Compute its cost */
        rUnsorted = sqlite3LogEstAdd(pWLoop->rSetup,pWLoop->rRun + pFrom->nRow);
        rUnsorted = sqlite3LogEstAdd(rUnsorted, pFrom->rUnsorted);
        nOut = pFrom->nRow + pWLoop->nOut;
        maskNew = pFrom->maskLoop | pWLoop->maskSelf;
        if( isOrdered<0 ){
          isOrdered = wherePathSatisfiesOrderBy(pWInfo,
                       pWInfo->pOrderBy, pFrom, pWInfo->wctrlFlags,
                       iLoop, pWLoop, &revMask);
        }else{
          revMask = pFrom->revLoop;
        }
        if( isOrdered>=0 && isOrdered<nOrderBy ){
          if( aSortCost[isOrdered]==0 ){
            aSortCost[isOrdered] = whereSortingCost(
                pWInfo, nRowEst, nOrderBy, isOrdered
            );
          }
          rCost = sqlite3LogEstAdd(rUnsorted, aSortCost[isOrdered]);

          WHERETRACE(0x002,
              ("---- sort cost=%-3d (%d/%d) increases cost %3d to %-3d\n",
               aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy, 
               rUnsorted, rCost));
        }else{
          rCost = rUnsorted;
        }

        /* Check to see if pWLoop should be added to the set of
        ** mxChoice best-so-far paths.
        **
        ** First look for an existing path among best-so-far paths
        ** that covers the same set of loops and has the same isOrdered
        ** setting as the current path candidate.
        **
        ** The term "((pTo->isOrdered^isOrdered)&0x80)==0" is equivalent
        ** to (pTo->isOrdered==(-1))==(isOrdered==(-1))" for the range
        ** of legal values for isOrdered, -1..64.
        */
        for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){
          if( pTo->maskLoop==maskNew
           && ((pTo->isOrdered^isOrdered)&0x80)==0
          ){
            testcase( jj==nTo-1 );
            break;
          }
        }
        if( jj>=nTo ){
          /* None of the existing best-so-far paths match the candidate. */
          if( nTo>=mxChoice
           && (rCost>mxCost || (rCost==mxCost && rUnsorted>=mxUnsorted))
          ){
            /* The current candidate is no better than any of the mxChoice
            ** paths currently in the best-so-far buffer.  So discard
            ** this candidate as not viable. */
#ifdef WHERETRACE_ENABLED /* 0x4 */
            if( sqlite3WhereTrace&0x4 ){
              sqlite3DebugPrintf("Skip   %s cost=%-3d,%3d order=%c\n",
                  wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
                  isOrdered>=0 ? isOrdered+'0' : '?');
            }
#endif
            continue;
          }
          /* If we reach this points it means that the new candidate path
          ** needs to be added to the set of best-so-far paths. */
          if( nTo<mxChoice ){
            /* Increase the size of the aTo set by one */
            jj = nTo++;
          }else{
            /* New path replaces the prior worst to keep count below mxChoice */
            jj = mxI;
          }
          pTo = &aTo[jj];
#ifdef WHERETRACE_ENABLED /* 0x4 */
          if( sqlite3WhereTrace&0x4 ){
            sqlite3DebugPrintf("New    %s cost=%-3d,%3d order=%c\n",
                wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
                isOrdered>=0 ? isOrdered+'0' : '?');
          }
#endif
        }else{
          /* Control reaches here if best-so-far path pTo=aTo[jj] covers the
          ** same set of loops and has the sam isOrdered setting as the
          ** candidate path.  Check to see if the candidate should replace
          ** pTo or if the candidate should be skipped */
          if( pTo->rCost<rCost || (pTo->rCost==rCost && pTo->nRow<=nOut) ){
#ifdef WHERETRACE_ENABLED /* 0x4 */
            if( sqlite3WhereTrace&0x4 ){
              sqlite3DebugPrintf(
                  "Skip   %s cost=%-3d,%3d order=%c",
                  wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
                  isOrdered>=0 ? isOrdered+'0' : '?');
              sqlite3DebugPrintf("   vs %s cost=%-3d,%d order=%c\n",
                  wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
                  pTo->isOrdered>=0 ? pTo->isOrdered+'0' : '?');
            }
#endif
            /* Discard the candidate path from further consideration */
            testcase( pTo->rCost==rCost );
            continue;
          }
          testcase( pTo->rCost==rCost+1 );
          /* Control reaches here if the candidate path is better than the
          ** pTo path.  Replace pTo with the candidate. */
#ifdef WHERETRACE_ENABLED /* 0x4 */
          if( sqlite3WhereTrace&0x4 ){
            sqlite3DebugPrintf(
                "Update %s cost=%-3d,%3d order=%c",
                wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
                isOrdered>=0 ? isOrdered+'0' : '?');
            sqlite3DebugPrintf("  was %s cost=%-3d,%3d order=%c\n",
                wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
                pTo->isOrdered>=0 ? pTo->isOrdered+'0' : '?');
          }
#endif
        }
        /* pWLoop is a winner.  Add it to the set of best so far */
        pTo->maskLoop = pFrom->maskLoop | pWLoop->maskSelf;
        pTo->revLoop = revMask;
        pTo->nRow = nOut;
        pTo->rCost = rCost;
        pTo->rUnsorted = rUnsorted;
        pTo->isOrdered = isOrdered;
        memcpy(pTo->aLoop, pFrom->aLoop, sizeof(WhereLoop*)*iLoop);
        pTo->aLoop[iLoop] = pWLoop;
        if( nTo>=mxChoice ){
          mxI = 0;
          mxCost = aTo[0].rCost;
          mxUnsorted = aTo[0].nRow;
          for(jj=1, pTo=&aTo[1]; jj<mxChoice; jj++, pTo++){
            if( pTo->rCost>mxCost 
             || (pTo->rCost==mxCost && pTo->rUnsorted>mxUnsorted) 
            ){
              mxCost = pTo->rCost;
              mxUnsorted = pTo->rUnsorted;
              mxI = jj;
            }
          }
        }
      }
    }

#ifdef WHERETRACE_ENABLED  /* >=2 */
    if( sqlite3WhereTrace & 0x02 ){
      sqlite3DebugPrintf("---- after round %d ----\n", iLoop);
      for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){
        sqlite3DebugPrintf(" %s cost=%-3d nrow=%-3d order=%c",
           wherePathName(pTo, iLoop+1, 0), pTo->rCost, pTo->nRow,
           pTo->isOrdered>=0 ? (pTo->isOrdered+'0') : '?');
        if( pTo->isOrdered>0 ){
          sqlite3DebugPrintf(" rev=0x%llx\n", pTo->revLoop);
        }else{
          sqlite3DebugPrintf("\n");
        }
      }
    }
#endif

    /* Swap the roles of aFrom and aTo for the next generation */
    pFrom = aTo;
    aTo = aFrom;
    aFrom = pFrom;
    nFrom = nTo;
  }

  if( nFrom==0 ){
    sqlite3ErrorMsg(pParse, "no query solution");
    sqlite3DbFree(db, pSpace);
    return SQLITE_ERROR;
  }
  
  /* Find the lowest cost path.  pFrom will be left pointing to that path */
  pFrom = aFrom;
  for(ii=1; ii<nFrom; ii++){
    if( pFrom->rCost>aFrom[ii].rCost ) pFrom = &aFrom[ii];
  }
  assert( pWInfo->nLevel==nLoop );
  /* Load the lowest cost path into pWInfo */
  for(iLoop=0; iLoop<nLoop; iLoop++){
    WhereLevel *pLevel = pWInfo->a + iLoop;
    pLevel->pWLoop = pWLoop = pFrom->aLoop[iLoop];
    pLevel->iFrom = pWLoop->iTab;
    pLevel->iTabCur = pWInfo->pTabList->a[pLevel->iFrom].iCursor;
  }
  if( (pWInfo->wctrlFlags & WHERE_WANT_DISTINCT)!=0
   && (pWInfo->wctrlFlags & WHERE_DISTINCTBY)==0
   && pWInfo->eDistinct==WHERE_DISTINCT_NOOP
   && nRowEst
  ){
    Bitmask notUsed;
    int rc = wherePathSatisfiesOrderBy(pWInfo, pWInfo->pResultSet, pFrom,
                 WHERE_DISTINCTBY, nLoop-1, pFrom->aLoop[nLoop-1], &notUsed);
    if( rc==pWInfo->pResultSet->nExpr ){
      pWInfo->eDistinct = WHERE_DISTINCT_ORDERED;
    }
  }
  if( pWInfo->pOrderBy ){
    if( pWInfo->wctrlFlags & WHERE_DISTINCTBY ){
      if( pFrom->isOrdered==pWInfo->pOrderBy->nExpr ){
        pWInfo->eDistinct = WHERE_DISTINCT_ORDERED;
      }
    }else{
      pWInfo->nOBSat = pFrom->isOrdered;
      if( pWInfo->nOBSat<0 ) pWInfo->nOBSat = 0;
      pWInfo->revMask = pFrom->revLoop;
    }
    if( (pWInfo->wctrlFlags & WHERE_SORTBYGROUP)
        && pWInfo->nOBSat==pWInfo->pOrderBy->nExpr && nLoop>0
    ){
      Bitmask revMask = 0;
      int nOrder = wherePathSatisfiesOrderBy(pWInfo, pWInfo->pOrderBy, 
          pFrom, 0, nLoop-1, pFrom->aLoop[nLoop-1], &revMask
      );
      assert( pWInfo->sorted==0 );
      if( nOrder==pWInfo->pOrderBy->nExpr ){
        pWInfo->sorted = 1;
        pWInfo->revMask = revMask;
      }
    }
  }


  pWInfo->nRowOut = pFrom->nRow;

  /* Free temporary memory and return success */
  sqlite3DbFree(db, pSpace);
  return SQLITE_OK;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xe8, %rsp
movq (%rdi), %rcx
movq 0x10(%rdi), %rax
movq %rcx, -0xc0(%rbp)
movq (%rcx), %r14
movq %rdi, -0x78(%rbp)
movzbl 0x39(%rdi), %r12d
xorl %ecx, %ecx
cmpl $0x2, %r12d
setne %cl
leal 0x5(%rcx,%rcx,4), %edi
pushq $0x1
popq %rcx
cmovbl %ecx, %edi
testq %rax, %rax
sete %cl
movq %rsi, -0x88(%rbp)
testw %si, %si
sete %dl
xorl %esi, %esi
orb %cl, %dl
jne 0x58184
movl (%rax), %esi
leal 0x20(,%r12,8), %eax
leal (%rdi,%rdi), %r15d
imull %r15d, %eax
movl %esi, -0x44(%rbp)
movslq %esi, %rbx
addq %rbx, %rbx
addl %ebx, %eax
movslq %eax, %rsi
movq %rdi, -0x80(%rbp)
movq %r14, %rdi
callq 0x132c5
testq %rax, %rax
je 0x5821f
movq %rax, %r13
movq %r14, -0xd8(%rbp)
movq -0x80(%rbp), %rax
shll $0x5, %eax
leaq (%rax,%r13), %r14
xorps %xmm0, %xmm0
movups %xmm0, 0x10(%r13,%rax)
movups %xmm0, (%r13,%rax)
addq %r14, %rax
movq %rax, -0x60(%rbp)
movq %r13, %rax
addq $0x18, %rax
leal (,%r12,8), %ecx
testl %r15d, %r15d
jle 0x58209
movq -0x60(%rbp), %rsi
movq %rsi, (%rax)
decl %r15d
addq $0x20, %rax
addq %rcx, %rsi
movq %rsi, -0x60(%rbp)
jmp 0x581ed
cmpl $0x0, -0x44(%rbp)
je 0x58231
movq -0x60(%rbp), %rdi
xorl %esi, %esi
movq %rbx, %rdx
callq 0xa270
jmp 0x58239
addq $0xe8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq $0x0, -0x60(%rbp)
movq -0xc0(%rbp), %rax
movl 0x1d4(%rax), %eax
cmpl $0x30, %eax
pushq $0x30
popq %rcx
cmovbl %eax, %ecx
movw %cx, 0x10(%r14)
movl -0x44(%rbp), %edx
testl %edx, %edx
je 0x5826b
xorl %eax, %eax
movq %r12, %rcx
negq %rcx
sbbl %eax, %eax
orb %dl, %al
movb %al, 0x16(%r14)
movq -0x78(%rbp), %rax
addq $0x20, %rax
movq %rax, -0xe8(%rbp)
movq -0x88(%rbp), %rax
addl $-0x42, %eax
movl %eax, -0xac(%rbp)
movl %r12d, %eax
movq %rax, -0xc8(%rbp)
xorl %r8d, %r8d
xorl %r9d, %r9d
pushq $0x1
popq %rax
movq %r13, -0x68(%rbp)
xorl %r10d, %r10d
xorl %r11d, %r11d
movq %r12, -0xe0(%rbp)
movq %r13, -0xf0(%rbp)
movq %r14, %rcx
cmpq -0xc8(%rbp), %r8
movq %r14, -0x38(%rbp)
je 0x5867d
leaq (,%r8,8), %rdx
movq %rdx, -0x100(%rbp)
xorl %edi, %edi
testl %eax, %eax
cmovlel %edi, %eax
movl %eax, -0xb0(%rbp)
movq -0x68(%rbp), %rax
addq $0x34, %rax
movq %rax, -0xf8(%rbp)
movzwl %r8w, %eax
movl %eax, -0xb8(%rbp)
movq %rcx, %r12
xorl %r14d, %r14d
movq %r8, -0x98(%rbp)
cmpl -0xb0(%rbp), %r14d
je 0x58664
movq -0xe8(%rbp), %r13
movl %r14d, -0x3c(%rbp)
movq %r12, -0xd0(%rbp)
movq (%r13), %r13
testq %r13, %r13
je 0x58651
movb 0x16(%r12), %dl
andq $0x0, -0x50(%rbp)
movq (%r12), %rbx
movq %rbx, %rax
notq %rax
testq %rax, (%r13)
jne 0x5835e
movq 0x8(%r13), %r14
testq %rbx, %r14
je 0x58364
movl -0x3c(%rbp), %r14d
addq $0x40, %r13
jmp 0x5832a
movl %edi, -0x6c(%rbp)
movl %r11d, -0x54(%rbp)
movq %r10, -0xa0(%rbp)
movq %r9, -0xa8(%rbp)
movswl 0x12(%r13), %edi
movb %dl, -0x90(%rbp)
movzwl 0x10(%r12), %r15d
movzwl 0x14(%r13), %eax
addw %r15w, %ax
movswl %ax, %esi
callq 0x5bc3b
movswl 0x14(%r12), %esi
movswl %ax, %edi
callq 0x5bc3b
movw %ax, -0x2a(%rbp)
addw 0x16(%r13), %r15w
movw %r15w, -0x3e(%rbp)
movb -0x90(%rbp), %r15b
testb %r15b, %r15b
js 0x583d5
movq -0xd0(%rbp), %r12
movq 0x8(%r12), %rax
movq %rax, -0x50(%rbp)
jmp 0x58405
movq -0x78(%rbp), %rdi
movq 0x10(%rdi), %rsi
movzwl 0x32(%rdi), %ecx
leaq -0x50(%rbp), %rax
movq %rax, (%rsp)
movq -0xd0(%rbp), %r12
movq %r12, %rdx
movl -0xb8(%rbp), %r8d
movq %r13, %r9
callq 0x5c4e9
movl %eax, %r15d
movsbl %r15b, %eax
testb %al, %al
sets %dl
movl -0x44(%rbp), %ecx
subl %eax, %ecx
setle %al
orb %dl, %al
movzwl -0x2a(%rbp), %eax
movq -0x80(%rbp), %rsi
movq -0x98(%rbp), %r8
movq -0xa8(%rbp), %r9
movq -0xa0(%rbp), %r10
movl -0x54(%rbp), %r11d
movl -0x6c(%rbp), %edi
jne 0x584d5
movzbl %r15b, %edx
movq -0x60(%rbp), %rax
movzwl (%rax,%rdx,2), %eax
testw %ax, %ax
jne 0x584a9
imull $0x64, %ecx, %eax
movq %rdx, -0x90(%rbp)
cltd
idivl -0x44(%rbp)
movslq %eax, %rdi
callq 0x364ed
movl %eax, -0xb4(%rbp)
movswl -0x88(%rbp), %edi
callq 0x5bbe2
addl -0xac(%rbp), %eax
addl -0xb4(%rbp), %eax
movq -0x78(%rbp), %rcx
movzwl 0x32(%rcx), %ecx
shrl $0x6, %ecx
andl $0x10, %ecx
addl %ecx, %eax
addl $0x10, %eax
movq -0x60(%rbp), %rcx
movq -0x90(%rbp), %rdx
movw %ax, (%rcx,%rdx,2)
movswl -0x2a(%rbp), %edi
movswl %ax, %esi
callq 0x5bc3b
movq -0x80(%rbp), %rsi
movq -0x98(%rbp), %r8
movq -0xa8(%rbp), %r9
movq -0xa0(%rbp), %r10
movl -0x54(%rbp), %r11d
movl -0x6c(%rbp), %edi
orq %rbx, %r14
testl %edi, %edi
movl $0x0, %ecx
cmovgl %edi, %ecx
movq -0x68(%rbp), %rbx
subl $0x1, %ecx
jb 0x58502
cmpq %r14, (%rbx)
jne 0x584fc
movb 0x16(%rbx), %dl
xorb %r15b, %dl
jns 0x585c5
addq $0x20, %rbx
jmp 0x584e6
movl %edi, %ecx
cmpl %esi, %edi
movl -0x3c(%rbp), %r14d
jge 0x5859f
xorl %edx, %edx
cmpl %esi, %edi
setl %dl
addl %edx, %edi
movslq %ecx, %rbx
shlq $0x5, %rbx
addq -0x68(%rbp), %rbx
movq 0x8(%r13), %rcx
orq (%r12), %rcx
movq %rcx, (%rbx)
movq -0x50(%rbp), %rcx
movq %rcx, 0x8(%rbx)
movzwl -0x3e(%rbp), %ecx
movw %cx, 0x10(%rbx)
movw %ax, 0x12(%rbx)
movzwl -0x2a(%rbp), %eax
movw %ax, 0x14(%rbx)
movb %r15b, 0x16(%rbx)
movl %edi, %r14d
movq 0x18(%rbx), %rdi
movq 0x18(%r12), %rsi
movq -0x100(%rbp), %rdx
callq 0xa3b0
movq -0x98(%rbp), %r8
movq -0x80(%rbp), %rdi
movq 0x18(%rbx), %rax
movq %r13, (%rax,%r8,8)
movl %r14d, %ebx
cmpl %edi, %r14d
jge 0x585d4
movq -0x38(%rbp), %rcx
movq -0xa8(%rbp), %r9
movq -0xa0(%rbp), %r10
movl -0x54(%rbp), %r11d
movl %ebx, %edi
jmp 0x5835a
cmpw %r10w, %ax
jg 0x58648
movl %r11d, %ecx
jne 0x58510
movl %r11d, %ecx
cmpw %r9w, -0x2a(%rbp)
jge 0x58648
jmp 0x58510
cmpw %ax, 0x12(%rbx)
jge 0x58630
movq -0x38(%rbp), %rcx
jmp 0x5835a
movq -0x68(%rbp), %rax
movzwl 0x10(%rax), %r9d
movzwl 0x12(%rax), %r10d
xorl %r11d, %r11d
movq -0xf8(%rbp), %rax
pushq $0x1
popq %rcx
movl -0x3c(%rbp), %r14d
cmpl %edi, %ecx
jae 0x58625
movzwl -0x2(%rax), %edx
cmpw %r10w, %dx
jle 0x5860d
movzwl (%rax), %r9d
movl %edx, %r10d
movl %ecx, %r11d
jmp 0x5861d
jne 0x5861d
movzwl (%rax), %esi
cmpw %r9w, %si
jle 0x5861d
movl %esi, %r9d
jmp 0x58605
incl %ecx
addq $0x20, %rax
jmp 0x585f3
movq -0x38(%rbp), %rcx
movl %ebx, %edi
jmp 0x5835e
movl -0x3c(%rbp), %r14d
jne 0x58524
movzwl -0x3e(%rbp), %ecx
cmpw %cx, 0x10(%rbx)
jg 0x58524
movq -0x38(%rbp), %rcx
jmp 0x5835e
incl %r14d
addq $0x20, %r12
movq -0xf0(%rbp), %r13
jmp 0x5830b
incq %r8
movl %edi, %eax
movq -0x68(%rbp), %r14
movq %rcx, -0x68(%rbp)
movq -0xe0(%rbp), %r12
jmp 0x582b5
testl %eax, %eax
movq -0xd8(%rbp), %rbx
movq -0x78(%rbp), %r14
je 0x58798
cltq
addq $0x20, %rcx
pushq $0x1
popq %rdx
cmpq %rax, %rdx
jge 0x586c0
movq -0x38(%rbp), %r8
movzwl 0x12(%r8), %edi
movq %rcx, %rsi
cmpw 0x12(%rcx), %di
jg 0x586b3
movq %r8, %rsi
incq %rdx
addq $0x20, %rcx
movq %rsi, -0x38(%rbp)
jmp 0x58699
leaq 0x388(%r14), %rax
xorl %ecx, %ecx
cmpq %rcx, -0xc8(%rbp)
je 0x58700
movq -0x38(%rbp), %rdx
movq 0x18(%rdx), %rdx
movq (%rdx,%rcx,8), %rdx
movq %rdx, (%rax)
movzbl 0x10(%rdx), %edx
movb %dl, -0x1c(%rax)
movq 0x8(%r14), %rsi
imulq $0x70, %rdx, %rdx
movl 0x4c(%rsi,%rdx), %edx
movl %edx, -0x44(%rax)
incq %rcx
addq $0x58, %rax
jmp 0x586c9
movzwl 0x32(%r14), %eax
andl $0x600, %eax            # imm = 0x600
cmpw $0x400, %ax             # imm = 0x400
movq -0x38(%rbp), %rdx
jne 0x58764
cmpw $0x0, -0x88(%rbp)
je 0x58764
cmpb $0x0, 0x38(%r14)
jne 0x58764
movq 0x18(%r14), %rsi
leaq -0x1(%r12), %rax
movq 0x18(%rdx), %rcx
movq -0x8(%rcx,%r12,8), %r9
leaq -0x50(%rbp), %rcx
movq %rcx, (%rsp)
movzwl %ax, %r8d
movq %r14, %rdi
movl $0x200, %ecx            # imm = 0x200
callq 0x5c4e9
movsbl %al, %eax
movq 0x18(%r14), %rcx
cmpl %eax, (%rcx)
jne 0x58760
movb $0x2, 0x38(%r14)
movq -0x38(%rbp), %rdx
movq 0x10(%r14), %rsi
testq %rsi, %rsi
je 0x58812
movzwl 0x32(%r14), %eax
btl $0x9, %eax
movsbl 0x16(%rdx), %ecx
jb 0x587af
movq %rdx, %rdi
xorl %edx, %edx
testb %cl, %cl
cmovgl %ecx, %edx
movb %dl, 0x34(%r14)
movq 0x8(%rdi), %rcx
movq %rcx, 0x28(%r14)
jmp 0x587b8
leaq 0x162c9(%rip), %rsi     # 0x6ea68
movq -0xc0(%rbp), %rdi
xorl %eax, %eax
callq 0x1357a
jmp 0x5881b
cmpl %ecx, (%rsi)
jne 0x587b8
movb $0x2, 0x38(%r14)
btl $0xb, %eax
movq -0x38(%rbp), %rdx
jae 0x58812
testq %r12, %r12
je 0x58812
movsbl 0x34(%r14), %eax
cmpl %eax, (%rsi)
jne 0x58812
andq $0x0, -0x50(%rbp)
decl %r12d
movq 0x18(%rdx), %rax
movq (%rax,%r12,8), %r9
leaq -0x50(%rbp), %rax
movq %rax, (%rsp)
movzwl %r12w, %r8d
movq %r14, %rdi
xorl %ecx, %ecx
callq 0x5c4e9
movsbl %al, %eax
movq 0x10(%r14), %rcx
cmpl %eax, (%rcx)
jne 0x5880e
movb $0x1, 0x35(%r14)
movq -0x50(%rbp), %rax
movq %rax, 0x28(%r14)
movq -0x38(%rbp), %rdx
movzwl 0x10(%rdx), %eax
movw %ax, 0x30(%r14)
movq %rbx, %rdi
movq %r13, %rsi
addq $0xe8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0xb856