Lines Matching defs:that
2 // Use of this source code is governed by a BSD-style license that can be
228 // Ensure that all bits of the double value are preserved.
858 bool Object::StrictEquals(Object that) {
860 if (!that.IsNumber()) return false;
861 return StrictNumberEquals(*this, that);
863 if (!that.IsString()) return false;
864 return String::cast(*this).Equals(String::cast(that));
866 if (!that.IsBigInt()) return false;
867 return BigInt::EqualToBigInt(BigInt::cast(*this), BigInt::cast(that));
869 return *this == that;
923 // [[BoundTargetFunction]] and use that instead of {callable}.
1551 // In the case of AccessorNameSetterCallback, we know that the result value
1595 // that location. The best solution seems to be to break the impasse by
1767 // Check that this object is an array.
1772 // Check that we have the original ArrayPrototype.
1782 // Check that the ArrayPrototype hasn't been modified in a way that would
2318 // Use map() only when it's guaranteed that it's not a Code object.
2483 // Make sure that the top context does not change when doing callbacks or
2516 // Assuming that the callback have side effects, we use
2530 // callback. Assuming that the callbacks have side effects, we use
2613 // The property cell that we have created is garbage because we are going
2664 // Note, the callers rely on the fact that this code is redoing the full own
2805 // underlying buffer was detached, so just check that.
2815 // underlying buffer was detached, so just check that.
2847 // Possibly migrate to the most up-to-date map that will be able to store
2931 // Migrate to the most up-to-date map that will be able to store |value|
2981 // back to front so that the last callback with a given name takes
2982 // precedence over previously added callbacks with that name.
3354 // Fast path: check numbers and strings that can be converted directly
3957 // Ensure the ObjectClone property details are NONE, and that all source
4025 // Return early if len == 0 so that we don't try to read the write barrier off
4039 // Check that GC didn't remove elements from the array.
4055 // Check that GC didn't remove elements from the array.
4072 // Check that GC didn't remove elements from the array.
4620 // Archive statics that are thread-local.
4627 // Restore statics that are thread-local.
4682 // Verify that Smis (number of separators) only occur when necessary:
4686 // - It is assumed that consecutive Strings will have one separator,
4805 // offset yet, which would be encoded as negative integer. In that case,
5057 // renumbering done by AstFunctionLiteralIdReindexer; in particular, that
5078 // We might be able to de-dupe the SFI against a SFI that was
5080 // was included in the snapshot). In that case, we can find it based on the
5096 // location in the FunctionLiteral, so that it will be refilled later.
5109 // It's possible that FunctionLiterals which were processed before this one
5316 // If map guarantees that there can't be a read-only length, we are done.
5513 // %ObjectPrototype%, meaning that such lookups are guaranteed to yield
5521 // is intact, as that guards the lookup path for the "then" property
5996 // Validate that the key is absent.
6133 // Validate that the key is absent.
6170 // Check if this index is high enough that we should require slow
6192 // expect empty dictionaries so make sure to call AtPut that correctly handles
6254 // Use AtomicSlot wrapper to ensure that std::sort uses atomic load and
6255 // store operations that are safe for concurrent marking.
6846 // X has fewer digits. We would like to simply scale up X but that