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 173 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
184 // Setting the Symbol.species property of any Array constructor invalidates | 184 // Setting the Symbol.species property of any Array constructor invalidates |
185 // the species protector | 185 // the species protector |
186 if (isolate_->IsInAnyContext(*holder_, Context::ARRAY_FUNCTION_INDEX)) { | 186 if (isolate_->IsInAnyContext(*holder_, Context::ARRAY_FUNCTION_INDEX)) { |
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()) { | |
195 if (!isolate_->IsHasInstanceLookupChainIntact()) return; | |
196 isolate_->InvalidateHasInstanceProtector(); | |
197 } else if (*name_ == heap()->iterator_symbol()) { | 194 } else if (*name_ == heap()->iterator_symbol()) { |
198 if (!isolate_->IsArrayIteratorLookupChainIntact()) return; | 195 if (!isolate_->IsArrayIteratorLookupChainIntact()) return; |
199 if (holder_->IsJSArray()) { | 196 if (holder_->IsJSArray()) { |
200 isolate_->InvalidateArrayIteratorProtector(); | 197 isolate_->InvalidateArrayIteratorProtector(); |
201 } | 198 } |
202 } | 199 } |
203 } | 200 } |
204 | 201 |
205 void LookupIterator::PrepareForDataProperty(Handle<Object> value) { | 202 void LookupIterator::PrepareForDataProperty(Handle<Object> value) { |
206 DCHECK(state_ == DATA || state_ == ACCESSOR); | 203 DCHECK(state_ == DATA || state_ == ACCESSOR); |
(...skipping 720 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
927 | 924 |
928 // We have found a cached property! Modify the iterator accordingly. | 925 // We have found a cached property! Modify the iterator accordingly. |
929 name_ = maybe_name.ToHandleChecked(); | 926 name_ = maybe_name.ToHandleChecked(); |
930 Restart(); | 927 Restart(); |
931 CHECK_EQ(state(), LookupIterator::DATA); | 928 CHECK_EQ(state(), LookupIterator::DATA); |
932 return true; | 929 return true; |
933 } | 930 } |
934 | 931 |
935 } // namespace internal | 932 } // namespace internal |
936 } // namespace v8 | 933 } // namespace v8 |
OLD | NEW |