zig

fork of https://codeberg.org/ziglang/zig
Log | Files | Refs | README | LICENSE

commit 07b6173cb8877ce22fe6cb754cfc17367989b11e (tree)
parent 7e946bc790c245242af3716199878cf99c369d48
Author: Veikka Tuominen <git@vexu.eu>
Date:   Thu, 20 Oct 2022 12:48:13 +0300

delete failing recursive test

Don't forget to add these back when solving #12973

Diffstat:
Dtest/cases/recursive_inline_function.0.zig | 13-------------
Dtest/cases/recursive_inline_function.1.zig | 20--------------------
2 files changed, 0 insertions(+), 33 deletions(-)

diff --git a/test/cases/recursive_inline_function.0.zig b/test/cases/recursive_inline_function.0.zig @@ -1,13 +0,0 @@ -pub fn main() void { - const y = fibonacci(7); - if (y - 21 != 0) unreachable; -} - -inline fn fibonacci(n: usize) usize { - if (n <= 2) return n; - return fibonacci(n - 2) + fibonacci(n - 1); -} - -// run -// target=x86_64-linux,arm-linux,wasm32-wasi -// diff --git a/test/cases/recursive_inline_function.1.zig b/test/cases/recursive_inline_function.1.zig @@ -1,20 +0,0 @@ -// This additionally tests that the compile error reports the correct source location. -// Without storing source locations relative to the owner decl, the compile error -// here would be off by 2 bytes (from the "7" -> "999"). -pub fn main() void { - const y = fibonacci(999); - if (y - 21 != 0) unreachable; -} - -inline fn fibonacci(n: usize) usize { - if (n <= 2) return n; - return fibonacci(n - 2) + fibonacci(n - 1); -} - -// error -// -// :11:21: error: evaluation exceeded 1000 backwards branches -// :11:21: note: use @setEvalBranchQuota() to raise the branch limit from 1000 -// :11:40: note: called from here (6 times) -// :11:21: note: called from here (495 times) -// :5:24: note: called from here