MCPcopy Create free account
hub / github.com/sql-js/sql.js / _sqlite3BtreeCursor

Function _sqlite3BtreeCursor

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

Source from the content-addressed store, hash-verified

304652 STACKTOP = sp;return ($$031|0);
304653}
304654function _sqlite3BtreeCursor($0,$1,$2,$3,$4) {
304655 $0 = $0|0;
304656 $1 = $1|0;
304657 $2 = $2|0;
304658 $3 = $3|0;
304659 $4 = $4|0;
304660 var $$$i = 0, $$0 = 0, $$0$i = 0, $$0$i9$i$i = 0, $$035$i = 0, $$037$i = 0, $$038$i = 0, $$1$i$i$ph$i$i = 0, $$idx$i = 0, $$idx$val$i = 0, $$sink$i$i$i$i = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0;
304661 var $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0, $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0;
304662 var $18 = 0, $19 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0;
304663 var $38 = 0, $39 = 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, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0;
304664 var $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, $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0;
304665 var $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, $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0;
304666 var $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $cond$i$i$i$i = 0, $not$$i = 0, $vararg_buffer = 0, $vararg_ptr1 = 0, $vararg_ptr2 = 0, label = 0, sp = 0;
304667 sp = STACKTOP;
304668 STACKTOP = STACKTOP + 16|0;
304669 $vararg_buffer = sp;
304670 $5 = ($1|0)<(1);
304671 if ($5) {
304672 HEAP32[$vararg_buffer>>2] = 21258;
304673 $vararg_ptr1 = ((($vararg_buffer)) + 4|0);
304674 HEAP32[$vararg_ptr1>>2] = 64353;
304675 $vararg_ptr2 = ((($vararg_buffer)) + 8|0);
304676 HEAP32[$vararg_ptr2>>2] = (17052);
304677 _sqlite3_log(11,17000,$vararg_buffer);
304678 $$0 = 11;
304679 STACKTOP = sp;return ($$0|0);
304680 }
304681 $6 = HEAP32[$0>>2]|0;
304682 $7 = ((($0)) + 4|0);
304683 $8 = HEAP32[$7>>2]|0;
304684 $9 = ((($8)) + 4|0);
304685 HEAP32[$9>>2] = $6;
304686 $10 = ($2|0)!=(0);
304687 if ($10) {
304688 $11 = ((($8)) + 80|0);
304689 $12 = HEAP32[$11>>2]|0;
304690 $13 = ($12|0)==(0|0);
304691 if ($13) {
304692 $14 = ((($8)) + 32|0);
304693 $15 = HEAP32[$14>>2]|0;
304694 $16 = HEAP32[(46636)>>2]|0;
304695 $17 = ($16|0)<($15|0);
304696 if ($17) {
304697 label = 11;
304698 } else {
304699 $18 = HEAP32[(46660)>>2]|0;
304700 $cond$i$i$i$i = ($18|0)==(0|0);
304701 if ($cond$i$i$i$i) {
304702 label = 11;
304703 } else {
304704 $19 = HEAP32[$18>>2]|0;
304705 HEAP32[(46660)>>2] = $19;
304706 $20 = HEAP32[(46664)>>2]|0;
304707 $21 = (($20) + -1)|0;
304708 HEAP32[(46664)>>2] = $21;
304709 $22 = HEAP32[(46644)>>2]|0;
304710 $23 = ($20|0)<=($22|0);
304711 $24 = $23&1;

Callers 1

_sqlite3VdbeExecFunction · 0.85

Calls 3

_sqlite3_logFunction · 0.85
_i64AddFunction · 0.85
_i64SubtractFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…