| 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 #include "src/v8.h" | 5 #include "src/v8.h" |
| 6 | 6 |
| 7 #include "src/ast-expression-visitor.h" | 7 #include "src/ast/ast-expression-visitor.h" |
| 8 | 8 |
| 9 #include "src/ast.h" | 9 #include "src/ast/ast.h" |
| 10 #include "src/ast/scopes.h" |
| 10 #include "src/codegen.h" | 11 #include "src/codegen.h" |
| 11 #include "src/scopes.h" | |
| 12 | 12 |
| 13 namespace v8 { | 13 namespace v8 { |
| 14 namespace internal { | 14 namespace internal { |
| 15 | 15 |
| 16 | 16 |
| 17 #define RECURSE(call) \ | 17 #define RECURSE(call) \ |
| 18 do { \ | 18 do { \ |
| 19 DCHECK(!HasStackOverflow()); \ | 19 DCHECK(!HasStackOverflow()); \ |
| 20 call; \ | 20 call; \ |
| 21 if (HasStackOverflow()) return; \ | 21 if (HasStackOverflow()) return; \ |
| (...skipping 367 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 389 void AstExpressionVisitor::VisitSuperCallReference(SuperCallReference* expr) { | 389 void AstExpressionVisitor::VisitSuperCallReference(SuperCallReference* expr) { |
| 390 VisitExpression(expr); | 390 VisitExpression(expr); |
| 391 RECURSE_EXPRESSION(VisitVariableProxy(expr->this_var())); | 391 RECURSE_EXPRESSION(VisitVariableProxy(expr->this_var())); |
| 392 RECURSE_EXPRESSION(VisitVariableProxy(expr->new_target_var())); | 392 RECURSE_EXPRESSION(VisitVariableProxy(expr->new_target_var())); |
| 393 RECURSE_EXPRESSION(VisitVariableProxy(expr->this_function_var())); | 393 RECURSE_EXPRESSION(VisitVariableProxy(expr->this_function_var())); |
| 394 } | 394 } |
| 395 | 395 |
| 396 | 396 |
| 397 } // namespace internal | 397 } // namespace internal |
| 398 } // namespace v8 | 398 } // namespace v8 |
| OLD | NEW |