equal
deleted
inserted
replaced
1897 // Noone else should be accessing the _cleanup_list at this point, |
1897 // Noone else should be accessing the _cleanup_list at this point, |
1898 // so it's not necessary to take any locks |
1898 // so it's not necessary to take any locks |
1899 while (!_cleanup_list.is_empty()) { |
1899 while (!_cleanup_list.is_empty()) { |
1900 HeapRegion* hr = _cleanup_list.remove_head(); |
1900 HeapRegion* hr = _cleanup_list.remove_head(); |
1901 assert(hr != NULL, "the list was not empty"); |
1901 assert(hr != NULL, "the list was not empty"); |
1902 hr->rem_set()->clear(); |
1902 hr->par_clear(); |
1903 tmp_free_list.add_as_tail(hr); |
1903 tmp_free_list.add_as_tail(hr); |
1904 |
1904 |
1905 // Instead of adding one region at a time to the secondary_free_list, |
1905 // Instead of adding one region at a time to the secondary_free_list, |
1906 // we accumulate them in the local list and move them a few at a |
1906 // we accumulate them in the local list and move them a few at a |
1907 // time. This also cuts down on the number of notify_all() calls |
1907 // time. This also cuts down on the number of notify_all() calls |