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

*** 109,125 ****
      for (Entry* e = bucket(index); e != NULL; ) {
        Entry* to_remove = e;
        // read next before freeing.
        e = e->next();
        unlink_entry(to_remove);
!       FREE_C_HEAP_ARRAY(char, to_remove, mtGC);
      }
    }
    assert(number_of_entries() == 0, "should have removed all entries");
    free_buckets();
    for (BasicHashtableEntry<mtGC>* e = new_entry_free_list(); e != NULL; e = new_entry_free_list()) {
!     FREE_C_HEAP_ARRAY(char, e, mtGC);
    }
  }
  
  bool CodeRootSetTable::add(nmethod* nm) {
    if (!contains(nm)) {
--- 109,125 ----
      for (Entry* e = bucket(index); e != NULL; ) {
        Entry* to_remove = e;
        // read next before freeing.
        e = e->next();
        unlink_entry(to_remove);
!       FREE_C_HEAP_ARRAY(char, to_remove);
      }
    }
    assert(number_of_entries() == 0, "should have removed all entries");
    free_buckets();
    for (BasicHashtableEntry<mtGC>* e = new_entry_free_list(); e != NULL; e = new_entry_free_list()) {
!     FREE_C_HEAP_ARRAY(char, e);
    }
  }
  
  bool CodeRootSetTable::add(nmethod* nm) {
    if (!contains(nm)) {