Lines Matching refs:primary
29 // Hash algorithm for the primary table. This algorithm is replicated in
47 // assembler. This hash should be sufficiently different from the primary one
86 // Compute the primary entry.
88 Entry* primary = entry(primary_, primary_offset);
90 TaggedValue::ToMaybeObject(isolate(), primary->value));
91 // If the primary entry has useful data in it, we retire it to the
95 !primary->map.IsSmi()) {
97 Map::cast(StrongTaggedValue::ToObject(isolate(), primary->map));
99 Name::cast(StrongTaggedValue::ToObject(isolate(), primary->key));
102 *secondary = *primary;
105 // Update primary cache.
106 primary->key = StrongTaggedValue(name);
107 primary->value = TaggedValue(handler);
108 primary->map = StrongTaggedValue(map);
115 Entry* primary = entry(primary_, primary_offset);
116 if (primary->key == name && primary->map == map) {
117 return TaggedValue::ToMaybeObject(isolate(), primary->value);