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

Function _btreePrevious

js/sql-debug.js:288332–288727  ·  view source on GitHub ↗
($0)

Source from the content-addressed store, hash-verified

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;
288335 var $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0, $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0;
288336 var $128 = 0, $129 = 0, $13 = 0, $130 = 0, $131 = 0, $132 = 0, $133 = 0, $134 = 0, $135 = 0, $136 = 0, $137 = 0, $138 = 0, $139 = 0, $14 = 0, $140 = 0, $141 = 0, $142 = 0, $143 = 0, $144 = 0, $145 = 0;
288337 var $146 = 0, $147 = 0, $148 = 0, $149 = 0, $15 = 0, $150 = 0, $151 = 0, $152 = 0, $153 = 0, $154 = 0, $155 = 0, $156 = 0, $157 = 0, $158 = 0, $159 = 0, $16 = 0, $160 = 0, $161 = 0, $162 = 0, $163 = 0;
288338 var $164 = 0, $165 = 0, $166 = 0, $167 = 0, $168 = 0, $169 = 0, $17 = 0, $170 = 0, $171 = 0, $172 = 0, $173 = 0, $174 = 0, $175 = 0, $176 = 0, $177 = 0, $178 = 0, $179 = 0, $18 = 0, $180 = 0, $181 = 0;
288339 var $182 = 0, $183 = 0, $184 = 0, $185 = 0, $186 = 0, $187 = 0, $188 = 0, $189 = 0, $19 = 0, $190 = 0, $191 = 0, $192 = 0, $193 = 0, $194 = 0, $195 = 0, $196 = 0, $197 = 0, $198 = 0, $199 = 0, $2 = 0;
288340 var $20 = 0, $200 = 0, $201 = 0, $202 = 0, $203 = 0, $204 = 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;
288341 var $34 = 0, $35 = 0, $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;
288342 var $52 = 0, $53 = 0, $54 = 0, $55 = 0, $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;
288343 var $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0, $80 = 0, $81 = 0, $82 = 0, $83 = 0, $84 = 0, $85 = 0, $86 = 0, $87 = 0, $88 = 0;
288344 var $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $or$cond = 0, $vararg_buffer = 0, $vararg_buffer3 = 0, $vararg_ptr1 = 0, $vararg_ptr2 = 0, $vararg_ptr6 = 0, $vararg_ptr7 = 0, label = 0;
288345 var sp = 0;
288346 sp = STACKTOP;
288347 STACKTOP = STACKTOP + 32|0;
288348 $vararg_buffer3 = sp + 16|0;
288349 $vararg_buffer = sp;
288350 $1 = sp + 28|0;
288351 $2 = HEAP8[$0>>0]|0;
288352 $3 = ($2<<24>>24)==(1);
288353 if (!($3)) {
288354 $4 = ($2&255)>(2);
288355 do {
288356 if ($4) {
288357 $5 = ($2<<24>>24)==(4);
288358 if ($5) {
288359 $35 = ((($0)) + 64|0);
288360 $36 = HEAP32[$35>>2]|0;
288361 $37 = ($36|0)==(0);
288362 if ($37) {
288363 break;
288364 } else {
288365 $$1 = $36;
288366 }
288367 STACKTOP = sp;return ($$1|0);
288368 }
288369 HEAP8[$0>>0] = 0;
288370 $6 = ((($0)) + 56|0);
288371 $7 = HEAP32[$6>>2]|0;
288372 $8 = ((($0)) + 48|0);
288373 $9 = $8;
288374 $10 = $9;
288375 $11 = HEAP32[$10>>2]|0;
288376 $12 = (($9) + 4)|0;
288377 $13 = $12;
288378 $14 = HEAP32[$13>>2]|0;
288379 $15 = (_btreeMoveto($0,$7,$11,$14,0,$1)|0);
288380 $16 = ($15|0)==(0);
288381 if (!($16)) {
288382 $$1 = $15;
288383 STACKTOP = sp;return ($$1|0);
288384 }
288385 $17 = HEAP32[$6>>2]|0;
288386 $18 = ($17|0)==(0|0);
288387 do {
288388 if (!($18)) {
288389 $19 = HEAP32[2]|0;

Callers 3

_sqlite3VdbeExecFunction · 0.85
_sqlite3BtreePreviousFunction · 0.85
_sqlite3BtreeDeleteFunction · 0.85

Calls 4

_btreeMovetoFunction · 0.85
_sqlite3_logFunction · 0.85
_getAndInitPageFunction · 0.85
_sqlite3PcacheReleaseFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…