@zigc/lib 0.15.0-dev.0 → 0.15.1

package/README.md

@@ -27,8 +27,4 @@ The `@zigc/cli` package resolves the correct native binary for your platform via
 | `@zigc/win32-x64` | Windows x64 |
 | `@zigc/win32-arm64` | Windows ARM64 |
 
-The standard library is shipped separately in `@zigc/lib` (shared across all platforms).
-
-## License
-
-MIT
+The standard library is shipped separately in `@zigc/lib` (shared across all platforms).

package/build-web/fuzz.zig

@@ -101,22 +101,22 @@ const SourceLocationIndex = enum(u32) {
 
     fn sourceLocationLinkHtml(
         sli: SourceLocationIndex,
-        out: *std.ArrayList(u8),
+        out: *std.ArrayListUnmanaged(u8),
         focused: bool,
-    ) error{OutOfMemory}!void {
+    ) Allocator.Error!void {
         const sl = sli.ptr();
-        try out.print(gpa, "<code{s}>", .{
+        try out.writer(gpa).print("<code{s}>", .{
             @as([]const u8, if (focused) " class=\"status-running\"" else ""),
         });
         try sli.appendPath(out);
-        try out.print(gpa, ":{d}:{d} </code><button class=\"linkish\" onclick=\"wasm_exports.fuzzSelectSli({d});\">View</button>", .{
+        try out.writer(gpa).print(":{d}:{d} </code><button class=\"linkish\" onclick=\"wasm_exports.fuzzSelectSli({d});\">View</button>", .{
             sl.line,
             sl.column,
             @intFromEnum(sli),
         });
     }
 
-    fn appendPath(sli: SourceLocationIndex, out: *std.ArrayList(u8)) error{OutOfMemory}!void {
+    fn appendPath(sli: SourceLocationIndex, out: *std.ArrayListUnmanaged(u8)) Allocator.Error!void {
         const sl = sli.ptr();
         const file = coverage.fileAt(sl.file);
         const file_name = coverage.stringAt(file.basename);
@@ -294,7 +294,7 @@ fn updateStats() error{OutOfMemory}!void {
 }
 
 fn updateEntryPoints() error{OutOfMemory}!void {
-    var html: std.ArrayList(u8) = .empty;
+    var html: std.ArrayListUnmanaged(u8) = .empty;
     defer html.deinit(gpa);
     for (entry_points.items) |sli| {
         try html.appendSlice(gpa, "<li>");

package/build-web/time_report.zig

@@ -44,7 +44,7 @@ pub fn genericResultMessage(msg_bytes: []u8) error{OutOfMemory}!void {
     js.updateGeneric(msg.step_idx, inner_html.ptr, inner_html.len);
 }
 
-pub fn compileResultMessage(msg_bytes: []u8) error{ OutOfMemory, WriteFailed }!void {
+pub fn compileResultMessage(msg_bytes: []u8) error{OutOfMemory}!void {
     const max_table_rows = 500;
 
     if (msg_bytes.len < @sizeOf(abi.CompileResult)) @panic("malformed CompileResult message");
@@ -166,11 +166,10 @@ pub fn compileResultMessage(msg_bytes: []u8) error{ OutOfMemory, WriteFailed }!v
     });
     defer gpa.free(inner_html);
 
-    var file_table_html: std.Io.Writer.Allocating = .init(gpa);
-    defer file_table_html.deinit();
-
+    var file_table_html: std.ArrayListUnmanaged(u8) = .empty;
+    defer file_table_html.deinit(gpa);
     for (slowest_files[0..@min(max_table_rows, slowest_files.len)]) |file| {
-        try file_table_html.writer.print(
+        try file_table_html.writer(gpa).print(
             \\<tr>
             \\  <th scope="row"><code>{f}</code></th>
             \\  <td>{D}</td>
@@ -188,17 +187,17 @@ pub fn compileResultMessage(msg_bytes: []u8) error{ OutOfMemory, WriteFailed }!v
         });
     }
     if (slowest_files.len > max_table_rows) {
-        try file_table_html.writer.print(
+        try file_table_html.writer(gpa).print(
             \\<tr><td colspan="4">{d} more rows omitted</td></tr>
             \\
         , .{slowest_files.len - max_table_rows});
     }
 
-    var decl_table_html: std.Io.Writer.Allocating = .init(gpa);
-    defer decl_table_html.deinit();
+    var decl_table_html: std.ArrayListUnmanaged(u8) = .empty;
+    defer decl_table_html.deinit(gpa);
 
     for (slowest_decls[0..@min(max_table_rows, slowest_decls.len)]) |decl| {
-        try decl_table_html.writer.print(
+        try decl_table_html.writer(gpa).print(
             \\<tr>
             \\  <th scope="row"><code>{f}</code></th>
             \\  <th scope="row"><code>{f}</code></th>
@@ -220,7 +219,7 @@ pub fn compileResultMessage(msg_bytes: []u8) error{ OutOfMemory, WriteFailed }!v
         });
     }
     if (slowest_decls.len > max_table_rows) {
-        try decl_table_html.writer.print(
+        try decl_table_html.writer(gpa).print(
             \\<tr><td colspan="6">{d} more rows omitted</td></tr>
             \\
         , .{slowest_decls.len - max_table_rows});
@@ -230,10 +229,10 @@ pub fn compileResultMessage(msg_bytes: []u8) error{ OutOfMemory, WriteFailed }!v
         hdr.step_idx,
         inner_html.ptr,
         inner_html.len,
-        file_table_html.written().ptr,
-        file_table_html.written().len,
-        decl_table_html.written().ptr,
-        decl_table_html.written().len,
+        file_table_html.items.ptr,
+        file_table_html.items.len,
+        decl_table_html.items.ptr,
+        decl_table_html.items.len,
         hdr.flags.use_llvm,
     );
 }

package/compiler/reduce/Walk.zig

@@ -501,10 +501,6 @@ fn walkExpression(w: *Walk, node: Ast.Node.Index) Error!void {
         .@"asm",
         => return walkAsm(w, ast.fullAsm(node).?),
 
-        .asm_legacy => {
-            return walkAsmLegacy(w, ast.legacyAsm(node).?);
-        },
-
         .enum_literal => {
             return walkIdentifier(w, ast.nodeMainToken(node)); // name
         },
@@ -669,7 +665,7 @@ fn walkStructInit(
 
 fn walkCall(w: *Walk, call: Ast.full.Call) Error!void {
     try walkExpression(w, call.ast.fn_expr);
-    try walkExpressions(w, call.ast.params);
+    try walkParamList(w, call.ast.params);
 }
 
 fn walkSlice(
@@ -834,7 +830,7 @@ fn walkWhile(w: *Walk, node_index: Ast.Node.Index, while_node: Ast.full.While) E
 }
 
 fn walkFor(w: *Walk, for_node: Ast.full.For) Error!void {
-    try walkExpressions(w, for_node.ast.inputs);
+    try walkParamList(w, for_node.ast.inputs);
     try walkExpression(w, for_node.ast.then_expr);
     if (for_node.ast.else_expr.unwrap()) |else_expr| {
         try walkExpression(w, else_expr);
@@ -878,12 +874,15 @@ fn walkIf(w: *Walk, node_index: Ast.Node.Index, if_node: Ast.full.If) Error!void
 
 fn walkAsm(w: *Walk, asm_node: Ast.full.Asm) Error!void {
     try walkExpression(w, asm_node.ast.template);
-    try walkExpressions(w, asm_node.ast.items);
+    for (asm_node.ast.items) |item| {
+        try walkExpression(w, item);
+    }
 }
 
-fn walkAsmLegacy(w: *Walk, asm_node: Ast.full.AsmLegacy) Error!void {
-    try walkExpression(w, asm_node.ast.template);
-    try walkExpressions(w, asm_node.ast.items);
+fn walkParamList(w: *Walk, params: []const Ast.Node.Index) Error!void {
+    for (params) |param_node| {
+        try walkExpression(w, param_node);
+    }
 }
 
 /// Check if it is already gutted (i.e. its body replaced with `@trap()`).

package/compiler/reduce.zig

@@ -114,10 +114,10 @@ pub fn main() !void {
     interestingness_argv.appendAssumeCapacity(checker_path);
     interestingness_argv.appendSliceAssumeCapacity(argv);
 
-    var rendered: std.Io.Writer.Allocating = .init(gpa);
+    var rendered = std.array_list.Managed(u8).init(gpa);
     defer rendered.deinit();
 
-    var astgen_input: std.Io.Writer.Allocating = .init(gpa);
+    var astgen_input = std.array_list.Managed(u8).init(gpa);
     defer astgen_input.deinit();
 
     var tree = try parse(gpa, root_source_file_path);
@@ -138,10 +138,10 @@ pub fn main() !void {
         }
     }
 
-    var fixups: Ast.Render.Fixups = .{};
+    var fixups: Ast.Fixups = .{};
     defer fixups.deinit(gpa);
 
-    var more_fixups: Ast.Render.Fixups = .{};
+    var more_fixups: Ast.Fixups = .{};
     defer more_fixups.deinit(gpa);
 
     var rng = std.Random.DefaultPrng.init(seed);
@@ -188,14 +188,15 @@ pub fn main() !void {
             try transformationsToFixups(gpa, arena, root_source_file_path, this_set, &fixups);
 
             rendered.clearRetainingCapacity();
-            try tree.render(gpa, &rendered.writer, fixups);
+            try tree.renderToArrayList(&rendered, fixups);
 
             // The transformations we applied may have resulted in unused locals,
             // in which case we would like to add the respective discards.
             {
-                try astgen_input.writer.writeAll(rendered.written());
-                try astgen_input.writer.writeByte(0);
-                const source_with_null = astgen_input.written()[0..(astgen_input.written().len - 1) :0];
+                try astgen_input.resize(rendered.items.len);
+                @memcpy(astgen_input.items, rendered.items);
+                try astgen_input.append(0);
+                const source_with_null = astgen_input.items[0 .. astgen_input.items.len - 1 :0];
                 var astgen_tree = try Ast.parse(gpa, source_with_null, .zig);
                 defer astgen_tree.deinit(gpa);
                 if (astgen_tree.errors.len != 0) {
@@ -227,12 +228,12 @@ pub fn main() !void {
                     }
                     if (more_fixups.count() != 0) {
                         rendered.clearRetainingCapacity();
-                        try astgen_tree.render(gpa, &rendered.writer, more_fixups);
+                        try astgen_tree.renderToArrayList(&rendered, more_fixups);
                     }
                 }
             }
 
-            try std.fs.cwd().writeFile(.{ .sub_path = root_source_file_path, .data = rendered.written() });
+            try std.fs.cwd().writeFile(.{ .sub_path = root_source_file_path, .data = rendered.items });
             // std.debug.print("trying this code:\n{s}\n", .{rendered.items});
 
             const interestingness = try runCheck(arena, interestingness_argv.items);
@@ -272,8 +273,8 @@ pub fn main() !void {
         // Revert the source back to not be transformed.
         fixups.clearRetainingCapacity();
         rendered.clearRetainingCapacity();
-        try tree.render(gpa, &rendered.writer, fixups);
-        try std.fs.cwd().writeFile(.{ .sub_path = root_source_file_path, .data = rendered.written() });
+        try tree.renderToArrayList(&rendered, fixups);
+        try std.fs.cwd().writeFile(.{ .sub_path = root_source_file_path, .data = rendered.items });
 
         return std.process.cleanExit();
     }
@@ -317,7 +318,7 @@ fn transformationsToFixups(
     arena: Allocator,
     root_source_file_path: []const u8,
     transforms: []const Walk.Transformation,
-    fixups: *Ast.Render.Fixups,
+    fixups: *Ast.Fixups,
 ) !void {
     fixups.clearRetainingCapacity();
 
@@ -358,7 +359,7 @@ fn transformationsToFixups(
                 other_file_ast.deinit(gpa);
             }
 
-            var inlined_fixups: Ast.Render.Fixups = .{};
+            var inlined_fixups: Ast.Fixups = .{};
             defer inlined_fixups.deinit(gpa);
             if (std.fs.path.dirname(inline_imported_file.imported_string)) |dirname| {
                 inlined_fixups.rebase_imported_paths = dirname;
@@ -381,16 +382,16 @@ fn transformationsToFixups(
                 }
             }
 
-            var other_source: std.io.Writer.Allocating = .init(gpa);
+            var other_source = std.array_list.Managed(u8).init(gpa);
             defer other_source.deinit();
-            try other_source.writer.writeAll("struct {\n");
-            try other_file_ast.render(gpa, &other_source.writer, inlined_fixups);
-            try other_source.writer.writeAll("}");
+            try other_source.appendSlice("struct {\n");
+            try other_file_ast.renderToArrayList(&other_source, inlined_fixups);
+            try other_source.appendSlice("}");
 
             try fixups.replace_nodes_with_string.put(
                 gpa,
                 inline_imported_file.builtin_call_node,
-                try arena.dupe(u8, other_source.written()),
+                try arena.dupe(u8, other_source.items),
             );
         },
     };

package/compiler/resinator/compile.zig

@@ -674,7 +674,7 @@ pub const Compiler = struct {
                         }
 
                         try file_reader.seekTo(entry.data_offset_from_start_of_file);
-                        var header_bytes: [16]u8 align(@alignOf(ico.BitmapHeader)) = (file_reader.interface.takeArray(16) catch {
+                        var header_bytes = (file_reader.interface.takeArray(16) catch {
                             return self.iconReadError(
                                 error.UnexpectedEOF,
                                 filename_utf8,

package/compiler_rt/arm.zig

@@ -37,7 +37,7 @@ comptime {
             @export(&__aeabi_memclr4, .{ .name = "__aeabi_memclr4", .linkage = common.linkage, .visibility = common.visibility });
             @export(&__aeabi_memclr8, .{ .name = "__aeabi_memclr8", .linkage = common.linkage, .visibility = common.visibility });
 
-            if (builtin.os.tag == .linux or builtin.os.tag == .freebsd) {
+            if (builtin.os.tag == .linux) {
                 @export(&__aeabi_read_tp, .{ .name = "__aeabi_read_tp", .linkage = common.linkage, .visibility = common.visibility });
             }
 

package/init/build.zig

@@ -44,7 +44,7 @@ pub fn build(b: *std.Build) void {
     // Here we define an executable. An executable needs to have a root module
     // which needs to expose a `main` function. While we could add a main function
     // to the module defined above, it's sometimes preferable to split business
-    // logic and the CLI into two separate modules.
+    // business logic and the CLI into two separate modules.
     //
     // If your goal is to create a Zig library for others to use, consider if
     // it might benefit from also exposing a CLI tool. A parser library for a

package/libc/freebsd/lib/csu/aarch64/crt.h

@@ -0,0 +1 @@
+/* Empty so we can include this unconditionally */

package/libc/freebsd/lib/csu/aarch64/crt1_c.c

@@ -0,0 +1,33 @@
+/* LINTLIBRARY */
+/*-
+ * Copyright 1996-1998 John D. Polstra.
+ * Copyright 2014 Andrew Turner.
+ * Copyright 2014-2015 The FreeBSD Foundation.
+ * All rights reserved.
+ *
+ * Portions of this software were developed by Andrew Turner
+ * under sponsorship from the FreeBSD Foundation.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <sys/cdefs.h>
+#include "csu_common.h"

package/libc/freebsd/lib/csu/aarch64/crt1_s.S

@@ -0,0 +1,68 @@
+/* LINTLIBRARY */
+/*-
+ * Copyright 1996-1998 John D. Polstra.
+ * Copyright 2014 Andrew Turner.
+ * Copyright 2014-2015 The FreeBSD Foundation.
+ * All rights reserved.
+ *
+ * Portions of this software were developed by Andrew Turner
+ * under sponsorship from the FreeBSD Foundation.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <machine/asm.h>
+#include <sys/elf_common.h>
+
+	/*
+	 * The program entry point
+	 * void _start(char **ap, void (*cleanup)(void)) __dead2
+	 */
+ENTRY(_start)
+	.cfi_undefined x30
+	mov	x3, x2		/* cleanup */
+	add	x1, x0, #8	/* load argv */
+	ldr	x0, [x0]	/* load argc */
+	add	x2, x1, x0, lsl #3 /* env is after argv */
+	add	x2, x2, #8	/* argv is null terminated */
+#ifdef PIC
+	adrp	x4, :got:main
+	ldr	x4, [x4, :got_lo12:main]
+#else
+	ldr	x4, =main
+#endif
+#ifdef GCRT
+	ldr	x5, =eprol
+	ldr	x6, =etext
+	/*
+	 * __libc_start1_gcrt(argc, argv, env, cleanup, main, &eprol, &etext)
+	 */
+	bl	__libc_start1_gcrt
+eprol:
+#else
+	/* __libc_start1(argc, argv, env, cleanup, main) */
+	bl	__libc_start1
+#endif
+END(_start)
+
+	.section .note.GNU-stack,"",@progbits
+
+GNU_PROPERTY_AARCH64_FEATURE_1_NOTE(GNU_PROPERTY_AARCH64_FEATURE_1_VAL)

package/libc/freebsd/lib/csu/amd64/crt.h

@@ -0,0 +1,30 @@
+/*-
+ * SPDX-License-Identifier: BSD-1-Clause
+ *
+ * Copyright 2018 Andrew Turner
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef _CRT_H_
+#define	_CRT_H_
+
+/* zig patch: no HAVE_CTORS */
+#define	INIT_CALL_SEQ(func)	"call " __STRING(func)
+
+#endif

package/libc/freebsd/lib/csu/amd64/crt1_c.c

@@ -0,0 +1,30 @@
+/* LINTLIBRARY */
+/*-
+ * SPDX-License-Identifier: BSD-2-Clause
+ *
+ * Copyright 1996-1998 John D. Polstra.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <sys/cdefs.h>
+#include "csu_common.h"

package/libc/freebsd/lib/csu/amd64/crt1_s.S

@@ -0,0 +1,89 @@
+/*-
+ * SPDX-License-Identifier: BSD-2-Clause
+ *
+ * Copyright (C) 2023 Dmitry Chagin <dchagin@FreeBSD.org>
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+
+#include <machine/asm.h>
+
+
+	.text
+	.align 8
+
+	/*
+	 * The program entry point
+	 *		  %rdi		%rsi
+	 * void _start(char **ap, void (*cleanup)(void)) __dead2
+	 */
+	.globl	_start
+	.type	_start, @function
+_start:
+	.cfi_startproc
+	.cfi_undefined %rip		/* Terminate call chain. */
+	pushq	%rbp			/* Align stack, terminate call chain. */
+	.cfi_def_cfa_offset 8
+	movq	%rsp, %rbp
+	.cfi_offset %rbp, -16
+	.cfi_def_cfa_register %rbp
+#ifdef GCRT
+	subq	$16, %rsp
+#endif
+	movq	%rsi, %rcx
+	movq	%rdi, %rsi		/* argv = ap */
+	addq	$8, %rsi		/* argv += 1 */
+	movq	%rdi, %rdx		/* env = ap */
+	addq	$16, %rdx		/* env += 2 */
+	movslq	(%rdi), %rax
+	movl	%eax, %edi		/* argc = *(long *)(void *)ap */
+	shlq	$3, %rax
+	addq	%rax, %rdx		/* env += argc */
+#ifdef PIC
+	/*
+	 * XXX. %rip relative addressing is not intended for use in the
+	 * large memory model due to the offset from %rip being limited
+	 * to 32 bits.
+	 */
+	leaq	main@plt(%rip), %r8
+#else
+	movabsq	$main, %r8
+#endif
+#ifdef GCRT
+	movabsq	$eprol, %r9
+	movabsq	$etext, %rax
+	movq    %rax, (%rsp)
+	/*
+	 *		      %edi  %rsi  %rdx  %rcx    %r8    %r9    (%rsp)
+	 * __libc_start1_gcrt(argc, argv, env, cleanup, main, &eprol, &etext)
+	 */
+	callq	__libc_start1_gcrt
+eprol:
+#else
+	/* __libc_start1(argc, argv, env, cleanup, main) */
+	callq	__libc_start1
+#endif
+	int3
+	.cfi_endproc
+	.size   _start, . - _start
+
+	.section .note.GNU-stack,"",%progbits

package/libc/freebsd/lib/csu/arm/crt.h

@@ -0,0 +1 @@
+/* Empty so we can include this unconditionally */

package/libc/freebsd/lib/csu/arm/crt1_c.c

@@ -0,0 +1,80 @@
+/* LINTLIBRARY */
+/*-
+ * SPDX-License-Identifier: BSD-4-Clause
+ *
+ * Copyright 2001 David E. O'Brien.
+ * All rights reserved.
+ * Copyright 1996-1998 John D. Polstra.
+ * All rights reserved.
+ * Copyright (c) 1997 Jason R. Thorpe.
+ * Copyright (c) 1995 Christopher G. Demetriou
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *          This product includes software developed for the
+ *          FreeBSD Project.  See https://www.freebsd.org/ for
+ *          information about FreeBSD.
+ *          This product includes software developed for the
+ *          NetBSD Project.  See http://www.netbsd.org/ for
+ *          information about NetBSD.
+ * 4. The name of the author may not be used to endorse or promote products
+ *    derived from this software without specific prior written permission
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <sys/cdefs.h>
+#include <sys/param.h>
+#include <sys/elf_common.h>
+
+#include "libc_private.h"
+#include "csu_common.h"
+
+struct Struct_Obj_Entry;
+struct ps_strings;
+
+void _start(int, char **, char **, const struct Struct_Obj_Entry *,
+    void (*)(void), struct ps_strings *) __dead2;
+
+struct ps_strings *__ps_strings;
+
+void __start(int, char **, char **, struct ps_strings *,
+    const struct Struct_Obj_Entry *, void (*)(void)) __dead2;
+
+void
+__start(int argc, char **argv, char **env, struct ps_strings *ps_strings,
+    const struct Struct_Obj_Entry *obj __unused, void (*cleanup)(void))
+{
+	if (ps_strings != (struct ps_strings *)0)
+		__ps_strings = ps_strings;
+
+#ifdef GCRT
+	__libc_start1_gcrt(argc, argv, env, cleanup, main, &eprol, &etext);
+#else
+	__libc_start1(argc, argv, env, cleanup, main);
+#endif
+}
+
+#ifdef GCRT
+__asm__(".text");
+__asm__("eprol:");
+__asm__(".previous");
+#endif