91 // Pass down commit calls to the VirtualSpace.
92 void commit_regions(uint index, size_t num_regions = 1, WorkGang* pretouch_gang = NULL);
93
94 // Notify other data structures about change in the heap layout.
95 void update_committed_space(HeapWord* old_end, HeapWord* new_end);
96
97 // Find a contiguous set of empty or uncommitted regions of length num and return
98 // the index of the first region or G1_NO_HRM_INDEX if the search was unsuccessful.
99 // If only_empty is true, only empty regions are considered.
100 // Searches from bottom to top of the heap, doing a first-fit.
101 uint find_contiguous(size_t num, bool only_empty);
102 // Finds the next sequence of unavailable regions starting from start_idx. Returns the
103 // length of the sequence found. If this result is zero, no such sequence could be found,
104 // otherwise res_idx indicates the start index of these regions.
105 uint find_unavailable_from_idx(uint start_idx, uint* res_idx) const;
106 // Finds the next sequence of empty regions starting from start_idx, going backwards in
107 // the heap. Returns the length of the sequence found. If this value is zero, no
108 // sequence could be found, otherwise res_idx contains the start index of this range.
109 uint find_empty_from_idx_reverse(uint start_idx, uint* res_idx) const;
110
111 protected:
112 G1HeapRegionTable _regions;
113 G1RegionToSpaceMapper* _heap_mapper;
114 G1RegionToSpaceMapper* _prev_bitmap_mapper;
115 G1RegionToSpaceMapper* _next_bitmap_mapper;
116 FreeRegionList _free_list;
117
118 void make_regions_available(uint index, uint num_regions = 1, WorkGang* pretouch_gang = NULL);
119 void uncommit_regions(uint index, size_t num_regions = 1);
120 // Allocate a new HeapRegion for the given index.
121 HeapRegion* new_heap_region(uint hrm_index);
122 #ifdef ASSERT
123 public:
124 bool is_free(HeapRegion* hr) const;
125 #endif
126 public:
127 // Empty constructor, we'll initialize it with the initialize() method.
128 HeapRegionManager();
129
130 static HeapRegionManager* create_manager(G1CollectedHeap* heap);
157
158 // Returns whether the given region is available for allocation.
159 bool is_available(uint region) const;
160
161 // Return the next region (by index) that is part of the same
162 // humongous object that hr is part of.
163 inline HeapRegion* next_region_in_humongous(HeapRegion* hr) const;
164
165 // If addr is within the committed space return its corresponding
166 // HeapRegion, otherwise return NULL.
167 inline HeapRegion* addr_to_region(HeapWord* addr) const;
168
169 // Insert the given region into the free region list.
170 inline void insert_into_free_list(HeapRegion* hr);
171
172 // Insert the given region list into the global free region list.
173 void insert_list_into_free_list(FreeRegionList* list) {
174 _free_list.add_ordered(list);
175 }
176
177 virtual HeapRegion* allocate_free_region(HeapRegionType type) {
178 HeapRegion* hr = _free_list.remove_region(!type.is_young());
179
180 if (hr != NULL) {
181 assert(hr->next() == NULL, "Single region should not have next");
182 assert(is_available(hr->hrm_index()), "Must be committed");
183 }
184 return hr;
185 }
186
187 inline void allocate_free_regions_starting_at(uint first, uint num_regions);
188
189 // Remove all regions from the free list.
190 void remove_all_free_regions() {
191 _free_list.remove_all();
192 }
193
194 // Return the number of committed free regions in the heap.
195 uint num_free_regions() const {
196 return _free_list.length();
197 }
198
199 size_t total_free_bytes() const {
200 return num_free_regions() * HeapRegion::GrainBytes;
201 }
202
203 // Return the number of available (uncommitted) regions.
204 uint available() const { return max_length() - length(); }
205
209 // Return the maximum number of regions in the heap.
210 uint max_length() const { return (uint)_regions.length(); }
211
212 // Return maximum number of regions that heap can expand to.
213 virtual uint max_expandable_length() const { return (uint)_regions.length(); }
214
215 MemoryUsage get_auxiliary_data_memory_usage() const;
216
217 MemRegion reserved() const { return MemRegion(heap_bottom(), heap_end()); }
218
219 // Expand the sequence to reflect that the heap has grown. Either create new
220 // HeapRegions, or re-use existing ones. Returns the number of regions the
221 // sequence was expanded by. If a HeapRegion allocation fails, the resulting
222 // number of regions might be smaller than what's desired.
223 virtual uint expand_by(uint num_regions, WorkGang* pretouch_workers);
224
225 // Makes sure that the regions from start to start+num_regions-1 are available
226 // for allocation. Returns the number of regions that were committed to achieve
227 // this.
228 virtual uint expand_at(uint start, uint num_regions, WorkGang* pretouch_workers);
229
230 // Find a contiguous set of empty regions of length num. Returns the start index of
231 // that set, or G1_NO_HRM_INDEX.
232 virtual uint find_contiguous_only_empty(size_t num) { return find_contiguous(num, true); }
233 // Find a contiguous set of empty or unavailable regions of length num. Returns the
234 // start index of that set, or G1_NO_HRM_INDEX.
235 virtual uint find_contiguous_empty_or_unavailable(size_t num) { return find_contiguous(num, false); }
236
237 HeapRegion* next_region_in_heap(const HeapRegion* r) const;
238
239 // Find the highest free or uncommitted region in the reserved heap,
240 // and if uncommitted, commit it. If none are available, return G1_NO_HRM_INDEX.
241 // Set the 'expanded' boolean true if a new region was committed.
242 virtual uint find_highest_free(bool* expanded);
243
244 // Allocate the regions that contain the address range specified, committing the
245 // regions if necessary. Return false if any of the regions is already committed
246 // and not free, and return the number of regions newly committed in commit_count.
247 bool allocate_containing_regions(MemRegion range, size_t* commit_count, WorkGang* pretouch_workers);
248
|
91 // Pass down commit calls to the VirtualSpace.
92 void commit_regions(uint index, size_t num_regions = 1, WorkGang* pretouch_gang = NULL);
93
94 // Notify other data structures about change in the heap layout.
95 void update_committed_space(HeapWord* old_end, HeapWord* new_end);
96
97 // Find a contiguous set of empty or uncommitted regions of length num and return
98 // the index of the first region or G1_NO_HRM_INDEX if the search was unsuccessful.
99 // If only_empty is true, only empty regions are considered.
100 // Searches from bottom to top of the heap, doing a first-fit.
101 uint find_contiguous(size_t num, bool only_empty);
102 // Finds the next sequence of unavailable regions starting from start_idx. Returns the
103 // length of the sequence found. If this result is zero, no such sequence could be found,
104 // otherwise res_idx indicates the start index of these regions.
105 uint find_unavailable_from_idx(uint start_idx, uint* res_idx) const;
106 // Finds the next sequence of empty regions starting from start_idx, going backwards in
107 // the heap. Returns the length of the sequence found. If this value is zero, no
108 // sequence could be found, otherwise res_idx contains the start index of this range.
109 uint find_empty_from_idx_reverse(uint start_idx, uint* res_idx) const;
110
111 // Checks the G1MemoryNodeManager to see if this region is on the preferred node.
112 bool is_on_preferred_index(uint region_index, uint preferred_node_index);
113
114 protected:
115 G1HeapRegionTable _regions;
116 G1RegionToSpaceMapper* _heap_mapper;
117 G1RegionToSpaceMapper* _prev_bitmap_mapper;
118 G1RegionToSpaceMapper* _next_bitmap_mapper;
119 FreeRegionList _free_list;
120
121 void make_regions_available(uint index, uint num_regions = 1, WorkGang* pretouch_gang = NULL);
122 void uncommit_regions(uint index, size_t num_regions = 1);
123 // Allocate a new HeapRegion for the given index.
124 HeapRegion* new_heap_region(uint hrm_index);
125 #ifdef ASSERT
126 public:
127 bool is_free(HeapRegion* hr) const;
128 #endif
129 public:
130 // Empty constructor, we'll initialize it with the initialize() method.
131 HeapRegionManager();
132
133 static HeapRegionManager* create_manager(G1CollectedHeap* heap);
160
161 // Returns whether the given region is available for allocation.
162 bool is_available(uint region) const;
163
164 // Return the next region (by index) that is part of the same
165 // humongous object that hr is part of.
166 inline HeapRegion* next_region_in_humongous(HeapRegion* hr) const;
167
168 // If addr is within the committed space return its corresponding
169 // HeapRegion, otherwise return NULL.
170 inline HeapRegion* addr_to_region(HeapWord* addr) const;
171
172 // Insert the given region into the free region list.
173 inline void insert_into_free_list(HeapRegion* hr);
174
175 // Insert the given region list into the global free region list.
176 void insert_list_into_free_list(FreeRegionList* list) {
177 _free_list.add_ordered(list);
178 }
179
180 // Allocate a free region with specific node index. If fails allocate with next node index.
181 virtual HeapRegion* allocate_free_region(HeapRegionType type, uint requested_node_index);
182
183 inline void allocate_free_regions_starting_at(uint first, uint num_regions);
184
185 // Remove all regions from the free list.
186 void remove_all_free_regions() {
187 _free_list.remove_all();
188 }
189
190 // Return the number of committed free regions in the heap.
191 uint num_free_regions() const {
192 return _free_list.length();
193 }
194
195 size_t total_free_bytes() const {
196 return num_free_regions() * HeapRegion::GrainBytes;
197 }
198
199 // Return the number of available (uncommitted) regions.
200 uint available() const { return max_length() - length(); }
201
205 // Return the maximum number of regions in the heap.
206 uint max_length() const { return (uint)_regions.length(); }
207
208 // Return maximum number of regions that heap can expand to.
209 virtual uint max_expandable_length() const { return (uint)_regions.length(); }
210
211 MemoryUsage get_auxiliary_data_memory_usage() const;
212
213 MemRegion reserved() const { return MemRegion(heap_bottom(), heap_end()); }
214
215 // Expand the sequence to reflect that the heap has grown. Either create new
216 // HeapRegions, or re-use existing ones. Returns the number of regions the
217 // sequence was expanded by. If a HeapRegion allocation fails, the resulting
218 // number of regions might be smaller than what's desired.
219 virtual uint expand_by(uint num_regions, WorkGang* pretouch_workers);
220
221 // Makes sure that the regions from start to start+num_regions-1 are available
222 // for allocation. Returns the number of regions that were committed to achieve
223 // this.
224 virtual uint expand_at(uint start, uint num_regions, WorkGang* pretouch_workers);
225
226 // Try to expand on the given node index.
227 virtual uint expand_on_preferred_node(uint node_index);
228
229 // Find a contiguous set of empty regions of length num. Returns the start index of
230 // that set, or G1_NO_HRM_INDEX.
231 virtual uint find_contiguous_only_empty(size_t num) { return find_contiguous(num, true); }
232 // Find a contiguous set of empty or unavailable regions of length num. Returns the
233 // start index of that set, or G1_NO_HRM_INDEX.
234 virtual uint find_contiguous_empty_or_unavailable(size_t num) { return find_contiguous(num, false); }
235
236 HeapRegion* next_region_in_heap(const HeapRegion* r) const;
237
238 // Find the highest free or uncommitted region in the reserved heap,
239 // and if uncommitted, commit it. If none are available, return G1_NO_HRM_INDEX.
240 // Set the 'expanded' boolean true if a new region was committed.
241 virtual uint find_highest_free(bool* expanded);
242
243 // Allocate the regions that contain the address range specified, committing the
244 // regions if necessary. Return false if any of the regions is already committed
245 // and not free, and return the number of regions newly committed in commit_count.
246 bool allocate_containing_regions(MemRegion range, size_t* commit_count, WorkGang* pretouch_workers);
247
|