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

Function _fts3PendingTermsAddOne

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

Source from the content-addressed store, hash-verified

373994 STACKTOP = sp;return ($$3|0);
373995}
373996function _fts3PendingTermsAddOne($0,$1,$2,$3,$4,$5) {
373997 $0 = $0|0;
373998 $1 = $1|0;
373999 $2 = $2|0;
374000 $3 = $3|0;
374001 $4 = $4|0;
374002 $5 = $5|0;
374003 var $$023$i$i$i = 0, $$02325$i$i$i = 0, $$02326$i$i$i = 0, $$in$i$i$i = 0, $$neg13 = 0, $$neg14 = 0, $$pr = 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;
374004 var $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, $39 = 0, $40 = 0, $41 = 0, $42 = 0;
374005 var $43 = 0, $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 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;
374006 var $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, $77 = 0, $78 = 0, $79 = 0, $8 = 0;
374007 var $80 = 0, $81 = 0, $82 = 0, $83 = 0, $9 = 0, $fts3StrCompare$fts3BinCompare$i$i$i$i = 0, $fts3StrHash$fts3BinHash$i$i$i = 0, label = 0, sp = 0;
374008 sp = STACKTOP;
374009 STACKTOP = STACKTOP + 16|0;
374010 $6 = sp + 4|0;
374011 $7 = sp;
374012 HEAP32[$7>>2] = 0;
374013 $8 = ($3|0)==(0|0);
374014 L1: do {
374015 if ($8) {
374016 label = 7;
374017 } else {
374018 $9 = ((($3)) + 16|0);
374019 $10 = HEAP32[$9>>2]|0;
374020 $11 = ($10|0)==(0|0);
374021 if ($11) {
374022 label = 7;
374023 } else {
374024 $12 = HEAP8[$3>>0]|0;
374025 $13 = ($12<<24>>24)==(1);
374026 $fts3StrHash$fts3BinHash$i$i$i = $13 ? 206 : 205;
374027 $14 = (FUNCTION_TABLE_iii[$fts3StrHash$fts3BinHash$i$i$i & 255]($4,$5)|0);
374028 $15 = ((($3)) + 12|0);
374029 $16 = HEAP32[$15>>2]|0;
374030 $17 = (($16) + -1)|0;
374031 $18 = $17 & $14;
374032 $19 = HEAP32[$9>>2]|0;
374033 $20 = ($19|0)==(0|0);
374034 if ($20) {
374035 label = 7;
374036 } else {
374037 $21 = (((($19) + ($18<<3)|0)) + 4|0);
374038 $22 = (($19) + ($18<<3)|0);
374039 $23 = HEAP32[$22>>2]|0;
374040 $24 = HEAP8[$3>>0]|0;
374041 $25 = ($24<<24>>24)==(1);
374042 $fts3StrCompare$fts3BinCompare$i$i$i$i = $25 ? 144 : 143;
374043 $$02325$i$i$i = HEAP32[$21>>2]|0;
374044 $26 = ($23|0)!=(0);
374045 $27 = ($$02325$i$i$i|0)!=(0|0);
374046 $28 = $26 & $27;
374047 if ($28) {
374048 $$02326$i$i$i = $$02325$i$i$i;$$in$i$i$i = $23;
374049 while(1) {
374050 $29 = (($$in$i$i$i) + -1)|0;
374051 $30 = ((($$02326$i$i$i)) + 12|0);
374052 $31 = HEAP32[$30>>2]|0;
374053 $32 = ((($$02326$i$i$i)) + 16|0);

Callers 1

_fts3PendingTermsAddFunction · 0.85

Calls 2

_fts3PendingListAppendFunction · 0.85
_sqlite3Fts3HashInsertFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…