llvm-6502/test/fib.ll
Chris Lattner 98af669fb9 Make fib be more real
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@413 91177308-0d34-0410-b5e6-96231b3b80d8
2001-09-01 01:47:52 +00:00

37 lines
726 B
LLVM

implementation
declare int "atoi"(sbyte *)
ulong "fib"(ulong %n)
begin
setlt ulong %n, 2 ; {bool}:0
br bool %0, label %BaseCase, label %RecurseCase
BaseCase:
ret ulong 1
RecurseCase:
%n2 = sub ulong %n, 2
%n1 = sub ulong %n, 1
%f2 = call ulong(ulong) %fib(ulong %n2)
%f1 = call ulong(ulong) %fib(ulong %n1)
%result = add ulong %f2, %f1
ret ulong %result
end
ulong "main"(int %argc, sbyte ** %argv)
begin
seteq int %argc, 2 ; {bool}:0
br bool %0, label %HasArg, label %Continue
HasArg:
; %n1 = atoi(argv[1])
%n1 = add int 1, 1
br label %Continue
Continue:
%n = phi int [%n1, %HasArg], [1, %0]
%N = cast int %n to ulong
%F = call ulong(ulong) %fib(ulong %N)
ret ulong %F
end