Lines Matching defs:Is
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
31 // but it is absolutely needed to make sure gcc generates optimal
32 // code. gcc is not happy when attempting to inline too deep.
61 // Ensure the upper 2 bits have the same value by sign extending it. This is
75 bool Object::Is##type() { \
83 ASSERT(object->Is##type()); \
140 // External objects are not extensible, so the map check is enough.
154 // There is a constraint on the object; check.
282 // Dictionary is covered under FixedArray.
597 // a deoptimization data array. Since this is used for asserts we can
598 // check that the length is zero or else the fixed size plus a multiple of
612 // a deoptimization data array. Since this is used for asserts we can check
613 // that the length is plausible though.
630 // a cache cells array. Since this is used for asserts we can check that
631 // the length is plausible though.
668 template <> inline bool Is<JSFunction>(Object* obj) {
713 template <> inline bool Is<JSArray>(Object* obj) {
846 bool Object::Is##Name() { \
922 // This was not always the case. This ASSERT is here to catch
1225 // WRITE_FIELD does not invoke write barrier, but there is no need
1328 // elements kind is the initial elements kind.
1574 // transition that matches the object. This achieves what is needed.
1648 // The write barrier is not used for global property cells.
1735 // properties are at the end of the object. Therefore there is no need
1744 // properties are at the end of the object. Therefore there is no need
1755 // properties are at the end of the object. Therefore there is no need
1770 // is needed to correctly distinguish between properties stored in-object and
1863 // kFastPropertiesSoftLimit in-object properties. When this is the case,
1864 // it is very unlikely that the object is being used as a dictionary
1865 // and there is a good chance that allowing more map transitions
2177 // Perform a linear search in this fixed array. len is the number of entry
2494 // EnsureCapacity will guarantee the hash table is never full.
2497 // Empty entry. Uses raw unchecked accessors because it is called by the
2716 // wrapping string is already flattened.
3776 // objects. This is used in the debugger to determine whether or not
4158 // sweep. reinterpret_cast is therefore used instead of the more appropriate
4159 // Code::cast. Code::cast does not work when the object's map is
4184 // If the descriptor is using the empty transition array, install a new empty
4215 // Ensure the upper 2 bits have the same value by sign extending it. This is
4356 // Transition arrays are not shared. When one is replaced, it should not
4358 // When there is another reference to the array somewhere (e.g. a handle),
4802 // If the GC metadata field is already used then the function was
4905 // We reenable optimization whenever the number of tries is a large
5044 // When there is no initial map and the prototype is a JSObject, the
5045 // initial map field is used for the prototype field.
5053 // value, that value is stored in the constructor field of the map.
5104 ASSERT(id < kJSBuiltinsCount); // id is unsigned.
5111 ASSERT(id < kJSBuiltinsCount); // id is unsigned.
5118 ASSERT(id < kJSBuiltinsCount); // id is unsigned.
5125 ASSERT(id < kJSBuiltinsCount); // id is unsigned.
5746 // is used.
5949 // No write barrier is needed since empty_fixed_array is not in new space.
5950 // Please note this function is used during marking:
6081 // We can get negative count here when the type-feedback info is
6084 // Since we do not optimize when the debugger is active, we can skip
6105 // Ensure packed bit field is in Smi range.
6116 // Ensure packed bit field is in Smi range.
