Searched refs:dead_count (Results 1 – 4 of 4) sorted by relevance
107 c.dead_count = 0; in set_initial_count()115 c.dead_count = 0; in set_initial_count()220 int dead_count(Handle h) { in dead_count() function221 int r = h.is_large_ ? Large(h)->load(std::memory_order_relaxed).dead_count in dead_count()222 : Packed(h)->load(std::memory_order_relaxed).dead_count; in dead_count()230 c.dead_count++; in increment_dead_count()237 DCHECK_LT(c.dead_count, kMaxCountForPackedCounts); in increment_dead_count()238 c.dead_count++; in increment_dead_count()293 val.dead_count++; in adjust_for_activation_shared()297 return AdjustResult(val.dead_count, val.pending); in adjust_for_activation_shared()[all …]
43 EXPECT_EQ(c.dead_count(h[id]), 0); in TEST()49 EXPECT_EQ(c.dead_count(h[id]), (id == 0) ? 0 : 1); in TEST()79 EXPECT_EQ(c.dead_count(h[id]), c2.dead_count(h[id])); in TEST()161 EXPECT_EQ(c.dead_count(h), 0); in TEST()168 EXPECT_EQ(c.dead_count(h), 1); in TEST()
165 int dead_count(PendingCounts::Handle h) { return counts.dead_count(h); } in dead_count() function
323 const int dead_cnt = parent_iter_state->dead_count(dst_pending_id); in DeleteFrame()344 int dead_cnt = parent_iter_state->dead_count(dst_pending_id); in DeleteFrame()506 const int dead_cnt = iter_state->dead_count(dst_pending_id); in ActivateNodesSlowPath()548 int dead_cnt = iter_state->dead_count(dst_pending_id); in ActivateNodesSlowPath()