blob: 9bc5474840a60f40ae1344392f7fa8a2d7274d73 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
|
/* heh, this technically speaking works, but I guess the compiler can't collapse
* frames so the bifurcating nature of fibonacci just gets mapped to a linear
* sequence of calls, taking up way more stack space than a typical, returning,
* function */
fib(int n, (int) res)
{
fwd_copy(n) => int n1, int n2;
if n1 < 2 {
res(1);
} else {
fwd_copy(n2) => int n3, int n4;
fib(n3 - 1) => int f1;
fib(n4 - 2) => int f2;
res(f1 + f2);
}
}
/* 'extern' println */
fwd_println(auto n);
fwd_copy(auto n, (auto, auto) n1);
main()
{
fib(6) => int n;
fwd_println(n);
}
|
