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

Function _qsort

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

Source from the content-addressed store, hash-verified

395971 STACKTOP = sp;return ($4|0);
395972}
395973function _qsort($0,$1,$2,$3) {
395974 $0 = $0|0;
395975 $1 = $1|0;
395976 $2 = $2|0;
395977 $3 = $3|0;
395978 var $$0 = 0, $$067$lcssa = 0, $$06772 = 0, $$068$lcssa = 0, $$06871 = 0, $$1 = 0, $$169 = 0, $$2 = 0, $$pre$pre = 0, $$pre76 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $15$phi = 0, $16 = 0, $17 = 0, $18 = 0;
395979 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;
395980 var $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, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0;
395981 var $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $7 = 0, $8 = 0, $9 = 0, $or$cond = 0, label = 0, sp = 0;
395982 sp = STACKTOP;
395983 STACKTOP = STACKTOP + 208|0;
395984 $4 = sp + 8|0;
395985 $5 = sp;
395986 $6 = Math_imul($2, $1)|0;
395987 $7 = $5;
395988 $8 = $7;
395989 HEAP32[$8>>2] = 1;
395990 $9 = (($7) + 4)|0;
395991 $10 = $9;
395992 HEAP32[$10>>2] = 0;
395993 $11 = ($6|0)==(0);
395994 L1: do {
395995 if (!($11)) {
395996 $12 = (0 - ($2))|0;
395997 $13 = ((($4)) + 4|0);
395998 HEAP32[$13>>2] = $2;
395999 HEAP32[$4>>2] = $2;
396000 $$0 = 2;$15 = $2;$17 = $2;
396001 while(1) {
396002 $14 = (($15) + ($2))|0;
396003 $16 = (($14) + ($17))|0;
396004 $18 = (($4) + ($$0<<2)|0);
396005 HEAP32[$18>>2] = $16;
396006 $19 = ($16>>>0)<($6>>>0);
396007 $20 = (($$0) + 1)|0;
396008 if ($19) {
396009 $15$phi = $17;$$0 = $20;$17 = $16;$15 = $15$phi;
396010 } else {
396011 break;
396012 }
396013 }
396014 $21 = (($0) + ($6)|0);
396015 $22 = (($21) + ($12)|0);
396016 $23 = ($22>>>0)>($0>>>0);
396017 if ($23) {
396018 $24 = $22;
396019 $$06772 = 1;$$06871 = $0;$26 = 1;
396020 while(1) {
396021 $25 = $26 & 3;
396022 $27 = ($25|0)==(3);
396023 do {
396024 if ($27) {
396025 _sift($$06871,$2,$3,$$06772,$4);
396026 _shr($5,2);
396027 $28 = (($$06772) + 2)|0;
396028 $$1 = $28;
396029 } else {
396030 $29 = (($$06772) + -1)|0;

Callers 1

_fts3SegReaderCursorFunction · 0.85

Calls 5

_siftFunction · 0.85
_shrFunction · 0.85
_trinkleFunction · 0.85
_shlFunction · 0.85
_pntzFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…