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

Function _sqlite3PcacheDirtyList

js/sql-debug.js:58418–58641  ·  view source on GitHub ↗
($$0$0$val)

Source from the content-addressed store, hash-verified

58416 return ($$1|0);
58417}
58418function _sqlite3PcacheDirtyList($$0$0$val) {
58419 $$0$0$val = $$0$0$val|0;
58420 var $$0$i$i = 0, $$0$i$i$phi = 0, $$0$i34$i = 0, $$0$i34$i$phi = 0, $$0$i43$i = 0, $$0$i43$i$phi = 0, $$0$ph$i$i = 0, $$0$ph$i$i$phi = 0, $$0$ph$i31$i = 0, $$0$ph$i31$i$phi = 0, $$0$ph$i40$i = 0, $$0$ph$i40$i$phi = 0, $$019$i$i = 0, $$019$i33$i = 0, $$019$i42$i = 0, $$019$ph$i$i = 0, $$019$ph$i30$i = 0, $$019$ph$i39$i = 0, $$020 = 0, $$020$ph$i$i = 0;
58421 var $$020$ph$i29$i = 0, $$020$ph$i38$i = 0, $$02666$i = 0, $$02868$i = 0, $$067$i = 0, $$12764$i = 0, $$165$i = 0, $$2$i = 0, $$pre$i = 0, $$sink$i$i = 0, $$sink$i36$i = 0, $$sink$i45$i = 0, $$sink2$i$i = 0, $$sink2$i35$i = 0, $$sink2$i44$i = 0, $0 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0;
58422 var $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, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0;
58423 var $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, $46 = 0, $47 = 0, $48 = 0, $49 = 0;
58424 var $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, $64 = 0, $65 = 0, $66 = 0, $67 = 0;
58425 var $68 = 0, $69 = 0, $7 = 0, $8 = 0, $9 = 0, $exitcond$i = 0, dest = 0, label = 0, sp = 0, stop = 0;
58426 sp = STACKTOP;
58427 STACKTOP = STACKTOP + 176|0;
58428 $0 = sp + 128|0;
58429 $1 = sp;
58430 $2 = ($$0$0$val|0)==(0|0);
58431 if ($2) {
58432 dest=$1; stop=dest+128|0; do { HEAP32[dest>>2]=0|0; dest=dest+4|0; } while ((dest|0) < (stop|0));
58433 $68 = $1;$69 = 0;
58434 } else {
58435 $$020 = $$0$0$val;
58436 while(1) {
58437 $3 = ((($$020)) + 32|0);
58438 $4 = HEAP32[$3>>2]|0;
58439 $5 = ((($$020)) + 16|0);
58440 HEAP32[$5>>2] = $4;
58441 $6 = ($4|0)==(0|0);
58442 if ($6) {
58443 break;
58444 } else {
58445 $$020 = $4;
58446 }
58447 }
58448 dest=$1; stop=dest+128|0; do { HEAP32[dest>>2]=0|0; dest=dest+4|0; } while ((dest|0) < (stop|0));
58449 if ($2) {
58450 $68 = $1;$69 = 0;
58451 } else {
58452 $7 = ((($0)) + 16|0);
58453 $8 = ((($0)) + 16|0);
58454 $9 = ((($1)) + 124|0);
58455 $$02868$i = $$0$0$val;
58456 while(1) {
58457 $10 = ((($$02868$i)) + 16|0);
58458 $11 = HEAP32[$10>>2]|0;
58459 HEAP32[$10>>2] = 0;
58460 $$02666$i = $$02868$i;$$067$i = 0;
58461 while(1) {
58462 $12 = (($1) + ($$067$i<<2)|0);
58463 $13 = HEAP32[$12>>2]|0;
58464 $14 = ($13|0)==(0|0);
58465 if ($14) {
58466 label = 8;
58467 break;
58468 }
58469 $$0$ph$i$i = $0;$$019$ph$i$i = $$02666$i;$$020$ph$i$i = $13;
58470 L12: while(1) {
58471 $15 = ((($$020$ph$i$i)) + 24|0);
58472 $16 = HEAP32[$15>>2]|0;
58473 $$0$i$i = $$0$ph$i$i;$$019$i$i = $$019$ph$i$i;
58474 while(1) {
58475 $17 = ((($$019$i$i)) + 24|0);

Callers 2

_btreeGetHasContentFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…