// File: /workspace/github_c_makefile_star2_O2/shifengbin[P]bishe/Output/../Persistence/sqlite3.c
// Function: btreeInitPage
static int btreeInitPage(MemPage *pPage){

  assert( pPage->pBt!=0 );
  assert( pPage->pBt->db!=0 );
  assert( sqlite3_mutex_held(pPage->pBt->mutex) );
  assert( pPage->pgno==sqlite3PagerPagenumber(pPage->pDbPage) );
  assert( pPage == sqlite3PagerGetExtra(pPage->pDbPage) );
  assert( pPage->aData == sqlite3PagerGetData(pPage->pDbPage) );

  if( !pPage->isInit ){
    u16 pc;            /* Address of a freeblock within pPage->aData[] */
    u8 hdr;            /* Offset to beginning of page header */
    u8 *data;          /* Equal to pPage->aData */
    BtShared *pBt;        /* The main btree structure */
    int usableSize;    /* Amount of usable space on each page */
    u16 cellOffset;    /* Offset from start of page to first cell pointer */
    int nFree;         /* Number of unused bytes on the page */
    int top;           /* First byte of the cell content area */
    int iCellFirst;    /* First allowable cell or freeblock offset */
    int iCellLast;     /* Last possible cell or freeblock offset */

    pBt = pPage->pBt;

    hdr = pPage->hdrOffset;
    data = pPage->aData;
    /* EVIDENCE-OF: R-28594-02890 The one-byte flag at offset 0 indicating
    ** the b-tree page type. */
    if( decodeFlags(pPage, data[hdr]) ) return SQLITE_CORRUPT_BKPT;
    assert( pBt->pageSize>=512 && pBt->pageSize<=65536 );
    pPage->maskPage = (u16)(pBt->pageSize - 1);
    pPage->nOverflow = 0;
    usableSize = pBt->usableSize;
    pPage->cellOffset = cellOffset = hdr + 8 + pPage->childPtrSize;
    pPage->aDataEnd = &data[usableSize];
    pPage->aCellIdx = &data[cellOffset];
    pPage->aDataOfst = &data[pPage->childPtrSize];
    /* EVIDENCE-OF: R-58015-48175 The two-byte integer at offset 5 designates
    ** the start of the cell content area. A zero value for this integer is
    ** interpreted as 65536. */
    top = get2byteNotZero(&data[hdr+5]);
    /* EVIDENCE-OF: R-37002-32774 The two-byte integer at offset 3 gives the
    ** number of cells on the page. */
    pPage->nCell = get2byte(&data[hdr+3]);
    if( pPage->nCell>MX_CELL(pBt) ){
      /* To many cells for a single page.  The page must be corrupt */
      return SQLITE_CORRUPT_BKPT;
    }
    testcase( pPage->nCell==MX_CELL(pBt) );
    /* EVIDENCE-OF: R-24089-57979 If a page contains no cells (which is only
    ** possible for a root page of a table that contains no rows) then the
    ** offset to the cell content area will equal the page size minus the
    ** bytes of reserved space. */
    assert( pPage->nCell>0 || top==usableSize || CORRUPT_DB );

    /* A malformed database page might cause us to read past the end
    ** of page when parsing a cell.  
    **
    ** The following block of code checks early to see if a cell extends
    ** past the end of a page boundary and causes SQLITE_CORRUPT to be 
    ** returned if it does.
    */
    iCellFirst = cellOffset + 2*pPage->nCell;
    iCellLast = usableSize - 4;
    if( pBt->db->flags & SQLITE_CellSizeCk ){
      int i;            /* Index into the cell pointer array */
      int sz;           /* Size of a cell */

      if( !pPage->leaf ) iCellLast--;
      for(i=0; i<pPage->nCell; i++){
        pc = get2byteAligned(&data[cellOffset+i*2]);
        testcase( pc==iCellFirst );
        testcase( pc==iCellLast );
        if( pc<iCellFirst || pc>iCellLast ){
          return SQLITE_CORRUPT_BKPT;
        }
        sz = pPage->xCellSize(pPage, &data[pc]);
        testcase( pc+sz==usableSize );
        if( pc+sz>usableSize ){
          return SQLITE_CORRUPT_BKPT;
        }
      }
      if( !pPage->leaf ) iCellLast++;
    }  

    /* Compute the total free space on the page
    ** EVIDENCE-OF: R-23588-34450 The two-byte integer at offset 1 gives the
    ** start of the first freeblock on the page, or is zero if there are no
    ** freeblocks. */
    pc = get2byte(&data[hdr+1]);
    nFree = data[hdr+7] + top;  /* Init nFree to non-freeblock free space */
    while( pc>0 ){
      u16 next, size;
      if( pc<iCellFirst || pc>iCellLast ){
        /* EVIDENCE-OF: R-55530-52930 In a well-formed b-tree page, there will
        ** always be at least one cell before the first freeblock.
        **
        ** Or, the freeblock is off the end of the page
        */
        return SQLITE_CORRUPT_BKPT; 
      }
      next = get2byte(&data[pc]);
      size = get2byte(&data[pc+2]);
      if( (next>0 && next<=pc+size+3) || pc+size>usableSize ){
        /* Free blocks must be in ascending order. And the last byte of
        ** the free-block must lie on the database page.  */
        return SQLITE_CORRUPT_BKPT; 
      }
      nFree = nFree + size;
      pc = next;
    }

    /* At this point, nFree contains the sum of the offset to the start
    ** of the cell-content area plus the number of free bytes within
    ** the cell-content area. If this is greater than the usable-size
    ** of the page, then the page must be corrupted. This check also
    ** serves to verify that the offset to the start of the cell-content
    ** area, according to the page header, lies within the page.
    */
    if( nFree>usableSize ){
      return SQLITE_CORRUPT_BKPT; 
    }
    pPage->nFree = (u16)(nFree - iCellFirst);
    pPage->isInit = 1;
  }
  return SQLITE_OK;
}

