@scriptc/compiler 0.3.3 → 0.3.5

package/dist/ir/integer-loop-facts.js

@@ -9,21 +9,40 @@ function increment(id, value) {
         return null;
     return value.op === "+" ? value.right.value : value.op === "-" ? -value.right.value : null;
 }
+/** The counter step `counter + s` (or `counter - s`) adds on each update
+ * when `s` is a binding: its operand and sign. A constant step is
+ * `increment`'s. */
+function variableIncrement(id, value) {
+    if (value.kind !== "bin" ||
+        value.left.kind !== "varRef" ||
+        value.left.localId !== id ||
+        value.right.kind !== "varRef" ||
+        value.right.localId === id ||
+        (value.op !== "+" && value.op !== "-"))
+        return null;
+    return { localId: value.right.localId, sign: value.op === "+" ? 1 : -1 };
+}
 /** Bound secondary cursors by a finite ascending loop's maximum iteration
  * count. Sum all syntactic updates, including both sides of branches, so
  * filtering, breaks and continues can only reduce the budget. A nested
- * loop or opaque control region invalidates the bindings it writes. */
+ * loop or opaque control region invalidates the bindings it writes.
+ *
+ * The counter's step is a positive integer literal or a binding the loop
+ * never writes whose entry fact is a positive integer range (the sieve's
+ * `j += i`): every update then adds an exact integer in that range, so the
+ * counter climbs from its start to at most the limit plus the largest
+ * step. */
 export function boundedIntegerLoopFacts(loop, locals, initial) {
     const result = new Map();
     if (loop.init?.kind !== "varDecl" || loop.update?.kind !== "assign" || loop.cond?.kind !== "bin")
         return result;
     const counter = loop.init.localId, start = initial.get(counter);
-    const step = loop.update.localId === counter ? increment(counter, loop.update.value) : null;
+    const constant = loop.update.localId === counter ? increment(counter, loop.update.value) : null;
+    const variable = loop.update.localId === counter ? variableIncrement(counter, loop.update.value) : null;
     if (!start ||
         start.min < 0 ||
-        step === null ||
-        step <= 0 ||
-        step > 2147483647 ||
+        (constant === null && variable === null) ||
+        (constant !== null && (constant <= 0 || constant > 2147483647)) ||
         loop.cond.left.kind !== "varRef" ||
         loop.cond.left.localId !== counter ||
         (loop.cond.op !== "<" && loop.cond.op !== "<="))
@@ -88,15 +107,31 @@ export function boundedIntegerLoopFacts(loop, locals, initial) {
             return { min: 0, max: Number.MAX_SAFE_INTEGER };
         return null;
     }
+    let step;
+    if (constant !== null)
+        step = { min: constant, max: constant };
+    else {
+        // The step binding is read on every update; it must keep one value.
+        const operand = variable.localId;
+        const range = stable(operand) ? initial.get(operand) : undefined;
+        if (!range)
+            return result;
+        step =
+            variable.sign > 0
+                ? { min: range.min, max: range.max }
+                : { min: -range.max, max: -range.min };
+        if (step.min <= 0 || step.max > 2147483647)
+            return result;
+    }
     const limit = bound(loop.cond.right);
     if (!limit || limit.max < start.min)
         return result;
     const distance = limit.max - start.min;
-    const iterations = Math.floor(distance / step) + 1;
+    const iterations = Math.floor(distance / step.min) + 1;
     if (!Number.isSafeInteger(distance) || !Number.isSafeInteger(iterations))
         return result;
     // Header facts also cover the failing final condition and zero iterations.
-    const maximum = Math.max(start.max, limit.max + step);
+    const maximum = Math.max(start.max, limit.max + step.max);
     if (Number.isSafeInteger(maximum))
         result.set(counter, { min: start.min, max: maximum });
     for (const [id, hi] of upper) {
@@ -114,6 +149,119 @@ export function boundedIntegerLoopFacts(loop, locals, initial) {
     }
     return result;
 }
+/** Bound counters of a while loop by its condition. A counter qualifies when
+ * the loop (condition and body) changes it only by increments of positive
+ * integer literals outside nested loops, switch and exception regions, and a
+ * conjunct of the condition compares it below a literal or a binding the loop
+ * never writes (`while (x * x + y * y <= 4 && it < MAX) it++`). The body runs
+ * only after that conjunct held, and the condition never writes the counter,
+ * so every pass starts at most at the conjunct's bound and climbs by at most
+ * the sum of the body's increments. The counter starts at its entry fact and
+ * only grows, so the range holds at every read inside and after the loop. */
+export function guardedLoopCounterFacts(loop, locals, initial) {
+    const result = new Map();
+    const budget = new Map(), refused = new Set();
+    let opaque = 0;
+    const write = (id, delta) => {
+        if (opaque || delta === null || delta <= 0 || delta > 2147483647)
+            refused.add(id);
+        else
+            budget.set(id, (budget.get(id) ?? 0) + delta);
+    };
+    const expr = (e) => {
+        if (e.kind === "assignExpr")
+            write(e.localId, increment(e.localId, e.value));
+        if (e.kind === "incDec")
+            write(e.localId, e.op === "+" ? 1 : null);
+        return everyExprChild(e, expr, stmt);
+    };
+    const stmt = (s) => {
+        const region = s.kind === "for" ||
+            s.kind === "while" ||
+            s.kind === "doWhile" ||
+            s.kind === "forOf" ||
+            s.kind === "tryCatch" ||
+            s.kind === "switch";
+        if (region)
+            opaque++;
+        if (s.kind === "assign")
+            write(s.localId, increment(s.localId, s.value));
+        if (s.kind === "varDecl" || s.kind === "forOf")
+            write(s.localId, null);
+        if (s.kind === "tryCatch" && s.catchLocalId)
+            write(s.catchLocalId, null);
+        const completed = everyStmtChild(s, expr, stmt);
+        if (region)
+            opaque--;
+        return completed;
+    };
+    // The condition is evaluated before every pass; a write there would
+    // separate the compared value from the one the body sees.
+    const condition = new Set();
+    const conditionWrites = (e) => {
+        if (e.kind === "assignExpr" || e.kind === "incDec")
+            condition.add(e.localId);
+        return everyExprChild(e, conditionWrites, (s) => {
+            opaque++;
+            stmt(s);
+            opaque--;
+            return true;
+        });
+    };
+    conditionWrites(loop.cond);
+    for (const id of condition)
+        refused.add(id);
+    loop.body.every(stmt);
+    const stable = (id) => {
+        const local = locals.get(id);
+        return local !== undefined && !local.boxed && !local.tdz && !budget.has(id) && !refused.has(id);
+    };
+    const limit = (e) => {
+        if (e.kind === "numLit" && Number.isSafeInteger(e.value) && !Object.is(e.value, -0))
+            return { min: e.value, max: e.value };
+        if (e.kind === "varRef" && stable(e.localId))
+            return initial.get(e.localId) ?? null;
+        return null;
+    };
+    // Conjuncts that hold whenever the body runs.
+    const conjuncts = [];
+    const collect = (e) => {
+        if (e.kind === "toBool")
+            collect(e.operand);
+        else if (e.kind === "logical" && e.op === "&&") {
+            collect(e.left);
+            collect(e.right);
+        }
+        else
+            conjuncts.push(e);
+    };
+    collect(loop.cond);
+    const ceiling = new Map();
+    for (const c of conjuncts) {
+        if (c.kind !== "bin")
+            continue;
+        // `counter < bound` or `bound > counter` (and the inclusive forms).
+        const below = c.op === "<" || c.op === "<=", above = c.op === ">" || c.op === ">=";
+        const counter = below ? c.left : above ? c.right : null, other = below ? c.right : c.left;
+        if (counter?.kind !== "varRef")
+            continue;
+        const bound = limit(other);
+        if (!bound)
+            continue;
+        const hi = c.op === "<" || c.op === ">" ? bound.max - 1 : bound.max;
+        const previous = ceiling.get(counter.localId);
+        ceiling.set(counter.localId, previous === undefined ? hi : Math.min(previous, hi));
+    }
+    for (const [id, step] of budget) {
+        const local = locals.get(id), start = initial.get(id), hi = ceiling.get(id);
+        if (refused.has(id) || !local || local.boxed || local.tdz || !start || hi === undefined)
+            continue;
+        const max = Math.max(start.max, hi + step);
+        if (Number.isSafeInteger(start.min) && Number.isSafeInteger(max))
+            result.set(id, { min: start.min, max });
+    }
+    return result;
+}
 /** Recognize only exits whose target cannot be inside this statement list.
  * Labeled blocks, loops, switch and exception regions retain the join. */
 export function integerPathFallsThrough(body) {

package/dist/ir/integer-loop-facts.js.map

@@ -1 +1 @@
-{"version":3,"file":"integer-loop-facts.js","sourceRoot":"","sources":["../../src/ir/integer-loop-facts.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAE/D,SAAS,SAAS,CAAC,EAAU,EAAE,KAAa;IAC1C,IACE,KAAK,CAAC,IAAI,KAAK,KAAK;QACpB,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;QAC5B,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,EAAE;QACzB,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ;QAC7B,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;QACxC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEhC,OAAO,IAAI,CAAC;IACd,OAAO,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7F,CAAC;AAED;;;uEAGuE;AACvE,MAAM,UAAU,uBAAuB,CACrC,IAA8B,EAC9B,MAAoC,EACpC,OAA0C;IAE1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,KAAK;QAC9F,OAAO,MAAM,CAAC;IAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAC/B,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5F,IACE,CAAC,KAAK;QACN,KAAK,CAAC,GAAG,GAAG,CAAC;QACb,IAAI,KAAK,IAAI;QACb,IAAI,IAAI,CAAC;QACT,IAAI,GAAG,UAAU;QACjB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,OAAO;QAClC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC;QAE/C,OAAO,MAAM,CAAC;IAChB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,EAC/B,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,EACrC,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,KAAoB,EAAQ,EAAE;QACvD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,IAAI,MAAM,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5E,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpB,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,OAAO,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,MAAM,MAAM,GACV,CAAC,CAAC,IAAI,KAAK,KAAK;YAChB,CAAC,CAAC,IAAI,KAAK,OAAO;YAClB,CAAC,CAAC,IAAI,KAAK,SAAS;YACpB,CAAC,CAAC,IAAI,KAAK,OAAO;YAClB,CAAC,CAAC,IAAI,KAAK,UAAU;YACrB,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC;QACtB,IAAI,MAAM;YAAE,MAAM,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACzE,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,MAAM;YAAE,MAAM,EAAE,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,MAAM,GAAG,CAAC,EAAU,EAAW,EAAE;QACrC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,OAAO,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,OAAO,CAAC;IACjG,CAAC,CAAC;IACF,SAAS,KAAK,CAAC,CAAS;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjF,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACxC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;QACpF,IACE,CAAC,CAAC,IAAI,KAAK,gBAAgB;YAC3B,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC;YACpD,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ;YAC5B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC;YAE1B,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG;QAAE,OAAO,MAAM,CAAC;IACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC;IACvC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACnD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC;QAAE,OAAO,MAAM,CAAC;IACxF,2EAA2E;IAC3E,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;IACtD,IAAI,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC;QAAE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;IACzF,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,OAAO;YAAE,SAAS;QAC1D,MAAM,SAAS,GAAG,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC9C,MAAM,SAAS,GAAG,UAAU,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC;YAAE,SAAS;QACnF,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC;QAClC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC;QAClC,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;0EAC0E;AAC1E,MAAM,UAAU,uBAAuB,CAAC,IAAuB;IAC7D,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IACE,IAAI,CAAC,IAAI,KAAK,QAAQ;YACtB,IAAI,CAAC,IAAI,KAAK,OAAO;YACrB,IAAI,CAAC,IAAI,KAAK,SAAS;YACvB,IAAI,CAAC,IAAI,KAAK,OAAO;YACrB,IAAI,CAAC,IAAI,KAAK,UAAU;YAExB,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC;YACtF,OAAO,KAAK,CAAC;QACf,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;YAClB,IAAI,CAAC,KAAK;YACV,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC;YACnC,CAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,CAAC;YAEpC,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}
+{"version":3,"file":"integer-loop-facts.js","sourceRoot":"","sources":["../../src/ir/integer-loop-facts.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAE/D,SAAS,SAAS,CAAC,EAAU,EAAE,KAAa;IAC1C,IACE,KAAK,CAAC,IAAI,KAAK,KAAK;QACpB,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;QAC5B,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,EAAE;QACzB,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ;QAC7B,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC;QACxC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEhC,OAAO,IAAI,CAAC;IACd,OAAO,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7F,CAAC;AAED;;oBAEoB;AACpB,SAAS,iBAAiB,CAAC,EAAU,EAAE,KAAa;IAClD,IACE,KAAK,CAAC,IAAI,KAAK,KAAK;QACpB,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;QAC5B,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,EAAE;QACzB,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ;QAC7B,KAAK,CAAC,KAAK,CAAC,OAAO,KAAK,EAAE;QAC1B,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC;QAEtC,OAAO,IAAI,CAAC;IACd,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3E,CAAC;AAED;;;;;;;;;WASW;AACX,MAAM,UAAU,uBAAuB,CACrC,IAA8B,EAC9B,MAAoC,EACpC,OAA0C;IAE1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,KAAK;QAC9F,OAAO,MAAM,CAAC;IAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAC/B,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAChG,MAAM,QAAQ,GACZ,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACzF,IACE,CAAC,KAAK;QACN,KAAK,CAAC,GAAG,GAAG,CAAC;QACb,CAAC,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAC;QACxC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,QAAQ,GAAG,UAAU,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,OAAO;QAClC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC;QAE/C,OAAO,MAAM,CAAC;IAChB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,EAC/B,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,EACrC,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,KAAoB,EAAQ,EAAE;QACvD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,IAAI,MAAM,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5E,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpB,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,OAAO,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,MAAM,MAAM,GACV,CAAC,CAAC,IAAI,KAAK,KAAK;YAChB,CAAC,CAAC,IAAI,KAAK,OAAO;YAClB,CAAC,CAAC,IAAI,KAAK,SAAS;YACpB,CAAC,CAAC,IAAI,KAAK,OAAO;YAClB,CAAC,CAAC,IAAI,KAAK,UAAU;YACrB,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC;QACtB,IAAI,MAAM;YAAE,MAAM,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACzE,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,MAAM;YAAE,MAAM,EAAE,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,MAAM,GAAG,CAAC,EAAU,EAAW,EAAE;QACrC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,OAAO,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,OAAO,CAAC;IACjG,CAAC,CAAC;IACF,SAAS,KAAK,CAAC,CAAS;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjF,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACxC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;QACpF,IACE,CAAC,CAAC,IAAI,KAAK,gBAAgB;YAC3B,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC;YACpD,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ;YAC5B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC;YAE1B,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,IAAkB,CAAC;IACvB,IAAI,QAAQ,KAAK,IAAI;QAAE,IAAI,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;SAC1D,CAAC;QACJ,oEAAoE;QACpE,MAAM,OAAO,GAAG,QAAS,CAAC,OAAO,CAAC;QAClC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjE,IAAI,CAAC,KAAK;YAAE,OAAO,MAAM,CAAC;QAC1B,IAAI;YACF,QAAS,CAAC,IAAI,GAAG,CAAC;gBAChB,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE;gBACpC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,GAAG,UAAU;YAAE,OAAO,MAAM,CAAC;IAC5D,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG;QAAE,OAAO,MAAM,CAAC;IACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC;IACvC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC;QAAE,OAAO,MAAM,CAAC;IACxF,2EAA2E;IAC3E,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1D,IAAI,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC;QAAE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;IACzF,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,OAAO;YAAE,SAAS;QAC1D,MAAM,SAAS,GAAG,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC9C,MAAM,SAAS,GAAG,UAAU,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC;YAAE,SAAS;QACnF,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC;QAClC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,GAAG,SAAS,CAAC;QAClC,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;6EAQ6E;AAC7E,MAAM,UAAU,uBAAuB,CACrC,IAAgC,EAChC,MAAoC,EACpC,OAA0C;IAE1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,EACtC,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,KAAoB,EAAQ,EAAE;QACvD,IAAI,MAAM,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,UAAU;YAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;;YAC7E,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IACrD,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnE,OAAO,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAS,EAAW,EAAE;QAClC,MAAM,MAAM,GACV,CAAC,CAAC,IAAI,KAAK,KAAK;YAChB,CAAC,CAAC,IAAI,KAAK,OAAO;YAClB,CAAC,CAAC,IAAI,KAAK,SAAS;YACpB,CAAC,CAAC,IAAI,KAAK,OAAO;YAClB,CAAC,CAAC,IAAI,KAAK,UAAU;YACrB,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC;QACtB,IAAI,MAAM;YAAE,MAAM,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACzE,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;YAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,YAAY;YAAE,KAAK,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACzE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,MAAM;YAAE,MAAM,EAAE,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IACF,oEAAoE;IACpE,0DAA0D;IAC1D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,eAAe,GAAG,CAAC,CAAS,EAAW,EAAE;QAC7C,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAC7E,OAAO,cAAc,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC,EAAE,EAAE;YAC9C,MAAM,EAAE,CAAC;YACT,IAAI,CAAC,CAAC,CAAC,CAAC;YACR,MAAM,EAAE,CAAC;YACT,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IACF,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,SAAS;QAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtB,MAAM,MAAM,GAAG,CAAC,EAAU,EAAW,EAAE;QACrC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,OAAO,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClG,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAuB,EAAE;QAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjF,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACxC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;QACpF,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,8CAA8C;IAC9C,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,CAAS,EAAQ,EAAE;QAClC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;aACvC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;YAC/C,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;;YAAM,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC;IACF,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;YAAE,SAAS;QAC/B,oEAAoE;QACpE,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,EACzC,KAAK,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EACrD,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACnC,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ;YAAE,SAAS;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACpE,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC9C,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;IACrF,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAC1B,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EACvB,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,KAAK,SAAS;YACrF,SAAS;QACX,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC;QAC3C,IAAI,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC;YAC9D,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;0EAC0E;AAC1E,MAAM,UAAU,uBAAuB,CAAC,IAAuB;IAC7D,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IACE,IAAI,CAAC,IAAI,KAAK,QAAQ;YACtB,IAAI,CAAC,IAAI,KAAK,OAAO;YACrB,IAAI,CAAC,IAAI,KAAK,SAAS;YACvB,IAAI,CAAC,IAAI,KAAK,OAAO;YACrB,IAAI,CAAC,IAAI,KAAK,UAAU;YAExB,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC;YACtF,OAAO,KAAK,CAAC;QACf,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;YAClB,IAAI,CAAC,KAAK;YACV,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC;YACnC,CAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,CAAC;YAEpC,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/ir/integer-ranges.d.ts

@@ -8,6 +8,7 @@ export interface IntegerRange {
 export type IntegerRanges = ReadonlyMap<IrExpr, IntegerRange | null>;
 export declare function integerArithmeticRange(op: string, left: IntegerRange, right: IntegerRange): IntegerRange | null;
 export declare const INT32_RANGE: IntegerRange;
+export declare const NON_NEGATIVE_INT32_RANGE: IntegerRange;
 export declare function withinInt32(range: IntegerRange | null | undefined): boolean;
 export declare function withinUint32(range: IntegerRange | null | undefined): boolean;
 export type BitwiseOp = "&" | "|" | "^" | "<<" | ">>" | ">>>";
@@ -43,9 +44,11 @@ export interface IntegerSlotFacts {
  * but argument expressions can; unknown evaluation forms invalidate all
  * syntactically written slots before their children are inspected. Loops
  * discard loop-carried facts and retain only invariant or induction facts,
- * except closed locals: a local whose region-entry value is an int32 (a
- * uint32) and whose every write inside the region is one by construction
- * (bitwise results, `>>>` results for uint32, literals and slots in range,
- * other such locals) remains a full int32 (uint32) range across the region. Suspensions and captured bindings
- * deliberately remain outside the proof. */
+ * except closed locals: a local whose region-entry value is inside a fixed
+ * bound (int32, uint32 or non-negative int32) and whose every write inside
+ * the region evaluates inside it, assuming every such local is (bitwise
+ * results, exact `+ - * %` over in-range operands such as
+ * `v = (v * 31 + n) % 1000003`, literals and slots in range), keeps the
+ * range those writes and its entry value span across the region.
+ * Suspensions and captured bindings deliberately remain outside the proof. */
 export declare function analyzeIntegerRanges(fn: IrFunction, slots?: IntegerSlotFacts): IntegerRanges;

package/dist/ir/integer-ranges.js

@@ -1,8 +1,11 @@
 import { everyExprChild, everyStmtChild, everyStmtList } from "./traverse.js";
 import { byteNumberAccess, byteNumberRange } from "./byte-numbers.js";
-import { boundedIntegerLoopFacts, integerPathFallsThrough } from "./integer-loop-facts.js";
+import { boundedIntegerLoopFacts, guardedLoopCounterFacts, integerPathFallsThrough, } from "./integer-loop-facts.js";
 const SIGNED = { min: -2147483648, max: 2147483647 };
 const UNSIGNED = { min: 0, max: 4294967295 };
+/** Int32 and uint32 at once: the bound under which `%` (modeled only for
+ * non-negative dividends) can close a loop-carried local. */
+const NON_NEGATIVE = { min: 0, max: 2147483647 };
 const EXACT_LIMIT = 2 ** 53;
 /** The most UTF-16 code units a runtime string holds: SCR_STR_MAX_CAP
  * (scr_runtime.h) caps a string's UTF-8 bytes, and a UTF-16 length never
@@ -51,6 +54,7 @@ export function integerArithmeticRange(op, left, right) {
     return Number.isSafeInteger(min) && Number.isSafeInteger(max) ? { min, max } : null;
 }
 export const INT32_RANGE = SIGNED;
+export const NON_NEGATIVE_INT32_RANGE = NON_NEGATIVE;
 export function withinInt32(range) {
     return !!range && range.min >= SIGNED.min && range.max <= SIGNED.max;
 }
@@ -181,11 +185,13 @@ export function bitwiseIdentityOperand(e) {
  * but argument expressions can; unknown evaluation forms invalidate all
  * syntactically written slots before their children are inspected. Loops
  * discard loop-carried facts and retain only invariant or induction facts,
- * except closed locals: a local whose region-entry value is an int32 (a
- * uint32) and whose every write inside the region is one by construction
- * (bitwise results, `>>>` results for uint32, literals and slots in range,
- * other such locals) remains a full int32 (uint32) range across the region. Suspensions and captured bindings
- * deliberately remain outside the proof. */
+ * except closed locals: a local whose region-entry value is inside a fixed
+ * bound (int32, uint32 or non-negative int32) and whose every write inside
+ * the region evaluates inside it, assuming every such local is (bitwise
+ * results, exact `+ - * %` over in-range operands such as
+ * `v = (v * 31 + n) % 1000003`, literals and slots in range), keeps the
+ * range those writes and its entry value span across the region.
+ * Suspensions and captured bindings deliberately remain outside the proof. */
 export function analyzeIntegerRanges(fn, slots = {}) {
     const ranges = new Map();
     if (fn.async || fn.generator)
@@ -253,22 +259,31 @@ export function analyzeIntegerRanges(fn, slots = {}) {
         return { values, declared };
     }
     let functionWrites = null;
-    /** Locals that hold an int32 or a uint32 everywhere inside and after a
-     * region whose control flow this analysis does not follow, with that
-     * range. A candidate either enters with a fact inside the range or is
+    const noInvariants = new Map();
+    /** Locals that hold an exact integer inside a fixed bound (int32, uint32
+     * or non-negative int32) everywhere inside and after a region whose
+     * control flow this analysis does not follow, with a range inside that
+     * bound. A candidate either enters with a fact inside the bound or is
      * declared inside the region and written only there (definite assignment:
-     * every read follows one of those writes). For each range, the greatest
-     * fixpoint keeps candidates whose every write lands in it by construction
-     * given the other candidates; the two closures are independent, so a local
-     * written both ways (`x | 0` and `x >>> 0`) closes under neither. */
-    function closedLocals(nodes, entry) {
+     * every read follows one of those writes). For each bound, the greatest
+     * fixpoint keeps candidates whose every write evaluates inside it, by the
+     * same interval rules as `expr` (exact safe integers, never -0), while the
+     * candidates are assumed inside it; the closures are independent, so a
+     * local written both ways (`x | 0` and `x >>> 0`) closes under neither
+     * int32 nor uint32. `invariant` holds ranges of locals that hold at every
+     * read inside the region (an induction counter the body never writes).
+     *
+     * The closed range then narrows to the entry fact joined with the writes'
+     * values under the bound: by induction over the region's execution every
+     * candidate stays inside its narrowed range (itself inside the bound), so
+     * each write evaluates inside the hull the bound proved for it. */
+    function closedLocals(nodes, entry, invariant) {
         const { values, declared } = regionWrites(nodes);
         const result = new Map();
         if (values.size === 0)
             return result;
         const within = (bound, range) => !!range && range.min >= bound.min && range.max <= bound.max;
         const closure = (bound) => {
-            const signed = bound === SIGNED;
             const closed = new Set();
             for (const [id, list] of values) {
                 if (within(bound, entry.get(id)))
@@ -279,60 +294,114 @@ export function analyzeIntegerRanges(fn, slots = {}) {
                         closed.add(id);
                 }
             }
-            const member = (e) => {
+            // The values an expression can produce while every closed candidate
+            // holds a value inside `bound`, or null.
+            const value = (e) => {
                 if (e.type.kind !== "f64")
-                    return false;
+                    return null;
                 switch (e.kind) {
                     case "numLit":
-                        return (Number.isInteger(e.value) &&
-                            within(bound, { min: e.value, max: e.value }) &&
-                            !Object.is(e.value, -0));
-                    case "bin":
-                        return signed
-                            ? e.op === "&" || e.op === "|" || e.op === "^" || e.op === "<<" || e.op === ">>"
-                            : e.op === ">>>";
-                    case "unary":
-                        return signed && e.op === "~";
-                    case "libCall":
-                        return (signed && e.fn === "math.imul") || e.fn === "math.clz32";
-                    case "ternary":
-                        return member(e.then) && member(e.else_);
-                    case "logical":
-                        return member(e.left) && member(e.right);
+                        return Number.isSafeInteger(e.value) && !Object.is(e.value, -0)
+                            ? { min: e.value, max: e.value }
+                            : null;
+                    case "bin": {
+                        const left = value(e.left), right = value(e.right);
+                        if (isBitwiseOp(e.op))
+                            return bitwiseRange(e.op, operandView(e.left, left), operandView(e.right, right));
+                        return left && right ? integerArithmeticRange(e.op, left, right) : null;
+                    }
+                    case "unary": {
+                        const operand = value(e.operand);
+                        if (e.op === "~") {
+                            const bits = int32View(operandView(e.operand, operand));
+                            return { min: -bits.max - 1, max: -bits.min - 1 };
+                        }
+                        // -x is -0 for x = 0.
+                        return e.op === "-" && operand && (operand.max < 0 || operand.min > 0)
+                            ? { min: -operand.max, max: -operand.min }
+                            : null;
+                    }
+                    case "libCall": {
+                        if (e.fn === "math.imul")
+                            return SIGNED;
+                        if (e.fn === "math.clz32")
+                            return { min: 0, max: 32 };
+                        if ((e.fn === "math.min" || e.fn === "math.max") && e.args.length > 0) {
+                            const args = e.args.map(value);
+                            if (args.some((a) => a === null))
+                                return null;
+                            const known = args;
+                            const mins = known.map((a) => a.min), maxes = known.map((a) => a.max);
+                            return e.fn === "math.min"
+                                ? { min: Math.min(...mins), max: Math.min(...maxes) }
+                                : { min: Math.max(...mins), max: Math.max(...maxes) };
+                        }
+                        return null;
+                    }
+                    case "ternary": {
+                        const yes = value(e.then), no = value(e.else_);
+                        return yes && no ? union(yes, no) : null;
+                    }
+                    case "logical": {
+                        const left = value(e.left), right = value(e.right);
+                        return left && right ? union(left, right) : null;
+                    }
                     case "assignExpr":
-                        return member(e.value);
+                        return value(e.value);
                     case "seqExpr":
-                        return member(e.result);
-                    case "varRef":
-                        return (closed.has(e.localId) ||
-                            (!values.has(e.localId) && within(bound, entry.get(e.localId))) ||
-                            within(bound, boxedRange(e.localId)));
+                        return value(e.result);
+                    case "varRef": {
+                        const known = invariant.get(e.localId);
+                        if (known)
+                            return known;
+                        if (closed.has(e.localId))
+                            return bound;
+                        if (!values.has(e.localId) && entry.has(e.localId))
+                            return entry.get(e.localId);
+                        return boxedRange(e.localId);
+                    }
                     case "fieldGet":
                     case "call":
-                        return within(bound, slotRange(e));
+                        return slotRange(e);
                     default:
-                        return false;
+                        return null;
                 }
             };
+            const hulls = new Map();
             for (let changed = true; changed;) {
                 changed = false;
-                for (const id of closed)
-                    if (values.get(id).some((value) => value === null || !member(value))) {
+                for (const id of closed) {
+                    let hull = entry.get(id) ?? null;
+                    for (const write of values.get(id)) {
+                        const range = write && value(write);
+                        if (!within(bound, range)) {
+                            hull = null;
+                            break;
+                        }
+                        hull = hull ? union(hull, range) : range;
+                    }
+                    if (hull)
+                        hulls.set(id, hull);
+                    else {
                         closed.delete(id);
                         changed = true;
                     }
+                }
             }
-            return closed;
+            return new Map([...closed].map((id) => [id, hulls.get(id)]));
         };
-        const int32 = closure(SIGNED), uint32 = closure(UNSIGNED);
+        const closures = [closure(SIGNED), closure(UNSIGNED), closure(NON_NEGATIVE)];
         for (const id of entry.keys()) {
-            const signed = int32.has(id), unsigned = uint32.has(id);
-            if (signed && unsigned)
-                result.set(id, { min: 0, max: SIGNED.max });
-            else if (signed)
-                result.set(id, SIGNED);
-            else if (unsigned)
-                result.set(id, UNSIGNED);
+            let range = null;
+            for (const closed of closures) {
+                const hull = closed.get(id);
+                if (hull)
+                    range = range
+                        ? { min: Math.max(range.min, hull.min), max: Math.min(range.max, hull.max) }
+                        : hull;
+            }
+            if (range)
+                result.set(id, range);
         }
         return result;
     }
@@ -379,7 +448,11 @@ export function analyzeIntegerRanges(fn, slots = {}) {
      * locals at their closed range. `entry` is the state before any of the
      * region's writes can run. */
     function havoc(facts, nodes, entry) {
-        const closed = closedLocals(nodes, entry);
+        havocWith(facts, nodes, entry, noInvariants);
+    }
+    /** `havoc` with ranges that hold at every read inside the region. */
+    function havocWith(facts, nodes, entry, invariant) {
+        const closed = closedLocals(nodes, entry, invariant);
         invalidate(facts, nodes);
         for (const [id, range] of closed)
             facts.set(id, range);
@@ -697,7 +770,19 @@ export function analyzeIntegerRanges(fn, slots = {}) {
                     const counter = induction(s, facts);
                     const bounded = boundedIntegerLoopFacts(s, loopLocals, facts);
                     const loop = new Map(facts);
-                    havoc(loop, [...s.body, ...(s.cond ? [s.cond] : []), ...(s.update ? [s.update] : [])], loop);
+                    // Only the update writes the counter, so its header range holds at
+                    // every read in the condition, the body and the update.
+                    const invariant = new Map();
+                    if (counter)
+                        invariant.set(counter.id, counter.range);
+                    if (s.init?.kind === "varDecl") {
+                        const id = s.init.localId, range = bounded.get(id), other = invariant.get(id);
+                        if (range)
+                            invariant.set(id, other
+                                ? { min: Math.max(range.min, other.min), max: Math.min(range.max, other.max) }
+                                : range);
+                    }
+                    havocWith(loop, [...s.body, ...(s.cond ? [s.cond] : []), ...(s.update ? [s.update] : [])], loop, invariant);
                     if (counter)
                         loop.set(counter.id, counter.range);
                     for (const [id, range] of bounded)
@@ -732,8 +817,13 @@ export function analyzeIntegerRanges(fn, slots = {}) {
                 }
                 case "while":
                 case "doWhile": {
+                    // Counters the condition bounds keep their range at every read
+                    // inside and after the loop.
+                    const guarded = s.kind === "while" ? guardedLoopCounterFacts(s, loopLocals, facts) : noInvariants;
                     const loop = new Map(facts);
-                    havoc(loop, [s], loop);
+                    havocWith(loop, [s], loop, guarded);
+                    for (const [id, range] of guarded)
+                        set(loop, id, range);
                     const header = new Map(loop);
                     expr(s.cond, header);
                     if (s.kind === "while") {
@@ -742,7 +832,9 @@ export function analyzeIntegerRanges(fn, slots = {}) {
                     }
                     else
                         body(s.body, new Map(loop));
-                    havoc(facts, [s], facts);
+                    havocWith(facts, [s], facts, guarded);
+                    for (const [id, range] of guarded)
+                        set(facts, id, range);
                     break;
                 }
                 case "forOf": {