src/share/vm/gc_implementation/g1/g1StringDedupTable.cpp

*** 90,102 ****
    // entries while doing a parallel scan of the table. Using
    // PaddedEnd to avoid false sharing.
    PaddedEnd<G1StringDedupEntryFreeList>* _lists;
    size_t                                 _nlists;
  
  public:
    G1StringDedupEntryCache();
-   ~G1StringDedupEntryCache();
  
    // Get a table entry from the cache freelist, or allocate a new
    // entry if the cache is empty.
    G1StringDedupEntry* alloc();
  
--- 90,104 ----
    // entries while doing a parallel scan of the table. Using
    // PaddedEnd to avoid false sharing.
    PaddedEnd<G1StringDedupEntryFreeList>* _lists;
    size_t                                 _nlists;
  
+   // Never called.
+   ~G1StringDedupEntryCache();
+ 
  public:
    G1StringDedupEntryCache();
  
    // Get a table entry from the cache freelist, or allocate a new
    // entry if the cache is empty.
    G1StringDedupEntry* alloc();
  
*** 114,127 ****
  G1StringDedupEntryCache::G1StringDedupEntryCache() {
    _nlists = MAX2(ParallelGCThreads, (size_t)1);
    _lists = PaddedArray<G1StringDedupEntryFreeList, mtGC>::create_unfreeable((uint)_nlists);
  }
  
- G1StringDedupEntryCache::~G1StringDedupEntryCache() {
-   ShouldNotReachHere();
- }
- 
  G1StringDedupEntry* G1StringDedupEntryCache::alloc() {
    for (size_t i = 0; i < _nlists; i++) {
      G1StringDedupEntry* entry = _lists[i].remove();
      if (entry != NULL) {
        return entry;
--- 116,125 ----