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

Function _fts3SnippetFindPositions

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

Source from the content-addressed store, hash-verified

362379 STACKTOP = sp;return ($7|0);
362380}
362381function _fts3SnippetFindPositions($0,$1,$2) {
362382 $0 = $0|0;
362383 $1 = $1|0;
362384 $2 = $2|0;
362385 var $$0$i = 0, $$cast20 = 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, $25 = 0, $26 = 0, $27 = 0;
362386 var $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, $43 = 0, $44 = 0, $45 = 0;
362387 var $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, $61 = 0, $7 = 0, $8 = 0;
362388 var $9 = 0, label = 0, sp = 0;
362389 sp = STACKTOP;
362390 STACKTOP = STACKTOP + 16|0;
362391 $3 = sp;
362392 $4 = ((($2)) + 16|0);
362393 $5 = HEAP32[$4>>2]|0;
362394 $6 = ((($0)) + 20|0);
362395 $7 = HEAP32[$6>>2]|0;
362396 $8 = ((($7)) + 64|0);
362397 $9 = HEAP32[$8>>2]|0;
362398 $10 = (($5) + (($1*24)|0)|0);
362399 HEAP32[$10>>2] = $9;
362400 $11 = HEAP32[$2>>2]|0;
362401 $12 = ((($2)) + 4|0);
362402 $13 = HEAP32[$12>>2]|0;
362403 $14 = (_sqlite3Fts3EvalPhrasePoslist($11,$0,$13,$3)|0);
362404 $15 = HEAP32[$3>>2]|0;
362405 $16 = ($15|0)==(0|0);
362406 if ($16) {
362407 STACKTOP = sp;return ($14|0);
362408 }
362409 $17 = $15;
362410 $18 = (((($5) + (($1*24)|0)|0)) + 4|0);
362411 HEAP32[$18>>2] = $17;
362412 $19 = HEAP8[$15>>0]|0;
362413 $20 = $19&255;
362414 $21 = $20 & 128;
362415 $22 = ($21|0)==(0);
362416 if ($22) {
362417 $$0$i = $20;$56 = 1;
362418 } else {
362419 $23 = ((($15)) + 1|0);
362420 $24 = $19 & 127;
362421 $25 = $24&255;
362422 $26 = HEAP8[$23>>0]|0;
362423 $27 = $26 << 24 >> 24;
362424 $28 = $27 << 7;
362425 $29 = $28 | $25;
362426 $30 = $28 & 16384;
362427 $31 = ($30|0)==(0);
362428 if ($31) {
362429 $$0$i = $29;$56 = 2;
362430 } else {
362431 $32 = ((($15)) + 2|0);
362432 $33 = $29 & 16383;
362433 $34 = HEAP8[$32>>0]|0;
362434 $35 = $34 << 24 >> 24;
362435 $36 = $35 << 14;
362436 $37 = $36 | $33;
362437 $38 = $36 & 2097152;
362438 $39 = ($38|0)==(0);

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…