($0,$1,$2,$3,$4,$5)
| 315571 | return ($14|0); |
| 315572 | } |
| 315573 | function _vdbeSorterCompareInt($0,$1,$2,$3,$4,$5) { |
| 315574 | $0 = $0|0; |
| 315575 | $1 = $1|0; |
| 315576 | $2 = $2|0; |
| 315577 | $3 = $3|0; |
| 315578 | $4 = $4|0; |
| 315579 | $5 = $5|0; |
| 315580 | var $$ = 0, $$$2 = 0, $$063 = 0, $$2 = 0, $$3 = 0, $$3$ = 0, $$3$ph = 0, $$359 = 0, $$4 = 0, $$62 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0; |
| 315581 | var $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, $39 = 0; |
| 315582 | var $40 = 0, $41 = 0, $42 = 0, $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; |
| 315583 | var $6 = 0, $60 = 0, $61 = 0, $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, $8 = 0, $9 = 0; |
| 315584 | var $or$cond = 0, label = 0, sp = 0; |
| 315585 | sp = STACKTOP; |
| 315586 | $6 = ((($2)) + 1|0); |
| 315587 | $7 = HEAP8[$6>>0]|0; |
| 315588 | $8 = $7&255; |
| 315589 | $9 = ((($4)) + 1|0); |
| 315590 | $10 = HEAP8[$9>>0]|0; |
| 315591 | $11 = HEAP8[$2>>0]|0; |
| 315592 | $12 = $11&255; |
| 315593 | $13 = (($2) + ($12)|0); |
| 315594 | $14 = HEAP8[$4>>0]|0; |
| 315595 | $15 = $14&255; |
| 315596 | $16 = (($4) + ($15)|0); |
| 315597 | $17 = ($7<<24>>24)==($10<<24>>24); |
| 315598 | L1: do { |
| 315599 | if ($17) { |
| 315600 | $18 = (37642 + ($8)|0); |
| 315601 | $19 = HEAP8[$18>>0]|0; |
| 315602 | $20 = $19&255; |
| 315603 | $21 = (($8) + -1)|0; |
| 315604 | $22 = ($21>>>0)<(6); |
| 315605 | L3: do { |
| 315606 | if ($22) { |
| 315607 | $$063 = 0; |
| 315608 | while(1) { |
| 315609 | $29 = (($13) + ($$063)|0); |
| 315610 | $30 = HEAP8[$29>>0]|0; |
| 315611 | $31 = $30&255; |
| 315612 | $32 = (($16) + ($$063)|0); |
| 315613 | $33 = HEAP8[$32>>0]|0; |
| 315614 | $34 = $33&255; |
| 315615 | $35 = (($31) - ($34))|0; |
| 315616 | $36 = ($35|0)==(0); |
| 315617 | $23 = (($$063) + 1)|0; |
| 315618 | if (!($36)) { |
| 315619 | break; |
| 315620 | } |
| 315621 | $24 = ($23|0)<($20|0); |
| 315622 | if ($24) { |
| 315623 | $$063 = $23; |
| 315624 | } else { |
| 315625 | break L3; |
| 315626 | } |
| 315627 | } |
| 315628 | $37 = HEAP8[$13>>0]|0; |
| 315629 | $38 = HEAP8[$16>>0]|0; |
| 315630 | $39 = $38 ^ $37; |
nothing calls this directly
no test coverage detected
searching dependent graphs…