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/basic-block-instrumentor.h" | 5 #include "src/compiler/basic-block-instrumentor.h" |
6 | 6 |
7 #include <sstream> | 7 #include <sstream> |
8 | 8 |
9 #include "src/compiler.h" | 9 #include "src/compiler.h" |
10 #include "src/compiler/common-operator.h" | 10 #include "src/compiler/common-operator.h" |
11 #include "src/compiler/graph.h" | 11 #include "src/compiler/graph.h" |
12 #include "src/compiler/machine-operator.h" | 12 #include "src/compiler/machine-operator.h" |
13 #include "src/compiler/node.h" | 13 #include "src/compiler/node.h" |
14 #include "src/compiler/operator-properties.h" | 14 #include "src/compiler/operator-properties.h" |
15 #include "src/compiler/schedule.h" | 15 #include "src/compiler/schedule.h" |
| 16 #include "src/objects-inl.h" |
16 | 17 |
17 namespace v8 { | 18 namespace v8 { |
18 namespace internal { | 19 namespace internal { |
19 namespace compiler { | 20 namespace compiler { |
20 | 21 |
21 // Find the first place to insert new nodes in a block that's already been | 22 // Find the first place to insert new nodes in a block that's already been |
22 // scheduled that won't upset the register allocator. | 23 // scheduled that won't upset the register allocator. |
23 static NodeVector::iterator FindInsertionPoint(BasicBlock* block) { | 24 static NodeVector::iterator FindInsertionPoint(BasicBlock* block) { |
24 NodeVector::iterator i = block->begin(); | 25 NodeVector::iterator i = block->begin(); |
25 for (; i != block->end(); ++i) { | 26 for (; i != block->end(); ++i) { |
(...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
99 for (int i = insertion_start; i < kArraySize; ++i) { | 100 for (int i = insertion_start; i < kArraySize; ++i) { |
100 schedule->SetBlockForNode(block, to_insert[i]); | 101 schedule->SetBlockForNode(block, to_insert[i]); |
101 } | 102 } |
102 } | 103 } |
103 return data; | 104 return data; |
104 } | 105 } |
105 | 106 |
106 } // namespace compiler | 107 } // namespace compiler |
107 } // namespace internal | 108 } // namespace internal |
108 } // namespace v8 | 109 } // namespace v8 |
OLD | NEW |