Index: runtime/vm/block_scheduler.cc |
diff --git a/runtime/vm/block_scheduler.cc b/runtime/vm/block_scheduler.cc |
index 7411fccecea25cfb5cd9162b573c7d6a35ec9f5b..7513f807d91bee7a51cb7063936d5793f264a68c 100644 |
--- a/runtime/vm/block_scheduler.cc |
+++ b/runtime/vm/block_scheduler.cc |
@@ -19,7 +19,6 @@ static intptr_t GetEdgeCount(const Array& edge_counters, intptr_t edge_id) { |
return Smi::Value(Smi::RawCast(edge_counters.At(edge_id))); |
} |
- |
// There is an edge from instruction->successor. Set its weight (edge count |
// per function entry). |
static void SetEdgeWeight(BlockEntryInstr* block, |
@@ -50,7 +49,6 @@ static void SetEdgeWeight(BlockEntryInstr* block, |
} |
} |
- |
void BlockScheduler::AssignEdgeWeights() const { |
if (!FLAG_reorder_basic_blocks) { |
return; |
@@ -87,7 +85,6 @@ void BlockScheduler::AssignEdgeWeights() const { |
} |
} |
- |
// A weighted control-flow graph edge. |
struct Edge { |
Edge(BlockEntryInstr* source, BlockEntryInstr* target, double weight) |
@@ -100,7 +97,6 @@ struct Edge { |
double weight; |
}; |
- |
// A linked list node in a chain of blocks. |
struct Link : public ZoneAllocated { |
Link(BlockEntryInstr* block, Link* next) : block(block), next(next) {} |
@@ -109,7 +105,6 @@ struct Link : public ZoneAllocated { |
Link* next; |
}; |
- |
// A chain of blocks with first and last pointers for fast concatenation and |
// a length to support adding a shorter chain's links to a longer chain. |
struct Chain : public ZoneAllocated { |
@@ -121,7 +116,6 @@ struct Chain : public ZoneAllocated { |
intptr_t length; |
}; |
- |
int Edge::LowestWeightFirst(const Edge* a, const Edge* b) { |
if (a->weight < b->weight) { |
return -1; |
@@ -129,7 +123,6 @@ int Edge::LowestWeightFirst(const Edge* a, const Edge* b) { |
return (a->weight > b->weight) ? 1 : 0; |
} |
- |
// Combine two chains by adding the shorter chain's links to the longer |
// chain. |
static void Union(GrowableArray<Chain*>* chains, |
@@ -154,7 +147,6 @@ static void Union(GrowableArray<Chain*>* chains, |
} |
} |
- |
void BlockScheduler::ReorderBlocks() const { |
// Add every block to a chain of length 1 and compute a list of edges |
// sorted by weight. |