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

Function _btreeParseCellPtr

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

Source from the content-addressed store, hash-verified

62218 return;
62219}
62220function _btreeParseCellPtr($0,$1,$2) {
62221 $0 = $0|0;
62222 $1 = $1|0;
62223 $2 = $2|0;
62224 var $$ = 0, $$0$add = 0, $$0$idx = 0, $$050 = 0, $$1 = 0, $$151 = 0, $$4 = 0, $$idx57 = 0, $$idx57$val = 0, $$idx58 = 0, $$idx58$val = 0, $$idx58$val$idx = 0, $$idx58$val$idx$val = 0, $$ptr = 0, $$ptr$1 = 0, $$ptr$2 = 0, $$ptr$3 = 0, $$ptr$4 = 0, $$ptr$5 = 0, $$ptr$6 = 0;
62225 var $$ptr55 = 0, $$ptr56 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0;
62226 var $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $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;
62227 var $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0, $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;
62228 var $64 = 0, $65 = 0, $66 = 0, $67 = 0, $68 = 0, $69 = 0, $7 = 0, $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;
62229 var $82 = 0, $83 = 0, $84 = 0, $85 = 0, $86 = 0, $87 = 0, $88 = 0, $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $or$cond = 0, label = 0, sp = 0;
62230 sp = STACKTOP;
62231 $3 = HEAP8[$1>>0]|0;
62232 $4 = $3&255;
62233 $5 = ($3<<24>>24)<(0);
62234 if ($5) {
62235 $6 = $4 & 127;
62236 $$0$idx = 0;$$050 = $6;
62237 while(1) {
62238 $7 = $$050 << 7;
62239 $$0$add = (($$0$idx) + 1)|0;
62240 $$ptr56 = (($1) + ($$0$add)|0);
62241 $8 = HEAP8[$$ptr56>>0]|0;
62242 $9 = $8 & 127;
62243 $10 = $9&255;
62244 $11 = $10 | $7;
62245 $12 = ($8<<24>>24)<(0);
62246 $13 = ($$0$add|0)<(8);
62247 $or$cond = $12 & $13;
62248 if ($or$cond) {
62249 $$0$idx = $$0$add;$$050 = $11;
62250 } else {
62251 $$1 = $$ptr56;$$151 = $11;
62252 break;
62253 }
62254 }
62255 } else {
62256 $$1 = $1;$$151 = $4;
62257 }
62258 $$ptr55 = ((($$1)) + 1|0);
62259 $14 = HEAP8[$$ptr55>>0]|0;
62260 $15 = $14&255;
62261 $16 = ($14<<24>>24)<(0);
62262 if ($16) {
62263 $17 = (_bitshift64Shl(($15|0),0,7)|0);
62264 $18 = tempRet0;
62265 $19 = $17 & 16256;
62266 $$ptr = ((($$1)) + 2|0);
62267 $20 = HEAP8[$$ptr>>0]|0;
62268 $21 = $20 & 127;
62269 $22 = $21&255;
62270 $23 = $22 | $19;
62271 $24 = ($20<<24>>24)>(-1);
62272 if ($24) {
62273 $$4 = $$ptr;$35 = $23;$38 = 0;
62274 } else {
62275 $25 = (_bitshift64Shl(($23|0),0,7)|0);
62276 $26 = tempRet0;
62277 $$ptr$1 = ((($$1)) + 3|0);

Callers

nothing calls this directly

Calls 2

_bitshift64ShlFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…