Lines Matching refs:name
32 int StubCache::PrimaryOffset(Name name, Map map) {
33 // Compute the hash of the name (use entire hash field).
34 DCHECK(name.HasHashCode());
35 uint32_t field = name.raw_hash_field();
41 // Base the offset on a simple combination of name and map.
50 int StubCache::SecondaryOffset(Name name, Map old_map) {
51 uint32_t name_low32bits = static_cast<uint32_t>(name.ptr());
58 int StubCache::PrimaryOffsetForTesting(Name name, Map map) {
59 return PrimaryOffset(name, map);
62 int StubCache::SecondaryOffsetForTesting(Name name, Map map) {
63 return SecondaryOffset(name, map);
69 bool CommonStubCacheChecks(StubCache* stub_cache, Name name, Map map,
71 // Validate that the name and handler do not move on scavenge, and that we
73 DCHECK(!Heap::InYoungGeneration(name));
75 DCHECK(name.IsUniqueName());
83 void StubCache::Set(Name name, Map map, MaybeObject handler) {
84 DCHECK(CommonStubCacheChecks(this, name, map, handler));
87 int primary_offset = PrimaryOffset(name, map);
106 primary->key = StrongTaggedValue(name);
112 MaybeObject StubCache::Get(Name name, Map map) {
113 DCHECK(CommonStubCacheChecks(this, name, map, MaybeObject()));
114 int primary_offset = PrimaryOffset(name, map);
116 if (primary->key == name && primary->map == map) {
119 int secondary_offset = SecondaryOffset(name, map);
121 if (secondary->key == name && secondary->map == map) {