2020-05-03 22:27:08 +01:00
|
|
|
const std = @import("std");
|
|
|
|
|
|
|
|
/// REALLY BAD CODE, PLEASE DON'T USE THIS!!!!!!! (only for testing)
|
|
|
|
pub fn getFunctionByName(tree: *std.zig.ast.Tree, name: []const u8) ?*std.zig.ast.Node.FnProto {
|
|
|
|
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(std.zig.ast.Node.FnProto).?;
|
|
|
|
if (std.mem.eql(u8, tree.tokenSlice(func.name_token.?), name)) return func;
|
|
|
|
},
|
|
|
|
else => {}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
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 getFunctionDocComments(allocator: *std.mem.Allocator, tree: *std.zig.ast.Tree, func: *std.zig.ast.Node.FnProto) !?[]const u8 {
|
|
|
|
if (func.doc_comments) |doc_comments| {
|
|
|
|
var doc_it = doc_comments.lines.iterator(0);
|
|
|
|
var lines = std.ArrayList([]const u8).init(allocator);
|
|
|
|
|
|
|
|
while (doc_it.next()) |doc_comment| {
|
|
|
|
_ = try lines.append(std.fmt.trim(tree.tokenSlice(doc_comment.*)[3..]));
|
|
|
|
}
|
|
|
|
|
|
|
|
return try std.mem.join(allocator, "\n", lines.toOwnedSlice());
|
|
|
|
} else {
|
|
|
|
return null;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-05-03 22:27:37 +01:00
|
|
|
/// Gets a function signature (keywords, name, return value)
|
|
|
|
pub fn getFunctionSignature(tree: *std.zig.ast.Tree, func: *std.zig.ast.Node.FnProto) []const u8 {
|
2020-05-03 22:27:08 +01:00
|
|
|
var start = tree.tokens.at(func.firstToken()).start;
|
|
|
|
var end =
|
|
|
|
if (func.body_node) |body| tree.tokens.at(body.firstToken()).start
|
|
|
|
else tree.tokens.at(switch (func.return_type) {
|
|
|
|
.Explicit, .InferErrorSet => |node| node.lastToken()
|
|
|
|
}).end;
|
|
|
|
return tree.source[start..end];
|
|
|
|
}
|