Chris Lattner b3ddfc42af add two dag combines: ... (C1-X) == C2 --> X == C1-C2 (X+C1) == C2 --> X == C2-C1 This allows us to compile this: bool %X(int %X) { %Y = add int %X, 14 %Z = setne int %Y, 12345 ret bool %Z } into this: _X: cmpl $12331, 4(%esp) setne %al movzbl %al, %eax andl $1, %eax ret not this: _X: movl $14, %eax addl 4(%esp), %eax cmpl $12345, %eax setne %al movzbl %al, %eax andl $1, %eax ret Testcase here: Regression/CodeGen/X86/compare-add.ll nukage of the and coming up next. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@25898 91177308-0d34-0410-b5e6-96231b3b80d8		2006-02-02 06:36:13 +00:00
..
DAGCombiner.cpp	add two dag combines:	2006-02-02 06:36:13 +00:00
LegalizeDAG.cpp	*** empty log message ***	2006-02-01 19:05:15 +00:00
Makefile
ScheduleDAG.cpp
ScheduleDAGList.cpp	make -debug output less newliney	2006-02-02 00:38:08 +00:00
ScheduleDAGSimple.cpp
SelectionDAG.cpp
SelectionDAGISel.cpp	Implement matching constraints. We can now say things like this:	2006-02-02 00:25:23 +00:00
SelectionDAGPrinter.cpp
TargetLowering.cpp	Beef up the interface to inline asm constraint parsing, making it more general, useful, and easier to use.	2006-02-01 01:29:47 +00:00