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

Function _sqlite3BtreePrevious

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

Source from the content-addressed store, hash-verified

288295 return (0)|0;
288296}
288297function _sqlite3BtreePrevious($0,$1) {
288298 $0 = $0|0;
288299 $1 = $1|0;
288300 var $$0 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0;
288301 sp = STACKTOP;
288302 $2 = ((($0)) + 1|0);
288303 $3 = HEAP8[$2>>0]|0;
288304 $4 = $3 & -15;
288305 HEAP8[$2>>0] = $4;
288306 $5 = ((($0)) + 42|0);
288307 HEAP16[$5>>1] = 0;
288308 $6 = HEAP8[$0>>0]|0;
288309 $7 = ($6<<24>>24)==(1);
288310 if ($7) {
288311 $8 = ((($0)) + 70|0);
288312 $9 = HEAP16[$8>>1]|0;
288313 $10 = ($9<<16>>16)==(0);
288314 if (!($10)) {
288315 $11 = ((($0)) + 116|0);
288316 $12 = HEAP32[$11>>2]|0;
288317 $13 = ((($12)) + 8|0);
288318 $14 = HEAP8[$13>>0]|0;
288319 $15 = ($14<<24>>24)==(0);
288320 if (!($15)) {
288321 $17 = (($9) + -1)<<16>>16;
288322 HEAP16[$8>>1] = $17;
288323 $$0 = 0;
288324 return ($$0|0);
288325 }
288326 }
288327 }
288328 $16 = (_btreePrevious($0)|0);
288329 $$0 = $16;
288330 return ($$0|0);
288331}
288332function _btreePrevious($0) {
288333 $0 = $0|0;
288334 var $$1 = 0, $$idx$i = 0, $$idx$val$i = 0, $$lcssa51 = 0, $$pre = 0, $$pre$pre = 0, $$pre60 = 0, $$pre61 = 0, $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0, $108 = 0, $109 = 0;

Callers

nothing calls this directly

Calls 1

_btreePreviousFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…