convert BuiltinFunction to a def file

Vexu · Oct 16, 2023 · f85b310 · f85b310
1 parent 633b2fc
commit f85b310
Show file tree

Hide file tree

Showing 16 changed files with 17,115 additions and 14,036 deletions.
diff --git a/build.zig b/build.zig
@@ -82,6 +82,7 @@ pub fn build(b: *Build) !void {
     try aro_module.dependencies.put("system_defaults", system_defaults.createModule());
 
     exe.addModule("aro", aro_module);
+    GenerateDef.add(b, "src/Builtins/Builtin.def", exe, aro_module);
 
     system_defaults.addOption(bool, "enable_linker_build_id", enable_linker_build_id);
     system_defaults.addOption([]const u8, "linker", default_linker);

diff --git a/build/GenerateDef.zig b/build/GenerateDef.zig
@@ -108,7 +108,7 @@ fn generate(self: *GenerateDef, input: []const u8) ![]const u8 {
     while (it.next()) |line_untrimmed| {
         const line = std.mem.trim(u8, line_untrimmed, " \t");
         if (line.len == 0 or line[0] == '#') continue;
-        if (std.mem.startsWith(u8, line, "const ")) {
+        if (std.mem.startsWith(u8, line, "const ") or std.mem.startsWith(u8, line, "pub const ")) {
             try headers.append(line);
             continue;
         }
@@ -252,7 +252,7 @@ fn generate(self: *GenerateDef, input: []const u8) ![]const u8 {
             \\/// Search siblings of `first_child_index` for the `char`
             \\/// If found, returns the index of the node within the `dafsa` array.
             \\/// Otherwise, returns `null`.
-            \\fn findInList(first_child_index: u16, char: u8) ?u16 {
+            \\pub fn findInList(first_child_index: u16, char: u8) ?u16 {
             \\    var index = first_child_index;
             \\    while (true) {
             \\        if (dafsa[index].char == char) return index;
@@ -264,7 +264,7 @@ fn generate(self: *GenerateDef, input: []const u8) ![]const u8 {
             \\
             \\/// Returns a unique (minimal perfect hash) index (starting at 1) for the `name`,
             \\/// or null if the name was not found.
-            \\fn uniqueIndex(name: []const u8) ?u16 {
+            \\pub fn uniqueIndex(name: []const u8) ?u16 {
             \\    if (name.len < shortest_name or name.len > longest_name) return null;
             \\
             \\    var index: u16 = 0;
@@ -295,7 +295,7 @@ fn generate(self: *GenerateDef, input: []const u8) ![]const u8 {
             \\/// This function should only be called with an `index` that
             \\/// is already known to exist within the `dafsa`, e.g. an index
             \\/// returned from `uniqueIndex`.
-            \\fn nameFromUniqueIndex(index: u16, buf: []u8) []u8 {
+            \\pub fn nameFromUniqueIndex(index: u16, buf: []u8) []u8 {
             \\    std.debug.assert(index >= 1 and index <= data.len);
             \\
             \\    var node_index: u16 = 0;
@@ -369,7 +369,7 @@ fn generate(self: *GenerateDef, input: []const u8) ![]const u8 {
 }
 
 fn writeData(writer: anytype, values: []const Value) !void {
-    try writer.writeAll("const data = blk: {\n");
+    try writer.writeAll("pub const data = blk: {\n");
     try writer.print("    @setEvalBranchQuota({});\n", .{values.len});
     try writer.writeAll("    break :blk [_]@This(){\n");
     for (values, 0..) |value, i| {