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

Function _m_gt_1

js/sql-debug.js:387419–387534  ·  view source on GitHub ↗
($0)

Source from the content-addressed store, hash-verified

387417 return ($$08|0);
387418}
387419function _m_gt_1($0) {
387420 $0 = $0|0;
387421 var $$0$i = 0, $$0$i9 = 0, $$018 = 0, $$08 = 0, $$1 = 0, $$217 = 0, $$3 = 0, $$pr = 0, $$pr11 = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0;
387422 var $2 = 0, $20 = 0, $21 = 0, $22 = 0, $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;
387423 var $38 = 0, $39 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0;
387424 sp = STACKTOP;
387425 $1 = HEAP8[$0>>0]|0;
387426 $2 = ($1<<24>>24)==(0);
387427 if ($2) {
387428 $$08 = 0;
387429 return ($$08|0);
387430 } else {
387431 $$018 = $0;$$pr = $1;
387432 }
387433 while(1) {
387434 $3 = $$pr << 24 >> 24;
387435 $4 = (($3) + -97)|0;
387436 $5 = ($4|0)==(24);
387437 if ($5) {
387438 $10 = ((($$018)) + 1|0);
387439 $11 = (_isConsonant($10)|0);
387440 $$0$i = $11;
387441 } else {
387442 $6 = (44330 + ($4)|0);
387443 $7 = HEAP8[$6>>0]|0;
387444 $8 = $7 << 24 >> 24;
387445 $9 = (1 - ($8))|0;
387446 $$0$i = $9;
387447 }
387448 $12 = ($$0$i|0)==(0);
387449 if ($12) {
387450 $$1 = $$018;
387451 break;
387452 }
387453 $13 = ((($$018)) + 1|0);
387454 $14 = HEAP8[$13>>0]|0;
387455 $15 = ($14<<24>>24)==(0);
387456 if ($15) {
387457 $$08 = 0;
387458 label = 16;
387459 break;
387460 } else {
387461 $$018 = $13;$$pr = $14;
387462 }
387463 }
387464 if ((label|0) == 16) {
387465 return ($$08|0);
387466 }
387467 while(1) {
387468 $16 = (_isConsonant($$1)|0);
387469 $17 = ($16|0)==(0);
387470 $18 = ((($$1)) + 1|0);
387471 if ($17) {
387472 break;
387473 } else {
387474 $$1 = $18;
387475 }
387476 }

Callers 1

_porterNextFunction · 0.85

Calls 1

_isConsonantFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…