| Index: test/cctest/compiler/test-simplified-lowering.cc
|
| diff --git a/test/cctest/compiler/test-simplified-lowering.cc b/test/cctest/compiler/test-simplified-lowering.cc
|
| index bafa2d88f42ddc976cf9c4904c11895f612a9fa2..e4034369d9344f53437b367dc0346f24cb3ab152 100644
|
| --- a/test/cctest/compiler/test-simplified-lowering.cc
|
| +++ b/test/cctest/compiler/test-simplified-lowering.cc
|
| @@ -325,8 +325,8 @@ TEST(RunLoadElementFromUntaggedBase) {
|
| for (size_t i = 0; i < arraysize(smis); i++) { // for header sizes
|
| for (size_t j = 0; (i + j) < arraysize(smis); j++) { // for element index
|
| int offset = static_cast<int>(i * sizeof(Smi*));
|
| - ElementAccess access = {kUntaggedBase, offset, Type::Integral32(),
|
| - kMachAnyTagged};
|
| + ElementAccess access = {kNoBoundsCheck, kUntaggedBase, offset,
|
| + Type::Integral32(), kMachAnyTagged};
|
|
|
| SimplifiedLoweringTester<Object*> t;
|
| Node* load = t.LoadElement(
|
| @@ -354,8 +354,8 @@ TEST(RunStoreElementFromUntaggedBase) {
|
| for (size_t i = 0; i < arraysize(smis); i++) { // for header sizes
|
| for (size_t j = 0; (i + j) < arraysize(smis); j++) { // for element index
|
| int offset = static_cast<int>(i * sizeof(Smi*));
|
| - ElementAccess access = {kUntaggedBase, offset, Type::Integral32(),
|
| - kMachAnyTagged};
|
| + ElementAccess access = {kNoBoundsCheck, kUntaggedBase, offset,
|
| + Type::Integral32(), kMachAnyTagged};
|
|
|
| SimplifiedLoweringTester<Object*> t(kMachAnyTagged);
|
| Node* p0 = t.Parameter(0);
|
| @@ -517,9 +517,9 @@ class AccessTester : public HandleAndZoneScope {
|
|
|
| private:
|
| ElementAccess GetElementAccess() {
|
| - ElementAccess access = {tagged ? kTaggedBase : kUntaggedBase,
|
| - tagged ? FixedArrayBase::kHeaderSize : 0,
|
| - Type::Any(), rep};
|
| + ElementAccess access = {
|
| + kNoBoundsCheck, tagged ? kTaggedBase : kUntaggedBase,
|
| + tagged ? FixedArrayBase::kHeaderSize : 0, Type::Any(), rep};
|
| return access;
|
| }
|
|
|
| @@ -1349,8 +1349,9 @@ TEST(LowerLoadElement_to_load) {
|
| TestingGraph t(Type::Any(), Type::Signed32());
|
|
|
| for (size_t i = 0; i < arraysize(machine_reps); i++) {
|
| - ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize,
|
| - Type::Any(), machine_reps[i]};
|
| + ElementAccess access = {kNoBoundsCheck, kTaggedBase,
|
| + FixedArrayBase::kHeaderSize, Type::Any(),
|
| + machine_reps[i]};
|
|
|
| Node* load =
|
| t.graph()->NewNode(t.simplified()->LoadElement(access), t.p0, t.p1,
|
| @@ -1372,8 +1373,9 @@ TEST(LowerStoreElement_to_store) {
|
| TestingGraph t(Type::Any(), Type::Signed32());
|
|
|
| for (size_t i = 0; i < arraysize(machine_reps); i++) {
|
| - ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize,
|
| - Type::Any(), machine_reps[i]};
|
| + ElementAccess access = {kNoBoundsCheck, kTaggedBase,
|
| + FixedArrayBase::kHeaderSize, Type::Any(),
|
| + machine_reps[i]};
|
|
|
| Node* val = t.ExampleWithOutput(machine_reps[i]);
|
| Node* store = t.graph()->NewNode(t.simplified()->StoreElement(access), t.p0,
|
| @@ -1398,7 +1400,8 @@ TEST(InsertChangeForLoadElementIndex) {
|
| // LoadElement(obj: Tagged, index: kTypeInt32 | kRepTagged, length) =>
|
| // Load(obj, Int32Add(Int32Mul(ChangeTaggedToInt32(index), #k), #k))
|
| TestingGraph t(Type::Any(), Type::Signed32(), Type::Any());
|
| - ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, Type::Any(),
|
| + ElementAccess access = {kNoBoundsCheck, kTaggedBase,
|
| + FixedArrayBase::kHeaderSize, Type::Any(),
|
| kMachAnyTagged};
|
|
|
| Node* load = t.graph()->NewNode(t.simplified()->LoadElement(access), t.p0,
|
| @@ -1417,7 +1420,8 @@ TEST(InsertChangeForStoreElementIndex) {
|
| // StoreElement(obj: Tagged, index: kTypeInt32 | kRepTagged, length, val) =>
|
| // Store(obj, Int32Add(Int32Mul(ChangeTaggedToInt32(index), #k), #k), val)
|
| TestingGraph t(Type::Any(), Type::Signed32(), Type::Any());
|
| - ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, Type::Any(),
|
| + ElementAccess access = {kNoBoundsCheck, kTaggedBase,
|
| + FixedArrayBase::kHeaderSize, Type::Any(),
|
| kMachAnyTagged};
|
|
|
| Node* store =
|
| @@ -1436,7 +1440,8 @@ TEST(InsertChangeForStoreElementIndex) {
|
| TEST(InsertChangeForLoadElement) {
|
| // TODO(titzer): test all load/store representation change insertions.
|
| TestingGraph t(Type::Any(), Type::Signed32(), Type::Any());
|
| - ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, Type::Any(),
|
| + ElementAccess access = {kNoBoundsCheck, kTaggedBase,
|
| + FixedArrayBase::kHeaderSize, Type::Any(),
|
| kMachFloat64};
|
|
|
| Node* load = t.graph()->NewNode(t.simplified()->LoadElement(access), t.p0,
|
| @@ -1468,7 +1473,8 @@ TEST(InsertChangeForLoadField) {
|
| TEST(InsertChangeForStoreElement) {
|
| // TODO(titzer): test all load/store representation change insertions.
|
| TestingGraph t(Type::Any(), Type::Signed32(), Type::Any());
|
| - ElementAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, Type::Any(),
|
| + ElementAccess access = {kNoBoundsCheck, kTaggedBase,
|
| + FixedArrayBase::kHeaderSize, Type::Any(),
|
| kMachFloat64};
|
|
|
| Node* store = t.graph()->NewNode(t.simplified()->StoreElement(access), t.p0,
|
|
|