Displaying 20 results from an estimated 20 matches for "fib2".
Did you mean:
fib
2011 Jun 18
1
[LLVMdev] loop only executes once
...n't work
for any input > 2 the function returns 2, the loop only executes once
Hopefully someone can see what the problem is from the output and the
source. Does the input ArgX require to be cast?
Cheers
module dump
verifying module
; ModuleID = 'test fib'
define fastcc i32 @fib2(i32 %ArgX) {
EntryBlock:
%A = alloca i32
%B = alloca i32
%C = alloca i32
%D = alloca i32
store i32 1, i32* %A
store i32 1, i32* %B
store i32 0, i32* %C
store i32 %ArgX, i32* %D
%cond = icmp sle i32 %ArgX, 2
br i1 %cond, label %IF, label %Else
IF:...
2011 Apr 08
1
R and lazy evaluation
Haskell is the prototypical lazy evaluation language. One can compute a
Fibonacci sequence by the Haaskell equivalent of the following R code.
> fibs <- c(0, 1, rep(0, 8))
> fibs[3:10] <- fibs + fibs[-1]
This works as follows.
fibs = 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
fibs = 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
When one adds fibs to fibs[-1], one is effectively adding diagonally:
fibs[3] <-
2013 Oct 03
0
[LLVMdev] libclang JIT frontend
...( x == 0 )
return 0;
if ( x == 1 )
return 1;
return ( fib( x-1 ) + fib( x-2) );
}
int main( int argc, char** argv )
{
return fib( 10 );
}
//=============================================================================
/******* test2.c *********/
int fib2( int x )
{
if ( x == 0 )
return 0;
if ( x == 1 )
return 1;
return ( fib2( x-1 ) + fib2( x-2) );
}
int main( int argc, char** argv )
{
return fib2( 12 );
}
//=============================================================================
/******...
2010 Mar 03
1
[LLVMdev] llvm hangs: fibonacci numbers, recursive
...1
%cond = icmp ult i32 %i.next, 7
br i1 %cond, label %loop, label %exit
exit:
ret void
}
define i32 @fib(i32 %n) nounwind {
%cond = icmp ult i32 %n, 2
br i1 %cond, label %c1, label %c2
c1:
ret i32 1
c2:
%n1 = sub i32 %n, 1
%n2 = sub i32 %n, 2
%fib1 = call i32 @fib(i32 %n1)
%fib2 = call i32 @fib(i32 %n2)
%r = add i32 %fib1, %fib2
ret i32 %r
}
declare i32 @printf(i8*, ...) nounwind
-------------- next part --------------
A non-text attachment was scrubbed...
Name: fib.bc
Type: application/octet-stream
Size: 496 bytes
Desc: not available
URL: <http://lists.llvm.org/p...
2015 Feb 26
5
[LLVMdev] [RFC] AArch64: Should we disable GlobalMerge?
Hi all,
I've started looking at the GlobalMerge pass, enabled by default on
ARM and AArch64. I think we should reconsider that, at least for
AArch64.
As is, the pass just merges all globals together, in groups of 4KB
(AArch64, 128B on ARM).
At the time it was enabled, the general thinking was "it's almost
free, it doesn't affect performance much, we might as well use it".
2012 Feb 19
2
[LLVMdev] Problem While Running Test Suite
...rce/Regression/C++/EH/function_try_block | * | * |
SingleSource/Regression/C++/EH/simple_rethrow | * | * |
SingleSource/Regression/C++/EH/ConditionalExpr | * | * |
SingleSource/Benchmarks/Shootout/fib2 | * | * |
SingleSource/Benchmarks/Shootout/ackermann | * | * |
SingleSource/Benchmarks/Shootout/ary3 | * | * |
SingleSource/Benchmarks/Shootout/random...
2008 Feb 03
0
[LLVMdev] 2.2 Prerelease available for testing
...1 * 0.03 | - - n/a n/a
SingleSource/Benchmarks/Shootout/ary3 | 0.0050 1128 0.0069 * 0.0068 | 4.87 5.08 4.97 * 5.02 | 0.96 0.98 n/a n/a
SingleSource/Benchmarks/Shootout/fib2 | 0.0045 1212 0.0076 * 0.0073 | 10.31 5.99 5.18 * 5.19 | 1.72 1.99 n/a n/a
SingleSource/Benchmarks/Shootout/hash | 0.0271 3772 0.0196 * 0.01...
2007 Sep 18
0
[LLVMdev] 2.1 Pre-Release Available (testers needed)
...1 * 0.04 | - - n/a n/a
SingleSource/Benchmarks/Shootout/ary3 | 0.0000 1312 0.0040 * 0.0080 | 11.64 11.99 11.86 * 11.97 | 0.97 0.98 n/a n/a
SingleSource/Benchmarks/Shootout/fib2 | 0.0120 1240 0.0160 * 0.0080 | 5.33 7.34 7.82 * 7.70 | 0.73 0.68 n/a n/a
SingleSource/Benchmarks/Shootout/hash | 0.0280 3704 0.0280 * 0.02...
2008 Jan 24
6
[LLVMdev] 2.2 Prerelease available for testing
LLVMers,
The 2.2 prerelease is now available for testing:
http://llvm.org/prereleases/2.2/
If anyone can help test this release, I ask that you do the following:
1) Build llvm and llvm-gcc (or use a binary). You may build release
(default) or debug. You may pick llvm-gcc-4.0, llvm-gcc-4.2, or both.
2) Run 'make check'.
3) In llvm-test, run 'make TEST=nightly report'.
4) When
2007 Sep 18
0
[LLVMdev] 2.1 Pre-Release Available (testers needed)
...1 * 0.02 | - - n/a n/a
SingleSource/Benchmarks/Shootout/ary3 | 0.0077 1304 0.0056 * 0.0094 | 4.63 4.64 4.85 * 4.76 | 1.00 0.95 n/a n/a
SingleSource/Benchmarks/Shootout/fib2 | 0.0031 1232 0.0116 * 0.0111 | 3.19 4.67 4.80 * 4.73 | 0.68 0.66 n/a n/a
SingleSource/Benchmarks/Shootout/hash | 0.0238 3692 0.0184 * 0.01...
2008 Jan 28
0
[LLVMdev] 2.2 Prerelease available for testing
...0 * 0.01 | - - n/a n/a
SingleSource/Benchmarks/Shootout/ary3 | 0.0024 1200 0.0033 * 0.0031 | 4.69 4.99 5.12 * 4.97 | 0.94 0.92 n/a n/a
SingleSource/Benchmarks/Shootout/fib2 | 0.0101 1252 0.0038 * 0.0036 | 2.52 2.84 3.12 * 3.85 | 0.89 0.81 n/a n/a
SingleSource/Benchmarks/Shootout/hash | 0.0115 3968 0.0157 * 0.00...
2018 Apr 26
0
Compare test-suite benchmarks performance complied without TBAA, with default TBAA and with new TBAA struct path
...942| -0.71| 26469558| 0|0.003073281| -0.43| 26469558| 0|
|SingleSource/Benchmarks/Shootout/Shootout-ary3.test | 54|0.649109744| 1783063149|0.648322161| 0.12| 1783063145| 0|0.645780095| 0.52| 1783063144| 0|
|SingleSource/Benchmarks/Shootout/Shootout-fib2.test | 40|1.333849001|12893280983|1.333856586| 0|12893280979| 0|1.333797266| 0|12893280979| 0|
|SingleSource/Benchmarks/Shootout/Shootout-hash.test | 40|2.835678675|13468880571|3.126493844| -9.3|13454912752| 0.1|3.16155879...
2009 Oct 20
1
[LLVMdev] 2.6 pre-release2 ready for testing
....02 | - - n/a n/a
> SingleSource/Benchmarks/Shootout/ary3 |
> 0.0000 1148 0.0000 * 0.0000 | 4.40 4.32
> 4.48 * 4.33 | 1.02 0.98 n/a n/a
> SingleSource/Benchmarks/Shootout/fib2 |
> 0.0000 964 0.0200 * 0.0100 | 0.50 0.58
> 0.51 * 0.60 | 0.86 0.98 n/a n/a
> SingleSource/Benchmarks/Shootout/hash |
> 0.0300 3028 0.0100 * ...
2009 Oct 20
0
[LLVMdev] 2.6 pre-release2 ready for testing
Hi Tanya,
> 1) Compile llvm from source and untar the llvm-test in the projects
> directory (name it llvm-test or test-suite). Choose to use a
> pre-compiled llvm-gcc or re-compile it yourself.
I compiled llvm and llvm-gcc with separate objects directories.
Platform is x86_64-linux-gnu.
> 2) Run make check, report any failures (FAIL or unexpected pass). Note
> that you need to
2009 Oct 20
1
[LLVMdev] 2.6 pre-release2 ready for testing
...n/a n/a
> SingleSource/Benchmarks/Shootout/
> ary3 | 0.0000 1148
> 0.0000 * 0.0000 | 4.40 4.32 4.48
> * 4.33 | 1.02 0.98 n/a n/a
> SingleSource/Benchmarks/Shootout/
> fib2 | 0.0000 964
> 0.0200 * 0.0100 | 0.50 0.58 0.51
> * 0.60 | 0.86 0.98 n/a n/a
> SingleSource/Benchmarks/Shootout/
> hash | 0.0300 3028
> 0.0...
2007 Sep 15
22
[LLVMdev] 2.1 Pre-Release Available (testers needed)
LLVMers,
The 2.1 pre-release (version 1) is available for testing:
http://llvm.org/prereleases/2.1/version1/
I'm looking for members of the LLVM community to test the 2.1
release. There are 2 ways you can help:
1) Download llvm-2.1, llvm-test-2.1, and the appropriate llvm-gcc4.0
binary. Run "make check" and the full llvm-test suite (make
TEST=nightly report).
2) Download
2009 Oct 17
12
[LLVMdev] 2.6 pre-release2 ready for testing
LLVMers,
2.6 pre-release2 is ready to be tested by the community.
http://llvm.org/prereleases/2.6/
If you have time, I'd appreciate anyone who can help test the release.
To test llvm-gcc:
1) Compile llvm from source and untar the llvm-test in the projects
directory (name it llvm-test or test-suite). Choose to use a pre-
compiled llvm-gcc or re-compile it yourself.
2) Run make check,
2009 Feb 07
11
[LLVMdev] 2.5 Pre-release1 available for testing
LLVMers,
The 2.5 pre-release is available for testing:
http://llvm.org/prereleases/2.5/
If you have time, I'd appreciate anyone who can help test the release.
Please do the following:
1) Download/compile llvm source, and either compile llvm-gcc source or
use llvm-gcc binary (please compile llvm-gcc with fortran if you can).
2) Run make check, send me the testrun.log
3) Run "make
2014 Jan 28
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
Hi Stepan,
Sorry for the delay. It's great that you are working on MergeFunctions
as well and I agree, we should definitely try to combine our efforts to
improve MergeFunctions.
Just to give you some context, the pass (with the similar function
merging patch) is already being used in a production setting. From my
point of view, it would be better if we focus on improving its
capability
2014 Jan 30
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...62 4 0.02 161595 2 0.02 163177
fftFunctions.ll 16 176353 0 0.02 176338 0 0.03 176338
fft.ll 3 32602 0 0.01 32587 0 0.01 32587
FFT.ll 6 26717 0 0.01 26697 0 0.01 26697
fftmisc.ll 4 8115 0 0.01 8085 0 0.01 8085
fftsg.ll 37 694548 0 0.07 694523 0 0.08 677578
Fheap.ll 16 55029 0 0.02 55009 0 0.02 55009
fib2.ll 2 3596 0 0.01 3577 0 0.01 3577
fibo.ll 11 15159 0 0.01 15134 0 0.01 15134
FileDir.ll 30 298591 0 0.03 298563 0 0.03 298021
FileFind.ll 33 384904 0 0.04 384876 0 0.04 361202
filehandle.ll 5 30313 0 0.01 30292 0 0.01 30292
FileIO.ll 21 88816 0 0.02 88788 0 0.01 88788
FileName.ll 3 42850 0 0.01 428...