MCPcopy Index your code
hub / github.com/sql-js/sql.js / _sqlite3VdbeAddOp2

Function _sqlite3VdbeAddOp2

js/sql-debug.js:245546–245589  ·  view source on GitHub ↗
($0,$1,$2,$3)

Source from the content-addressed store, hash-verified

245544 return (0)|0;
245545}
245546function _sqlite3VdbeAddOp2($0,$1,$2,$3) {
245547 $0 = $0|0;
245548 $1 = $1|0;
245549 $2 = $2|0;
245550 $3 = $3|0;
245551 var $$0$i = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $20 = 0, $21 = 0, $22 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0;
245552 var label = 0, sp = 0;
245553 sp = STACKTOP;
245554 $4 = ((($0)) + 136|0);
245555 $5 = HEAP32[$4>>2]|0;
245556 $6 = ((($0)) + 12|0);
245557 $7 = HEAP32[$6>>2]|0;
245558 $8 = ((($7)) + 48|0);
245559 $9 = HEAP32[$8>>2]|0;
245560 $10 = ($9|0)>($5|0);
245561 if ($10) {
245562 $12 = (($5) + 1)|0;
245563 HEAP32[$4>>2] = $12;
245564 $13 = ((($0)) + 88|0);
245565 $14 = HEAP32[$13>>2]|0;
245566 $15 = $1&255;
245567 $16 = (($14) + (($5*20)|0)|0);
245568 HEAP8[$16>>0] = $15;
245569 $17 = (((($14) + (($5*20)|0)|0)) + 2|0);
245570 HEAP16[$17>>1] = 0;
245571 $18 = (((($14) + (($5*20)|0)|0)) + 4|0);
245572 HEAP32[$18>>2] = $2;
245573 $19 = (((($14) + (($5*20)|0)|0)) + 8|0);
245574 HEAP32[$19>>2] = $3;
245575 $20 = (((($14) + (($5*20)|0)|0)) + 12|0);
245576 HEAP32[$20>>2] = 0;
245577 $21 = (((($14) + (($5*20)|0)|0)) + 16|0);
245578 HEAP32[$21>>2] = 0;
245579 $22 = (((($14) + (($5*20)|0)|0)) + 1|0);
245580 HEAP8[$22>>0] = 0;
245581 $$0$i = $5;
245582 return ($$0$i|0);
245583 } else {
245584 $11 = (_growOp3($0,$1,$2,$3,0)|0);
245585 $$0$i = $11;
245586 return ($$0$i|0);
245587 }
245588 return (0)|0;
245589}
245590function _sqlite3VdbeChangeP4($0,$1,$2,$3) {
245591 $0 = $0|0;
245592 $1 = $1|0;

Callers 1

_sqlite3VdbeMultiLoadFunction · 0.85

Calls 1

_growOp3Function · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…