build.zig 36 KB

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