Changes in directory llvm/lib/CodeGen/SelectionDAG:
ScheduleDAGList.cpp updated: 1.22 -> 1.23
---
Log message:
Shrinkify some fields, fit to 80 columns
---
Diffs of the changes: (+11 -11)
ScheduleDAGList.cpp | 22 +++++++++++-----------
1 files changed, 11 insertions(+), 11 deletions(-)
Index: llvm/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
diff -u llvm/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp:1.22
llvm/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp:1.23
--- llvm/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp:1.22 Tue Mar 7
22:37:58 2006
+++ llvm/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp Tue Mar 7 22:41:06 2006
@@ -35,8 +35,8 @@
Statistic<> NumNoops ("scheduler", "Number of noops inserted");
Statistic<> NumStalls("scheduler", "Number of pipeline stalls");
- /// SUnit - Scheduling unit. It's an wrapper around either a single SDNode
or a
- /// group of nodes flagged together.
+ /// SUnit - Scheduling unit. It's an wrapper around either a single SDNode or
+ /// a group of nodes flagged together.
struct SUnit {
SDNode *Node; // Representative node.
std::vector<SDNode*> FlaggedNodes; // All nodes flagged to Node.
@@ -44,14 +44,14 @@
std::set<SUnit*> ChainPreds; // All chain predecessors.
std::set<SUnit*> Succs; // All real successors.
std::set<SUnit*> ChainSuccs; // All chain successors.
- int NumPredsLeft; // # of preds not scheduled.
- int NumSuccsLeft; // # of succs not scheduled.
- int NumChainPredsLeft; // # of chain preds not scheduled.
- int NumChainSuccsLeft; // # of chain succs not scheduled.
+ short NumPredsLeft; // # of preds not scheduled.
+ short NumSuccsLeft; // # of succs not scheduled.
+ short NumChainPredsLeft; // # of chain preds not scheduled.
+ short NumChainSuccsLeft; // # of chain succs not scheduled.
int SethiUllman; // Sethi Ullman number.
- bool isTwoAddress; // Is a two-address instruction.
- bool isDefNUseOperand; // Is a def&use operand.
- unsigned Latency; // Node latency.
+ bool isTwoAddress : 1; // Is a two-address instruction.
+ bool isDefNUseOperand : 1; // Is a def&use operand.
+ unsigned short Latency; // Node latency.
unsigned CycleBound; // Upper/lower cycle to be scheduled
at.
SUnit *Next;
@@ -247,7 +247,7 @@
// latency. For example, the reader can very well read the register written
// by the predecessor later than the issue cycle. It also depends on the
// interrupt model (drain vs. freeze).
- PredSU->CycleBound = std::max(PredSU->CycleBound, CurrCycle +
PredSU->Latency);
+ PredSU->CycleBound = std::max(PredSU->CycleBound,CurrCycle +
PredSU->Latency);
if (!isChain)
PredSU->NumSuccsLeft--;
@@ -278,7 +278,7 @@
// latency. For example, the reader can very well read the register written
// by the predecessor later than the issue cycle. It also depends on the
// interrupt model (drain vs. freeze).
- SuccSU->CycleBound = std::max(SuccSU->CycleBound, CurrCycle +
SuccSU->Latency);
+ SuccSU->CycleBound = std::max(SuccSU->CycleBound,CurrCycle +
SuccSU->Latency);
if (!isChain)
SuccSU->NumPredsLeft--;
_______________________________________________
llvm-commits mailing list
llvm-commits@cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
