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

Function _pager_write_pagelist

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

Source from the content-addressed store, hash-verified

64428 STACKTOP = sp;return ($$3|0);
64429}
64430function _pager_write_pagelist($0,$1) {
64431 $0 = $0|0;
64432 $1 = $1|0;
64433 var $$051 = 0, $$1$lcssa = 0, $$2 = 0, $$idx$val = 0, $$pre = 0, $$pre$phiZ2D = 0, $$pre53 = 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;
64434 var $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, $13 = 0, $14 = 0, $15 = 0;
64435 var $16 = 0, $17 = 0, $18 = 0, $19 = 0, $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;
64436 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;
64437 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;
64438 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;
64439 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, dest = 0, label = 0, sp = 0, src = 0, stop = 0;
64440 sp = STACKTOP;
64441 STACKTOP = STACKTOP + 16|0;
64442 $2 = sp;
64443 $3 = ((($0)) + 60|0);
64444 $4 = HEAP32[$3>>2]|0;
64445 $5 = HEAP32[$4>>2]|0;
64446 $6 = ($5|0)==(0|0);
64447 if ($6) {
64448 $7 = ((($0)) + 144|0);
64449 $8 = HEAP32[$7>>2]|0;
64450 $$idx$val = HEAP32[$0>>2]|0;
64451 $9 = ((($$idx$val)) + 24|0);
64452 $10 = HEAP32[$9>>2]|0;
64453 $11 = $8 & 556897;
64454 $12 = $11 | 30;
64455 $13 = (FUNCTION_TABLE_iiiiii[$10 & 255]($$idx$val,0,$4,$12,0)|0);
64456 $14 = ($13|0)==(0);
64457 if (!($14)) {
64458 $$1$lcssa = $13;
64459 STACKTOP = sp;return ($$1$lcssa|0);
64460 }
64461 }
64462 $15 = ((($0)) + 36|0);
64463 $16 = HEAP32[$15>>2]|0;
64464 $17 = ((($0)) + 24|0);
64465 $18 = HEAP32[$17>>2]|0;
64466 $19 = ($16>>>0)<($18>>>0);
64467 do {
64468 if ($19) {
64469 $20 = ((($1)) + 16|0);
64470 $21 = HEAP32[$20>>2]|0;
64471 $22 = ($21|0)==(0|0);
64472 if ($22) {
64473 $23 = ((($1)) + 24|0);
64474 $24 = HEAP32[$23>>2]|0;
64475 $25 = ($24>>>0)>($16>>>0);
64476 if (!($25)) {
64477 break;
64478 }
64479 }
64480 $26 = ((($0)) + 152|0);
64481 $27 = HEAP32[$26>>2]|0;
64482 $28 = ($27|0)<(0);
64483 $29 = $28 << 31 >> 31;
64484 $30 = (___muldi3(($18|0),0,($27|0),($29|0))|0);
64485 $31 = tempRet0;
64486 $32 = $2;
64487 $33 = $32;

Callers 2

_pagerStressFunction · 0.85

Calls 2

___muldi3Function · 0.85
_backupUpdateFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…