Chris Lattner 21a57dc751 Two simplifications for token factor nodes: simplify tf(x,x) -> x. ... simplify tf(x,y,y,z) -> tf(x,y,z). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@28233 91177308-0d34-0410-b5e6-96231b3b80d8		2006-05-12 05:01:37 +00:00
..
DAGCombiner.cpp	Two simplifications for token factor nodes: simplify tf(x,x) -> x.	2006-05-12 05:01:37 +00:00
LegalizeDAG.cpp	Fix PR773	2006-05-09 18:20:51 +00:00
Makefile	Change Library Names Not To Conflict With Others When Installed	2004-10-27 23:18:45 +00:00
ScheduleDAG.cpp	Add capability to scheduler to commute nodes for profit.	2006-05-12 01:58:24 +00:00
ScheduleDAGList.cpp	Refactor scheduler code. Move register-reduction list scheduler to a	2006-05-11 23:55:42 +00:00
ScheduleDAGRRList.cpp	Add capability to scheduler to commute nodes for profit.	2006-05-12 01:58:24 +00:00
ScheduleDAGSimple.cpp	Move simple-selector-specific types to the simple selector.	2006-03-10 07:51:18 +00:00
SelectionDAG.cpp	Fold shifts with undef operands.	2006-05-08 17:29:49 +00:00
SelectionDAGISel.cpp	Refactor scheduler code. Move register-reduction list scheduler to a	2006-05-11 23:55:42 +00:00
SelectionDAGPrinter.cpp	print arbitrary constant pool entries	2006-03-05 09:38:03 +00:00
TargetLowering.cpp	When tracking demanded bits, if any bits from the sext of an SRA are demanded,	2006-05-08 17:22:53 +00:00