Chris Lattner 7b4ad94282 Fix a problem that Dan Berlin noticed, where reassociation would not succeed ... in building maximal expressions before simplifying them. In particular, i cases like this: X-(A+B+X) the code would consider A+B+X to be a maximal expression (not understanding that the single use '-' would be turned into a + later), simplify it (a noop) then later get simplified again. Each of these simplify steps is where the cost of reassociation comes from, so this patch should speed up the already fast pass a bit. Thanks to Dan for noticing this! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23214 91177308-0d34-0410-b5e6-96231b3b80d8		2005-09-02 07:07:58 +00:00
..
Hello
Instrumentation
IPO	Transform floor((double)FLT) -> (double)floorf(FLT), implementing	2005-08-24 17:22:17 +00:00
Scalar	Fix a problem that Dan Berlin noticed, where reassociation would not succeed	2005-09-02 07:07:58 +00:00
Utils
ExprTypeConvert.cpp
LevelRaise.cpp
Makefile
TransformInternals.cpp
TransformInternals.h