Searched refs:Fibonacci (Results 1 – 9 of 9) sorted by relevance
55 8. void Fibonacci(int terms, int& total)71 24. Fibonacci(5, total);266 pass 1/211 = (1.0000) (0.0000) [Simplify the CFG on function (?Fibonacci@@YAXHAEAH@Z)]267 pass 2/211 = (0.7611) (-0.2389) [SROA on function (?Fibonacci@@YAXHAEAH@Z)]268 pass 3/211 = (0.7611) (0.0000) [Early CSE on function (?Fibonacci@@YAXHAEAH@Z)]280 pass 15/211 = (0.7611) (0.0000) [Simplify the CFG on function (?Fibonacci@@YAXHAEAH@Z)]a286 pass 21/211 = (0.7345) (0.0000) [SROA on function (?Fibonacci@@YAXHAEAH@Z)]289 pass 24/211 = (0.7345) (0.0000) [Jump Threading on function (?Fibonacci@@YAXHAEAH@Z)]291 pass 26/211 = (0.7345) (0.0000) [Simplify the CFG on function (?Fibonacci@@YAXHAEAH@Z)]294 pass 29/211 = (0.7345) (0.0000) [Simplify the CFG on function (?Fibonacci@@YAXHAEAH@Z)][all …]
7 struct Fibonacci { struct13 enum { value = Fibonacci<I>::value };16 template<> struct Fibonacci<0> { struct20 template<> struct Fibonacci<1> { struct24 int array5[Fibonacci<5>::value == 5? 1 : -1]; argument25 int array10[Fibonacci<10>::value == 55? 1 : -1];
11 add_llvm_example(Fibonacci
2 add_subdirectory(Fibonacci)
6 # Source program - A version of Fibonacci
11 # Source program - A version of Fibonacci
24 `Fibonacci numbers: <http://en.wikipedia.org/wiki/Fibonacci_number>`_
239 * The Fibonacci project is a sample program that uses the JIT. Modify the
3917 * - llvm/examples/Fibonacci