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

Function _reindexTable

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

Source from the content-addressed store, hash-verified

198034 }
198035}
198036function _reindexTable($0,$1,$2) {
198037 $0 = $0|0;
198038 $1 = $1|0;
198039 $2 = $2|0;
198040 var $$$i = 0, $$$i$us = 0, $$0 = 0, $$0$i = 0, $$0$i$us = 0, $$0$us = 0, $$01315$i$i = 0, $$014 = 0, $$01415$i = 0, $$015 = 0, $$015$us = 0, $$016$i$i = 0, $$1$i = 0, $$1$i$us = 0, $$lcssa$i$i = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0;
198041 var $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, $28 = 0, $29 = 0, $3 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0;
198042 var $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, $46 = 0, $47 = 0, $48 = 0, $49 = 0, $5 = 0, $50 = 0, $51 = 0;
198043 var $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $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;
198044 var $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $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;
198045 var $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $or$cond$i$i = 0, $or$cond14$i$i = 0, label = 0, sp = 0;
198046 sp = STACKTOP;
198047 $3 = ((($1)) + 8|0);
198048 $$014 = HEAP32[$3>>2]|0;
198049 $4 = ($$014|0)==(0|0);
198050 if ($4) {
198051 return;
198052 }
198053 $5 = ($2|0)==(0|0);
198054 $6 = ((($1)) + 72|0);
198055 $7 = ((($0)) + 120|0);
198056 if ($5) {
198057 $$015$us = $$014;
198058 while(1) {
198059 $8 = HEAP32[$6>>2]|0;
198060 $9 = ($8|0)==(0|0);
198061 if ($9) {
198062 $$1$i$us = -1000000;
198063 } else {
198064 $10 = HEAP32[$0>>2]|0;
198065 $11 = ((($10)) + 16|0);
198066 $12 = HEAP32[$11>>2]|0;
198067 $$0$i$us = 0;
198068 while(1) {
198069 $13 = (((($12) + ($$0$i$us<<4)|0)) + 12|0);
198070 $14 = HEAP32[$13>>2]|0;
198071 $15 = ($14|0)==($8|0);
198072 $16 = (($$0$i$us) + 1)|0;
198073 if ($15) {
198074 $$1$i$us = $$0$i$us;
198075 break;
198076 } else {
198077 $$0$i$us = $16;
198078 }
198079 }
198080 }
198081 $17 = HEAP32[$7>>2]|0;
198082 $18 = ($17|0)==(0|0);
198083 $$$i$us = $18 ? $0 : $17;
198084 $19 = ((($$$i$us)) + 92|0);
198085 $20 = HEAP32[$19>>2]|0;
198086 $21 = 1 << $$1$i$us;
198087 $22 = $20 & $21;
198088 $23 = ($22|0)==(0);
198089 if ($23) {
198090 $24 = $20 | $21;
198091 HEAP32[$19>>2] = $24;
198092 $25 = ($$1$i$us|0)==(1);
198093 if ($25) {

Callers 1

_yy_reduceFunction · 0.85

Calls 2

_sqlite3OpenTempDatabaseFunction · 0.85
_sqlite3RefillIndexFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…