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

Function _xferCompatibleIndex

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

Source from the content-addressed store, hash-verified

245682 return;
245683}
245684function _xferCompatibleIndex($0,$1) {
245685 $0 = $0|0;
245686 $1 = $1|0;
245687 var $$ = 0, $$0$i = 0, $$01315$i$i = 0, $$016$i$i = 0, $$027 = 0, $$028 = 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;
245688 var $23 = 0, $24 = 0, $25 = 0, $26 = 0, $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;
245689 var $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, $57 = 0, $58 = 0, $59 = 0;
245690 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, $76 = 0, $77 = 0;
245691 var $78 = 0, $79 = 0, $8 = 0, $80 = 0, $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, $or$cond$i$i = 0, $or$cond14$i$i = 0, label = 0;
245692 var sp = 0;
245693 sp = STACKTOP;
245694 $2 = ((($0)) + 50|0);
245695 $3 = HEAP16[$2>>1]|0;
245696 $4 = ((($1)) + 50|0);
245697 $5 = HEAP16[$4>>1]|0;
245698 $6 = ($3<<16>>16)==($5<<16>>16);
245699 if (!($6)) {
245700 $$027 = 0;
245701 return ($$027|0);
245702 }
245703 $7 = ((($0)) + 54|0);
245704 $8 = HEAP8[$7>>0]|0;
245705 $9 = ((($1)) + 54|0);
245706 $10 = HEAP8[$9>>0]|0;
245707 $11 = ($8<<24>>24)==($10<<24>>24);
245708 if (!($11)) {
245709 $$027 = 0;
245710 return ($$027|0);
245711 }
245712 $12 = ($3<<16>>16)==(0);
245713 L7: do {
245714 if (!($12)) {
245715 $13 = ((($1)) + 4|0);
245716 $14 = ((($0)) + 4|0);
245717 $15 = ((($1)) + 40|0);
245718 $16 = ((($0)) + 40|0);
245719 $17 = ((($1)) + 28|0);
245720 $18 = ((($0)) + 28|0);
245721 $19 = ((($1)) + 32|0);
245722 $20 = ((($0)) + 32|0);
245723 $$028 = 0;
245724 while(1) {
245725 $25 = HEAP32[$13>>2]|0;
245726 $26 = (($25) + ($$028<<1)|0);
245727 $27 = HEAP16[$26>>1]|0;
245728 $28 = HEAP32[$14>>2]|0;
245729 $29 = (($28) + ($$028<<1)|0);
245730 $30 = HEAP16[$29>>1]|0;
245731 $31 = ($27<<16>>16)==($30<<16>>16);
245732 if (!($31)) {
245733 $$027 = 0;
245734 label = 17;
245735 break;
245736 }
245737 $32 = ($27<<16>>16)==(-2);
245738 if ($32) {
245739 $33 = HEAP32[$15>>2]|0;
245740 $34 = (((($33)) + 4|0) + (($$028*20)|0)|0);
245741 $35 = HEAP32[$34>>2]|0;

Callers 1

_sqlite3InsertFunction · 0.85

Calls 1

_sqlite3ExprCompareFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…