redscript-mc 2.0.0 → 2.1.1

package/dist/src2/emit/compile.js

@@ -1,80 +0,0 @@
-"use strict";
-/**
- * Top-level compile function for the v2 pipeline.
- *
- * Pipeline: source → Lexer → Parser → HIR → MIR → optimize → LIR → emit
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.compile = compile;
-const lexer_1 = require("../../src/lexer");
-const parser_1 = require("../../src/parser");
-const compile_1 = require("../../src/compile");
-const lower_1 = require("../hir/lower");
-const lower_2 = require("../mir/lower");
-const pipeline_1 = require("../optimizer/pipeline");
-const lower_3 = require("../lir/lower");
-const index_1 = require("./index");
-function compile(source, options = {}) {
-    const { namespace = 'redscript', filePath } = options;
-    const warnings = [];
-    // Preprocess: resolve import directives, merge imported sources
-    const preprocessed = (0, compile_1.preprocessSourceWithMetadata)(source, { filePath });
-    const processedSource = preprocessed.source;
-    // Stage 1: Lex + Parse → AST
-    const lexer = new lexer_1.Lexer(processedSource);
-    const tokens = lexer.tokenize();
-    const parser = new parser_1.Parser(tokens, processedSource, filePath);
-    const ast = parser.parse(namespace);
-    // Merge library imports (files with `module library;`) into AST
-    for (const li of preprocessed.libraryImports ?? []) {
-        const libPreprocessed = (0, compile_1.preprocessSourceWithMetadata)(li.source, { filePath: li.filePath });
-        const libTokens = new lexer_1.Lexer(libPreprocessed.source, li.filePath).tokenize();
-        const libAst = new parser_1.Parser(libTokens, libPreprocessed.source, li.filePath).parse(namespace);
-        for (const fn of libAst.declarations)
-            fn.isLibraryFn = true;
-        ast.declarations.push(...libAst.declarations);
-        ast.structs.push(...libAst.structs);
-        ast.implBlocks.push(...libAst.implBlocks);
-        ast.enums.push(...libAst.enums);
-        ast.consts.push(...libAst.consts);
-        ast.globals.push(...libAst.globals);
-    }
-    // Merge librarySources (v1 compat: inline library strings) before HIR
-    if (options.librarySources) {
-        for (const libSrc of options.librarySources) {
-            const libTokens = new lexer_1.Lexer(libSrc).tokenize();
-            const libAst = new parser_1.Parser(libTokens, libSrc).parse(namespace);
-            for (const fn of libAst.declarations)
-                fn.isLibraryFn = true;
-            ast.declarations.push(...libAst.declarations);
-            ast.structs.push(...libAst.structs);
-            ast.implBlocks.push(...libAst.implBlocks);
-            ast.enums.push(...libAst.enums);
-            ast.consts.push(...libAst.consts);
-            ast.globals.push(...libAst.globals);
-        }
-    }
-    // Stage 2: AST → HIR
-    const hir = (0, lower_1.lowerToHIR)(ast);
-    // Extract @tick and @load functions from HIR (before decorator info is lost)
-    const tickFunctions = [];
-    const loadFunctions = [];
-    for (const fn of hir.functions) {
-        for (const dec of fn.decorators) {
-            if (dec.name === 'tick')
-                tickFunctions.push(fn.name);
-            if (dec.name === 'load')
-                loadFunctions.push(fn.name);
-        }
-    }
-    // Stage 3: HIR → MIR
-    const mir = (0, lower_2.lowerToMIR)(hir);
-    // Stage 4: MIR optimization
-    const mirOpt = (0, pipeline_1.optimizeModule)(mir);
-    // Stage 5: MIR → LIR
-    const lir = (0, lower_3.lowerToLIR)(mirOpt);
-    // Stage 7: LIR → .mcfunction
-    const files = (0, index_1.emit)(lir, { namespace, tickFunctions, loadFunctions });
-    return { files, warnings, success: true };
-}
-//# sourceMappingURL=compile.js.map

package/dist/src2/optimizer/dce.d.ts

@@ -1,8 +0,0 @@
-/**
- * Dead Code Elimination — MIR optimization pass.
- *
- * 1. Removes definitions of temps that are never used anywhere in the function.
- * 2. Removes unreachable blocks (no predecessors and not the entry block).
- */
-import type { MIRFunction } from '../mir/types';
-export declare function dce(fn: MIRFunction): MIRFunction;

package/dist/src2/optimizer/dce.js

