OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_AST_LITERAL_REINDEXER | 5 #ifndef V8_AST_AST_LITERAL_REINDEXER |
6 #define V8_AST_LITERAL_REINDEXER | 6 #define V8_AST_AST_LITERAL_REINDEXER |
7 | 7 |
8 #include "src/ast.h" | 8 #include "src/ast/ast.h" |
9 #include "src/scopes.h" | 9 #include "src/ast/scopes.h" |
10 | 10 |
11 namespace v8 { | 11 namespace v8 { |
12 namespace internal { | 12 namespace internal { |
13 | 13 |
14 class AstLiteralReindexer final : public AstVisitor { | 14 class AstLiteralReindexer final : public AstVisitor { |
15 public: | 15 public: |
16 AstLiteralReindexer() : AstVisitor(), next_index_(0) {} | 16 AstLiteralReindexer() : AstVisitor(), next_index_(0) {} |
17 | 17 |
18 int count() const { return next_index_; } | 18 int count() const { return next_index_; } |
19 void Reindex(Expression* pattern); | 19 void Reindex(Expression* pattern); |
(...skipping 15 matching lines...) Expand all Loading... |
35 | 35 |
36 void Visit(AstNode* node) override { node->Accept(this); } | 36 void Visit(AstNode* node) override { node->Accept(this); } |
37 | 37 |
38 int next_index_; | 38 int next_index_; |
39 | 39 |
40 DISALLOW_COPY_AND_ASSIGN(AstLiteralReindexer); | 40 DISALLOW_COPY_AND_ASSIGN(AstLiteralReindexer); |
41 }; | 41 }; |
42 } // namespace internal | 42 } // namespace internal |
43 } // namespace v8 | 43 } // namespace v8 |
44 | 44 |
45 #endif // V8_AST_LITERAL_REINDEXER | 45 #endif // V8_AST_AST_LITERAL_REINDEXER |
OLD | NEW |