MCPcopy Index your code
hub / github.com/sql-js/sql.js / _cycle

Function _cycle

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

Source from the content-addressed store, hash-verified

396405 return ($$07|0);
396406}
396407function _cycle($0,$1,$2) {
396408 $0 = $0|0;
396409 $1 = $1|0;
396410 $2 = $2|0;
396411 var $$02527 = 0, $$026 = 0, $$pre = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0;
396412 var $exitcond = 0, label = 0, sp = 0;
396413 sp = STACKTOP;
396414 STACKTOP = STACKTOP + 256|0;
396415 $3 = sp;
396416 $4 = ($2|0)<(2);
396417 L1: do {
396418 if (!($4)) {
396419 $5 = (($1) + ($2<<2)|0);
396420 HEAP32[$5>>2] = $3;
396421 $6 = ($0|0)==(0);
396422 if (!($6)) {
396423 $$02527 = $0;$10 = $3;
396424 while(1) {
396425 $7 = ($$02527>>>0)<(256);
396426 $8 = $7 ? $$02527 : 256;
396427 $9 = HEAP32[$1>>2]|0;
396428 _memcpy(($10|0),($9|0),($8|0))|0;
396429 $$026 = 0;
396430 while(1) {
396431 $11 = (($1) + ($$026<<2)|0);
396432 $12 = HEAP32[$11>>2]|0;
396433 $13 = (($$026) + 1)|0;
396434 $14 = (($1) + ($13<<2)|0);
396435 $15 = HEAP32[$14>>2]|0;
396436 _memcpy(($12|0),($15|0),($8|0))|0;
396437 $16 = HEAP32[$11>>2]|0;
396438 $17 = (($16) + ($8)|0);
396439 HEAP32[$11>>2] = $17;
396440 $exitcond = ($13|0)==($2|0);
396441 if ($exitcond) {
396442 break;
396443 } else {
396444 $$026 = $13;
396445 }
396446 }
396447 $18 = (($$02527) - ($8))|0;
396448 $19 = ($18|0)==(0);
396449 if ($19) {
396450 break L1;
396451 }
396452 $$pre = HEAP32[$5>>2]|0;
396453 $$02527 = $18;$10 = $$pre;
396454 }
396455 }
396456 }
396457 } while(0);
396458 STACKTOP = sp;return;
396459}
396460function _isalpha($0) {
396461 $0 = $0|0;
396462 var $1 = 0, $2 = 0, $3 = 0, $4 = 0, label = 0, sp = 0;

Callers 2

_siftFunction · 0.85
_trinkleFunction · 0.85

Calls 1

_memcpyFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…