- Feb 08, 2004
-
-
Brian Gaeke authored
I don't know why its indentation has been bugging me, but it has. llvm-svn: 11180
-
Chris Lattner authored
llvm-svn: 11179
-
Chris Lattner authored
removeDeadNodes is called, only call it at the end of the pass being run. This saves 1.3 seconds running DSA on 177.mesa (5.3->4.0s), which is pretty big. This is only possible because of the automatic garbage collection done on forwarding nodes. llvm-svn: 11178
-
Chris Lattner authored
llvm-svn: 11177
-
Chris Lattner authored
llvm-svn: 11176
-
Chris Lattner authored
DSGraphs while they are forwarding. When the last reference to the forwarding node is dropped, the forwarding node is autodeleted. This should simplify removeTriviallyDead nodes, and is only (efficiently) possible because we are using an ilist of dsnodes now. llvm-svn: 11175
-
Chris Lattner authored
G == 0 llvm-svn: 11174
-
Chris Lattner authored
llvm-svn: 11173
-
Chris Lattner authored
quite the same as for non-intrusive lists of pointers to nodes. To support transitioning code bases, add a new 'compatibility' iterator. llvm-svn: 11172
-
Chris Lattner authored
llvm-svn: 11171
-
Chris Lattner authored
llvm-svn: 11170
-
Chris Lattner authored
llvm-svn: 11169
-
Chris Lattner authored
Rename stats from dsnode -> dsa Add a new stat llvm-svn: 11167
-
Chris Lattner authored
llvm-svn: 11166
-
Chris Lattner authored
provide node_begin/end iterators, which are only guaranteed to be bidirectional, not random access. llvm-svn: 11165
-
Chris Lattner authored
llvm-svn: 11160
-
- Feb 07, 2004
-
-
Chris Lattner authored
llvm-svn: 11159
-
Chris Lattner authored
llvm-svn: 11157
-
- Feb 06, 2004
-
-
Brian Gaeke authored
directly instead). Fix LockHolder/MutexLocker typo. llvm-svn: 11156
-
Chris Lattner authored
llvm-svn: 11154
-
Misha Brukman authored
llvm-svn: 11153
-
Alkis Evlogimenos authored
llvm-svn: 11151
-
John Criswell authored
llvm-svn: 11149
-
John Criswell authored
llvm-svn: 11148
-
Chris Lattner authored
llvm-svn: 11147
-
Chris Lattner authored
llvm-svn: 11146
-
Chris Lattner authored
llvm-svn: 11145
-
Chris Lattner authored
llvm-svn: 11144
-
Alkis Evlogimenos authored
of the virtual register to certain functions. llvm-svn: 11143
-
Chris Lattner authored
keeps finding more code motion opportunities now that the dominators are correct! llvm-svn: 11142
-
- Feb 05, 2004
-
-
Alkis Evlogimenos authored
slots each. As a concequence they get numbered as 0, 2, 4 and so on. The first slot is used for operand uses and the second for defs. Here's an example: 0: A = ... 2: B = ... 4: C = A + B ;; last use of A The live intervals should look like: A = [1, 5) B = [3, x) C = [5, y) llvm-svn: 11141
-
Chris Lattner authored
llvm-svn: 11140
-
Chris Lattner authored
llvm-svn: 11139
-
Chris Lattner authored
llvm-svn: 11138
-
Chris Lattner authored
The problem is that the dominator update code didn't "realize" that it's possible for the newly inserted basic block to dominate anything. Because it IS possible, stuff was getting updated wrong. llvm-svn: 11137
-
Chris Lattner authored
llvm-svn: 11136
-
Alkis Evlogimenos authored
access. Rather we only have to do it on the creation of the interval. llvm-svn: 11135
-
Chris Lattner authored
llvm-svn: 11133
-
Chris Lattner authored
complete rewrite of load-vn will make it a bit faster. This changes speeds up the gcse pass (which uses load-vn) from 25.45s to 0.42s on the testcase in PR209. I've also verified that this gives the exact same results as the old one. llvm-svn: 11132
-
Chris Lattner authored
which causes big reindentation. While I'm at it, I fix the fixme by removing some dead code. llvm-svn: 11131
-