RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity

Code clean up.

Browse Source 
llvm-svn: 104173
This commit is contained in:
Evan Cheng 2010-05-19 22:42:23 +00:00
parent 069568c287
commit 9fe8c861bf
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp
View File

@ -217,9 +217,6 @@ void ScheduleDAGSDNodes::BuildSchedUnits() {
// This is a temporary workaround. // This is a temporary workaround.
SUnits.reserve(NumNodes * 2); SUnits.reserve(NumNodes * 2);
// Check to see if the scheduler cares about latencies.
bool UnitLatencies = ForceUnitLatencies();
// Add all nodes in depth first order. // Add all nodes in depth first order.
SmallVector<SDNode*, 64> Worklist; SmallVector<SDNode*, 64> Worklist;
SmallPtrSet<SDNode*, 64> Visited; SmallPtrSet<SDNode*, 64> Visited;
@ -282,9 +279,6 @@ void ScheduleDAGSDNodes::BuildSchedUnits() {
N->setNodeId(NodeSUnit->NodeNum); N->setNodeId(NodeSUnit->NodeNum);
// Assign the Latency field of NodeSUnit using target-provided information. // Assign the Latency field of NodeSUnit using target-provided information.
if (UnitLatencies)
NodeSUnit->Latency = 1;
else
ComputeLatency(NodeSUnit); ComputeLatency(NodeSUnit);
} }
} }
@ -377,6 +371,12 @@ void ScheduleDAGSDNodes::BuildSchedGraph(AliasAnalysis *AA) {
} }
void ScheduleDAGSDNodes::ComputeLatency(SUnit *SU) { void ScheduleDAGSDNodes::ComputeLatency(SUnit *SU) {
// Check to see if the scheduler cares about latencies.
if (ForceUnitLatencies()) {
SU->Latency = 1;
return;
}
const InstrItineraryData &InstrItins = TM.getInstrItineraryData(); const InstrItineraryData &InstrItins = TM.getInstrItineraryData();
// Compute the latency for the node. We use the sum of the latencies for // Compute the latency for the node. We use the sum of the latencies for