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

Function _sqlite3PagerClose

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

Source from the content-addressed store, hash-verified

50538 return ($$0$i|0);
50539}
50540function _sqlite3PagerClose($0,$1) {
50541 $0 = $0|0;
50542 $1 = $1|0;
50543 var $$1$i = 0, $$idx = 0, $$idx$val = 0, $$idx1 = 0, $$idx1$val = 0, $$in1$i = 0, $$pre = 0, $$pre3 = 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;
50544 var $110 = 0, $111 = 0, $112 = 0, $113 = 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, $25 = 0, $26 = 0;
50545 var $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, $43 = 0, $44 = 0;
50546 var $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, $61 = 0, $62 = 0;
50547 var $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, $8 = 0, $80 = 0;
50548 var $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, $98 = 0, $99 = 0;
50549 var $getPageNormal$sink$i$i = 0, $or$cond$i$i = 0, $trunc$i = 0, label = 0, sp = 0;
50550 sp = STACKTOP;
50551 $2 = ((($0)) + 204|0);
50552 $3 = HEAP32[$2>>2]|0;
50553 $$idx = ((($0)) + 136|0);
50554 $$idx$val = HEAP32[$$idx>>2]|0;
50555 $4 = ($$idx$val|0)==(0|0);
50556 if (!($4)) {
50557 $$in1$i = $$idx$val;
50558 while(1) {
50559 $5 = ((($$in1$i)) + 16|0);
50560 $6 = HEAP32[$5>>2]|0;
50561 $7 = HEAP32[2]|0;
50562 $8 = ($7|0)==(0);
50563 if ($8) {
50564 $17 = HEAP32[(56)>>2]|0;
50565 FUNCTION_TABLE_vi[$17 & 255]($$in1$i);
50566 } else {
50567 $9 = HEAP32[(64)>>2]|0;
50568 $10 = (FUNCTION_TABLE_ii[$9 & 255]($$in1$i)|0);
50569 $11 = HEAP32[11822]|0;
50570 $12 = (($11) - ($10))|0;
50571 HEAP32[11822] = $12;
50572 $13 = HEAP32[11825]|0;
50573 $14 = (($13) + -1)|0;
50574 HEAP32[11825] = $14;
50575 $15 = HEAP32[(56)>>2]|0;
50576 FUNCTION_TABLE_vi[$15 & 255]($$in1$i);
50577 }
50578 $16 = ($6|0)==(0|0);
50579 if ($16) {
50580 break;
50581 } else {
50582 $$in1$i = $6;
50583 }
50584 }
50585 }
50586 $18 = ((($0)) + 4|0);
50587 HEAP8[$18>>0] = 0;
50588 $19 = ((($0)) + 212|0);
50589 $20 = HEAP32[$19>>2]|0;
50590 $21 = ((($0)) + 11|0);
50591 $22 = HEAP8[$21>>0]|0;
50592 $23 = $22&255;
50593 $24 = ((($0)) + 152|0);
50594 $25 = HEAP32[$24>>2]|0;
50595 $26 = ($1|0)==(0|0);
50596 if ($26) {
50597 label = 8;

Callers 2

_sqlite3BtreeOpenFunction · 0.85
_sqlite3BtreeCloseFunction · 0.85

Calls 5

_sqlite3WalCloseFunction · 0.85
_pager_resetFunction · 0.85
_pager_end_transactionFunction · 0.85
_sqlite3PagerRollbackFunction · 0.85
_pager_unlockFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…