Lines Matching refs:IsTheHole
795 if (!result->IsTheHole()) return result; in GetElementWithReceiver()
1459 } else if (IsTheHole()) { in HeapObjectShortPrint()
1819 int argc = name.is_null() ? 2 : old_value->IsTheHole() ? 3 : 4; in EnqueueChangeRecord()
3803 DCHECK(!value->IsTheHole()); in SetOwnPropertyIgnoreAttributes()
4438 if (!value->IsTheHole()) { in CopyFastElementsToDictionary()
5024 if (!element->IsTheHole() && element == object) return true; in ReferencesObjectFromElements()
5089 if (!value->IsTheHole() && value == obj) return true; in ReferencesObject()
5509 value->IsTheHole() || in StructureWalk()
5966 if (probe == NULL || probe->IsTheHole()) { in DefineElementAccessor()
6881 if (!current->IsTheHole()) { in TransitionToAccessorProperty()
7903 return accessor->IsTheHole() ? GetHeap()->undefined_value() : accessor; in GetComponent()
11225 if (old_values[i]->IsTheHole()) continue; in SetElementsLength()
11850 DCHECK(!value->IsTheHole()); in SetElementWithCallback()
11952 (index >= capacity || backing_store->get(index)->IsTheHole())) { in SetFastElement()
12087 } else if (details.IsReadOnly() && !element->IsTheHole()) { in SetDictionaryElement()
12104 DCHECK(!context->get(context_index)->IsTheHole()); in SetDictionaryElement()
12431 } else if (old_value->IsTheHole()) { in SetElement()
12516 if (!probe.is_null() && !probe->IsTheHole()) { in SetElementWithoutInterceptor()
12519 DCHECK(!context->get(context_index)->IsTheHole()); in SetElementWithoutInterceptor()
12846 if (!result->IsTheHole()) return result; in GetElementWithInterceptor()
12895 if (!backing_store->get(i)->IsTheHole()) ++(*used); in GetElementsCapacityAndUsage()
13408 if (!FixedArray::cast(elements())->get(i)->IsTheHole()) { in GetOwnElementKeys()
13477 if (!parameter_map->get(i + 2)->IsTheHole()) { in GetOwnElementKeys()
13488 if (!parameter_map->get(i + 2)->IsTheHole()) { in GetOwnElementKeys()
13491 } else if (i < backing_length && !arguments->get(i)->IsTheHole()) { in GetOwnElementKeys()
13783 !element->IsTheHole() && in FindEntry()
13790 DCHECK(element->IsTheHole() || !Name::cast(element)->Equals(*key)); in FindEntry()
13974 if (element->IsUndefined() || element->IsTheHole()) break; in FindInsertionEntry()
14312 if (current->IsTheHole()) { in PrepareElementsForSort()
14323 if (current->IsTheHole()) { in PrepareElementsForSort()
15279 DCHECK(!value->IsTheHole()); in Put()
15488 if (key->IsTheHole()) { in Rehash()
15522 DCHECK(!key->IsTheHole()); in FindEntry()
15664 DCHECK(!key->IsTheHole()); in Put()
15728 while (index < used_capacity && table->KeyAt(index)->IsTheHole()) { in HasMore()