initial commit

This commit is contained in:
i2p
2026-08-27 21:09:14 +00:00
commit a5b6d59437
12681 changed files with 3253832 additions and 0 deletions
+30
View File
@@ -0,0 +1,30 @@
// The interactive workload for scripts/orderfile/generate.ts. Reads stdin,
// writes stdout, drives readline. Traced twice: once on a pipe, once on a
// terminal (ptyrun.c), which is the only way to reach isatty, the window size,
// raw mode, and readline's line editor with its cursor escapes.
//
// Fed "world\none\ntwo\nquit\n". `quit` is what makes it exit, so it never has
// to wait for an end-of-input that a terminal may not deliver.
const { createInterface } = require("node:readline");
const terminal = Boolean(process.stdin.isTTY && process.stdout.isTTY);
process.stdout.write(`tty=${terminal} ${process.stdout.columns ?? 0}x${process.stdout.rows ?? 0}\n`);
process.stdout.write(Buffer.alloc(8192, 0x2e)); // more than one write's worth
if (terminal) {
process.stdout.write(`\ncolors=${process.stdout.hasColors?.(256)}\n`);
process.stdin.setRawMode(true);
process.stdin.setRawMode(false);
}
const rl = createInterface({ input: process.stdin, output: process.stdout, terminal, prompt: "> " });
let lines = 0;
rl.question("\nname? ", name => {
process.stdout.write(`hi ${name.trim()}\n`);
rl.on("line", line => {
process.stdout.write(`${++lines}: ${line.trim()}\n`);
if (line.trim() === "quit") return rl.close();
rl.prompt();
});
rl.prompt();
});
rl.on("close", () => process.stdout.write(`read ${lines} lines\n`));
+541
View File
@@ -0,0 +1,541 @@
// Function-entry tracer for scripts/orderfile/generate.ts.
//
// Records the exact functions a run executes, in first-entry order, by planting
// a breakpoint (x86-64 INT3 / arm64 BRK) at every function's first instruction
// and restoring it the first time it fires. Finer than pagetrace.c's page
// granularity: a page trace lists every function that shares a page with a hot
// one, so a cold function lands at the front of .text just for being a
// neighbour. This lists only functions that actually ran.
//
// The executable mapping is replaced with a copy we hold a writable alias to,
// so the signal handler can restore an instruction without a writable+executable
// page. Linux uses a memfd; macOS promotes the mapping to COW and remaps a
// writable view of the same pages.
//
// The record is an mmap(MAP_SHARED) window over the output file so it survives
// whatever exit path the traced program takes. Layout: five header words then
// `count` u64 link-time addresses in first-entry order.
//
// Function starts are read from a file the generator writes (`nm` addresses),
// not from the loaded symbol table: the linker strips most local symbols from
// .dynsym, and .symtab isn't a loaded segment.
//
// linux: cc -O2 -shared -fPIC -o functrace.so functrace.c -ldl
// macos: cc -O2 -dynamiclib -fPIC -o functrace.dylib functrace.c
// BUN_FUNCTRACE_STARTS=/tmp/starts.bin BUN_FUNCTRACE_OUT=/tmp/trace.bin
// LD_PRELOAD=./functrace.so build/release/bun-profile -e 'console.log(1)'
#if !(defined(__linux__) && (defined(__x86_64__) || defined(__aarch64__))) && \
!(defined(__APPLE__) && defined(__aarch64__))
#error "functrace.c builds on linux x86-64/arm64 or macOS arm64"
#endif
#define _GNU_SOURCE
#define _DARWIN_C_SOURCE
#define _XOPEN_SOURCE 700
#include <dlfcn.h>
#include <pthread.h>
#include <fcntl.h>
#include <signal.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <ucontext.h>
#include <unistd.h>
#if defined(__linux__)
#include <link.h>
#include <sys/syscall.h>
#else
#include <libkern/OSCacheControl.h>
#include <mach/mach.h>
#include <mach/mach_vm.h>
#include <mach-o/dyld.h>
#include <mach-o/loader.h>
#endif
#if defined(__x86_64__)
typedef uint8_t insn_t;
#define BREAKPOINT ((insn_t)0xcc) // INT3
#else
typedef uint32_t insn_t;
#define BREAKPOINT ((insn_t)0xd4200000) // BRK #0
#endif
#define MAX_REGIONS 8
#define STARTS_HEADER_WORDS 3 // u64 magic, version, count
#define TRACE_HEADER_WORDS 5 // u64 magic, version, slide, starts, count
#define STARTS_MAGIC UINT64_C(0x4e55425354525453) // "STRTSBUN" little-endian
#define TRACE_MAGIC UINT64_C(0x4e55424543415254) // "TRACEBUN" little-endian
#define FILE_VERSION UINT64_C(1)
typedef int (*sigaction_fn)(int, const struct sigaction *, struct sigaction *);
static struct {
uintptr_t start, end;
uint8_t *rw; // same bytes, writable
} regions[MAX_REGIONS];
static int region_count = 0;
static uintptr_t slide = 0;
static uintptr_t *starts = NULL; // runtime addresses, sorted
static insn_t *originals = NULL; // instruction that was at starts[i]
static uint8_t *seen = NULL;
static size_t start_count = 0;
static uint64_t *record = NULL;
static int armed = 0;
static int region_of(uintptr_t a)
{
for (int i = 0; i < region_count; i++)
if (a >= regions[i].start && a < regions[i].end) return i;
return -1;
}
static size_t find_start(uintptr_t a)
{
size_t lo = 0, hi = start_count;
while (lo < hi) {
size_t mid = lo + (hi - lo) / 2;
if (starts[mid] < a) lo = mid + 1;
else hi = mid;
}
return (lo < start_count && starts[lo] == a) ? lo : SIZE_MAX;
}
static void sync_icache(uintptr_t rx, void *rw, size_t n)
{
#if defined(__APPLE__)
(void)rw;
sys_icache_invalidate((void *)rx, n);
#elif defined(__aarch64__)
// The memfd is visible at two virtual addresses. Clean the data cache
// through the one we wrote, then invalidate the instruction cache through
// the one that executes.
__builtin___clear_cache((char *)rw, (char *)rw + n);
__builtin___clear_cache((char *)rx, (char *)rx + n);
#else
(void)rx;
(void)rw;
(void)n;
#endif
}
// ─── sigaction interposer ───────────────────────────────────────────────────
// bun installs SIGILL for its crash reporter, and user code can register
// SIGTRAP. Swallow registrations for the signals our breakpoints raise while
// armed so nothing replaces the handler.
static int swallow_signal(int sig)
{
#if defined(__APPLE__)
// arm64 BRK arrives as SIGTRAP on recent kernels and SIGILL on older ones.
return sig == SIGTRAP || sig == SIGILL;
#else
return sig == SIGTRAP;
#endif
}
#if defined(__linux__)
static sigaction_fn real_sigaction;
int sigaction(int sig, const struct sigaction *act, struct sigaction *old)
{
if (!real_sigaction) real_sigaction = (sigaction_fn)dlsym(RTLD_NEXT, "sigaction");
if (armed && swallow_signal(sig)) {
if (old) memset(old, 0, sizeof *old);
return 0;
}
return real_sigaction(sig, act, old);
}
// mimalloc's scavenger (and any library that wants a quiet background thread)
// blocks every signal on it. A blocked synchronous SIGTRAP cannot be delivered,
// and the kernel's answer is to reset the handler to SIG_DFL and kill the
// process — so the first breakpoint that thread touches ends the trace. Strip
// our signals from anything anyone blocks.
typedef int (*sigmask_fn)(int, const sigset_t *, sigset_t *);
static int pass_sigmask(sigmask_fn real, int how, const sigset_t *set, sigset_t *old)
{
if (!armed || !set || how == SIG_UNBLOCK) return real(how, set, old);
sigset_t copy = *set;
sigdelset(&copy, SIGTRAP);
return real(how, &copy, old);
}
int pthread_sigmask(int how, const sigset_t *set, sigset_t *old)
{
static sigmask_fn real;
if (!real) real = (sigmask_fn)dlsym(RTLD_NEXT, "pthread_sigmask");
return pass_sigmask(real, how, set, old);
}
int sigprocmask(int how, const sigset_t *set, sigset_t *old)
{
static sigmask_fn real;
if (!real) real = (sigmask_fn)dlsym(RTLD_NEXT, "sigprocmask");
return pass_sigmask(real, how, set, old);
}
#else
static int interposed_sigaction(int sig, const struct sigaction *act, struct sigaction *old)
{
if (armed && swallow_signal(sig)) {
if (old) memset(old, 0, sizeof *old);
return 0;
}
// dyld interposition does not redirect this dylib's own calls, so this
// reaches the real libSystem sigaction without recursion.
return sigaction(sig, act, old);
}
typedef int (*sigmask_fn)(int, const sigset_t *, sigset_t *);
static int pass_sigmask(sigmask_fn real, int how, const sigset_t *set, sigset_t *old)
{
if (!armed || !set || how == SIG_UNBLOCK) return real(how, set, old);
sigset_t copy = *set;
sigdelset(&copy, SIGTRAP);
sigdelset(&copy, SIGILL);
return real(how, &copy, old);
}
static int interposed_pthread_sigmask(int how, const sigset_t *set, sigset_t *old)
{
return pass_sigmask(pthread_sigmask, how, set, old);
}
static int interposed_sigprocmask(int how, const sigset_t *set, sigset_t *old)
{
return pass_sigmask(sigprocmask, how, set, old);
}
// dyld resolves the traced binary's calls through this table rather than by
// symbol name, so nothing in the binary needs to call dlsym.
__attribute__((used, section("__DATA,__interpose"))) static struct {
const void *replacement;
const void *original;
} interposers[] = {
{ (const void *)interposed_sigaction, (const void *)sigaction },
// mimalloc's scavenger blocks every signal on its background thread. A
// blocked synchronous SIGTRAP cannot be delivered; the kernel's answer is
// to kill the process, which ends the trace at the first breakpoint that
// thread touches. Strip our signals from anything anyone blocks.
{ (const void *)interposed_pthread_sigmask, (const void *)pthread_sigmask },
{ (const void *)interposed_sigprocmask, (const void *)sigprocmask },
};
#endif
// ─── signal handler ─────────────────────────────────────────────────────────
static void on_trap(int sig, siginfo_t *si, void *uc)
{
(void)si;
ucontext_t *ctx = (ucontext_t *)uc;
#if defined(__linux__) && defined(__x86_64__)
// INT3 reports the address after the one-byte instruction.
uintptr_t pc = (uintptr_t)ctx->uc_mcontext.gregs[REG_RIP];
uintptr_t at = pc - 1;
#elif defined(__linux__) && defined(__aarch64__)
uintptr_t pc = (uintptr_t)ctx->uc_mcontext.pc;
uintptr_t at = pc;
#else
uintptr_t pc = (uintptr_t)ctx->uc_mcontext->__ss.__pc;
uintptr_t at = pc;
#endif
size_t i = find_start(at);
#if defined(__aarch64__)
// Older kernels report the instruction after BRK; try both.
if (i == SIZE_MAX && pc >= sizeof(insn_t)) {
at = pc - sizeof(insn_t);
i = find_start(at);
}
#endif
int r = region_of(at);
if (i == SIZE_MAX || r < 0) {
// Not ours: hand it to the default disposition so a real trap still
// crashes at the right address instead of spinning here. INT3 is a
// trap, so on x86-64 RIP is already past it and returning would resume
// there rather than re-execute — raise() re-delivers either way.
armed = 0;
signal(sig, SIG_DFL);
raise(sig);
return;
}
insn_t *rw = (insn_t *)(regions[r].rw + (at - regions[r].start));
__atomic_store_n(rw, originals[i], __ATOMIC_RELEASE);
sync_icache(at, rw, sizeof *rw);
// Several threads can hit the same start before the restore lands; only
// the first records it.
if (__atomic_exchange_n(&seen[i], 1, __ATOMIC_RELAXED) == 0) {
uint64_t n = __atomic_fetch_add(&record[4], 1, __ATOMIC_RELAXED);
if (n < start_count) record[TRACE_HEADER_WORDS + n] = at - slide;
}
#if defined(__linux__) && defined(__x86_64__)
ctx->uc_mcontext.gregs[REG_RIP] = (greg_t)at;
#elif defined(__linux__) && defined(__aarch64__)
ctx->uc_mcontext.pc = at;
#else
ctx->uc_mcontext->__ss.__pc = at;
#endif
}
// ─── executable discovery and remapping ─────────────────────────────────────
static uintptr_t page_align_down(uintptr_t a, uintptr_t p) { return a & ~(p - 1); }
static uintptr_t page_align_up(uintptr_t a, uintptr_t p) { return (a + p - 1) & ~(p - 1); }
#if defined(__linux__)
static int find_image(struct dl_phdr_info *info, size_t _sz, void *_data)
{
(void)_sz;
(void)_data;
if (info->dlpi_name[0] != '\0') return 0; // the main executable has no name here
slide = (uintptr_t)info->dlpi_addr;
long page = sysconf(_SC_PAGESIZE);
for (ElfW(Half) i = 0; i < info->dlpi_phnum; i++) {
const ElfW(Phdr) *ph = &info->dlpi_phdr[i];
if (ph->p_type != PT_LOAD || !(ph->p_flags & PF_X) || region_count == MAX_REGIONS) continue;
uintptr_t start = slide + (uintptr_t)ph->p_vaddr;
regions[region_count].start = page_align_down(start, (uintptr_t)page);
regions[region_count].end = page_align_up(start + (uintptr_t)ph->p_memsz, (uintptr_t)page);
region_count++;
}
return 1;
}
static int remap_executable(void)
{
// Copy each executable segment into a memfd, map it RX over the original
// address, and keep a separate RW alias. The signal handler writes through
// the alias so no page is ever writable and executable at once.
for (int i = 0; i < region_count; i++) {
size_t n = regions[i].end - regions[i].start;
int fd = (int)syscall(SYS_memfd_create, "bun-functrace", 1u /* MFD_CLOEXEC */);
if (fd < 0) return -1;
void *rw = ftruncate(fd, (off_t)n) != 0 ? MAP_FAILED : mmap(NULL, n, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
if (rw == MAP_FAILED) {
close(fd);
return -1;
}
memcpy(rw, (const void *)regions[i].start, n);
void *rx = mmap((void *)regions[i].start, n, PROT_READ | PROT_EXEC, MAP_SHARED | MAP_FIXED, fd, 0);
close(fd);
if (rx == MAP_FAILED) {
munmap(rw, n);
return -1;
}
regions[i].rw = rw;
sync_icache(regions[i].start, rw, n);
}
return 0;
}
#else
static int remap_executable(void)
{
uintptr_t seg_start = 0, seg_end = 0; // page-aligned __TEXT, the span we remap
long page = sysconf(_SC_PAGESIZE);
uint32_t count = _dyld_image_count();
for (uint32_t i = 0; i < count; i++) {
const struct mach_header_64 *mh = (const struct mach_header_64 *)_dyld_get_image_header(i);
if (!mh || mh->magic != MH_MAGIC_64 || mh->filetype != MH_EXECUTE) continue;
slide = (uintptr_t)_dyld_get_image_vmaddr_slide(i);
const uint8_t *lc = (const uint8_t *)(mh + 1);
for (uint32_t c = 0; c < mh->ncmds; c++) {
const struct load_command *cmd = (const struct load_command *)lc;
if (cmd->cmd == LC_SEGMENT_64) {
const struct segment_command_64 *seg = (const struct segment_command_64 *)cmd;
// The __TEXT segment holds the Mach-O header and read-only
// sections alongside __text; nm lists __mh_execute_header as T,
// and patching it replaces the magic number dyld re-reads. Only
// the __text section is code.
if (strncmp(seg->segname, SEG_TEXT, sizeof seg->segname) != 0) {
lc += cmd->cmdsize;
continue;
}
seg_start = page_align_down(slide + (uintptr_t)seg->vmaddr, (uintptr_t)page);
seg_end = page_align_up(slide + (uintptr_t)seg->vmaddr + (uintptr_t)seg->vmsize, (uintptr_t)page);
const struct section_64 *sect = (const struct section_64 *)(seg + 1);
for (uint32_t s = 0; s < seg->nsects; s++) {
if (strncmp(sect[s].sectname, SECT_TEXT, sizeof sect[s].sectname) != 0) continue;
regions[region_count].start = slide + (uintptr_t)sect[s].addr;
regions[region_count].end = regions[region_count].start + (uintptr_t)sect[s].size;
region_count++;
}
}
lc += cmd->cmdsize;
}
break;
}
if (!region_count) return -1;
// VM_PROT_COPY promotes the file-backed pages to anonymous COW copies we
// can write. RWX is refused on __TEXT even with COPY (maxprot stays r-x),
// so the segment goes RW while the alias is set up — this code is in the
// dylib's own __TEXT, so nothing executing right now loses its X bit — and
// back to RX before this function returns either way, so an early return
// anywhere later still leaves the executable runnable. Writes after that
// go through the RW alias; the original stays RX.
size_t n = seg_end - seg_start;
kern_return_t kr =
mach_vm_protect(mach_task_self(), seg_start, n, FALSE, VM_PROT_READ | VM_PROT_WRITE | VM_PROT_COPY);
if (kr != KERN_SUCCESS) return -1;
// Same physical pages, second virtual address: writes through either are
// visible at both. FALSE = shared, not a fresh copy.
mach_vm_address_t alias = 0;
vm_prot_t cur = 0, max = 0;
int ok = mach_vm_remap(mach_task_self(), &alias, n, 0, VM_FLAGS_ANYWHERE, mach_task_self(), seg_start, FALSE, &cur,
&max, VM_INHERIT_NONE) == KERN_SUCCESS &&
mach_vm_protect(mach_task_self(), alias, n, FALSE, VM_PROT_READ | VM_PROT_WRITE) == KERN_SUCCESS;
if (mach_vm_protect(mach_task_self(), seg_start, n, FALSE, VM_PROT_READ | VM_PROT_EXECUTE) != KERN_SUCCESS)
return -1;
if (!ok) return -1;
for (int i = 0; i < region_count; i++) regions[i].rw = (uint8_t *)alias + (regions[i].start - seg_start);
return 0;
}
#endif
// ─── setup ──────────────────────────────────────────────────────────────────
static int cmp_uintptr(const void *a, const void *b)
{
uintptr_t x = *(const uintptr_t *)a, y = *(const uintptr_t *)b;
return (x > y) - (x < y);
}
static int read_starts(const char *path)
{
int fd = open(path, O_RDONLY | O_CLOEXEC);
if (fd < 0) return -1;
struct stat st;
const uint64_t *w = (fstat(fd, &st) != 0 || st.st_size < (off_t)(STARTS_HEADER_WORDS * 8))
? MAP_FAILED
: mmap(NULL, (size_t)st.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
close(fd);
if (w == MAP_FAILED) return -1;
size_t bytes = (size_t)st.st_size;
uint64_t n = w[2];
starts = (w[0] == STARTS_MAGIC && w[1] == FILE_VERSION && n > 0 && n <= bytes / 8 - STARTS_HEADER_WORDS)
? calloc((size_t)n, sizeof *starts)
: NULL;
if (!starts) {
munmap((void *)w, bytes);
return -1;
}
for (size_t i = 0; i < (size_t)n; i++) {
uintptr_t a = slide + (uintptr_t)w[STARTS_HEADER_WORDS + i];
// Drop anything that doesn't land in our own text: the generator may have
// listed a symbol the linker dead-stripped, and patching outside the
// remapped regions would write into whatever happens to be there.
if (region_of(a) < 0 || a % sizeof(insn_t) != 0) continue;
starts[start_count++] = a;
}
munmap((void *)w, bytes);
if (!start_count) return -1;
qsort(starts, start_count, sizeof *starts, cmp_uintptr);
// Drop duplicates, and anything whose first instruction is already a
// breakpoint: JSC's LLInt places int3/brk at never-taken bytecode labels,
// and restoring a breakpoint to a breakpoint loops forever.
size_t unique = 0;
for (size_t i = 0; i < start_count; i++) {
if (unique != 0 && starts[unique - 1] == starts[i]) continue;
if (*(const insn_t *)starts[i] == BREAKPOINT) continue;
starts[unique++] = starts[i];
}
start_count = unique;
return 0;
}
static int install_breakpoints(void)
{
originals = calloc(start_count, sizeof *originals);
seen = calloc(start_count, sizeof *seen);
if (!originals || !seen) return -1;
for (size_t i = 0; i < start_count; i++) {
int r = region_of(starts[i]);
insn_t *p = (insn_t *)(regions[r].rw + (starts[i] - regions[r].start));
originals[i] = *p;
*p = BREAKPOINT;
}
for (int r = 0; r < region_count; r++)
sync_icache(regions[r].start, regions[r].rw, regions[r].end - regions[r].start);
return 0;
}
static int open_record(const char *path)
{
size_t bytes = (TRACE_HEADER_WORDS + start_count) * 8;
int fd = open(path, O_CREAT | O_TRUNC | O_RDWR, 0644);
if (fd < 0) return -1;
void *map = ftruncate(fd, (off_t)bytes) != 0 ? MAP_FAILED
: mmap(NULL, bytes, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
close(fd);
if (map == MAP_FAILED) return -1;
record = map;
record[0] = TRACE_MAGIC;
record[1] = FILE_VERSION;
record[2] = slide;
record[3] = start_count;
return 0;
}
__attribute__((constructor(101))) static void functrace_init(void)
{
const char *starts_env = getenv("BUN_FUNCTRACE_STARTS");
const char *out_env = getenv("BUN_FUNCTRACE_OUT");
if (!starts_env || !out_env) return;
// unsetenv below may invalidate what getenv returned.
char starts_path[1024], out_path[1024];
snprintf(starts_path, sizeof starts_path, "%s", starts_env);
snprintf(out_path, sizeof out_path, "%s", out_env);
// Take ourselves out of the environment so a child exec'd by the workload
// (lifecycle scripts, shells) does not re-arm over the trace this process
// is still writing. ptyrun hands the preload down to the one process that
// should have it.
#if defined(__linux__)
unsetenv("LD_PRELOAD");
#else
unsetenv("DYLD_INSERT_LIBRARIES");
#endif
unsetenv("BUN_FUNCTRACE_STARTS");
unsetenv("BUN_FUNCTRACE_OUT");
#if defined(__linux__)
dl_iterate_phdr(find_image, NULL);
if (!region_count) return;
if (remap_executable() != 0) return;
#else
if (remap_executable() != 0) return;
#endif
if (read_starts(starts_path) != 0) return;
// The record backs every trap, so it must exist before the first breakpoint
// can fire: `install_breakpoints()` is the point of no return.
if (open_record(out_path) != 0) return;
static char altstack[256 * 1024];
stack_t ss = { .ss_sp = altstack, .ss_size = sizeof altstack, .ss_flags = 0 };
sigaltstack(&ss, NULL);
struct sigaction sa;
memset(&sa, 0, sizeof sa);
sa.sa_sigaction = on_trap;
sa.sa_flags = SA_SIGINFO | SA_ONSTACK | SA_NODEFER;
sigemptyset(&sa.sa_mask);
#if defined(__linux__)
real_sigaction = (sigaction_fn)dlsym(RTLD_NEXT, "sigaction");
if (!real_sigaction) return;
real_sigaction(SIGTRAP, &sa, NULL);
#else
sigaction(SIGTRAP, &sa, NULL);
sigaction(SIGILL, &sa, NULL);
#endif
if (install_breakpoints() != 0) return;
armed = 1;
}
+364
View File
@@ -0,0 +1,364 @@
#!/usr/bin/env bun
/**
* Generates the linker symbol-ordering file that packs bun's startup-hot
* functions together at the front of `.text`.
*
* Why it exists: a `bun -e 'console.log(1)'` only executes ~5k of bun's ~80k
* functions, but they are scattered over a 50 MB `.text`, and the kernel faults
* in 16-64 KB around every one of them. Sorting those functions to the front
* cuts the resident binary pages roughly in half with no change to the binary's
* size and no change to what the code does.
*
* How: `functrace.c` is an injected-library shim that plants a breakpoint (INT3
* on x86-64, BRK on arm64) at every function's first instruction and restores
* it the first time it fires, so it records exactly the functions a run enters.
* We run a handful of representative workloads, map every recorded address back
* to its linker-visible name (`nm` on the unstripped binary), and emit those
* names in first-entry order. Symbols the linker cannot find are ignored, so
* the file degrades gracefully as code moves.
*
* This replaced an earlier page-fault tracer. A page trace lists every function
* that shares a page with a hot one, so ~5k real entries turned into ~38k
* names, most of which never ran; the extra names still sort to the front and
* dilute the hot set. Recording exact entries lists only what ran.
*
* One workload runs under `ptyrun.c`, on a pseudo-terminal: bun's stdio, tty
* and readline code is a different path on a terminal than on a pipe, and the
* functions it reaches are a couple of thousand that no other workload touches.
*
* The file is never committed. Release builds generate it from their own pass-1
* binary and relink against it; canary builds inherit the last successful
* build's file and re-publish it (scripts/build/ci.ts — inheritOrderFile /
* packageAndUpload). Locally:
*
* bun run orderfile # uses build/release, writes build/release/linker.order
* bun run orderfile -- --build-dir=build/release-lto
*
* Generating against the profile you ship is worth ~1 MB of RSS: the LTO build
* linked with a file generated from the plain release build lands at 22.6 MB,
* and at 21.6 MB with its own.
*
* Linux x86-64/arm64 and macOS arm64. Linux is the lld `--symbol-ordering-file`
* input; macOS is Apple ld's `-order_file`.
*/
import { spawnSync } from "node:child_process";
import { copyFileSync, existsSync, mkdirSync, mkdtempSync, readFileSync, rmSync, writeFileSync } from "node:fs";
import { tmpdir } from "node:os";
import { dirname, join, resolve } from "node:path";
import { fileURLToPath } from "node:url";
const STARTS_HEADER_WORDS = 3; // must match functrace.c: magic, version, count
const TRACE_HEADER_WORDS = 5; // magic, version, slide, starts, count
const STARTS_MAGIC = 0x4e55425354525453n; // "STRTSBUN"
const TRACE_MAGIC = 0x4e55424543415254n; // "TRACEBUN"
// `import.meta.dir` is Bun-only; scripts/build/ imports this under node too.
const here = dirname(fileURLToPath(import.meta.url));
/**
* A trace that resolves almost nothing is worse than no file at all: it silently
* costs the win while looking like it worked. A real `bun -e` alone lands near
* ~5k entries, so anything this low means the tracer or the symbol table broke.
*/
const MIN_FUNCTIONS = 4000;
/**
* A workload that blows through this is hung — an interactive one waiting on an
* end-of-input that never comes, say — and a release build must not hang with it.
*/
const WORKLOAD_TIMEOUT_MS = 120_000;
/** Typed into cli-fixture.js. `quit` is what makes it exit. */
const CLI_INPUT = "world\none\ntwo\nquit\n";
interface Workload {
name: string;
args: string[];
/** Working directory for the traced process. */
cwd?: string;
/** Typed into stdin; on a terminal it arrives as keystrokes. */
input?: string;
/** Run on a pseudo-terminal rather than pipes (see ptyrun.c). */
tty?: boolean;
env?: Record<string, string>;
}
export interface RunOptions {
env?: Record<string, string | undefined> | undefined;
cwd?: string | undefined;
input?: string | undefined;
timeout?: number | undefined;
/** How the command is named in errors. Defaults to the executable. */
label?: string | undefined;
}
/**
* Runs a command to completion, throwing if it could not be spawned. Exported so
* a test can drive it under node: bun's spawnSync delivers `input` whatever stdin
* is, so the wiring below only ever breaks on CI, which builds under node.
*/
export function runCommand(cmd: string[], options: RunOptions = {}) {
const r = spawnSync(cmd[0]!, cmd.slice(1), {
env: { ...process.env, ...options.env },
cwd: options.cwd,
input: options.input,
timeout: options.timeout,
// Only a pipe carries `input`: node drops it when stdin is "ignore", and
// then an interactive workload reads nothing and waits forever for a line.
stdio: [options.input === undefined ? "ignore" : "pipe", "pipe", "pipe"],
maxBuffer: 1 << 29, // nm prints ~10 MB of symbols
});
// A timeout arrives here too: spawnSync reports it as an ETIMEDOUT error.
if (r.error) throw new Error(`${options.label ?? cmd[0]}: ${r.error.message}`);
return r;
}
export interface GenerateOptions {
/** Build directory holding the unstripped binary. */
buildDir: string;
/** Unstripped binary to trace. Defaults to `bun-profile`; an assertions build names it differently. */
exeName?: string;
/** Where to write the order file. Defaults to `<buildDir>/linker.order`. */
outPath?: string;
/** Fail if fewer than this many functions were traced. */
minFunctions?: number;
/** Print per-workload progress. */
verbose?: boolean;
}
/**
* Linker-visible function names, by address. Multiple names can share one
* address (aliases, and ICF on darwin), and the order file must list every name
* the linker might know a function by. On macOS nm prints names with the C
* leading underscore, which is also what `-order_file` expects, so no
* stripping — lld and ld take exactly what nm gave.
*/
function readSymbolTable(bunProfile: string): Map<number, string[]> {
// Bare `nm` with no GNU-only long options: the regex below is the
// defined-text-symbol filter, and nothing here depends on output order.
const nm = process.env.NM || "nm";
const r = runCommand([nm, bunProfile]);
if (r.status !== 0) throw new Error(`${nm} failed on ${bunProfile}\n${r.stderr}`);
const symbols = new Map<number, string[]>();
for (const line of r.stdout.toString().split("\n")) {
const m = /^([0-9a-f]+) ([tT]) (\S+)$/.exec(line);
if (!m) continue;
const address = parseInt(m[1]!, 16);
const names = symbols.get(address);
if (names) names.push(m[3]!);
else symbols.set(address, [m[3]!]);
}
if (symbols.size === 0) throw new Error(`${nm} reported no text symbols — is ${bunProfile} stripped?`);
return symbols;
}
/** Write function starts for functrace.c: u64 magic, version, count, addresses. */
function writeStarts(path: string, addresses: number[]): void {
const buffer = new ArrayBuffer((STARTS_HEADER_WORDS + addresses.length) * 8);
const words = new BigUint64Array(buffer);
words[0] = STARTS_MAGIC;
words[1] = 1n;
words[2] = BigInt(addresses.length);
for (let i = 0; i < addresses.length; i++) words[STARTS_HEADER_WORDS + i] = BigInt(addresses[i]!);
writeFileSync(path, new Uint8Array(buffer));
}
/** Read a trace functrace.c wrote: first-entry addresses, slide already removed. */
function readTrace(path: string, name: string): number[] {
const raw = readFileSync(path);
if (raw.byteLength < TRACE_HEADER_WORDS * 8) throw new Error(`workload "${name}" wrote a truncated trace`);
const header = new BigUint64Array(raw.buffer, raw.byteOffset, TRACE_HEADER_WORDS);
if (header[0] !== TRACE_MAGIC || header[1] !== 1n) throw new Error(`workload "${name}" wrote an invalid trace`);
const count = Number(header[4]);
if (count === 0) throw new Error(`workload "${name}" recorded no entries — is the tracer loading?`);
const body = new BigUint64Array(raw.buffer, raw.byteOffset + TRACE_HEADER_WORDS * 8, count);
const out: number[] = new Array(count);
for (let i = 0; i < count; i++) out[i] = Number(body[i]);
return out;
}
export function generateOrderFile(options: GenerateOptions): { count: number; outPath: string } {
const buildDir = resolve(options.buildDir);
const outPath = resolve(options.outPath ?? join(buildDir, "linker.order"));
const minFunctions = options.minFunctions ?? MIN_FUNCTIONS;
const log = (message: string) => options.verbose && console.log(message);
const darwin = process.platform === "darwin";
if (process.platform !== "linux" && !(darwin && process.arch === "arm64")) {
throw new Error("the order file tracer builds on linux x86-64/arm64 or macOS arm64");
}
// The unstripped binary: its symbol table is what maps addresses back to names.
const bunProfile = join(buildDir, options.exeName ?? "bun-profile");
if (!existsSync(bunProfile)) {
throw new Error(`${bunProfile} not found — build it first (bun run build:release)`);
}
const scratch = mkdtempSync(join(tmpdir(), "bun-orderfile-"));
try {
// ── Build the tracer and the pty runner ───────────────────────────────────
const tracer = join(scratch, darwin ? "functrace.dylib" : "functrace.so");
const ptyrun = join(scratch, "ptyrun");
const cc = process.env.CC || "cc";
const build = runCommand(
darwin
? [cc, "-O2", "-dynamiclib", "-fPIC", "-o", tracer, join(here, "functrace.c")]
: [cc, "-O2", "-shared", "-fPIC", "-o", tracer, join(here, "functrace.c"), "-ldl", "-lpthread"],
);
if (build.status !== 0) throw new Error(`failed to build the tracer with ${cc}\n${build.stderr}`);
const pty = runCommand([cc, "-O2", "-o", ptyrun, join(here, "ptyrun.c"), ...(darwin ? [] : ["-lutil"])]);
if (pty.status !== 0) throw new Error(`failed to build the pty runner with ${cc}\n${pty.stderr}`);
// ── Symbol table and function starts ──────────────────────────────────────
const symbols = readSymbolTable(bunProfile);
const startsPath = join(scratch, "starts.bin");
writeStarts(
startsPath,
[...symbols.keys()].sort((a, b) => a - b),
);
// ── Representative workloads ──────────────────────────────────────────────
// Order matters: earlier workloads get the densest placement, so the plain
// runtime startup path comes first.
const fixtures = join(scratch, "fixtures");
mkdirSync(join(fixtures, "tests"), { recursive: true });
writeFileSync(
join(fixtures, "hello.ts"),
`const greet = (name: string): string => \`hi \${name}\`;\nconsole.log(greet("world"));\n`,
);
writeFileSync(
join(fixtures, "server.js"),
`const server = Bun.serve({ port: 0, fetch: () => new Response("ok") });\n` +
`for (let i = 0; i < 50; i++) await (await fetch(\`http://localhost:\${server.port}/\`)).text();\n` +
`server.stop(true);\n`,
);
writeFileSync(
join(fixtures, "tests", "example.test.ts"),
`import { expect, test } from "bun:test";\ntest("passes", () => { expect(1).toBe(1); });\n`,
);
// Reads stdin, writes stdout, drives readline — run once on a pipe and once
// on a terminal.
copyFileSync(join(here, "cli-fixture.js"), join(fixtures, "cli.js"));
// `bun install`, offline: the one dependency is a tarball packed by the binary
// we are about to trace, so a slow registry cannot cost a release its order
// file. The rest is the real path — lockfile, extraction, node_modules.
const dependency = join(fixtures, "dep");
const app = join(fixtures, "app");
mkdirSync(dependency);
mkdirSync(app);
writeFileSync(
join(dependency, "package.json"),
`{ "name": "orderfile-dep", "version": "1.0.0", "main": "index.js" }\n`,
);
writeFileSync(join(dependency, "index.js"), `module.exports = 1;\n`);
const pack = runCommand([bunProfile, "pm", "pack", "--filename", "dep.tgz"], {
cwd: dependency,
label: "bun pm pack",
});
if (pack.status !== 0) throw new Error(`could not pack the install fixture\n${pack.stderr}`);
writeFileSync(
join(app, "package.json"),
`{ "name": "orderfile-app", "version": "0.0.0", ` +
`"dependencies": { "orderfile-dep": "file:../dep/dep.tgz" } }\n`,
);
const installEnv = { BUN_INSTALL_CACHE_DIR: join(scratch, "install-cache") };
const workloads: Workload[] = [
{ name: "bun -e", args: ["-e", "console.log(1)"] },
{ name: "bun hello.ts", args: [join(fixtures, "hello.ts")] },
{ name: "bun server.js", args: [join(fixtures, "server.js")] },
{ name: "bun test", args: ["test", join(fixtures, "tests", "example.test.ts")] },
{ name: "bun install", args: ["install"], cwd: app, env: installEnv },
{ name: "bun install (cached)", args: ["install"], cwd: app, env: installEnv },
{ name: "bun cli.js (pipe)", args: [join(fixtures, "cli.js")], input: CLI_INPUT },
{
name: "bun cli.js (tty)",
args: [join(fixtures, "cli.js")],
input: CLI_INPUT,
tty: true,
env: { TERM: "xterm-256color" },
},
];
// ── Trace each workload, emit every name not yet seen ─────────────────────
const order: string[] = [];
const seen = new Set<string>();
for (const [i, workload] of workloads.entries()) {
const out = join(scratch, `trace-${i}.bin`);
// The tracer loads into the traced process and nowhere else. On a terminal
// ptyrun is the parent, so it is the one that hands the preload down.
const preloadVar = darwin ? "DYLD_INSERT_LIBRARIES" : "LD_PRELOAD";
const preload = workload.tty ? { PTYRUN_PRELOAD: tracer } : { [preloadVar]: tracer };
const r = runCommand(workload.tty ? [ptyrun, bunProfile, ...workload.args] : [bunProfile, ...workload.args], {
env: {
...preload,
BUN_FUNCTRACE_STARTS: startsPath,
BUN_FUNCTRACE_OUT: out,
BUN_DEBUG_QUIET_LOGS: "1",
...workload.env,
},
cwd: workload.cwd,
input: workload.input,
timeout: WORKLOAD_TIMEOUT_MS,
label: `workload "${workload.name}"`,
});
if (r.status !== 0) throw new Error(`workload "${workload.name}" exited ${r.status}\n${r.stderr}`);
const before = order.length;
let unresolved = 0;
for (const address of readTrace(out, workload.name)) {
const names = symbols.get(address);
if (!names) {
unresolved++;
continue;
}
for (const name of names) {
if (seen.has(name)) continue;
seen.add(name);
order.push(name);
}
}
const note = unresolved ? ` (${unresolved} unresolved)` : "";
log(` ${workload.name.padEnd(21)} +${order.length - before} functions${note}`);
}
if (order.length < minFunctions) {
throw new Error(
`traced only ${order.length} functions, expected at least ${minFunctions}` +
`the tracer or the symbol table is broken, and a near-empty order file silently costs the win`,
);
}
const header = [
`# ${darwin ? "ld -order_file" : "lld --symbol-ordering-file"}: functions bun executes while starting up,`,
"# in first-entry order, so they land together at the front of .text.",
"# Generated by scripts/orderfile/generate.ts — not committed.",
`# ${order.length} functions from ${workloads.length} workloads.`,
];
writeFileSync(outPath, header.join("\n") + "\n" + order.join("\n") + "\n");
return { count: order.length, outPath };
} finally {
rmSync(scratch, { recursive: true, force: true });
}
}
if (import.meta.main) {
const repoRoot = resolve(here, "..", "..");
const arg = (name: string, fallback?: string): string | undefined => {
const hit = process.argv.find(a => a.startsWith(`--${name}=`));
return hit ? hit.slice(name.length + 3) : fallback;
};
const buildDir = resolve(repoRoot, arg("build-dir", "build/release")!);
// Relative --out is repo-root-relative, matching --build-dir.
const out = arg("out");
try {
const options = { buildDir, verbose: true, ...(out ? { outPath: resolve(repoRoot, out) } : {}) };
const { count, outPath } = generateOrderFile(options);
console.log(`wrote ${outPath} (${count} functions)`);
} catch (error) {
console.error(`error: ${(error as Error).message}`);
process.exit(1);
}
}
+91
View File
@@ -0,0 +1,91 @@
// Runs a command on a pseudo-terminal, used by scripts/orderfile/generate.ts.
//
// bun takes a different path on a terminal than on a pipe — isatty, TIOCGWINSZ,
// raw mode, readline's line editor and its cursor escapes — and nothing but a
// real pty reaches it. So one workload runs under this.
//
// cc -O2 -o ptyrun ptyrun.c -lutil
// printf 'hi\n' | ./ptyrun bun cli.js
//
// Our stdin is typed into the terminal and the child's output is forwarded to
// ours, so a workload looks the same to the caller either way. Exits with the
// child's status.
//
// PTYRUN_PRELOAD becomes the child's LD_PRELOAD (DYLD_INSERT_LIBRARIES on
// macOS). The tracer belongs in the binary being traced and nowhere else, and
// it drops itself from the environment once loaded, so it is handed down here
// rather than inherited.
#define _GNU_SOURCE
#include <errno.h>
#include <poll.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/ioctl.h>
#include <sys/wait.h>
#include <unistd.h>
#if defined(__APPLE__)
#include <util.h>
#define PRELOAD_VAR "DYLD_INSERT_LIBRARIES"
#else
#include <pty.h>
#define PRELOAD_VAR "LD_PRELOAD"
#endif
#define EOT 4 // ^D: how a terminal says end-of-input
int main(int argc, char **argv)
{
if (argc < 2) {
fprintf(stderr, "usage: ptyrun <command> [args...]\n");
return 2;
}
struct winsize window = { .ws_row = 24, .ws_col = 80 };
int master = -1;
pid_t child = forkpty(&master, NULL, NULL, &window);
if (child < 0) {
perror("forkpty");
return 2;
}
if (child == 0) {
const char *preload = getenv("PTYRUN_PRELOAD");
if (preload && *preload) setenv(PRELOAD_VAR, preload, 1);
execvp(argv[1], &argv[1]);
perror(argv[1]);
_exit(127);
}
// Drain the child's output — a full pty buffer would block it — and type
// whatever arrives on our stdin into the terminal.
char buffer[8192];
struct pollfd fds[2] = { { .fd = master, .events = POLLIN }, { .fd = STDIN_FILENO, .events = POLLIN } };
for (;;) {
if (poll(fds, 2, -1) < 0) {
if (errno == EINTR) continue;
break;
}
if (fds[0].revents) {
ssize_t n = read(master, buffer, sizeof buffer);
if (n <= 0) break; // EIO once the child has closed its side
if (write(STDOUT_FILENO, buffer, (size_t)n) < 0) break;
}
if (fds[1].revents) {
ssize_t n = read(STDIN_FILENO, buffer, sizeof buffer);
if (n > 0) {
if (write(master, buffer, (size_t)n) < 0) break;
} else {
// Out of input. Closing the master instead would SIGHUP the child.
char eof = EOT;
fds[1].fd = -1;
if (write(master, &eof, 1) < 0) break;
}
}
}
int status = 0;
if (waitpid(child, &status, 0) < 0) {
perror("waitpid");
return 2;
}
return WIFEXITED(status) ? WEXITSTATUS(status) : 1;
}