Lines Matching defs:value
44 const char* Name() final { return name_.value; }
261 void AddEphemeronEdge(const HeapObjectHeader& value) {
264 ephemeron_edges_.insert(&value);
267 void AddEagerEphemeronEdge(const void* value, cppgc::TraceCallback callback) {
268 eager_ephemeron_edges_.insert({value, callback});
273 for (const HeapObjectHeader* value : ephemeron_edges_) {
274 callback(*value);
401 // is similar to the "lowlink" value in Tarjan's algorithm for SCC.
421 const HeapObjectHeader& value);
423 const HeapObjectHeader& key, const void* value,
617 // 3. for each {key, value} in container: key->value;
625 void VisitEphemeron(const void* key, const void* value,
627 // For ephemerons, the key retains the value.
634 key_header, value, value_desc);
637 // Regular path where both key and value are GarbageCollected objects.
639 key_header, HeapObjectHeader::FromObject(value));
814 const HeapObjectHeader& key, const void* value,
817 // Eagerly trace the value here, effectively marking key as visible and
821 value_desc.callback(&visitor, value);
822 key_state.AddEagerEphemeronEdge(value, value_desc.callback);
826 const HeapObjectHeader& key, const HeapObjectHeader& value) {
828 VisitForVisibility(&key_state, value);
829 key_state.AddEphemeronEdge(value);
878 state.ForAllEphemeronEdges([this, &state](const HeapObjectHeader& value) {
879 AddEdge(state, value, "part of key -> value pair in ephemeron table");
882 "part of key -> value pair in ephemeron table");
884 [&object_visitor](const void* value, cppgc::TraceCallback callback) {
885 callback(&object_visitor, value);