@markw65/monkeyc-optimizer 1.0.30 → 1.0.33

package/build/api.cjs

@@ -1,4 +1,4 @@
-0 && (module.exports = {collectNamespaces,findUsingForNode,formatAst,getApiMapping,hasProperty,isStateNode,sameLookupResult,traverseAst,variableDeclarationName,visitReferences});
+0 && (module.exports = {collectNamespaces,findUsingForNode,formatAst,getApiFunctionInfo,getApiMapping,hasProperty,isLookupCandidate,isStateNode,markInvokeClassMethod,sameLookupResult,traverseAst,variableDeclarationName,visitReferences});
 /******/ (() => { // webpackBootstrap
 /******/ 	var __webpack_modules__ = ({
 
@@ -261,9 +261,12 @@ __webpack_require__.d(__webpack_exports__, {
   "collectNamespaces": () => (/* binding */ api_collectNamespaces),
   "findUsingForNode": () => (/* binding */ findUsingForNode),
   "formatAst": () => (/* binding */ api_formatAst),
+  "getApiFunctionInfo": () => (/* binding */ api_getApiFunctionInfo),
   "getApiMapping": () => (/* binding */ api_getApiMapping),
   "hasProperty": () => (/* reexport */ ast_hasProperty),
+  "isLookupCandidate": () => (/* binding */ api_isLookupCandidate),
   "isStateNode": () => (/* binding */ api_isStateNode),
+  "markInvokeClassMethod": () => (/* binding */ api_markInvokeClassMethod),
   "sameLookupResult": () => (/* binding */ api_sameLookupResult),
   "traverseAst": () => (/* reexport */ ast_traverseAst),
   "variableDeclarationName": () => (/* binding */ api_variableDeclarationName),
@@ -278,6 +281,7 @@ const promises_namespaceObject = require("fs/promises");
 ;// CONCATENATED MODULE: external "prettier"
 const external_prettier_namespaceObject = require("prettier");
 ;// CONCATENATED MODULE: ./src/ast.ts
+
 /*
  * This ensures that mctreeTypeInfo has every key of MCTreeTypeInfo,
  * and that the corresponding arrays contain every element of the
@@ -464,21 +468,188 @@ function ast_withLoc(node, start, end) {
     }
     return node;
 }
-function ast_withLocDeep(node, start, end) {
-    node = ast_withLoc({ ...node }, start, end);
+function ast_withLocDeep(node, start, end, inplace) {
+    node = ast_withLoc(inplace ? node : { ...node }, start, end);
     for (const key of mctreeTypeInfo[node.type].keys) {
         const value = node[key];
         if (!value)
             continue;
-        const fix = (v) => isMCTreeNode(v) ? ast_withLocDeep(v, start, end) : v;
+        const fix = (v) => isMCTreeNode(v) ? ast_withLocDeep(v, start, end, inplace) : v;
         const repl = Array.isArray(value) ? value.map(fix) : fix(value);
-        node[key] = repl;
+        inplace || (node[key] = repl);
     }
     return node;
 }
+function ast_cloneDeep(node) {
+    return ast_withLocDeep(node, null);
+}
+function ast_getNodeValue(node) {
+    if (node.type == "BinaryExpression" &&
+        node.operator == "as" &&
+        node.right.type == "TypeSpecList" &&
+        node.right.ts.length == 1 &&
+        typeof node.right.ts[0] == "string") {
+        // this is a cast we inserted to retain the type of an enum
+        // any arithmetic on it will revert to "Number", or "Long",
+        // so just ignore it.
+        return ast_getNodeValue(node.left);
+    }
+    if (node.type != "Literal") {
+        return [null, null];
+    }
+    if (node.value === null) {
+        return [node, "Null"];
+    }
+    const type = typeof node.value;
+    if (type === "number") {
+        const match = prettier_plugin_monkeyc_namespaceObject.LiteralIntegerRe.exec(node.raw);
+        if (match) {
+            return match[2] === "l" || match[2] === "L"
+                ? [node, "Long"]
+                : [node, "Number"];
+        }
+        return [node, node.raw.endsWith("d") ? "Double" : "Float"];
+    }
+    if (type === "bigint") {
+        return [node, "Long"];
+    }
+    if (type === "string") {
+        return [node, "String"];
+    }
+    if (type === "boolean") {
+        return [node, "Boolean"];
+    }
+    throw new Error(`Literal has unknown type '${type}'`);
+}
 
 ;// CONCATENATED MODULE: external "./api.cjs"
 const external_api_cjs_namespaceObject = require("./api.cjs");
+;// CONCATENATED MODULE: ./src/function-info.ts
+
+function function_info_cloneSet(ae) {
+    return new Set(ae);
+}
+function function_info_mergeSet(a, b) {
+    b.forEach((event) => a.add(event));
+}
+function recordModifiedDecl(func, decl) {
+    if (!func.next_info) {
+        func.next_info = { modifiedDecls: new Set(), calledFuncs: new Set() };
+    }
+    func.next_info.modifiedDecls.add(decl);
+    return null;
+}
+function function_info_recordModifiedDecls(func, lookupDefs) {
+    lookupDefs.forEach((lookupDef) => lookupDef.results.forEach((result) => {
+        if (result.type == "VariableDeclarator" && result.node.kind === "var") {
+            recordModifiedDecl(func, result);
+        }
+    }));
+}
+function function_info_recordModifiedName(func, name) {
+    if (!func.next_info) {
+        func.next_info = { modifiedDecls: new Set(), calledFuncs: new Set() };
+    }
+    if (!func.next_info.modifiedNames) {
+        func.next_info.modifiedNames = new Set();
+    }
+    func.next_info.modifiedNames.add(name);
+}
+function function_info_recordModifiedUnknown(func) {
+    if (!func.next_info) {
+        func.next_info = { modifiedDecls: new Set(), calledFuncs: new Set() };
+    }
+    func.next_info.modifiedUnknown = true;
+}
+function recordCalledFunc(func, callee) {
+    if (!func.next_info) {
+        func.next_info = { modifiedDecls: new Set(), calledFuncs: new Set() };
+    }
+    func.next_info.calledFuncs.add(callee);
+    return null;
+}
+function function_info_recordCalledFuncs(func, callees) {
+    callees.forEach((callee) => {
+        recordCalledFunc(func, callee);
+    });
+}
+function function_info_functionMayModify(state, func, decl) {
+    const info = func.info;
+    if (!info || info.modifiedUnknown)
+        return true;
+    if (info.resolvedDecls) {
+        return info.resolvedDecls.has(decl);
+    }
+    if (info.modifiedNames?.has(decl.name))
+        return true;
+    if (info.modifiedDecls.has(decl))
+        return true;
+    const visited = new Set();
+    const resolved = new Set();
+    const resolveDecls = (f) => {
+        if (visited.has(f))
+            return true;
+        if (!f.info)
+            return false;
+        if (f.info.modifiedUnknown) {
+            info.modifiedUnknown = true;
+            return false;
+        }
+        if (f.info.modifiedNames) {
+            if (info.modifiedNames) {
+                function_info_mergeSet(info.modifiedNames, f.info.modifiedNames);
+            }
+            else {
+                info.modifiedNames = function_info_cloneSet(f.info.modifiedNames);
+            }
+        }
+        function_info_mergeSet(resolved, f.info.modifiedDecls);
+        visited.add(f);
+        const q = true;
+        if (q &&
+            f.info.callsExposed &&
+            state.exposed &&
+            !Object.keys(state.exposed).every((key) => !state.allFunctions[key] ||
+                state.allFunctions[key].every(resolveDecls))) {
+            return false;
+        }
+        return Array.from(f.info.calledFuncs).every(resolveDecls);
+    };
+    if (resolveDecls(func)) {
+        info.resolvedDecls = resolved;
+        return resolved.has(decl);
+    }
+    return true;
+}
+function function_info_findCallees(lookupDefs) {
+    const decls = lookupDefs.reduce((decls, r) => (decls ? decls.concat(r.results) : r.results), null);
+    return (decls &&
+        decls.filter((decl) => decl ? decl.type === "FunctionDeclaration" : false));
+}
+function function_info_findCalleesForNew(lookupDefs) {
+    const initializer = (decl) => {
+        if (hasProperty(decl.decls, "initialize")) {
+            return decl.decls["initialize"];
+        }
+        if (decl.superClass && decl.superClass !== true) {
+            return decl.superClass.reduce((cur, cls) => {
+                const init = initializer(cls);
+                if (init) {
+                    if (!cur)
+                        return init;
+                    return cur.concat(init);
+                }
+                return cur;
+            }, null);
+        }
+        return null;
+    };
+    return lookupDefs.flatMap((r) => r.results
+        .filter((decl) => decl.type === "ClassDeclaration")
+        .flatMap(initializer)
+        .filter((decl) => decl ? decl.type === "FunctionDeclaration" : false));
+}
+
 ;// CONCATENATED MODULE: ./src/variable-renamer.ts
 
 
@@ -539,6 +710,7 @@ function variable_renamer_renameVariable(state, locals, declName) {
 
 
 
+
 function getArgSafety(state, func, args, requireAll) {
     // determine whether decl might be changed by a function call
     // or assignment during the evaluation of FunctionStateNode.
@@ -571,8 +743,9 @@ function getArgSafety(state, func, args, requireAll) {
         }
     };
     const safeArgs = [];
+    const argDecls = [];
     let allSafe = true;
-    if (!args.every((arg) => {
+    if (!args.every((arg, i) => {
         switch (arg.type) {
             case "Literal":
                 safeArgs.push(true);
@@ -586,13 +759,17 @@ function getArgSafety(state, func, args, requireAll) {
                     safeArgs.push(null);
                     return !requireAll;
                 }
-                const safety = getSafety(results[0].results[0]);
+                const decl = results[0].results[0];
+                const safety = getSafety(decl);
                 safeArgs.push(safety);
                 if (!safety) {
                     allSafe = false;
                     if (safety === null) {
                         return !requireAll;
                     }
+                    else if (decl.type === "VariableDeclarator") {
+                        argDecls[i] = decl;
+                    }
                 }
                 return true;
             }
@@ -605,34 +782,91 @@ function getArgSafety(state, func, args, requireAll) {
     }
     if (allSafe && requireAll)
         return true;
-    let callSeen = false;
+    const callsSeen = new Set();
+    const modifiedDecls = new Set();
+    let modifiedUnknown = false;
     const params = Object.fromEntries(func.node.params.map((param, i) => [variableDeclarationName(param), i]));
     // look for uses of "unsafe" args that occur after a call.
     // use post to do the checking, because arguments are evaluated
     // prior to the call, so eg "return f(x.y);" is fine, but
     // "return f()+x.y" is not.
-    traverseAst(func.node.body, null, (node) => {
-        switch (node.type) {
-            case "AssignmentExpression":
-            case "UpdateExpression": {
-                const v = node.type == "UpdateExpression" ? node.argument : node.left;
-                if (v.type === "Identifier" && hasProperty(params, v.name)) {
-                    safeArgs[params[v.name]] = null;
+    const { pre, post, stack } = state;
+    try {
+        delete state.pre;
+        state.post = (node) => {
+            switch (node.type) {
+                case "AssignmentExpression":
+                case "UpdateExpression": {
+                    const v = node.type == "UpdateExpression" ? node.argument : node.left;
+                    if (v.type === "Identifier" && hasProperty(params, v.name)) {
+                        // If a parameter is modified, we can't just substitute the
+                        // argument wherever the parameter is used.
+                        safeArgs[params[v.name]] = null;
+                        break;
+                    }
+                    if (modifiedUnknown)
+                        break;
+                    const [, results] = state.lookup(v);
+                    if (results) {
+                        results.forEach((r) => r.results.forEach((decl) => decl.type === "VariableDeclarator" && modifiedDecls.add(decl)));
+                    }
+                    else {
+                        modifiedUnknown = true;
+                    }
+                    break;
                 }
+                case "CallExpression":
+                case "NewExpression":
+                    if (!modifiedUnknown) {
+                        const [, results] = state.lookup(node.callee, null, 
+                        // calls are looked up as non-locals, but new is not
+                        node.type === "CallExpression" ? func.stack : state.stack);
+                        if (!results) {
+                            const callee_name = node.callee.type === "Identifier"
+                                ? node.callee
+                                : node.callee.type === "MemberExpression"
+                                    ? isLookupCandidate(node.callee)
+                                    : null;
+                            if (callee_name) {
+                                const callees = state.allFunctions[callee_name.name];
+                                if (callees) {
+                                    callees.forEach((callee) => callsSeen.add(callee));
+                                }
+                            }
+                            else {
+                                modifiedUnknown = true;
+                            }
+                        }
+                        else {
+                            const callees = node.type === "CallExpression"
+                                ? findCallees(results)
+                                : findCalleesForNew(results);
+                            if (callees) {
+                                callees.forEach((callee) => callsSeen.add(callee));
+                            }
+                        }
+                    }
+                    break;
+                case "Identifier":
+                    if (hasProperty(params, node.name) &&
+                        !safeArgs[params[node.name]] &&
+                        (modifiedUnknown ||
+                            !argDecls[params[node.name]] ||
+                            modifiedDecls.has(argDecls[params[node.name]]) ||
+                            Array.from(callsSeen).some((callee) => functionMayModify(state, callee, argDecls[params[node.name]])))) {
+                        safeArgs[params[node.name]] = null;
+                    }
             }
-            // fall through
-            case "CallExpression":
-            case "NewExpression":
-                callSeen = true;
-                break;
-            case "Identifier":
-                if (callSeen &&
-                    hasProperty(params, node.name) &&
-                    !safeArgs[params[node.name]]) {
-                    safeArgs[params[node.name]] = null;
-                }
-        }
-    });
+            return null;
+        };
+        state.stack = func.stack;
+        state.traverse(func.node.body);
+    }
+    finally {
+        state.pre = pre;
+        state.post = post;
+        state.stack = stack;
+    }
     return safeArgs;
 }
 function canInline(state, func, args) {
@@ -737,9 +971,6 @@ function processInlineBody(state, func, call, root, params) {
         state.pre = (node) => {
             if (failed)
                 return [];
-            node.start = call.start;
-            node.end = call.end;
-            node.loc = call.loc;
             if (replacements.has(node))
                 return false;
             const result = pre(node, state);
@@ -754,6 +985,7 @@ function processInlineBody(state, func, call, root, params) {
                     if (params[paramName] >= 0)
                         return null;
                     const name = renameVariable(state, locals, paramName) || paramName;
+                    locals.map[name] = true;
                     return {
                         type: "VariableDeclarator",
                         id: { type: "Identifier", name },
@@ -772,31 +1004,49 @@ function processInlineBody(state, func, call, root, params) {
             }
             return result;
         };
+        const fixId = (node) => {
+            if (state.inType)
+                return null;
+            if (hasProperty(params, node.name)) {
+                const ix = params[node.name];
+                if (ix >= 0) {
+                    const replacement = { ...call.arguments[ix] };
+                    replacements.add(replacement);
+                    return replacement;
+                }
+                return null;
+            }
+            const replacement = fixNodeScope(state, node, func.stack);
+            if (!replacement) {
+                failed = true;
+                inlineDiagnostic(state, func, call, `Failed to resolve '${node.name}'`);
+            }
+            return replacement;
+        };
         state.post = (node) => {
             if (failed)
                 return post(node, state);
             let replacement = null;
             switch (node.type) {
-                case "Identifier": {
-                    if (state.inType)
-                        break;
-                    if (hasProperty(params, node.name)) {
-                        const ix = params[node.name];
-                        if (ix >= 0) {
-                            replacement = { ...call.arguments[ix] };
-                            replacements.add(replacement);
-                            return replacement;
+                case "AssignmentExpression":
+                    if (node.left.type === "Identifier") {
+                        const rep = fixId(node.left);
+                        if (rep) {
+                            node.left = rep;
                         }
-                        break;
                     }
-                    replacement = fixNodeScope(state, node, func.stack);
-                    if (!replacement) {
-                        failed = true;
-                        inlineDiagnostic(state, func, call, `Failed to resolve '${node.name}'`);
-                        return post(node, state);
+                    break;
+                case "UpdateExpression":
+                    if (node.argument.type === "Identifier") {
+                        const rep = fixId(node.argument);
+                        if (rep) {
+                            node.argument = rep;
+                        }
                     }
                     break;
-                }
+                case "Identifier":
+                    replacement = fixId(node);
+                    break;
             }
             const ret = post(replacement || node, state);
             return ret === false || ret ? ret : replacement;
@@ -965,7 +1215,7 @@ function inlineWithArgs(state, func, call, context) {
             }
         }
     }
-    const body = JSON.parse(JSON.stringify(func.node.body));
+    const body = cloneDeep(func.node.body);
     const safeArgs = getArgSafety(state, func, call.arguments, false);
     const params = Object.fromEntries(func.node.params.map((param, i) => {
         const argnum = safeArgs === true || (safeArgs !== false && safeArgs[i] !== null)
@@ -1014,18 +1264,19 @@ function inlineWithArgs(state, func, call, context) {
             --block.body.length;
         }
     }
+    withLocDeep(body, context, context, true);
     return body;
 }
 function inliner_inlineFunction(state, func, call, context) {
     if (context) {
         return inlineWithArgs(state, func, call, context);
     }
-    const retArg = JSON.parse(JSON.stringify(func.node.body.body[0].argument));
+    const retArg = cloneDeep(func.node.body.body[0].argument);
     const params = Object.fromEntries(func.node.params.map((param, i) => [variableDeclarationName(param), i]));
     const map = fixupLocalsMap(state);
     const ret = processInlineBody(state, func, call, retArg, params);
     state.localsStack[state.localsStack.length - 1].map = map;
-    return ret;
+    return ret && withLocDeep(ret, call, call, true);
 }
 function applyTypeIfNeeded(node) {
     if ("enumType" in node && node.enumType) {
@@ -1130,6 +1381,121 @@ function fixNodeScope(state, lookupNode, nodeStack) {
     return null;
 }
 
+;// CONCATENATED MODULE: ./src/pragma-checker.ts
+
+
+
+function pragma_checker_pragmaChecker(state, ast, diagnostics) {
+    const comments = ast.comments;
+    if (!comments)
+        return;
+    diagnostics = diagnostics
+        ?.slice()
+        .sort((d1, d2) => d1.loc.start < d2.loc.start ? -1 : d1.loc.start == d2.loc.start ? 0 : 1);
+    let diagIndex = 0;
+    let index = -1;
+    let comment;
+    let matchers;
+    const next = () => {
+        while (++index < comments.length) {
+            comment = comments[index];
+            let match = comment.value.match(/^\s*@(match|expect)\s+(.+)/);
+            if (!match)
+                continue;
+            const kind = match[1];
+            let str = match[2];
+            matchers = [];
+            while ((match = str.match(/^([/%&#@"])(.+?(?<!\\)(?:\\{2})*)\1(\s+|$)/))) {
+                matchers.push({ kind, quote: match[1], needle: match[2] });
+                str = str.substring(match[0].length);
+                if (!str.length)
+                    break;
+            }
+            if (!str.length)
+                break;
+            if (!matchers.length) {
+                match = str.match(/^(\S+)\s+$/);
+                if (match) {
+                    matchers.push({ kind, quote: '"', needle: match[1] });
+                    break;
+                }
+            }
+            diagnostic(state, comment.loc, `Build pragma '${comment.value}' is invalid`, "ERROR");
+        }
+    };
+    const matcher = (quote, needle, haystack) => {
+        if (quote == '"') {
+            return haystack.includes(needle);
+        }
+        const re = new RegExp(needle.replace(/@(\d+)/g, "(pre_)?$1(_\\d+)?"));
+        return re.test(haystack);
+    };
+    next();
+    traverseAst(ast, (node) => {
+        if (index >= comments.length)
+            return false;
+        if (node.start && node.start >= (comment.end || Infinity)) {
+            const { kind, quote, needle } = matchers.shift();
+            if (kind === "match") {
+                const haystack = formatAst(node).replace(/([\r\n]|\s)+/g, " ");
+                if (!matcher(quote, needle, haystack)) {
+                    matcher(quote, needle, haystack);
+                    diagnostic(state, comment.loc, `Didn't find '${needle}' in '${haystack}'`, "ERROR");
+                }
+            }
+            else if (kind === "expect") {
+                const locCmp = (a, b) => {
+                    if (!b)
+                        return -1;
+                    if (a.start.line < b.start.line)
+                        return -1;
+                    if (a.start.line === b.start.line &&
+                        a.start.column < b.start.column) {
+                        return -1;
+                    }
+                    if (a.end.line > b.end.line)
+                        return 1;
+                    if (a.end.line === b.end.line && a.end.column >= b.end.column) {
+                        return 1;
+                    }
+                    return 0;
+                };
+                let found = false;
+                if (diagnostics) {
+                    while (true) {
+                        if (diagIndex >= diagnostics.length) {
+                            diagnostics = null;
+                            break;
+                        }
+                        const diag = diagnostics[diagIndex];
+                        const cmp = locCmp(diag.loc, node.loc);
+                        if (cmp > 0) {
+                            break;
+                        }
+                        diagIndex++;
+                        if (cmp < 0)
+                            continue;
+                        if (matcher(quote, needle, diag.message)) {
+                            found = true;
+                            diag.type = "INFO";
+                        }
+                    }
+                }
+                if (!found) {
+                    diagnostic(state, comment.loc, `Missing error message '${needle}`, "ERROR");
+                }
+            }
+            if (matchers.length) {
+                // if we're checking a series of nodes, we need
+                // to skip over this one.
+                return false;
+            }
+            next();
+        }
+        return null;
+    });
+}
+
 ;// CONCATENATED MODULE: external "./util.cjs"
 const external_util_cjs_namespaceObject = require("./util.cjs");
 ;// CONCATENATED MODULE: ./src/control-flow.ts
@@ -1652,6 +2018,7 @@ var priorityqueuejs = __webpack_require__(2789);
 
 
 
+
 /**
  * This implements a pseudo Partial Redundancy Elimination
  * pass. It isn't quite like traditional PRE because we're
@@ -1721,7 +2088,7 @@ function pre_sizeBasedPRE(state, func) {
         return;
     }
     const { graph: head, identifiers } = buildPREGraph(state, func);
-    const candidates = computeAttributes(head);
+    const candidates = computeAttributes(state, head);
     if (candidates) {
         if (logging) {
             console.log(`Found ${candidates.size} candidates in ${func.fullName}`);
@@ -1741,8 +2108,10 @@ function pre_sizeBasedPRE(state, func) {
             let i = 0;
             do {
                 name = `pre_${declName(decl)}${i ? "_" + i : ""}`;
-                if (!identifiers.has(name))
+                if (!identifiers.has(name)) {
+                    identifiers.add(name);
                     break;
+                }
                 i++;
             } while (true);
             declMap.set(decl, name);
@@ -1833,11 +2202,16 @@ function buildPREGraph(state, func) {
                 case "ParenthesizedExpression":
                     break;
                 case "Literal":
-                    if (!node.value && refCost(node) > LocalRefCost) {
-                        let decl = literals.get(node.value);
+                    if (refCost(node) > LocalRefCost) {
+                        const result = getNodeValue(node);
+                        const key = result[1] +
+                            (result[0].value === null
+                                ? ""
+                                : "-" + result[0].value.toString());
+                        let decl = literals.get(key);
                         if (!decl) {
                             decl = node;
-                            literals.set(node.value, decl);
+                            literals.set(key, decl);
                         }
                         return {
                             type: "ref",
@@ -1917,10 +2291,18 @@ function buildPREGraph(state, func) {
                     }
                     break;
                 }
-                case "NewExpression":
-                case "CallExpression":
+                case "NewExpression": {
+                    const [, results] = state.lookup(node.callee);
+                    const callees = results ? findCalleesForNew(results) : null;
                     liveDef(null, stmt);
-                    return { type: "mod", node, mayThrow };
+                    return { type: "mod", node, mayThrow, callees };
+                }
+                case "CallExpression": {
+                    liveDef(null, stmt);
+                    const [, results] = state.lookup(node.callee);
+                    const callees = results ? findCallees(results) : null;
+                    return { type: "mod", node, mayThrow, callees };
+                }
                 default:
                     if (!isExpression(node))
                         break;
@@ -1936,12 +2318,6 @@ function buildPREGraph(state, func) {
 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;
@@ -2020,6 +2396,7 @@ function refCost(node) {
         switch (typeof node.value) {
             case "string":
                 return 5;
+            case "bigint":
             case "number":
                 return 5;
             case "boolean":
@@ -2081,7 +2458,7 @@ function candidateCost(candState) {
     cost += defCost(candState.node) * boundarySize;
     return cost;
 }
-function computeAttributes(head) {
+function computeAttributes(state, head) {
     const order = getPostOrder(head);
     order.forEach((block, i) => {
         block.order = i;
@@ -2190,7 +2567,9 @@ function computeAttributes(head) {
                         curState.forEach((candidates, decl) => {
                             if (decl.type === "VariableDeclarator" &&
                                 decl.node.kind === "var" &&
-                                candidates.live) {
+                                candidates.live &&
+                                (!event.callees ||
+                                    event.callees.some((callee) => functionMayModify(state, callee, decl)))) {
                                 candidates.ant.add(getMod(event, decl, candidates.node));
                                 candidates.live = false;
                             }
@@ -2379,20 +2758,26 @@ function applyReplacements(func, nodeMap, declMap) {
             stmtStack.pop();
         const events = nodeMap.get(node);
         if (events) {
-            if (events.length === 1) {
-                if (events[0].type === "ref") {
+            const ret = events.reduce((ret, event) => {
+                if (event.type === "ref") {
+                    if (ret) {
+                        throw new Error(`ref found when there was already a replacement for this node`);
+                    }
                     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);
+                    const name = declMap.get(event.decl);
                     if (!name) {
                         throw new Error(`No replacement found for "${formatAst(node)}"`);
                     }
                     return ident(name, node);
                 }
-                else if (events[0].type === "def") {
+                if (event.type === "def") {
+                    if (ret) {
+                        throw new Error(`def found when there was already a replacement for this node`);
+                    }
                     if (node.type !== "AssignmentExpression" &&
                         node.type !== "UpdateExpression") {
                         throw new Error(`Def found, but wrong type of node: ${node.type}`);
@@ -2400,7 +2785,7 @@ function applyReplacements(func, nodeMap, declMap) {
                     const target = node.type === "AssignmentExpression"
                         ? node.left
                         : node.argument;
-                    const name = declMap.get(events[0].decl);
+                    const name = declMap.get(event.decl);
                     if (!name) {
                         throw new Error(`No replacement found for "${formatAst(target)}"`);
                     }
@@ -2419,20 +2804,24 @@ function applyReplacements(func, nodeMap, declMap) {
                     }
                     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`);
+                if (event.type === "mod") {
+                    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);
                 }
-                let pending = pendingMap.get(stmt);
-                if (!pending) {
-                    pendingMap.set(stmt, (pending = new Set()));
+                else {
+                    throw new Error(`Unexpected ${event.type} found`);
                 }
-                pending.add(event);
-            });
+                return ret;
+            }, null);
+            if (ret) {
+                return ret;
+            }
         }
         const pending = pendingMap.get(node);
         if (node.type === "SequenceExpression") {
@@ -2506,6 +2895,148 @@ function applyReplacements(func, nodeMap, declMap) {
     });
 }
 
+;// CONCATENATED MODULE: ./src/unused-exprs.ts
+
+
+
+function unused_exprs_cleanupUnusedVars(state, node) {
+    const [parent] = state.stack.slice(-1);
+    if (parent.node !== node) {
+        return;
+    }
+    if (parent.type != "BlockStatement") {
+        throw new Error(`Unexpected parent type '${parent.type}' for local declaration`);
+    }
+    if (parent.decls) {
+        let toRemove = null;
+        Object.values(parent.decls).forEach((decls) => {
+            if (decls.length === 1 &&
+                decls[0].type === "VariableDeclarator" &&
+                !decls[0].used) {
+                if (!toRemove)
+                    toRemove = {};
+                toRemove[decls[0].name] = decls[0];
+            }
+        });
+        if (toRemove) {
+            const varDeclarations = new Map();
+            traverseAst(node, null, (node) => {
+                switch (node.type) {
+                    case "VariableDeclaration": {
+                        node.declarations.forEach((decl, i) => {
+                            const name = variableDeclarationName(decl.id);
+                            if (hasProperty(toRemove, name)) {
+                                const indices = varDeclarations.get(node);
+                                if (indices) {
+                                    indices.push(i);
+                                }
+                                else {
+                                    varDeclarations.set(node, [i]);
+                                }
+                            }
+                        });
+                        break;
+                    }
+                    case "ExpressionStatement":
+                        if (node.expression.type === "AssignmentExpression") {
+                            if (node.expression.left.type === "Identifier" &&
+                                hasProperty(toRemove, node.expression.left.name)) {
+                                return unused(node.expression.right);
+                            }
+                        }
+                        else if (node.expression.type === "UpdateExpression" &&
+                            node.expression.argument.type === "Identifier" &&
+                            hasProperty(toRemove, node.expression.argument.name)) {
+                            return false;
+                        }
+                        break;
+                    case "SequenceExpression": {
+                        for (let i = node.expressions.length; i--;) {
+                            const expr = node.expressions[i];
+                            if (expr.type === "AssignmentExpression") {
+                                if (expr.left.type === "Identifier" &&
+                                    hasProperty(toRemove, expr.left.name)) {
+                                    const rep = unused(expr.right);
+                                    if (!rep.length) {
+                                        node.expressions.splice(i, 1);
+                                    }
+                                    else {
+                                        // Sequence expressions can only be assignments
+                                        // or update expressions. Even calls aren't allowed
+                                        toRemove[expr.left.name] = null;
+                                        expr.operator = "=";
+                                    }
+                                }
+                            }
+                            else if (expr.type === "UpdateExpression" &&
+                                expr.argument.type === "Identifier" &&
+                                hasProperty(toRemove, expr.argument.name)) {
+                                node.expressions.splice(i, 1);
+                            }
+                        }
+                        break;
+                    }
+                }
+                return null;
+            });
+            varDeclarations.forEach((indices, decl) => {
+                let index = -1;
+                for (let ii = indices.length, j = decl.declarations.length; ii--;) {
+                    const i = indices[ii];
+                    const vdecl = decl.declarations[i];
+                    const name = variableDeclarationName(vdecl.id);
+                    if (hasProperty(toRemove, name)) {
+                        const rep = vdecl.init ? unused(vdecl.init) : [];
+                        if (rep.length) {
+                            if (parent.node.type === "ForStatement") {
+                                // declarations whose inits have side effects
+                                // can't be deleted from for statements.
+                                continue;
+                            }
+                            if (index < 0) {
+                                index = parent.node.body.findIndex((s) => s === decl);
+                                if (index < 0) {
+                                    throw new Error(`Failed to find variable declaration for ${variableDeclarationName(vdecl.id)}`);
+                                }
+                            }
+                            if (j > i + 1) {
+                                const tail = {
+                                    ...decl,
+                                    declarations: decl.declarations.slice(i + 1, j),
+                                };
+                                if (decl.loc && vdecl.loc) {
+                                    tail.loc = { ...decl.loc, start: vdecl.loc.end };
+                                    tail.start = vdecl.end;
+                                }
+                                rep.push(tail);
+                            }
+                            if (decl.loc && vdecl.loc) {
+                                decl.loc = { ...decl.loc, end: vdecl.loc.start };
+                                decl.end = vdecl.start;
+                            }
+                            decl.declarations.splice(i);
+                            parent.node.body.splice(index + 1, 0, ...rep);
+                            j = i;
+                            continue;
+                        }
+                        if (toRemove[name]) {
+                            j--;
+                            decl.declarations.splice(i, 1);
+                            if (i === j && decl.loc && vdecl.loc) {
+                                decl.loc = { ...decl.loc, end: vdecl.loc.start };
+                                decl.end = vdecl.start;
+                            }
+                        }
+                        else {
+                            delete vdecl.init;
+                        }
+                    }
+                }
+            });
+        }
+    }
+}
+
 ;// CONCATENATED MODULE: ./src/visitor.ts
 
 function visitor_visitReferences(state, ast, name, defn, callback) {
@@ -2570,14 +3101,16 @@ function visitor_visitReferences(state, ast, name, defn, callback) {
                     return checkResults(state.lookup(node), node);
                 }
                 break;
-            case "MemberExpression":
-                if (!node.computed && node.property.type === "Identifier") {
-                    if (!name || node.property.name === name) {
+            case "MemberExpression": {
+                const property = (0,external_api_cjs_namespaceObject.isLookupCandidate)(node);
+                if (property) {
+                    if (!name || 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!");
@@ -2586,7 +3119,6 @@ function visitor_visitReferences(state, ast, name, defn, callback) {
                     node.params.forEach((param) => {
                         if (param.type == "BinaryExpression") {
                             state.traverse(param.right);
-                            state.inType = true;
                         }
                     });
                 }
@@ -2609,6 +3141,9 @@ function visitor_visitReferences(state, ast, name, defn, callback) {
 
 
 
+
+
+
 function collectClassInfo(state) {
     const toybox = state.stack[0].decls["Toybox"][0];
     const lang = toybox.decls["Lang"][0];
@@ -2668,8 +3203,7 @@ function collectClassInfo(state) {
             c.decls &&
                 Object.values(c.decls).forEach((funcs) => {
                     funcs.forEach((f) => {
-                        if (isStateNode(f) &&
-                            f.type === "FunctionDeclaration" &&
+                        if (f.type === "FunctionDeclaration" &&
                             hasProperty(cls.decls, f.name)) {
                             f.node.hasOverride = true;
                         }
@@ -2682,6 +3216,15 @@ function collectClassInfo(state) {
     state.allClasses.forEach((elm) => {
         if (elm.superClass)
             markOverrides(elm, elm.superClass);
+        if (elm.hasInvoke && elm.decls) {
+            Object.values(elm.decls).forEach((funcs) => {
+                funcs.forEach((f) => {
+                    if (f.type === "FunctionDeclaration" && !f.isStatic) {
+                        markInvokeClassMethod(f);
+                    }
+                });
+            });
+        }
     });
 }
 function getFileSources(fnMap) {
@@ -2721,7 +3264,7 @@ async function analyze(fnMap, barrelList, config) {
     const preState = {
         fnMap,
         config,
-        allFunctions: [],
+        allFunctions: {},
         allClasses: [],
         shouldExclude(node) {
             if ("attrs" in node &&
@@ -2751,11 +3294,6 @@ async function analyze(fnMap, barrelList, config) {
         pre(node, state) {
             switch (node.type) {
                 case "FunctionDeclaration":
-                    if (markApi) {
-                        node.body = null;
-                        break;
-                    }
-                // falls through
                 case "ModuleDeclaration":
                 case "ClassDeclaration": {
                     const [scope] = state.stack.slice(-1);
@@ -2766,7 +3304,18 @@ async function analyze(fnMap, barrelList, config) {
                                 (scope.node.attrs &&
                                     scope.node.attrs.access &&
                                     scope.node.attrs.access.includes("static"));
-                        state.allFunctions.push(scope);
+                        if (markApi) {
+                            node.body = null;
+                            scope.info = getApiFunctionInfo(scope);
+                            delete scope.stack;
+                        }
+                        const allFuncs = state.allFunctions;
+                        if (!hasProperty(allFuncs, scope.name)) {
+                            allFuncs[scope.name] = [scope];
+                        }
+                        else {
+                            allFuncs[scope.name].push(scope);
+                        }
                     }
                     else if (scope.type === "ClassDeclaration") {
                         state.allClasses.push(scope);
@@ -2791,7 +3340,7 @@ async function analyze(fnMap, barrelList, config) {
         value.hasTests = hasTests;
     });
     delete state.shouldExclude;
-    delete state.post;
+    delete state.pre;
     collectClassInfo(state);
     const diagnosticType = config?.checkInvalidSymbols !== "OFF"
         ? config?.checkInvalidSymbols || "WARNING"
@@ -2814,6 +3363,8 @@ async function analyze(fnMap, barrelList, config) {
             });
         });
     }
+    state.exposed = state.nextExposed;
+    state.nextExposed = {};
     return state;
 }
 function compareLiteralLike(a, b) {
@@ -2859,57 +3410,16 @@ function getLiteralNode(node) {
         if (node.argument.type != "Literal")
             return null;
         switch (node.operator) {
-            case "-":
-                if (typeof node.argument.value == "number") {
-                    return {
-                        ...node.argument,
-                        value: -node.argument.value,
-                        raw: "-" + node.argument.value,
-                        enumType: node.enumType,
-                    };
+            case "-": {
+                const [arg, type] = ast_getNodeValue(node.argument);
+                if (type === "Number" || type === "Long") {
+                    return replacementLiteral(arg, -arg.value, type);
                 }
+            }
         }
     }
     return null;
 }
-function getNodeValue(node) {
-    if (node.type == "BinaryExpression" &&
-        node.operator == "as" &&
-        node.right.type == "TypeSpecList" &&
-        node.right.ts.length == 1 &&
-        typeof node.right.ts[0] == "string") {
-        // this is a cast we inserted to retain the type of an enum
-        // any arithmetic on it will revert to "Number", or "Long",
-        // so just ignore it.
-        return getNodeValue(node.left);
-    }
-    if (node.type != "Literal") {
-        return [null, null];
-    }
-    let type = node.value === null ? "Null" : typeof node.value;
-    if (type === "number") {
-        const match = node.raw && LiteralIntegerRe.exec(node.raw);
-        if (match) {
-            type = match[2] == "l" ? "Long" : "Number";
-        }
-        else if (node.raw && node.raw.endsWith("d")) {
-            type = "Double";
-        }
-        else {
-            type = "Float";
-        }
-    }
-    else if (type === "string") {
-        type = "String";
-    }
-    else if (type === "boolean") {
-        type = "Boolean";
-    }
-    else {
-        type = "Unknown";
-    }
-    return [node, type];
-}
 function fullTypeName(state, tsp) {
     if (typeof tsp.name === "string") {
         return tsp.name;
@@ -2953,6 +3463,46 @@ function isBooleanExpression(state, node) {
     }
     return false;
 }
+function replacementLiteral(arg, value, type) {
+    if (typeof value === "boolean") {
+        type = "Boolean";
+    }
+    else if (type === "Number") {
+        value = Number(BigInt.asIntN(32, BigInt(value)));
+    }
+    else if (type === "Long") {
+        value = BigInt.asIntN(64, BigInt(value));
+    }
+    return {
+        ...arg,
+        value,
+        raw: value.toString() + (type === "Long" ? "l" : ""),
+    };
+}
+const operators = {
+    "+": (left, right) => left + right,
+    "-": (left, right) => left - right,
+    "*": (left, right) => left * right,
+    "/": (left, right) => left / right,
+    "%": (left, right) => left % right,
+    "&": (left, right) => left & right,
+    "|": (left, right) => left | right,
+    "^": (left, right) => left ^ right,
+    "<<": (left, right) => left << (right & 127n),
+    ">>": (left, right) => left >> (right & 127n),
+    "==": (left, right) => 
+    // two string literals will compare unequal, becuase string
+    // equality is object equality.
+    typeof left === "string" ? false : left === right,
+    "!=": (left, right) => typeof left === "string" ? true : left !== right,
+    "<=": (left, right) => left <= right,
+    ">=": (left, right) => left >= right,
+    "<": (left, right) => left < right,
+    ">": (left, right) => left > right,
+    as: null,
+    instanceof: null,
+    has: null,
+};
 function optimizeNode(state, node) {
     switch (node.type) {
         case "UnaryExpression": {
@@ -2967,29 +3517,17 @@ function optimizeNode(state, node) {
                     break;
                 case "-":
                     if (type === "Number" || type === "Long") {
-                        return {
-                            ...arg,
-                            value: -arg.value,
-                            raw: (-arg.value).toString() + (type === "Long" ? "l" : ""),
-                        };
+                        return replacementLiteral(arg, -arg.value, type);
                     }
                     break;
                 case "!":
                 case "~":
                     {
-                        let value;
                         if (type === "Number" || type === "Long") {
-                            value = -arg.value - 1;
-                        }
-                        else if (type === "Boolean" && node.operator == "!") {
-                            value = !arg.value;
+                            return replacementLiteral(arg, ~BigInt(arg.value), type);
                         }
-                        if (value !== undefined) {
-                            return {
-                                ...arg,
-                                value,
-                                raw: value.toString() + (type === "Long" ? "l" : ""),
-                            };
+                        if (type === "Boolean" && node.operator == "!") {
+                            return replacementLiteral(arg, !arg.value, type);
                         }
                     }
                     break;
@@ -2997,27 +3535,6 @@ function optimizeNode(state, node) {
             break;
         }
         case "BinaryExpression": {
-            const operators = {
-                "+": (left, right) => left + right,
-                "-": (left, right) => left - right,
-                "*": (left, right) => left * right,
-                "/": (left, right) => Math.trunc(left / right),
-                "%": (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) {
                 const [left, left_type] = getNodeValue(node.left);
@@ -3025,23 +3542,22 @@ function optimizeNode(state, node) {
                 if (!left || !right)
                     break;
                 let value = null;
-                if (left_type != right_type ||
-                    (left_type != "Number" && left_type != "Long")) {
+                let type;
+                if ((left_type != "Number" && left_type != "Long") ||
+                    left_type != right_type) {
                     if (node.operator !== "==" && node.operator !== "!=") {
                         break;
                     }
                     value = operators[node.operator](left.value, right.value);
+                    type = "Boolean";
                 }
                 else {
-                    value = op(left.value, right.value, left_type);
+                    type = left_type;
+                    value = op(BigInt(left.value), BigInt(right.value));
                 }
                 if (value === null)
                     break;
-                return {
-                    ...left,
-                    value,
-                    raw: value.toString() + (left_type === "Long" ? "l" : ""),
-                };
+                return replacementLiteral(left, value, type);
             }
             break;
         }
@@ -3051,7 +3567,8 @@ function optimizeNode(state, node) {
                 break;
             const falsy = left.value === false ||
                 left.value === null ||
-                (left.value === 0 && (left_type === "Number" || left_type === "Long"));
+                ((left_type === "Number" || left_type === "Long") &&
+                    (left.value === 0 || left.value === 0n));
             if (falsy === (node.operator === "&&")) {
                 return left;
             }
@@ -3092,9 +3609,7 @@ function evaluateFunction(state, func, args) {
     const paramValues = args &&
         Object.fromEntries(func.params.map((p, i) => [variableDeclarationName(p), args[i]]));
     let ret = null;
-    const body = args
-        ? JSON.parse(JSON.stringify(func.body))
-        : func.body;
+    const body = args ? cloneDeep(func.body) : func.body;
     try {
         traverseAst(body, (node) => {
             switch (node.type) {
@@ -3145,12 +3660,10 @@ function markFunctionCalled(state, func) {
     pushUnique(state.calledFunctions[func.id.name], func);
 }
 async function optimizeMonkeyC(fnMap, barrelList, config) {
-    const state = {
-        ...(await analyze(fnMap, barrelList, config)),
-        localsStack: [{}],
-        exposed: {},
-        calledFunctions: {},
-    };
+    const state = (await analyze(fnMap, barrelList, config));
+    state.localsStack = [{}];
+    state.calledFunctions = {};
+    state.usedByName = {};
     const replace = (node, old) => {
         if (node === false || node === null)
             return node;
@@ -3239,6 +3752,58 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                     f.type == "FunctionDeclaration" &&
                     maybeCalled(f.node))) ||
                 (sc.superClass && checkInherited(sc, name))));
+    const renamer = (idnode) => {
+        const ident = idnode.type === "Identifier" ? idnode : idnode.left;
+        const locals = topLocals();
+        const { map } = locals;
+        if (map) {
+            const declName = ident.name;
+            const name = renameVariable(state, locals, declName);
+            if (name) {
+                const [, results] = state.lookupValue(ident);
+                if (!results) {
+                    throw new Error(`Didn't find local ${declName} which needed renaming`);
+                }
+                if (results.length !== 1) {
+                    throw new Error(`Lookup of local ${declName} found more than one result`);
+                }
+                const parent = results[0].parent;
+                if (!parent) {
+                    throw new Error(`No parent in lookup of local ${declName}`);
+                }
+                const decls = parent.decls;
+                if (!decls || !hasProperty(decls, declName)) {
+                    throw new Error(`Missing decls in lookup of local ${declName}`);
+                }
+                if (hasProperty(decls, name)) {
+                    throw new Error(`While renaming ${declName} to ${name}, there was already a variable ${name}`);
+                }
+                if (decls[declName].length === 1) {
+                    decls[name] = decls[declName];
+                    delete decls[declName];
+                }
+                else {
+                    let i = decls[declName].length;
+                    while (i--) {
+                        const decl = decls[declName][i];
+                        if (decl === idnode ||
+                            (decl.type === "VariableDeclarator" && decl.node.id === idnode)) {
+                            decls[declName].splice(i, 1);
+                            decls[name] = [decl];
+                            break;
+                        }
+                    }
+                    if (i < 0) {
+                        throw new Error(`While renaming ${declName} to ${name}: Didn't find original declaration`);
+                    }
+                }
+                ident.name = name;
+            }
+            else {
+                map[declName] = true;
+            }
+        }
+    };
     state.pre = (node) => {
         switch (node.type) {
             case "ConditionalExpression":
@@ -3259,7 +3824,11 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                         result = !!value.value;
                     }
                     if (result !== null) {
-                        node.test = { type: "Literal", value: result };
+                        node.test = {
+                            type: "Literal",
+                            value: result,
+                            raw: result.toString(),
+                        };
                         if (node.type === "IfStatement" ||
                             node.type === "ConditionalExpression") {
                             return [result ? "consequent" : "alternate"];
@@ -3278,7 +3847,7 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                 return null;
             }
             case "EnumDeclaration":
-                return false;
+                return [];
             case "ForStatement": {
                 const map = topLocals().map;
                 if (map) {
@@ -3287,43 +3856,13 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                 break;
             }
             case "VariableDeclarator": {
-                const locals = topLocals();
-                const { map } = locals;
-                if (map) {
-                    const declName = variableDeclarationName(node.id);
-                    const name = renameVariable(state, locals, declName);
-                    if (name) {
-                        if (node.id.type === "Identifier") {
-                            node.id.name = name;
-                        }
-                        else {
-                            node.id.left.name = name;
-                        }
-                    }
-                    else {
-                        map[declName] = true;
-                    }
-                }
+                renamer(node.id);
                 return ["init"];
             }
             case "CatchClause":
                 if (node.param) {
                     state.localsStack.push({ node, map: { ...(topLocals().map || {}) } });
-                    const locals = topLocals();
-                    const map = locals.map;
-                    const declName = variableDeclarationName(node.param);
-                    const name = renameVariable(state, locals, declName);
-                    if (name) {
-                        if (node.param.type === "Identifier") {
-                            node.param.name = name;
-                        }
-                        else {
-                            node.param.left.name = name;
-                        }
-                    }
-                    else {
-                        map[declName] = true;
-                    }
+                    renamer(node.param);
                     return ["body"];
                 }
                 break;
@@ -3339,14 +3878,8 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                 break;
             case "UnaryExpression":
                 if (node.operator == ":") {
-                    // If we produce a Symbol, for a given name,
-                    // its possible that someone uses that symbol
-                    // indirectly, so we can't remove any enums or
-                    // constants with that name (we can still replace
-                    // uses of those constants though).
-                    state.exposed[node.argument.name] = true;
-                    // In any case, we can't replace *this* use of the
-                    // symbol with its value...
+                    // node.argument is not a normal identifier.
+                    // don't visit it.
                     return [];
                 }
                 break;
@@ -3358,29 +3891,73 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                         if (typeof name === "string") {
                             node.name = name;
                         }
+                        const [, results] = state.lookupValue(node);
+                        if (results) {
+                            if (results.length !== 1 || results[0].results.length !== 1) {
+                                throw new Error(`Local ${node.name} had multiple lookup results`);
+                            }
+                            const parent = results[0].parent;
+                            if (!parent) {
+                                throw new Error(`Local ${node.name} had no parent`);
+                            }
+                            const decl = results[0].results[0];
+                            if (parent.type === "FunctionDeclaration" ||
+                                decl.type !== "VariableDeclarator") {
+                                // we can't optimize away function or catch parameters
+                                return [];
+                            }
+                            if (parent.type !== "BlockStatement") {
+                                throw new Error(`Local ${node.name} was not declared at block scope(??)`);
+                            }
+                            decl.used = true;
+                        }
                     }
                 }
                 if (hasProperty(state.index, node.name)) {
                     if (!lookupAndReplace(node)) {
-                        state.exposed[node.name] = true;
+                        state.usedByName[node.name] = true;
                     }
                 }
                 return [];
             }
-            case "MemberExpression":
-                if (node.property.type === "Identifier" && !node.computed) {
-                    if (hasProperty(state.index, node.property.name)) {
+            case "MemberExpression": {
+                const property = isLookupCandidate(node);
+                if (property) {
+                    if (hasProperty(state.index, property.name)) {
                         if (lookupAndReplace(node)) {
                             return false;
                         }
                         else {
-                            state.exposed[node.property.name] = true;
+                            state.usedByName[property.name] = true;
                         }
                     }
                     // Don't optimize the property.
                     return ["object"];
                 }
                 break;
+            }
+            case "AssignmentExpression":
+            case "UpdateExpression": {
+                const lhs = node.type === "AssignmentExpression" ? node.left : node.argument;
+                if (lhs.type === "Identifier") {
+                    const map = topLocals().map;
+                    if (map) {
+                        if (hasProperty(map, lhs.name)) {
+                            const name = map[lhs.name];
+                            if (typeof name === "string") {
+                                lhs.name = name;
+                            }
+                        }
+                    }
+                }
+                else if (lhs.type === "MemberExpression") {
+                    state.traverse(lhs.object);
+                    if (lhs.computed) {
+                        state.traverse(lhs.property);
+                    }
+                }
+                return node.type === "AssignmentExpression" ? ["right"] : [];
+            }
             case "BlockStatement": {
                 const map = topLocals().map;
                 if (map) {
@@ -3396,7 +3973,11 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                 node.params &&
                     node.params.forEach((p) => (map[variableDeclarationName(p)] = true));
                 state.localsStack.push({ node, map });
-                const [parent] = state.stack.slice(-2);
+                const [parent, self] = state.stack.slice(-2);
+                if (state.currentFunction) {
+                    throw new Error(`Nested functions: ${self.fullName} was activated during processing of ${state.currentFunction.fullName}`);
+                }
+                state.currentFunction = self;
                 if (parent.type == "ClassDeclaration" && !maybeCalled(node)) {
                     let used = false;
                     if (node.id.name == "initialize") {
@@ -3423,10 +4004,23 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
             return replace(opt, node);
         }
         switch (node.type) {
+            case "FunctionDeclaration":
+                if (!state.currentFunction) {
+                    throw new Error(`Finished function ${state.stack.slice(-1)[0].fullName}, but it was not marked current`);
+                }
+                state.currentFunction.info = state.currentFunction.next_info;
+                delete state.currentFunction.next_info;
+                delete state.currentFunction;
+                break;
             case "BlockStatement":
                 if (node.body.length === 1 && node.body[0].type === "BlockStatement") {
                     node.body.splice(0, 1, ...node.body[0].body);
                 }
+            // fall through
+            case "ForStatement":
+                if (locals.map) {
+                    cleanupUnusedVars(state, node);
+                }
                 break;
             case "ConditionalExpression":
             case "IfStatement":
@@ -3459,17 +4053,20 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                     return replace(optimizeCall(state, node.argument, node), node.argument);
                 }
                 break;
+            case "NewExpression":
+                if (state.currentFunction) {
+                    const [, results] = state.lookup(node.callee);
+                    if (results) {
+                        recordCalledFuncs(state.currentFunction, findCalleesForNew(results));
+                    }
+                    else {
+                        recordModifiedUnknown(state.currentFunction);
+                    }
+                }
+                break;
             case "CallExpression": {
                 return replace(optimizeCall(state, node, null), node);
             }
-            case "AssignmentExpression":
-                if (node.operator === "=" &&
-                    node.left.type === "Identifier" &&
-                    node.right.type === "Identifier" &&
-                    node.left.name === node.right.name) {
-                    return { type: "Literal", value: null, raw: "null" };
-                }
-                break;
             case "VariableDeclaration": {
                 const locals = topLocals();
                 if (locals.map &&
@@ -3543,6 +4140,32 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                     }
                 }
                 break;
+            case "AssignmentExpression":
+                if (node.operator === "=" &&
+                    node.left.type === "Identifier" &&
+                    node.right.type === "Identifier" &&
+                    node.left.name === node.right.name) {
+                    return { type: "Literal", value: null, raw: "null" };
+                }
+            // fall through;
+            case "UpdateExpression":
+                if (state.currentFunction) {
+                    const lhs = node.type === "AssignmentExpression" ? node.left : node.argument;
+                    const [, results] = state.lookup(lhs);
+                    if (results) {
+                        recordModifiedDecls(state.currentFunction, results);
+                    }
+                    else {
+                        const id = lhs.type === "Identifier" ? lhs : isLookupCandidate(lhs);
+                        if (id) {
+                            recordModifiedName(state.currentFunction, id.name);
+                        }
+                        else {
+                            recordModifiedUnknown(state.currentFunction);
+                        }
+                    }
+                }
+                break;
         }
         return null;
     };
@@ -3550,13 +4173,16 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
         collectNamespaces(f.ast, state);
     });
     state.calledFunctions = {};
-    state.exposed = {};
+    state.exposed = state.nextExposed;
+    state.nextExposed = {};
     Object.values(fnMap).forEach((f) => {
         collectNamespaces(f.ast, state);
     });
+    state.exposed = state.nextExposed;
+    state.nextExposed = {};
     delete state.pre;
     delete state.post;
-    state.allFunctions.forEach((fn) => sizeBasedPRE(state, fn));
+    Object.values(state.allFunctions).forEach((fns) => fns.forEach((fn) => sizeBasedPRE(state, fn)));
     const cleanup = (node) => {
         switch (node.type) {
             case "ThisExpression":
@@ -3566,7 +4192,8 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                 if (node.members.every((m) => {
                     const name = "name" in m ? m.name : m.id.name;
                     return (hasProperty(state.index, name) &&
-                        !hasProperty(state.exposed, name));
+                        !hasProperty(state.exposed, name) &&
+                        !hasProperty(state.usedByName, name));
                 })) {
                     node.enumType = [
                         ...new Set(node.members.map((m) => {
@@ -3609,7 +4236,9 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
             case "VariableDeclaration": {
                 node.declarations = node.declarations.filter((d) => {
                     const name = variableDeclarationName(d.id);
-                    return (!hasProperty(state.index, name) || hasProperty(state.exposed, name));
+                    return (!hasProperty(state.index, name) ||
+                        hasProperty(state.exposed, name) ||
+                        hasProperty(state.usedByName, name));
                 });
                 if (!node.declarations.length) {
                     return false;
@@ -3623,6 +4252,11 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
                 break;
             case "FunctionDeclaration":
                 if (!maybeCalled(node)) {
+                    if (node.attrs &&
+                        node.attrs.attributes &&
+                        node.attrs.attributes.elements.some((attr) => attr.type === "UnaryExpression" && attr.argument.name === "keep")) {
+                        break;
+                    }
                     return false;
                 }
                 break;
@@ -3642,7 +4276,7 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
         }
         return null;
     };
-    Object.values(fnMap).forEach((f) => {
+    Object.entries(fnMap).forEach(([name, f]) => {
         traverseAst(f.ast, undefined, (node) => {
             const ret = cleanup(node);
             if (ret === false) {
@@ -3650,16 +4284,15 @@ async function optimizeMonkeyC(fnMap, barrelList, config) {
             }
             return ret;
         });
+        if (state.config && state.config.checkBuildPragmas) {
+            pragmaChecker(state, f.ast, state.diagnostics?.[name]);
+        }
     });
     return state.diagnostics;
 }
 function optimizeCall(state, node, context) {
     const [name, results] = state.lookupNonlocal(node.callee);
-    const callees = results &&
-        results
-            .map((r) => r.results)
-            .flat()
-            .filter((c) => c.type === "FunctionDeclaration");
+    const callees = results ? findCallees(results) : null;
     if (!callees || !callees.length) {
         const n = name ||
             ("name" in node.callee && node.callee.name) ||
@@ -3668,14 +4301,24 @@ function optimizeCall(state, node, context) {
                 "name" in node.callee.property &&
                 node.callee.property.name);
         if (n) {
-            state.exposed[n] = true;
+            if (hasProperty(state.allFunctions, n)) {
+                if (state.currentFunction) {
+                    recordCalledFuncs(state.currentFunction, state.allFunctions[n]);
+                }
+                state.allFunctions[n].forEach((fn) => markFunctionCalled(state, fn.node));
+            }
         }
-        else {
-            // There are unnamed CallExpressions, such as new [size]
-            // So there's nothing to do here.
+        else if (state.currentFunction) {
+            // I don't think this can happen: foo[x](args)
+            // doesn't parse, so you can't even do things like
+            // $.Toybox.Lang[:format]("fmt", [])
+            recordModifiedUnknown(state.currentFunction);
         }
         return null;
     }
+    if (state.currentFunction) {
+        recordCalledFuncs(state.currentFunction, callees);
+    }
     if (callees.length == 1 && callees[0].type === "FunctionDeclaration") {
         const callee = callees[0].node;
         if (!context &&
@@ -3886,20 +4529,18 @@ function checkOne(state, ns, decls, node, isStatic) {
             return next ? (result ? result.concat(next) : next) : result;
         }, null);
     };
-    if (api_isStateNode(ns)) {
-        const ndecls = ns[decls];
-        if (ast_hasProperty(ndecls, node.name)) {
-            return ndecls[node.name];
-        }
-        switch (ns.type) {
-            case "ClassDeclaration":
-                if (!isStatic) {
-                    return superChain(ns) || superChainScopes(ns) || false;
-                }
-            // fall through
-            case "ModuleDeclaration":
-                return lookupInContext(ns) || false;
-        }
+    const ndecls = ns[decls];
+    if (ast_hasProperty(ndecls, node.name)) {
+        return ndecls[node.name];
+    }
+    switch (ns.type) {
+        case "ClassDeclaration":
+            if (!isStatic) {
+                return superChain(ns) || superChainScopes(ns) || false;
+            }
+        // fall through
+        case "ModuleDeclaration":
+            return lookupInContext(ns) || false;
     }
     return null;
 }
@@ -3922,6 +4563,13 @@ function sameLookupDefinition(a, b) {
 function api_sameLookupResult(a, b) {
     return (0,external_util_cjs_namespaceObject.sameArrays)(a, b, sameLookupDefinition);
 }
+function api_isLookupCandidate(node) {
+    return node.computed
+        ? node.property.type === "UnaryExpression" &&
+            node.property.operator === ":" &&
+            node.property.argument
+        : node.property.type === "Identifier" && node.property;
+}
 /**
  *
  * @param state    - The ProgramState
@@ -3942,9 +4590,9 @@ function lookup(state, decls, node, name, maybeStack, nonlocal) {
     const stack = maybeStack || state.stack;
     switch (node.type) {
         case "MemberExpression": {
-            if (node.property.type != "Identifier" || node.computed)
+            const property = api_isLookupCandidate(node);
+            if (!property)
                 break;
-            const property = node.property;
             let result;
             if (node.object.type === "ThisExpression") {
                 [, result] = lookup(state, decls, node.property, name, stack, true);
@@ -3958,6 +4606,9 @@ function lookup(state, decls, node, name, maybeStack, nonlocal) {
                 result = results.reduce((current, lookupDef) => {
                     const items = lookupDef.results
                         .map((module) => {
+                        if (!api_isStateNode(module)) {
+                            return null;
+                        }
                         const res = checkOne(state, module, decls, property, false);
                         return res ? { parent: module, results: res } : null;
                     })
@@ -4042,6 +4693,8 @@ function lookup(state, decls, node, name, maybeStack, nonlocal) {
 }
 function api_collectNamespaces(ast, stateIn) {
     const state = (stateIn || {});
+    if (!state.nextExposed)
+        state.nextExposed = {};
     if (!state.index)
         state.index = {};
     if (!state.stack) {
@@ -4077,7 +4730,7 @@ function api_collectNamespaces(ast, stateIn) {
     state.stackClone = () => state.stack.map((elm) => elm.type === "ModuleDeclaration" || elm.type === "Program"
         ? { ...elm }
         : elm);
-    state.inType = false;
+    state.inType = 0;
     state.traverse = (root) => ast_traverseAst(root, (node) => {
         try {
             if (state.shouldExclude && state.shouldExclude(node)) {
@@ -4085,6 +4738,13 @@ function api_collectNamespaces(ast, stateIn) {
                 return [];
             }
             switch (node.type) {
+                case "UnaryExpression":
+                    if (node.operator === ":" && !state.inType) {
+                        state.nextExposed[node.argument.name] = true;
+                    }
+                    break;
+                case "AttributeList":
+                    return [];
                 case "Program":
                     if (state.stack.length != 1) {
                         throw new Error("Unexpected stack length for Program node");
@@ -4093,7 +4753,7 @@ function api_collectNamespaces(ast, stateIn) {
                     break;
                 case "TypeSpecList":
                 case "TypeSpecPart":
-                    state.inType = true;
+                    state.inType++;
                     break;
                 case "ImportModule":
                 case "Using": {
@@ -4139,6 +4799,16 @@ function api_collectNamespaces(ast, stateIn) {
                         });
                     }
                     break;
+                case "ForStatement":
+                    if (node.init && node.init.type === "VariableDeclaration") {
+                        state.stack.push({
+                            type: "BlockStatement",
+                            fullName: undefined,
+                            name: undefined,
+                            node: node,
+                        });
+                    }
+                    break;
                 case "BlockStatement": {
                     const [parent] = state.stack.slice(-1);
                     if (parent.node === node ||
@@ -4205,15 +4875,17 @@ function api_collectNamespaces(ast, stateIn) {
                 // an EnumDeclaration doesn't create a scope, but
                 // it does create a type (if it has a name)
                 case "EnumDeclaration": {
-                    if (!node.id)
+                    if (!node.id) {
+                        state.inType++;
                         break;
+                    }
                     const [parent] = state.stack.slice(-1);
                     const name = (parent.fullName + "." + node.id.name).replace(/^\$\./, "");
                     node.body.members.forEach((m) => (("init" in m ? m.init : m).enumType = name));
                 }
                 // fall through
                 case "TypedefDeclaration": {
-                    state.inType = true;
+                    state.inType++;
                     const name = node.id.name;
                     const [parent] = state.stack.slice(-1);
                     if (!parent.type_decls)
@@ -4266,13 +4938,21 @@ function api_collectNamespaces(ast, stateIn) {
                     break;
                 }
                 case "EnumStringBody": {
-                    state.inType = false;
+                    if (state.inType !== 1) {
+                        throw new Error(`Expected inType to be 1 at EnumStringBody. Got ${state.inType}.`);
+                    }
+                    state.inType--;
                     const [parent] = state.stack.slice(-1);
                     const values = parent.decls || (parent.decls = {});
                     let prev = -1;
                     node.members.forEach((m, i) => {
                         if (m.type == "Identifier") {
-                            prev += 1;
+                            if (typeof prev === "bigint") {
+                                prev += 1n;
+                            }
+                            else {
+                                prev += 1;
+                            }
                             m = node.members[i] = {
                                 type: "EnumStringMember",
                                 loc: m.loc,
@@ -4282,7 +4962,7 @@ function api_collectNamespaces(ast, stateIn) {
                                 init: {
                                     type: "Literal",
                                     value: prev,
-                                    raw: prev.toString(),
+                                    raw: prev.toString() + (typeof prev === "bigint" ? "l" : ""),
                                     enumType: m.enumType,
                                     loc: m.loc,
                                     start: m.start,
@@ -4334,22 +5014,22 @@ function api_collectNamespaces(ast, stateIn) {
                 if (state.post)
                     ret = state.post(node, state);
                 switch (type) {
-                    // Don't clear inType for TypeSpecPart, since they
-                    // generally occur in TypeSpecLists. But do clear it for
-                    // SizedArrayExpression, since thats the only place they
-                    // happen on their own.
-                    case "SizedArrayExpression":
+                    case "TypeSpecPart":
                     case "TypeSpecList":
                     case "TypedefDeclaration":
                     case "EnumDeclaration":
-                        state.inType = false;
+                        state.inType--;
                         break;
                     case "EnumStringBody":
-                        state.inType = true;
+                        state.inType++;
                         break;
                 }
                 const [parent] = state.stack.slice(-1);
                 if (parent.node === node ||
+                    // The pre function might cause node.body to be skipped,
+                    // so we need to check here, just in case.
+                    // (this actually happens with prettier-extenison-monkeyc's
+                    // findItemsByRange)
                     (node.type === "CatchClause" && parent.node === node.body)) {
                     delete parent.usings;
                     delete parent.imports;
@@ -4368,6 +5048,9 @@ function api_collectNamespaces(ast, stateIn) {
         }
     });
     state.traverse(ast);
+    if (state.inType) {
+        throw new Error(`inType was non-zero on exit: ${state.inType}`);
+    }
     if (state.stack.length != 1) {
         throw new Error("Invalid AST!");
     }
@@ -4402,7 +5085,7 @@ function api_formatAst(node, monkeyCSource = null) {
     // json. The parser knows to just treat the last line of the input
     // as the ast itself, and the printers will find what they're
     // looking for in the source.
-    const source = (monkeyCSource || "") + "\n" + JSON.stringify(node);
+    const source = (monkeyCSource || "") + "\n" + (0,prettier_plugin_monkeyc_namespaceObject.serializeMonkeyC)(node);
     return external_prettier_namespaceObject.format(source, {
         parser: "monkeyc-json",
         plugins: [(prettier_plugin_monkeyc_default())],
@@ -4489,6 +5172,36 @@ function findUsingForNode(state, stack, i, node, isType) {
     }
     return null;
 }
+const invokeInfo = {};
+const toyboxFnInfo = {};
+function api_getApiFunctionInfo(func) {
+    if (func.fullName === "$.Toybox.Lang.Method.invoke" ||
+        (func.node.params &&
+            func.node.params.some((param) => param.type === "BinaryExpression" &&
+                param.right.ts.some((tsp) => tsp.type === "TypeSpecPart" && tsp.callspec)))) {
+        if (!invokeInfo.calledFuncs) {
+            invokeInfo.modifiedDecls = new Set();
+            invokeInfo.calledFuncs = new Set();
+            invokeInfo.callsExposed = true;
+        }
+        if (func.name === "initialize") {
+            const top = func.stack[func.stack.length - 1];
+            if (top.type === "ClassDeclaration") {
+                top.hasInvoke = true;
+            }
+        }
+        return invokeInfo;
+    }
+    if (!toyboxFnInfo.calledFuncs) {
+        toyboxFnInfo.modifiedDecls = new Set();
+        toyboxFnInfo.calledFuncs = new Set();
+        toyboxFnInfo.resolvedDecls = new Set();
+    }
+    return toyboxFnInfo;
+}
+function api_markInvokeClassMethod(func) {
+    func.info = invokeInfo;
+}
 
 })();