Move the AstVisitor stack check from Accept to Visit.

src/flow-graph.cc

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 415 matching lines @@
 }
 
 
 void FlowGraphBuilder::VisitThisFunction(ThisFunction* expr) {
   SetStackOverflow();
 }
 
 
 #ifdef DEBUG
 
-// Print a textual representation of an instruction in a flow graph.  Using
-// the AstVisitor is overkill because there is no recursion here.  It is
-// however only used for printing in debug mode.
+// Print a textual representation of an instruction in a flow graph.
 class InstructionPrinter: public AstVisitor {
  public:
   InstructionPrinter() {}
 
  private:
   // Overridden from the base class.
   virtual void VisitExpressions(ZoneList<Expression*>* exprs);
 
   // AST node visit functions.
 #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
@@ skipping 138 matching lines @@
   UNREACHABLE();
 }
 
 
 void InstructionPrinter::VisitVariableProxy(VariableProxy* expr) {
   Variable* var = expr->AsVariable();
   if (var != NULL) {
     PrintF("%s", *var->name()->ToCString());
   } else {
     ASSERT(expr->AsProperty() != NULL);
-    VisitProperty(expr->AsProperty());
+    Visit(expr->AsProperty());
   }
 }
 
 
 void InstructionPrinter::VisitLiteral(Literal* expr) {
   expr->handle()->Print();
 }
 
 
 void InstructionPrinter::VisitRegExpLiteral(RegExpLiteral* expr) {
@@ skipping 111 matching lines @@
   if (HasPredecessor()) {
     PrintF("L%d:", number());
   }
 
   // Number and print the instructions.  Since AST child nodes are visited
   // before their parents, the parent nodes can refer to them by number.
   InstructionPrinter printer;
   for (int i = 0; i < instructions_.length(); ++i) {
     PrintF("\n%d ", instruction_number);
     instructions_[i]->set_num(instruction_number++);
-    printer.Visit(instructions_[i]);
+    instructions_[i]->Accept(&printer);
   }
 
   // If this is the exit, print "exit".  If there is a single successor,
   // print "goto" successor on a separate line.  If there are two
   // successors, print "goto" successor on the same line as the last
   // instruction in the block.  There is a blank line between blocks (and
   // after the last one).
   if (left_successor_ == NULL) {
     PrintF("\nexit\n\n");
   } else if (right_successor_ == NULL) {
@@ skipping 16 matching lines @@
   int number = 0;
   for (int i = postorder_.length() - 1; i >= 0; --i) {
     number = postorder_[i]->PrintAsText(number);
   }
 }
 
 #endif  // DEBUG
 
 
 } }  // namespace v8::internal