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

Function _instrFunc

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

Source from the content-addressed store, hash-verified

24989 }
24990}
24991function _instrFunc($0,$1,$2) {
24992 $0 = $0|0;
24993 $1 = $1|0;
24994 $2 = $2|0;
24995 var $$0 = 0, $$0$i$i56 = 0, $$0$i$i57 = 0, $$0$i$i59 = 0, $$050$lcssa = 0, $$05065 = 0, $$05065$us = 0, $$051 = 0, $$053 = 0, $$05463 = 0, $$05463$us = 0, $$15264 = 0, $$15264$us = 0, $$155 = 0, $$2 = 0, $$phi$trans$insert = 0, $$pre = 0, $$pre79 = 0, $10 = 0, $100 = 0;
24996 var $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0, $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;
24997 var $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $20 = 0, $21 = 0;
24998 var $22 = 0, $23 = 0, $24 = 0, $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;
24999 var $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, $57 = 0, $58 = 0;
25000 var $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, $75 = 0, $76 = 0;
25001 var $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, $93 = 0, $94 = 0;
25002 var $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $or$cond3 = 0, $or$cond5 = 0, label = 0, sp = 0;
25003 sp = STACKTOP;
25004 $3 = HEAP32[$2>>2]|0;
25005 $4 = ((($3)) + 8|0);
25006 $5 = HEAP16[$4>>1]|0;
25007 $6 = $5 & 31;
25008 $7 = $6&65535;
25009 $8 = ((($2)) + 4|0);
25010 $9 = HEAP32[$8>>2]|0;
25011 $10 = ((($9)) + 8|0);
25012 $11 = HEAP16[$10>>1]|0;
25013 $12 = $11 & 31;
25014 $13 = $12&65535;
25015 $14 = -1431655766 >>> $7;
25016 $15 = -1431655766 >>> $13;
25017 $16 = $15 | $14;
25018 $17 = $16 & 1;
25019 $18 = ($17|0)==(0);
25020 if (!($18)) {
25021 return;
25022 }
25023 $19 = $5&65535;
25024 $20 = $19 & 2;
25025 $21 = ($20|0)==(0);
25026 if ($21) {
25027 label = 5;
25028 } else {
25029 $22 = ((($3)) + 10|0);
25030 $23 = HEAP8[$22>>0]|0;
25031 $24 = ($23<<24>>24)==(1);
25032 if ($24) {
25033 $25 = ((($3)) + 12|0);
25034 $26 = HEAP32[$25>>2]|0;
25035 $$0$i$i56 = $26;$39 = $11;$43 = $9;
25036 } else {
25037 label = 5;
25038 }
25039 }
25040 do {
25041 if ((label|0) == 5) {
25042 $27 = $19 & 16;
25043 $28 = ($27|0)==(0);
25044 if ($28) {
25045 $35 = $19 & 1;
25046 $36 = ($35|0)==(0);
25047 if (!($36)) {
25048 $$0$i$i56 = 0;$39 = $11;$43 = $9;

Callers

nothing calls this directly

Calls 5

_valueBytesFunction · 0.85
_sqlite3_value_blobFunction · 0.85
_valueToTextFunction · 0.85
_memcmpFunction · 0.85
_vdbeReleaseAndSetInt64Function · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…