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 #include "src/compiler/js-inlining.h" | 5 #include "src/compiler/js-inlining.h" |
6 | 6 |
7 #include "src/ast/ast-numbering.h" | 7 #include "src/ast/ast-numbering.h" |
8 #include "src/ast/ast.h" | 8 #include "src/ast/ast.h" |
9 #include "src/compilation-info.h" | 9 #include "src/compilation-info.h" |
10 #include "src/compiler.h" | 10 #include "src/compiler.h" |
(...skipping 512 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
523 // If function was lazily compiled, its literals array may not yet be set up. | 523 // If function was lazily compiled, its literals array may not yet be set up. |
524 JSFunction::EnsureLiterals(function); | 524 JSFunction::EnsureLiterals(function); |
525 | 525 |
526 // Create the subgraph for the inlinee. | 526 // Create the subgraph for the inlinee. |
527 Node* start; | 527 Node* start; |
528 Node* end; | 528 Node* end; |
529 if (info.is_optimizing_from_bytecode()) { | 529 if (info.is_optimizing_from_bytecode()) { |
530 // Run the BytecodeGraphBuilder to create the subgraph. | 530 // Run the BytecodeGraphBuilder to create the subgraph. |
531 Graph::SubgraphScope scope(graph()); | 531 Graph::SubgraphScope scope(graph()); |
532 BytecodeGraphBuilder graph_builder(&zone, &info, jsgraph(), | 532 BytecodeGraphBuilder graph_builder(&zone, &info, jsgraph(), |
533 call.frequency()); | 533 call.frequency(), nullptr); |
534 graph_builder.CreateGraph(); | 534 graph_builder.CreateGraph(); |
535 | 535 |
536 // Extract the inlinee start/end nodes. | 536 // Extract the inlinee start/end nodes. |
537 start = graph()->start(); | 537 start = graph()->start(); |
538 end = graph()->end(); | 538 end = graph()->end(); |
539 } else { | 539 } else { |
540 // Run the loop assignment analyzer on the inlinee. | 540 // Run the loop assignment analyzer on the inlinee. |
541 AstLoopAssignmentAnalyzer loop_assignment_analyzer(&zone, &info); | 541 AstLoopAssignmentAnalyzer loop_assignment_analyzer(&zone, &info); |
542 LoopAssignmentAnalysis* loop_assignment = | 542 LoopAssignmentAnalysis* loop_assignment = |
543 loop_assignment_analyzer.Analyze(); | 543 loop_assignment_analyzer.Analyze(); |
(...skipping 147 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
691 | 691 |
692 CommonOperatorBuilder* JSInliner::common() const { return jsgraph()->common(); } | 692 CommonOperatorBuilder* JSInliner::common() const { return jsgraph()->common(); } |
693 | 693 |
694 SimplifiedOperatorBuilder* JSInliner::simplified() const { | 694 SimplifiedOperatorBuilder* JSInliner::simplified() const { |
695 return jsgraph()->simplified(); | 695 return jsgraph()->simplified(); |
696 } | 696 } |
697 | 697 |
698 } // namespace compiler | 698 } // namespace compiler |
699 } // namespace internal | 699 } // namespace internal |
700 } // namespace v8 | 700 } // namespace v8 |
OLD | NEW |