Chris Lattner 36019aa5c6 Make the AND elimination operation recursive and significantly more powerful, ... eliminating an and for Nate's testcase: int %bar(int %a, int %b) { entry: %tmp.1 = setne int %a, 0 %tmp.2 = setne int %b, 0 %tmp.3 = or bool %tmp.1, %tmp.2 %retval = cast bool %tmp.3 to int ret int %retval } generating: _bar: addic r2, r3, -1 subfe r2, r2, r3 addic r3, r4, -1 subfe r3, r3, r4 or r3, r2, r3 blr instead of: _bar: addic r2, r3, -1 subfe r2, r2, r3 addic r3, r4, -1 subfe r3, r3, r4 or r2, r2, r3 rlwinm r3, r2, 0, 31, 31 blr git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21315 91177308-0d34-0410-b5e6-96231b3b80d8		2005-04-18 03:48:41 +00:00
..
LegalizeDAG.cpp	Implement expansion of unsigned i64 -> FP.	2005-04-13 05:09:42 +00:00
Makefile	Change Library Names Not To Conflict With Others When Installed	2004-10-27 23:18:45 +00:00
SelectionDAG.cpp	Make the AND elimination operation recursive and significantly more powerful,	2005-04-18 03:48:41 +00:00
SelectionDAGISel.cpp	Fold shift by size larger than type size to undef	2005-04-12 23:12:17 +00:00
SelectionDAGPrinter.cpp	Don't mash stuff together.	2005-01-16 07:28:31 +00:00
TargetLowering.cpp	Add a hook to find out how the target handles shift amounts that are out of	2005-01-19 03:36:14 +00:00