Replace OStream with std::ostream.

src/compiler/schedule.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/node.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/compiler/schedule.h"
 #include "src/ostreams.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
-
 BasicBlock::BasicBlock(Zone* zone, Id id)
     : rpo_number_(-1),
       dominator_(NULL),
       loop_header_(NULL),
       loop_depth_(0),
       loop_end_(-1),
       code_start_(-1),
       code_end_(-1),
       deferred_(false),
       control_(kNone),
@@ skipping 77 matching lines @@
 size_t BasicBlock::PredecessorIndexOf(BasicBlock* predecessor) {
   size_t j = 0;
   for (BasicBlock::Predecessors::iterator i = predecessors_.begin();
        i != predecessors_.end(); ++i, ++j) {
     if (*i == predecessor) break;
   }
   return j;
 }
 
 
-OStream& operator<<(OStream& os, const BasicBlock::Control& c) {
+std::ostream& operator<<(std::ostream& os, const BasicBlock::Control& c) {
   switch (c) {
     case BasicBlock::kNone:
       return os << "none";
     case BasicBlock::kGoto:
       return os << "goto";
     case BasicBlock::kBranch:
       return os << "branch";
     case BasicBlock::kReturn:
       return os << "return";
     case BasicBlock::kThrow:
       return os << "throw";
   }
   UNREACHABLE();
   return os;
 }
 
 
-OStream& operator<<(OStream& os, const BasicBlock::Id& id) {
+std::ostream& operator<<(std::ostream& os, const BasicBlock::Id& id) {
   return os << id.ToSize();
 }
 
 
 Schedule::Schedule(Zone* zone, size_t node_count_hint)
     : zone_(zone),
       all_blocks_(zone),
       nodeid_to_block_(zone),
       rpo_order_(zone),
       start_(NewBasicBlock()),
@@ skipping 118 matching lines @@
 
 void Schedule::SetBlockForNode(BasicBlock* block, Node* node) {
   int length = static_cast<int>(nodeid_to_block_.size());
   if (node->id() >= length) {
     nodeid_to_block_.resize(node->id() + 1);
   }
   nodeid_to_block_[node->id()] = block;
 }
 
 
-OStream& operator<<(OStream& os, const Schedule& s) {
+std::ostream& operator<<(std::ostream& os, const Schedule& s) {
   // TODO(svenpanne) Const-correct the RPO stuff/iterators.
   BasicBlockVector* rpo = const_cast<Schedule*>(&s)->rpo_order();
   for (BasicBlockVectorIter i = rpo->begin(); i != rpo->end(); ++i) {
     BasicBlock* block = *i;
     os << "--- BLOCK B" << block->id();
     if (block->PredecessorCount() != 0) os << " <- ";
     bool comma = false;
     for (BasicBlock::Predecessors::iterator j = block->predecessors_begin();
          j != block->predecessors_end(); ++j) {
       if (comma) os << ", ";
@@ skipping 30 matching lines @@
            j != block->successors_end(); ++j) {
         if (comma) os << ", ";
         comma = true;
         os << "B" << (*j)->id();
       }
       os << "\n";
     }
   }
   return os;
 }
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8