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 28 matching lines...) Expand all Loading... |
39 | 39 |
40 class JSTypedLoweringTest : public TypedGraphTest { | 40 class JSTypedLoweringTest : public TypedGraphTest { |
41 public: | 41 public: |
42 JSTypedLoweringTest() : TypedGraphTest(3), javascript_(zone()) {} | 42 JSTypedLoweringTest() : TypedGraphTest(3), javascript_(zone()) {} |
43 virtual ~JSTypedLoweringTest() {} | 43 virtual ~JSTypedLoweringTest() {} |
44 | 44 |
45 protected: | 45 protected: |
46 Reduction Reduce(Node* node) { | 46 Reduction Reduce(Node* node) { |
47 MachineOperatorBuilder machine(zone()); | 47 MachineOperatorBuilder machine(zone()); |
48 JSGraph jsgraph(graph(), common(), javascript(), &machine); | 48 JSGraph jsgraph(graph(), common(), javascript(), &machine); |
49 JSTypedLowering reducer(&jsgraph); | 49 JSTypedLowering reducer(&jsgraph, zone()); |
50 return reducer.Reduce(node); | 50 return reducer.Reduce(node); |
51 } | 51 } |
52 | 52 |
53 Node* Parameter(Type* type, int index = 0) { | 53 Node* Parameter(Type* type, int index = 0) { |
54 Node* node = graph()->NewNode(common()->Parameter(index), graph()->start()); | 54 Node* node = graph()->NewNode(common()->Parameter(index), graph()->start()); |
55 NodeProperties::SetBounds(node, Bounds(Type::None(), type)); | 55 NodeProperties::SetBounds(node, Bounds(Type::None(), type)); |
56 return node; | 56 return node; |
57 } | 57 } |
58 | 58 |
59 Handle<JSArrayBuffer> NewArrayBuffer(void* bytes, size_t byte_length) { | 59 Handle<JSArrayBuffer> NewArrayBuffer(void* bytes, size_t byte_length) { |
(...skipping 572 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
632 IsStoreElement( | 632 IsStoreElement( |
633 access, IsIntPtrConstant(bit_cast<intptr_t>(&backing_store[0])), | 633 access, IsIntPtrConstant(bit_cast<intptr_t>(&backing_store[0])), |
634 key, value, effect, control)); | 634 key, value, effect, control)); |
635 } | 635 } |
636 } | 636 } |
637 } | 637 } |
638 | 638 |
639 } // namespace compiler | 639 } // namespace compiler |
640 } // namespace internal | 640 } // namespace internal |
641 } // namespace v8 | 641 } // namespace v8 |
OLD | NEW |