| 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/access-builder.h" | 5 #include "src/compiler/access-builder.h" |
| 6 #include "src/compiler/js-graph.h" | 6 #include "src/compiler/js-graph.h" |
| 7 #include "src/compiler/js-operator.h" | 7 #include "src/compiler/js-operator.h" |
| 8 #include "src/compiler/js-typed-lowering.h" | 8 #include "src/compiler/js-typed-lowering.h" |
| 9 #include "src/compiler/machine-operator.h" | 9 #include "src/compiler/machine-operator.h" |
| 10 #include "src/compiler/node-properties-inl.h" | 10 #include "src/compiler/node-properties-inl.h" |
| (...skipping 20 matching lines...) Expand all Loading... |
| 31 } // namespace | 31 } // namespace |
| 32 | 32 |
| 33 | 33 |
| 34 class JSTypedLoweringTest : public TypedGraphTest { | 34 class JSTypedLoweringTest : public TypedGraphTest { |
| 35 public: | 35 public: |
| 36 JSTypedLoweringTest() : TypedGraphTest(3), javascript_(zone()) {} | 36 JSTypedLoweringTest() : TypedGraphTest(3), javascript_(zone()) {} |
| 37 virtual ~JSTypedLoweringTest() {} | 37 virtual ~JSTypedLoweringTest() {} |
| 38 | 38 |
| 39 protected: | 39 protected: |
| 40 Reduction Reduce(Node* node) { | 40 Reduction Reduce(Node* node) { |
| 41 MachineOperatorBuilder machine; | 41 MachineOperatorBuilder machine(zone()); |
| 42 JSGraph jsgraph(graph(), common(), javascript(), &machine); | 42 JSGraph jsgraph(graph(), common(), javascript(), &machine); |
| 43 JSTypedLowering reducer(&jsgraph); | 43 JSTypedLowering reducer(&jsgraph); |
| 44 return reducer.Reduce(node); | 44 return reducer.Reduce(node); |
| 45 } | 45 } |
| 46 | 46 |
| 47 Node* Parameter(Type* type, int index = 0) { | 47 Node* Parameter(Type* type, int index = 0) { |
| 48 Node* node = graph()->NewNode(common()->Parameter(index), graph()->start()); | 48 Node* node = graph()->NewNode(common()->Parameter(index), graph()->start()); |
| 49 NodeProperties::SetBounds(node, Bounds(Type::None(), type)); | 49 NodeProperties::SetBounds(node, Bounds(Type::None(), type)); |
| 50 return node; | 50 return node; |
| 51 } | 51 } |
| (...skipping 131 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 183 IsIntPtrConstant(bit_cast<intptr_t>(&backing_store[0])), | 183 IsIntPtrConstant(bit_cast<intptr_t>(&backing_store[0])), |
| 184 key, IsNumberConstant(array->length()->Number()), value, | 184 key, IsNumberConstant(array->length()->Number()), value, |
| 185 effect, control)); | 185 effect, control)); |
| 186 } | 186 } |
| 187 } | 187 } |
| 188 } | 188 } |
| 189 | 189 |
| 190 } // namespace compiler | 190 } // namespace compiler |
| 191 } // namespace internal | 191 } // namespace internal |
| 192 } // namespace v8 | 192 } // namespace v8 |
| OLD | NEW |