| 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/bit-vector.h" | 5 #include "src/bit-vector.h" |
| 6 #include "src/compiler/escape-analysis.h" | 6 #include "src/compiler/escape-analysis.h" |
| 7 #include "src/compiler/escape-analysis-reducer.h" | 7 #include "src/compiler/escape-analysis-reducer.h" |
| 8 #include "src/compiler/graph-visualizer.h" | 8 #include "src/compiler/graph-visualizer.h" |
| 9 #include "src/compiler/js-graph.h" | 9 #include "src/compiler/js-graph.h" |
| 10 #include "src/compiler/node-properties.h" | 10 #include "src/compiler/node-properties.h" |
| (...skipping 128 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 139 return control_ = graph()->NewNode(common()->IfTrue(), control_); | 139 return control_ = graph()->NewNode(common()->IfTrue(), control_); |
| 140 } | 140 } |
| 141 | 141 |
| 142 Node* IfFalse() { return graph()->NewNode(common()->IfFalse(), control_); } | 142 Node* IfFalse() { return graph()->NewNode(common()->IfFalse(), control_); } |
| 143 | 143 |
| 144 Node* Merge2(Node* control1, Node* control2) { | 144 Node* Merge2(Node* control1, Node* control2) { |
| 145 return control_ = graph()->NewNode(common()->Merge(2), control1, control2); | 145 return control_ = graph()->NewNode(common()->Merge(2), control1, control2); |
| 146 } | 146 } |
| 147 | 147 |
| 148 FieldAccess FieldAccessAtIndex(int offset) { | 148 FieldAccess FieldAccessAtIndex(int offset) { |
| 149 FieldAccess access = {kTaggedBase, offset, MaybeHandle<Name>(), Type::Any(), | 149 FieldAccess access = {kTaggedBase, |
| 150 MachineType::AnyTagged()}; | 150 offset, |
| 151 MaybeHandle<Name>(), |
| 152 Type::Any(), |
| 153 MachineType::AnyTagged(), |
| 154 kFullWriteBarrier}; |
| 151 return access; | 155 return access; |
| 152 } | 156 } |
| 153 | 157 |
| 154 ElementAccess MakeElementAccess(int header_size) { | 158 ElementAccess MakeElementAccess(int header_size) { |
| 155 ElementAccess access = {kTaggedBase, header_size, Type::Any(), | 159 ElementAccess access = {kTaggedBase, header_size, Type::Any(), |
| 156 MachineType::AnyTagged()}; | 160 MachineType::AnyTagged(), kFullWriteBarrier}; |
| 157 return access; | 161 return access; |
| 158 } | 162 } |
| 159 | 163 |
| 160 // ---------------------------------Assertion Helper-------------------------- | 164 // ---------------------------------Assertion Helper-------------------------- |
| 161 | 165 |
| 162 void ExpectReplacement(Node* node, Node* rep) { | 166 void ExpectReplacement(Node* node, Node* rep) { |
| 163 EXPECT_EQ(rep, escape_analysis()->GetReplacement(node)); | 167 EXPECT_EQ(rep, escape_analysis()->GetReplacement(node)); |
| 164 } | 168 } |
| 165 | 169 |
| 166 void ExpectReplacementPhi(Node* node, Node* left, Node* right) { | 170 void ExpectReplacementPhi(Node* node, Node* left, Node* right) { |
| (...skipping 336 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 503 ASSERT_EQ(object1, NodeProperties::GetValueInput(object_state, 0)); | 507 ASSERT_EQ(object1, NodeProperties::GetValueInput(object_state, 0)); |
| 504 ASSERT_EQ(object_state, NodeProperties::GetValueInput(object_state, 1)); | 508 ASSERT_EQ(object_state, NodeProperties::GetValueInput(object_state, 1)); |
| 505 | 509 |
| 506 Node* object_state2 = NodeProperties::GetValueInput(state_values1, 0); | 510 Node* object_state2 = NodeProperties::GetValueInput(state_values1, 0); |
| 507 ASSERT_EQ(object_state, object_state2); | 511 ASSERT_EQ(object_state, object_state2); |
| 508 } | 512 } |
| 509 | 513 |
| 510 } // namespace compiler | 514 } // namespace compiler |
| 511 } // namespace internal | 515 } // namespace internal |
| 512 } // namespace v8 | 516 } // namespace v8 |
| OLD | NEW |