Dan Gohman 8968450305 Tidy SDNode::use_iterator, and complete the transition to have it ... parallel its analogue, Value::value_use_iterator. The operator* method now returns the user, rather than the use. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@54127 91177308-0d34-0410-b5e6-96231b3b80d8		2008-07-27 20:43:25 +00:00
..
CallingConvLower.cpp	Trim unnecessary #includes.	2008-07-11 20:38:31 +00:00
DAGCombiner.cpp	Tidy SDNode::use_iterator, and complete the transition to have it	2008-07-27 20:43:25 +00:00
LegalizeDAG.cpp	Tidy SDNode::use_iterator, and complete the transition to have it	2008-07-27 20:43:25 +00:00
LegalizeFloatTypes.cpp	Softfloat support for FDIV. Patch by	2008-07-18 21:18:48 +00:00
LegalizeIntegerTypes.cpp	Factorize some code for determining which libcall to use.	2008-07-17 02:36:29 +00:00
LegalizeTypes.cpp	Tidy SDNode::use_iterator, and complete the transition to have it	2008-07-27 20:43:25 +00:00
LegalizeTypes.h	Some binary operations were being treated as	2008-07-27 12:28:43 +00:00
LegalizeTypesGeneric.cpp	Remove PromoteIntRes_FP_ROUND - not sure what it	2008-07-10 15:29:55 +00:00
LegalizeVectorTypes.cpp	Some binary operations were being treated as	2008-07-27 12:28:43 +00:00
Makefile
ScheduleDAG.cpp	Tidy SDNode::use_iterator, and complete the transition to have it	2008-07-27 20:43:25 +00:00
ScheduleDAGList.cpp	Add a new function, ReplaceAllUsesOfValuesWith, which handles bulk	2008-07-17 19:10:17 +00:00
ScheduleDAGRRList.cpp	Add a new function, ReplaceAllUsesOfValuesWith, which handles bulk	2008-07-17 19:10:17 +00:00
SelectionDAG.cpp	Tidy SDNode::use_iterator, and complete the transition to have it	2008-07-27 20:43:25 +00:00
SelectionDAGISel.cpp	Use AliasAnalysis::pointsToConstantMemory in SDISel to avoid unnecessary	2008-07-25 00:04:14 +00:00
SelectionDAGPrinter.cpp	Make the GraphRoot edge look like a chain edge, which is more accurate,	2008-07-22 17:52:59 +00:00
TargetLowering.cpp	Factorize some code for determining which libcall to use.	2008-07-17 02:36:29 +00:00