13bd3c85ea
Covers List(Move).items[i] -> Move via the LSP's flat-import struct_types merge (pre-registered, not self-declared) and with realistic methods/cross-referencing fields. Confirmed end-to-end against the real binary: the inlay hint for 'm := legal.items[i]' now resolves to Move.
1950 lines
79 KiB
Zig
1950 lines
79 KiB
Zig
const std = @import("std");
|
|
const ast = @import("ast.zig");
|
|
const Node = ast.Node;
|
|
const Span = ast.Span;
|
|
const Type = @import("types.zig").Type;
|
|
const errors = @import("errors.zig");
|
|
const Diagnostic = errors.Diagnostic;
|
|
|
|
fn baseName(name: []const u8) []const u8 {
|
|
return if (std.mem.lastIndexOfScalar(u8, name, '.')) |idx| name[idx + 1 ..] else name;
|
|
}
|
|
|
|
pub const SymbolKind = enum {
|
|
variable,
|
|
constant,
|
|
function,
|
|
enum_type,
|
|
struct_type,
|
|
protocol_type,
|
|
type_alias,
|
|
param,
|
|
namespace,
|
|
};
|
|
|
|
pub const Symbol = struct {
|
|
name: []const u8,
|
|
kind: SymbolKind,
|
|
ty: ?Type,
|
|
def_span: Span,
|
|
scope_depth: u32,
|
|
/// null = defined in the current file. Non-null = absolute path of the origin file.
|
|
origin: ?[]const u8 = null,
|
|
};
|
|
|
|
pub const Reference = struct {
|
|
span: Span,
|
|
symbol_index: u32,
|
|
};
|
|
|
|
pub const FnSignature = struct {
|
|
param_types: []const Type,
|
|
return_type: Type,
|
|
is_variadic: bool = false,
|
|
};
|
|
|
|
pub const StructTypeInfo = struct {
|
|
field_names: []const []const u8,
|
|
field_types: []const Type,
|
|
type_params: []const []const u8 = &.{},
|
|
};
|
|
|
|
pub const TypeMap = std.AutoHashMap(*const Node, Type);
|
|
|
|
pub const SemaResult = struct {
|
|
symbols: []const Symbol,
|
|
references: []const Reference,
|
|
diagnostics: []const Diagnostic,
|
|
fn_signatures: std.StringHashMap(FnSignature),
|
|
struct_types: std.StringHashMap(StructTypeInfo),
|
|
enum_types: std.StringHashMap([]const []const u8),
|
|
type_aliases: std.StringHashMap([]const u8),
|
|
type_map: TypeMap,
|
|
};
|
|
|
|
pub const Analyzer = struct {
|
|
allocator: std.mem.Allocator,
|
|
symbols: std.ArrayList(Symbol),
|
|
references: std.ArrayList(Reference),
|
|
diagnostics: std.ArrayList(Diagnostic),
|
|
scope_depth: u32,
|
|
/// Stack of symbol counts at each scope entry, for popScope cleanup.
|
|
scope_starts: std.ArrayList(u32),
|
|
/// Hash index: name → list of indices into symbols array for O(1) lookup
|
|
symbol_index: std.StringHashMap(std.ArrayList(u32)),
|
|
// Type registries
|
|
fn_signatures: std.StringHashMap(FnSignature),
|
|
struct_types: std.StringHashMap(StructTypeInfo),
|
|
enum_types: std.StringHashMap([]const []const u8),
|
|
type_aliases: std.StringHashMap([]const u8),
|
|
type_map: TypeMap,
|
|
|
|
pub fn init(allocator: std.mem.Allocator) Analyzer {
|
|
return .{
|
|
.allocator = allocator,
|
|
.symbols = std.ArrayList(Symbol).empty,
|
|
.references = std.ArrayList(Reference).empty,
|
|
.diagnostics = std.ArrayList(Diagnostic).empty,
|
|
.scope_depth = 0,
|
|
.scope_starts = std.ArrayList(u32).empty,
|
|
.symbol_index = std.StringHashMap(std.ArrayList(u32)).init(allocator),
|
|
.fn_signatures = std.StringHashMap(FnSignature).init(allocator),
|
|
.struct_types = std.StringHashMap(StructTypeInfo).init(allocator),
|
|
.enum_types = std.StringHashMap([]const []const u8).init(allocator),
|
|
.type_aliases = std.StringHashMap([]const u8).init(allocator),
|
|
.type_map = TypeMap.init(allocator),
|
|
};
|
|
}
|
|
|
|
pub fn analyze(self: *Analyzer, root: *Node) !SemaResult {
|
|
if (root.data != .root) return error.InvalidRoot;
|
|
|
|
// Pass 1: Register all top-level declarations so forward references work.
|
|
for (root.data.root.decls) |decl| {
|
|
try self.registerTopLevelDecl(decl);
|
|
}
|
|
|
|
// Pass 2: Analyze bodies (all top-level names are now in scope).
|
|
for (root.data.root.decls) |decl| {
|
|
try self.analyzeTopLevelDecl(decl);
|
|
}
|
|
|
|
return .{
|
|
.symbols = try self.symbols.toOwnedSlice(self.allocator),
|
|
.references = try self.references.toOwnedSlice(self.allocator),
|
|
.diagnostics = try self.diagnostics.toOwnedSlice(self.allocator),
|
|
.fn_signatures = self.fn_signatures,
|
|
.struct_types = self.struct_types,
|
|
.enum_types = self.enum_types,
|
|
.type_aliases = self.type_aliases,
|
|
.type_map = self.type_map,
|
|
};
|
|
}
|
|
|
|
/// Pass 1: register the name/kind/type of a top-level declaration without
|
|
/// analysing its body or value expression.
|
|
fn registerTopLevelDecl(self: *Analyzer, node: *Node) !void {
|
|
try self.registerTopLevelDeclPrefixed(node, null);
|
|
}
|
|
|
|
fn registerTopLevelDeclPrefixed(self: *Analyzer, node: *Node, ns_prefix: ?[]const u8) !void {
|
|
switch (node.data) {
|
|
.fn_decl => |fd| {
|
|
const ret_ty = resolveReturnType(fd) orelse
|
|
if (fd.is_arrow) self.inferFnReturnType(fd.params, fd.body) else null;
|
|
try self.addSymbol(fd.name, .function, ret_ty, node.span);
|
|
// Populate fn_signatures registry
|
|
var param_types = std.ArrayList(Type).empty;
|
|
var has_variadic = false;
|
|
for (fd.params) |param| {
|
|
const pt = Type.fromTypeExpr(param.type_expr) orelse Type.unresolved;
|
|
if (param.is_variadic) {
|
|
has_variadic = true;
|
|
// Variadic param becomes a slice type
|
|
const elem_name = switch (param.type_expr.data) {
|
|
.type_expr => |te| te.name,
|
|
// `..xs: []T` — the element is T, not a guessed s32.
|
|
.slice_type_expr => |st| if (st.element_type.data == .type_expr) st.element_type.data.type_expr.name else "<unresolved>",
|
|
else => "<unresolved>",
|
|
};
|
|
try param_types.append(self.allocator, .{ .slice_type = .{ .element_name = elem_name } });
|
|
} else {
|
|
try param_types.append(self.allocator, pt);
|
|
}
|
|
}
|
|
const key = if (ns_prefix) |pfx|
|
|
try std.fmt.allocPrint(self.allocator, "{s}.{s}", .{ pfx, fd.name })
|
|
else
|
|
fd.name;
|
|
try self.fn_signatures.put(key, .{
|
|
.param_types = try param_types.toOwnedSlice(self.allocator),
|
|
.return_type = ret_ty orelse .void_type,
|
|
.is_variadic = has_variadic,
|
|
});
|
|
},
|
|
.const_decl => |cd| {
|
|
const ty = self.resolveTypeAnnotation(cd.type_annotation) orelse inferValueType(cd.value);
|
|
const kind = classifyConstDecl(cd);
|
|
try self.addSymbol(cd.name, kind, ty, node.span);
|
|
// Populate type_aliases registry
|
|
if (cd.value.data == .type_expr) {
|
|
try self.type_aliases.put(cd.name, cd.value.data.type_expr.name);
|
|
}
|
|
// Lambda as function
|
|
if (cd.value.data == .lambda) {
|
|
const lam = cd.value.data.lambda;
|
|
var param_types = std.ArrayList(Type).empty;
|
|
for (lam.params) |param| {
|
|
const pt = Type.fromTypeExpr(param.type_expr) orelse Type.unresolved;
|
|
try param_types.append(self.allocator, pt);
|
|
}
|
|
const ret = if (lam.return_type) |rt|
|
|
Type.fromTypeExpr(rt) orelse .void_type
|
|
else
|
|
self.inferFnReturnType(lam.params, lam.body) orelse .void_type;
|
|
const key = if (ns_prefix) |pfx|
|
|
try std.fmt.allocPrint(self.allocator, "{s}.{s}", .{ pfx, cd.name })
|
|
else
|
|
cd.name;
|
|
try self.fn_signatures.put(key, .{
|
|
.param_types = try param_types.toOwnedSlice(self.allocator),
|
|
.return_type = ret,
|
|
});
|
|
}
|
|
},
|
|
.var_decl => |vd| {
|
|
const ty = self.resolveTypeAnnotation(vd.type_annotation);
|
|
try self.addSymbol(vd.name, .variable, ty, node.span);
|
|
},
|
|
.enum_decl => |ed| {
|
|
if (ed.variant_types.len > 0) {
|
|
// Tagged enum with payloads
|
|
try self.addSymbol(ed.name, .enum_type, .{ .union_type = ed.name }, node.span);
|
|
} else {
|
|
// Payload-less enum
|
|
try self.addSymbol(ed.name, .enum_type, .{ .enum_type = ed.name }, node.span);
|
|
try self.enum_types.put(ed.name, ed.variant_names);
|
|
}
|
|
},
|
|
.struct_decl => |sd| {
|
|
try self.addSymbol(sd.name, .struct_type, .{ .struct_type = sd.name }, node.span);
|
|
var tp_names = std.ArrayList([]const u8).empty;
|
|
for (sd.type_params) |p| {
|
|
try tp_names.append(self.allocator, p.name);
|
|
}
|
|
const tp_slice = try tp_names.toOwnedSlice(self.allocator);
|
|
// Populate struct_types registry, expanding #using entries
|
|
if (sd.using_entries.len > 0) {
|
|
var all_names = std.ArrayList([]const u8).empty;
|
|
var all_types = std.ArrayList(Type).empty;
|
|
var using_idx: usize = 0;
|
|
for (0..sd.field_names.len + 1) |i| {
|
|
while (using_idx < sd.using_entries.len and
|
|
sd.using_entries[using_idx].insert_index == i)
|
|
{
|
|
const entry = sd.using_entries[using_idx];
|
|
if (self.struct_types.get(entry.type_name)) |used| {
|
|
for (used.field_names, 0..) |fname, fi| {
|
|
try all_names.append(self.allocator, fname);
|
|
try all_types.append(self.allocator, used.field_types[fi]);
|
|
}
|
|
}
|
|
using_idx += 1;
|
|
}
|
|
if (i < sd.field_names.len) {
|
|
try all_names.append(self.allocator, sd.field_names[i]);
|
|
const resolved = self.fieldType(sd.field_types[i]);
|
|
try all_types.append(self.allocator, resolved);
|
|
}
|
|
}
|
|
try self.struct_types.put(sd.name, .{
|
|
.field_names = try all_names.toOwnedSlice(self.allocator),
|
|
.field_types = try all_types.toOwnedSlice(self.allocator),
|
|
.type_params = tp_slice,
|
|
});
|
|
} else {
|
|
var field_types = std.ArrayList(Type).empty;
|
|
for (sd.field_types) |ft| {
|
|
const resolved = self.fieldType(ft);
|
|
try field_types.append(self.allocator, resolved);
|
|
}
|
|
try self.struct_types.put(sd.name, .{
|
|
.field_names = sd.field_names,
|
|
.field_types = try field_types.toOwnedSlice(self.allocator),
|
|
.type_params = tp_slice,
|
|
});
|
|
}
|
|
},
|
|
.union_decl => |ud| {
|
|
try self.addSymbol(ud.name, .enum_type, .{ .union_type = ud.name }, node.span);
|
|
},
|
|
.namespace_decl => |ns| {
|
|
try self.addSymbol(ns.name, .namespace, null, node.span);
|
|
// Recurse into namespace decls with qualified prefix (in own scope
|
|
// so inner names don't collide with flat imports of the same names)
|
|
try self.pushScope();
|
|
for (ns.decls) |d| {
|
|
try self.registerTopLevelDeclPrefixed(d, ns.name);
|
|
}
|
|
self.popScope();
|
|
},
|
|
.ufcs_alias => |ua| {
|
|
try self.addSymbol(ua.name, .function, null, node.span);
|
|
},
|
|
else => {},
|
|
}
|
|
}
|
|
|
|
/// Resolve a type annotation node to a Type.
|
|
/// Handles primitives, type_expr, array_type_expr, parameterized_type_expr,
|
|
/// type aliases, enum types, and struct types.
|
|
pub fn resolveTypeNode(self: *Analyzer, type_node: ?*Node) Type {
|
|
if (type_node) |tn| {
|
|
if (Type.fromTypeExpr(tn)) |t| return t;
|
|
// Array type: [N]T
|
|
if (tn.data == .array_type_expr) {
|
|
const ate = tn.data.array_type_expr;
|
|
const length: u32 = @intCast(ate.length.data.int_literal.value);
|
|
const elem_type = self.resolveTypeNode(ate.element_type);
|
|
const elem_name = elem_type.displayName(self.allocator) catch return .void_type;
|
|
return .{ .array_type = .{ .element_name = elem_name, .length = length } };
|
|
}
|
|
// Slice type: []T
|
|
if (tn.data == .slice_type_expr) {
|
|
const ste = tn.data.slice_type_expr;
|
|
const elem_type = self.resolveTypeNode(ste.element_type);
|
|
const elem_name = elem_type.displayName(self.allocator) catch return .void_type;
|
|
return .{ .slice_type = .{ .element_name = elem_name } };
|
|
}
|
|
// Optional type: ?T
|
|
if (tn.data == .optional_type_expr) {
|
|
const ote = tn.data.optional_type_expr;
|
|
const inner_type = self.resolveTypeNode(ote.inner_type);
|
|
const inner_name = inner_type.displayName(self.allocator) catch return .void_type;
|
|
return .{ .optional_type = .{ .child_name = inner_name } };
|
|
}
|
|
// Pointer type: *T
|
|
if (tn.data == .pointer_type_expr) {
|
|
const pte = tn.data.pointer_type_expr;
|
|
const pointee_type = self.resolveTypeNode(pte.pointee_type);
|
|
const pointee_name = pointee_type.displayName(self.allocator) catch return .void_type;
|
|
return .{ .pointer_type = .{ .pointee_name = pointee_name } };
|
|
}
|
|
// Many-pointer type: [*]T
|
|
if (tn.data == .many_pointer_type_expr) {
|
|
const mpte = tn.data.many_pointer_type_expr;
|
|
const elem_type = self.resolveTypeNode(mpte.element_type);
|
|
const elem_name = elem_type.displayName(self.allocator) catch return .void_type;
|
|
return .{ .many_pointer_type = .{ .element_name = elem_name } };
|
|
}
|
|
// Function pointer type: (ParamTypes) -> ReturnType
|
|
if (tn.data == .function_type_expr) {
|
|
const fte = tn.data.function_type_expr;
|
|
var param_types = std.ArrayList(Type).empty;
|
|
for (fte.param_types) |pt| {
|
|
param_types.append(self.allocator, self.resolveTypeNode(pt)) catch return .void_type;
|
|
}
|
|
const ret_ty = if (fte.return_type) |rt| self.resolveTypeNode(rt) else Type.void_type;
|
|
const ret_ptr = self.allocator.create(Type) catch return .void_type;
|
|
ret_ptr.* = ret_ty;
|
|
return .{ .function_type = .{
|
|
.param_types = param_types.toOwnedSlice(self.allocator) catch return .void_type,
|
|
.return_type = ret_ptr,
|
|
} };
|
|
}
|
|
// Sema does not resolve generics; codegen handles instantiation
|
|
if (tn.data == .parameterized_type_expr) {
|
|
return .void_type;
|
|
}
|
|
// type_expr or identifier — check aliases, enums, structs
|
|
if (tn.data == .type_expr or tn.data == .identifier) {
|
|
const name = if (tn.data == .type_expr) tn.data.type_expr.name else tn.data.identifier.name;
|
|
if (Type.fromName(name)) |t| return t;
|
|
if (self.type_aliases.get(name)) |target| {
|
|
if (Type.fromName(target)) |t| return t;
|
|
if (self.struct_types.contains(target)) return .{ .struct_type = target };
|
|
}
|
|
if (self.enum_types.contains(name)) return .{ .enum_type = name };
|
|
if (self.struct_types.contains(name)) return .{ .struct_type = name };
|
|
}
|
|
return .void_type;
|
|
}
|
|
return .void_type;
|
|
}
|
|
|
|
/// Resolve a bare type-name string against the registry (aliases, enums,
|
|
/// structs), falling back to primitive spellings. Unlike `Type.fromName`,
|
|
/// this knows user-defined types; returns `unresolved` when it can't place
|
|
/// the name.
|
|
fn resolveTypeNameStr(self: *Analyzer, name: []const u8) Type {
|
|
if (Type.fromName(name)) |t| return t;
|
|
if (self.type_aliases.get(name)) |target| {
|
|
if (Type.fromName(target)) |t| return t;
|
|
if (self.struct_types.contains(target)) return .{ .struct_type = target };
|
|
if (self.enum_types.contains(target)) return .{ .enum_type = target };
|
|
}
|
|
if (self.enum_types.contains(name)) return .{ .enum_type = name };
|
|
if (self.struct_types.contains(name)) return .{ .struct_type = name };
|
|
return Type.unresolved;
|
|
}
|
|
|
|
/// Extract the element/pointee name from a type-expr node, keeping generic
|
|
/// param names (`T`) intact for later substitution. Compound shapes fall
|
|
/// back to their spelled form.
|
|
fn typeExprName(self: *Analyzer, node: *Node) []const u8 {
|
|
return switch (node.data) {
|
|
.type_expr => |te| te.name,
|
|
.identifier => |id| id.name,
|
|
else => (self.resolveTypeNode(node)).displayName(self.allocator) catch "",
|
|
};
|
|
}
|
|
|
|
/// Resolve a struct field's declared type, preserving the raw element/
|
|
/// pointee name of pointer/slice shapes so generic params (`T`) survive
|
|
/// into `instantiateGeneric`'s substitution. Bare names resolve through the
|
|
/// registry; the element name is resolved lazily at index/field time.
|
|
fn fieldType(self: *Analyzer, node: *Node) Type {
|
|
return switch (node.data) {
|
|
.type_expr => |te| self.resolveTypeNameStr(te.name),
|
|
.identifier => |id| self.resolveTypeNameStr(id.name),
|
|
.many_pointer_type_expr => |mp| .{ .many_pointer_type = .{ .element_name = self.typeExprName(mp.element_type) } },
|
|
.pointer_type_expr => |p| .{ .pointer_type = .{ .pointee_name = self.typeExprName(p.pointee_type) } },
|
|
.slice_type_expr => |s| .{ .slice_type = .{ .element_name = self.typeExprName(s.element_type) } },
|
|
else => self.resolveTypeNode(node),
|
|
};
|
|
}
|
|
|
|
/// The type name an instantiation arg node carries (`Move` in
|
|
/// `List(Move)`). Null for non-nameable args (e.g. value params like `3`).
|
|
fn argTypeName(node: *const Node) ?[]const u8 {
|
|
return switch (node.data) {
|
|
.type_expr => |te| te.name,
|
|
.identifier => |id| id.name,
|
|
else => null,
|
|
};
|
|
}
|
|
|
|
/// Swap a single type name through a param→arg map (`T` → `Move`).
|
|
fn substName(name: []const u8, params: []const []const u8, args: []const []const u8) []const u8 {
|
|
for (params, 0..) |p, i| {
|
|
if (i < args.len and std.mem.eql(u8, p, name)) return args[i];
|
|
}
|
|
return name;
|
|
}
|
|
|
|
/// Substitute generic params in an already-resolved field type. Only the
|
|
/// name-carrying shapes need rewriting; the rest pass through.
|
|
fn substType(ty: Type, params: []const []const u8, args: []const []const u8) Type {
|
|
return switch (ty) {
|
|
.many_pointer_type => |i| .{ .many_pointer_type = .{ .element_name = substName(i.element_name, params, args) } },
|
|
.slice_type => |i| .{ .slice_type = .{ .element_name = substName(i.element_name, params, args) } },
|
|
.array_type => |i| .{ .array_type = .{ .length = i.length, .element_name = substName(i.element_name, params, args) } },
|
|
.pointer_type => |i| .{ .pointer_type = .{ .pointee_name = substName(i.pointee_name, params, args) } },
|
|
.struct_type => |n| .{ .struct_type = substName(n, params, args) },
|
|
else => ty,
|
|
};
|
|
}
|
|
|
|
/// Instantiate `base(args...)` as a monomorphized struct entry so field
|
|
/// access resolves the generic params (`List(Move).items` → `[*]Move`).
|
|
/// Returns the instance type, or null when `base` isn't a generic struct,
|
|
/// the arity mismatches, or an arg isn't nameable.
|
|
fn instantiateGeneric(self: *Analyzer, base: []const u8, arg_nodes: []const *Node) ?Type {
|
|
const info = self.struct_types.get(base) orelse return null;
|
|
if (info.type_params.len == 0 or arg_nodes.len != info.type_params.len) return null;
|
|
|
|
var args = std.ArrayList([]const u8).empty;
|
|
for (arg_nodes) |an| {
|
|
const nm = argTypeName(an) orelse return null;
|
|
args.append(self.allocator, nm) catch return null;
|
|
}
|
|
|
|
// Mangle "base(A,B)".
|
|
var name_buf = std.ArrayList(u8).empty;
|
|
name_buf.appendSlice(self.allocator, base) catch return null;
|
|
name_buf.append(self.allocator, '(') catch return null;
|
|
for (args.items, 0..) |a, i| {
|
|
if (i > 0) name_buf.append(self.allocator, ',') catch return null;
|
|
name_buf.appendSlice(self.allocator, a) catch return null;
|
|
}
|
|
name_buf.append(self.allocator, ')') catch return null;
|
|
const mangled = name_buf.toOwnedSlice(self.allocator) catch return null;
|
|
|
|
if (self.struct_types.contains(mangled)) return .{ .struct_type = mangled };
|
|
|
|
var new_fts = std.ArrayList(Type).empty;
|
|
for (info.field_types) |ft| {
|
|
new_fts.append(self.allocator, substType(ft, info.type_params, args.items)) catch return null;
|
|
}
|
|
self.struct_types.put(mangled, .{
|
|
.field_names = info.field_names,
|
|
.field_types = new_fts.toOwnedSlice(self.allocator) catch return null,
|
|
}) catch return null;
|
|
return .{ .struct_type = mangled };
|
|
}
|
|
|
|
/// Infer the type of an expression node without LLVM.
|
|
/// Uses fn_signatures for call return types, struct_types for field access,
|
|
/// symbols for identifier types, and Type.widen for arithmetic promotion.
|
|
pub fn inferExprType(self: *Analyzer, node: *const Node) Type {
|
|
return switch (node.data) {
|
|
.int_literal => Type.s(64),
|
|
.float_literal => .f32,
|
|
.bool_literal => .boolean,
|
|
.string_literal => .string_type,
|
|
.insert_expr => .void_type,
|
|
.comptime_expr => |ct| self.inferExprType(ct.expr),
|
|
.binary_op => |binop| {
|
|
switch (binop.op) {
|
|
.eq, .neq, .lt, .lte, .gt, .gte, .and_op, .or_op, .in_op => return .boolean,
|
|
else => {
|
|
const lhs_ty = self.inferExprType(binop.lhs);
|
|
const rhs_ty = self.inferExprType(binop.rhs);
|
|
return Type.widen(lhs_ty, rhs_ty);
|
|
},
|
|
}
|
|
},
|
|
.chained_comparison => .boolean,
|
|
.identifier => |ident| {
|
|
// Use symbol index for O(1) name lookup
|
|
if (self.symbol_index.get(ident.name)) |indices| {
|
|
var j = indices.items.len;
|
|
while (j > 0) {
|
|
j -= 1;
|
|
const sym = self.symbols.items[indices.items[j]];
|
|
if (sym.scope_depth <= self.scope_depth) {
|
|
return sym.ty orelse Type.unresolved;
|
|
}
|
|
}
|
|
}
|
|
return Type.unresolved;
|
|
},
|
|
.if_expr => |ie| {
|
|
return self.inferExprType(ie.then_branch);
|
|
},
|
|
.block => |blk| {
|
|
if (blk.stmts.len > 0) {
|
|
return self.inferExprType(blk.stmts[blk.stmts.len - 1]);
|
|
}
|
|
return .void_type;
|
|
},
|
|
.match_expr => |me| {
|
|
for (me.arms) |arm| {
|
|
if (!arm.is_break) return self.inferExprType(arm.body);
|
|
}
|
|
return .void_type;
|
|
},
|
|
.call => |call_node| {
|
|
const callee_name = self.resolveCalleeName(call_node) orelse return Type.unresolved;
|
|
// Check fn_signatures registry
|
|
if (self.fn_signatures.get(callee_name)) |sig| {
|
|
return sig.return_type;
|
|
}
|
|
// Built-in: sqrt/sin/cos returns same type as argument
|
|
const base = baseName(callee_name);
|
|
if (std.mem.eql(u8, base, "sqrt") or
|
|
std.mem.eql(u8, base, "sin") or
|
|
std.mem.eql(u8, base, "cos"))
|
|
{
|
|
if (call_node.args.len > 0) return self.inferExprType(call_node.args[0]);
|
|
return .f32;
|
|
}
|
|
return Type.unresolved;
|
|
},
|
|
.unary_op => |unop| {
|
|
return self.inferExprType(unop.operand);
|
|
},
|
|
.field_access => |fa| {
|
|
const obj_ty = self.inferExprType(fa.object);
|
|
if (obj_ty == .string_type) {
|
|
if (std.mem.eql(u8, fa.field, "len")) return Type.s(64);
|
|
if (std.mem.eql(u8, fa.field, "ptr")) return .string_type;
|
|
}
|
|
if (obj_ty.isStruct()) {
|
|
if (self.struct_types.get(obj_ty.struct_type)) |info| {
|
|
for (info.field_names, 0..) |fname, idx| {
|
|
if (std.mem.eql(u8, fname, fa.field)) {
|
|
return info.field_types[idx];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (obj_ty.isArray()) {
|
|
return Type.fromName(obj_ty.array_type.element_name) orelse Type.unresolved;
|
|
}
|
|
return Type.unresolved;
|
|
},
|
|
.index_expr => |ie| {
|
|
const obj_ty = self.inferExprType(ie.object);
|
|
if (obj_ty == .string_type) return Type.u(8);
|
|
if (obj_ty.isArray()) return self.resolveTypeNameStr(obj_ty.array_type.element_name);
|
|
if (obj_ty.isManyPointer()) return self.resolveTypeNameStr(obj_ty.many_pointer_type.element_name);
|
|
if (obj_ty.isSlice()) return self.resolveTypeNameStr(obj_ty.slice_type.element_name);
|
|
return Type.unresolved;
|
|
},
|
|
.slice_expr => |se| {
|
|
const obj_ty = self.inferExprType(se.object);
|
|
if (obj_ty == .string_type) return .string_type;
|
|
if (obj_ty.isArray()) return .{ .slice_type = .{ .element_name = obj_ty.array_type.element_name } };
|
|
if (obj_ty.isManyPointer()) return .{ .slice_type = .{ .element_name = obj_ty.many_pointer_type.element_name } };
|
|
if (obj_ty.isSlice()) return obj_ty;
|
|
return .void_type;
|
|
},
|
|
.while_expr => .void_type,
|
|
.for_expr => .void_type,
|
|
.spread_expr => .void_type,
|
|
.break_expr => .void_type,
|
|
.continue_expr => .void_type,
|
|
.enum_literal => .{ .enum_type = "" },
|
|
.struct_literal => |sl| {
|
|
if (sl.struct_name) |name| {
|
|
if (self.struct_types.contains(name)) return .{ .struct_type = name };
|
|
if (self.type_aliases.get(name)) |target| {
|
|
if (self.struct_types.contains(target)) return .{ .struct_type = target };
|
|
}
|
|
} else if (sl.type_expr) |te| {
|
|
// Handle parameterized struct: List(s32).{} parses as call node
|
|
if (te.data == .call) {
|
|
if (self.resolveCalleeName(te.data.call)) |callee| {
|
|
if (self.instantiateGeneric(callee, te.data.call.args)) |inst| return inst;
|
|
if (self.struct_types.contains(callee)) return .{ .struct_type = callee };
|
|
}
|
|
}
|
|
return self.inferExprType(te);
|
|
}
|
|
return .void_type;
|
|
},
|
|
.force_unwrap => |fu| {
|
|
const opt_ty = self.inferExprType(fu.operand);
|
|
if (opt_ty.isOptional()) return Type.fromName(opt_ty.optional_type.child_name) orelse .void_type;
|
|
return .void_type;
|
|
},
|
|
.null_coalesce => |nc| {
|
|
const opt_ty = self.inferExprType(nc.lhs);
|
|
if (opt_ty.isOptional()) return Type.fromName(opt_ty.optional_type.child_name) orelse .void_type;
|
|
return self.inferExprType(nc.rhs);
|
|
},
|
|
.deref_expr => |de| {
|
|
const ptr_ty = self.inferExprType(de.operand);
|
|
if (ptr_ty.isPointer()) return ptr_ty.pointerPointeeType() orelse .void_type;
|
|
return .void_type;
|
|
},
|
|
.null_literal => .void_type,
|
|
.array_literal => .void_type,
|
|
.type_expr => |te| .{ .meta_type = .{ .name = te.name } },
|
|
.parameterized_type_expr => |pte| {
|
|
if (self.instantiateGeneric(pte.name, pte.args)) |inst| return inst;
|
|
if (self.struct_types.contains(pte.name)) return .{ .struct_type = pte.name };
|
|
return .void_type;
|
|
},
|
|
else => .void_type,
|
|
};
|
|
}
|
|
|
|
/// Resolve the callee name from a call node (handles identifiers and field_access).
|
|
fn resolveCalleeName(self: *Analyzer, call_node: ast.Call) ?[]const u8 {
|
|
_ = self;
|
|
if (call_node.callee.data == .identifier) {
|
|
return call_node.callee.data.identifier.name;
|
|
}
|
|
if (call_node.callee.data == .field_access) {
|
|
const fa = call_node.callee.data.field_access;
|
|
if (fa.object.data == .identifier) {
|
|
// Return qualified name — caller will look up in fn_signatures
|
|
// We can't allocate here easily, so just return the field name
|
|
// and let the caller try both qualified and unqualified
|
|
return fa.field;
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
/// Pass 2: analyse the body/value of a top-level declaration.
|
|
/// The symbol itself was already registered in Pass 1.
|
|
fn analyzeTopLevelDecl(self: *Analyzer, node: *Node) !void {
|
|
switch (node.data) {
|
|
.fn_decl => |fd| {
|
|
try self.pushScope();
|
|
try self.analyzeParams(fd.params);
|
|
try self.analyzeNode(fd.body);
|
|
self.popScope();
|
|
},
|
|
.const_decl => |cd| {
|
|
try self.analyzeNode(cd.value);
|
|
},
|
|
.var_decl => |vd| {
|
|
if (vd.value) |val| {
|
|
try self.analyzeNode(val);
|
|
}
|
|
},
|
|
.enum_decl, .struct_decl, .union_decl, .array_type_expr, .slice_type_expr, .array_literal, .parameterized_type_expr, .index_expr, .slice_expr, .insert_expr, .ufcs_alias => {},
|
|
.namespace_decl => |ns| {
|
|
try self.pushScope();
|
|
for (ns.decls) |d| {
|
|
try self.registerTopLevelDecl(d);
|
|
}
|
|
for (ns.decls) |d| {
|
|
try self.analyzeTopLevelDecl(d);
|
|
}
|
|
self.popScope();
|
|
},
|
|
else => {
|
|
try self.analyzeNode(node);
|
|
},
|
|
}
|
|
}
|
|
|
|
fn pushScope(self: *Analyzer) !void {
|
|
try self.scope_starts.append(self.allocator, @intCast(self.symbols.items.len));
|
|
self.scope_depth += 1;
|
|
}
|
|
|
|
fn popScope(self: *Analyzer) void {
|
|
if (self.scope_starts.items.len > 0) {
|
|
_ = self.scope_starts.pop();
|
|
self.scope_depth -= 1;
|
|
}
|
|
}
|
|
|
|
fn analyzeParams(self: *Analyzer, params: []const ast.Param) !void {
|
|
for (params) |param| {
|
|
self.resolveTypeRef(param.type_expr);
|
|
const param_type = Type.fromTypeExpr(param.type_expr) orelse blk: {
|
|
if (param.type_expr.data == .type_expr) {
|
|
const name = param.type_expr.data.type_expr.name;
|
|
const resolved = self.type_aliases.get(name) orelse name;
|
|
if (self.symbol_index.get(resolved)) |indices| {
|
|
for (indices.items) |idx| {
|
|
if (self.symbols.items[idx].ty) |ty| break :blk ty;
|
|
}
|
|
}
|
|
}
|
|
break :blk null;
|
|
};
|
|
try self.addSymbol(param.name, .param, param_type, param.name_span);
|
|
}
|
|
}
|
|
|
|
fn addSymbol(self: *Analyzer, name: []const u8, kind: SymbolKind, ty: ?Type, span: Span) !void {
|
|
// Check for duplicate using the symbol index
|
|
// Variables are allowed to shadow in the same scope (sx semantics)
|
|
if (kind != .variable) if (self.symbol_index.get(name)) |indices| {
|
|
const scope_start: u32 = if (self.scope_starts.items.len > 0)
|
|
self.scope_starts.items[self.scope_starts.items.len - 1]
|
|
else
|
|
0;
|
|
for (indices.items) |idx| {
|
|
if (idx >= scope_start) {
|
|
const sym = self.symbols.items[idx];
|
|
// Skip imported symbols — local declarations are allowed to shadow them
|
|
if (sym.origin != null) continue;
|
|
if (sym.scope_depth == self.scope_depth) {
|
|
try self.diagnostics.append(self.allocator, .{
|
|
.level = .warn,
|
|
.span = span,
|
|
.message = "duplicate declaration",
|
|
});
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
};
|
|
|
|
try self.symbols.append(self.allocator, .{
|
|
.name = name,
|
|
.kind = kind,
|
|
.ty = ty,
|
|
.def_span = span,
|
|
.scope_depth = self.scope_depth,
|
|
});
|
|
// Update symbol index
|
|
const idx: u32 = @intCast(self.symbols.items.len - 1);
|
|
const gop = try self.symbol_index.getOrPut(name);
|
|
if (!gop.found_existing) {
|
|
gop.value_ptr.* = std.ArrayList(u32).empty;
|
|
}
|
|
try gop.value_ptr.append(self.allocator, idx);
|
|
}
|
|
|
|
/// Check if a symbol name has been registered.
|
|
pub fn hasSymbol(self: *const Analyzer, name: []const u8) bool {
|
|
return self.symbol_index.contains(name);
|
|
}
|
|
|
|
/// Pre-register an imported symbol so references in this file can resolve to it.
|
|
pub fn preRegisterSymbol(self: *Analyzer, sym: Symbol) !void {
|
|
try self.symbols.append(self.allocator, sym);
|
|
// Update symbol index
|
|
const idx: u32 = @intCast(self.symbols.items.len - 1);
|
|
const gop = try self.symbol_index.getOrPut(sym.name);
|
|
if (!gop.found_existing) {
|
|
gop.value_ptr.* = std.ArrayList(u32).empty;
|
|
}
|
|
try gop.value_ptr.append(self.allocator, idx);
|
|
}
|
|
|
|
fn resolveIdentifier(self: *Analyzer, name: []const u8, span: Span) !void {
|
|
// Use symbol index for O(1) name lookup, then walk backwards through indices
|
|
if (self.symbol_index.get(name)) |indices| {
|
|
var j = indices.items.len;
|
|
while (j > 0) {
|
|
j -= 1;
|
|
const idx = indices.items[j];
|
|
const sym = self.symbols.items[idx];
|
|
if (sym.scope_depth <= self.scope_depth) {
|
|
try self.references.append(self.allocator, .{
|
|
.span = span,
|
|
.symbol_index = idx,
|
|
});
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Built-in names that aren't declared in source
|
|
const builtins = [_][]const u8{ "io", "true", "false", "cast", "closure", "out", "size_of", "align_of", "malloc", "free", "memcpy", "memset" };
|
|
for (builtins) |b| {
|
|
if (std.mem.eql(u8, name, b)) return;
|
|
}
|
|
|
|
try self.diagnostics.append(self.allocator, .{
|
|
.level = .warn,
|
|
.span = span,
|
|
.message = "undefined variable",
|
|
});
|
|
}
|
|
|
|
fn analyzeNode(self: *Analyzer, node: *Node) !void {
|
|
switch (node.data) {
|
|
.fn_decl => |fd| {
|
|
const local_ret_ty = resolveReturnType(fd) orelse
|
|
if (fd.is_arrow) self.inferFnReturnType(fd.params, fd.body) else null;
|
|
try self.addSymbol(fd.name, .function, local_ret_ty, node.span);
|
|
// Register fn_signatures for local functions (for return type hints + hover)
|
|
{
|
|
var param_types = std.ArrayList(Type).empty;
|
|
for (fd.params) |param| {
|
|
const pt = Type.fromTypeExpr(param.type_expr) orelse Type.unresolved;
|
|
try param_types.append(self.allocator, pt);
|
|
}
|
|
try self.fn_signatures.put(fd.name, .{
|
|
.param_types = try param_types.toOwnedSlice(self.allocator),
|
|
.return_type = local_ret_ty orelse .void_type,
|
|
});
|
|
}
|
|
try self.pushScope();
|
|
try self.analyzeParams(fd.params);
|
|
try self.analyzeNode(fd.body);
|
|
self.popScope();
|
|
},
|
|
.block => |blk| {
|
|
try self.pushScope();
|
|
for (blk.stmts) |stmt| {
|
|
try self.analyzeNode(stmt);
|
|
}
|
|
self.popScope();
|
|
},
|
|
.const_decl => |cd| {
|
|
// Analyze value first (so it can't reference itself)
|
|
try self.analyzeNode(cd.value);
|
|
const ty = self.resolveTypeAnnotation(cd.type_annotation) orelse inferValueType(cd.value);
|
|
const kind = classifyConstDecl(cd);
|
|
try self.addSymbol(cd.name, kind, ty, node.span);
|
|
},
|
|
.var_decl => |vd| {
|
|
if (vd.value) |val| {
|
|
try self.analyzeNode(val);
|
|
}
|
|
const ty = self.resolveTypeAnnotation(vd.type_annotation) orelse
|
|
if (vd.value) |val| self.inferExprType(val) else null;
|
|
try self.addSymbol(vd.name, .variable, ty, node.span);
|
|
},
|
|
.enum_decl => |ed| {
|
|
if (ed.variant_types.len > 0) {
|
|
try self.addSymbol(ed.name, .enum_type, .{ .union_type = ed.name }, node.span);
|
|
} else {
|
|
try self.addSymbol(ed.name, .enum_type, .{ .enum_type = ed.name }, node.span);
|
|
}
|
|
},
|
|
.struct_decl => |sd| {
|
|
try self.addSymbol(sd.name, .struct_type, .{ .struct_type = sd.name }, node.span);
|
|
},
|
|
.identifier => |id| {
|
|
try self.resolveIdentifier(id.name, node.span);
|
|
},
|
|
.binary_op => |bop| {
|
|
try self.analyzeNode(bop.lhs);
|
|
try self.analyzeNode(bop.rhs);
|
|
},
|
|
.chained_comparison => |cc| {
|
|
for (cc.operands) |operand| {
|
|
try self.analyzeNode(operand);
|
|
}
|
|
},
|
|
.unary_op => |uop| {
|
|
try self.analyzeNode(uop.operand);
|
|
},
|
|
.call => |call| {
|
|
try self.analyzeNode(call.callee);
|
|
for (call.args) |arg| {
|
|
try self.analyzeNode(arg);
|
|
}
|
|
},
|
|
.ffi_intrinsic_call => |fic| {
|
|
try self.analyzeNode(fic.return_type);
|
|
for (fic.args) |arg| {
|
|
try self.analyzeNode(arg);
|
|
}
|
|
},
|
|
.field_access => |fa| {
|
|
try self.analyzeNode(fa.object);
|
|
},
|
|
.if_expr => |ie| {
|
|
try self.analyzeNode(ie.condition);
|
|
if (ie.binding_name) |bname| {
|
|
// `if val := expr { ... }` — val is the unwrapped optional
|
|
const cond_ty = self.inferExprType(ie.condition);
|
|
const inner_ty: ?Type = if (cond_ty.isOptional())
|
|
Type.fromName(cond_ty.optional_type.child_name)
|
|
else
|
|
null;
|
|
try self.pushScope();
|
|
try self.addSymbol(bname, .variable, inner_ty, node.span);
|
|
try self.analyzeNode(ie.then_branch);
|
|
self.popScope();
|
|
} else {
|
|
try self.analyzeNode(ie.then_branch);
|
|
}
|
|
if (ie.else_branch) |eb| {
|
|
try self.analyzeNode(eb);
|
|
}
|
|
},
|
|
.match_expr => |me| {
|
|
try self.analyzeNode(me.subject);
|
|
for (me.arms) |arm| {
|
|
try self.pushScope();
|
|
if (arm.capture) |cap_name| {
|
|
try self.addSymbol(cap_name, .variable, null, arm.body.span);
|
|
}
|
|
try self.analyzeNode(arm.body);
|
|
self.popScope();
|
|
}
|
|
},
|
|
.while_expr => |we| {
|
|
try self.analyzeNode(we.condition);
|
|
if (we.binding_name) |bname| {
|
|
const cond_ty = self.inferExprType(we.condition);
|
|
const inner_ty: ?Type = if (cond_ty.isOptional())
|
|
Type.fromName(cond_ty.optional_type.child_name)
|
|
else
|
|
null;
|
|
try self.pushScope();
|
|
try self.addSymbol(bname, .variable, inner_ty, node.span);
|
|
try self.analyzeNode(we.body);
|
|
self.popScope();
|
|
} else {
|
|
try self.analyzeNode(we.body);
|
|
}
|
|
},
|
|
.for_expr => |fe| {
|
|
try self.analyzeNode(fe.iterable);
|
|
try self.pushScope();
|
|
if (!std.mem.eql(u8, fe.capture_name, "_")) {
|
|
try self.addSymbol(fe.capture_name, .variable, null, node.span);
|
|
}
|
|
if (fe.index_name) |idx_name| {
|
|
if (!std.mem.eql(u8, idx_name, "_")) {
|
|
try self.addSymbol(idx_name, .variable, .{ .signed = 64 }, node.span);
|
|
}
|
|
}
|
|
try self.analyzeNode(fe.body);
|
|
self.popScope();
|
|
},
|
|
.spread_expr => |se| try self.analyzeNode(se.operand),
|
|
.break_expr, .continue_expr => {},
|
|
.assignment => |asgn| {
|
|
try self.analyzeNode(asgn.target);
|
|
try self.analyzeNode(asgn.value);
|
|
},
|
|
.multi_assign => |ma| {
|
|
for (ma.targets) |t| try self.analyzeNode(t);
|
|
for (ma.values) |v| try self.analyzeNode(v);
|
|
},
|
|
.destructure_decl => |dd| {
|
|
try self.analyzeNode(dd.value);
|
|
},
|
|
.return_stmt => |ret| {
|
|
if (ret.value) |val| {
|
|
try self.analyzeNode(val);
|
|
}
|
|
},
|
|
.defer_stmt => |ds| {
|
|
try self.analyzeNode(ds.expr);
|
|
},
|
|
.push_stmt => |ps| {
|
|
try self.analyzeNode(ps.context_expr);
|
|
try self.analyzeNode(ps.body);
|
|
},
|
|
.comptime_expr => |ct| {
|
|
try self.analyzeNode(ct.expr);
|
|
},
|
|
.insert_expr => |ins| {
|
|
try self.analyzeNode(ins.expr);
|
|
},
|
|
.lambda => |lam| {
|
|
try self.pushScope();
|
|
try self.analyzeParams(lam.params);
|
|
try self.analyzeNode(lam.body);
|
|
self.popScope();
|
|
},
|
|
.struct_literal => |sl| {
|
|
if (sl.type_expr) |te| try self.analyzeNode(te);
|
|
for (sl.field_inits) |fi| {
|
|
try self.analyzeNode(fi.value);
|
|
}
|
|
},
|
|
.union_decl => |ud| {
|
|
try self.addSymbol(ud.name, .enum_type, .{ .union_type = ud.name }, node.span);
|
|
},
|
|
// Leaf nodes — nothing to recurse into
|
|
.enum_literal,
|
|
.int_literal,
|
|
.float_literal,
|
|
.bool_literal,
|
|
.string_literal,
|
|
.type_expr,
|
|
.param,
|
|
.match_arm,
|
|
.undef_literal,
|
|
.inferred_type,
|
|
.builtin_expr,
|
|
.compiler_expr,
|
|
.foreign_expr,
|
|
.library_decl,
|
|
.framework_decl,
|
|
.function_type_expr,
|
|
.closure_type_expr,
|
|
.import_decl,
|
|
.c_import_decl,
|
|
.array_type_expr,
|
|
.slice_type_expr,
|
|
.pointer_type_expr,
|
|
.many_pointer_type_expr,
|
|
.optional_type_expr,
|
|
.pack_index_type_expr,
|
|
.comptime_pack_ref,
|
|
.null_literal,
|
|
.array_literal,
|
|
.parameterized_type_expr,
|
|
.index_expr,
|
|
.slice_expr,
|
|
.tuple_type_expr,
|
|
=> {},
|
|
.protocol_decl => |pd| {
|
|
try self.addSymbol(pd.name, .protocol_type, null, node.span);
|
|
// Recurse into default method bodies
|
|
for (pd.methods) |method| {
|
|
if (method.default_body) |body| {
|
|
try self.pushScope();
|
|
// `self` is implicit in protocol default methods
|
|
try self.addSymbol("self", .param, null, node.span);
|
|
for (method.param_names) |pname| {
|
|
try self.addSymbol(pname, .param, null, node.span);
|
|
}
|
|
try self.analyzeNode(body);
|
|
self.popScope();
|
|
}
|
|
}
|
|
},
|
|
.foreign_class_decl => |fd| {
|
|
try self.addSymbol(fd.name, .type_alias, null, node.span);
|
|
if (fd.is_foreign and fd.is_main) {
|
|
try self.diagnostics.append(self.allocator, .{
|
|
.level = .err,
|
|
.message = "'#foreign' and '#jni_main' / '#objc_main' are mutually exclusive — a foreign-referenced class can't be the app's main entry",
|
|
.span = node.span,
|
|
});
|
|
}
|
|
if (fd.is_foreign) {
|
|
for (fd.members) |m| switch (m) {
|
|
.method => |md| if (md.body != null) {
|
|
try self.diagnostics.append(self.allocator, .{
|
|
.level = .err,
|
|
.message = "methods on a '#foreign' class can't have bodies — they reference foreign-runtime implementations",
|
|
.span = node.span,
|
|
});
|
|
},
|
|
else => {},
|
|
};
|
|
}
|
|
},
|
|
.jni_env_block => |eb| {
|
|
try self.analyzeNode(eb.env);
|
|
try self.pushScope();
|
|
try self.analyzeNode(eb.body);
|
|
self.popScope();
|
|
},
|
|
.impl_block => |ib| {
|
|
// Each impl block gets its own scope so methods don't conflict across impls
|
|
try self.pushScope();
|
|
for (ib.methods) |method_node| {
|
|
try self.analyzeNode(method_node);
|
|
}
|
|
self.popScope();
|
|
},
|
|
.ufcs_alias => |ua| {
|
|
// Register the alias name as a function and resolve the target
|
|
try self.addSymbol(ua.name, .function, null, node.span);
|
|
try self.resolveIdentifier(ua.target, node.span);
|
|
},
|
|
.tuple_literal => |tl| {
|
|
for (tl.elements) |elem| {
|
|
try self.analyzeNode(elem.value);
|
|
}
|
|
},
|
|
.force_unwrap => |fu| {
|
|
try self.analyzeNode(fu.operand);
|
|
},
|
|
.null_coalesce => |nc| {
|
|
try self.analyzeNode(nc.lhs);
|
|
try self.analyzeNode(nc.rhs);
|
|
},
|
|
.deref_expr => |de| {
|
|
try self.analyzeNode(de.operand);
|
|
},
|
|
.namespace_decl => |ns| {
|
|
for (ns.decls) |d| {
|
|
try self.analyzeNode(d);
|
|
}
|
|
},
|
|
.root => {
|
|
// Should not appear nested
|
|
},
|
|
}
|
|
|
|
// Populate TypeMap for expression nodes
|
|
switch (node.data) {
|
|
.int_literal,
|
|
.float_literal,
|
|
.bool_literal,
|
|
.string_literal,
|
|
.identifier,
|
|
.binary_op,
|
|
.chained_comparison,
|
|
.unary_op,
|
|
.call,
|
|
.field_access,
|
|
.if_expr,
|
|
.match_expr,
|
|
.block,
|
|
.comptime_expr,
|
|
.enum_literal,
|
|
.struct_literal,
|
|
.array_literal,
|
|
.index_expr,
|
|
.slice_expr,
|
|
.deref_expr,
|
|
.force_unwrap,
|
|
.null_coalesce,
|
|
.null_literal,
|
|
.type_expr,
|
|
.insert_expr,
|
|
.while_expr,
|
|
.for_expr,
|
|
.spread_expr,
|
|
.break_expr,
|
|
.continue_expr,
|
|
=> {
|
|
const ty = self.inferExprType(node);
|
|
self.type_map.put(node, ty) catch {};
|
|
},
|
|
else => {},
|
|
}
|
|
}
|
|
|
|
fn resolveReturnType(fd: ast.FnDecl) ?Type {
|
|
if (fd.return_type) |rt| {
|
|
return Type.fromTypeExpr(rt);
|
|
}
|
|
return null;
|
|
}
|
|
|
|
/// Infer return type from a function/lambda body by temporarily registering params.
|
|
fn inferFnReturnType(self: *Analyzer, params: []const ast.Param, body: *const Node) ?Type {
|
|
self.pushScope() catch return null;
|
|
for (params) |param| {
|
|
const pt = Type.fromTypeExpr(param.type_expr) orelse Type.unresolved;
|
|
self.addSymbol(param.name, .param, pt, param.name_span) catch {};
|
|
}
|
|
// Arrow fn_decl wraps body in block{[expr]} — unwrap to inner expression
|
|
const expr_node = if (body.data == .block) blk: {
|
|
const stmts = body.data.block.stmts;
|
|
if (stmts.len > 0) break :blk stmts[stmts.len - 1];
|
|
break :blk body;
|
|
} else body;
|
|
|
|
const inferred = self.inferExprType(expr_node);
|
|
self.popScope();
|
|
if (inferred != .void_type) return inferred;
|
|
return null;
|
|
}
|
|
|
|
fn resolveTypeAnnotation(self: *Analyzer, type_node: ?*Node) ?Type {
|
|
if (type_node) |tn| {
|
|
if (Type.fromTypeExpr(tn)) |t| return t;
|
|
// Check registered types (structs, enums, tagged enums)
|
|
if (tn.data == .type_expr) {
|
|
const name = tn.data.type_expr.name;
|
|
// Check type aliases first
|
|
const resolved = self.type_aliases.get(name) orelse name;
|
|
if (self.symbol_index.get(resolved)) |indices| {
|
|
for (indices.items) |idx| {
|
|
if (self.symbols.items[idx].ty) |ty| {
|
|
// Register a reference so go-to-definition works on type names
|
|
self.tryAddReference(resolved, tn.span);
|
|
return ty;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// Compound types: ?T, *T, [*]T, []T, [N]T — delegate to resolveTypeNode
|
|
switch (tn.data) {
|
|
.optional_type_expr, .pointer_type_expr, .many_pointer_type_expr,
|
|
.slice_type_expr, .array_type_expr,
|
|
=> {
|
|
const resolved = self.resolveTypeNode(tn);
|
|
if (resolved != .void_type) return resolved;
|
|
},
|
|
else => {},
|
|
}
|
|
// For compound types, resolve inner type refs
|
|
self.resolveTypeRef(tn);
|
|
}
|
|
return null;
|
|
}
|
|
|
|
/// Try to create a reference for a name without emitting diagnostics.
|
|
/// Used for type names where missing symbols are expected (primitives, builtins).
|
|
fn tryAddReference(self: *Analyzer, name: []const u8, span: Span) void {
|
|
if (self.symbol_index.get(name)) |indices| {
|
|
var j = indices.items.len;
|
|
while (j > 0) {
|
|
j -= 1;
|
|
const idx = indices.items[j];
|
|
const sym = self.symbols.items[idx];
|
|
if (sym.scope_depth <= self.scope_depth) {
|
|
self.references.append(self.allocator, .{
|
|
.span = span,
|
|
.symbol_index = idx,
|
|
}) catch {};
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Create references for type expression nodes so go-to-definition works on type names.
|
|
/// Only resolves compound types (pointer/slice/array element types).
|
|
fn resolveTypeRef(self: *Analyzer, node: *Node) void {
|
|
switch (node.data) {
|
|
.type_expr => |te| {
|
|
self.tryAddReference(te.name, node.span);
|
|
},
|
|
.pointer_type_expr => |pte| {
|
|
self.resolveTypeRef(pte.pointee_type);
|
|
},
|
|
.many_pointer_type_expr => |mpte| {
|
|
self.resolveTypeRef(mpte.element_type);
|
|
},
|
|
.slice_type_expr => |ste| {
|
|
self.resolveTypeRef(ste.element_type);
|
|
},
|
|
.array_type_expr => |ate| {
|
|
self.resolveTypeRef(ate.element_type);
|
|
},
|
|
.optional_type_expr => |ote| {
|
|
self.resolveTypeRef(ote.inner_type);
|
|
},
|
|
else => {},
|
|
}
|
|
}
|
|
|
|
fn inferValueType(value: *Node) ?Type {
|
|
return switch (value.data) {
|
|
.int_literal => Type.s(64),
|
|
.float_literal => .f64,
|
|
.bool_literal => .boolean,
|
|
.string_literal => .string_type,
|
|
.type_expr => null, // type alias — no value type
|
|
.lambda => null,
|
|
.comptime_expr => null,
|
|
.insert_expr => null,
|
|
else => null,
|
|
};
|
|
}
|
|
|
|
fn classifyConstDecl(cd: ast.ConstDecl) SymbolKind {
|
|
return switch (cd.value.data) {
|
|
.type_expr => .type_alias,
|
|
.lambda => .function,
|
|
else => .constant,
|
|
};
|
|
}
|
|
};
|
|
|
|
/// Convenience: parse and analyze in one call.
|
|
pub fn analyzeSource(allocator: std.mem.Allocator, root: *Node) !SemaResult {
|
|
var analyzer = Analyzer.init(allocator);
|
|
return analyzer.analyze(root);
|
|
}
|
|
|
|
fn findSpanAtOffset(comptime T: type, items: []const T, offset: u32, comptime span_field: []const u8) ?usize {
|
|
for (items, 0..) |item, i| {
|
|
const span = @field(item, span_field);
|
|
if (offset >= span.start and offset < span.end) return i;
|
|
}
|
|
return null;
|
|
}
|
|
|
|
/// Find the symbol whose definition span contains the given byte offset.
|
|
pub fn findSymbolAtOffset(symbols: []const Symbol, offset: u32) ?usize {
|
|
return findSpanAtOffset(Symbol, symbols, offset, "def_span");
|
|
}
|
|
|
|
/// Find the reference at the given byte offset.
|
|
pub fn findReferenceAtOffset(references: []const Reference, offset: u32) ?usize {
|
|
return findSpanAtOffset(Reference, references, offset, "span");
|
|
}
|
|
|
|
/// Walk the AST to find the innermost node whose span contains the offset.
|
|
pub fn findNodeAtOffset(node: *Node, offset: u32) ?*Node {
|
|
if (offset < node.span.start or offset >= node.span.end) return null;
|
|
|
|
// Try to find a more specific child node
|
|
switch (node.data) {
|
|
.root => |r| {
|
|
for (r.decls) |decl| {
|
|
if (findNodeAtOffset(decl, offset)) |found| return found;
|
|
}
|
|
},
|
|
.fn_decl => |fd| {
|
|
if (fd.return_type) |rt| {
|
|
if (findNodeAtOffset(rt, offset)) |found| return found;
|
|
}
|
|
if (findNodeAtOffset(fd.body, offset)) |found| return found;
|
|
},
|
|
.block => |blk| {
|
|
for (blk.stmts) |stmt| {
|
|
if (findNodeAtOffset(stmt, offset)) |found| return found;
|
|
}
|
|
},
|
|
.const_decl => |cd| {
|
|
if (cd.type_annotation) |ta| {
|
|
if (findNodeAtOffset(ta, offset)) |found| return found;
|
|
}
|
|
if (findNodeAtOffset(cd.value, offset)) |found| return found;
|
|
},
|
|
.var_decl => |vd| {
|
|
if (vd.type_annotation) |ta| {
|
|
if (findNodeAtOffset(ta, offset)) |found| return found;
|
|
}
|
|
if (vd.value) |val| {
|
|
if (findNodeAtOffset(val, offset)) |found| return found;
|
|
}
|
|
},
|
|
.binary_op => |bop| {
|
|
if (findNodeAtOffset(bop.lhs, offset)) |found| return found;
|
|
if (findNodeAtOffset(bop.rhs, offset)) |found| return found;
|
|
},
|
|
.chained_comparison => |cc| {
|
|
for (cc.operands) |operand| {
|
|
if (findNodeAtOffset(operand, offset)) |found| return found;
|
|
}
|
|
},
|
|
.unary_op => |uop| {
|
|
if (findNodeAtOffset(uop.operand, offset)) |found| return found;
|
|
},
|
|
.call => |call| {
|
|
if (findNodeAtOffset(call.callee, offset)) |found| return found;
|
|
for (call.args) |arg| {
|
|
if (findNodeAtOffset(arg, offset)) |found| return found;
|
|
}
|
|
},
|
|
.ffi_intrinsic_call => |fic| {
|
|
if (findNodeAtOffset(fic.return_type, offset)) |found| return found;
|
|
for (fic.args) |arg| {
|
|
if (findNodeAtOffset(arg, offset)) |found| return found;
|
|
}
|
|
},
|
|
.field_access => |fa| {
|
|
if (findNodeAtOffset(fa.object, offset)) |found| return found;
|
|
},
|
|
.if_expr => |ie| {
|
|
if (findNodeAtOffset(ie.condition, offset)) |found| return found;
|
|
if (findNodeAtOffset(ie.then_branch, offset)) |found| return found;
|
|
if (ie.else_branch) |eb| {
|
|
if (findNodeAtOffset(eb, offset)) |found| return found;
|
|
}
|
|
},
|
|
.match_expr => |me| {
|
|
if (findNodeAtOffset(me.subject, offset)) |found| return found;
|
|
for (me.arms) |arm| {
|
|
if (findNodeAtOffset(arm.body, offset)) |found| return found;
|
|
if (arm.pattern) |pat| {
|
|
if (findNodeAtOffset(pat, offset)) |found| return found;
|
|
}
|
|
}
|
|
},
|
|
.while_expr => |we| {
|
|
if (findNodeAtOffset(we.condition, offset)) |found| return found;
|
|
if (findNodeAtOffset(we.body, offset)) |found| return found;
|
|
},
|
|
.for_expr => |fe| {
|
|
if (findNodeAtOffset(fe.iterable, offset)) |found| return found;
|
|
if (findNodeAtOffset(fe.body, offset)) |found| return found;
|
|
},
|
|
.spread_expr => |se| {
|
|
if (findNodeAtOffset(se.operand, offset)) |found| return found;
|
|
},
|
|
.break_expr, .continue_expr => {},
|
|
.assignment => |asgn| {
|
|
if (findNodeAtOffset(asgn.target, offset)) |found| return found;
|
|
if (findNodeAtOffset(asgn.value, offset)) |found| return found;
|
|
},
|
|
.multi_assign => |ma| {
|
|
for (ma.targets) |t| {
|
|
if (findNodeAtOffset(t, offset)) |found| return found;
|
|
}
|
|
for (ma.values) |v| {
|
|
if (findNodeAtOffset(v, offset)) |found| return found;
|
|
}
|
|
},
|
|
.destructure_decl => |dd| {
|
|
if (findNodeAtOffset(dd.value, offset)) |found| return found;
|
|
},
|
|
.return_stmt => |ret| {
|
|
if (ret.value) |val| {
|
|
if (findNodeAtOffset(val, offset)) |found| return found;
|
|
}
|
|
},
|
|
.defer_stmt => |ds| {
|
|
if (findNodeAtOffset(ds.expr, offset)) |found| return found;
|
|
},
|
|
.push_stmt => |ps| {
|
|
if (findNodeAtOffset(ps.context_expr, offset)) |found| return found;
|
|
if (findNodeAtOffset(ps.body, offset)) |found| return found;
|
|
},
|
|
.comptime_expr => |ct| {
|
|
if (findNodeAtOffset(ct.expr, offset)) |found| return found;
|
|
},
|
|
.insert_expr => |ins| {
|
|
if (findNodeAtOffset(ins.expr, offset)) |found| return found;
|
|
},
|
|
.lambda => |lam| {
|
|
if (findNodeAtOffset(lam.body, offset)) |found| return found;
|
|
},
|
|
.struct_literal => |sl| {
|
|
for (sl.field_inits) |fi| {
|
|
if (findNodeAtOffset(fi.value, offset)) |found| return found;
|
|
}
|
|
},
|
|
// Leaf nodes
|
|
.enum_literal,
|
|
.identifier,
|
|
.int_literal,
|
|
.float_literal,
|
|
.bool_literal,
|
|
.string_literal,
|
|
.type_expr,
|
|
.param,
|
|
.match_arm,
|
|
.undef_literal,
|
|
.inferred_type,
|
|
.builtin_expr,
|
|
.compiler_expr,
|
|
.foreign_expr,
|
|
.library_decl,
|
|
.framework_decl,
|
|
.function_type_expr,
|
|
.enum_decl,
|
|
.union_decl,
|
|
.import_decl,
|
|
.c_import_decl,
|
|
.array_type_expr,
|
|
.slice_type_expr,
|
|
.pointer_type_expr,
|
|
.many_pointer_type_expr,
|
|
.optional_type_expr,
|
|
.pack_index_type_expr,
|
|
.comptime_pack_ref,
|
|
.null_literal,
|
|
.array_literal,
|
|
.parameterized_type_expr,
|
|
.index_expr,
|
|
.slice_expr,
|
|
.tuple_type_expr,
|
|
.ufcs_alias,
|
|
.closure_type_expr,
|
|
.foreign_class_decl,
|
|
=> {},
|
|
.jni_env_block => |eb| {
|
|
if (findNodeAtOffset(eb.env, offset)) |found| return found;
|
|
if (findNodeAtOffset(eb.body, offset)) |found| return found;
|
|
},
|
|
.struct_decl => |sd| {
|
|
for (sd.methods) |method_node| {
|
|
if (findNodeAtOffset(method_node, offset)) |found| return found;
|
|
}
|
|
},
|
|
.protocol_decl => |pd| {
|
|
for (pd.methods) |method| {
|
|
if (method.default_body) |body| {
|
|
if (findNodeAtOffset(body, offset)) |found| return found;
|
|
}
|
|
for (method.params) |param| {
|
|
if (findNodeAtOffset(param, offset)) |found| return found;
|
|
}
|
|
}
|
|
},
|
|
.impl_block => |ib| {
|
|
for (ib.methods) |method_node| {
|
|
if (findNodeAtOffset(method_node, offset)) |found| return found;
|
|
}
|
|
},
|
|
.tuple_literal => |tl| {
|
|
for (tl.elements) |elem| {
|
|
if (findNodeAtOffset(elem.value, offset)) |found| return found;
|
|
}
|
|
},
|
|
.null_coalesce => |nc| {
|
|
if (findNodeAtOffset(nc.lhs, offset)) |found| return found;
|
|
if (findNodeAtOffset(nc.rhs, offset)) |found| return found;
|
|
},
|
|
.force_unwrap => |fu| {
|
|
if (findNodeAtOffset(fu.operand, offset)) |found| return found;
|
|
},
|
|
.deref_expr => |de| {
|
|
if (findNodeAtOffset(de.operand, offset)) |found| return found;
|
|
},
|
|
.namespace_decl => |ns| {
|
|
for (ns.decls) |d| {
|
|
if (findNodeAtOffset(d, offset)) |found| return found;
|
|
}
|
|
},
|
|
}
|
|
|
|
return node;
|
|
}
|
|
|
|
/// Find the nearest match_expr ancestor that contains the given offset.
|
|
/// Returns the match subject node if found, null otherwise.
|
|
pub fn findEnclosingMatchSubject(node: *Node, offset: u32) ?*Node {
|
|
if (offset < node.span.start or offset >= node.span.end) return null;
|
|
|
|
switch (node.data) {
|
|
.match_expr => |me| {
|
|
// First recurse into arm bodies — there might be a nested match
|
|
for (me.arms) |arm| {
|
|
if (findEnclosingMatchSubject(arm.body, offset)) |inner| return inner;
|
|
}
|
|
// If offset is inside this match_expr (but not in the subject itself),
|
|
// it's in an arm pattern, between arms, or in a partially-typed arm
|
|
if (me.subject.span.start <= offset and offset < me.subject.span.end) {
|
|
// Cursor is on the subject itself, not in an arm
|
|
} else {
|
|
return me.subject;
|
|
}
|
|
},
|
|
.root => |r| {
|
|
for (r.decls) |decl| {
|
|
if (findEnclosingMatchSubject(decl, offset)) |found| return found;
|
|
}
|
|
},
|
|
.fn_decl => |fd| {
|
|
if (findEnclosingMatchSubject(fd.body, offset)) |found| return found;
|
|
},
|
|
.block => |blk| {
|
|
for (blk.stmts) |stmt| {
|
|
if (findEnclosingMatchSubject(stmt, offset)) |found| return found;
|
|
}
|
|
},
|
|
.if_expr => |ie| {
|
|
if (findEnclosingMatchSubject(ie.then_branch, offset)) |found| return found;
|
|
if (ie.else_branch) |eb| {
|
|
if (findEnclosingMatchSubject(eb, offset)) |found| return found;
|
|
}
|
|
},
|
|
.while_expr => |we| {
|
|
if (findEnclosingMatchSubject(we.body, offset)) |found| return found;
|
|
},
|
|
.for_expr => |fe| {
|
|
if (findEnclosingMatchSubject(fe.body, offset)) |found| return found;
|
|
},
|
|
.const_decl => |cd| {
|
|
if (findEnclosingMatchSubject(cd.value, offset)) |found| return found;
|
|
},
|
|
.var_decl => |vd| {
|
|
if (vd.value) |val| {
|
|
if (findEnclosingMatchSubject(val, offset)) |found| return found;
|
|
}
|
|
},
|
|
.lambda => |lam| {
|
|
if (findEnclosingMatchSubject(lam.body, offset)) |found| return found;
|
|
},
|
|
.namespace_decl => |ns| {
|
|
for (ns.decls) |decl| {
|
|
if (findEnclosingMatchSubject(decl, offset)) |found| return found;
|
|
}
|
|
},
|
|
else => {},
|
|
}
|
|
return null;
|
|
}
|
|
|
|
test "sema: collect top-level declarations" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "main :: () { 42; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Should have one symbol: main (function)
|
|
try std.testing.expectEqual(@as(usize, 1), result.symbols.len);
|
|
try std.testing.expectEqualStrings("main", result.symbols[0].name);
|
|
try std.testing.expectEqual(SymbolKind.function, result.symbols[0].kind);
|
|
}
|
|
|
|
test "sema: function params as symbols" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "add :: (a: s32, b: s32) -> s32 { a + b; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Symbols: add (function), a (param), b (param)
|
|
try std.testing.expectEqual(@as(usize, 3), result.symbols.len);
|
|
try std.testing.expectEqualStrings("add", result.symbols[0].name);
|
|
try std.testing.expectEqual(SymbolKind.function, result.symbols[0].kind);
|
|
try std.testing.expectEqualStrings("a", result.symbols[1].name);
|
|
try std.testing.expectEqual(SymbolKind.param, result.symbols[1].kind);
|
|
try std.testing.expectEqualStrings("b", result.symbols[2].name);
|
|
try std.testing.expectEqual(SymbolKind.param, result.symbols[2].kind);
|
|
|
|
// References: a and b used in body should be resolved
|
|
try std.testing.expect(result.references.len >= 2);
|
|
}
|
|
|
|
test "sema: variable declaration and reference" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "main :: () { x := 42; x; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Symbols: main (function), x (variable)
|
|
try std.testing.expectEqual(@as(usize, 2), result.symbols.len);
|
|
try std.testing.expectEqualStrings("main", result.symbols[0].name);
|
|
try std.testing.expectEqualStrings("x", result.symbols[1].name);
|
|
try std.testing.expectEqual(SymbolKind.variable, result.symbols[1].kind);
|
|
|
|
// x should have a reference
|
|
try std.testing.expect(result.references.len >= 1);
|
|
// The reference should point to symbol index 1 (x)
|
|
try std.testing.expectEqual(@as(u32, 1), result.references[0].symbol_index);
|
|
}
|
|
|
|
test "sema: undefined variable diagnostic" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "main :: () { y; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Should have a diagnostic for undefined 'y'
|
|
try std.testing.expect(result.diagnostics.len >= 1);
|
|
try std.testing.expectEqualStrings("undefined variable", result.diagnostics[0].message);
|
|
}
|
|
|
|
test "sema: enum and struct declarations" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "Color :: enum { red; green; blue; } Vec2 :: struct { x, y: f32; } main :: () { 0; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Symbols: Color (enum), Vec2 (struct), main (function)
|
|
try std.testing.expectEqual(@as(usize, 3), result.symbols.len);
|
|
try std.testing.expectEqualStrings("Color", result.symbols[0].name);
|
|
try std.testing.expectEqual(SymbolKind.enum_type, result.symbols[0].kind);
|
|
try std.testing.expectEqualStrings("Vec2", result.symbols[1].name);
|
|
try std.testing.expectEqual(SymbolKind.struct_type, result.symbols[1].kind);
|
|
try std.testing.expectEqualStrings("main", result.symbols[2].name);
|
|
}
|
|
|
|
test "sema: var_decl infers struct type from parameterized struct literal" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "List :: struct { len: s64; } main :: () { list := List.{}; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Find the 'list' variable symbol
|
|
var found_list = false;
|
|
for (result.symbols) |sym| {
|
|
if (std.mem.eql(u8, sym.name, "list")) {
|
|
found_list = true;
|
|
try std.testing.expectEqual(SymbolKind.variable, sym.kind);
|
|
// Must have inferred struct type
|
|
const ty = sym.ty orelse return error.TestUnexpectedResult;
|
|
try std.testing.expect(ty == .struct_type);
|
|
try std.testing.expectEqualStrings("List", ty.struct_type);
|
|
break;
|
|
}
|
|
}
|
|
try std.testing.expect(found_list);
|
|
}
|
|
|
|
test "sema: var_decl infers struct type from parameterized call literal" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
// List(s32).{} — parser produces struct_literal with type_expr = call node
|
|
const source = "List :: struct { len: s64; } main :: () { list := List(s32).{}; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Find the 'list' variable symbol
|
|
var found_list = false;
|
|
for (result.symbols) |sym| {
|
|
if (std.mem.eql(u8, sym.name, "list")) {
|
|
found_list = true;
|
|
try std.testing.expectEqual(SymbolKind.variable, sym.kind);
|
|
const ty = sym.ty orelse return error.TestUnexpectedResult;
|
|
try std.testing.expect(ty == .struct_type);
|
|
try std.testing.expectEqualStrings("List", ty.struct_type);
|
|
break;
|
|
}
|
|
}
|
|
try std.testing.expect(found_list);
|
|
}
|
|
|
|
test "sema: index into generic List(T).items resolves the element struct" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source =
|
|
"Move :: struct { score: s64; }" ++
|
|
"List :: struct ($T: Type) { items: [*]T = null; len: s64; }" ++
|
|
"main :: () { legal := List(Move).{}; m := legal.items[0]; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
var found_m = false;
|
|
for (result.symbols) |sym| {
|
|
if (std.mem.eql(u8, sym.name, "m")) {
|
|
found_m = true;
|
|
const ty = sym.ty orelse return error.TestUnexpectedResult;
|
|
try std.testing.expect(ty == .struct_type);
|
|
try std.testing.expectEqualStrings("Move", ty.struct_type);
|
|
break;
|
|
}
|
|
}
|
|
try std.testing.expect(found_m);
|
|
}
|
|
|
|
test "sema: generic index resolves with pre-registered (imported) struct types" {
|
|
const parser_mod = @import("parser.zig");
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
// An "imported" module defining List + Move.
|
|
const lib_src = "Move :: struct { score: s64; }" ++
|
|
"List :: struct ($T: Type) { items: [*]T = null; len: s64; }";
|
|
var lib_parser = parser_mod.Parser.init(alloc, lib_src);
|
|
const lib_root = try lib_parser.parse();
|
|
var lib = Analyzer.init(alloc);
|
|
const lib_res = try lib.analyze(lib_root);
|
|
|
|
// Main analyzer pre-loaded with the imported struct_types (bare names),
|
|
// mirroring DocumentStore.analyzeDocument's flat-import merge.
|
|
var main_an = Analyzer.init(alloc);
|
|
var it = lib_res.struct_types.iterator();
|
|
while (it.next()) |e| try main_an.struct_types.put(e.key_ptr.*, e.value_ptr.*);
|
|
|
|
const main_src = "main :: () { legal := List(Move).{}; m := legal.items[0]; }";
|
|
var main_parser = parser_mod.Parser.init(alloc, main_src);
|
|
const main_root = try main_parser.parse();
|
|
const main_res = try main_an.analyze(main_root);
|
|
|
|
var found_m = false;
|
|
for (main_res.symbols) |sym| {
|
|
if (std.mem.eql(u8, sym.name, "m")) {
|
|
found_m = true;
|
|
const ty = sym.ty orelse return error.TestUnexpectedResult;
|
|
try std.testing.expect(ty == .struct_type);
|
|
try std.testing.expectEqualStrings("Move", ty.struct_type);
|
|
break;
|
|
}
|
|
}
|
|
try std.testing.expect(found_m);
|
|
}
|
|
|
|
test "sema: generic index resolves with realistic List/Move (methods, cross-refs)" {
|
|
const parser_mod = @import("parser.zig");
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
const lib_src =
|
|
"Square :: struct { index: s64; }" ++
|
|
"MoveFlag :: enum { none; promote_rook; }" ++
|
|
"Move :: struct { from: Square; to: Square; flag: MoveFlag; is_capture :: (self: Move) -> bool { true; } }" ++
|
|
"List :: struct ($T: Type) { items: [*]T = null; len: s64 = 0; cap: s64 = 0; append :: (list: *List(T), item: T) {} }";
|
|
var lib_parser = parser_mod.Parser.init(alloc, lib_src);
|
|
const lib_root = try lib_parser.parse();
|
|
var lib = Analyzer.init(alloc);
|
|
const lib_res = try lib.analyze(lib_root);
|
|
|
|
var main_an = Analyzer.init(alloc);
|
|
var sit = lib_res.struct_types.iterator();
|
|
while (sit.next()) |e| try main_an.struct_types.put(e.key_ptr.*, e.value_ptr.*);
|
|
var eit = lib_res.enum_types.iterator();
|
|
while (eit.next()) |e| try main_an.enum_types.put(e.key_ptr.*, e.value_ptr.*);
|
|
|
|
const main_src = "main :: () { legal := List(Move).{}; m := legal.items[0]; f := m.from; }";
|
|
var main_parser = parser_mod.Parser.init(alloc, main_src);
|
|
const main_root = try main_parser.parse();
|
|
const main_res = try main_an.analyze(main_root);
|
|
|
|
var m_ty: ?Type = null;
|
|
var f_ty: ?Type = null;
|
|
for (main_res.symbols) |sym| {
|
|
if (std.mem.eql(u8, sym.name, "m")) m_ty = sym.ty;
|
|
if (std.mem.eql(u8, sym.name, "f")) f_ty = sym.ty;
|
|
}
|
|
try std.testing.expect(m_ty != null and m_ty.? == .struct_type);
|
|
try std.testing.expectEqualStrings("Move", m_ty.?.struct_type);
|
|
try std.testing.expect(f_ty != null and f_ty.? == .struct_type);
|
|
try std.testing.expectEqualStrings("Square", f_ty.?.struct_type);
|
|
}
|
|
|
|
test "sema: variable shadowing in same scope is allowed" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
// Two variables with the same name in the same function body — sx allows this
|
|
const source = "main :: () { x : s64 = 1; x : f64 = 2.0; }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// Should have NO diagnostics — variable shadowing is allowed
|
|
for (result.diagnostics) |d| {
|
|
if (std.mem.eql(u8, d.message, "duplicate declaration")) {
|
|
return error.TestUnexpectedResult;
|
|
}
|
|
}
|
|
}
|
|
|
|
test "sema: ufcs_alias registers symbol" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "add :: (a: s64, b: s64) -> s64 { a + b; } main :: () { sum :: ufcs add; sum(1, 2); }";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// `sum` should be registered as a symbol — no "undefined variable" diagnostic
|
|
for (result.diagnostics) |d| {
|
|
if (std.mem.eql(u8, d.message, "undefined variable")) {
|
|
return error.TestUnexpectedResult;
|
|
}
|
|
}
|
|
|
|
// Should find `sum` in symbols
|
|
var found_sum = false;
|
|
for (result.symbols) |sym| {
|
|
if (std.mem.eql(u8, sym.name, "sum")) {
|
|
found_sum = true;
|
|
try std.testing.expectEqual(SymbolKind.function, sym.kind);
|
|
break;
|
|
}
|
|
}
|
|
try std.testing.expect(found_sum);
|
|
}
|
|
|
|
test "sema: top-level ufcs_alias registers symbol" {
|
|
const parser_mod = @import("parser.zig");
|
|
|
|
const source = "add :: (a: s64, b: s64) -> s64 { a + b; } sum :: ufcs add;";
|
|
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
|
|
defer arena.deinit();
|
|
const alloc = arena.allocator();
|
|
|
|
var parser = parser_mod.Parser.init(alloc, source);
|
|
const root = try parser.parse();
|
|
|
|
var analyzer = Analyzer.init(alloc);
|
|
const result = try analyzer.analyze(root);
|
|
|
|
// No diagnostics
|
|
try std.testing.expectEqual(@as(usize, 0), result.diagnostics.len);
|
|
|
|
// Should find `sum` as function symbol
|
|
var found_sum = false;
|
|
for (result.symbols) |sym| {
|
|
if (std.mem.eql(u8, sym.name, "sum")) {
|
|
found_sum = true;
|
|
try std.testing.expectEqual(SymbolKind.function, sym.kind);
|
|
break;
|
|
}
|
|
}
|
|
try std.testing.expect(found_sum);
|
|
}
|