build.zig 36 KB

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