@@ -1,155 +0,0 @@
-"use strict";
-/**
- * Dead Code Elimination — MIR optimization pass.
- *
- * 1. Removes definitions of temps that are never used anywhere in the function.
- * 2. Removes unreachable blocks (no predecessors and not the entry block).
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.dce = dce;
-function dce(fn) {
-    // Phase 1: Remove unreachable blocks
-    let blocks = removeUnreachable(fn);
-    // Phase 2: Remove unused temp definitions
-    blocks = removeDeadDefs(fn.params, blocks);
-    // Phase 3: Recompute preds after block removal
-    blocks = recomputePreds(blocks);
-    return { ...fn, blocks };
-}
-function removeUnreachable(fn) {
-    const reachable = new Set();
-    const queue = [fn.entry];
-    const blockMap = new Map(fn.blocks.map(b => [b.id, b]));
-    while (queue.length > 0) {
-        const id = queue.shift();
-        if (reachable.has(id))
-            continue;
-        reachable.add(id);
-        const block = blockMap.get(id);
-        if (block) {
-            for (const target of getTermTargets(block.term)) {
-                if (!reachable.has(target))
-                    queue.push(target);
-            }
-        }
-    }
-    return fn.blocks.filter(b => reachable.has(b.id));
-}
-function removeDeadDefs(params, blocks) {
-    // Collect all used temps across the entire function
-    const used = new Set();
-    for (const block of blocks) {
-        for (const instr of block.instrs) {
-            for (const t of getUsedTemps(instr))
-                used.add(t);
-        }
-        for (const t of getUsedTemps(block.term))
-            used.add(t);
-    }
-    // Remove instructions whose dst is never used, unless they have side effects
-    return blocks.map(block => ({
-        ...block,
-        instrs: block.instrs.filter(instr => {
-            const dst = getDst(instr);
-            if (dst === null)
-                return true; // no dst → keep (side-effectful)
-            if (hasSideEffects(instr))
-                return true;
-            return used.has(dst);
-        }),
-    }));
-}
-function recomputePreds(blocks) {
-    const predMap = new Map();
-    for (const b of blocks)
-        predMap.set(b.id, []);
-    for (const block of blocks) {
-        for (const target of getTermTargets(block.term)) {
-            const preds = predMap.get(target);
-            if (preds)
-                preds.push(block.id);
-        }
-    }
-    return blocks.map(b => ({ ...b, preds: predMap.get(b.id) ?? [] }));
-}
-function hasSideEffects(instr) {
-    if (instr.kind === 'call' || instr.kind === 'call_macro' ||
-        instr.kind === 'call_context' || instr.kind === 'nbt_write')
-        return true;
-    // Return field temps (__rf_) write to global return slots — not dead even if unused locally
-    const dst = getDst(instr);
-    if (dst && dst.startsWith('__rf_'))
-        return true;
-    return false;
-}
-function getTermTargets(term) {
-    switch (term.kind) {
-        case 'jump': return [term.target];
-        case 'branch': return [term.then, term.else];
-        default: return [];
-    }
-}
-function getDst(instr) {
-    switch (instr.kind) {
-        case 'const':
-        case 'copy':
-        case 'add':
-        case 'sub':
-        case 'mul':
-        case 'div':
-        case 'mod':
-        case 'neg':
-        case 'cmp':
-        case 'and':
-        case 'or':
-        case 'not':
-        case 'nbt_read':
-            return instr.dst;
-        case 'call':
-        case 'call_macro':
-            return instr.dst;
-        default:
-            return null;
-    }
-}
-function getUsedTemps(instr) {
-    const temps = [];
-    const addOp = (op) => { if (op.kind === 'temp')
-        temps.push(op.name); };
-    switch (instr.kind) {
-        case 'copy':
-        case 'neg':
-        case 'not':
-            addOp(instr.src);
-            break;
-        case 'add':
-        case 'sub':
-        case 'mul':
-        case 'div':
-        case 'mod':
-        case 'cmp':
-        case 'and':
-        case 'or':
-            addOp(instr.a);
-            addOp(instr.b);
-            break;
-        case 'nbt_write':
-            addOp(instr.src);
-            break;
-        case 'call':
-            instr.args.forEach(addOp);
-            break;
-        case 'call_macro':
-            instr.args.forEach(a => addOp(a.value));
-            break;
-        case 'branch':
-            addOp(instr.cond);
-            break;
-        case 'return':
-            if (instr.value)
-                addOp(instr.value);
-            break;
-    }
-    return temps;
-}
-//# sourceMappingURL=dce.js.map

package/dist/swap_test.map.json

@@ -1,14 +0,0 @@
-{
-  "$b": "a",
-  "$d": "b",
-  "$f": "p0",
-  "$g": "p1",
-  "$h": "x",
-  "$i": "y",
-  "$k": "tmp",
-  "$n": "m",
-  "$a": "const:0",
-  "$c": "internal:p0",
-  "$e": "internal:p1",
-  "$m": "internal:ret"
-}

package/dist/tsconfig.tsbuildinfo

@@ -1 +0,0 @@
-{"root":["../src/cli.ts","../src/compile.ts","../src/index.ts","../src/repl.ts","../src/__tests__/cli.test.ts","../src/__tests__/codegen.test.ts","../src/__tests__/compile-all.test.ts","../src/__tests__/dce.test.ts","../src/__tests__/diagnostics.test.ts","../src/__tests__/e2e.test.ts","../src/__tests__/entity-types.test.ts","../src/__tests__/formatter.test.ts","../src/__tests__/lexer.test.ts","../src/__tests__/lowering.test.ts","../src/__tests__/macro.test.ts","../src/__tests__/mc-integration.test.ts","../src/__tests__/mc-syntax.test.ts","../src/__tests__/nbt.test.ts","../src/__tests__/optimizer-advanced.test.ts","../src/__tests__/optimizer.test.ts","../src/__tests__/parser.test.ts","../src/__tests__/repl.test.ts","../src/__tests__/runtime.test.ts","../src/__tests__/stdlib-advanced.test.ts","../src/__tests__/stdlib-bigint.test.ts","../src/__tests__/stdlib-math.test.ts","../src/__tests__/stdlib-vec.test.ts","../src/__tests__/structure-optimizer.test.ts","../src/__tests__/typechecker.test.ts","../src/__tests__/var-allocator.test.ts","../src/ast/types.ts","../src/builtins/metadata.ts","../src/codegen/var-allocator.ts","../src/codegen/cmdblock/index.ts","../src/codegen/mcfunction/index.ts","../src/codegen/structure/index.ts","../src/diagnostics/index.ts","../src/events/types.ts","../src/formatter/index.ts","../src/ir/builder.ts","../src/ir/types.ts","../src/lexer/index.ts","../src/lowering/index.ts","../src/mc-test/client.ts","../src/mc-test/runner.ts","../src/mc-test/setup.ts","../src/mc-validator/index.ts","../src/nbt/index.ts","../src/optimizer/commands.ts","../src/optimizer/dce.ts","../src/optimizer/passes.ts","../src/optimizer/structure.ts","../src/parser/index.ts","../src/runtime/index.ts","../src/typechecker/index.ts","../src/types/entity-hierarchy.ts","../src2/__tests__/e2e/basic.test.ts","../src2/__tests__/e2e/macros.test.ts","../src2/__tests__/e2e/migrate.test.ts","../src2/__tests__/hir/desugar.test.ts","../src2/__tests__/lir/lower.test.ts","../src2/__tests__/lir/types.test.ts","../src2/__tests__/lir/verify.test.ts","../src2/__tests__/mir/arithmetic.test.ts","../src2/__tests__/mir/control-flow.test.ts","../src2/__tests__/mir/verify.test.ts","../src2/__tests__/optimizer/block_merge.test.ts","../src2/__tests__/optimizer/branch_simplify.test.ts","../src2/__tests__/optimizer/constant_fold.test.ts","../src2/__tests__/optimizer/copy_prop.test.ts","../src2/__tests__/optimizer/dce.test.ts","../src2/__tests__/optimizer/pipeline.test.ts","../src2/emit/compile.ts","../src2/emit/index.ts","../src2/hir/lower.ts","../src2/hir/types.ts","../src2/lir/lower.ts","../src2/lir/types.ts","../src2/lir/verify.ts","../src2/mir/lower.ts","../src2/mir/macro.ts","../src2/mir/types.ts","../src2/mir/verify.ts","../src2/optimizer/block_merge.ts","../src2/optimizer/branch_simplify.ts","../src2/optimizer/constant_fold.ts","../src2/optimizer/copy_prop.ts","../src2/optimizer/dce.ts","../src2/optimizer/pipeline.ts"],"version":"5.9.3"}

package/dist/typechecker/index.d.ts

@@ -1,61 +0,0 @@
-/**
- * RedScript Type Checker
- *
- * Performs basic type checking between Parser and Lowering phases.
- * Collects errors but doesn't block compilation (warn mode).
- */
-import type { Program } from '../ast/types';
-import { DiagnosticError } from '../diagnostics';
-export declare class TypeChecker {
-    private collector;
-    private functions;
-    private implMethods;
-    private structs;
-    private enums;
-    private consts;
-    private currentFn;
-    private currentReturnType;
-    private scope;
-    private selfTypeStack;
-    private readonly richTextBuiltins;
-    constructor(source?: string, filePath?: string);
-    private getNodeLocation;
-    private report;
-    /**
-     * Type check a program. Returns collected errors.
-     */
-    check(program: Program): DiagnosticError[];
-    private checkFunction;
-    private checkFunctionDecorators;
-    private checkBlock;
-    private checkStmt;
-    private checkLetStmt;
-    private checkReturnStmt;
-    private checkExpr;
-    private checkCallExpr;
-    private checkRichTextBuiltinCall;
-    private checkInvokeExpr;
-    private checkFunctionCallArgs;
-    private checkTpCall;
-    private checkMemberExpr;
-    private checkStaticCallExpr;
-    private checkLambdaExpr;
-    private checkIfBranches;
-    private getThenBranchNarrowing;
-    private inferType;
-    private inferLambdaType;
-    /** Infer entity type from a selector */
-    private inferEntityTypeFromSelector;
-    private resolveInstanceMethod;
-    /** Check if childType is a subtype of parentType */
-    private isEntitySubtype;
-    /** Push a new self type context */
-    private pushSelfType;
-    /** Pop self type context */
-    private popSelfType;
-    /** Get current @s type */
-    private getCurrentSelfType;
-    private typesMatch;
-    private typeToString;
-    private normalizeType;
-}