| 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 <limits> | 5 #include <limits> |
| 6 | 6 |
| 7 #include "src/ast/scopes.h" | 7 #include "src/ast/scopes.h" |
| 8 #include "src/compiler/access-builder.h" | 8 #include "src/compiler/access-builder.h" |
| 9 #include "src/compiler/change-lowering.h" | 9 #include "src/compiler/change-lowering.h" |
| 10 #include "src/compiler/control-builders.h" | 10 #include "src/compiler/control-builders.h" |
| (...skipping 1380 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1391 CheckElementAccessArithmetic(access, load); | 1391 CheckElementAccessArithmetic(access, load); |
| 1392 | 1392 |
| 1393 MachineType rep = LoadRepresentationOf(load->op()); | 1393 MachineType rep = LoadRepresentationOf(load->op()); |
| 1394 CHECK_EQ(kMachineReps[i], rep); | 1394 CHECK_EQ(kMachineReps[i], rep); |
| 1395 } | 1395 } |
| 1396 } | 1396 } |
| 1397 | 1397 |
| 1398 | 1398 |
| 1399 TEST(LowerStoreElement_to_store) { | 1399 TEST(LowerStoreElement_to_store) { |
| 1400 { | 1400 { |
| 1401 TestingGraph t(Type::Any(), Type::Signed32()); | 1401 for (size_t i = 0; i < arraysize(kMachineReps); i++) { |
| 1402 TestingGraph t(Type::Any(), Type::Signed32()); |
| 1402 | 1403 |
| 1403 for (size_t i = 0; i < arraysize(kMachineReps); i++) { | |
| 1404 ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, | 1404 ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, |
| 1405 Type::Any(), kMachineReps[i]}; | 1405 Type::Any(), kMachineReps[i]}; |
| 1406 | 1406 |
| 1407 Node* val = t.ExampleWithOutput(kMachineReps[i]); | 1407 Node* val = t.ExampleWithOutput(kMachineReps[i]); |
| 1408 Node* store = t.graph()->NewNode(t.simplified()->StoreElement(access), | 1408 Node* store = t.graph()->NewNode(t.simplified()->StoreElement(access), |
| 1409 t.p0, t.p1, val, t.start, t.start); | 1409 t.p0, t.p1, val, t.start, t.start); |
| 1410 t.Effect(store); | 1410 t.Effect(store); |
| 1411 t.LowerAllNodesAndLowerChanges(); | 1411 t.LowerAllNodesAndLowerChanges(); |
| 1412 CHECK_EQ(IrOpcode::kStore, store->opcode()); | 1412 CHECK_EQ(IrOpcode::kStore, store->opcode()); |
| 1413 CHECK_EQ(val, store->InputAt(2)); | 1413 CHECK_EQ(val, store->InputAt(2)); |
| (...skipping 525 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1939 t.Return(use); | 1939 t.Return(use); |
| 1940 t.Lower(); | 1940 t.Lower(); |
| 1941 | 1941 |
| 1942 CHECK_EQ(d.expected, PhiRepresentationOf(phi->op())); | 1942 CHECK_EQ(d.expected, PhiRepresentationOf(phi->op())); |
| 1943 } | 1943 } |
| 1944 } | 1944 } |
| 1945 | 1945 |
| 1946 } // namespace compiler | 1946 } // namespace compiler |
| 1947 } // namespace internal | 1947 } // namespace internal |
| 1948 } // namespace v8 | 1948 } // namespace v8 |
| OLD | NEW |