Function _btreeGetHasContent

js/sql-debug.js:53011–53750

($pBt,$pgno)

 STACKTOP = sp;return ($8|0);
}
function _btreeGetHasContent($pBt,$pgno) {
 $pBt = $pBt|0;
 $pgno = $pgno|0;
 var $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $p = 0, label = 0, sp = 0;
 sp = STACKTOP;
 STACKTOP = STACKTOP + 16|0;
 $0 = sp + 8|0;
 $1 = sp + 4|0;
 $p = sp;
 HEAP32[$0>>2] = $pBt;
 HEAP32[$1>>2] = $pgno;
 $2 = HEAP32[$0>>2]|0;
 $3 = ((($2)) + 60|0);
 $4 = HEAP32[$3>>2]|0;
 HEAP32[$p>>2] = $4;
 $5 = HEAP32[$p>>2]|0;
 $6 = ($5|0)!=(0|0);
 if (!($6)) {
  $16 = 0;
  $15 = $16&1;
  STACKTOP = sp;return ($15|0);
 }
 HEAP32[$8>>2] = $13;
 if ($11) {
  $22 = ($13|0)==(0);
  if (!($22)) {
   $$2 = 0;
   STACKTOP = sp;return ($$2|0);
  }
  $23 = ((($0)) + 68|0);
  $24 = HEAP32[$23>>2]|0;
  $25 = HEAP32[$24>>2]|0;
  $26 = ($25|0)==(0|0);
  if ($26) {
   $$2 = 0;
   STACKTOP = sp;return ($$2|0);
  }
  $27 = ($25|0)==(3992|0);
  if ($27) {
   $28 = ((($24)) + 16|0);
   $29 = HEAP32[$28>>2]|0;
   $30 = ($29|0)==(0|0);
   if (!($30)) {
    $$in$i62 = $29;
    while(1) {
     $31 = HEAP32[$$in$i62>>2]|0;
     $32 = HEAP32[2]|0;
     $33 = ($32|0)==(0);
     if ($33) {
      $42 = HEAP32[(56)>>2]|0;
      FUNCTION_TABLE_vi[$42 & 255]($$in$i62);
     } else {
      $34 = HEAP32[(64)>>2]|0;
      $35 = (FUNCTION_TABLE_ii[$34 & 255]($$in$i62)|0);
      $36 = HEAP32[11822]|0;
      $37 = (($36) - ($35))|0;
      HEAP32[11822] = $37;
      $38 = HEAP32[11825]|0;