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

Function _fts3ExprTermOffsetInit

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

Source from the content-addressed store, hash-verified

362265 STACKTOP = sp;return ($170|0);
362266}
362267function _fts3ExprTermOffsetInit($0,$1,$2) {
362268 $0 = $0|0;
362269 $1 = $1|0;
362270 $2 = $2|0;
362271 var $$0$i = 0, $$027$ph = 0, $$028 = 0, $$in = 0, $$promoted = 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, $23 = 0, $24 = 0;
362272 var $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, $40 = 0, $41 = 0, $42 = 0;
362273 var $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, $59 = 0, $6 = 0, $60 = 0;
362274 var $61 = 0, $62 = 0, $63 = 0, $64 = 0, $65 = 0, $7 = 0, $8 = 0, $9 = 0, $exitcond = 0, $phitmp = 0, label = 0, sp = 0;
362275 sp = STACKTOP;
362276 STACKTOP = STACKTOP + 16|0;
362277 $3 = sp;
362278 $4 = HEAP32[$2>>2]|0;
362279 $5 = ((($2)) + 4|0);
362280 $6 = HEAP32[$5>>2]|0;
362281 $7 = (_sqlite3Fts3EvalPhrasePoslist($4,$0,$6,$3)|0);
362282 $8 = ((($0)) + 20|0);
362283 $9 = HEAP32[$8>>2]|0;
362284 $10 = ((($9)) + 64|0);
362285 $11 = HEAP32[$10>>2]|0;
362286 $12 = HEAP32[$3>>2]|0;
362287 $13 = ($12|0)==(0|0);
362288 if ($13) {
362289 $$027$ph = 0;$$in = 0;
362290 } else {
362291 $14 = HEAP8[$12>>0]|0;
362292 $15 = $14&255;
362293 $16 = $15 & 128;
362294 $17 = ($16|0)==(0);
362295 if ($17) {
362296 $$0$i = $15;$51 = 1;
362297 } else {
362298 $18 = ((($12)) + 1|0);
362299 $19 = $14 & 127;
362300 $20 = $19&255;
362301 $21 = HEAP8[$18>>0]|0;
362302 $22 = $21 << 24 >> 24;
362303 $23 = $22 << 7;
362304 $24 = $23 | $20;
362305 $25 = $23 & 16384;
362306 $26 = ($25|0)==(0);
362307 if ($26) {
362308 $$0$i = $24;$51 = 2;
362309 } else {
362310 $27 = ((($12)) + 2|0);
362311 $28 = $24 & 16383;
362312 $29 = HEAP8[$27>>0]|0;
362313 $30 = $29 << 24 >> 24;
362314 $31 = $30 << 14;
362315 $32 = $31 | $28;
362316 $33 = $31 & 2097152;
362317 $34 = ($33|0)==(0);
362318 if ($34) {
362319 $$0$i = $32;$51 = 3;
362320 } else {
362321 $35 = ((($12)) + 3|0);
362322 $36 = $32 & 2097151;
362323 $37 = HEAP8[$35>>0]|0;
362324 $38 = $37 << 24 >> 24;

Callers

nothing calls this directly

Calls 1

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…