Lines Matching defs:Is
2 // Use of this source code is governed by a BSD-style license that can be
8 // but it is absolutely needed to make sure gcc generates optimal
9 // code. gcc is not happy when attempting to inline too deep.
47 // Ensure the upper 2 bits have the same value by sign extending it. This is
62 bool HeapObject::Is##type() const { \
68 SLOW_DCHECK(object->Is##type()); \
72 SLOW_DCHECK(object->Is##type()); \
143 // External objects are not extensible, so the map check is enough.
155 bool HeapObject::Is##Type() const { return map() == GetHeap()->type##_map(); }
160 bool Object::Is##type_() const { \
161 return IsHeapObject() && HeapObject::cast(this)->Is##type_(); \
167 bool Object::Is##Type(Isolate* isolate) const { \
170 bool HeapObject::Is##Type(Isolate* isolate) const { \
259 // Dictionary is covered under FixedArray.
533 DCHECK(result != 0); // Ensure that the hash value of 0 is never computed.
575 DCHECK(result != 0); // Ensure that the hash value of 0 is never computed.
621 DCHECK(result != 0); // Ensure that the hash value of 0 is never computed.
717 // a deoptimization data array. Since this is used for asserts we can
718 // check that the length is zero or else the fixed size plus a multiple of
730 // a deoptimization data array. Since this is used for asserts we can check
731 // that the length is plausible though.
778 template <> inline bool Is<JSFunction>(Object* obj) {
827 template <> inline bool Is<JSArray>(Object* obj) {
943 bool Object::Is##Name() const { \
944 return IsHeapObject() && HeapObject::cast(this)->Is##Name(); \
946 bool HeapObject::Is##Name() const { \
1420 // to be consistent with what the CompareICStub does, and what is tested in
1424 if (this->Is##Type()) { \
1425 if (!that->Is##Type()) return false; \
1605 // If transition_info is a smi, then it represents an ElementsKind
1613 // elements kind is the initial elements kind.
1974 // Either the garbage collector is clearing the cell or we are simply
2104 // properties are at the end of the object. Therefore there is no need
2113 // properties are at the end of the object. Therefore there is no need
2124 // properties are at the end of the object. Therefore there is no need
2145 // is needed to correctly distinguish between properties stored in-object and
2697 // Perform a linear search in this fixed array. len is the number of entry
3088 // EnsureCapacity will guarantee the hash table is never full.
3093 // Empty entry. Uses raw unchecked accessors because it is called by the
3618 // wrapping string is already flattened.
4039 // Parameter count is stored as the size on stack of the parameters to allow
4055 // Parameter count is stored as the size on stack of the parameters to allow
4713 // Code caches are always fixed arrays. The empty fixed array is used as a
5178 // sweep. reinterpret_cast is therefore used instead of the more appropriate
5179 // Code::cast. Code::cast does not work when the object's map is
5927 // If the GC metadata field is already used then the function was
6124 // We reenable optimization whenever the number of tries is a large
6308 // When there is no initial map and the prototype is a JSObject, the
6309 // initial map field is used for the prototype field.
6317 // value, that value is stored in the constructor field of the map.
7556 DCHECK(entry >= 0); // Not found is -1, which is not caught by get().
7567 DCHECK(entry >= 0); // Not found is -1, which is not caught by get().
7675 // No write barrier is needed since empty_fixed_array is not in new space.
7676 // Please note this function is used during marking:
7761 // We can get negative count here when the type-feedback info is
7764 // Since we do not optimize when the debugger is active, we can skip
7801 // Ensure packed bit field is in Smi range.
7812 // Ensure packed bit field is in Smi range.
