build.zig 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096
  1. const std = @import("std");
  2. const builtin = @import("builtin");
  3. const compat = @import("src/compat.zig");
  4. const ipc = @import("src/ipc.zig");
  5. const tests = @import("test/tests.zig");
  6. const Build = compat.Build;
  7. const Step = compat.build.Step;
  8. const Child = std.process.Child;
  9. const assert = std.debug.assert;
  10. const print = std.debug.print;
  11. pub const Exercise = struct {
  12. /// main_file must have the format key_name.zig.
  13. /// The key will be used as a shorthand to build
  14. /// just one example.
  15. main_file: []const u8,
  16. /// This is the desired output of the program.
  17. /// A program passes if its output, excluding trailing whitespace, is equal
  18. /// to this string.
  19. output: []const u8,
  20. /// This is an optional hint to give if the program does not succeed.
  21. hint: []const u8 = "",
  22. /// By default, we verify output against stderr.
  23. /// Set this to true to check stdout instead.
  24. check_stdout: bool = false,
  25. /// This exercise makes use of the async feature.
  26. /// We need to keep track of this, so we compile without the self hosted compiler
  27. @"async": bool = false,
  28. /// This exercise makes use of C functions
  29. /// We need to keep track of this, so we compile with libc
  30. C: bool = false,
  31. /// This exercise is not supported by the current Zig compiler.
  32. skip: bool = false,
  33. /// Returns the name of the main file with .zig stripped.
  34. pub fn baseName(self: Exercise) []const u8 {
  35. assert(std.mem.endsWith(u8, self.main_file, ".zig"));
  36. return self.main_file[0 .. self.main_file.len - 4];
  37. }
  38. /// Returns the key of the main file, the string before the '_' with
  39. /// "zero padding" removed.
  40. /// For example, "001_hello.zig" has the key "1".
  41. pub fn key(self: Exercise) []const u8 {
  42. const end_index = std.mem.indexOfScalar(u8, self.main_file, '_');
  43. assert(end_index != null); // main file must be key_description.zig
  44. // remove zero padding by advancing index past '0's
  45. var start_index: usize = 0;
  46. while (self.main_file[start_index] == '0') start_index += 1;
  47. return self.main_file[start_index..end_index.?];
  48. }
  49. /// Returns the exercise key as an integer.
  50. pub fn number(self: Exercise) usize {
  51. return std.fmt.parseInt(usize, self.key(), 10) catch unreachable;
  52. }
  53. };
  54. pub fn build(b: *Build) !void {
  55. if (!compat.is_compatible) compat.die();
  56. if (!validate_exercises()) std.os.exit(1);
  57. use_color_escapes = false;
  58. if (std.io.getStdErr().supportsAnsiEscapeCodes()) {
  59. use_color_escapes = true;
  60. } else if (builtin.os.tag == .windows) {
  61. const w32 = struct {
  62. const WINAPI = std.os.windows.WINAPI;
  63. const DWORD = std.os.windows.DWORD;
  64. const ENABLE_VIRTUAL_TERMINAL_PROCESSING = 0x0004;
  65. const STD_ERROR_HANDLE = @bitCast(DWORD, @as(i32, -12));
  66. extern "kernel32" fn GetStdHandle(id: DWORD) callconv(WINAPI) ?*anyopaque;
  67. extern "kernel32" fn GetConsoleMode(console: ?*anyopaque, out_mode: *DWORD) callconv(WINAPI) u32;
  68. extern "kernel32" fn SetConsoleMode(console: ?*anyopaque, mode: DWORD) callconv(WINAPI) u32;
  69. };
  70. const handle = w32.GetStdHandle(w32.STD_ERROR_HANDLE);
  71. var mode: w32.DWORD = 0;
  72. if (w32.GetConsoleMode(handle, &mode) != 0) {
  73. mode |= w32.ENABLE_VIRTUAL_TERMINAL_PROCESSING;
  74. use_color_escapes = w32.SetConsoleMode(handle, mode) != 0;
  75. }
  76. }
  77. if (use_color_escapes) {
  78. red_text = "\x1b[31m";
  79. green_text = "\x1b[32m";
  80. bold_text = "\x1b[1m";
  81. reset_text = "\x1b[0m";
  82. }
  83. const logo =
  84. \\
  85. \\ _ _ _
  86. \\ ___(_) __ _| (_)_ __ __ _ ___
  87. \\ |_ | |/ _' | | | '_ \ / _' / __|
  88. \\ / /| | (_| | | | | | | (_| \__ \
  89. \\ /___|_|\__, |_|_|_| |_|\__, |___/
  90. \\ |___/ |___/
  91. \\
  92. \\
  93. ;
  94. const use_healed = b.option(bool, "healed", "Run exercises from patches/healed") orelse false;
  95. const exno: ?usize = b.option(usize, "n", "Select exercise");
  96. const header_step = PrintStep.create(b, logo);
  97. if (exno) |n| {
  98. if (n == 0 or n > exercises.len - 1) {
  99. print("unknown exercise number: {}\n", .{n});
  100. std.os.exit(1);
  101. }
  102. const ex = exercises[n - 1];
  103. const base_name = ex.baseName();
  104. const file_path = std.fs.path.join(b.allocator, &[_][]const u8{
  105. if (use_healed) "patches/healed" else "exercises", ex.main_file,
  106. }) catch unreachable;
  107. const build_step = b.addExecutable(.{ .name = base_name, .root_source_file = .{ .path = file_path } });
  108. if (ex.C) {
  109. build_step.linkLibC();
  110. }
  111. b.installArtifact(build_step);
  112. const run_step = b.addRunArtifact(build_step);
  113. const test_step = b.step("test", b.fmt("Run {s} without checking output", .{ex.main_file}));
  114. if (ex.skip) {
  115. const skip_step = SkipStep.create(b, ex);
  116. test_step.dependOn(&skip_step.step);
  117. } else {
  118. test_step.dependOn(&run_step.step);
  119. }
  120. const install_step = b.step("install", b.fmt("Install {s} to prefix path", .{ex.main_file}));
  121. install_step.dependOn(b.getInstallStep());
  122. const uninstall_step = b.step("uninstall", b.fmt("Uninstall {s} from prefix path", .{ex.main_file}));
  123. uninstall_step.dependOn(b.getUninstallStep());
  124. const verify_step = ZiglingStep.create(b, ex, use_healed);
  125. const zigling_step = b.step("zigling", b.fmt("Check the solution of {s}", .{ex.main_file}));
  126. zigling_step.dependOn(&verify_step.step);
  127. b.default_step = zigling_step;
  128. const start_step = b.step("start", b.fmt("Check all solutions starting at {s}", .{ex.main_file}));
  129. var prev_step = verify_step;
  130. for (exercises) |exn| {
  131. const nth = exn.number();
  132. if (nth > n) {
  133. const verify_stepn = ZiglingStep.create(b, exn, use_healed);
  134. verify_stepn.step.dependOn(&prev_step.step);
  135. prev_step = verify_stepn;
  136. }
  137. }
  138. start_step.dependOn(&prev_step.step);
  139. return;
  140. } else if (use_healed and false) {
  141. const test_step = b.step("test", "Test the healed exercises");
  142. b.default_step = test_step;
  143. for (exercises) |ex| {
  144. const base_name = ex.baseName();
  145. const file_path = std.fs.path.join(b.allocator, &[_][]const u8{
  146. "patches/healed", ex.main_file,
  147. }) catch unreachable;
  148. const build_step = b.addExecutable(.{ .name = base_name, .root_source_file = .{ .path = file_path } });
  149. if (ex.C) {
  150. build_step.linkLibC();
  151. }
  152. b.installArtifact(build_step);
  153. const run_step = b.addRunArtifact(build_step);
  154. if (ex.skip) {
  155. const skip_step = SkipStep.create(b, ex);
  156. test_step.dependOn(&skip_step.step);
  157. } else {
  158. test_step.dependOn(&run_step.step);
  159. }
  160. }
  161. return;
  162. }
  163. const ziglings_step = b.step("ziglings", "Check all ziglings");
  164. b.default_step = ziglings_step;
  165. // Don't use the "multi-object for loop" syntax, in order to avoid a syntax
  166. // error with old Zig compilers.
  167. var prev_step = &header_step.step;
  168. for (exercises) |ex| {
  169. const base_name = ex.baseName();
  170. const file_path = std.fs.path.join(b.allocator, &[_][]const u8{
  171. "exercises", ex.main_file,
  172. }) catch unreachable;
  173. const build_step = b.addExecutable(.{ .name = base_name, .root_source_file = .{ .path = file_path } });
  174. b.installArtifact(build_step);
  175. const verify_stepn = ZiglingStep.create(b, ex, use_healed);
  176. verify_stepn.step.dependOn(prev_step);
  177. prev_step = &verify_stepn.step;
  178. }
  179. ziglings_step.dependOn(prev_step);
  180. const test_step = b.step("test", "Run all the tests");
  181. test_step.dependOn(tests.addCliTests(b, &exercises));
  182. }
  183. var use_color_escapes = false;
  184. var red_text: []const u8 = "";
  185. var green_text: []const u8 = "";
  186. var bold_text: []const u8 = "";
  187. var reset_text: []const u8 = "";
  188. const ZiglingStep = struct {
  189. step: Step,
  190. exercise: Exercise,
  191. builder: *Build,
  192. use_healed: bool,
  193. result_messages: []const u8 = "",
  194. result_error_bundle: std.zig.ErrorBundle = std.zig.ErrorBundle.empty,
  195. pub fn create(builder: *Build, exercise: Exercise, use_healed: bool) *@This() {
  196. const self = builder.allocator.create(@This()) catch unreachable;
  197. self.* = .{
  198. .step = Step.init(Step.Options{ .id = .custom, .name = exercise.main_file, .owner = builder, .makeFn = make }),
  199. .exercise = exercise,
  200. .builder = builder,
  201. .use_healed = use_healed,
  202. };
  203. return self;
  204. }
  205. fn make(step: *Step, prog_node: *std.Progress.Node) anyerror!void {
  206. const self = @fieldParentPtr(@This(), "step", step);
  207. if (self.exercise.skip) {
  208. print("Skipping {s}\n\n", .{self.exercise.main_file});
  209. return;
  210. }
  211. self.makeInternal(prog_node) catch {
  212. if (self.exercise.hint.len > 0) {
  213. print("\n{s}HINT: {s}{s}", .{ bold_text, self.exercise.hint, reset_text });
  214. }
  215. print("\n{s}Edit exercises/{s} and run this again.{s}", .{ red_text, self.exercise.main_file, reset_text });
  216. print("\n{s}To continue from this zigling, use this command:{s}\n {s}zig build -Dn={s}{s}\n", .{ red_text, reset_text, bold_text, self.exercise.key(), reset_text });
  217. std.os.exit(1);
  218. };
  219. }
  220. fn makeInternal(self: *@This(), prog_node: *std.Progress.Node) !void {
  221. print("Compiling {s}...\n", .{self.exercise.main_file});
  222. const exe_file = try self.doCompile(prog_node);
  223. resetLine();
  224. print("Checking {s}...\n", .{self.exercise.main_file});
  225. const cwd = self.builder.build_root.path.?;
  226. const argv = [_][]const u8{exe_file};
  227. var child = std.ChildProcess.init(&argv, self.builder.allocator);
  228. child.cwd = cwd;
  229. child.env_map = self.builder.env_map;
  230. child.stdin_behavior = .Inherit;
  231. if (self.exercise.check_stdout) {
  232. child.stdout_behavior = .Pipe;
  233. child.stderr_behavior = .Inherit;
  234. } else {
  235. child.stdout_behavior = .Inherit;
  236. child.stderr_behavior = .Pipe;
  237. }
  238. child.spawn() catch |err| {
  239. print("{s}Unable to spawn {s}: {s}{s}\n", .{ red_text, argv[0], @errorName(err), reset_text });
  240. return err;
  241. };
  242. // Allow up to 1 MB of stdout capture.
  243. const max_output_len = 1 * 1024 * 1024;
  244. const output = if (self.exercise.check_stdout)
  245. try child.stdout.?.reader().readAllAlloc(self.builder.allocator, max_output_len)
  246. else
  247. try child.stderr.?.reader().readAllAlloc(self.builder.allocator, max_output_len);
  248. // At this point stdout is closed, wait for the process to terminate.
  249. const term = child.wait() catch |err| {
  250. print("{s}Unable to spawn {s}: {s}{s}\n", .{ red_text, argv[0], @errorName(err), reset_text });
  251. return err;
  252. };
  253. // Make sure it exited cleanly.
  254. switch (term) {
  255. .Exited => |code| {
  256. if (code != 0) {
  257. print("{s}{s} exited with error code {d} (expected {d}){s}\n", .{ red_text, self.exercise.main_file, code, 0, reset_text });
  258. return error.BadExitCode;
  259. }
  260. },
  261. else => {
  262. print("{s}{s} terminated unexpectedly{s}\n", .{ red_text, self.exercise.main_file, reset_text });
  263. return error.UnexpectedTermination;
  264. },
  265. }
  266. // Validate the output.
  267. const trimOutput = std.mem.trimRight(u8, output, " \r\n");
  268. const trimExerciseOutput = std.mem.trimRight(u8, self.exercise.output, " \r\n");
  269. if (!std.mem.eql(u8, trimOutput, trimExerciseOutput)) {
  270. print(
  271. \\
  272. \\{s}----------- Expected this output -----------{s}
  273. \\"{s}"
  274. \\{s}----------- but found -----------{s}
  275. \\"{s}"
  276. \\{s}-----------{s}
  277. \\
  278. , .{ red_text, reset_text, trimExerciseOutput, red_text, reset_text, trimOutput, red_text, reset_text });
  279. return error.InvalidOutput;
  280. }
  281. print("{s}PASSED:\n{s}{s}\n\n", .{ green_text, trimOutput, reset_text });
  282. }
  283. // The normal compile step calls os.exit, so we can't use it as a library :(
  284. // This is a stripped down copy of std.build.LibExeObjStep.make.
  285. fn doCompile(self: *@This(), prog_node: *std.Progress.Node) ![]const u8 {
  286. const builder = self.builder;
  287. var zig_args = std.ArrayList([]const u8).init(builder.allocator);
  288. defer zig_args.deinit();
  289. zig_args.append(builder.zig_exe) catch unreachable;
  290. zig_args.append("build-exe") catch unreachable;
  291. // Enable the stage 1 compiler if using the async feature
  292. // disabled because of https://github.com/ratfactor/ziglings/issues/163
  293. // if (self.exercise.@"async") {
  294. // zig_args.append("-fstage1") catch unreachable;
  295. // }
  296. // Enable C support for exercises that use C functions
  297. if (self.exercise.C) {
  298. zig_args.append("-lc") catch unreachable;
  299. }
  300. const zig_file = std.fs.path.join(builder.allocator, &[_][]const u8{ if (self.use_healed) "patches/healed" else "exercises", self.exercise.main_file }) catch unreachable;
  301. zig_args.append(builder.pathFromRoot(zig_file)) catch unreachable;
  302. zig_args.append("--cache-dir") catch unreachable;
  303. zig_args.append(builder.pathFromRoot(builder.cache_root.path.?)) catch unreachable;
  304. zig_args.append("--listen=-") catch unreachable;
  305. const argv = zig_args.items;
  306. var code: u8 = undefined;
  307. const file_name = self.eval(argv, &code, prog_node) catch |err| {
  308. self.printErrors();
  309. switch (err) {
  310. error.FileNotFound => {
  311. print("{s}{s}: Unable to spawn the following command: file not found{s}\n", .{ red_text, self.exercise.main_file, reset_text });
  312. for (argv) |v| print("{s} ", .{v});
  313. print("\n", .{});
  314. },
  315. error.ExitCodeFailure => {
  316. print("{s}{s}: The following command exited with error code {}:{s}\n", .{ red_text, self.exercise.main_file, code, reset_text });
  317. for (argv) |v| print("{s} ", .{v});
  318. print("\n", .{});
  319. },
  320. error.ProcessTerminated => {
  321. print("{s}{s}: The following command terminated unexpectedly:{s}\n", .{ red_text, self.exercise.main_file, reset_text });
  322. for (argv) |v| print("{s} ", .{v});
  323. print("\n", .{});
  324. },
  325. error.ZigIPCError => {
  326. print("{s}{s}: The following command failed to communicate the compilation result:{s}\n", .{
  327. red_text,
  328. self.exercise.main_file,
  329. reset_text,
  330. });
  331. for (argv) |v| print("{s} ", .{v});
  332. print("\n", .{});
  333. },
  334. else => {},
  335. }
  336. return err;
  337. };
  338. self.printErrors();
  339. return file_name;
  340. }
  341. // Code adapted from `std.Build.execAllowFail and `std.Build.Step.evalZigProcess`.
  342. pub fn eval(
  343. self: *ZiglingStep,
  344. argv: []const []const u8,
  345. out_code: *u8,
  346. prog_node: *std.Progress.Node,
  347. ) ![]const u8 {
  348. assert(argv.len != 0);
  349. const b = self.step.owner;
  350. const allocator = b.allocator;
  351. var child = Child.init(argv, allocator);
  352. child.env_map = b.env_map;
  353. child.stdin_behavior = .Pipe;
  354. child.stdout_behavior = .Pipe;
  355. child.stderr_behavior = .Pipe;
  356. try child.spawn();
  357. var poller = std.io.poll(allocator, enum { stdout, stderr }, .{
  358. .stdout = child.stdout.?,
  359. .stderr = child.stderr.?,
  360. });
  361. defer poller.deinit();
  362. try ipc.sendMessage(child.stdin.?, .update);
  363. try ipc.sendMessage(child.stdin.?, .exit);
  364. const Header = std.zig.Server.Message.Header;
  365. var result: ?[]const u8 = null;
  366. var node_name: std.ArrayListUnmanaged(u8) = .{};
  367. defer node_name.deinit(allocator);
  368. var sub_prog_node = prog_node.start("", 0);
  369. defer sub_prog_node.end();
  370. const stdout = poller.fifo(.stdout);
  371. poll: while (true) {
  372. while (stdout.readableLength() < @sizeOf(Header)) {
  373. if (!(try poller.poll())) break :poll;
  374. }
  375. const header = stdout.reader().readStruct(Header) catch unreachable;
  376. while (stdout.readableLength() < header.bytes_len) {
  377. if (!(try poller.poll())) break :poll;
  378. }
  379. const body = stdout.readableSliceOfLen(header.bytes_len);
  380. switch (header.tag) {
  381. .zig_version => {
  382. if (!std.mem.eql(u8, builtin.zig_version_string, body))
  383. return error.ZigVersionMismatch;
  384. },
  385. .error_bundle => {
  386. self.result_error_bundle = try ipc.parseErrorBundle(allocator, body);
  387. },
  388. .progress => {
  389. node_name.clearRetainingCapacity();
  390. try node_name.appendSlice(allocator, body);
  391. sub_prog_node.setName(node_name.items);
  392. },
  393. .emit_bin_path => {
  394. const emit_bin = try ipc.parseEmitBinPath(allocator, body);
  395. result = emit_bin.path;
  396. },
  397. else => {}, // ignore other messages
  398. }
  399. stdout.discard(body.len);
  400. }
  401. const stderr = poller.fifo(.stderr);
  402. if (stderr.readableLength() > 0) {
  403. self.result_messages = try stderr.toOwnedSlice();
  404. }
  405. // Send EOF to stdin.
  406. child.stdin.?.close();
  407. child.stdin = null;
  408. // Keep the errors compatible with std.Build.execAllowFail.
  409. const term = try child.wait();
  410. switch (term) {
  411. .Exited => |code| {
  412. if (code != 0) {
  413. out_code.* = @truncate(u8, code);
  414. return error.ExitCodeFailure;
  415. }
  416. },
  417. .Signal, .Stopped, .Unknown => |code| {
  418. out_code.* = @truncate(u8, code);
  419. return error.ProcessTerminated;
  420. },
  421. }
  422. return result orelse return error.ZigIPCError;
  423. }
  424. fn printErrors(self: *ZiglingStep) void {
  425. resetLine();
  426. // Print the additional log and verbose messages.
  427. // TODO: use colors?
  428. if (self.result_messages.len > 0) print("{s}", .{self.result_messages});
  429. // Print the compiler errors.
  430. // TODO: use the same ttyconf from the builder.
  431. const ttyconf: std.debug.TTY.Config = if (use_color_escapes)
  432. .escape_codes
  433. else
  434. .no_color;
  435. if (self.result_error_bundle.errorMessageCount() > 0) {
  436. self.result_error_bundle.renderToStdErr(.{ .ttyconf = ttyconf });
  437. }
  438. }
  439. };
  440. // Clear the entire line and move the cursor to column zero.
  441. // Used for clearing the compiler and build_runner progress messages.
  442. fn resetLine() void {
  443. if (use_color_escapes) print("{s}", .{"\x1b[2K\r"});
  444. }
  445. // Print a message to stderr.
  446. const PrintStep = struct {
  447. step: Step,
  448. message: []const u8,
  449. pub fn create(owner: *Build, message: []const u8) *PrintStep {
  450. const self = owner.allocator.create(PrintStep) catch @panic("OOM");
  451. self.* = .{
  452. .step = Step.init(.{
  453. .id = .custom,
  454. .name = "print",
  455. .owner = owner,
  456. .makeFn = make,
  457. }),
  458. .message = message,
  459. };
  460. return self;
  461. }
  462. fn make(step: *Step, prog_node: *std.Progress.Node) !void {
  463. _ = prog_node;
  464. const p = @fieldParentPtr(PrintStep, "step", step);
  465. print("{s}", .{p.message});
  466. }
  467. };
  468. // Skip an exercise.
  469. const SkipStep = struct {
  470. step: Step,
  471. exercise: Exercise,
  472. pub fn create(owner: *Build, exercise: Exercise) *SkipStep {
  473. const self = owner.allocator.create(SkipStep) catch @panic("OOM");
  474. self.* = .{
  475. .step = Step.init(.{
  476. .id = .custom,
  477. .name = owner.fmt("skip {s}", .{exercise.main_file}),
  478. .owner = owner,
  479. .makeFn = make,
  480. }),
  481. .exercise = exercise,
  482. };
  483. return self;
  484. }
  485. fn make(step: *Step, prog_node: *std.Progress.Node) !void {
  486. _ = prog_node;
  487. const p = @fieldParentPtr(SkipStep, "step", step);
  488. if (p.exercise.skip) {
  489. print("{s} skipped\n", .{p.exercise.main_file});
  490. }
  491. }
  492. };
  493. // Check that each exercise number, excluding the last, forms the sequence
  494. // `[1, exercise.len)`.
  495. //
  496. // Additionally check that the output field does not contain trailing whitespace.
  497. fn validate_exercises() bool {
  498. // Don't use the "multi-object for loop" syntax, in order to avoid a syntax
  499. // error with old Zig compilers.
  500. var i: usize = 0;
  501. for (exercises[0 .. exercises.len - 1]) |ex| {
  502. i += 1;
  503. if (ex.number() != i) {
  504. print("exercise {s} has an incorrect number: expected {}, got {s}\n", .{
  505. ex.main_file,
  506. i,
  507. ex.key(),
  508. });
  509. return false;
  510. }
  511. const output = std.mem.trimRight(u8, ex.output, " \r\n");
  512. if (output.len != ex.output.len) {
  513. print("exercise {s} output field has extra trailing whitespace\n", .{
  514. ex.main_file,
  515. });
  516. return false;
  517. }
  518. }
  519. return true;
  520. }
  521. const exercises = [_]Exercise{
  522. .{
  523. .main_file = "001_hello.zig",
  524. .output = "Hello world!",
  525. .hint = "DON'T PANIC!\nRead the error above.\nSee how it has something to do with 'main'?\nOpen up the source file as noted and read the comments.\nYou can do this!",
  526. },
  527. .{
  528. .main_file = "002_std.zig",
  529. .output = "Standard Library.",
  530. },
  531. .{
  532. .main_file = "003_assignment.zig",
  533. .output = "55 314159 -11",
  534. .hint = "There are three mistakes in this one!",
  535. },
  536. .{
  537. .main_file = "004_arrays.zig",
  538. .output = "First: 2, Fourth: 7, Length: 8",
  539. .hint = "There are two things to complete here.",
  540. },
  541. .{
  542. .main_file = "005_arrays2.zig",
  543. .output = "LEET: 1337, Bits: 100110011001",
  544. .hint = "Fill in the two arrays.",
  545. },
  546. .{
  547. .main_file = "006_strings.zig",
  548. .output = "d=d ha ha ha Major Tom",
  549. .hint = "Each '???' needs something filled in.",
  550. },
  551. .{
  552. .main_file = "007_strings2.zig",
  553. .output = "Ziggy played guitar\nJamming good with Andrew Kelley\nAnd the Spiders from Mars",
  554. .hint = "Please fix the lyrics!",
  555. },
  556. .{
  557. .main_file = "008_quiz.zig",
  558. .output = "Program in Zig!",
  559. .hint = "See if you can fix the program!",
  560. },
  561. .{
  562. .main_file = "009_if.zig",
  563. .output = "Foo is 1!",
  564. },
  565. .{
  566. .main_file = "010_if2.zig",
  567. .output = "With the discount, the price is $17.",
  568. },
  569. .{
  570. .main_file = "011_while.zig",
  571. .output = "2 4 8 16 32 64 128 256 512 n=1024",
  572. .hint = "You probably want a 'less than' condition.",
  573. },
  574. .{
  575. .main_file = "012_while2.zig",
  576. .output = "2 4 8 16 32 64 128 256 512 n=1024",
  577. .hint = "It might help to look back at the previous exercise.",
  578. },
  579. .{
  580. .main_file = "013_while3.zig",
  581. .output = "1 2 4 7 8 11 13 14 16 17 19",
  582. },
  583. .{
  584. .main_file = "014_while4.zig",
  585. .output = "n=4",
  586. },
  587. .{
  588. .main_file = "015_for.zig",
  589. .output = "A Dramatic Story: :-) :-) :-( :-| :-) The End.",
  590. },
  591. .{
  592. .main_file = "016_for2.zig",
  593. .output = "The value of bits '1101': 13.",
  594. },
  595. .{
  596. .main_file = "017_quiz2.zig",
  597. .output = "1, 2, Fizz, 4, Buzz, Fizz, 7, 8, Fizz, Buzz, 11, Fizz, 13, 14, FizzBuzz, 16,",
  598. .hint = "This is a famous game!",
  599. },
  600. .{
  601. .main_file = "018_functions.zig",
  602. .output = "Answer to the Ultimate Question: 42",
  603. .hint = "Can you help write the function?",
  604. },
  605. .{
  606. .main_file = "019_functions2.zig",
  607. .output = "Powers of two: 2 4 8 16",
  608. },
  609. .{
  610. .main_file = "020_quiz3.zig",
  611. .output = "32 64 128 256",
  612. .hint = "Unexpected pop quiz! Help!",
  613. },
  614. .{
  615. .main_file = "021_errors.zig",
  616. .output = "2<4. 3<4. 4=4. 5>4. 6>4.",
  617. .hint = "What's the deal with fours?",
  618. },
  619. .{
  620. .main_file = "022_errors2.zig",
  621. .output = "I compiled!",
  622. .hint = "Get the error union type right to allow this to compile.",
  623. },
  624. .{
  625. .main_file = "023_errors3.zig",
  626. .output = "a=64, b=22",
  627. },
  628. .{
  629. .main_file = "024_errors4.zig",
  630. .output = "a=20, b=14, c=10",
  631. },
  632. .{
  633. .main_file = "025_errors5.zig",
  634. .output = "a=0, b=19, c=0",
  635. },
  636. .{
  637. .main_file = "026_hello2.zig",
  638. .output = "Hello world!",
  639. .hint = "Try using a try!",
  640. .check_stdout = true,
  641. },
  642. .{
  643. .main_file = "027_defer.zig",
  644. .output = "One Two",
  645. },
  646. .{
  647. .main_file = "028_defer2.zig",
  648. .output = "(Goat) (Cat) (Dog) (Dog) (Goat) (Unknown) done.",
  649. },
  650. .{
  651. .main_file = "029_errdefer.zig",
  652. .output = "Getting number...got 5. Getting number...failed!",
  653. },
  654. .{
  655. .main_file = "030_switch.zig",
  656. .output = "ZIG?",
  657. },
  658. .{
  659. .main_file = "031_switch2.zig",
  660. .output = "ZIG!",
  661. },
  662. .{
  663. .main_file = "032_unreachable.zig",
  664. .output = "1 2 3 9 8 7",
  665. },
  666. .{
  667. .main_file = "033_iferror.zig",
  668. .output = "2<4. 3<4. 4=4. 5>4. 6>4.",
  669. .hint = "Seriously, what's the deal with fours?",
  670. },
  671. .{
  672. .main_file = "034_quiz4.zig",
  673. .output = "my_num=42",
  674. .hint = "Can you make this work?",
  675. .check_stdout = true,
  676. },
  677. .{
  678. .main_file = "035_enums.zig",
  679. .output = "1 2 3 9 8 7",
  680. .hint = "This problem seems familiar...",
  681. },
  682. .{
  683. .main_file = "036_enums2.zig",
  684. .output = "<p>\n <span style=\"color: #ff0000\">Red</span>\n <span style=\"color: #00ff00\">Green</span>\n <span style=\"color: #0000ff\">Blue</span>\n</p>",
  685. .hint = "I'm feeling blue about this.",
  686. },
  687. .{
  688. .main_file = "037_structs.zig",
  689. .output = "Your wizard has 90 health and 25 gold.",
  690. },
  691. .{
  692. .main_file = "038_structs2.zig",
  693. .output = "Character 1 - G:20 H:100 XP:10\nCharacter 2 - G:10 H:100 XP:20",
  694. },
  695. .{
  696. .main_file = "039_pointers.zig",
  697. .output = "num1: 5, num2: 5",
  698. .hint = "Pointers aren't so bad.",
  699. },
  700. .{
  701. .main_file = "040_pointers2.zig",
  702. .output = "a: 12, b: 12",
  703. },
  704. .{
  705. .main_file = "041_pointers3.zig",
  706. .output = "foo=6, bar=11",
  707. },
  708. .{
  709. .main_file = "042_pointers4.zig",
  710. .output = "num: 5, more_nums: 1 1 5 1",
  711. },
  712. .{
  713. .main_file = "043_pointers5.zig",
  714. .output = "Wizard (G:10 H:100 XP:20)\n Mentor: Wizard (G:10000 H:100 XP:2340)",
  715. },
  716. .{
  717. .main_file = "044_quiz5.zig",
  718. .output = "Elephant A. Elephant B. Elephant C.",
  719. .hint = "Oh no! We forgot Elephant B!",
  720. },
  721. .{
  722. .main_file = "045_optionals.zig",
  723. .output = "The Ultimate Answer: 42.",
  724. },
  725. .{
  726. .main_file = "046_optionals2.zig",
  727. .output = "Elephant A. Elephant B. Elephant C.",
  728. .hint = "Elephants again!",
  729. },
  730. .{
  731. .main_file = "047_methods.zig",
  732. .output = "5 aliens. 4 aliens. 1 aliens. 0 aliens. Earth is saved!",
  733. .hint = "Use the heat ray. And the method!",
  734. },
  735. .{
  736. .main_file = "048_methods2.zig",
  737. .output = "A B C",
  738. .hint = "This just needs one little fix.",
  739. },
  740. .{
  741. .main_file = "049_quiz6.zig",
  742. .output = "A B C Cv Bv Av",
  743. .hint = "Now you're writing Zig!",
  744. },
  745. .{
  746. .main_file = "050_no_value.zig",
  747. .output = "That is not dead which can eternal lie / And with strange aeons even death may die.",
  748. },
  749. .{
  750. .main_file = "051_values.zig",
  751. .output = "1:false!. 2:true!. 3:true!. XP before:0, after:200.",
  752. },
  753. .{
  754. .main_file = "052_slices.zig",
  755. .output = "Hand1: A 4 K 8 \nHand2: 5 2 Q J",
  756. },
  757. .{
  758. .main_file = "053_slices2.zig",
  759. .output = "'all your base are belong to us.' 'for great justice.'",
  760. },
  761. .{
  762. .main_file = "054_manypointers.zig",
  763. .output = "Memory is a resource.",
  764. },
  765. .{
  766. .main_file = "055_unions.zig",
  767. .output = "Insect report! Ant alive is: true. Bee visited 15 flowers.",
  768. },
  769. .{
  770. .main_file = "056_unions2.zig",
  771. .output = "Insect report! Ant alive is: true. Bee visited 16 flowers.",
  772. },
  773. .{
  774. .main_file = "057_unions3.zig",
  775. .output = "Insect report! Ant alive is: true. Bee visited 17 flowers.",
  776. },
  777. .{
  778. .main_file = "058_quiz7.zig",
  779. .output = "Archer's Point--2->Bridge--1->Dogwood Grove--3->Cottage--2->East Pond--1->Fox Pond",
  780. .hint = "This is the biggest program we've seen yet. But you can do it!",
  781. },
  782. .{
  783. .main_file = "059_integers.zig",
  784. .output = "Zig is cool.",
  785. },
  786. .{
  787. .main_file = "060_floats.zig",
  788. .output = "Shuttle liftoff weight: 1995796kg",
  789. },
  790. .{
  791. .main_file = "061_coercions.zig",
  792. .output = "Letter: A",
  793. },
  794. .{
  795. .main_file = "062_loop_expressions.zig",
  796. .output = "Current language: Zig",
  797. .hint = "Surely the current language is 'Zig'!",
  798. },
  799. .{
  800. .main_file = "063_labels.zig",
  801. .output = "Enjoy your Cheesy Chili!",
  802. },
  803. .{
  804. .main_file = "064_builtins.zig",
  805. .output = "1101 + 0101 = 0010 (true). Without overflow: 00010010. Furthermore, 11110000 backwards is 00001111.",
  806. },
  807. .{
  808. .main_file = "065_builtins2.zig",
  809. .output = "A Narcissus loves all Narcissuses. He has room in his heart for: me myself.",
  810. },
  811. .{
  812. .main_file = "066_comptime.zig",
  813. .output = "Immutable: 12345, 987.654; Mutable: 54321, 456.789; Types: comptime_int, comptime_float, u32, f32",
  814. .hint = "It may help to read this one out loud to your favorite stuffed animal until it sinks in completely.",
  815. },
  816. .{
  817. .main_file = "067_comptime2.zig",
  818. .output = "A BB CCC DDDD",
  819. },
  820. .{
  821. .main_file = "068_comptime3.zig",
  822. .output = "Minnow (1:32, 4 x 2)\nShark (1:16, 8 x 5)\nWhale (1:1, 143 x 95)",
  823. },
  824. .{
  825. .main_file = "069_comptime4.zig",
  826. .output = "s1={ 1, 2, 3 }, s2={ 1, 2, 3, 4, 5 }, s3={ 1, 2, 3, 4, 5, 6, 7 }",
  827. },
  828. .{
  829. .main_file = "070_comptime5.zig",
  830. .output = "\"Quack.\" ducky1: true, \"Squeek!\" ducky2: true, ducky3: false",
  831. .hint = "Have you kept the wizard hat on?",
  832. },
  833. .{
  834. .main_file = "071_comptime6.zig",
  835. .output = "Narcissus has room in his heart for: me myself.",
  836. },
  837. .{
  838. .main_file = "072_comptime7.zig",
  839. .output = "26",
  840. },
  841. .{
  842. .main_file = "073_comptime8.zig",
  843. .output = "My llama value is 25.",
  844. },
  845. .{
  846. .main_file = "074_comptime9.zig",
  847. .output = "My llama value is 2.",
  848. },
  849. .{
  850. .main_file = "075_quiz8.zig",
  851. .output = "Archer's Point--2->Bridge--1->Dogwood Grove--3->Cottage--2->East Pond--1->Fox Pond",
  852. .hint = "Roll up those sleeves. You get to WRITE some code for this one.",
  853. },
  854. .{
  855. .main_file = "076_sentinels.zig",
  856. .output = "Array:123056. Many-item pointer:123.",
  857. },
  858. .{
  859. .main_file = "077_sentinels2.zig",
  860. .output = "Weird Data!",
  861. },
  862. .{
  863. .main_file = "078_sentinels3.zig",
  864. .output = "Weird Data!",
  865. },
  866. .{
  867. .main_file = "079_quoted_identifiers.zig",
  868. .output = "Sweet freedom: 55, false.",
  869. .hint = "Help us, Zig Programmer, you're our only hope!",
  870. },
  871. .{
  872. .main_file = "080_anonymous_structs.zig",
  873. .output = "[Circle(i32): 25,70,15] [Circle(f32): 25.2,71.0,15.7]",
  874. },
  875. .{
  876. .main_file = "081_anonymous_structs2.zig",
  877. .output = "x:205 y:187 radius:12",
  878. },
  879. .{
  880. .main_file = "082_anonymous_structs3.zig",
  881. .output = "\"0\"(bool):true \"1\"(bool):false \"2\"(i32):42 \"3\"(f32):3.14159202e+00",
  882. .hint = "This one is a challenge! But you have everything you need.",
  883. },
  884. .{
  885. .main_file = "083_anonymous_lists.zig",
  886. .output = "I say hello!",
  887. },
  888. // Skipped because of https://github.com/ratfactor/ziglings/issues/163
  889. // direct link: https://github.com/ziglang/zig/issues/6025
  890. .{
  891. .main_file = "084_async.zig",
  892. .output = "foo() A",
  893. .hint = "Read the facts. Use the facts.",
  894. .@"async" = true,
  895. .skip = true,
  896. },
  897. .{
  898. .main_file = "085_async2.zig",
  899. .output = "Hello async!",
  900. .@"async" = true,
  901. .skip = true,
  902. },
  903. .{
  904. .main_file = "086_async3.zig",
  905. .output = "5 4 3 2 1",
  906. .@"async" = true,
  907. .skip = true,
  908. },
  909. .{
  910. .main_file = "087_async4.zig",
  911. .output = "1 2 3 4 5",
  912. .@"async" = true,
  913. .skip = true,
  914. },
  915. .{
  916. .main_file = "088_async5.zig",
  917. .output = "Example Title.",
  918. .@"async" = true,
  919. .skip = true,
  920. },
  921. .{
  922. .main_file = "089_async6.zig",
  923. .output = ".com: Example Title, .org: Example Title.",
  924. .@"async" = true,
  925. .skip = true,
  926. },
  927. .{
  928. .main_file = "090_async7.zig",
  929. .output = "beef? BEEF!",
  930. .@"async" = true,
  931. .skip = true,
  932. },
  933. .{
  934. .main_file = "091_async8.zig",
  935. .output = "ABCDEF",
  936. .@"async" = true,
  937. .skip = true,
  938. },
  939. .{
  940. .main_file = "092_interfaces.zig",
  941. .output = "Daily Insect Report:\nAnt is alive.\nBee visited 17 flowers.\nGrasshopper hopped 32 meters.",
  942. },
  943. .{
  944. .main_file = "093_hello_c.zig",
  945. .output = "Hello C from Zig! - C result is 17 chars written.",
  946. .C = true,
  947. },
  948. .{
  949. .main_file = "094_c_math.zig",
  950. .output = "The normalized angle of 765.2 degrees is 45.2 degrees.",
  951. .C = true,
  952. },
  953. .{
  954. .main_file = "095_for3.zig",
  955. .output = "1 2 4 7 8 11 13 14 16 17 19",
  956. },
  957. .{
  958. .main_file = "096_memory_allocation.zig",
  959. .output = "Running Average: 0.30 0.25 0.20 0.18 0.22",
  960. },
  961. .{
  962. .main_file = "097_bit_manipulation.zig",
  963. .output = "x = 0; y = 1",
  964. },
  965. .{
  966. .main_file = "098_bit_manipulation2.zig",
  967. .output = "Is this a pangram? true!",
  968. },
  969. .{
  970. .main_file = "099_formatting.zig",
  971. .output = "\n X | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 \n---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+\n 1 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 \n\n 2 | 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 \n\n 3 | 3 6 9 12 15 18 21 24 27 30 33 36 39 42 45 \n\n 4 | 4 8 12 16 20 24 28 32 36 40 44 48 52 56 60 \n\n 5 | 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 \n\n 6 | 6 12 18 24 30 36 42 48 54 60 66 72 78 84 90 \n\n 7 | 7 14 21 28 35 42 49 56 63 70 77 84 91 98 105 \n\n 8 | 8 16 24 32 40 48 56 64 72 80 88 96 104 112 120 \n\n 9 | 9 18 27 36 45 54 63 72 81 90 99 108 117 126 135 \n\n10 | 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 \n\n11 | 11 22 33 44 55 66 77 88 99 110 121 132 143 154 165 \n\n12 | 12 24 36 48 60 72 84 96 108 120 132 144 156 168 180 \n\n13 | 13 26 39 52 65 78 91 104 117 130 143 156 169 182 195 \n\n14 | 14 28 42 56 70 84 98 112 126 140 154 168 182 196 210 \n\n15 | 15 30 45 60 75 90 105 120 135 150 165 180 195 210 225",
  972. },
  973. .{
  974. .main_file = "100_for4.zig",
  975. .output = "Arrays match!",
  976. },
  977. .{
  978. .main_file = "999_the_end.zig",
  979. .output = "\nThis is the end for now!\nWe hope you had fun and were able to learn a lot, so visit us again when the next exercises are available.",
  980. },
  981. };