zls/src/analysis.zig

707 lines
28 KiB
Zig
Raw Normal View History

2020-05-03 22:27:08 +01:00
const std = @import("std");
const AnalysisContext = @import("document_store.zig").AnalysisContext;
const ast = std.zig.ast;
2020-05-03 22:27:08 +01:00
/// REALLY BAD CODE, PLEASE DON'T USE THIS!!!!!!! (only for testing)
pub fn getFunctionByName(tree: *ast.Tree, name: []const u8) ?*ast.Node.FnProto {
2020-05-03 22:27:08 +01:00
var decls = tree.root_node.decls.iterator(0);
while (decls.next()) |decl_ptr| {
var decl = decl_ptr.*;
switch (decl.id) {
.FnProto => {
const func = decl.cast(ast.Node.FnProto).?;
2020-05-03 22:27:08 +01:00
if (std.mem.eql(u8, tree.tokenSlice(func.name_token.?), name)) return func;
},
2020-05-16 16:30:16 +01:00
else => {},
2020-05-03 22:27:08 +01:00
}
}
return null;
}
/// Gets a function's doc comments, caller must free memory when a value is returned
/// Like:
///```zig
///var comments = getFunctionDocComments(allocator, tree, func);
///defer if (comments) |comments_pointer| allocator.free(comments_pointer);
///```
pub fn getDocComments(allocator: *std.mem.Allocator, tree: *ast.Tree, node: *ast.Node) !?[]const u8 {
2020-05-04 03:17:19 +01:00
switch (node.id) {
.FnProto => {
const func = node.cast(ast.Node.FnProto).?;
2020-05-04 03:17:19 +01:00
if (func.doc_comments) |doc_comments| {
return try collectDocComments(allocator, tree, doc_comments);
2020-05-04 03:17:19 +01:00
}
},
.VarDecl => {
const var_decl = node.cast(ast.Node.VarDecl).?;
2020-05-04 03:17:19 +01:00
if (var_decl.doc_comments) |doc_comments| {
return try collectDocComments(allocator, tree, doc_comments);
}
},
.ContainerField => {
const field = node.cast(ast.Node.ContainerField).?;
if (field.doc_comments) |doc_comments| {
return try collectDocComments(allocator, tree, doc_comments);
}
},
.ErrorTag => {
const tag = node.cast(ast.Node.ErrorTag).?;
if (tag.doc_comments) |doc_comments| {
return try collectDocComments(allocator, tree, doc_comments);
2020-05-04 03:17:19 +01:00
}
},
2020-05-23 23:21:02 +01:00
// @TODO: ParamDecl is no longer a node.
// .ParamDecl => {
// const param = node.cast(ast.Node.ParamDecl).?;
// if (param.doc_comments) |doc_comments| {
// return try collectDocComments(allocator, tree, doc_comments);
// }
// },
2020-05-16 16:30:16 +01:00
else => {},
2020-05-03 22:27:08 +01:00
}
return null;
}
fn collectDocComments(allocator: *std.mem.Allocator, tree: *ast.Tree, doc_comments: *ast.Node.DocComment) ![]const u8 {
var lines = std.ArrayList([]const u8).init(allocator);
defer lines.deinit();
2020-05-23 23:21:02 +01:00
var curr_line_tok = doc_comments.first_line;
while (true) : (curr_line_tok += 1) {
switch (tree.token_ids[curr_line_tok]) {
.LineComment => continue,
.DocComment, .ContainerDocComment => {
try lines.append(std.fmt.trim(tree.tokenSlice(curr_line_tok)[3..]));
},
else => break,
}
}
return try std.mem.join(allocator, "\n", lines.items);
2020-05-03 22:27:08 +01:00
}
2020-05-03 22:27:37 +01:00
/// Gets a function signature (keywords, name, return value)
pub fn getFunctionSignature(tree: *ast.Tree, func: *ast.Node.FnProto) []const u8 {
2020-05-23 23:21:02 +01:00
const start = tree.token_locs[func.firstToken()].start;
const end = tree.token_locs[switch (func.return_type) {
2020-05-16 16:30:16 +01:00
.Explicit, .InferErrorSet => |node| node.lastToken(),
2020-05-14 15:22:15 +01:00
.Invalid => |r_paren| r_paren,
2020-05-23 23:21:02 +01:00
}].end;
2020-05-03 22:27:08 +01:00
return tree.source[start..end];
}
2020-05-04 03:17:19 +01:00
/// Gets a function snippet insert text
pub fn getFunctionSnippet(allocator: *std.mem.Allocator, tree: *ast.Tree, func: *ast.Node.FnProto) ![]const u8 {
const name_tok = func.name_token orelse unreachable;
var buffer = std.ArrayList(u8).init(allocator);
try buffer.ensureCapacity(128);
try buffer.appendSlice(tree.tokenSlice(name_tok));
try buffer.append('(');
var buf_stream = buffer.outStream();
2020-05-23 23:21:02 +01:00
for (func.paramsConst()) |param, param_num| {
if (param_num != 0) try buffer.appendSlice(", ${") else try buffer.appendSlice("${");
2020-05-23 23:21:02 +01:00
try buf_stream.print("{}:", .{param_num + 1});
2020-05-23 23:21:02 +01:00
if (param.comptime_token) |_| {
try buffer.appendSlice("comptime ");
}
2020-05-23 23:21:02 +01:00
if (param.noalias_token) |_| {
try buffer.appendSlice("noalias ");
}
2020-05-23 23:21:02 +01:00
if (param.name_token) |name_token| {
try buffer.appendSlice(tree.tokenSlice(name_token));
try buffer.appendSlice(": ");
}
2020-05-23 23:21:02 +01:00
switch (param.param_type) {
.var_args => try buffer.appendSlice("..."),
.var_type => try buffer.appendSlice("var"),
.type_expr => |type_expr| {
var curr_tok = type_expr.firstToken();
2020-05-16 15:24:41 +01:00
var end_tok = type_expr.lastToken();
while (curr_tok <= end_tok) : (curr_tok += 1) {
2020-05-23 23:21:02 +01:00
const id = tree.token_ids[curr_tok];
const is_comma = id == .Comma;
if (curr_tok == end_tok and is_comma) continue;
try buffer.appendSlice(tree.tokenSlice(curr_tok));
if (is_comma or id == .Keyword_const) try buffer.append(' ');
}
2020-05-17 15:23:04 +01:00
},
}
try buffer.append('}');
}
try buffer.append(')');
return buffer.toOwnedSlice();
}
2020-05-04 03:17:19 +01:00
/// Gets a function signature (keywords, name, return value)
pub fn getVariableSignature(tree: *ast.Tree, var_decl: *ast.Node.VarDecl) []const u8 {
2020-05-23 23:21:02 +01:00
const start = tree.token_locs[var_decl.firstToken()].start;
const end = tree.token_locs[var_decl.semicolon_token].start;
2020-05-04 03:17:19 +01:00
return tree.source[start..end];
}
2020-05-16 19:06:48 +01:00
/// Gets a param signature
pub fn getParamSignature(tree: *ast.Tree, param: *ast.Node.ParamDecl) []const u8 {
const start = tree.tokens.at(param.firstToken()).start;
const end = tree.tokens.at(param.lastToken()).end;
2020-05-04 03:17:19 +01:00
return tree.source[start..end];
}
2020-05-17 15:23:04 +01:00
pub fn isTypeFunction(tree: *ast.Tree, func: *ast.Node.FnProto) bool {
switch (func.return_type) {
.Explicit => |node| return if (node.cast(std.zig.ast.Node.Identifier)) |ident|
std.mem.eql(u8, tree.tokenSlice(ident.token), "type")
else
false,
.InferErrorSet, .Invalid => return false,
}
}
2020-05-04 03:17:19 +01:00
// STYLE
pub fn isCamelCase(name: []const u8) bool {
return !std.ascii.isUpper(name[0]) and std.mem.indexOf(u8, name, "_") == null;
}
pub fn isPascalCase(name: []const u8) bool {
return std.ascii.isUpper(name[0]) and std.mem.indexOf(u8, name, "_") == null;
}
2020-05-11 13:28:08 +01:00
// ANALYSIS ENGINE
2020-05-18 21:19:23 +01:00
pub fn getDeclNameToken(tree: *ast.Tree, node: *ast.Node) ?ast.TokenIndex {
switch (node.id) {
.VarDecl => {
const vari = node.cast(ast.Node.VarDecl).?;
return vari.name_token;
},
2020-05-23 23:21:02 +01:00
// @TODO Param decl is no longer a node
// .ParamDecl => {
// const decl = node.cast(ast.Node.ParamDecl).?;
// if (decl.name_token == null) return null;
// return decl.name_token.?;
// },
2020-05-18 21:19:23 +01:00
.FnProto => {
const func = node.cast(ast.Node.FnProto).?;
if (func.name_token == null) return null;
return func.name_token.?;
},
.ContainerField => {
const field = node.cast(ast.Node.ContainerField).?;
return field.name_token;
},
// We need identifier for captures
.Identifier => {
const ident = node.cast(ast.Node.Identifier).?;
return ident.token;
},
2020-05-18 21:19:23 +01:00
else => {},
}
return null;
}
fn getDeclName(tree: *ast.Tree, node: *ast.Node) ?[]const u8 {
return tree.tokenSlice(getDeclNameToken(tree, node) orelse return null);
}
2020-05-13 14:03:33 +01:00
/// Gets the child of node
pub fn getChild(tree: *ast.Tree, node: *ast.Node, name: []const u8) ?*ast.Node {
2020-05-23 23:21:02 +01:00
var child_it = node.iterate();
while (child_it.next()) |child| {
2020-05-18 21:19:23 +01:00
const child_name = getDeclName(tree, child) orelse continue;
if (std.mem.eql(u8, child_name, name)) return child;
2020-05-11 13:28:08 +01:00
}
return null;
}
2020-05-16 19:06:48 +01:00
/// Gets the child of slice
pub fn getChildOfSlice(tree: *ast.Tree, nodes: []*ast.Node, name: []const u8) ?*ast.Node {
for (nodes) |child| {
2020-05-18 21:19:23 +01:00
const child_name = getDeclName(tree, child) orelse continue;
if (std.mem.eql(u8, child_name, name)) return child;
2020-05-16 19:06:48 +01:00
}
return null;
}
2020-05-19 14:42:36 +01:00
fn findReturnStatementInternal(base_node: *ast.Node, already_found: *bool) ?*ast.Node.ControlFlowExpression {
var result: ?*ast.Node.ControlFlowExpression = null;
2020-05-23 23:21:02 +01:00
var child_it = base_node.iterate();
while (child_it.next()) |child_node| {
2020-05-19 14:42:36 +01:00
switch (child_node.id) {
.ControlFlowExpression => {
const cfe = child_node.cast(ast.Node.ControlFlowExpression).?;
if (cfe.kind == .Return) {
if (already_found.*) return null;
already_found.* = true;
result = cfe;
continue;
}
},
else => {},
}
result = findReturnStatementInternal(child_node, already_found);
}
return result;
}
fn findReturnStatement(base_node: *ast.Node) ?*ast.Node.ControlFlowExpression {
var already_found = false;
return findReturnStatementInternal(base_node, &already_found);
}
/// Resolves the return type of a function
2020-05-19 14:47:30 +01:00
fn resolveReturnType(analysis_ctx: *AnalysisContext, fn_decl: *ast.Node.FnProto) ?*ast.Node {
2020-05-19 14:42:36 +01:00
if (isTypeFunction(analysis_ctx.tree, fn_decl) and fn_decl.body_node != null) {
// If this is a type function and it only contains a single return statement that returns
// a container declaration, we will return that declaration.
const ret = findReturnStatement(fn_decl.body_node.?) orelse return null;
if (ret.rhs) |rhs|
if (resolveTypeOfNode(analysis_ctx, rhs)) |res_rhs| switch (res_rhs.id) {
.ContainerDecl => {
analysis_ctx.onContainer(res_rhs.cast(ast.Node.ContainerDecl).?) catch return null;
return res_rhs;
},
else => return null,
};
2020-05-19 14:42:36 +01:00
return null;
}
return switch (fn_decl.return_type) {
.Explicit, .InferErrorSet => |return_type| resolveTypeOfNode(analysis_ctx, return_type),
.Invalid => null,
};
}
2020-05-13 14:03:33 +01:00
/// Resolves the type of a node
pub fn resolveTypeOfNode(analysis_ctx: *AnalysisContext, node: *ast.Node) ?*ast.Node {
2020-05-11 13:28:08 +01:00
switch (node.id) {
2020-05-13 14:03:33 +01:00
.VarDecl => {
const vari = node.cast(ast.Node.VarDecl).?;
return resolveTypeOfNode(analysis_ctx, vari.type_node orelse vari.init_node.?) orelse null;
2020-05-11 13:28:08 +01:00
},
2020-05-23 23:21:02 +01:00
// @TODO Param decl is no longer a node type.
// .ParamDecl => {
// const decl = node.cast(ast.Node.ParamDecl).?;
// switch (decl.param_type) {
// .var_type, .type_expr => |var_type| {
// return resolveTypeOfNode(analysis_ctx, var_type) orelse null;
// },
// else => {},
// }
// },
2020-05-13 14:03:33 +01:00
.Identifier => {
2020-05-16 19:06:48 +01:00
if (getChildOfSlice(analysis_ctx.tree, analysis_ctx.scope_nodes, analysis_ctx.tree.getNodeSource(node))) |child| {
return resolveTypeOfNode(analysis_ctx, child);
2020-05-13 14:03:33 +01:00
} else return null;
2020-05-11 13:28:08 +01:00
},
2020-05-13 14:03:33 +01:00
.ContainerField => {
const field = node.cast(ast.Node.ContainerField).?;
2020-05-14 13:15:27 +01:00
return resolveTypeOfNode(analysis_ctx, field.type_expr orelse return null);
2020-05-11 13:28:08 +01:00
},
2020-05-23 23:21:02 +01:00
.Call => {
const call = node.cast(ast.Node.Call).?;
const decl = resolveTypeOfNode(analysis_ctx, call.lhs) orelse return null;
return switch (decl.id) {
.FnProto => resolveReturnType(analysis_ctx, decl.cast(ast.Node.FnProto).?),
else => decl,
};
},
.StructInitializer => {
const struct_init = node.cast(ast.Node.StructInitializer).?;
const decl = resolveTypeOfNode(analysis_ctx, struct_init.lhs) orelse return null;
return switch (decl.id) {
.FnProto => resolveReturnType(analysis_ctx, decl.cast(ast.Node.FnProto).?),
else => decl,
};
2020-05-11 13:28:08 +01:00
},
.InfixOp => {
const infix_op = node.cast(ast.Node.InfixOp).?;
2020-05-13 14:03:33 +01:00
switch (infix_op.op) {
.Period => {
// Save the child string from this tree since the tree may switch when processing
// an import lhs.
var rhs_str = nodeToString(analysis_ctx.tree, infix_op.rhs) orelse return null;
// Use the analysis context temporary arena to store the rhs string.
rhs_str = std.mem.dupe(&analysis_ctx.arena.allocator, u8, rhs_str) catch return null;
const left = resolveTypeOfNode(analysis_ctx, infix_op.lhs) orelse return null;
2020-05-16 23:30:59 +01:00
return resolveTypeOfNode(analysis_ctx, getChild(analysis_ctx.tree, left, rhs_str) orelse return null);
2020-05-13 14:03:33 +01:00
},
2020-05-16 16:30:16 +01:00
else => {},
2020-05-13 14:03:33 +01:00
}
2020-05-11 13:28:08 +01:00
},
2020-05-13 20:35:14 +01:00
.PrefixOp => {
const prefix_op = node.cast(ast.Node.PrefixOp).?;
2020-05-13 20:35:14 +01:00
switch (prefix_op.op) {
2020-05-17 15:23:04 +01:00
.SliceType, .ArrayType => return node,
2020-05-13 20:35:14 +01:00
.PtrType => {
2020-05-23 23:21:02 +01:00
const op_token_id = analysis_ctx.tree.token_ids[prefix_op.op_token];
switch (op_token_id) {
2020-05-17 15:23:04 +01:00
.Asterisk => return resolveTypeOfNode(analysis_ctx, prefix_op.rhs),
.LBracket, .AsteriskAsterisk => return null,
else => unreachable,
}
2020-05-13 20:35:14 +01:00
},
2020-05-21 13:06:16 +01:00
.Try => {
const rhs_type = resolveTypeOfNode(analysis_ctx, prefix_op.rhs) orelse return null;
switch (rhs_type.id) {
.InfixOp => {
const infix_op = rhs_type.cast(ast.Node.InfixOp).?;
if (infix_op.op == .ErrorUnion) return infix_op.rhs;
},
else => {},
}
return rhs_type;
},
2020-05-16 16:30:16 +01:00
else => {},
2020-05-13 20:35:14 +01:00
}
},
.BuiltinCall => {
const builtin_call = node.cast(ast.Node.BuiltinCall).?;
2020-05-19 16:53:01 +01:00
const call_name = analysis_ctx.tree.tokenSlice(builtin_call.builtin_token);
if (std.mem.eql(u8, call_name, "@This")) {
2020-05-23 23:21:02 +01:00
if (builtin_call.params_len != 0) return null;
2020-05-19 16:53:01 +01:00
return analysis_ctx.last_this_node;
}
2020-05-19 16:53:01 +01:00
if (!std.mem.eql(u8, call_name, "@import")) return null;
2020-05-23 23:21:02 +01:00
if (builtin_call.params_len > 1) return null;
2020-05-23 23:21:02 +01:00
const import_param = builtin_call.paramsConst()[0];
if (import_param.id != .StringLiteral) return null;
const import_str = analysis_ctx.tree.tokenSlice(import_param.cast(ast.Node.StringLiteral).?.token);
return analysis_ctx.onImport(import_str[1 .. import_str.len - 1]) catch |err| block: {
2020-05-17 15:23:04 +01:00
std.debug.warn("Error {} while processing import {}\n", .{ err, import_str });
break :block null;
};
},
2020-05-19 16:53:01 +01:00
.ContainerDecl => {
analysis_ctx.onContainer(node.cast(ast.Node.ContainerDecl).?) catch return null;
return node;
},
.MultilineStringLiteral, .StringLiteral, .ErrorSetDecl, .FnProto => return node,
2020-05-18 13:46:17 +01:00
else => std.debug.warn("Type resolution case not implemented; {}\n", .{node.id}),
2020-05-13 14:03:33 +01:00
}
return null;
}
2020-05-11 13:28:08 +01:00
fn maybeCollectImport(tree: *ast.Tree, builtin_call: *ast.Node.BuiltinCall, arr: *std.ArrayList([]const u8)) !void {
if (!std.mem.eql(u8, tree.tokenSlice(builtin_call.builtin_token), "@import")) return;
2020-05-23 23:21:02 +01:00
if (builtin_call.params_len > 1) return;
2020-05-23 23:21:02 +01:00
const import_param = builtin_call.paramsConst()[0];
if (import_param.id != .StringLiteral) return;
const import_str = tree.tokenSlice(import_param.cast(ast.Node.StringLiteral).?.token);
try arr.append(import_str[1 .. import_str.len - 1]);
}
/// Collects all imports we can find into a slice of import paths (without quotes).
/// The import paths are valid as long as the tree is.
pub fn collectImports(import_arr: *std.ArrayList([]const u8), tree: *ast.Tree) !void {
2020-05-18 13:46:17 +01:00
// TODO: Currently only detects `const smth = @import("string literal")<.SomeThing>;`
2020-05-23 23:21:02 +01:00
for (tree.root_node.decls()) |decl| {
if (decl.id != .VarDecl) continue;
const var_decl = decl.cast(ast.Node.VarDecl).?;
if (var_decl.init_node == null) continue;
2020-05-16 16:30:16 +01:00
switch (var_decl.init_node.?.id) {
.BuiltinCall => {
const builtin_call = var_decl.init_node.?.cast(ast.Node.BuiltinCall).?;
try maybeCollectImport(tree, builtin_call, import_arr);
},
.InfixOp => {
const infix_op = var_decl.init_node.?.cast(ast.Node.InfixOp).?;
2020-05-16 16:30:16 +01:00
switch (infix_op.op) {
.Period => {},
else => continue,
}
if (infix_op.lhs.id != .BuiltinCall) continue;
try maybeCollectImport(tree, infix_op.lhs.cast(ast.Node.BuiltinCall).?, import_arr);
},
else => {},
}
}
}
pub fn getFieldAccessTypeNode(
analysis_ctx: *AnalysisContext,
tokenizer: *std.zig.Tokenizer,
line_length: usize,
) ?*ast.Node {
var current_node = &analysis_ctx.tree.root_node.base;
2020-05-11 13:28:08 +01:00
2020-05-13 14:03:33 +01:00
while (true) {
var next = tokenizer.next();
switch (next.id) {
2020-05-18 12:53:40 +01:00
.Eof => return current_node,
2020-05-13 14:03:33 +01:00
.Identifier => {
2020-05-23 23:21:02 +01:00
if (getChildOfSlice(analysis_ctx.tree, analysis_ctx.scope_nodes, tokenizer.buffer[next.loc.start..next.loc.end])) |child| {
if (resolveTypeOfNode(analysis_ctx, child)) |node_type| {
current_node = node_type;
2020-05-13 20:35:14 +01:00
} else return null;
2020-05-13 14:03:33 +01:00
} else return null;
},
.Period => {
var after_period = tokenizer.next();
if (after_period.id == .Eof or after_period.id == .Comma) {
2020-05-13 14:03:33 +01:00
return current_node;
} else if (after_period.id == .Identifier) {
2020-05-18 14:22:10 +01:00
// TODO: This works for now, maybe we should filter based on the partial identifier ourselves?
2020-05-23 23:21:02 +01:00
if (after_period.loc.end == line_length) return current_node;
2020-05-23 23:21:02 +01:00
if (getChild(analysis_ctx.tree, current_node, tokenizer.buffer[after_period.loc.start..after_period.loc.end])) |child| {
if (resolveTypeOfNode(analysis_ctx, child)) |child_type| {
2020-05-13 16:43:28 +01:00
current_node = child_type;
} else return null;
2020-05-13 14:03:33 +01:00
} else return null;
}
},
2020-05-18 12:53:40 +01:00
else => std.debug.warn("Not implemented; {}\n", .{next.id}),
2020-05-13 14:03:33 +01:00
}
}
return current_node;
}
pub fn isNodePublic(tree: *ast.Tree, node: *ast.Node) bool {
2020-05-14 17:14:35 +01:00
switch (node.id) {
.VarDecl => {
const var_decl = node.cast(ast.Node.VarDecl).?;
2020-05-14 15:22:15 +01:00
return var_decl.visib_token != null;
2020-05-14 17:14:35 +01:00
},
.FnProto => {
const func = node.cast(ast.Node.FnProto).?;
2020-05-14 15:22:15 +01:00
return func.visib_token != null;
2020-05-16 16:30:16 +01:00
},
2020-05-17 15:23:04 +01:00
else => return true,
2020-05-14 17:14:35 +01:00
}
}
pub fn nodeToString(tree: *ast.Tree, node: *ast.Node) ?[]const u8 {
2020-05-13 14:03:33 +01:00
switch (node.id) {
.ContainerField => {
const field = node.cast(ast.Node.ContainerField).?;
2020-05-13 14:03:33 +01:00
return tree.tokenSlice(field.name_token);
},
2020-05-14 17:11:03 +01:00
.ErrorTag => {
const tag = node.cast(ast.Node.ErrorTag).?;
return tree.tokenSlice(tag.name_token);
},
2020-05-13 14:03:33 +01:00
.Identifier => {
const field = node.cast(ast.Node.Identifier).?;
2020-05-13 14:03:33 +01:00
return tree.tokenSlice(field.token);
2020-05-11 13:28:08 +01:00
},
.FnProto => {
const func = node.cast(ast.Node.FnProto).?;
if (func.name_token) |name_token| {
return tree.tokenSlice(name_token);
}
},
2020-05-11 13:28:08 +01:00
else => {
2020-05-13 14:03:33 +01:00
std.debug.warn("INVALID: {}\n", .{node.id});
2020-05-16 16:30:16 +01:00
},
2020-05-11 13:28:08 +01:00
}
2020-05-16 16:30:16 +01:00
return null;
2020-05-13 14:03:33 +01:00
}
2020-05-16 19:06:48 +01:00
2020-05-22 23:03:41 +01:00
pub fn declsFromIndexInternal(decls: *std.ArrayList(*ast.Node), tree: *ast.Tree, node: *ast.Node, source_index: usize) error{OutOfMemory}!void {
2020-05-16 19:06:48 +01:00
switch (node.id) {
2020-05-22 23:58:47 +01:00
.Root, .ContainerDecl => {
2020-05-23 23:21:02 +01:00
var node_it = node.iterate();
while (node_it.next()) |child_node| {
2020-05-22 23:58:47 +01:00
// Skip over container fields, we can only dot access those.
if (child_node.id == .ContainerField) continue;
const is_contained = nodeContainsSourceIndex(tree, child_node, source_index);
// If the cursor is in a variable decls it will insert itself anyway, we don't need to take care of it.
if ((is_contained and child_node.id != .VarDecl) or !is_contained) try decls.append(child_node);
2020-05-22 23:58:47 +01:00
if (is_contained) {
try declsFromIndexInternal(decls, tree, child_node, source_index);
}
}
},
2020-05-16 19:06:48 +01:00
.FnProto => {
const func = node.cast(ast.Node.FnProto).?;
2020-05-23 23:21:02 +01:00
for (func.paramsConst()) |param| {
// try decls.append(node)
// @TODO We need to store something else than nodes from now on.
}
2020-05-16 19:06:48 +01:00
2020-05-22 23:03:41 +01:00
if (func.body_node) |body_node| {
if (!nodeContainsSourceIndex(tree, body_node, source_index)) return;
try declsFromIndexInternal(decls, tree, body_node, source_index);
}
2020-05-16 19:06:48 +01:00
},
.TestDecl => {
const test_decl = node.cast(ast.Node.TestDecl).?;
2020-05-22 23:03:41 +01:00
if (!nodeContainsSourceIndex(tree, test_decl.body_node, source_index)) return;
try declsFromIndexInternal(decls, tree, test_decl.body_node, source_index);
},
2020-05-16 19:06:48 +01:00
.Block => {
2020-05-23 23:21:02 +01:00
var node_it = node.iterate();
while (node_it.next()) |inode| {
2020-05-22 23:03:41 +01:00
if (nodeComesAfterSourceIndex(tree, inode, source_index)) return;
try declsFromIndexInternal(decls, tree, inode, source_index);
}
},
.Comptime => {
const comptime_stmt = node.cast(ast.Node.Comptime).?;
if (nodeComesAfterSourceIndex(tree, comptime_stmt.expr, source_index)) return;
try declsFromIndexInternal(decls, tree, comptime_stmt.expr, source_index);
},
.If => {
const if_node = node.cast(ast.Node.If).?;
if (nodeContainsSourceIndex(tree, if_node.body, source_index)) {
if (if_node.payload) |payload| {
try declsFromIndexInternal(decls, tree, payload, source_index);
}
return try declsFromIndexInternal(decls, tree, if_node.body, source_index);
}
if (if_node.@"else") |else_node| {
if (nodeContainsSourceIndex(tree, else_node.body, source_index)) {
if (else_node.payload) |payload| {
try declsFromIndexInternal(decls, tree, payload, source_index);
}
return try declsFromIndexInternal(decls, tree, else_node.body, source_index);
}
}
},
.While => {
const while_node = node.cast(ast.Node.While).?;
if (nodeContainsSourceIndex(tree, while_node.body, source_index)) {
if (while_node.payload) |payload| {
try declsFromIndexInternal(decls, tree, payload, source_index);
}
return try declsFromIndexInternal(decls, tree, while_node.body, source_index);
}
if (while_node.@"else") |else_node| {
if (nodeContainsSourceIndex(tree, else_node.body, source_index)) {
if (else_node.payload) |payload| {
try declsFromIndexInternal(decls, tree, payload, source_index);
}
return try declsFromIndexInternal(decls, tree, else_node.body, source_index);
}
}
},
.For => {
const for_node = node.cast(ast.Node.For).?;
if (nodeContainsSourceIndex(tree, for_node.body, source_index)) {
try declsFromIndexInternal(decls, tree, for_node.payload, source_index);
return try declsFromIndexInternal(decls, tree, for_node.body, source_index);
}
if (for_node.@"else") |else_node| {
if (nodeContainsSourceIndex(tree, else_node.body, source_index)) {
if (else_node.payload) |payload| {
try declsFromIndexInternal(decls, tree, payload, source_index);
}
return try declsFromIndexInternal(decls, tree, else_node.body, source_index);
}
}
},
.Switch => {
const switch_node = node.cast(ast.Node.Switch).?;
2020-05-23 23:21:02 +01:00
for (switch_node.casesConst()) |case| {
const case_node = case.*.cast(ast.Node.SwitchCase).?;
if (nodeContainsSourceIndex(tree, case_node.expr, source_index)) {
if (case_node.payload) |payload| {
try declsFromIndexInternal(decls, tree, payload, source_index);
}
return try declsFromIndexInternal(decls, tree, case_node.expr, source_index);
}
}
},
2020-05-22 23:03:41 +01:00
// TODO: These convey no type information...
.Payload => try decls.append(node.cast(ast.Node.Payload).?.error_symbol),
.PointerPayload => try decls.append(node.cast(ast.Node.PointerPayload).?.value_symbol),
.PointerIndexPayload => {
const payload = node.cast(ast.Node.PointerIndexPayload).?;
try decls.append(payload.value_symbol);
if (payload.index_symbol) |idx| {
try decls.append(idx);
2020-05-16 19:06:48 +01:00
}
},
2020-05-22 23:58:47 +01:00
.VarDecl => {
try decls.append(node);
if (node.cast(ast.Node.VarDecl).?.init_node) |child| {
if (nodeContainsSourceIndex(tree, child, source_index)) {
try declsFromIndexInternal(decls, tree, child, source_index);
}
}
},
else => {},
2020-05-16 19:06:48 +01:00
}
}
2020-05-18 12:53:40 +01:00
pub fn addChildrenNodes(decls: *std.ArrayList(*ast.Node), tree: *ast.Tree, node: *ast.Node) !void {
2020-05-23 23:21:02 +01:00
var node_it = node.iterate();
while (node_it.next()) |child_node| {
try decls.append(child_node);
2020-05-16 19:06:48 +01:00
}
}
2020-05-22 23:03:41 +01:00
pub fn declsFromIndex(decls: *std.ArrayList(*ast.Node), tree: *ast.Tree, source_index: usize) !void {
2020-05-16 19:06:48 +01:00
var node = &tree.root_node.base;
2020-05-22 23:58:47 +01:00
try declsFromIndexInternal(decls, tree, &tree.root_node.base, source_index);
2020-05-16 19:06:48 +01:00
}
fn nodeContainsSourceIndex(tree: *ast.Tree, node: *ast.Node, source_index: usize) bool {
2020-05-23 23:21:02 +01:00
const first_token = tree.token_locs[node.firstToken()];
const last_token = tree.token_locs[node.lastToken()];
return source_index >= first_token.start and source_index <= last_token.end;
}
2020-05-22 23:03:41 +01:00
fn nodeComesAfterSourceIndex(tree: *ast.Tree, node: *ast.Node, source_index: usize) bool {
2020-05-23 23:21:02 +01:00
const first_token = tree.token_locs[node.firstToken()];
const last_token = tree.token_locs[node.lastToken()];
2020-05-22 23:03:41 +01:00
return source_index < first_token.start;
}
pub fn getImportStr(tree: *ast.Tree, source_index: usize) ?[]const u8 {
var node = &tree.root_node.base;
2020-05-23 23:21:02 +01:00
var child_it = node.iterate();
while (child_it.next()) |child| {
if (!nodeContainsSourceIndex(tree, child, source_index)) {
continue;
}
if (child.cast(ast.Node.BuiltinCall)) |builtin_call| blk: {
const call_name = tree.tokenSlice(builtin_call.builtin_token);
if (!std.mem.eql(u8, call_name, "@import")) break :blk;
2020-05-23 23:21:02 +01:00
if (builtin_call.params_len != 1) break :blk;
2020-05-23 23:21:02 +01:00
const import_param = builtin_call.paramsConst()[0];
const import_str_node = import_param.cast(ast.Node.StringLiteral) orelse break :blk;
const import_str = tree.tokenSlice(import_str_node.token);
return import_str[1 .. import_str.len - 1];
}
node = child;
2020-05-23 23:21:02 +01:00
child_it = node.iterate();
}
return null;
}