-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathtest_runner.zig
More file actions
478 lines (404 loc) · 14.9 KB
/
test_runner.zig
File metadata and controls
478 lines (404 loc) · 14.9 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
// in your build.zig, you can specify a custom test runner:
// const tests = b.addTest(.{
// .root_module = $MODULE_BEING_TESTED,
// .test_runner = .{ .path = b.path("test_runner.zig"), .mode = .simple },
// });
pub const std_options = std.Options{
.log_scope_levels = &[_]std.log.ScopeLevel{
.{ .scope = .websocket, .level = .warn },
},
.logFn = customLogFn,
};
const std = @import("std");
const builtin = @import("builtin");
const Io = std.Io;
const Allocator = std.mem.Allocator;
const BORDER = "=" ** 80;
// Log capture for suppressing logs in passing tests.
// The Io is stashed at startup so the global log callback can perform mutex
// operations without having to thread `Io` through every call site.
const LogCapture = struct {
capture_writer: ?*std.Io.Writer = null,
mutex: Io.Mutex = .init,
io: ?Io = null,
pub fn logFn(
self: *@This(),
comptime level: std.log.Level,
comptime scope: @TypeOf(.enum_literal),
comptime format: []const u8,
args: anytype,
) void {
const io = self.io orelse {
// No Io available yet — fall back to raw stderr.
const scope_prefix = "(" ++ @tagName(scope) ++ "/" ++ @tagName(level) ++ "): ";
std.debug.print(scope_prefix ++ format ++ "\n", args);
return;
};
self.mutex.lockUncancelable(io);
defer self.mutex.unlock(io);
const scope_prefix = "(" ++ @tagName(scope) ++ "/" ++ @tagName(level) ++ "): ";
if (self.capture_writer) |writer| {
// Write to capture buffer
writer.print(scope_prefix ++ format ++ "\n", args) catch return;
} else {
// Write to stderr (std.debug.print handles its own locking)
std.debug.print(scope_prefix ++ format ++ "\n", args);
}
}
pub fn startCapture(self: *@This(), io: Io, writer: *std.Io.Writer) void {
self.mutex.lockUncancelable(io);
defer self.mutex.unlock(io);
self.capture_writer = writer;
}
pub fn stopCapture(self: *@This(), io: Io) void {
self.mutex.lockUncancelable(io);
defer self.mutex.unlock(io);
self.capture_writer = null;
}
};
var log_capture = LogCapture{};
pub fn customLogFn(
comptime level: std.log.Level,
comptime scope: @TypeOf(.enum_literal),
comptime format: []const u8,
args: anytype,
) void {
log_capture.logFn(level, scope, format, args);
}
// use in custom panic handler
var current_test: ?[]const u8 = null;
pub fn main(init: std.process.Init) !void {
const io = init.io;
const gpa = init.gpa;
log_capture.io = io;
defer log_capture.io = null;
var env = Env.init(gpa, init.environ_map);
defer env.deinit(gpa);
var slowest = SlowTracker.init(io, 5);
defer slowest.deinit(gpa);
var pass: usize = 0;
var fail: usize = 0;
var skip: usize = 0;
var leak: usize = 0;
var log_buffer: std.Io.Writer.Allocating = .init(gpa);
defer log_buffer.deinit();
var failed_tests: std.ArrayList([]const u8) = .empty;
defer failed_tests.deinit(gpa);
Printer.fmt("\r\x1b[0K", .{}); // beginning of line and clear to end of line
for (builtin.test_functions) |t| {
if (isSetup(t)) {
t.func() catch |err| {
Printer.status(.fail, "\nsetup \"{s}\" failed: {}\n", .{ t.name, err });
return err;
};
}
}
// Count total tests to run
const test_count = blk: {
var count: usize = 0;
for (builtin.test_functions) |t| {
if (isSetup(t) or isTeardown(t)) continue;
const is_unnamed_test = isUnnamed(t);
if (env.filters.items.len > 0) {
if (is_unnamed_test) continue;
var matches = false;
for (env.filters.items) |f| {
if (std.mem.indexOf(u8, t.name, f) != null) {
matches = true;
break;
}
}
if (!matches) continue;
}
count += 1;
}
break :blk count;
};
const root_node = if (env.verbose == .off) std.Progress.start(io, .{
.root_name = "Running tests",
.estimated_total_items = test_count,
}) else std.Progress.Node.none;
var test_index: usize = 0;
for (builtin.test_functions) |t| {
if (isSetup(t) or isTeardown(t)) {
continue;
}
var status = Status.pass;
slowest.startTiming(io);
const is_unnamed_test = isUnnamed(t);
if (env.filters.items.len > 0) {
if (is_unnamed_test) {
continue;
}
var matches = false;
for (env.filters.items) |f| {
if (std.mem.indexOf(u8, t.name, f) != null) {
matches = true;
break;
}
}
if (!matches) {
continue;
}
}
const friendly_name = t.name;
// Update progress
if (root_node.index != .none) {
root_node.setCompletedItems(test_index);
// Progress truncates at 40 chars, so show the end of long names
const display_name = if (friendly_name.len <= std.Progress.Node.max_name_len)
friendly_name
else
friendly_name[friendly_name.len - std.Progress.Node.max_name_len ..];
root_node.setName(display_name);
}
test_index += 1;
current_test = friendly_name;
std.testing.allocator_instance = .{};
if (env.do_log_capture) {
log_buffer.clearRetainingCapacity();
log_capture.startCapture(io, &log_buffer.writer);
}
// Print test name before running (for debugging hangs)
switch (env.verbose) {
.naming => Printer.fmt("{s} .. ", .{friendly_name}),
.tracing => Printer.fmt("{s}\n", .{friendly_name}),
.off => {},
}
const result = t.func();
if (env.do_log_capture) {
log_capture.stopCapture(io);
}
current_test = null;
const ns_taken = slowest.endTiming(io, gpa, friendly_name);
if (std.testing.allocator_instance.deinit() == .leak) {
leak += 1;
Printer.status(.fail, "\n{s}\n\"{s}\" - Memory Leak\n{s}\n", .{ BORDER, friendly_name, BORDER });
}
var fail_err: ?anyerror = null;
if (result) |_| {
pass += 1;
} else |err| switch (err) {
error.SkipZigTest => {
skip += 1;
status = .skip;
},
else => {
status = .fail;
fail += 1;
fail_err = err;
failed_tests.append(gpa, friendly_name) catch {};
},
}
const ms = @as(f64, @floatFromInt(ns_taken)) / 1_000_000.0;
const status_str = switch (status) {
.pass => "OK",
.fail => "FAIL",
.skip => "SKIP",
.text => "",
};
switch (env.verbose) {
.naming => {
Printer.status(status, "{s}", .{status_str});
Printer.fmt(" ({d:.2}ms)\n", .{ms});
},
.tracing => {
Printer.fmt(" ", .{});
Printer.status(status, "{s}", .{status_str});
Printer.fmt(" ({d:.2}ms)\n", .{ms});
},
.off => {},
}
// Print error details for failures (in non-verbose mode, progress will show above this)
if (fail_err) |err| {
Printer.fmt("{s}\n", .{BORDER});
Printer.status(.fail, "\"{s}\" - {s}\n", .{ friendly_name, @errorName(err) });
// Print captured logs for failed tests
if (log_buffer.written().len > 0) {
Printer.fmt("Test output:\n{s}", .{log_buffer.written()});
}
Printer.fmt("{s}\n", .{BORDER});
if (@errorReturnTrace()) |trace| {
std.debug.dumpErrorReturnTrace(trace);
}
if (env.fail_first) {
break;
}
}
}
for (builtin.test_functions) |t| {
if (isTeardown(t)) {
t.func() catch |err| {
Printer.status(.fail, "\nteardown \"{s}\" failed: {}\n", .{ t.name, err });
return err;
};
}
}
// End progress before printing summary
if (root_node.index != .none) {
root_node.end();
}
const total_tests = pass + fail;
const status = if (fail == 0) Status.pass else Status.fail;
Printer.status(status, "\n{d} of {d} test{s} passed\n", .{ pass, total_tests, if (total_tests != 1) "s" else "" });
if (skip > 0) {
Printer.status(.skip, "{d} test{s} skipped\n", .{ skip, if (skip != 1) "s" else "" });
}
if (leak > 0) {
Printer.status(.fail, "{d} test{s} leaked\n", .{ leak, if (leak != 1) "s" else "" });
}
if (failed_tests.items.len > 0) {
Printer.fmt("\n", .{});
Printer.fmt("Failed tests:\n", .{});
for (failed_tests.items) |name| {
Printer.fmt(" {s}\n", .{name});
}
}
Printer.fmt("\n", .{});
try slowest.display();
Printer.fmt("\n", .{});
std.process.exit(if (fail == 0) 0 else 1);
}
const Printer = struct {
fn fmt(comptime format: []const u8, args: anytype) void {
std.debug.print(format, args);
}
fn status(s: Status, comptime format: []const u8, args: anytype) void {
switch (s) {
.pass => std.debug.print("\x1b[32m", .{}),
.fail => std.debug.print("\x1b[31m", .{}),
.skip => std.debug.print("\x1b[33m", .{}),
else => {},
}
std.debug.print(format ++ "\x1b[0m", args);
}
};
const Status = enum {
pass,
fail,
skip,
text,
};
const SlowTracker = struct {
const SlowestQueue = std.PriorityDequeue(TestInfo, void, compareTiming);
max: usize,
slowest: SlowestQueue,
started: Io.Clock.Timestamp,
fn init(io: Io, count: u32) SlowTracker {
return .{
.max = count,
.started = .now(io, .awake),
.slowest = SlowestQueue.initContext({}),
};
}
const TestInfo = struct {
ns: u64,
name: []const u8,
};
fn deinit(self: *SlowTracker, allocator: Allocator) void {
self.slowest.deinit(allocator);
}
fn startTiming(self: *SlowTracker, io: Io) void {
self.started = .now(io, .awake);
}
fn endTiming(self: *SlowTracker, io: Io, allocator: Allocator, test_name: []const u8) u64 {
const now = Io.Clock.Timestamp.now(io, .awake);
const ns: u64 = @intCast(self.started.durationTo(now).raw.nanoseconds);
var slowest = &self.slowest;
if (slowest.count() < self.max) {
// Capacity is fixed to the # of slow tests we want to track
// If we've tracked fewer tests than this capacity, than always add
slowest.push(allocator, TestInfo{ .ns = ns, .name = test_name }) catch @panic("failed to track test timing");
return ns;
}
{
// Optimization to avoid shifting the dequeue for the common case
// where the test isn't one of our slowest.
const fastest_of_the_slow = slowest.peekMin() orelse unreachable;
if (fastest_of_the_slow.ns > ns) {
// the test was faster than our fastest slow test, don't add
return ns;
}
}
// the previous fastest of our slow tests, has been pushed off.
_ = slowest.popMin();
slowest.push(allocator, TestInfo{ .ns = ns, .name = test_name }) catch @panic("failed to track test timing");
return ns;
}
fn display(self: *SlowTracker) !void {
var slowest = self.slowest;
const count = slowest.count();
Printer.fmt("Slowest {d} test{s}: \n", .{ count, if (count != 1) "s" else "" });
while (slowest.popMin()) |info| {
const ms = @as(f64, @floatFromInt(info.ns)) / 1_000_000.0;
Printer.fmt(" {d:.2}ms\t{s}\n", .{ ms, info.name });
}
}
fn compareTiming(context: void, a: TestInfo, b: TestInfo) std.math.Order {
_ = context;
return std.math.order(a.ns, b.ns);
}
};
const Env = struct {
const Verbose = enum { off, naming, tracing };
verbose: Verbose,
fail_first: bool,
filters: std.ArrayList([]const u8),
do_log_capture: bool,
fn init(allocator: Allocator, environ_map: *std.process.Environ.Map) Env {
var filters: std.ArrayList([]const u8) = .empty;
if (environ_map.get("TEST_FILTER")) |filter_str| {
var iter = std.mem.splitScalar(u8, filter_str, '|');
while (iter.next()) |part| {
const trimmed = std.mem.trim(u8, part, " \t");
if (trimmed.len > 0) {
const owned = allocator.dupe(u8, trimmed) catch @panic("OOM");
filters.append(allocator, owned) catch @panic("OOM");
}
}
}
return .{
.verbose = readEnvVerbose(environ_map),
.fail_first = readEnvBool(environ_map, "TEST_FAIL_FIRST", false),
.filters = filters,
.do_log_capture = readEnvBool(environ_map, "TEST_LOG_CAPTURE", true),
};
}
fn deinit(self: *Env, allocator: Allocator) void {
for (self.filters.items) |f| {
allocator.free(f);
}
self.filters.deinit(allocator);
}
fn readEnvBool(environ_map: *std.process.Environ.Map, key: []const u8, deflt: bool) bool {
const value = environ_map.get(key) orelse return deflt;
return std.ascii.eqlIgnoreCase(value, "true");
}
fn readEnvVerbose(environ_map: *std.process.Environ.Map) Verbose {
const value = environ_map.get("TEST_VERBOSE") orelse return .off;
if (std.ascii.eqlIgnoreCase(value, "2")) return .tracing;
if (std.ascii.eqlIgnoreCase(value, "true") or std.ascii.eqlIgnoreCase(value, "1")) return .naming;
return .off;
}
};
pub const panic = std.debug.FullPanic(struct {
pub fn panicFn(msg: []const u8, first_trace_addr: ?usize) noreturn {
if (current_test) |ct| {
std.debug.print("\x1b[31m{s}\npanic running \"{s}\"\n{s}\x1b[0m\n", .{ BORDER, ct, BORDER });
}
std.debug.defaultPanic(msg, first_trace_addr);
}
}.panicFn);
fn isUnnamed(t: std.builtin.TestFn) bool {
const marker = ".test_";
const test_name = t.name;
const index = std.mem.indexOf(u8, test_name, marker) orelse return false;
_ = std.fmt.parseInt(u32, test_name[index + marker.len ..], 10) catch return false;
return true;
}
fn isSetup(t: std.builtin.TestFn) bool {
return std.mem.endsWith(u8, t.name, "tests:beforeAll");
}
fn isTeardown(t: std.builtin.TestFn) bool {
return std.mem.endsWith(u8, t.name, "tests:afterAll");
}