@markw65/monkeyc-optimizer 1.0.27 → 1.0.30

package/build/optimizer.cjs

@@ -2172,6 +2172,185 @@ function pendGo(self, fn) {
 }
 
 
+/***/ }),
+
+/***/ 2789:
+/***/ ((module) => {
+
+/**
+ * Expose `PriorityQueue`.
+ */
+module.exports = PriorityQueue;
+
+/**
+ * Initializes a new empty `PriorityQueue` with the given `comparator(a, b)`
+ * function, uses `.DEFAULT_COMPARATOR()` when no function is provided.
+ *
+ * The comparator function must return a positive number when `a > b`, 0 when
+ * `a == b` and a negative number when `a < b`.
+ *
+ * @param {Function}
+ * @return {PriorityQueue}
+ * @api public
+ */
+function PriorityQueue(comparator) {
+  this._comparator = comparator || PriorityQueue.DEFAULT_COMPARATOR;
+  this._elements = [];
+}
+
+/**
+ * Compares `a` and `b`, when `a > b` it returns a positive number, when
+ * it returns 0 and when `a < b` it returns a negative number.
+ *
+ * @param {String|Number} a
+ * @param {String|Number} b
+ * @return {Number}
+ * @api public
+ */
+PriorityQueue.DEFAULT_COMPARATOR = function(a, b) {
+  if (typeof a === 'number' && typeof b === 'number') {
+    return a - b;
+  } else {
+    a = a.toString();
+    b = b.toString();
+
+    if (a == b) return 0;
+
+    return (a > b) ? 1 : -1;
+  }
+};
+
+/**
+ * Returns whether the priority queue is empty or not.
+ *
+ * @return {Boolean}
+ * @api public
+ */
+PriorityQueue.prototype.isEmpty = function() {
+  return this.size() === 0;
+};
+
+/**
+ * Peeks at the top element of the priority queue.
+ *
+ * @return {Object}
+ * @throws {Error} when the queue is empty.
+ * @api public
+ */
+PriorityQueue.prototype.peek = function() {
+  if (this.isEmpty()) throw new Error('PriorityQueue is empty');
+
+  return this._elements[0];
+};
+
+/**
+ * Dequeues the top element of the priority queue.
+ *
+ * @return {Object}
+ * @throws {Error} when the queue is empty.
+ * @api public
+ */
+PriorityQueue.prototype.deq = function() {
+  var first = this.peek();
+  var last = this._elements.pop();
+  var size = this.size();
+
+  if (size === 0) return first;
+
+  this._elements[0] = last;
+  var current = 0;
+
+  while (current < size) {
+    var largest = current;
+    var left = (2 * current) + 1;
+    var right = (2 * current) + 2;
+
+    if (left < size && this._compare(left, largest) >= 0) {
+      largest = left;
+    }
+
+    if (right < size && this._compare(right, largest) >= 0) {
+      largest = right;
+    }
+
+    if (largest === current) break;
+
+    this._swap(largest, current);
+    current = largest;
+  }
+
+  return first;
+};
+
+/**
+ * Enqueues the `element` at the priority queue and returns its new size.
+ *
+ * @param {Object} element
+ * @return {Number}
+ * @api public
+ */
+PriorityQueue.prototype.enq = function(element) {
+  var size = this._elements.push(element);
+  var current = size - 1;
+
+  while (current > 0) {
+    var parent = Math.floor((current - 1) / 2);
+
+    if (this._compare(current, parent) <= 0) break;
+
+    this._swap(parent, current);
+    current = parent;
+  }
+
+  return size;
+};
+
+/**
+ * Returns the size of the priority queue.
+ *
+ * @return {Number}
+ * @api public
+ */
+PriorityQueue.prototype.size = function() {
+  return this._elements.length;
+};
+
+/**
+ *  Iterates over queue elements
+ *
+ *  @param {Function} fn
+ */
+PriorityQueue.prototype.forEach = function(fn) {
+  return this._elements.forEach(fn);
+};
+
+/**
+ * Compares the values at position `a` and `b` in the priority queue using its
+ * comparator function.
+ *
+ * @param {Number} a
+ * @param {Number} b
+ * @return {Number}
+ * @api private
+ */
+PriorityQueue.prototype._compare = function(a, b) {
+  return this._comparator(this._elements[a], this._elements[b]);
+};
+
+/**
+ * Swaps the values at position `a` and `b` in the priority queue.
+ *
+ * @param {Number} a
+ * @param {Number} b
+ * @api private
+ */
+PriorityQueue.prototype._swap = function(a, b) {
+  var aux = this._elements[a];
+  this._elements[a] = this._elements[b];
+  this._elements[b] = aux;
+};
+
+
 /***/ }),
 
 /***/ 4286:
