MCPcopy Index your code
hub / github.com/sql-js/sql.js / _pagerUndoCallback

Function _pagerUndoCallback

js/sql-debug.js:58075–58227  ·  view source on GitHub ↗
($0,$1)

Source from the content-addressed store, hash-verified

58073 STACKTOP = sp;return ($$0|0);
58074}
58075function _pagerUndoCallback($0,$1) {
58076 $0 = $0|0;
58077 $1 = $1|0;
58078 var $$0 = 0, $$0$i17 = 0, $$05$i = 0, $$idx$phi$trans$insert = 0, $$idx$val = 0, $$idx$val$pre = 0, $$idx7$i = 0, $$idx7$val$i = 0, $$pre$i = 0, $$sink$i$i = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0;
58079 var $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, $36 = 0, $37 = 0;
58080 var $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, $54 = 0, $55 = 0;
58081 var $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $70 = 0, $71 = 0, $72 = 0, $8 = 0;
58082 var $9 = 0, label = 0, sp = 0;
58083 sp = STACKTOP;
58084 $2 = ((($0)) + 208|0);
58085 $3 = HEAP32[$2>>2]|0;
58086 $$idx7$i = ((($3)) + 44|0);
58087 $$idx7$val$i = HEAP32[$$idx7$i>>2]|0;
58088 $4 = HEAP32[(148)>>2]|0;
58089 $5 = (FUNCTION_TABLE_iiii[$4 & 255]($$idx7$val$i,$1,0)|0);
58090 $6 = ($5|0)==(0|0);
58091 do {
58092 if ($6) {
58093 $$0 = 0;
58094 } else {
58095 $7 = HEAP32[$2>>2]|0;
58096 $8 = ((($5)) + 4|0);
58097 $9 = HEAP32[$8>>2]|0;
58098 $10 = HEAP32[$9>>2]|0;
58099 $11 = ($10|0)==(0|0);
58100 if ($11) {
58101 $18 = (_pcacheFetchFinishWithInit($7,$1,$5)|0);
58102 $19 = ($18|0)==(0|0);
58103 if ($19) {
58104 $$0 = 0;
58105 break;
58106 }
58107 $$idx$phi$trans$insert = ((($18)) + 30|0);
58108 $$idx$val$pre = HEAP16[$$idx$phi$trans$insert>>1]|0;
58109 $$0$i17 = $18;$$idx$val = $$idx$val$pre;
58110 } else {
58111 $12 = ((($7)) + 12|0);
58112 $13 = HEAP32[$12>>2]|0;
58113 $14 = (($13) + 1)|0;
58114 HEAP32[$12>>2] = $14;
58115 $15 = ((($9)) + 30|0);
58116 $16 = HEAP16[$15>>1]|0;
58117 $17 = (($16) + 1)<<16>>16;
58118 HEAP16[$15>>1] = $17;
58119 $$0$i17 = $9;$$idx$val = $17;
58120 }
58121 $20 = ($$idx$val<<16>>16)==(1);
58122 if (!($20)) {
58123 $50 = (_readDbPage($$0$i17)|0);
58124 $51 = ($50|0)==(0);
58125 if ($51) {
58126 $52 = ((($0)) + 196|0);
58127 $53 = HEAP32[$52>>2]|0;
58128 FUNCTION_TABLE_vi[$53 & 255]($$0$i17);
58129 }
58130 $54 = ((($$0$i17)) + 28|0);
58131 $55 = HEAP16[$54>>1]|0;
58132 $56 = $55 & 32;

Callers 1

_btreeGetHasContentFunction · 0.85

Calls 3

_readDbPageFunction · 0.85
_sqlite3PcacheReleaseFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…