MCPcopy Create free account
hub / github.com/sql-js/sql.js / _exprIdxCover

Function _exprIdxCover

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

Source from the content-addressed store, hash-verified

277657 return;
277658}
277659function _exprIdxCover($0,$1) {
277660 $0 = $0|0;
277661 $1 = $1|0;
277662 var $$0 = 0, $$09$i = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0;
277663 var $27 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0;
277664 sp = STACKTOP;
277665 $2 = HEAP8[$1>>0]|0;
277666 $3 = ($2<<24>>24)==(-111);
277667 if (!($3)) {
277668 $$0 = 0;
277669 return ($$0|0);
277670 }
277671 $4 = ((($1)) + 28|0);
277672 $5 = HEAP32[$4>>2]|0;
277673 $6 = ((($0)) + 24|0);
277674 $7 = HEAP32[$6>>2]|0;
277675 $8 = ((($7)) + 4|0);
277676 $9 = HEAP32[$8>>2]|0;
277677 $10 = ($5|0)==($9|0);
277678 if (!($10)) {
277679 $$0 = 0;
277680 return ($$0|0);
277681 }
277682 $11 = HEAP32[$7>>2]|0;
277683 $12 = ((($1)) + 32|0);
277684 $13 = HEAP16[$12>>1]|0;
277685 $14 = ((($11)) + 52|0);
277686 $15 = HEAP16[$14>>1]|0;
277687 $16 = ($15<<16>>16)==(0);
277688 L7: do {
277689 if (!($16)) {
277690 $17 = ((($11)) + 4|0);
277691 $18 = HEAP32[$17>>2]|0;
277692 $19 = $15&65535;
277693 $$09$i = 0;
277694 while(1) {
277695 $20 = (($18) + ($$09$i<<1)|0);
277696 $21 = HEAP16[$20>>1]|0;
277697 $22 = ($21<<16>>16)==($13<<16>>16);
277698 if ($22) {
277699 break;
277700 }
277701 $23 = (($$09$i) + 1)|0;
277702 $24 = ($23|0)<($19|0);
277703 if ($24) {
277704 $$09$i = $23;
277705 } else {
277706 break L7;
277707 }
277708 }
277709 $25 = $$09$i&65535;
277710 $26 = ($25<<16>>16)<(0);
277711 if (!($26)) {
277712 $$0 = 0;
277713 return ($$0|0);
277714 }
277715 }
277716 } while(0);

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…