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

Function _whereRangeVectorLen

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

Source from the content-addressed store, hash-verified

282042 STACKTOP = sp;return ($$0|0);
282043}
282044function _whereRangeVectorLen($0,$1,$2,$3,$4) {
282045 $0 = $0|0;
282046 $1 = $1|0;
282047 $2 = $2|0;
282048 $3 = $3|0;
282049 $4 = $4|0;
282050 var $$ = 0, $$$i = 0, $$0$i = 0, $$0$i61 = 0, $$0$i6164 = 0, $$0$i63 = 0, $$01315$i = 0, $$016$i = 0, $$053 = 0, $$053$in = 0, $$054$lcssa = 0, $$05465 = 0, $$07$i = 0, $$lcssa$i = 0, $$phi$trans$insert = 0, $$pn = 0, $$pn$in = 0, $$pre = 0, $$pre77 = 0, $$sink$i = 0;
282051 var $10 = 0, $100 = 0, $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;
282052 var $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $130 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0;
282053 var $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, $38 = 0;
282054 var $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, $57 = 0;
282055 var $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, $75 = 0;
282056 var $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, $93 = 0;
282057 var $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $or$cond$i = 0, $or$cond$i62 = 0, $or$cond10$i = 0, $or$cond14$i = 0, label = 0, sp = 0;
282058 sp = STACKTOP;
282059 $5 = HEAP32[$4>>2]|0;
282060 $6 = ((($5)) + 12|0);
282061 $7 = HEAP32[$6>>2]|0;
282062 $8 = HEAP8[$7>>0]|0;
282063 $9 = ($8<<24>>24)==(-106);
282064 if ($9) {
282065 $10 = ((($7)) + 38|0);
282066 $11 = HEAP8[$10>>0]|0;
282067 $$0$i = $11;
282068 } else {
282069 $$0$i = $8;
282070 }
282071 switch ($$0$i<<24>>24) {
282072 case -105: {
282073 $12 = ((($7)) + 20|0);
282074 $$sink$i = $12;
282075 label = 6;
282076 break;
282077 }
282078 case 119: {
282079 $13 = ((($7)) + 20|0);
282080 $14 = HEAP32[$13>>2]|0;
282081 $$sink$i = $14;
282082 label = 6;
282083 break;
282084 }
282085 default: {
282086 $$07$i = 1;
282087 }
282088 }
282089 if ((label|0) == 6) {
282090 $15 = HEAP32[$$sink$i>>2]|0;
282091 $16 = HEAP32[$15>>2]|0;
282092 $$07$i = $16;
282093 }
282094 $17 = ((($2)) + 52|0);
282095 $18 = HEAP16[$17>>1]|0;
282096 $19 = $18&65535;
282097 $20 = (($19) - ($3))|0;
282098 $21 = ($$07$i|0)<($20|0);
282099 $$ = $21 ? $$07$i : $20;
282100 $22 = ((($2)) + 28|0);
282101 $23 = ($$|0)>(1);

Callers 1

_whereLoopAddBtreeIndexFunction · 0.85

Calls 2

_sqlite3ExprAffinityFunction · 0.85
_sqlite3ExprCollSeqFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…