src/share/vm/gc_implementation/parNew/parCardTableModRefBS.cpp

changeset 3900
d2a62e0f25eb
parent 3357
441e946dc1af
child 4153
b9a9ed0f8eeb
     1.1 --- a/src/share/vm/gc_implementation/parNew/parCardTableModRefBS.cpp	Wed Jun 27 15:23:36 2012 +0200
     1.2 +++ b/src/share/vm/gc_implementation/parNew/parCardTableModRefBS.cpp	Thu Jun 28 17:03:16 2012 -0400
     1.3 @@ -457,12 +457,12 @@
     1.4          if (_lowest_non_clean[i] != NULL) {
     1.5            assert(n_chunks != _lowest_non_clean_chunk_size[i],
     1.6                   "logical consequence");
     1.7 -          FREE_C_HEAP_ARRAY(CardPtr, _lowest_non_clean[i]);
     1.8 +          FREE_C_HEAP_ARRAY(CardPtr, _lowest_non_clean[i], mtGC);
     1.9            _lowest_non_clean[i] = NULL;
    1.10          }
    1.11          // Now allocate a new one if necessary.
    1.12          if (_lowest_non_clean[i] == NULL) {
    1.13 -          _lowest_non_clean[i]                  = NEW_C_HEAP_ARRAY(CardPtr, n_chunks);
    1.14 +          _lowest_non_clean[i]                  = NEW_C_HEAP_ARRAY(CardPtr, n_chunks, mtGC);
    1.15            _lowest_non_clean_chunk_size[i]       = n_chunks;
    1.16            _lowest_non_clean_base_chunk_index[i] = addr_to_chunk_index(covered.start());
    1.17            for (int j = 0; j < (int)n_chunks; j++)

mercurial