Chris Lattner f12f8def39 rewrite the code used to construct pruned SSA form with the IDF method. ... In the old way, we computed and inserted phi nodes for the whole IDF of the definitions of the alloca, then computed which ones were dead and removed them. In the new method, we first compute the region where the value is live, and use that information to only insert phi nodes that are live. This eliminates the need to compute liveness later, and stops the algorithm from inserting a bunch of phis which it then later removes. This speeds up the testcase in PR1432 from 2.00s to 0.15s (14x) in a release build and 6.84s->0.50s (14x) in a debug build. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@40825 91177308-0d34-0410-b5e6-96231b3b80d8		2007-08-04 22:50:14 +00:00
..
Hello	Fix typo in comment.	2007-05-06 13:37:16 +00:00
Instrumentation	New CallInst interface to address GLIBCXX_DEBUG errors caused by	2007-08-01 03:43:44 +00:00
IPO	More explicit keywords.	2007-08-01 15:32:29 +00:00
Scalar	Clean up comments, fix up some confusing code logic.	2007-08-04 18:45:32 +00:00
Utils	rewrite the code used to construct pruned SSA form with the IDF method.	2007-08-04 22:50:14 +00:00
Makefile	Build Hello by default so it can be used in test cases.	2007-04-11 21:03:37 +00:00