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

Function _sqlite3MatchSpanName

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

Source from the content-addressed store, hash-verified

214947 return ($$0|0);
214948}
214949function _sqlite3MatchSpanName($0,$1,$2,$3) {
214950 $0 = $0|0;
214951 $1 = $1|0;
214952 $2 = $2|0;
214953 $3 = $3|0;
214954 var $$0 = 0, $$01315$i = 0, $$016$i = 0, $$01722$i = 0, $$01722$i36 = 0, $$023$i = 0, $$023$i35 = 0, $$031 = 0, $$1 = 0, $$in$i = 0, $$in$i34 = 0, $$lcssa$i = 0, $$phi$trans$insert28$i = 0, $$phi$trans$insert28$i39 = 0, $$phi$trans$insert29$i = 0, $$phi$trans$insert29$i40 = 0, $$pre27$i = 0, $$pre27$i38 = 0, $$pre30$i = 0, $$pre30$i41 = 0;
214955 var $10 = 0, $11 = 0, $12 = 0, $13 = 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, $27 = 0, $28 = 0, $29 = 0;
214956 var $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, $45 = 0, $46 = 0, $47 = 0, $48 = 0;
214957 var $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, $63 = 0, $64 = 0, $65 = 0, $66 = 0;
214958 var $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, $81 = 0, $82 = 0, $83 = 0, $84 = 0;
214959 var $85 = 0, $86 = 0, $87 = 0, $9 = 0, $or$cond$i = 0, $or$cond14$i = 0, label = 0, sp = 0;
214960 sp = STACKTOP;
214961 $$0 = 0;
214962 L1: while(1) {
214963 $4 = (($0) + ($$0)|0);
214964 $5 = HEAP8[$4>>0]|0;
214965 switch ($5<<24>>24) {
214966 case 46: case 0: {
214967 break L1;
214968 break;
214969 }
214970 default: {
214971 }
214972 }
214973 $6 = (($$0) + 1)|0;
214974 $$0 = $6;
214975 }
214976 $7 = ($3|0)==(0|0);
214977 if (!($7)) {
214978 $8 = ($$0|0)>(0);
214979 L7: do {
214980 if ($8) {
214981 $$01722$i = $0;$$023$i = $3;$$in$i = $$0;
214982 while(1) {
214983 $9 = (($$in$i) + -1)|0;
214984 $10 = HEAP8[$$01722$i>>0]|0;
214985 $11 = ($10<<24>>24)==(0);
214986 if ($11) {
214987 label = 7;
214988 break;
214989 }
214990 $12 = $10&255;
214991 $13 = (17324 + ($12)|0);
214992 $14 = HEAP8[$13>>0]|0;
214993 $15 = HEAP8[$$023$i>>0]|0;
214994 $16 = $15&255;
214995 $17 = (17324 + ($16)|0);
214996 $18 = HEAP8[$17>>0]|0;
214997 $19 = ($14<<24>>24)==($18<<24>>24);
214998 if (!($19)) {
214999 $23 = $14;$25 = $18;
215000 break;
215001 }
215002 $20 = ((($$01722$i)) + 1|0);
215003 $21 = ((($$023$i)) + 1|0);
215004 $22 = ($$in$i|0)>(1);
215005 if ($22) {
215006 $$01722$i = $20;$$023$i = $21;$$in$i = $9;

Callers 1

_resolveExprStepFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…