Rafael Espindola 0513059726 Teach GVN to reason about edges dominating uses. This allows it to handle cases ... where some fact lake a=b dominates a use in a phi, but doesn't dominate the basic block itself. This feature could also be implemented by splitting critical edges, but at least with the current algorithm reasoning about the dominance directly is faster. The time for running "opt -O2" in the testcase in pr10584 is 1.003 times slower and on gcc as a single file it is 1.0007 times faster. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@162023 91177308-0d34-0410-b5e6-96231b3b80d8		2012-08-16 15:09:43 +00:00
..
llvm	Teach GVN to reason about edges dominating uses. This allows it to handle cases	2012-08-16 15:09:43 +00:00
llvm-c	A couple of addition comment fixes	2012-08-10 18:30:44 +00:00