Lines Matching defs:that
3 // Use of this source code is governed by a BSD-style license that can be
33 // the special Oddball ones that have no wrapper counterparts (i.e. Null,
267 bool PropertyAccessInfo::Merge(PropertyAccessInfo const* that,
269 if (kind_ != that->kind_) return false;
270 if (!OptionalRefEquals(holder_, that->holder_)) return false;
274 DCHECK_EQ(that->kind_, kInvalid);
281 // since that way we only compare the relevant bits of the
284 that->field_index_.GetFieldAccessStubKey()) {
291 if (!field_representation_.Equals(that->field_representation_)) {
293 that->field_representation_.IsDouble()) {
298 if (!OptionalRefEquals(field_map_, that->field_map_)) {
308 // also need to make sure that in case of transitioning stores,
310 if (!OptionalRefEquals(field_map_, that->field_map_) ||
311 !field_representation_.Equals(that->field_representation_) ||
312 !OptionalRefEquals(transition_map_, that->transition_map_)) {
319 field_type_ = Type::Union(field_type_, that->field_type_, zone);
320 AppendVector(&lookup_start_object_maps_, that->lookup_start_object_maps_);
321 AppendVector(&unrecorded_dependencies_, that->unrecorded_dependencies_);
328 if (!OptionalRefEquals(constant_, that->constant_)) return false;
331 DCHECK(that->unrecorded_dependencies_.empty());
332 AppendVector(&lookup_start_object_maps_, that->lookup_start_object_maps_);
338 if (dictionary_index_ != that->dictionary_index_) return false;
339 AppendVector(&lookup_start_object_maps_, that->lookup_start_object_maps_);
346 DCHECK(that->unrecorded_dependencies_.empty());
347 AppendVector(&lookup_start_object_maps_, that->lookup_start_object_maps_);
802 // mode prototype earlier on the chain. Note that seeing a fast mode
806 // V8_DICT_PROPERTY_CONST_TRACKING will guarantee that all prototypes
844 // string contents from background threads. Should that become possible
880 // Load the map's prototype's map to guarantee that every time we use it,
923 // Successful lookup on prototype chain needs to guarantee that all the
929 // that moves the responsibility of taking the dependency into