Searched defs:new_region (Results 1 - 5 of 5) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DcardTableExtension.cpp493 void CardTableExtension::resize_covered_region(MemRegion new_region) { argument
496 if (_covered[i].start() == new_region.start()) {
500 resize_covered_region_by_start(new_region);
503 if (_covered[i].start() > new_region.start()) {
510 if (_covered[j].end() == new_region.end()) {
515 assert(_covered[changed_region].byte_size() != new_region.byte_size(),
517 resize_covered_region_by_end(changed_region, new_region);
525 resize_covered_region_by_start(new_region);
528 void CardTableExtension::resize_covered_region_by_start(MemRegion new_region) {
529 CardTableModRefBS::resize_covered_region(new_region);
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A DcardTableRS.cpp66 void CardTableRS::resize_covered_region(MemRegion new_region) { argument
67 _ct_bs->resize_covered_region(new_region);
H A DcardTableModRefBS.cpp210 void CardTableModRefBS::resize_covered_region(MemRegion new_region) { argument
212 assert(_whole_heap.contains(new_region),
217 int const ind = find_covering_region_by_base(new_region.start());
219 assert(old_region.start() == new_region.start(), "just checking");
220 if (new_region.word_size() != old_region.word_size()) {
231 jbyte* const new_end = byte_after(new_region.last());
340 assert(index_for(new_region.last()) < _guard_index,
344 // jbyte* const end = byte_after(new_region.last());
346 assert((end >= byte_after(new_region.last())) || collided || guarded,
366 _covered[ind].set_word_size(new_region
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DmutableNUMASpace.cpp462 // |------------------new_region---------------------------------|
464 void MutableNUMASpace::select_tails(MemRegion new_region, MemRegion intersection, argument
467 if (new_region.start() < intersection.start()) { // Yes
471 if (new_region.contains(p)
472 && pointer_delta(p, new_region.start(), sizeof(char)) >= alignment()) {
480 *bottom_region = MemRegion(new_region.start(), intersection.start());
486 if (intersection.end() < new_region.end()) { // Yes
490 if (new_region.contains(p)
491 && pointer_delta(new_region.end(), p, sizeof(char)) >= alignment()) {
499 *top_region = MemRegion(intersection.end(), new_region
512 merge_regions(MemRegion new_region, MemRegion* intersection, MemRegion *invalid_region) argument
557 MemRegion old_region = region(), new_region; local
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A Dg1CollectedHeap.cpp568 HeapRegion* G1CollectedHeap::new_region(size_t word_size, bool do_expand) { function in class:G1CollectedHeap
632 HeapRegion* hr = new_region(word_size, false /* do_expand */);
6365 HeapRegion* new_alloc_region = new_region(word_size,
6424 HeapRegion* new_alloc_region = new_region(word_size,

Completed in 57 milliseconds