build.zig 36 KB

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