// Assembly:
xorl %eax, %eax
cmpb $0x0, (%rdi)
je 0x1f081
retq
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdi, %rbx
movq 0x48(%rdi), %r15
movq 0x50(%rdi), %r14
movzbl 0x6(%rdi), %r12d
movzbl (%r14,%r12), %esi
callq 0x1f2a3
testl %eax, %eax
je 0x1f0ba
movl $0xde2f, %edi           # imm = 0xDE2F
jmp 0x1f27e
movl 0x30(%r15), %eax
leal -0x1(%rax), %ecx
movw %cx, 0x14(%rbx)
movb $0x0, 0x1(%rbx)
movslq 0x34(%r15), %r9
movzbl 0x7(%rbx), %edx
leal (%r12,%rdx), %ecx
leal 0x8(%r12,%rdx), %esi
movw %si, 0xe(%rbx)
leaq (%r14,%r9), %rsi
movq %rsi, 0x58(%rbx)
leaq (%r14,%rcx), %rsi
addq $0x8, %rsi
movq %rsi, 0x60(%rbx)
addq %r14, %rdx
movq %rdx, 0x68(%rbx)
movzbl 0x5(%r14,%r12), %r8d
movzbl 0x6(%r14,%r12), %r13d
movzwl 0x3(%r14,%r12), %edx
rolw $0x8, %dx
movzwl %dx, %esi
movw %si, 0x12(%rbx)
addl $-0x8, %eax
pushq $0x6
popq %rdi
xorl %edx, %edx
divl %edi
cmpl %esi, %eax
jae 0x1f12e
movl $0xde41, %edi           # imm = 0xDE41
jmp 0x1f27e
addq $0x8, %rcx
leal (%rcx,%rsi,2), %r10d
leal -0x4(%r9), %r11d
movq 0x8(%r15), %rax
testb $0x10, 0x2f(%rax)
je 0x1f1f1
movq %r13, -0x40(%rbp)
movq %r8, -0x48(%rbp)
movq %r12, -0x50(%rbp)
leal -0x5(%r9), %eax
cmpb $0x0, 0x5(%rbx)
cmovel %eax, %r11d
movq %r14, -0x38(%rbp)
leaq (%rcx,%r14), %rax
incq %rax
movq %rax, -0x58(%rbp)
xorl %r13d, %r13d
movl %r11d, -0x2c(%rbp)
movzwl 0x12(%rbx), %eax
cmpq %rax, %r13
jae 0x1f1d9
movq -0x58(%rbp), %rax
movzwl -0x1(%rax,%r13,2), %eax
rolw $0x8, %ax
movzwl %ax, %r15d
cmpl %r15d, %r10d
ja 0x1f279
cmpl %r15d, %r11d
jl 0x1f279
movq -0x38(%rbp), %rax
leaq (%rax,%r15), %rsi
movq %rbx, %rdi
movq %r9, %r12
movl %r10d, %r14d
callq *0x78(%rbx)
movl -0x2c(%rbp), %r11d
movl %r14d, %r10d
movq %r12, %r9
movzwl %ax, %eax
addl %r15d, %eax
incq %r13
cmpl %r9d, %eax
jle 0x1f176
movl $0xde62, %edi           # imm = 0xDE62
jmp 0x1f27e
cmpb $0x1, 0x5(%rbx)
adcl $0x0, %r11d
movq -0x50(%rbp), %r12
movq -0x38(%rbp), %r14
movq -0x48(%rbp), %r8
movq -0x40(%rbp), %r13
shll $0x8, %r8d
leal (%r8,%r13), %eax
decl %eax
movzwl %ax, %edx
incl %edx
movzwl 0x1(%r14,%r12), %ecx
rolw $0x8, %cx
movzbl 0x7(%r14,%r12), %eax
addl %edx, %eax
testw %cx, %cx
je 0x1f266
movzwl %cx, %edx
cmpl %edx, %r10d
ja 0x1f272
cmpl %edx, %r11d
jl 0x1f272
movl %edx, %esi
movzwl (%r14,%rsi), %ecx
rolw $0x8, %cx
movzwl 0x2(%r14,%rsi), %esi
rolw $0x8, %si
testw %cx, %cx
je 0x1f253
movzwl %cx, %edi
movzwl %si, %esi
leal (%rdx,%rsi), %r8d
addl $0x3, %r8d
cmpl %edi, %r8d
jb 0x1f256
jmp 0x1f25f
movzwl %si, %esi
addl %esi, %edx
addl %esi, %eax
cmpl %r9d, %edx
jle 0x1f212
movl $0xde7d, %edi           # imm = 0xDE7D
jmp 0x1f27e
cmpl %r9d, %eax
jle 0x1f295
movl $0xde8b, %edi           # imm = 0xDE8B
jmp 0x1f27e
movl $0xde76, %edi           # imm = 0xDE76
jmp 0x1f27e
movl $0xde5d, %edi           # imm = 0xDE5D
callq 0x1ec07
pushq $0xb
popq %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
subl %r10d, %eax
movw %ax, 0x10(%rbx)
movb $0x1, (%rbx)
xorl %eax, %eax
jmp 0x1f286