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

Function _pagerAddPageToRollbackJournal

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

Source from the content-addressed store, hash-verified

57892 return (0)|0;
57893}
57894function _pagerAddPageToRollbackJournal($0) {
57895 $0 = $0|0;
57896 var $$0 = 0, $$010$lcssa$i = 0, $$0102$i = 0, $$015$lcssa$i = 0, $$01516$i = 0, $$017$i = 0, $$03$i = 0, $$03$in$i = 0, $$1$i = 0, $$idx = 0, $$idx$val = 0, $$idx41 = 0, $$idx41$val = 0, $$pre$i = 0, $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0;
57897 var $104 = 0, $105 = 0, $106 = 0, $107 = 0, $108 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0;
57898 var $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, $40 = 0, $41 = 0, $42 = 0;
57899 var $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, $59 = 0, $6 = 0, $60 = 0;
57900 var $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, $77 = 0, $78 = 0, $79 = 0;
57901 var $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, $95 = 0, $96 = 0, $97 = 0;
57902 var $98 = 0, $99 = 0, label = 0, sp = 0;
57903 sp = STACKTOP;
57904 STACKTOP = STACKTOP + 16|0;
57905 $1 = sp;
57906 $2 = ((($0)) + 20|0);
57907 $3 = HEAP32[$2>>2]|0;
57908 $4 = ((($3)) + 72|0);
57909 $5 = $4;
57910 $6 = $5;
57911 $7 = HEAP32[$6>>2]|0;
57912 $8 = (($5) + 4)|0;
57913 $9 = $8;
57914 $10 = HEAP32[$9>>2]|0;
57915 $11 = ((($0)) + 4|0);
57916 $12 = HEAP32[$11>>2]|0;
57917 $$idx = ((($3)) + 48|0);
57918 $$idx$val = HEAP32[$$idx>>2]|0;
57919 $$idx41 = ((($3)) + 152|0);
57920 $$idx41$val = HEAP32[$$idx41>>2]|0;
57921 $13 = ($$idx41$val|0)>(200);
57922 if ($13) {
57923 $$0102$i = $$idx$val;$$03$in$i = $$idx41$val;
57924 while(1) {
57925 $$03$i = (($$03$in$i) + -200)|0;
57926 $14 = (($12) + ($$03$i)|0);
57927 $15 = HEAP8[$14>>0]|0;
57928 $16 = $15&255;
57929 $17 = (($16) + ($$0102$i))|0;
57930 $18 = ($$03$i|0)>(200);
57931 if ($18) {
57932 $$0102$i = $17;$$03$in$i = $$03$i;
57933 } else {
57934 $$010$lcssa$i = $17;
57935 break;
57936 }
57937 }
57938 } else {
57939 $$010$lcssa$i = $$idx$val;
57940 }
57941 $19 = ((($0)) + 28|0);
57942 $20 = HEAP16[$19>>1]|0;
57943 $21 = $20 | 8;
57944 HEAP16[$19>>1] = $21;
57945 $22 = ((($3)) + 64|0);
57946 $23 = HEAP32[$22>>2]|0;
57947 $24 = ((($0)) + 24|0);
57948 $25 = HEAP32[$24>>2]|0;
57949 $26 = $25 >>> 24;
57950 $27 = $26&255;
57951 HEAP8[$1>>0] = $27;

Callers 1

_pager_writeFunction · 0.85

Calls 2

_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…