< prev index next >

src/hotspot/share/gc/g1/g1CollectionSetChooser.cpp

Print this page

        

*** 110,120 **** FREE_C_HEAP_ARRAY(HeapRegion*, _data); } // Claim a new chunk, returning its bounds [from, to[. void claim_chunk(uint& from, uint& to) { ! uint result = Atomic::add(_chunk_size, &_cur_claim_idx); assert(_max_size > result - 1, "Array too small, is %u should be %u with chunk size %u.", _max_size, result, _chunk_size); from = result - _chunk_size; to = result; --- 110,120 ---- FREE_C_HEAP_ARRAY(HeapRegion*, _data); } // Claim a new chunk, returning its bounds [from, to[. void claim_chunk(uint& from, uint& to) { ! uint result = Atomic::add(&_cur_claim_idx, _chunk_size); assert(_max_size > result - 1, "Array too small, is %u should be %u with chunk size %u.", _max_size, result, _chunk_size); from = result - _chunk_size; to = result;
*** 212,223 **** G1BuildCandidateArray _result; void update_totals(uint num_regions, size_t reclaimable_bytes) { if (num_regions > 0) { assert(reclaimable_bytes > 0, "invariant"); ! Atomic::add(num_regions, &_num_regions_added); ! Atomic::add(reclaimable_bytes, &_reclaimable_bytes_added); } else { assert(reclaimable_bytes == 0, "invariant"); } } --- 212,223 ---- G1BuildCandidateArray _result; void update_totals(uint num_regions, size_t reclaimable_bytes) { if (num_regions > 0) { assert(reclaimable_bytes > 0, "invariant"); ! Atomic::add(&_num_regions_added, num_regions); ! Atomic::add(&_reclaimable_bytes_added, reclaimable_bytes); } else { assert(reclaimable_bytes == 0, "invariant"); } }
< prev index next >