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

Function _sqlite3WhereSplit

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

Source from the content-addressed store, hash-verified

259870 return;
259871}
259872function _sqlite3WhereSplit($0,$1,$2) {
259873 $0 = $0|0;
259874 $1 = $1|0;
259875 $2 = $2|0;
259876 var $$04$i = 0, $$pre = 0, $$sink$i = 0, $$tr1319 = 0, $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, $3 = 0, $4 = 0, $5 = 0;
259877 var $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0;
259878 sp = STACKTOP;
259879 $3 = ($1|0)==(0|0);
259880 $$pre = ((($0)) + 8|0);
259881 L1: do {
259882 if (!($3)) {
259883 $$tr1319 = $1;
259884 while(1) {
259885 $$04$i = $$tr1319;
259886 while(1) {
259887 $4 = ((($$04$i)) + 4|0);
259888 $5 = HEAP32[$4>>2]|0;
259889 $6 = $5 & 4096;
259890 $7 = ($6|0)==(0);
259891 if ($7) {
259892 break;
259893 }
259894 $8 = $5 & 262144;
259895 $9 = ($8|0)==(0);
259896 if ($9) {
259897 $13 = ((($$04$i)) + 12|0);
259898 $$sink$i = $13;
259899 } else {
259900 $10 = ((($$04$i)) + 20|0);
259901 $11 = HEAP32[$10>>2]|0;
259902 $12 = ((($11)) + 4|0);
259903 $$sink$i = $12;
259904 }
259905 $14 = HEAP32[$$sink$i>>2]|0;
259906 $15 = ($14|0)==(0|0);
259907 if ($15) {
259908 break L1;
259909 } else {
259910 $$04$i = $14;
259911 }
259912 }
259913 HEAP8[$$pre>>0] = $2;
259914 $16 = HEAP8[$$04$i>>0]|0;
259915 $17 = ($16<<24>>24)==($2<<24>>24);
259916 if (!($17)) {
259917 break;
259918 }
259919 $18 = ((($$04$i)) + 12|0);
259920 $19 = HEAP32[$18>>2]|0;
259921 _sqlite3WhereSplit($0,$19,$2);
259922 $20 = ((($$04$i)) + 16|0);
259923 $21 = HEAP32[$20>>2]|0;
259924 $22 = ($21|0)==(0|0);
259925 if ($22) {
259926 break L1;
259927 } else {
259928 $$tr1319 = $21;
259929 }

Callers 2

_sqlite3WhereBeginFunction · 0.85
_exprAnalyzeFunction · 0.85

Calls 1

_whereClauseInsertFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…