Displaying 5 results from an estimated 5 matches for "pr681".
Did you mean:
pr686
2006 Apr 20
0
[LLVMdev] First draft of release notes done
....stacksave/llvm.stackrestore intrinsics, for
proper C99 Variable Length Array support.
* Nate reimplemented post-dominator analysis using the Lengauer and
Tarjan algorithm, replacing the old iterative implementation. On one
extreme example his implementation is 40x faster than the old one
(PR681) and uses far less memory.
* Daniel Berlin contributed an ET-Forest implementation, which
replaces the old LLVM DominatorSet with a far more efficient data
structure (in both space and time).
* Andrew wrote a new "reg2mem" which transforms an LLVM function so that
there are no SSA v...
2006 Apr 19
4
[LLVMdev] First draft of release notes done
Please take a look:
http://llvm.org/docs/ReleaseNotes.html
-Chris
--
http://nondot.org/sabre/
http://llvm.org/
2006 Apr 14
2
[LLVMdev] [DRAFT] LLVM 1.7 release announcement notes [DRAFT]
...or not, based on
Nate's design and implementation in the code generator.
* Nate reimplemented post-dominator analysis using the Lengauer and
Tarjan algorithm, replacing the old iterative implementation. On one
extreme example his implementation is 40x faster than the old one
(PR681) and uses far less memory.
* Daniel Berlin contributed an ET-Forest implementation, which
replaces the old LLVM DominatorSet with a far more efficient data
structure (in both space and time).
* Andrew wrote a new "reg2mem" which transforms an LLVM function so that
there are...
2006 Apr 20
0
[LLVMdev] [DRAFT] LLVM 1.7 release announcement notes [DRAFT]
...generator.
Try to reword and get rid of one "based on".
> * Nate reimplemented post-dominator analysis using the Lengauer and
> Tarjan algorithm, replacing the old iterative implementation. On one
> extreme example his implementation is 40x faster than the old one
> (PR681) and uses far less memory.
> * Daniel Berlin contributed an ET-Forest implementation, which
> replaces the old LLVM DominatorSet with a far more efficient data
> structure (in both space and time).
> * Andrew wrote a new "reg2mem" which transforms an LLVM function so tha...
2006 Apr 20
0
LLVM 1.7 Release!
...em (e.g. X86).
13. The -instcombine pass now uses information about whether individual
bits are actually used to simplify code.
14. Nate reimplemented post-dominator analysis using the Lengauer and
Tarjan algorithm, replacing the old iterative implementation. On one
extreme example (PR681) his implementation is 40x faster than the old
one and uses 19x less memory.
15. Daniel Berlin contributed an ET-Forest implementation, which
replaces the old LLVM DominatorSet with a far more efficient data
structure (in both space and time).
16. Andrew wrote a new "reg2mem&quo...