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 60 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
71 | 71 |
72 // ----------------------------------------------------------------------------- | 72 // ----------------------------------------------------------------------------- |
73 // JSLoadProperty | 73 // JSLoadProperty |
74 | 74 |
75 | 75 |
76 TEST_F(JSTypedLoweringTest, JSLoadPropertyFromExternalTypedArray) { | 76 TEST_F(JSTypedLoweringTest, JSLoadPropertyFromExternalTypedArray) { |
77 const size_t kLength = 17; | 77 const size_t kLength = 17; |
78 uint8_t backing_store[kLength * 8]; | 78 uint8_t backing_store[kLength * 8]; |
79 Handle<JSArrayBuffer> buffer = | 79 Handle<JSArrayBuffer> buffer = |
80 NewArrayBuffer(backing_store, arraysize(backing_store)); | 80 NewArrayBuffer(backing_store, arraysize(backing_store)); |
| 81 VectorSlotPair feedback(Handle<TypeFeedbackVector>::null(), 0); |
81 TRACED_FOREACH(ExternalArrayType, type, kExternalArrayTypes) { | 82 TRACED_FOREACH(ExternalArrayType, type, kExternalArrayTypes) { |
82 Handle<JSTypedArray> array = | 83 Handle<JSTypedArray> array = |
83 factory()->NewJSTypedArray(type, buffer, kLength); | 84 factory()->NewJSTypedArray(type, buffer, kLength); |
84 | 85 |
85 Node* key = Parameter(Type::Integral32()); | 86 Node* key = Parameter(Type::Integral32()); |
86 Node* base = HeapConstant(array); | 87 Node* base = HeapConstant(array); |
87 Node* context = UndefinedConstant(); | 88 Node* context = UndefinedConstant(); |
88 Node* effect = graph()->start(); | 89 Node* effect = graph()->start(); |
89 Node* control = graph()->start(); | 90 Node* control = graph()->start(); |
90 Node* node = | 91 Node* node = graph()->NewNode(javascript()->LoadProperty(feedback), base, |
91 graph()->NewNode(javascript()->LoadProperty(), base, key, context); | 92 key, context); |
92 if (FLAG_turbo_deoptimization) { | 93 if (FLAG_turbo_deoptimization) { |
93 node->AppendInput(zone(), UndefinedConstant()); | 94 node->AppendInput(zone(), UndefinedConstant()); |
94 } | 95 } |
95 node->AppendInput(zone(), effect); | 96 node->AppendInput(zone(), effect); |
96 node->AppendInput(zone(), control); | 97 node->AppendInput(zone(), control); |
97 Reduction r = Reduce(node); | 98 Reduction r = Reduce(node); |
98 | 99 |
99 Capture<Node*> elements; | 100 Capture<Node*> elements; |
100 ASSERT_TRUE(r.Changed()); | 101 ASSERT_TRUE(r.Changed()); |
101 EXPECT_THAT( | 102 EXPECT_THAT( |
(...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
155 CaptureEq(&elements)), | 156 CaptureEq(&elements)), |
156 key, IsInt32Constant(static_cast<int>(kLength)), value, effect, | 157 key, IsInt32Constant(static_cast<int>(kLength)), value, effect, |
157 control)); | 158 control)); |
158 } | 159 } |
159 } | 160 } |
160 } | 161 } |
161 | 162 |
162 } // namespace compiler | 163 } // namespace compiler |
163 } // namespace internal | 164 } // namespace internal |
164 } // namespace v8 | 165 } // namespace v8 |
OLD | NEW |