author | jwilhelm |
Thu, 03 Oct 2013 21:36:29 +0200 | |
changeset 20398 | b206c580c45f |
parent 20083 | df032615dd00 |
child 22234 | da823d78ad65 |
permissions | -rw-r--r-- |
1374 | 1 |
/* |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
2 |
* Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
1374 | 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
* |
|
5 |
* This code is free software; you can redistribute it and/or modify it |
|
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. |
|
8 |
* |
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
13 |
* accompanied this code). |
|
14 |
* |
|
15 |
* You should have received a copy of the GNU General Public License version |
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
18 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
3807
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
3807
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
3807
diff
changeset
|
21 |
* questions. |
1374 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
9989 | 26 |
#include "gc_implementation/g1/heapRegion.hpp" |
27 |
#include "gc_implementation/g1/heapRegionSeq.inline.hpp" |
|
28 |
#include "gc_implementation/g1/heapRegionSets.hpp" |
|
7397 | 29 |
#include "gc_implementation/g1/g1CollectedHeap.inline.hpp" |
30 |
#include "memory/allocation.hpp" |
|
1374 | 31 |
|
9989 | 32 |
// Private |
1374 | 33 |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
34 |
uint HeapRegionSeq::find_contiguous_from(uint from, uint num) { |
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
35 |
uint len = length(); |
9989 | 36 |
assert(num > 1, "use this only for sequences of length 2 or greater"); |
37 |
assert(from <= len, |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
38 |
err_msg("from: %u should be valid and <= than %u", from, len)); |
1374 | 39 |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
40 |
uint curr = from; |
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
41 |
uint first = G1_NULL_HRS_INDEX; |
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
42 |
uint num_so_far = 0; |
9989 | 43 |
while (curr < len && num_so_far < num) { |
44 |
if (at(curr)->is_empty()) { |
|
45 |
if (first == G1_NULL_HRS_INDEX) { |
|
7923 | 46 |
first = curr; |
47 |
num_so_far = 1; |
|
48 |
} else { |
|
49 |
num_so_far += 1; |
|
50 |
} |
|
51 |
} else { |
|
9989 | 52 |
first = G1_NULL_HRS_INDEX; |
7923 | 53 |
num_so_far = 0; |
54 |
} |
|
55 |
curr += 1; |
|
56 |
} |
|
57 |
assert(num_so_far <= num, "post-condition"); |
|
58 |
if (num_so_far == num) { |
|
8680 | 59 |
// we found enough space for the humongous object |
9989 | 60 |
assert(from <= first && first < len, "post-condition"); |
61 |
assert(first < curr && (curr - first) == num, "post-condition"); |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
62 |
for (uint i = first; i < first + num; ++i) { |
9989 | 63 |
assert(at(i)->is_empty(), "post-condition"); |
7923 | 64 |
} |
65 |
return first; |
|
66 |
} else { |
|
67 |
// we failed to find enough space for the humongous object |
|
9989 | 68 |
return G1_NULL_HRS_INDEX; |
7923 | 69 |
} |
70 |
} |
|
71 |
||
9989 | 72 |
// Public |
73 |
||
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
74 |
void HeapRegionSeq::initialize(HeapWord* bottom, HeapWord* end) { |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
75 |
assert((uintptr_t) bottom % HeapRegion::GrainBytes == 0, |
9989 | 76 |
"bottom should be heap region aligned"); |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
77 |
assert((uintptr_t) end % HeapRegion::GrainBytes == 0, |
9989 | 78 |
"end should be heap region aligned"); |
79 |
||
80 |
_next_search_index = 0; |
|
81 |
_allocated_length = 0; |
|
82 |
||
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
83 |
_regions.initialize(bottom, end, HeapRegion::GrainBytes); |
9989 | 84 |
} |
85 |
||
86 |
MemRegion HeapRegionSeq::expand_by(HeapWord* old_end, |
|
87 |
HeapWord* new_end, |
|
88 |
FreeRegionList* list) { |
|
89 |
assert(old_end < new_end, "don't call it otherwise"); |
|
90 |
G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
|
91 |
||
92 |
HeapWord* next_bottom = old_end; |
|
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
93 |
assert(heap_bottom() <= next_bottom, "invariant"); |
9989 | 94 |
while (next_bottom < new_end) { |
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
95 |
assert(next_bottom < heap_end(), "invariant"); |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
96 |
uint index = length(); |
7923 | 97 |
|
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
98 |
assert(index < max_length(), "otherwise we cannot expand further"); |
9989 | 99 |
if (index == 0) { |
100 |
// We have not allocated any regions so far |
|
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
101 |
assert(next_bottom == heap_bottom(), "invariant"); |
9989 | 102 |
} else { |
103 |
// next_bottom should match the end of the last/previous region |
|
104 |
assert(next_bottom == at(index - 1)->end(), "invariant"); |
|
105 |
} |
|
106 |
||
107 |
if (index == _allocated_length) { |
|
108 |
// We have to allocate a new HeapRegion. |
|
109 |
HeapRegion* new_hr = g1h->new_heap_region(index, next_bottom); |
|
110 |
if (new_hr == NULL) { |
|
111 |
// allocation failed, we bail out and return what we have done so far |
|
112 |
return MemRegion(old_end, next_bottom); |
|
113 |
} |
|
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
114 |
assert(_regions.get_by_index(index) == NULL, "invariant"); |
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
115 |
_regions.set_by_index(index, new_hr); |
17323
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
116 |
increment_allocated_length(); |
9989 | 117 |
} |
118 |
// Have to increment the length first, otherwise we will get an |
|
119 |
// assert failure at(index) below. |
|
17323
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
120 |
increment_length(); |
9989 | 121 |
HeapRegion* hr = at(index); |
122 |
list->add_as_tail(hr); |
|
123 |
||
124 |
next_bottom = hr->end(); |
|
7923 | 125 |
} |
9989 | 126 |
assert(next_bottom == new_end, "post-condition"); |
127 |
return MemRegion(old_end, next_bottom); |
|
128 |
} |
|
129 |
||
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
130 |
uint HeapRegionSeq::free_suffix() { |
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
131 |
uint res = 0; |
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
132 |
uint index = length(); |
9989 | 133 |
while (index > 0) { |
134 |
index -= 1; |
|
135 |
if (!at(index)->is_empty()) { |
|
136 |
break; |
|
137 |
} |
|
138 |
res += 1; |
|
7923 | 139 |
} |
1374 | 140 |
return res; |
141 |
} |
|
142 |
||
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
143 |
uint HeapRegionSeq::find_contiguous(uint num) { |
9989 | 144 |
assert(num > 1, "use this only for sequences of length 2 or greater"); |
145 |
assert(_next_search_index <= length(), |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
146 |
err_msg("_next_search_index: %u should be valid and <= than %u", |
9989 | 147 |
_next_search_index, length())); |
148 |
||
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
149 |
uint start = _next_search_index; |
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
150 |
uint res = find_contiguous_from(start, num); |
9989 | 151 |
if (res == G1_NULL_HRS_INDEX && start > 0) { |
152 |
// Try starting from the beginning. If _next_search_index was 0, |
|
153 |
// no point in doing this again. |
|
154 |
res = find_contiguous_from(0, num); |
|
155 |
} |
|
156 |
if (res != G1_NULL_HRS_INDEX) { |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
157 |
assert(res < length(), err_msg("res: %u should be valid", res)); |
9989 | 158 |
_next_search_index = res + num; |
159 |
assert(_next_search_index <= length(), |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
160 |
err_msg("_next_search_index: %u should be valid and <= than %u", |
9989 | 161 |
_next_search_index, length())); |
162 |
} |
|
163 |
return res; |
|
1374 | 164 |
} |
165 |
||
9989 | 166 |
void HeapRegionSeq::iterate(HeapRegionClosure* blk) const { |
167 |
iterate_from((HeapRegion*) NULL, blk); |
|
168 |
} |
|
1374 | 169 |
|
9989 | 170 |
void HeapRegionSeq::iterate_from(HeapRegion* hr, HeapRegionClosure* blk) const { |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
171 |
uint hr_index = 0; |
9989 | 172 |
if (hr != NULL) { |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
173 |
hr_index = hr->hrs_index(); |
1374 | 174 |
} |
9989 | 175 |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
176 |
uint len = length(); |
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
177 |
for (uint i = hr_index; i < len; i += 1) { |
9989 | 178 |
bool res = blk->doHeapRegion(at(i)); |
1374 | 179 |
if (res) { |
180 |
blk->incomplete(); |
|
181 |
return; |
|
182 |
} |
|
183 |
} |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
184 |
for (uint i = 0; i < hr_index; i += 1) { |
9989 | 185 |
bool res = blk->doHeapRegion(at(i)); |
1374 | 186 |
if (res) { |
187 |
blk->incomplete(); |
|
188 |
return; |
|
189 |
} |
|
190 |
} |
|
191 |
} |
|
192 |
||
17323
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
193 |
uint HeapRegionSeq::shrink_by(uint num_regions_to_remove) { |
7923 | 194 |
// Reset this in case it's currently pointing into the regions that |
195 |
// we just removed. |
|
9989 | 196 |
_next_search_index = 0; |
7923 | 197 |
|
9989 | 198 |
assert(length() > 0, "the region sequence should not be empty"); |
199 |
assert(length() <= _allocated_length, "invariant"); |
|
200 |
assert(_allocated_length > 0, "we should have at least one region committed"); |
|
17323
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
201 |
assert(num_regions_to_remove < length(), "We should never remove all regions"); |
1374 | 202 |
|
17323
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
203 |
uint i = 0; |
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
204 |
for (; i < num_regions_to_remove; i++) { |
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
205 |
HeapRegion* cur = at(length() - 1); |
9989 | 206 |
|
17323
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
207 |
if (!cur->is_empty()) { |
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
208 |
// We have to give up if the region can not be moved |
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
209 |
break; |
1374 | 210 |
} |
17323
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
211 |
assert(!cur->isHumongous(), "Humongous regions should not be empty"); |
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
212 |
|
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
213 |
decrement_length(); |
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
214 |
} |
cc153b745ed5
8013872: G1: HeapRegionSeq::shrink_by() has invalid assert
brutisso
parents:
13195
diff
changeset
|
215 |
return i; |
1374 | 216 |
} |
217 |
||
9989 | 218 |
#ifndef PRODUCT |
219 |
void HeapRegionSeq::verify_optional() { |
|
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
220 |
guarantee(length() <= _allocated_length, |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
221 |
err_msg("invariant: _length: %u _allocated_length: %u", |
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
222 |
length(), _allocated_length)); |
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
223 |
guarantee(_allocated_length <= max_length(), |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
224 |
err_msg("invariant: _allocated_length: %u _max_length: %u", |
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
225 |
_allocated_length, max_length())); |
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
226 |
guarantee(_next_search_index <= length(), |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
227 |
err_msg("invariant: _next_search_index: %u _length: %u", |
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
228 |
_next_search_index, length())); |
9989 | 229 |
|
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
230 |
HeapWord* prev_end = heap_bottom(); |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
231 |
for (uint i = 0; i < _allocated_length; i += 1) { |
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
232 |
HeapRegion* hr = _regions.get_by_index(i); |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
233 |
guarantee(hr != NULL, err_msg("invariant: i: %u", i)); |
9989 | 234 |
guarantee(hr->bottom() == prev_end, |
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
235 |
err_msg("invariant i: %u "HR_FORMAT" prev_end: "PTR_FORMAT, |
9989 | 236 |
i, HR_FORMAT_PARAMS(hr), prev_end)); |
237 |
guarantee(hr->hrs_index() == i, |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
9989
diff
changeset
|
238 |
err_msg("invariant: i: %u hrs_index(): %u", i, hr->hrs_index())); |
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
239 |
if (i < length()) { |
9989 | 240 |
// Asserts will fire if i is >= _length |
241 |
HeapWord* addr = hr->bottom(); |
|
242 |
guarantee(addr_to_region(addr) == hr, "sanity"); |
|
243 |
guarantee(addr_to_region_unsafe(addr) == hr, "sanity"); |
|
244 |
} else { |
|
245 |
guarantee(hr->is_empty(), "sanity"); |
|
246 |
guarantee(!hr->isHumongous(), "sanity"); |
|
247 |
// using assert instead of guarantee here since containing_set() |
|
248 |
// is only available in non-product builds. |
|
249 |
assert(hr->containing_set() == NULL, "sanity"); |
|
250 |
} |
|
251 |
if (hr->startsHumongous()) { |
|
252 |
prev_end = hr->orig_end(); |
|
253 |
} else { |
|
254 |
prev_end = hr->end(); |
|
255 |
} |
|
1374 | 256 |
} |
20083
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
257 |
for (uint i = _allocated_length; i < max_length(); i += 1) { |
df032615dd00
7163191: G1: introduce a "heap spanning table" abstraction
tschatzl
parents:
17323
diff
changeset
|
258 |
guarantee(_regions.get_by_index(i) == NULL, err_msg("invariant i: %u", i)); |
9989 | 259 |
} |
1374 | 260 |
} |
9989 | 261 |
#endif // PRODUCT |