| Index: src/heap/store-buffer.h
|
| diff --git a/src/heap/store-buffer.h b/src/heap/store-buffer.h
|
| index c9d6090927effaa6879e8cd34448587d864b05f4..6c571fcdce5bd2f755e0b42c259aae231667d80f 100644
|
| --- a/src/heap/store-buffer.h
|
| +++ b/src/heap/store-buffer.h
|
| @@ -83,21 +83,11 @@ class StoreBuffer {
|
| bool old_buffer_is_sorted() { return old_buffer_is_sorted_; }
|
| bool old_buffer_is_filtered() { return old_buffer_is_filtered_; }
|
|
|
| - // Goes through the store buffer removing pointers to things that have
|
| - // been promoted. Rebuilds the store buffer completely if it overflowed.
|
| - void SortUniq();
|
| -
|
| void EnsureSpace(intptr_t space_needed);
|
| void Verify();
|
|
|
| bool PrepareForIteration();
|
|
|
| -#ifdef DEBUG
|
| - void Clean();
|
| - // Slow, for asserts only.
|
| - bool CellIsInStoreBuffer(Address cell);
|
| -#endif
|
| -
|
| void Filter(int flag);
|
|
|
| // Eliminates all stale store buffer entries from the store buffer, i.e.,
|
| @@ -144,7 +134,6 @@ class StoreBuffer {
|
| void ClearFilteringHashSets();
|
|
|
| bool SpaceAvailable(intptr_t space_needed);
|
| - void Uniq();
|
| void ExemptPopularPages(int prime_sample_step, int threshold);
|
|
|
| void ProcessOldToNewSlot(Address slot_address,
|
|
|