1.1 --- a/src/share/vm/gc_implementation/g1/sparsePRT.hpp Wed Sep 30 14:50:51 2009 -0400
1.2 +++ b/src/share/vm/gc_implementation/g1/sparsePRT.hpp Tue Oct 27 02:42:24 2009 -0700
1.3 @@ -102,13 +102,6 @@
1.4 int _free_region;
1.5 int _free_list;
1.6
1.7 - static RSHashTable* _head_deleted_list;
1.8 - RSHashTable* _next_deleted;
1.9 - RSHashTable* next_deleted() { return _next_deleted; }
1.10 - void set_next_deleted(RSHashTable* rsht) { _next_deleted = rsht; }
1.11 - bool _deleted;
1.12 - void set_deleted(bool b) { _deleted = b; }
1.13 -
1.14 // Requires that the caller hold a lock preventing parallel modifying
1.15 // operations, and that the the table be less than completely full. If
1.16 // an entry for "region_ind" is already in the table, finds it and
1.17 @@ -154,14 +147,10 @@
1.18 size_t occupied_entries() const { return _occupied_entries; }
1.19 size_t occupied_cards() const { return _occupied_cards; }
1.20 size_t mem_size() const;
1.21 - bool deleted() { return _deleted; }
1.22
1.23 SparsePRTEntry* entry(int i) const { return &_entries[i]; }
1.24
1.25 void print();
1.26 -
1.27 - static void add_to_deleted_list(RSHashTable* rsht);
1.28 - static RSHashTable* get_from_deleted_list();
1.29 };
1.30
1.31 // ValueObj because will be embedded in HRRS iterator.
