Remove unused Module-related AST nodes and associated codegen

src/compiler/ast-loop-assignment-analyzer.cc

 // Copyright 2014 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/ast-loop-assignment-analyzer.h"
 #include "src/compiler.h"
 #include "src/parser.h"
 
 namespace v8 {
 namespace internal {
@@ skipping 37 matching lines @@
       std::pair<IterationStatement*, BitVector*>(loop, bits));
 }
 
 
 // ---------------------------------------------------------------------------
 // -- Leaf nodes -------------------------------------------------------------
 // ---------------------------------------------------------------------------
 
 void ALAA::VisitVariableDeclaration(VariableDeclaration* leaf) {}
 void ALAA::VisitFunctionDeclaration(FunctionDeclaration* leaf) {}
-void ALAA::VisitModuleDeclaration(ModuleDeclaration* leaf) {}
 void ALAA::VisitImportDeclaration(ImportDeclaration* leaf) {}
 void ALAA::VisitExportDeclaration(ExportDeclaration* leaf) {}
-void ALAA::VisitModulePath(ModulePath* leaf) {}
-void ALAA::VisitModuleUrl(ModuleUrl* leaf) {}
 void ALAA::VisitEmptyStatement(EmptyStatement* leaf) {}
 void ALAA::VisitContinueStatement(ContinueStatement* leaf) {}
 void ALAA::VisitBreakStatement(BreakStatement* leaf) {}
 void ALAA::VisitDebuggerStatement(DebuggerStatement* leaf) {}
 void ALAA::VisitFunctionLiteral(FunctionLiteral* leaf) {}
 void ALAA::VisitNativeFunctionLiteral(NativeFunctionLiteral* leaf) {}
 void ALAA::VisitVariableProxy(VariableProxy* leaf) {}
 void ALAA::VisitLiteral(Literal* leaf) {}
 void ALAA::VisitRegExpLiteral(RegExpLiteral* leaf) {}
 void ALAA::VisitThisFunction(ThisFunction* leaf) {}
 void ALAA::VisitSuperReference(SuperReference* leaf) {}
 
 
 // ---------------------------------------------------------------------------
 // -- Pass-through nodes------------------------------------------------------
 // ---------------------------------------------------------------------------
-void ALAA::VisitModuleLiteral(ModuleLiteral* e) { Visit(e->body()); }
-
-
 void ALAA::VisitBlock(Block* stmt) { VisitStatements(stmt->statements()); }
 
 
 void ALAA::VisitExpressionStatement(ExpressionStatement* stmt) {
   Visit(stmt->expression());
 }
 
 
 void ALAA::VisitIfStatement(IfStatement* stmt) {
   Visit(stmt->condition());
@@ skipping 108 matching lines @@
 
 void ALAA::VisitCaseClause(CaseClause* cc) {
   if (!cc->is_default()) Visit(cc->label());
   VisitStatements(cc->statements());
 }
 
 
 // ---------------------------------------------------------------------------
 // -- Interesting nodes-------------------------------------------------------
 // ---------------------------------------------------------------------------
-void ALAA::VisitModuleStatement(ModuleStatement* stmt) {
-  // TODO(turbofan): can a module appear in a loop?
-  Visit(stmt->body());
-}
-
-
 void ALAA::VisitTryCatchStatement(TryCatchStatement* stmt) {
   Visit(stmt->try_block());
   Visit(stmt->catch_block());
   // TODO(turbofan): are catch variables well-scoped?
   AnalyzeAssignment(stmt->variable());
 }
 
 
 void ALAA::VisitDoWhileStatement(DoWhileStatement* loop) {
   Enter(loop);
@@ skipping 74 matching lines @@
   int count = 0;
   int var_index = AstLoopAssignmentAnalyzer::GetVariableIndex(scope, var);
   for (size_t i = 0; i < list_.size(); i++) {
     if (list_[i].second->Contains(var_index)) count++;
   }
   return count;
 }
 }
 }
 }  // namespace v8::internal::compiler