MCPcopy
hub / github.com/sql-js/sql.js / _subjournalPageIfRequired

Function _subjournalPageIfRequired

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

Source from the content-addressed store, hash-verified

56529 STACKTOP = sp;return ($$1$lcssa|0);
56530}
56531function _subjournalPageIfRequired($0) {
56532 $0 = $0|0;
56533 var $$0 = 0, $$0$i$i = 0, $$012$i$i = 0, $$01516$i$i = 0, $$017$i$i = 0, $$028$i$i = 0, $$029$i$i = 0, $$033$i$i = 0, $$034$i$i = 0, $$06$i = 0, $$1$i$i = 0, $$idx = 0, $$idx$val = 0, $$idx2 = 0, $$idx2$val = 0, $$pre = 0, $$pre$i = 0, $$pre$i$i = 0, $$pre$phi$iZ2D = 0, $$sink$i$i$i = 0;
56534 var $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0, $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0, $116 = 0;
56535 var $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0;
56536 var $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, $38 = 0, $39 = 0, $4 = 0;
56537 var $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, $56 = 0, $57 = 0, $58 = 0;
56538 var $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, $73 = 0, $74 = 0, $75 = 0, $76 = 0;
56539 var $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, $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0;
56540 var $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $not$$i$i = 0, dest = 0, label = 0, sp = 0, stop = 0;
56541 sp = STACKTOP;
56542 STACKTOP = STACKTOP + 16|0;
56543 $1 = sp;
56544 $$idx = ((($0)) + 20|0);
56545 $$idx$val = HEAP32[$$idx>>2]|0;
56546 $$idx2 = ((($0)) + 24|0);
56547 $$idx2$val = HEAP32[$$idx2>>2]|0;
56548 $2 = ((($$idx$val)) + 96|0);
56549 $3 = HEAP32[$2>>2]|0;
56550 $4 = ($3|0)>(0);
56551 if (!($4)) {
56552 $$0 = 0;
56553 STACKTOP = sp;return ($$0|0);
56554 }
56555 $5 = ((($$idx$val)) + 92|0);
56556 $6 = HEAP32[$5>>2]|0;
56557 $7 = (($$idx2$val) + -1)|0;
56558 $$06$i = 0;
56559 L4: while(1) {
56560 $8 = (((($6) + (($$06$i*48)|0)|0)) + 20|0);
56561 $9 = HEAP32[$8>>2]|0;
56562 $10 = ($9>>>0)<($$idx2$val>>>0);
56563 L6: do {
56564 if (!($10)) {
56565 $11 = (((($6) + (($$06$i*48)|0)|0)) + 16|0);
56566 $12 = HEAP32[$11>>2]|0;
56567 $13 = HEAP32[$12>>2]|0;
56568 $14 = ($7>>>0)<($13>>>0);
56569 if ($14) {
56570 $$028$i$i = $7;$$029$i$i = $12;
56571 } else {
56572 break L4;
56573 }
56574 while(1) {
56575 $15 = ((($$029$i$i)) + 8|0);
56576 $16 = HEAP32[$15>>2]|0;
56577 $17 = ($16|0)==(0);
56578 if ($17) {
56579 break;
56580 }
56581 $18 = (($$028$i$i>>>0) / ($16>>>0))&-1;
56582 $19 = (($$028$i$i>>>0) % ($16>>>0))&-1;
56583 $20 = ((($$029$i$i)) + 12|0);
56584 $21 = (($20) + ($18<<2)|0);
56585 $22 = HEAP32[$21>>2]|0;
56586 $not$$i$i = ($22|0)==(0|0);
56587 if ($not$$i$i) {
56588 break L4;

Callers 15

_pagerStressFunction · 0.85
_backupOnePageFunction · 0.85
_pager_writeFunction · 0.85
_sqlite3_backup_stepFunction · 0.85
_sqlite3BtreeBeginTransFunction · 0.85
_newDatabaseFunction · 0.85
_allocateBtreePageFunction · 0.85
_relocatePageFunction · 0.85
_ptrmapPutFunction · 0.85
_accessPayloadFunction · 0.85

Calls 4

_sqlite3_logFunction · 0.85
___muldi3Function · 0.85
_i64AddFunction · 0.85
_sqlite3BitvecSetFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…