Thread decls-list through Declaration

src/ast/ast-traversal-visitor.h

 // Copyright 2016 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.
 
 #ifndef V8_AST_AST_TRAVERSAL_VISITOR_H_
 #define V8_AST_AST_TRAVERSAL_VISITOR_H_
 
 #include "src/ast/ast.h"
 #include "src/ast/scopes.h"
 
@@ skipping 22 matching lines @@
 
   void Run() {
     DCHECK_NOT_NULL(root_);
     Visit(root_);
   }
 
   bool VisitNode(AstNode* node) { return true; }
   bool VisitExpression(Expression* node) { return true; }
 
   // Iteration left-to-right.
-  void VisitDeclarations(ZoneList<Declaration*>* declarations);
+  void VisitDeclarations(Declaration::List* declarations);
   void VisitStatements(ZoneList<Statement*>* statements);
 
 // Individual nodes
 #define DECLARE_VISIT(type) void Visit##type(type* node);
   AST_NODE_LIST(DECLARE_VISIT)
 #undef DECLARE_VISIT
 
  protected:
   int depth() const { return depth_; }
 
@@ skipping 43 matching lines @@
 
 template <class Subclass>
 AstTraversalVisitor<Subclass>::AstTraversalVisitor(uintptr_t stack_limit,
                                                    AstNode* root)
     : root_(root), depth_(0) {
   InitializeAstVisitor(stack_limit);
 }
 
 template <class Subclass>
 void AstTraversalVisitor<Subclass>::VisitDeclarations(
-    ZoneList<Declaration*>* decls) {
-  for (int i = 0; i < decls->length(); ++i) {
-    Declaration* decl = decls->at(i);
+    Declaration::List* decls) {
+  for (Declaration* decl : *decls) {
     RECURSE(Visit(decl));
   }
 }
 
 template <class Subclass>
 void AstTraversalVisitor<Subclass>::VisitStatements(
     ZoneList<Statement*>* stmts) {
   for (int i = 0; i < stmts->length(); ++i) {
     Statement* stmt = stmts->at(i);
     RECURSE(Visit(stmt));
@@ skipping 377 matching lines @@
 
 #undef PROCESS_NODE
 #undef PROCESS_EXPRESSION
 #undef RECURSE_EXPRESSION
 #undef RECURSE
 
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_AST_AST_TRAVERSAL_VISITOR_H_