| Index: src/compiler/schedule.h
|
| diff --git a/src/compiler/schedule.h b/src/compiler/schedule.h
|
| index d940e541db8f747abbe7cc86c9fdc61bbbfa1690..027a01dd4af03a9d46bdff6f52bed68672f5a1f5 100644
|
| --- a/src/compiler/schedule.h
|
| +++ b/src/compiler/schedule.h
|
| @@ -26,7 +26,7 @@ typedef ZoneVector<Node*> NodeVector;
|
| // A basic block contains an ordered list of nodes and ends with a control
|
| // node. Note that if a basic block has phis, then all phis must appear as the
|
| // first nodes in the block.
|
| -class BasicBlock FINAL : public ZoneObject {
|
| +class BasicBlock final : public ZoneObject {
|
| public:
|
| // Possible control nodes that can end a block.
|
| enum Control {
|
| @@ -176,7 +176,7 @@ std::ostream& operator<<(std::ostream&, const BasicBlock::Id&);
|
| // and ordering them within basic blocks. Prior to computing a schedule,
|
| // a graph has no notion of control flow ordering other than that induced
|
| // by the graph's dependencies. A schedule is required to generate code.
|
| -class Schedule FINAL : public ZoneObject {
|
| +class Schedule final : public ZoneObject {
|
| public:
|
| explicit Schedule(Zone* zone, size_t node_count_hint = 0);
|
|
|
|
|