Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 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_COMPILER_AST_GRAPH_BUILDER_H_ | 5 #ifndef V8_COMPILER_AST_GRAPH_BUILDER_H_ |
| 6 #define V8_COMPILER_AST_GRAPH_BUILDER_H_ | 6 #define V8_COMPILER_AST_GRAPH_BUILDER_H_ |
| 7 | 7 |
| 8 #include "src/ast/ast.h" | 8 #include "src/ast/ast.h" |
| 9 #include "src/compiler/js-graph.h" | 9 #include "src/compiler/js-graph.h" |
| 10 #include "src/compiler/liveness-analyzer.h" | 10 #include "src/compiler/liveness-analyzer.h" |
| (...skipping 400 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 411 void VisitCallSuper(Call* expr); | 411 void VisitCallSuper(Call* expr); |
| 412 | 412 |
| 413 // Dispatched from VisitCallRuntime. | 413 // Dispatched from VisitCallRuntime. |
| 414 void VisitCallJSRuntime(CallRuntime* expr); | 414 void VisitCallJSRuntime(CallRuntime* expr); |
| 415 | 415 |
| 416 // Dispatched from VisitUnaryOperation. | 416 // Dispatched from VisitUnaryOperation. |
| 417 void VisitDelete(UnaryOperation* expr); | 417 void VisitDelete(UnaryOperation* expr); |
| 418 void VisitVoid(UnaryOperation* expr); | 418 void VisitVoid(UnaryOperation* expr); |
| 419 void VisitTypeof(UnaryOperation* expr); | 419 void VisitTypeof(UnaryOperation* expr); |
| 420 void VisitNot(UnaryOperation* expr); | 420 void VisitNot(UnaryOperation* expr); |
| 421 void VisitTypeofExpression(Expression* expr); | |
|
Michael Starzinger
2016/03/09 09:26:14
nit: Can we separate out this last function from t
Jarin
2016/03/09 10:50:18
Done.
| |
| 421 | 422 |
| 422 // Dispatched from VisitBinaryOperation. | 423 // Dispatched from VisitBinaryOperation. |
| 423 void VisitComma(BinaryOperation* expr); | 424 void VisitComma(BinaryOperation* expr); |
| 424 void VisitLogicalExpression(BinaryOperation* expr); | 425 void VisitLogicalExpression(BinaryOperation* expr); |
| 425 void VisitArithmeticExpression(BinaryOperation* expr); | 426 void VisitArithmeticExpression(BinaryOperation* expr); |
| 426 | 427 |
| 428 // Dispatched from VisitCompareOperation. | |
| 429 void VisitLiteralCompareNil(CompareOperation* expr, Expression* sub_expr, | |
| 430 Node* nil_value); | |
| 431 void VisitLiteralCompareTypeof(CompareOperation* expr, Expression* sub_expr, | |
| 432 Handle<String> check); | |
| 433 | |
| 427 // Dispatched from VisitForInStatement. | 434 // Dispatched from VisitForInStatement. |
| 428 void VisitForInAssignment(Expression* expr, Node* value, | 435 void VisitForInAssignment(Expression* expr, Node* value, |
| 429 const VectorSlotPair& feedback, | 436 const VectorSlotPair& feedback, |
| 430 BailoutId bailout_id_before, | 437 BailoutId bailout_id_before, |
| 431 BailoutId bailout_id_after); | 438 BailoutId bailout_id_after); |
| 432 | 439 |
| 433 // Dispatched from VisitObjectLiteral. | 440 // Dispatched from VisitObjectLiteral. |
| 434 void VisitObjectLiteralAccessor(Node* home_object, | 441 void VisitObjectLiteralAccessor(Node* home_object, |
| 435 ObjectLiteralProperty* property); | 442 ObjectLiteralProperty* property); |
| 436 | 443 |
| (...skipping 147 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 584 | 591 |
| 585 // Prepare environment to be used as loop header. | 592 // Prepare environment to be used as loop header. |
| 586 void PrepareForLoop(BitVector* assigned, bool is_osr = false); | 593 void PrepareForLoop(BitVector* assigned, bool is_osr = false); |
| 587 }; | 594 }; |
| 588 | 595 |
| 589 } // namespace compiler | 596 } // namespace compiler |
| 590 } // namespace internal | 597 } // namespace internal |
| 591 } // namespace v8 | 598 } // namespace v8 |
| 592 | 599 |
| 593 #endif // V8_COMPILER_AST_GRAPH_BUILDER_H_ | 600 #endif // V8_COMPILER_AST_GRAPH_BUILDER_H_ |
| OLD | NEW |