@@ -9874,17 +10053,17 @@ async function build_project(product, options, lineCallback) {
     if (!product) {
         extraArgs.push("-e");
     }
-    switch (typeCheckLevel) {
-        case "Off":
+    switch (typeCheckLevel?.toLowerCase()) {
+        case "off":
             extraArgs.push("-l", "0");
             break;
-        case "Gradual":
+        case "gradual":
             extraArgs.push("-l", "1");
             break;
-        case "Informative":
+        case "informative":
             extraArgs.push("-l", "2");
             break;
-        case "Strict":
+        case "strict":
             extraArgs.push("-l", "3");
             break;
     }
@@ -10812,62 +10991,68 @@ function _check(x) {
     x = y;
 }
 const mctreeTypeInfo = {
-    ArrayExpression: ["elements"],
-    AssignmentExpression: ["left", "right"],
-    AttributeList: ["attributes"],
-    Attributes: ["elements"],
-    BinaryExpression: ["left", "right"],
-    Block: [],
-    BlockStatement: ["body", "innerComments"],
-    BreakStatement: [],
-    CallExpression: ["callee", "arguments"],
-    CatchClause: ["param", "body"],
-    CatchClauses: ["catches"],
-    ClassBody: ["body"],
-    ClassDeclaration: ["attrs", "id", "superClass", "body"],
-    ClassElement: ["item"],
-    ConditionalExpression: ["test", "consequent", "alternate"],
-    ContinueStatement: [],
-    DoWhileStatement: ["body", "test"],
-    EnumDeclaration: ["attrs", "id", "body"],
-    EnumStringBody: ["members"],
-    EnumStringMember: ["id", "init"],
-    ExpressionStatement: ["expression"],
-    ForStatement: ["init", "test", "body", "update"],
-    FunctionDeclaration: ["attrs", "id", "params", "returnType", "body"],
-    Identifier: [],
-    IfStatement: ["test", "consequent", "alternate"],
-    ImportModule: ["id"],
-    InstanceOfCase: ["id"],
-    Line: [],
-    Literal: [],
-    LogicalExpression: ["left", "right"],
-    MemberExpression: ["object", "property"],
-    MethodDefinition: ["params", "returnType"],
-    ModuleDeclaration: ["attrs", "id", "body"],
-    MultiLine: [],
-    NewExpression: ["callee", "arguments"],
-    ObjectExpression: ["properties"],
-    ParenthesizedExpression: ["expression"],
-    Program: ["body", "comments"],
-    Property: ["key", "value"],
-    ReturnStatement: ["argument"],
-    SequenceExpression: ["expressions"],
-    SizedArrayExpression: ["size", "ts"],
-    SwitchCase: ["test", "consequent"],
-    SwitchStatement: ["discriminant", "cases"],
-    ThisExpression: [],
-    ThrowStatement: ["argument"],
-    TryStatement: ["block", "handler", "finalizer"],
-    TypedefDeclaration: ["attrs", "id", "ts"],
-    TypeSpecList: ["ts"],
-    TypeSpecPart: ["name", "body", "callspec", "generics"],
-    UnaryExpression: ["argument"],
-    UpdateExpression: ["argument"],
-    Using: ["id", "as"],
-    VariableDeclaration: ["attrs", "declarations"],
-    VariableDeclarator: ["id", "init"],
-    WhileStatement: ["test", "body"],
+    ArrayExpression: { keys: ["elements"], expr: true },
+    AssignmentExpression: { keys: ["left", "right"], expr: true },
+    AttributeList: { keys: ["attributes"] },
+    Attributes: { keys: ["elements"] },
+    BinaryExpression: { keys: ["left", "right"], expr: true },
+    Block: { keys: [] },
+    BlockStatement: { keys: ["body", "innerComments"], stmt: true },
+    BreakStatement: { keys: [], stmt: true },
+    CallExpression: { keys: ["callee", "arguments"], expr: true },
+    CatchClause: { keys: ["param", "body"] },
+    CatchClauses: { keys: ["catches"] },
+    ClassBody: { keys: ["body"] },
+    ClassDeclaration: { keys: ["attrs", "id", "superClass", "body"], stmt: true },
+    ClassElement: { keys: ["item"] },
+    ConditionalExpression: {
+        keys: ["test", "consequent", "alternate"],
+        expr: true,
+    },
+    ContinueStatement: { keys: [], stmt: true },
+    DoWhileStatement: { keys: ["body", "test"], stmt: true },
+    EnumDeclaration: { keys: ["attrs", "id", "body"], stmt: true },
+    EnumStringBody: { keys: ["members"] },
+    EnumStringMember: { keys: ["id", "init"] },
+    ExpressionStatement: { keys: ["expression"], stmt: true },
+    ForStatement: { keys: ["init", "test", "body", "update"], stmt: true },
+    FunctionDeclaration: {
+        keys: ["attrs", "id", "params", "returnType", "body"],
+        stmt: true,
+    },
+    Identifier: { keys: [], expr: true },
+    IfStatement: { keys: ["test", "consequent", "alternate"], stmt: true },
+    ImportModule: { keys: ["id"] },
+    InstanceOfCase: { keys: ["id"] },
+    Line: { keys: [] },
+    Literal: { keys: [], expr: true },
+    LogicalExpression: { keys: ["left", "right"], expr: true },
+    MemberExpression: { keys: ["object", "property"], expr: true },
+    MethodDefinition: { keys: ["params", "returnType"] },
+    ModuleDeclaration: { keys: ["attrs", "id", "body"], stmt: true },
+    MultiLine: { keys: [] },
+    NewExpression: { keys: ["callee", "arguments"], expr: true },
+    ObjectExpression: { keys: ["properties"], expr: true },
+    ParenthesizedExpression: { keys: ["expression"], expr: true },
+    Program: { keys: ["body", "comments"] },
+    Property: { keys: ["key", "value"] },
+    ReturnStatement: { keys: ["argument"], stmt: true },
+    SequenceExpression: { keys: ["expressions"], expr: true },
+    SizedArrayExpression: { keys: ["size", "ts"], expr: true },
+    SwitchCase: { keys: ["test", "consequent"] },
+    SwitchStatement: { keys: ["discriminant", "cases"], stmt: true },
+    ThisExpression: { keys: [], expr: true },
+    ThrowStatement: { keys: ["argument"], stmt: true },
+    TryStatement: { keys: ["block", "handler", "finalizer"], stmt: true },
+    TypedefDeclaration: { keys: ["attrs", "id", "ts"], stmt: true },
+    TypeSpecList: { keys: ["ts"] },
+    TypeSpecPart: { keys: ["name", "body", "callspec", "generics"] },
+    UnaryExpression: { keys: ["argument"], expr: true },
+    UpdateExpression: { keys: ["argument"], expr: true },
+    Using: { keys: ["id", "as"] },
+    VariableDeclaration: { keys: ["attrs", "declarations"], stmt: true },
+    VariableDeclarator: { keys: ["id", "init"] },
+    WhileStatement: { keys: ["test", "body"], stmt: true },
 };
 function isMCTreeNode(node) {
     return node ? typeof node === "object" && "type" in node : false;
@@ -10892,7 +11077,7 @@ function traverseAst(node, pre, post) {
     if (!mctreeTypeInfo[node.type]) {
         throw new Error("what?");
     }
-    for (const key of nodes || mctreeTypeInfo[node.type]) {
+    for (const key of nodes || mctreeTypeInfo[node.type].keys) {
         const value = node[key];
         if (!value)
             continue;
@@ -10919,13 +11104,21 @@ function traverseAst(node, pre, post) {
             }
         }
         else if (isMCTreeNode(value)) {
-            const repl = traverseAst(value, pre, post);
+            let repl = traverseAst(value, pre, post);
             if (repl === false) {
                 delete node[key];
             }
             else if (repl != null) {
                 if (Array.isArray(repl)) {
-                    throw new Error("Array returned by traverseAst in Node context");
+                    if (isStatement(value) && repl.every((s) => isStatement(s))) {
+                        repl = withLoc({
+                            type: "BlockStatement",
+                            body: repl,
+                        }, repl[0], repl[repl.length - 1]);
+                    }
+                    else {
+                        throw new Error("Array returned by traverseAst in Node context");
+                    }
                 }
                 node[key] = repl;
             }
@@ -10933,6 +11126,55 @@ function traverseAst(node, pre, post) {
     }
     return post && post(node);
 }
+function isStatement(node) {
+    return hasProperty(mctreeTypeInfo[node.type], "stmt");
+}
+function isExpression(node) {
+    return hasProperty(mctreeTypeInfo[node.type], "expr");
+}
+function mayThrow(node) {
+    switch (node.type) {
+        case "BinaryExpression":
+        case "CallExpression":
+        case "ConditionalExpression":
+        case "LogicalExpression":
+        case "NewExpression":
+        case "ThrowStatement":
+        case "UnaryExpression":
+        case "UpdateExpression":
+            return true;
+        default:
+            return false;
+    }
+}
+function hasProperty(obj, prop) {
+    return obj ? Object.prototype.hasOwnProperty.call(obj, prop) : false;
+}
+function withLoc(node, start, end) {
+    if (start && start.loc) {
+        node.start = start.start;
+        if (!node.end)
+            node.end = start.end;
+        node.loc = { ...(node.loc || start.loc), start: start.loc.start };
+    }
+    if (end && end.loc) {
+        node.end = end.end;
+        node.loc = { ...(node.loc || end.loc), end: end.loc.end };
+    }
+    return node;
+}
+function withLocDeep(node, start, end) {
+    node = withLoc({ ...node }, start, end);
+    for (const key of mctreeTypeInfo[node.type].keys) {
+        const value = node[key];
+        if (!value)
+            continue;
+        const fix = (v) => isMCTreeNode(v) ? withLocDeep(v, start, end) : v;
+        const repl = Array.isArray(value) ? value.map(fix) : fix(value);
+        node[key] = repl;
+    }
+    return node;
+}
 
 ;// CONCATENATED MODULE: ./src/variable-renamer.ts
 
@@ -11187,6 +11429,7 @@ function processInlineBody(state, func, call, root, params) {
     const post = state.post;
     state.inlining = true;
     let insertedVariableDecls = null;
+    const replacements = new Set();
     try {
         state.pre = (node) => {
             if (failed)
@@ -11194,7 +11437,7 @@ function processInlineBody(state, func, call, root, params) {
             node.start = call.start;
             node.end = call.end;
             node.loc = call.loc;
-            if (node === insertedVariableDecls)
+            if (replacements.has(node))
                 return false;
             const result = pre(node, state);
             if (!insertedVariableDecls && node.type === "BlockStatement") {
@@ -11222,6 +11465,7 @@ function processInlineBody(state, func, call, root, params) {
                     kind: "var",
                 };
                 node.body.unshift(insertedVariableDecls);
+                replacements.add(insertedVariableDecls);
             }
             return result;
         };
@@ -11236,7 +11480,9 @@ function processInlineBody(state, func, call, root, params) {
                     if ((0,external_api_cjs_namespaceObject.hasProperty)(params, node.name)) {
                         const ix = params[node.name];
                         if (ix >= 0) {
-                            replacement = call.arguments[ix];
+                            replacement = { ...call.arguments[ix] };
+                            replacements.add(replacement);
+                            return replacement;
                         }
                         break;
                     }
@@ -11273,6 +11519,10 @@ function processInlineBody(state, func, call, root, params) {
     }
 }
 function unused(expression, top) {
+    const estmt = (expression) => withLoc({
+        type: "ExpressionStatement",
+        expression,
+    }, expression);
     switch (expression.type) {
         case "Literal":
             return [];
@@ -11284,9 +11534,50 @@ function unused(expression, top) {
             if (expression.operator === "as") {
                 return unused(expression.left);
             }
-        // fall through
-        case "LogicalExpression":
             return unused(expression.left).concat(unused(expression.right));
+        case "LogicalExpression": {
+            const right = unused(expression.right);
+            if (!right.length)
+                return unused(expression.left);
+            const consequent = withLoc({
+                type: "BlockStatement",
+                body: [estmt(expression.right)],
+            }, expression.right);
+            let alternate;
+            if (expression.operator == "||") {
+                alternate = { ...consequent };
+                consequent.body = [];
+            }
+            return [
+                withLoc({
+                    type: "IfStatement",
+                    test: expression.left,
+                    consequent,
+                    alternate,
+                }, expression),
+            ];
+        }
+        case "ConditionalExpression": {
+            const consequentExprs = unused(expression.consequent);
+            const alternateExprs = unused(expression.alternate);
+            if (!consequentExprs.length && !alternateExprs.length) {
+                return unused(expression.test);
+            }
+            return [
+                withLoc({
+                    type: "IfStatement",
+                    test: expression.test,
+                    consequent: withLoc({
+                        type: "BlockStatement",
+                        body: consequentExprs,
+                    }, expression.consequent),
+                    alternate: withLoc({
+                        type: "BlockStatement",
+                        body: alternateExprs,
+                    }, expression.alternate),
+                }, expression),
+            ];
+        }
         case "UnaryExpression":
             return unused(expression.argument);
         case "MemberExpression":
@@ -11301,17 +11592,7 @@ function unused(expression, top) {
                 .map((p) => unused(p.key).concat(unused(p.value)))
                 .flat(1);
     }
-    return top
-        ? null
-        : [
-            {
-                type: "ExpressionStatement",
-                expression,
-                start: expression.start,
-                end: expression.end,
-                loc: expression.loc,
-            },
-        ];
+    return top ? null : [estmt(expression)];
 }
 function diagnostic(state, loc, message, type = "INFO") {
     if (!loc || !loc.source)
@@ -11344,6 +11625,10 @@ function inlineWithArgs(state, func, call, context) {
     if (!func.node || !func.node.body) {
         return null;
     }
+    const lastStmt = (block) => {
+        const last = block.body.slice(-1)[0];
+        return last.type === "BlockStatement" ? lastStmt(last) : [last, block];
+    };
     let retStmtCount = 0;
     if (context.type === "ReturnStatement") {
         const last = func.node.body.body.slice(-1)[0];
@@ -11359,15 +11644,19 @@ function inlineWithArgs(state, func, call, context) {
         if (retStmtCount > 1) {
             inlineDiagnostic(state, func, call, "Function had more than one return statement");
         }
-        else if (context.type === "AssignmentExpression" && retStmtCount !== 1) {
+        else if ((context.type === "AssignmentExpression" ||
+            context.type === "VariableDeclarator") &&
+            retStmtCount !== 1) {
             inlineDiagnostic(state, func, call, "Function did not have a return statement");
             return null;
         }
         if (retStmtCount === 1) {
-            const last = func.node.body.body.slice(-1)[0];
+            const [last] = lastStmt(func.node.body);
             if (!last ||
                 last.type !== "ReturnStatement" ||
-                (context.type === "AssignmentExpression" && !last.argument)) {
+                ((context.type === "AssignmentExpression" ||
+                    context.type === "VariableDeclarator") &&
+                    !last.argument)) {
                 inlineDiagnostic(state, func, call, "There was a return statement, but not at the end of the function");
                 return null;
             }
@@ -11387,23 +11676,39 @@ function inlineWithArgs(state, func, call, context) {
     }
     diagnostic(state, call.loc, null);
     if (context.type !== "ReturnStatement" && retStmtCount) {
-        const last = body.body[body.body.length - 1];
+        const [last, block] = lastStmt(body);
         if (last.type != "ReturnStatement") {
             throw new Error("ReturnStatement got lost!");
         }
-        if (context.type === "AssignmentExpression") {
-            context.right = last.argument;
-            body.body[body.body.length - 1] = {
-                type: "ExpressionStatement",
-                expression: context,
-            };
-        }
-        else if (last.argument) {
-            const side_exprs = unused(last.argument);
-            body.body.splice(body.body.length - 1, 1, ...side_exprs);
+        if (last.argument) {
+            if (context.type === "AssignmentExpression") {
+                context.right = last.argument;
+                block.body[block.body.length - 1] = {
+                    type: "ExpressionStatement",
+                    expression: context,
+                };
+            }
+            else if (context.type === "VariableDeclarator") {
+                const { id, init: _init, kind: _kind, ...rest } = context;
+                block.body[block.body.length - 1] = {
+                    ...rest,
+                    type: "ExpressionStatement",
+                    expression: {
+                        ...rest,
+                        type: "AssignmentExpression",
+                        operator: "=",
+                        left: id.type === "Identifier" ? id : id.left,
+                        right: last.argument,
+                    },
+                };
+            }
+            else {
+                const side_exprs = unused(last.argument);
+                block.body.splice(block.body.length - 1, 1, ...side_exprs);
+            }
         }
         else {
-            --body.body.length;
+            --block.body.length;
         }
     }
     return body;
@@ -11522,87 +11827,1461 @@ function fixNodeScope(state, lookupNode, nodeStack) {
     return null;
 }
 
-;// CONCATENATED MODULE: ./src/visitor.ts
+;// CONCATENATED MODULE: ./src/control-flow.ts
 
-function visitReferences(state, ast, name, defn, callback) {
-    const checkResults = ([name, results], node) => {
-        if (name && results) {
-            if (!defn || (0,external_api_cjs_namespaceObject.sameLookupResult)(results, defn)) {
-                if (callback(node, results, false) === false) {
-                    return [];
+
+const Terminals = {
+    BreakStatement: "break",
+    ContinueStatement: "continue",
+    ReturnStatement: null,
+    ThrowStatement: "throw",
+};
+class LocalState {
+    constructor(func) {
+        this.stack = [];
+        this.info = new Map();
+        this.curBlock = {};
+        this.unreachable = false;
+        this.push(func);
+    }
+    push(node) {
+        const top = { node };
+        this.stack.push(top);
+        return top;
+    }
+    pop() {
+        return this.stack.pop();
+    }
+    top(depth) {
+        return this.stack[this.stack.length - (depth || 1)];
+    }
+    addEdge(from, to) {
+        if (!from.succs) {
+            from.succs = [to];
+        }
+        else {
+            (0,external_util_cjs_namespaceObject.pushUnique)(from.succs, to);
+        }
+        if (!to.preds) {
+            to.preds = [from];
+        }
+        else {
+            (0,external_util_cjs_namespaceObject.pushUnique)(to.preds, from);
+        }
+    }
+    newBlock(block) {
+        if (!block)
+            block = {};
+        if (!this.unreachable) {
+            this.addEdge(this.curBlock, block);
+        }
+        this.unreachable = false;
+        for (let i = this.stack.length; i--;) {
+            const si = this.stack[i];
+            if (si.throw) {
+                block.exsucc = si.throw;
+                if (!si.throw.expreds) {
+                    si.throw.expreds = [block];
                 }
+                else {
+                    si.throw.expreds.push(block);
+                }
+                break;
             }
         }
-        else if (defn === false) {
-            if (callback(node, [], results === null) === false) {
-                return [];
+        return (this.curBlock = block);
+    }
+    terminal(type) {
+        const re = Terminals[type];
+        if (re) {
+            for (let i = this.stack.length; i--;) {
+                const target = this.stack[i][re];
+                if (target) {
+                    this.addEdge(this.curBlock, target);
+                    break;
+                }
             }
         }
-        return null;
-    };
-    state.pre = (node) => {
-        switch (node.type) {
-            case "AttributeList":
+        this.unreachable = true;
+    }
+}
+function buildReducedGraph(state, func, notice) {
+    const { stack, pre, post } = state;
+    try {
+        const localState = new LocalState(func.node);
+        const ret = localState.curBlock;
+        state.stack = func.stack;
+        const stmtStack = [func.node];
+        let tryActive = 0;
+        state.pre = (node) => {
+            if (state.inType || localState.unreachable) {
                 return [];
-            case "UnaryExpression":
-                // a bare symbol isn't a reference
-                if (node.operator === ":")
+            }
+            if (!localState.curBlock.node &&
+                (isStatement(node) || isExpression(node))) {
+                localState.curBlock.node = node;
+            }
+            if (isStatement(node)) {
+                stmtStack.push(node);
+            }
+            switch (node.type) {
+                case "AttributeList":
                     return [];
-                break;
-            case "BinaryExpression":
-                /*
-                 * `expr has :symbol` can be treated as a reference
-                 * to expr.symbol.
-                 */
-                if (node.operator === "has") {
-                    if (node.right.type === "UnaryExpression" &&
-                        node.right.operator === ":") {
-                        if (!name || node.right.argument.name === name) {
-                            return checkResults(state.lookup({
-                                type: "MemberExpression",
-                                object: node.left,
-                                property: node.right.argument,
-                                computed: false,
-                            }), node.right.argument);
+                case "SwitchStatement": {
+                    const top = localState.push(node);
+                    top.break = {};
+                    state.traverse(node.discriminant);
+                    const testBlocks = [];
+                    let defaultSeen = false;
+                    node.cases.forEach((sc, i) => {
+                        if (sc.test) {
+                            state.traverse(sc.test);
+                            testBlocks[i] = localState.curBlock;
+                            localState.newBlock();
+                        }
+                        else {
+                            defaultSeen = true;
                         }
+                    });
+                    const endOfTests = localState.curBlock;
+                    if (!defaultSeen) {
+                        localState.addEdge(endOfTests, top.break);
                     }
+                    localState.unreachable = true;
+                    node.cases.forEach((sc, i) => {
+                        localState.newBlock();
+                        localState.addEdge(testBlocks[i] || endOfTests, localState.curBlock);
+                        sc.consequent.every((s) => {
+                            state.traverse(s);
+                            return !localState.unreachable;
+                        });
+                    });
+                    localState.newBlock(top.break);
+                    localState.unreachable = !top.break.preds;
+                    return [];
                 }
-                break;
-            case "CallExpression":
-                // A call expression whose callee is an identifier is looked
-                // up as a non-local. ie even if there's a same named local,
-                // it will be ignored, and the lookup will start as if the
-                // call had been written self.foo() rather than foo().
-                if (node.callee.type === "Identifier") {
-                    if (!name || node.callee.name === name) {
-                        /* ignore return value */
-                        checkResults(state.lookupNonlocal(node.callee), node.callee);
+                case "DoWhileStatement":
+                case "WhileStatement": {
+                    localState.push(node);
+                    const top = localState.top();
+                    top.break = {};
+                    top.continue = {};
+                    let head;
+                    if (node.type === "WhileStatement") {
+                        head = localState.newBlock(top.continue);
+                        state.traverse(node.test);
+                        localState.addEdge(localState.curBlock, top.break);
+                        localState.newBlock();
                     }
-                    return ["arguments"];
+                    else {
+                        head = localState.newBlock();
+                    }
+                    state.traverse(node.body);
+                    if (node.type === "DoWhileStatement") {
+                        localState.newBlock(top.continue);
+                        state.traverse(node.test);
+                        localState.addEdge(localState.curBlock, top.break);
+                    }
+                    localState.addEdge(localState.curBlock, head);
+                    localState.curBlock = top.break;
+                    return [];
                 }
-                break;
-            case "Identifier":
-                if (!name || node.name === name) {
-                    return checkResults(state.lookup(node), node);
+                case "TryStatement": {
+                    const top = localState.push(node);
+                    const catches = (top.throw = {});
+                    // This edge shouldn't exist, but we can trigger
+                    // (incorrect) "variable may not be initialized" errors
+                    // in the monkey c compiler without it.
+                    // https://forums.garmin.com/developer/connect-iq/i/bug-reports/incorrect-maybe-uninitialized-error
+                    localState.addEdge(localState.curBlock, top.throw);
+                    localState.newBlock();
+                    tryActive++;
+                    state.traverse(node.block);
+                    tryActive--;
+                    delete top.throw;
+                    top.posttry = {};
+                    const tryFallsThrough = !localState.unreachable;
+                    if (node.finalizer) {
+                        tryActive++;
+                        top.throw = top.finally = {};
+                        // curBlock branches to finally, no matter how it exits.
+                        localState.addEdge(localState.curBlock, top.finally);
+                    }
+                    else {
+                        if (!localState.unreachable) {
+                            localState.addEdge(localState.curBlock, top.posttry);
+                        }
+                    }
+                    localState.unreachable = true;
+                    localState.newBlock(catches);
+                    if (node.handler) {
+                        state.traverse(node.handler);
+                        if (top.throw) {
+                            tryActive--;
+                            delete top.throw;
+                        }
+                        // Each "catch (ex instanceof Foo)" chains to the next,
+                        // but "catch (ex)" terminates the list. If the end
+                        // of the chain has a predecessor, its possible that
+                        // none of the conditions matched, so the exception
+                        // will propagate from there.
+                        if (localState.curBlock.preds) {
+                            localState.terminal("ThrowStatement");
+                        }
+                    }
+                    if (top.throw) {
+                        tryActive--;
+                        delete top.throw;
+                    }
+                    if (node.finalizer) {
+                        localState.unreachable = true;
+                        localState.newBlock(top.finally);
+                        delete top.finally;
+                        state.traverse(node.finalizer);
+                        if (tryFallsThrough && !localState.unreachable) {
+                            localState.addEdge(localState.curBlock, top.posttry);
+                        }
+                        localState.terminal("ThrowStatement");
+                    }
+                    localState.unreachable = true;
+                    localState.newBlock(top.posttry);
+                    return [];
                 }
-                break;
-            case "MemberExpression":
-                if (!node.computed && node.property.type === "Identifier") {
-                    if (!name || node.property.name === name) {
-                        return checkResults(state.lookup(node), node) || ["object"];
+                case "CatchClause": {
+                    const top = localState.top();
+                    if (!localState.curBlock.preds && !localState.curBlock.expreds) {
+                        return [];
                     }
-                    return ["object"];
+                    const next = {};
+                    if (node.param && node.param.type === "BinaryExpression") {
+                        state.traverse(node.param);
+                        localState.addEdge(localState.curBlock, next);
+                        localState.newBlock();
+                    }
+                    state.traverse(node.body);
+                    if (top.finally) {
+                        // this edge exists even if this point is unreachable
+                        localState.addEdge(localState.curBlock, top.finally);
+                    }
+                    if (!localState.unreachable) {
+                        if (!top.posttry)
+                            top.posttry = {};
+                        localState.addEdge(localState.curBlock, top.posttry);
+                    }
+                    localState.unreachable = true;
+                    localState.newBlock(next);
+                    return [];
                 }
-                break;
-            case "MethodDefinition": {
-                if (!state.inType) {
-                    throw new Error("Method definition outside of type!");
+                case "ForStatement": {
+                    const top = localState.push(node);
+                    if (node.init)
+                        state.traverse(node.init);
+                    const head = localState.newBlock();
+                    top.break = {};
+                    top.continue = {};
+                    if (node.test) {
+                        state.traverse(node.test);
+                        localState.addEdge(localState.curBlock, top.break);
+                        localState.newBlock();
+                    }
+                    state.traverse(node.body);
+                    localState.newBlock(top.continue);
+                    if (node.update) {
+                        state.traverse(node.update);
+                    }
+                    if (!localState.unreachable) {
+                        localState.addEdge(localState.curBlock, head);
+                    }
+                    // there is no fall through from the end of the loop
+                    // to the next block. The only way there is via break
+                    // or the test failing.
+                    localState.unreachable = true;
+                    localState.newBlock(top.break);
+                    if (!top.break.preds) {
+                        localState.unreachable = true;
+                    }
+                    return [];
                 }
-                if (node.params) {
-                    node.params.forEach((param) => {
-                        if (param.type == "BinaryExpression") {
-                            state.traverse(param.right);
-                            state.inType = true;
+                case "IfStatement":
+                case "ConditionalExpression": {
+                    state.traverse(node.test);
+                    const alternate = {};
+                    localState.addEdge(localState.curBlock, alternate);
+                    localState.newBlock();
+                    state.traverse(node.consequent);
+                    const consequent = localState.unreachable
+                        ? null
+                        : localState.curBlock;
+                    localState.unreachable = true;
+                    localState.newBlock(alternate);
+                    if (node.alternate) {
+                        state.traverse(node.alternate);
+                        if (!localState.unreachable) {
+                            localState.newBlock();
+                        }
+                    }
+                    if (consequent) {
+                        if (localState.unreachable) {
+                            localState.newBlock();
+                        }
+                        localState.addEdge(consequent, localState.curBlock);
+                    }
+                    return [];
+                }
+                case "LogicalExpression": {
+                    state.traverse(node.left);
+                    if (localState.unreachable)
+                        break;
+                    const mid = localState.curBlock;
+                    localState.newBlock();
+                    state.traverse(node.right);
+                    localState.newBlock();
+                    localState.addEdge(mid, localState.curBlock);
+                    return [];
+                }
+                case "VariableDeclarator":
+                    return ["init"];
+                case "MemberExpression":
+                    if (!node.computed) {
+                        return ["object"];
+                    }
+                    break;
+                case "UnaryExpression":
+                    if (node.operator === ":") {
+                        return [];
+                    }
+                    break;
+                case "UpdateExpression":
+                    // We don't want to traverse the argument, since then it would
+                    // look like a ref, rather than a def. But if its a
+                    // MemberExpression, we *do* want to traverse the subexpressions
+                    // as potential refs.
+                    if (node.argument.type === "MemberExpression") {
+                        state.traverse(node.argument.object);
+                        if (node.argument.computed) {
+                            state.traverse(node.argument.property);
+                        }
+                    }
+                    return [];
+                case "AssignmentExpression":
+                    if (node.left.type === "MemberExpression") {
+                        state.traverse(node.left.object);
+                        if (node.left.computed) {
+                            state.traverse(node.left.property);
+                        }
+                    }
+                    return ["right"];
+                case "ThrowStatement":
+                case "ReturnStatement":
+                    if (node.argument) {
+                        state.traverse(node.argument);
+                    }
+                // fall through
+                case "BreakStatement":
+                case "ContinueStatement":
+                    localState.terminal(node.type);
+                    return [];
+            }
+            return null;
+        };
+        const addEvent = (block, event) => {
+            if (!block.events) {
+                block.events = [event];
+            }
+            else {
+                block.events.push(event);
+            }
+        };
+        state.post = (node) => {
+            const curStmt = stmtStack[stmtStack.length - 1];
+            if (!state.inType) {
+                const throws = tryActive > 0 && mayThrow(node);
+                const event = notice(node, curStmt, throws);
+                if (throws) {
+                    if (!event) {
+                        throw new Error("mayThrow expression in try/catch must generate an event");
+                    }
+                }
+                else if (event) {
+                    event.mayThrow = false;
+                }
+                if (event) {
+                    if (event.mayThrow) {
+                        for (let i = localState.stack.length; i--;) {
+                            const target = localState.stack[i].throw;
+                            if (target) {
+                                if (localState.curBlock.exsucc) {
+                                    if (localState.curBlock.exsucc !== target) {
+                                        throw new Error(`Block has multiple throw targets`);
+                                    }
+                                }
+                                else {
+                                    localState.curBlock.exsucc = target;
+                                    if (!target.expreds) {
+                                        target.expreds = [localState.curBlock];
+                                    }
+                                    else {
+                                        target.expreds.push(localState.curBlock);
+                                    }
+                                }
+                                break;
+                            }
+                        }
+                    }
+                    addEvent(localState.curBlock, event);
+                }
+            }
+            if (curStmt === node) {
+                stmtStack.pop();
+            }
+            if (localState.top().node === node) {
+                localState.pop();
+            }
+            return null;
+        };
+        state.traverse(func.node);
+        return cleanCfg(ret);
+    }
+    finally {
+        state.pre = pre;
+        state.post = post;
+        state.stack = stack;
+    }
+}
+function cleanCfg(head) {
+    preOrderTraverse(head, (cur) => {
+        if (cur.succs && cur.succs.length === 1) {
+            const succ = cur.succs[0];
+            if (succ !== head &&
+                succ.preds.length === 1 &&
+                (!cur.exsucc || cur.exsucc === succ.exsucc) &&
+                (!succ.succs ||
+                    succ.succs.length === 1 ||
+                    (cur.preds && cur.preds.length === 1))) {
+                if (cur.events) {
+                    if (succ.events) {
+                        cur.events.push(...succ.events);
+                    }
+                }
+                else if (succ.events) {
+                    cur.events = succ.events;
+                }
+                if (succ.exsucc) {
+                    const preds = succ.exsucc.expreds;
+                    for (let i = preds.length; i--;) {
+                        if (preds[i] === succ) {
+                            // If cur has an exsucc, we already
+                            // checked that its the same as succ's,
+                            // so we can just delete the edge.
+                            // Otherwise, we need to point it at cur.
+                            if (cur.exsucc) {
+                                preds.splice(i, 1);
+                            }
+                            else {
+                                preds[i] = cur;
+                            }
+                        }
+                    }
+                }
+                cur.exsucc = succ.exsucc;
+                cur.succs = succ.succs;
+                if (cur.succs) {
+                    cur.succs.forEach((s) => s.preds.forEach((p, i, arr) => {
+                        if (p === succ) {
+                            arr[i] = cur;
+                        }
+                    }));
+                }
+                if (!cur.node)
+                    cur.node = succ.node;
+            }
+        }
+    });
+    return head;
+}
+function postOrderTraverse(head, visitor) {
+    const visited = new Set();
+    const helper = (cur) => {
+        if (visited.has(cur))
+            return;
+        visited.add(cur);
+        if (cur.succs) {
+            cur.succs.forEach((block) => helper(block));
+        }
+        if (cur.exsucc)
+            helper(cur.exsucc);
+        visitor(cur);
+    };
+    helper(head);
+}
+function preOrderTraverse(head, visitor) {
+    const visited = new Set();
+    const helper = (cur) => {
+        if (visited.has(cur))
+            return;
+        visited.add(cur);
+        visitor(cur);
+        if (cur.succs) {
+            cur.succs.forEach((block) => helper(block));
+        }
+        if (cur.exsucc)
+            helper(cur.exsucc);
+    };
+    helper(head);
+}
+function getPostOrder(head) {
+    const blocks = [];
+    postOrderTraverse(head, (block) => blocks.push(block));
+    return blocks;
+}
+function getPreOrder(head) {
+    const blocks = [];
+    postOrderTraverse(head, (block) => blocks.push(block));
+    return blocks;
+}
+
+// EXTERNAL MODULE: ./node_modules/priorityqueuejs/index.js
+var priorityqueuejs = __webpack_require__(2789);
+;// CONCATENATED MODULE: ./src/pre.ts
+
+
+
+
+/**
+ * This implements a pseudo Partial Redundancy Elimination
+ * pass. It isn't quite like traditional PRE because we're
+ * aiming to minimize size, not dynamic instructions. So
+ * for us, its worthwhile to take something like:
+ *
+ * switch (x) {
+ *   case 1: foo(A.B); break;
+ *   case 2: foo(C); break;
+ *   case 3: bar(A.B); break;
+ * }
+ *
+ * and rewrite it as
+ *
+ * var tmp = A.B;
+ * switch (x) {
+ *   case 1: foo(tmp); break;
+ *   case 2: foo(C); break;
+ *   case 3: bar(tmp); break;
+ * }
+ *
+ * because even though A.B wasn't used on all paths where we
+ * inserted the temporary, we still reduced the code size.
+ */
+const logging = false;
+function declFullName(decl) {
+    switch (decl.type) {
+        case "Literal":
+            return decl.raw || decl.value?.toString() || "null";
+        case "VariableDeclarator":
+            return decl.fullName;
+        default:
+            throw new Error(`Unexpected EventDecl type: ${decl.type}`);
+    }
+}
+function declName(decl) {
+    switch (decl.type) {
+        case "Literal":
+            return (decl.raw || decl.value?.toString() || "null").replace(/[^\w]/g, "_");
+        case "VariableDeclarator":
+            return decl.name;
+        default:
+            throw new Error(`Unexpected EventDecl type: ${decl.type}`);
+    }
+}
+function logAntState(s, decl) {
+    const defs = Array.from(s.ant).reduce((defs, event) => {
+        if (event.type === "def" || event.type === "mod")
+            defs++;
+        return defs;
+    }, 0);
+    console.log(`  - ${declFullName(decl)}: ${candidateCost(s)} bytes, ${s.ant.size - defs} refs, ${defs} defs, ${s.live ? "" : "!"}live, ${s.isIsolated ? "" : "!"}isolated`);
+    console.log(`    - members: ${Array.from(s.members)
+        .map(([block, live]) => block.order + (live ? "t" : "f"))
+        .join(", ")}`);
+}
+function logAntDecls(antDecls) {
+    antDecls.forEach(logAntState);
+}
+function sizeBasedPRE(state, func) {
+    if (!func.node.body)
+        return;
+    if (!state.config ||
+        !state.config.sizeBasedPRE ||
+        (typeof state.config.sizeBasedPRE === "string" &&
+            state.config.sizeBasedPRE !== func.fullName)) {
+        return;
+    }
+    const { graph: head, identifiers } = buildPREGraph(state, func);
+    const candidates = computeAttributes(head);
+    if (candidates) {
+        if (logging) {
+            console.log(`Found ${candidates.size} candidates in ${func.fullName}`);
+            logAntDecls(candidates);
+        }
+        const nodeMap = new Map();
+        const declMap = new Map();
+        const variableDecl = withLoc({
+            type: "VariableDeclaration",
+            declarations: [],
+            kind: "var",
+        }, func.node.body);
+        variableDecl.end = variableDecl.start;
+        variableDecl.loc.end = variableDecl.loc.start;
+        candidates.forEach((s, decl) => {
+            let name;
+            let i = 0;
+            do {
+                name = `pre_${declName(decl)}${i ? "_" + i : ""}`;
+                if (!identifiers.has(name))
+                    break;
+                i++;
+            } while (true);
+            declMap.set(decl, name);
+            variableDecl.declarations.push(withLoc({
+                type: "VariableDeclarator",
+                id: withLoc({ type: "Identifier", name }, variableDecl),
+                kind: "var",
+            }, variableDecl));
+            s.ant.forEach((event) => {
+                const events = nodeMap.get(event.node);
+                if (!events) {
+                    nodeMap.set(event.node, [event]);
+                }
+                else {
+                    events.push(event);
+                }
+            });
+        });
+        applyReplacements(func.node, nodeMap, declMap);
+        func.node.body.body.unshift(variableDecl);
+    }
+}
+function unhandledExpression(node) {
+    throw new Error(`Unhandled expression type: ${node.type}`);
+}
+function buildPREGraph(state, func) {
+    const findDecl = (node) => {
+        if (node.type === "Identifier" ||
+            (node.type === "MemberExpression" && !node.computed)) {
+            const [, results] = state.lookup(node);
+            if (results &&
+                results.length === 1 &&
+                results[0].parent?.type != "BlockStatement" &&
+                results[0].results.length === 1 &&
+                results[0].results[0].type === "VariableDeclarator") {
+                return results[0].results[0];
+            }
+        }
+        return null;
+    };
+    const literals = new Map();
+    const identifiers = new Set();
+    const liveDefs = new Map();
+    const liveStmts = new Map();
+    const liveDef = (def, stmt) => {
+        let curNodes = liveDefs.get(def);
+        if (!curNodes) {
+            liveDefs.set(def, (curNodes = new Set()));
+        }
+        curNodes.add(stmt);
+        let defs = liveStmts.get(stmt);
+        if (!defs) {
+            liveStmts.set(stmt, (defs = new Map()));
+        }
+        defs.set(def, (defs.get(def) || 0) + 1);
+    };
+    return {
+        identifiers,
+        graph: buildReducedGraph(state, func, (node, stmt, mayThrow) => {
+            const defs = liveStmts.get(node);
+            if (defs) {
+                liveStmts.delete(node);
+                defs.forEach((count, def) => {
+                    if (count > 1) {
+                        defs.set(def, count--);
+                        return;
+                    }
+                    const v = liveDefs.get(def);
+                    if (!v || !v.has(node)) {
+                        throw new Error(`No stmt in liveDef for ${def ? declFullName(def) : "null"}`);
+                    }
+                    v.delete(node);
+                    if (!v.size) {
+                        liveDefs.delete(def);
+                    }
+                });
+            }
+            switch (node.type) {
+                case "BinaryExpression":
+                case "UnaryExpression":
+                case "SizedArrayExpression":
+                case "ArrayExpression":
+                case "ObjectExpression":
+                case "ThisExpression":
+                case "LogicalExpression":
+                case "ConditionalExpression":
+                case "SequenceExpression":
+                case "ParenthesizedExpression":
+                    break;
+                case "Literal":
+                    if (!node.value && refCost(node) > LocalRefCost) {
+                        let decl = literals.get(node.value);
+                        if (!decl) {
+                            decl = node;
+                            literals.set(node.value, decl);
+                        }
+                        return {
+                            type: "ref",
+                            node,
+                            decl: decl,
+                            mayThrow,
+                        };
+                    }
+                    break;
+                case "Identifier":
+                    identifiers.add(node.name);
+                // fall through
+                case "MemberExpression":
+                    {
+                        const decl = findDecl(node);
+                        if (decl && decl.type === "VariableDeclarator") {
+                            const defStmts = (decl.node.kind === "var" && liveDefs.get(null)) ||
+                                liveDefs.get(decl);
+                            if (defStmts) {
+                                break;
+                                /*
+                                // hold off on this for now. we need to communicate
+                                // which defs need to be fixed, which involves yet-another
+                                // table.
+              
+                                if (defStmts.size !== 1) break;
+                                const fixable = isFixableStmt([...defStmts][0]);
+                                if (fixable === false) break;
+                                cost += fixable;
+                              */
+                            }
+                            return {
+                                type: "ref",
+                                node,
+                                decl,
+                                mayThrow,
+                            };
+                        }
+                    }
+                    break;
+                case "VariableDeclarator": {
+                    const decl = findDecl(node.id.type === "BinaryExpression" ? node.id.left : node.id);
+                    if (decl) {
+                        liveDef(decl, stmt);
+                        return {
+                            type: "def",
+                            node,
+                            decl,
+                            mayThrow,
+                        };
+                    }
+                    break;
+                }
+                case "AssignmentExpression": {
+                    const decl = findDecl(node.left);
+                    if (decl) {
+                        liveDef(decl, stmt);
+                        return {
+                            type: "def",
+                            node,
+                            decl,
+                            mayThrow,
+                        };
+                    }
+                    break;
+                }
+                case "UpdateExpression": {
+                    const decl = findDecl(node.argument);
+                    if (decl) {
+                        liveDef(decl, stmt);
+                        return {
+                            type: "def",
+                            node,
+                            decl,
+                            mayThrow,
+                        };
+                    }
+                    break;
+                }
+                case "NewExpression":
+                case "CallExpression":
+                    liveDef(null, stmt);
+                    return { type: "mod", node, mayThrow };
+                default:
+                    if (!isExpression(node))
+                        break;
+                    unhandledExpression(node);
+            }
+            if (mayThrow) {
+                return { type: "exn", node, mayThrow };
+            }
+            return null;
+        }),
+    };
+}
+function anticipatedDecls() {
+    return new Map();
+}
+function cloneSet(ae) {
+    return new Set(ae);
+}
+function mergeSet(a, b) {
+    b.forEach((event) => a.add(event));
+}
+function equalSet(a, b) {
+    if (a.size != b.size)
+        return false;
+    for (const item of a) {
+        if (!b.has(item))
+            return false;
+    }
+    return true;
+}
+function equalMap(a, b) {
+    if (a.size != b.size)
+        return false;
+    for (const [item, value] of a) {
+        if (b.get(item) !== value)
+            return false;
+    }
+    return true;
+}
+function anticipatedState(node, events) {
+    return { ant: events || new Set(), live: true, node, members: new Map() };
+}
+function cloneAnticipatedState(as) {
+    return {
+        ant: cloneSet(as.ant),
+        live: as.live,
+        node: as.node,
+        members: new Map(as.members),
+    };
+}
+function mergeAnticipatedState(ae, be) {
+    mergeSet(ae.ant, be.ant);
+    be.members.forEach((live, block) => ae.members.set(block, live));
+    if (be.live)
+        ae.live = true;
+}
+function cloneAnticipatedDecls(ad) {
+    const copy = anticipatedDecls();
+    for (const [k, v] of ad) {
+        if (!v.isIsolated) {
+            copy.set(k, cloneAnticipatedState(v));
+        }
+    }
+    return copy;
+}
+function mergeAnticipatedDecls(a, b) {
+    for (const [k, v] of b) {
+        if (v.isIsolated)
+            continue;
+        const ae = a.get(k);
+        if (ae) {
+            mergeAnticipatedState(ae, v);
+        }
+        else {
+            a.set(k, cloneAnticipatedState(v));
+        }
+    }
+}
+function equalStates(a, b) {
+    if (a.size !== b.size)
+        return false;
+    for (const [k, ae] of a) {
+        const be = b.get(k);
+        if (!be ||
+            be.live != ae.live ||
+            be.isIsolated != ae.isIsolated ||
+            !equalSet(ae.ant, be.ant) ||
+            !equalMap(ae.members, be.members)) {
+            return false;
+        }
+    }
+    return true;
+}
+const LocalRefCost = 2;
+function refCost(node) {
+    if (node.type === "Literal") {
+        switch (typeof node.value) {
+            case "string":
+                return 5;
+            case "number":
+                return 5;
+            case "boolean":
+                return 2;
+            default:
+                if (node.value === null) {
+                    return 2;
+                }
+                return 0;
+        }
+    }
+    // A read from a non-local identifier takes 8 bytes
+    let cost = 8;
+    if (node.type === "Identifier")
+        return cost;
+    while (true) {
+        const next = node.object;
+        if (next.type != "MemberExpression") {
+            if (next.type != "ThisExpression") {
+                cost += next.type === "Identifier" && next.name === "$" ? 4 : 6;
+            }
+            return cost;
+        }
+        node = next;
+        cost += 6;
+    }
+}
+function defCost(node) {
+    return refCost(node) + 2;
+}
+function candidateBoundary(candState) {
+    const boundary = new Set();
+    candState.members.forEach((live, block) => {
+        if (live && block !== candState.head) {
+            if (block.preds) {
+                block.preds.forEach((pred) => candState.members.has(pred) || boundary.add(pred));
+            }
+        }
+    });
+    if (candState.live) {
+        if (!candState.head) {
+            throw new Error(`Missing head`);
+        }
+        boundary.add(candState.head);
+    }
+    return boundary;
+}
+function candidateCost(candState) {
+    let cost = 0;
+    candState.ant.forEach((event) => {
+        if (event.type === "ref") {
+            cost -= refCost(candState.node) - LocalRefCost;
+        }
+        else {
+            cost += defCost(candState.node);
+        }
+    });
+    const boundarySize = candidateBoundary(candState).size;
+    cost += defCost(candState.node) * boundarySize;
+    return cost;
+}
+function computeAttributes(head) {
+    const order = getPostOrder(head);
+    order.forEach((block, i) => {
+        block.order = i;
+    });
+    if (logging) {
+        order.forEach((block) => {
+            console.log(block.order, `(${block.node ? block.node.loc?.start.line : "??"})`, `Preds: ${(block.preds || [])
+                .map((block) => block.order)
+                .join(", ")}`);
+            if (block.events) {
+                block.events.forEach((event) => event.type !== "exn" &&
+                    console.log(`    ${event.type}: ${event.decl ? declFullName(event.decl) : "??"}`));
+            }
+            console.log(`Succs: ${(block.succs || [])
+                .map((block) => block.order)
+                .join(", ")} ExSucc: ${block.exsucc ? block.exsucc.order : ""}`);
+        });
+    }
+    const enqueued = new Set();
+    const queue = new priorityqueuejs((b, a) => (a.order || 0) - (b.order || 0));
+    const enqueue = (block) => {
+        if (!enqueued.has(block)) {
+            enqueued.add(block);
+            queue.enq(block);
+        }
+    };
+    const dequeue = () => {
+        const block = queue.deq();
+        enqueued.delete(block);
+        return block;
+    };
+    const blockStates = [];
+    /*
+      Algorithm
+      =========
+  
+      Process blocks in post-order, and the events in reverse
+      order to collect the AnticipatedState at the start of each
+      Block.
+  
+      Then for each EventDecl find the best starting block.
+    */
+    const modMap = new Map();
+    const getMod = (event, decl, id) => {
+        if (id.type !== "Identifier" && id.type !== "MemberExpression") {
+            throw new Error("Trying to modify a non-variable");
+        }
+        let eventMap = modMap.get(event);
+        if (!eventMap) {
+            modMap.set(event, (eventMap = new Map()));
+        }
+        let result = eventMap.get(decl);
+        if (!result) {
+            result = {
+                type: "mod",
+                node: event.node,
+                decl,
+                id,
+                mayThrow: event.mayThrow,
+            };
+            eventMap.set(decl, result);
+        }
+        return result;
+    };
+    order.forEach((block) => enqueue(block));
+    while (queue.size()) {
+        const top = dequeue();
+        if (top.order === undefined) {
+            throw new Error(`Unreachable block was visited!`);
+        }
+        const curState = (top.succs &&
+            top.succs.reduce((blockState, succ) => {
+                const succState = blockStates[succ.order];
+                if (succState) {
+                    if (!blockState) {
+                        blockState = cloneAnticipatedDecls(succState);
+                    }
+                    else {
+                        mergeAnticipatedDecls(blockState, succState);
+                    }
+                }
+                return blockState;
+            }, null)) ||
+            anticipatedDecls();
+        if (top.events) {
+            for (let i = top.events.length; i--;) {
+                const event = top.events[i];
+                if (event.mayThrow && top.exsucc) {
+                    const succState = blockStates[top.exsucc.order];
+                    if (succState) {
+                        mergeAnticipatedDecls(curState, succState);
+                    }
+                }
+                switch (event.type) {
+                    case "ref": {
+                        let candidates = curState.get(event.decl);
+                        if (!candidates) {
+                            candidates = anticipatedState(event.node);
+                            curState.set(event.decl, candidates);
+                        }
+                        candidates.ant.add(event);
+                        candidates.live = true;
+                        break;
+                    }
+                    case "mod": {
+                        curState.forEach((candidates, decl) => {
+                            if (decl.type === "VariableDeclarator" &&
+                                decl.node.kind === "var" &&
+                                candidates.live) {
+                                candidates.ant.add(getMod(event, decl, candidates.node));
+                                candidates.live = false;
+                            }
+                        });
+                        break;
+                    }
+                    case "def": {
+                        let candidates = curState.get(event.decl);
+                        const isUpdate = event.node.type === "UpdateExpression" ||
+                            (event.node.type === "AssignmentExpression" &&
+                                event.node.operator !== "=");
+                        if (!candidates) {
+                            const target = event.node.type === "AssignmentExpression"
+                                ? event.node.left
+                                : event.node.type === "UpdateExpression"
+                                    ? event.node.argument
+                                    : event.node.id.type === "BinaryExpression"
+                                        ? event.node.id.left
+                                        : event.node.id;
+                            candidates = anticipatedState(target);
+                            curState.set(event.decl, candidates);
+                        }
+                        if (isUpdate || candidates.live) {
+                            candidates.ant.add(event);
+                        }
+                        candidates.live = isUpdate;
+                        break;
+                    }
+                }
+            }
+        }
+        curState.forEach((antState) => {
+            antState.head = top;
+            antState.members.set(top, antState.live);
+            if (!antState.live && candidateBoundary(antState).size === 0) {
+                // we found a group that's isolated from the rest
+                // of the function. Don't merge it with earlier
+                // refs and defs, because we can take it or leave
+                // it based on its own cost.
+                antState.isIsolated = true;
+            }
+        });
+        const oldState = blockStates[top.order];
+        if (oldState && equalStates(oldState, curState)) {
+            continue;
+        }
+        blockStates[top.order] = curState;
+        if (logging) {
+            console.log(`Updated block ${top.order}`);
+            logAntDecls(curState);
+        }
+        if (top.preds) {
+            top.preds.forEach((pred) => enqueue(pred));
+        }
+    }
+    const candidateDecls = anticipatedDecls();
+    blockStates.forEach((blockState, i) => {
+        blockState &&
+            blockState.forEach((events, decl) => {
+                const cost = candidateCost(events);
+                if (cost >= 0)
+                    return;
+                const existing = candidateDecls.get(decl);
+                if (!existing ||
+                    existing.isIsolated ||
+                    candidateCost(existing) > cost) {
+                    const boundary = candidateBoundary(events);
+                    if (!Array.from(boundary).every((block) => {
+                        if (block !== events.head && block.events) {
+                            if (events.node.type === "Literal") {
+                                return false;
+                            }
+                            let i = block.events.length;
+                            while (i--) {
+                                const event = block.events[i];
+                                if (event.type === "def" || event.type === "mod") {
+                                    events.ant.add({
+                                        type: "mod",
+                                        node: event.node,
+                                        decl,
+                                        id: events.node,
+                                        mayThrow: false,
+                                    });
+                                    events.members.set(block, false);
+                                    return true;
+                                }
+                            }
+                        }
+                        const node = block.node;
+                        if (!node)
+                            return false;
+                        events.ant.add({
+                            type: "mod",
+                            node: node.type === "FunctionDeclaration" ? node.body : node,
+                            before: true,
+                            decl,
+                            id: events.node,
+                            mayThrow: false,
+                        });
+                        events.members.set(block, false);
+                        return true;
+                    })) {
+                        return;
+                    }
+                    events.live = false;
+                    if (existing && existing.isIsolated) {
+                        delete existing.isIsolated;
+                        mergeAnticipatedState(events, existing);
+                    }
+                    else if (candidateCost(events) != cost) {
+                        throw new Error(`cost of block ${i} changed`);
+                    }
+                    candidateDecls.set(decl, events);
+                }
+            });
+    });
+    if (candidateDecls.size) {
+        return candidateDecls;
+    }
+    return null;
+}
+/*
+ * Determine the cost of fixing a def under a statement.
+ *
+ * eg:
+ *
+ *   if (foo()) {
+ *      bar(X.y);
+ *   } else {
+ *      baz(X.y);
+ *   }
+ *
+ * Here, we could pull out X.y as a local, but if foo might modify
+ * X.y, we have nowhere to insert the temporary. But we can rewrite
+ * it as:
+ *
+ *   var tmp = foo();
+ *   if (tmp) {
+ *      bar(X.y);
+ *   } else {
+ *      baz(X.y);
+ *   }
+ *
+ * and now we can insert a temporary before the if, but it costs
+ * 4 bytes to do so.
+ *
+ * We can do the same for switch statements unless (ugh!)
+ * the cases might modify the decl too.
+ *
+ * eg
+ *
+ *   switch (foo()) {
+ *     case bar(): ...
+ *   }
+ *
+ */
+function _isFixableStmt(node) {
+    switch (node.type) {
+        case "IfStatement":
+            return 4;
+        case "SwitchStatement":
+            if (node.cases.every((c) => !c.test ||
+                c.test.type === "Literal" ||
+                c.test.type === "Identifier" ||
+                c.test.type === "InstanceOfCase" ||
+                (c.test.type === "UnaryExpression" && c.test.operator === ":"))) {
+                return 4;
+            }
+            break;
+    }
+    return false;
+}
+function applyReplacements(func, nodeMap, declMap) {
+    const ident = (name, node) => {
+        return withLoc({ type: "Identifier", name }, node);
+    };
+    const pendingMap = new Map();
+    const stmtStack = [func];
+    traverseAst(func, (node) => {
+        if (isStatement(node)) {
+            stmtStack.push(node);
+        }
+    }, (node) => {
+        const stmt = stmtStack[stmtStack.length - 1];
+        if (stmt === node)
+            stmtStack.pop();
+        const events = nodeMap.get(node);
+        if (events) {
+            if (events.length === 1) {
+                if (events[0].type === "ref") {
+                    if (node.type !== "Identifier" &&
+                        node.type !== "MemberExpression" &&
+                        node.type !== "Literal") {
+                        throw new Error(`Ref found, but wrong type of node: ${node.type}`);
+                    }
+                    const name = declMap.get(events[0].decl);
+                    if (!name) {
+                        throw new Error(`No replacement found for "${(0,external_api_cjs_namespaceObject.formatAst)(node)}"`);
+                    }
+                    return ident(name, node);
+                }
+                else if (events[0].type === "def") {
+                    if (node.type !== "AssignmentExpression" &&
+                        node.type !== "UpdateExpression") {
+                        throw new Error(`Def found, but wrong type of node: ${node.type}`);
+                    }
+                    const target = node.type === "AssignmentExpression"
+                        ? node.left
+                        : node.argument;
+                    const name = declMap.get(events[0].decl);
+                    if (!name) {
+                        throw new Error(`No replacement found for "${(0,external_api_cjs_namespaceObject.formatAst)(target)}"`);
+                    }
+                    const id = ident(name, target);
+                    const assign = withLoc({
+                        type: "AssignmentExpression",
+                        left: target,
+                        right: { ...id },
+                        operator: "=",
+                    }, node);
+                    if (node.type === "AssignmentExpression") {
+                        node.left = id;
+                    }
+                    else {
+                        node.argument = id;
+                    }
+                    return withLoc({ type: "SequenceExpression", expressions: [node, assign] }, node);
+                }
+            }
+            events.forEach((event) => {
+                if (event.type !== "mod") {
+                    throw new Error(`Unexpected ${event.type} found amongst multiple events`);
+                }
+                if (!event.decl) {
+                    throw new Error(`Unexpected null decl on mod event`);
+                }
+                let pending = pendingMap.get(stmt);
+                if (!pending) {
+                    pendingMap.set(stmt, (pending = new Set()));
+                }
+                pending.add(event);
+            });
+        }
+        const pending = pendingMap.get(node);
+        if (node.type === "SequenceExpression") {
+            if (pending) {
+                throw new Error(`Unexpected pending list at SequenceExpression`);
+            }
+            for (let i = node.expressions.length; i--;) {
+                const ni = node.expressions[i];
+                if (ni.type === "SequenceExpression") {
+                    node.expressions.splice(i, 1, ...ni.expressions);
+                }
+            }
+        }
+        const applyPending = (results, locNode) => {
+            const target = results.length === 1 && results[0].type === "BlockStatement"
+                ? results[0]
+                : null;
+            pendingMap.delete(node);
+            pending.forEach((event) => {
+                const decl = event.decl;
+                const name = declMap.get(decl);
+                if (!name) {
+                    throw new Error(`No replacement found for "${declFullName(decl)}"`);
+                }
+                if (!event.id) {
+                    throw new Error(`Missing id for mod event for "${declFullName(decl)}"`);
+                }
+                const rhs = withLocDeep(event.id, locNode, locNode);
+                rhs.end = rhs.start;
+                if (rhs.loc) {
+                    rhs.loc.end = rhs.loc.start;
+                }
+                const insertion = withLoc({
+                    type: "ExpressionStatement",
+                    expression: withLoc({
+                        type: "AssignmentExpression",
+                        left: ident(name, rhs),
+                        right: rhs,
+                        operator: "=",
+                    }, rhs),
+                }, rhs);
+                if (event.type === "mod" && event.before) {
+                    if (target) {
+                        target.body.unshift(insertion);
+                    }
+                    else {
+                        results.unshift(insertion);
+                    }
+                }
+                else {
+                    results.push(insertion);
+                }
+            });
+            return results.length === 1 ? null : results;
+        };
+        if (node.type === "ExpressionStatement" &&
+            node.expression.type === "SequenceExpression") {
+            const results = [];
+            node.expression.expressions.forEach((expression) => {
+                results.push({ ...node, expression });
+            });
+            if (!pending) {
+                return results;
+            }
+            return applyPending(results, node);
+        }
+        if (pending) {
+            return applyPending([node], node);
+        }
+        return null;
+    });
+}
+
+;// CONCATENATED MODULE: ./src/visitor.ts
+
+function visitReferences(state, ast, name, defn, callback) {
+    const checkResults = ([name, results], node) => {
+        if (name && results) {
+            if (!defn || (0,external_api_cjs_namespaceObject.sameLookupResult)(results, defn)) {
+                if (callback(node, results, false) === false) {
+                    return [];
+                }
+            }
+        }
+        else if (defn === false) {
+            if (callback(node, [], results === null) === false) {
+                return [];
+            }
+        }
+        return null;
+    };
+    state.pre = (node) => {
+        switch (node.type) {
+            case "AttributeList":
+                return [];
+            case "UnaryExpression":
+                // a bare symbol isn't a reference
+                if (node.operator === ":")
+                    return [];
+                break;
+            case "BinaryExpression":
+                /*
+                 * `expr has :symbol` can be treated as a reference
+                 * to expr.symbol.
+                 */
+                if (node.operator === "has") {
+                    if (node.right.type === "UnaryExpression" &&
+                        node.right.operator === ":") {
+                        if (!name || node.right.argument.name === name) {
+                            return checkResults(state.lookup({
+                                type: "MemberExpression",
+                                object: node.left,
+                                property: node.right.argument,
+                                computed: false,
+                            }), node.right.argument);
+                        }
+                    }
+                }
+                break;
+            case "CallExpression":
+                // A call expression whose callee is an identifier is looked
+                // up as a non-local. ie even if there's a same named local,
+                // it will be ignored, and the lookup will start as if the
+                // call had been written self.foo() rather than foo().
+                if (node.callee.type === "Identifier") {
+                    if (!name || node.callee.name === name) {
+                        /* ignore return value */
+                        checkResults(state.lookupNonlocal(node.callee), node.callee);
+                    }
+                    return ["arguments"];
+                }
+                break;
+            case "Identifier":
+                if (!name || node.name === name) {
+                    return checkResults(state.lookup(node), node);
+                }
+                break;
+            case "MemberExpression":
+                if (!node.computed && node.property.type === "Identifier") {
+                    if (!name || node.property.name === name) {
+                        return checkResults(state.lookup(node), node) || ["object"];
+                    }
+                    return ["object"];
+                }
+                break;
+            case "MethodDefinition": {
+                if (!state.inType) {
+                    throw new Error("Method definition outside of type!");
+                }
+                if (node.params) {
+                    node.params.forEach((param) => {
+                        if (param.type == "BinaryExpression") {
+                            state.traverse(param.right);
+                            state.inType = true;
                         }
                     });
                 }
@@ -11624,6 +13303,7 @@ function visitReferences(state, ast, name, defn, callback) {
 
 
 
+
 function collectClassInfo(state) {
     const toybox = state.stack[0].decls["Toybox"][0];
     const lang = toybox.decls["Lang"][0];
@@ -11924,7 +13604,50 @@ function getNodeValue(node) {
     }
     return [node, type];
 }
-function optimizeNode(node) {
+function fullTypeName(state, tsp) {
+    if (typeof tsp.name === "string") {
+        return tsp.name;
+    }
+    const [, results] = state.lookupType(tsp.name);
+    if (results && results.length === 1 && results[0].results.length === 1) {
+        const result = results[0].results[0];
+        if ((0,external_api_cjs_namespaceObject.isStateNode)(result)) {
+            return result.fullName;
+        }
+    }
+    return null;
+}
+function isBooleanExpression(state, node) {
+    switch (node.type) {
+        case "Literal":
+            return typeof node.value === "boolean";
+        case "BinaryExpression":
+            switch (node.operator) {
+                case "==":
+                case "!=":
+                case "<=":
+                case ">=":
+                case "<":
+                case ">":
+                    return true;
+                case "as":
+                    return node.right.ts.length === 1 &&
+                        node.right.ts[0].type === "TypeSpecPart" &&
+                        node.right.ts[0].name &&
+                        fullTypeName(state, node.right.ts[0]) === "$.Toybox.Lang.Boolean"
+                        ? true
+                        : false;
+            }
+            return false;
+        case "LogicalExpression":
+            return (isBooleanExpression(state, node.left) &&
+                isBooleanExpression(state, node.right));
+        case "UnaryExpression":
+            return node.operator === "!" && isBooleanExpression(state, node.argument);
+    }
+    return false;
+}
+function optimizeNode(state, node) {
     switch (node.type) {
         case "UnaryExpression": {
             const [arg, type] = getNodeValue(node.argument);
@@ -11976,8 +13699,18 @@ function optimizeNode(node) {
                 "%": (left, right) => left % right,
                 "&": (left, right, type) => type === "Number" ? left & right : null,
                 "|": (left, right, type) => type === "Number" ? left | right : null,
+                "^": (left, right, type) => type === "Number" ? left ^ right : null,
                 "<<": (left, right, type) => type === "Number" ? left << right : null,
                 ">>": (left, right, type) => type === "Number" ? left >> right : null,
+                "==": (left, right) => left == right,
+                "!=": (left, right) => left != right,
+                "<=": (left, right) => left <= right,
+                ">=": (left, right) => left >= right,
+                "<": (left, right) => left < right,
+                ">": (left, right) => left > right,
+                as: null,
+                instanceof: null,
+                has: null,
             };
             const op = operators[node.operator];
             if (op) {
@@ -11985,11 +13718,17 @@ function optimizeNode(node) {
                 const [right, right_type] = getNodeValue(node.right);
                 if (!left || !right)
                     break;
+                let value = null;
                 if (left_type != right_type ||
                     (left_type != "Number" && left_type != "Long")) {
-                    break;
+                    if (node.operator !== "==" && node.operator !== "!=") {
+                        break;
+                    }
+                    value = operators[node.operator](left.value, right.value);
+                }
+                else {
+                    value = op(left.value, right.value, left_type);
                 }
-                const value = op(left.value, right.value, left_type);
                 if (value === null)
                     break;
                 return {
@@ -12000,15 +13739,47 @@ function optimizeNode(node) {
             }
             break;
         }
+        case "LogicalExpression": {
+            const [left, left_type] = getNodeValue(node.left);
+            if (!left)
+                break;
+            const falsy = left.value === false ||
+                left.value === null ||
+                (left.value === 0 && (left_type === "Number" || left_type === "Long"));
+            if (falsy === (node.operator === "&&")) {
+                return left;
+            }
+            if (left_type !== "Boolean" &&
+                left_type !== "Number" &&
+                left_type !== "Long") {
+                break;
+            }
+            const [right, right_type] = getNodeValue(node.right);
+            if (right && right_type === left_type) {
+                if (left_type === "Boolean" || node.operator === "||") {
+                    return right;
+                }
+                if (node.operator !== "&&") {
+                    throw new Error(`Unexpected operator "${node.operator}"`);
+                }
+                return { ...node, type: "BinaryExpression", operator: "&" };
+            }
+            if (left_type === "Boolean") {
+                if (isBooleanExpression(state, node.right)) {
+                    return node.right;
+                }
+            }
+            break;
+        }
         case "FunctionDeclaration":
-            if (node.body && evaluateFunction(node, null) !== false) {
+            if (node.body && evaluateFunction(state, node, null) !== false) {
                 node.optimizable = true;
             }
             break;
     }
     return null;
 }
-function evaluateFunction(func, args) {
+function evaluateFunction(state, func, args) {
     if (!func.body || (args && args.length != func.params.length)) {
         return false;
     }
@@ -12047,7 +13818,7 @@ function evaluateFunction(func, args) {
                         }
                     // fall through;
                     default: {
-                        const repl = optimizeNode(node);
+                        const repl = optimizeNode(state, node);
                         if (repl && repl.type === "Literal")
                             return repl;
                         throw new Error("Didn't optimize");
@@ -12107,10 +13878,19 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
         if (!objects) {
             return false;
         }
-        const obj = getLiteralFromDecls(objects);
+        let obj = getLiteralFromDecls(objects);
         if (!obj) {
             return false;
         }
+        while (obj.type === "BinaryExpression") {
+            if (obj.left.type === "BinaryExpression" && obj.left.operator === "as") {
+                obj = { ...obj, left: obj.left.left };
+            }
+            else {
+                obj = { ...obj, left: { ...obj.left } };
+                break;
+            }
+        }
         inPlaceReplacement(node, obj);
         return true;
     };
@@ -12328,14 +14108,20 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
         return null;
     };
     state.post = (node) => {
-        if (topLocals().node === node) {
+        const locals = topLocals();
+        if (locals.node === node) {
             state.localsStack.pop();
         }
-        const opt = optimizeNode(node);
+        const opt = optimizeNode(state, node);
         if (opt) {
             return replace(opt, node);
         }
         switch (node.type) {
+            case "BlockStatement":
+                if (node.body.length === 1 && node.body[0].type === "BlockStatement") {
+                    node.body.splice(0, 1, ...node.body[0].body);
+                }
+                break;
             case "ConditionalExpression":
             case "IfStatement":
                 if (node.test.type === "Literal" &&
@@ -12345,6 +14131,12 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                         return false;
                     return replace(rep, rep);
                 }
+                else if (node.type === "IfStatement" &&
+                    node.alternate &&
+                    node.alternate.type === "BlockStatement" &&
+                    !node.alternate.body.length) {
+                    delete node.alternate;
+                }
                 break;
             case "WhileStatement":
                 if (node.test.type === "Literal" && node.test.value === false) {
@@ -12372,6 +14164,48 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                     return { type: "Literal", value: null, raw: "null" };
                 }
                 break;
+            case "VariableDeclaration": {
+                const locals = topLocals();
+                if (locals.map &&
+                    locals.node &&
+                    locals.node.type === "BlockStatement") {
+                    let results;
+                    const declarations = node.declarations;
+                    let i = 0;
+                    let j = 0;
+                    while (i < node.declarations.length) {
+                        const decl = declarations[i++];
+                        if (decl.init && decl.init.type === "CallExpression") {
+                            const inlined = replace(optimizeCall(state, decl.init, decl), decl.init);
+                            if (!inlined)
+                                continue;
+                            if (Array.isArray(inlined) || inlined.type != "BlockStatement") {
+                                throw new Error("Unexpected inlined result");
+                            }
+                            if (!results) {
+                                results = [];
+                            }
+                            delete decl.init;
+                            results.push(withLoc({
+                                ...node,
+                                declarations: declarations.slice(j, i),
+                            }, j ? declarations[j] : null, decl.id));
+                            results.push(inlined);
+                            j = i;
+                        }
+                    }
+                    if (results) {
+                        if (j < i) {
+                            results.push({
+                                ...node,
+                                declarations: declarations.slice(j, i),
+                            });
+                        }
+                        return results;
+                    }
+                }
+                break;
+            }
             case "ExpressionStatement":
                 if (node.expression.type === "CallExpression") {
                     return replace(optimizeCall(state, node.expression, node), node.expression);
@@ -12416,6 +14250,7 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
     });
     delete state.pre;
     delete state.post;
+    state.allFunctions.forEach((fn) => sizeBasedPRE(state, fn));
     const cleanup = (node) => {
         switch (node.type) {
             case "ThisExpression":
@@ -12541,7 +14376,7 @@ function optimizeCall(state, node, context) {
             callee.optimizable &&
             !callee.hasOverride &&
             node.arguments.every((n) => getNodeValue(n)[0] !== null)) {
-            const ret = evaluateFunction(callee, node.arguments);
+            const ret = evaluateFunction(state, callee, node.arguments);
             if (ret) {
                 return ret;
             }
@@ -12602,7 +14437,7 @@ function pragmaChecker(ast, diagnostics) {
         if (quote == '"') {
             return haystack.includes(needle);
         }
-        const re = new RegExp(needle);
+        const re = new RegExp(needle.replace(/@(\d+)/g, "(pre_)?$1(_\\d+)?"));
         return re.test(haystack);
     };
     next();
@@ -12612,8 +14447,10 @@ function pragmaChecker(ast, diagnostics) {
         if (node.start && node.start >= (comment.end || Infinity)) {
             const { kind, quote, needle } = matchers.shift();
             if (kind === "match") {
-                if (!matcher(quote, needle, (0,external_api_cjs_namespaceObject.formatAst)(node).replace(/([\r\n]|\s)+/g, " "))) {
-                    throw new Error(`Didn't find '${needle}' at ${comment.loc.source}:${comment.loc.start.line}`);
+                const haystack = (0,external_api_cjs_namespaceObject.formatAst)(node).replace(/([\r\n]|\s)+/g, " ");
+                if (!matcher(quote, needle, haystack)) {
+                    matcher(quote, needle, haystack);
+                    throw new Error(`Didn't find '${needle}' in '${haystack}' at ${comment.loc.source}:${comment.loc.start.line}`);
                 }
             }
             else if (kind === "expect") {
@@ -13054,6 +14891,7 @@ const configOptionsToCheck = [
     "ignoredAnnotations",
     "ignoredSourcePaths",
     "checkInvalidSymbols",
+    "sizeBasedPRE",
 ];
 /**
  * @param {BuildConfig} config
@@ -13105,7 +14943,7 @@ async function generateOneConfig(buildConfig, dependencyFiles, config) {
         // the oldest optimized file, we don't need to regenerate
         const source_time = await (0,external_util_cjs_namespaceObject.last_modified)(Object.keys(fnMap).concat(dependencyFiles));
         const opt_time = await (0,external_util_cjs_namespaceObject.first_modified)(Object.values(fnMap).map((v) => v.output));
-        if (source_time < opt_time && 1655851904193 < opt_time) {
+        if (source_time < opt_time && 1656860602542 < opt_time) {
             return { hasTests, diagnostics: prevDiagnostics };
         }
     }