Function _btreeEndTransaction

js/sql-debug.js:76099–76251

($0)

 return (0)|0;
}
function _btreeEndTransaction($0) {
 $0 = $0|0;
 var $$0$i = 0, $$0$ph25$i = 0, $$012$i = 0, $$013$i = 0, $$phi$trans$insert$phi$trans$insert = 0, $$phi$trans$insert$pre$phiZZZZ2D = 0, $$pr$i = 0, $$pre = 0, $$pre$phiZ2D = 0, $$pre$pre = 0, $$sink3$i = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0;
 var $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0;
 var $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0, $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0, $52 = 0, $53 = 0;
 var $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $62 = 0, $7 = 0, $8 = 0, $9 = 0, $cond = 0, label = 0, sp = 0;
 sp = STACKTOP;
 $1 = ((($0)) + 4|0);
 $2 = HEAP32[$1>>2]|0;
 $3 = HEAP32[$0>>2]|0;
 $4 = ((($2)) + 19|0);
 HEAP8[$4>>0] = 0;
 $5 = ((($0)) + 8|0);
 $6 = HEAP8[$5>>0]|0;
 $cond = ($6<<24>>24)==(0);
 if (!($cond)) {
  $7 = ((($3)) + 164|0);
  $8 = HEAP32[$7>>2]|0;
  $9 = ($8|0)>(1);
  if ($9) {
   $10 = ((($2)) + 76|0);
   $11 = HEAP32[$10>>2]|0;
   $12 = ($11|0)==($0|0);
   if ($12) {
    HEAP32[$10>>2] = 0;
    $13 = ((($2)) + 22|0);
    $14 = HEAP16[$13>>1]|0;
    $15 = $14 & -193;
    HEAP16[$13>>1] = $15;
    $16 = ((($2)) + 72|0);
    $$012$i = HEAP32[$16>>2]|0;
    $17 = ($$012$i|0)==(0|0);
    if (!($17)) {
     $$013$i = $$012$i;
     while(1) {
      $18 = ((($$013$i)) + 8|0);
      HEAP8[$18>>0] = 1;
      $19 = ((($$013$i)) + 12|0);
      $$0$i = HEAP32[$19>>2]|0;
      $20 = ($$0$i|0)==(0|0);
      if ($20) {
       break;
      } else {
       $$013$i = $$0$i;
      }
     }
    }
   }
   HEAP8[$5>>0] = 1;
   return;
  }
  $21 = ((($2)) + 72|0);
  $22 = HEAP32[$21>>2]|0;
  $23 = ($22|0)==(0|0);
  L12: do {
   if (!($23)) {
    $$0$ph25$i = $21;$62 = $22;
    while(1) {