| 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/lookup.h" | 5 #include "src/lookup.h" |
| 6 | 6 |
| 7 #include "src/bootstrapper.h" | 7 #include "src/bootstrapper.h" |
| 8 #include "src/deoptimizer.h" | 8 #include "src/deoptimizer.h" |
| 9 #include "src/elements.h" | 9 #include "src/elements.h" |
| 10 #include "src/field-type.h" | 10 #include "src/field-type.h" |
| (...skipping 176 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 187 isolate_->CountUsage( | 187 isolate_->CountUsage( |
| 188 v8::Isolate::UseCounterFeature::kArraySpeciesModified); | 188 v8::Isolate::UseCounterFeature::kArraySpeciesModified); |
| 189 isolate_->InvalidateArraySpeciesProtector(); | 189 isolate_->InvalidateArraySpeciesProtector(); |
| 190 } | 190 } |
| 191 } else if (*name_ == heap()->is_concat_spreadable_symbol()) { | 191 } else if (*name_ == heap()->is_concat_spreadable_symbol()) { |
| 192 if (!isolate_->IsIsConcatSpreadableLookupChainIntact()) return; | 192 if (!isolate_->IsIsConcatSpreadableLookupChainIntact()) return; |
| 193 isolate_->InvalidateIsConcatSpreadableProtector(); | 193 isolate_->InvalidateIsConcatSpreadableProtector(); |
| 194 } else if (*name_ == heap()->has_instance_symbol()) { | 194 } else if (*name_ == heap()->has_instance_symbol()) { |
| 195 if (!isolate_->IsHasInstanceLookupChainIntact()) return; | 195 if (!isolate_->IsHasInstanceLookupChainIntact()) return; |
| 196 isolate_->InvalidateHasInstanceProtector(); | 196 isolate_->InvalidateHasInstanceProtector(); |
| 197 } else if (*name_ == heap()->iterator_symbol()) { |
| 198 if (!isolate_->IsArrayIteratorLookupChainIntact()) return; |
| 199 if (holder_->IsJSArray()) { |
| 200 isolate_->InvalidateArrayIteratorProtector(); |
| 201 } |
| 197 } | 202 } |
| 198 } | 203 } |
| 199 | 204 |
| 200 void LookupIterator::PrepareForDataProperty(Handle<Object> value) { | 205 void LookupIterator::PrepareForDataProperty(Handle<Object> value) { |
| 201 DCHECK(state_ == DATA || state_ == ACCESSOR); | 206 DCHECK(state_ == DATA || state_ == ACCESSOR); |
| 202 DCHECK(HolderIsReceiverOrHiddenPrototype()); | 207 DCHECK(HolderIsReceiverOrHiddenPrototype()); |
| 203 | 208 |
| 204 Handle<JSObject> holder = GetHolder<JSObject>(); | 209 Handle<JSObject> holder = GetHolder<JSObject>(); |
| 205 | 210 |
| 206 if (IsElement()) { | 211 if (IsElement()) { |
| (...skipping 660 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 867 | 872 |
| 868 // We have found a cached property! Modify the iterator accordingly. | 873 // We have found a cached property! Modify the iterator accordingly. |
| 869 name_ = maybe_name.ToHandleChecked(); | 874 name_ = maybe_name.ToHandleChecked(); |
| 870 Restart(); | 875 Restart(); |
| 871 CHECK_EQ(state(), LookupIterator::DATA); | 876 CHECK_EQ(state(), LookupIterator::DATA); |
| 872 return true; | 877 return true; |
| 873 } | 878 } |
| 874 | 879 |
| 875 } // namespace internal | 880 } // namespace internal |
| 876 } // namespace v8 | 881 } // namespace v8 |
| OLD | NEW |