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

Function _rowSetNDeepTree

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

Source from the content-addressed store, hash-verified

312777 STACKTOP = sp;return ($$3|0);
312778}
312779function _rowSetNDeepTree($0,$1) {
312780 $0 = $0|0;
312781 $1 = $1|0;
312782 var $$0 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0;
312783 sp = STACKTOP;
312784 $2 = HEAP32[$0>>2]|0;
312785 $3 = ($2|0)==(0|0);
312786 if ($3) {
312787 $$0 = 0;
312788 return ($$0|0);
312789 }
312790 $4 = ($1|0)>(1);
312791 if (!($4)) {
312792 $13 = ((($2)) + 8|0);
312793 $14 = HEAP32[$13>>2]|0;
312794 HEAP32[$0>>2] = $14;
312795 HEAP32[$13>>2] = 0;
312796 $15 = ((($2)) + 12|0);
312797 HEAP32[$15>>2] = 0;
312798 $$0 = $2;
312799 return ($$0|0);
312800 }
312801 $5 = (($1) + -1)|0;
312802 $6 = (_rowSetNDeepTree($0,$5)|0);
312803 $7 = HEAP32[$0>>2]|0;
312804 $8 = ($7|0)==(0|0);
312805 if ($8) {
312806 $$0 = $6;
312807 return ($$0|0);
312808 } else {
312809 $9 = ((($7)) + 12|0);
312810 HEAP32[$9>>2] = $6;
312811 $10 = ((($7)) + 8|0);
312812 $11 = HEAP32[$10>>2]|0;
312813 HEAP32[$0>>2] = $11;
312814 $12 = (_rowSetNDeepTree($0,$5)|0);
312815 HEAP32[$10>>2] = $12;
312816 return ($7|0);
312817 }
312818 return (0)|0;
312819}
312820function _rowSetTreeToList($0,$1,$2) {
312821 $0 = $0|0;
312822 $1 = $1|0;

Callers 1

_sqlite3VdbeExecFunction · 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…