Function _btreeParseCellPtrIndex

js/sql-debug.js:62399–62478

($0,$1,$2)

 }
}
function _btreeParseCellPtrIndex($0,$1,$2) {
 $0 = $0|0;
 $1 = $1|0;
 $2 = $2|0;
 var $$ = 0, $$0$add = 0, $$0$idx = 0, $$035 = 0, $$1 = 0, $$136 = 0, $$idx37 = 0, $$idx37$val = 0, $$idx38 = 0, $$idx38$val = 0, $$idx38$val$idx = 0, $$idx38$val$idx$val = 0, $$ptr = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0;
 var $17 = 0, $18 = 0, $19 = 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, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $or$cond = 0, label = 0, sp = 0;
 sp = STACKTOP;
 $3 = ((($0)) + 10|0);
 $4 = HEAP8[$3>>0]|0;
 $5 = $4&255;
 $6 = (($1) + ($5)|0);
 $7 = HEAP8[$6>>0]|0;
 $8 = $7&255;
 $9 = ($7<<24>>24)<(0);
 if ($9) {
  $10 = $8 & 127;
  $$0$idx = 0;$$035 = $10;
  while(1) {
   $11 = $$035 << 7;
   $$0$add = (($$0$idx) + 1)|0;
   $$ptr = (($6) + ($$0$add)|0);
   $12 = HEAP8[$$ptr>>0]|0;
   $13 = $12 & 127;
   $14 = $13&255;
   $15 = $14 | $11;
   $16 = ($12<<24>>24)<(0);
   $17 = ($$0$add|0)<(8);
   $or$cond = $16 & $17;
   if ($or$cond) {
    $$0$idx = $$0$add;$$035 = $15;
   } else {
    $$1 = $$ptr;$$136 = $15;
    break;
   }
  }
 } else {
  $$1 = $6;$$136 = $8;
 }
 $18 = ((($$1)) + 1|0);
 $19 = $2;
 $20 = $19;
 HEAP32[$20>>2] = $$136;
 $21 = (($19) + 4)|0;
 $22 = $21;
 HEAP32[$22>>2] = 0;
 $23 = ((($2)) + 12|0);
 HEAP32[$23>>2] = $$136;
 $24 = ((($2)) + 8|0);
 HEAP32[$24>>2] = $18;
 $25 = ((($0)) + 14|0);
 $26 = HEAP16[$25>>1]|0;
 $27 = $26&65535;
 $28 = ($$136>>>0)>($27>>>0);
 if ($28) {
  $$idx37 = ((($0)) + 16|0);
  $$idx37$val = HEAP16[$$idx37>>1]|0;
  $$idx38 = ((($0)) + 52|0);