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

Function _minmaxStep

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

Source from the content-addressed store, hash-verified

24440 return;
24441}
24442function _minmaxStep($0,$1,$2) {
24443 $0 = $0|0;
24444 $1 = $1|0;
24445 $2 = $2|0;
24446 var $$$i$i = 0, $$$i$i38 = 0, $$0$i = 0, $$idx = 0, $$idx$val = 0, $$idx$val$idx = 0, $$idx$val$idx$val = 0, $$idx34 = 0, $$idx34$val = 0, $$pre$i = 0, $$pre$i40 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0;
24447 var $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0, $112 = 0, $113 = 0, $114 = 0, $115 = 0, $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0;
24448 var $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0, $130 = 0, $131 = 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;
24449 var $27 = 0, $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;
24450 var $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, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $62 = 0;
24451 var $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, $80 = 0;
24452 var $81 = 0, $82 = 0, $83 = 0, $84 = 0, $85 = 0, $86 = 0, $87 = 0, $88 = 0, $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0;
24453 var $or$cond = 0, $or$cond3 = 0, label = 0, sp = 0;
24454 sp = STACKTOP;
24455 $3 = HEAP32[$2>>2]|0;
24456 $4 = ((($0)) + 8|0);
24457 $5 = HEAP32[$4>>2]|0;
24458 $6 = ((($5)) + 8|0);
24459 $7 = HEAP16[$6>>1]|0;
24460 $8 = $7 & 8192;
24461 $9 = ($8<<16>>16)==(0);
24462 if ($9) {
24463 $10 = (_createAggContext($0,40)|0);
24464 $$0$i = $10;
24465 } else {
24466 $11 = ((($5)) + 16|0);
24467 $12 = HEAP32[$11>>2]|0;
24468 $$0$i = $12;
24469 }
24470 $13 = ($$0$i|0)==(0|0);
24471 if ($13) {
24472 return;
24473 }
24474 $14 = HEAP32[$2>>2]|0;
24475 $15 = ((($14)) + 8|0);
24476 $16 = HEAP16[$15>>1]|0;
24477 $17 = $16 & 31;
24478 $18 = $17&65535;
24479 $19 = -1431655766 >>> $18;
24480 $20 = $19 & 1;
24481 $21 = ($20|0)==(0);
24482 $22 = ((($$0$i)) + 8|0);
24483 $23 = HEAP16[$22>>1]|0;
24484 $24 = ($23<<16>>16)!=(0);
24485 if (!($21)) {
24486 if (!($24)) {
24487 return;
24488 }
24489 $25 = ((($0)) + 24|0);
24490 HEAP8[$25>>0] = 1;
24491 return;
24492 }
24493 if (!($24)) {
24494 $84 = HEAP32[$0>>2]|0;
24495 $85 = ((($84)) + 32|0);
24496 $86 = HEAP32[$85>>2]|0;
24497 $87 = ((($$0$i)) + 32|0);
24498 HEAP32[$87>>2] = $86;
24499 ;HEAP32[$$0$i>>2]=HEAP32[$3>>2]|0;HEAP32[$$0$i+4>>2]=HEAP32[$3+4>>2]|0;HEAP32[$$0$i+8>>2]=HEAP32[$3+8>>2]|0;HEAP32[$$0$i+12>>2]=HEAP32[$3+12>>2]|0;HEAP32[$$0$i+16>>2]=HEAP32[$3+16>>2]|0;

Callers

nothing calls this directly

Calls 6

_createAggContextFunction · 0.85
_sqlite3VdbeMemGrowFunction · 0.85
_memsetFunction · 0.85
_vdbeMemAddTerminatorFunction · 0.85
_sqlite3MemCompareFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…