truffle: src/share/vm/gc_implementation/g1/heapRegionSeq.cpp annotate

annotate src/share/vm/gc_implementation/g1/heapRegionSeq.cpp @ 2133:2250ee17e258

7007068: G1: refine the BOT during evac failure handling Summary: During evacuation failure handling we refine the BOT to reflect the location of all the objects in the regions we scan. The changeset includes some minor cleanup: a) non-product print_on() method on the G1 BOT class, b) added more complete BOT verification during heap / region verification, c) slight modification to the BOT set up for humongous regions to be more consistent with the BOT set up during evac failure handling, and d) removed a couple of unused methods. Reviewed-by: johnc, ysr

author	tonyp
date	Wed, 12 Jan 2011 13:06:00 -0500
parents	f95d63e2154a
children	0fa27f37d4d4

rev	line source
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	1 /*
2133 2250ee17e258 7007068: G1: refine the BOT during evac failure handling tonyp parents: 1972 diff changeset	2 * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved.
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	4 *
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	5 * This code is free software; you can redistribute it and/or modify it
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	6 * under the terms of the GNU General Public License version 2 only, as
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	7 * published by the Free Software Foundation.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	8 *
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	9 * This code is distributed in the hope that it will be useful, but WITHOUT
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	12 * version 2 for more details (a copy is included in the LICENSE file that
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	13 * accompanied this code).
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	14 *
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	15 * You should have received a copy of the GNU General Public License version
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	16 * 2 along with this work; if not, write to the Free Software Foundation,
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	18 *
1552 c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 960 diff changeset	19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 960 diff changeset	20 * or visit www.oracle.com if you need additional information or have any
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories trims parents: 960 diff changeset	21 * questions.
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	22 *
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	23 */
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	24
1972 f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1886 diff changeset	25 #include "precompiled.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1886 diff changeset	26 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1886 diff changeset	27 #include "gc_implementation/g1/heapRegionSeq.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot stefank parents: 1886 diff changeset	28 #include "memory/allocation.hpp"
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	29
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	30 // Local to this file.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	31
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	32 static int orderRegions(HeapRegion hr1p, HeapRegion hr2p) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	33 if ((hr1p)->end() <= (hr2p)->bottom()) return -1;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	34 else if ((hr2p)->end() <= (hr1p)->bottom()) return 1;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	35 else if (hr1p == hr2p) return 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	36 else {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	37 assert(false, "We should never compare distinct overlapping regions.");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	38 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	39 return 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	40 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	41
393 078b8a0d8d7c 6758633: G1: SEGV with GCOld on Linux iveresov parents: 342 diff changeset	42 HeapRegionSeq::HeapRegionSeq(const size_t max_size) :
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	43 _alloc_search_start(0),
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	44 // The line below is the worst bit of C++ hackery I've ever written
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	45 // (Detlefs, 11/23). You should think of it as equivalent to
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	46 // "_regions(100, true)": initialize the growable array and inform it
1688 2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	47 // that it should allocate its elem array(s) on the C heap.
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	48 //
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	49 // The first argument, however, is actually a comma expression
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	50 // (set_allocation_type(this, C_HEAP), 100). The purpose of the
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	51 // set_allocation_type() call is to replace the default allocation
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	52 // type for embedded objects STACK_OR_EMBEDDED with C_HEAP. It will
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	53 // allow to pass the assert in GenericGrowableArray() which checks
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	54 // that a growable array object must be on C heap if elements are.
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	55 //
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	56 // Note: containing object is allocated on C heap since it is CHeapObj.
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	57 //
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	58 _regions((ResourceObj::set_allocation_type((address)&_regions,
2dfd013a7465 6975078: assert(allocated_on_res_area() \|\| allocated_on_C_heap() \|\| allocated_on_arena() kvn parents: 1552 diff changeset	59 ResourceObj::C_HEAP),
393 078b8a0d8d7c 6758633: G1: SEGV with GCOld on Linux iveresov parents: 342 diff changeset	60 (int)max_size),
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	61 true),
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	62 _next_rr_candidate(0),
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	63 _seq_bottom(NULL)
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	64 {}
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	65
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	66 // Private methods.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	67
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	68 HeapWord*
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	69 HeapRegionSeq::alloc_obj_from_region_index(int ind, size_t word_size) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	70 assert(G1CollectedHeap::isHumongous(word_size),
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	71 "Allocation size should be humongous");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	72 int cur = ind;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	73 int first = cur;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	74 size_t sumSizes = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	75 while (cur < _regions.length() && sumSizes < word_size) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	76 // Loop invariant:
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	77 // For all i in [first, cur):
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	78 // _regions.at(i)->is_empty()
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	79 // && _regions.at(i) is contiguous with its predecessor, if any
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	80 // && sumSizes is the sum of the sizes of the regions in the interval
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	81 // [first, cur)
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	82 HeapRegion* curhr = _regions.at(cur);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	83 if (curhr->is_empty()
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	84 && (first == cur
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	85 \|\| (_regions.at(cur-1)->end() ==
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	86 curhr->bottom()))) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	87 sumSizes += curhr->capacity() / HeapWordSize;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	88 } else {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	89 first = cur + 1;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	90 sumSizes = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	91 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	92 cur++;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	93 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	94 if (sumSizes >= word_size) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	95 _alloc_search_start = cur;
1886 72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	96
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	97 // We need to initialize the region(s) we just discovered. This is
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	98 // a bit tricky given that it can happen concurrently with
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	99 // refinement threads refining cards on these regions and
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	100 // potentially wanting to refine the BOT as they are scanning
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	101 // those cards (this can happen shortly after a cleanup; see CR
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	102 // 6991377). So we have to set up the region(s) carefully and in
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	103 // a specific order.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	104
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	105 // Currently, allocs_are_zero_filled() returns false. The zero
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	106 // filling infrastructure will be going away soon (see CR 6977804).
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	107 // So no need to do anything else here.
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	108 bool zf = G1CollectedHeap::heap()->allocs_are_zero_filled();
1886 72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	109 assert(!zf, "not supported");
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	110
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	111 // This will be the "starts humongous" region.
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	112 HeapRegion* first_hr = _regions.at(first);
1886 72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	113 {
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	114 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag);
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	115 first_hr->set_zero_fill_allocated();
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	116 }
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	117 // The header of the new object will be placed at the bottom of
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	118 // the first region.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	119 HeapWord* new_obj = first_hr->bottom();
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	120 // This will be the new end of the first region in the series that
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	121 // should also match the end of the last region in the seriers.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	122 // (Note: sumSizes = "region size" x "number of regions we found").
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	123 HeapWord* new_end = new_obj + sumSizes;
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	124 // This will be the new top of the first region that will reflect
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	125 // this allocation.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	126 HeapWord* new_top = new_obj + word_size;
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	127
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	128 // First, we need to zero the header of the space that we will be
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	129 // allocating. When we update top further down, some refinement
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	130 // threads might try to scan the region. By zeroing the header we
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	131 // ensure that any thread that will try to scan the region will
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	132 // come across the zero klass word and bail out.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	133 //
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	134 // NOTE: It would not have been correct to have used
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	135 // CollectedHeap::fill_with_object() and make the space look like
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	136 // an int array. The thread that is doing the allocation will
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	137 // later update the object header to a potentially different array
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	138 // type and, for a very short period of time, the klass and length
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	139 // fields will be inconsistent. This could cause a refinement
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	140 // thread to calculate the object size incorrectly.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	141 Copy::fill_to_words(new_obj, oopDesc::header_size(), 0);
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	142
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	143 // We will set up the first region as "starts humongous". This
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	144 // will also update the BOT covering all the regions to reflect
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	145 // that there is a single object that starts at the bottom of the
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	146 // first region.
2133 2250ee17e258 7007068: G1: refine the BOT during evac failure handling tonyp parents: 1972 diff changeset	147 first_hr->set_startsHumongous(new_top, new_end);
1886 72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	148
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	149 // Then, if there are any, we will set up the "continues
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	150 // humongous" regions.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	151 HeapRegion* hr = NULL;
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	152 for (int i = first + 1; i < cur; ++i) {
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	153 hr = _regions.at(i);
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	154 {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	155 MutexLockerEx x(ZF_mon, Mutex::_no_safepoint_check_flag);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	156 hr->set_zero_fill_allocated();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	157 }
1886 72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	158 hr->set_continuesHumongous(first_hr);
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	159 }
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	160 // If we have "continues humongous" regions (hr != NULL), then the
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	161 // end of the last one should match new_end.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	162 assert(hr == NULL \|\| hr->end() == new_end, "sanity");
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	163
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	164 // Up to this point no concurrent thread would have been able to
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	165 // do any scanning on any region in this series. All the top
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	166 // fields still point to bottom, so the intersection between
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	167 // [bottom,top] and [card_start,card_end] will be empty. Before we
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	168 // update the top fields, we'll do a storestore to make sure that
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	169 // no thread sees the update to top before the zeroing of the
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	170 // object header and the BOT initialization.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	171 OrderAccess::storestore();
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	172
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	173 // Now that the BOT and the object header have been initialized,
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	174 // we can update top of the "starts humongous" region.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	175 assert(first_hr->bottom() < new_top && new_top <= first_hr->end(),
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	176 "new_top should be in this region");
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	177 first_hr->set_top(new_top);
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	178
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	179 // Now, we will update the top fields of the "continues humongous"
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	180 // regions. The reason we need to do this is that, otherwise,
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	181 // these regions would look empty and this will confuse parts of
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	182 // G1. For example, the code that looks for a consecutive number
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	183 // of empty regions will consider them empty and try to
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	184 // re-allocate them. We can extend is_empty() to also include
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	185 // !continuesHumongous(), but it is easier to just update the top
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	186 // fields here.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	187 hr = NULL;
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	188 for (int i = first + 1; i < cur; ++i) {
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	189 hr = _regions.at(i);
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	190 if ((i + 1) == cur) {
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	191 // last continues humongous region
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	192 assert(hr->bottom() < new_top && new_top <= hr->end(),
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	193 "new_top should fall on this region");
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	194 hr->set_top(new_top);
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	195 } else {
1886 72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	196 // not last one
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	197 assert(new_top > hr->end(), "new_top should be above this region");
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	198 hr->set_top(hr->end());
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	199 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	200 }
1886 72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	201 // If we have continues humongous regions (hr != NULL), then the
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	202 // end of the last one should match new_end and its top should
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	203 // match new_top.
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	204 assert(hr == NULL \|\|
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	205 (hr->end() == new_end && hr->top() == new_top), "sanity");
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	206
72a161e62cc4 6991377: G1: race between concurrent refinement and humongous object allocation tonyp parents: 1688 diff changeset	207 return new_obj;
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	208 } else {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	209 // If we started from the beginning, we want to know why we can't alloc.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	210 return NULL;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	211 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	212 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	213
677 96b229c54d1e 6543938: G1: remove the concept of popularity apetrusenko parents: 579 diff changeset	214 void HeapRegionSeq::print_empty_runs() {
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	215 int empty_run = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	216 int n_empty = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	217 int empty_run_start;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	218 for (int i = 0; i < _regions.length(); i++) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	219 HeapRegion* r = _regions.at(i);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	220 if (r->continuesHumongous()) continue;
677 96b229c54d1e 6543938: G1: remove the concept of popularity apetrusenko parents: 579 diff changeset	221 if (r->is_empty()) {
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	222 assert(!r->isHumongous(), "H regions should not be empty.");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	223 if (empty_run == 0) empty_run_start = i;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	224 empty_run++;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	225 n_empty++;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	226 } else {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	227 if (empty_run > 0) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	228 gclog_or_tty->print(" %d:%d", empty_run_start, empty_run);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	229 empty_run = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	230 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	231 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	232 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	233 if (empty_run > 0) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	234 gclog_or_tty->print(" %d:%d", empty_run_start, empty_run);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	235 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	236 gclog_or_tty->print_cr(" [tot = %d]", n_empty);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	237 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	238
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	239 int HeapRegionSeq::find(HeapRegion* hr) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	240 // FIXME: optimized for adjacent regions of fixed size.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	241 int ind = hr->hrs_index();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	242 if (ind != -1) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	243 assert(_regions.at(ind) == hr, "Mismatch");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	244 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	245 return ind;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	246 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	247
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	248
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	249 // Public methods.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	250
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	251 void HeapRegionSeq::insert(HeapRegion* hr) {
393 078b8a0d8d7c 6758633: G1: SEGV with GCOld on Linux iveresov parents: 342 diff changeset	252 assert(!_regions.is_full(), "Too many elements in HeapRegionSeq");
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	253 if (_regions.length() == 0
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	254 \|\| _regions.top()->end() <= hr->bottom()) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	255 hr->set_hrs_index(_regions.length());
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	256 _regions.append(hr);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	257 } else {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	258 _regions.append(hr);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	259 _regions.sort(orderRegions);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	260 for (int i = 0; i < _regions.length(); i++) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	261 _regions.at(i)->set_hrs_index(i);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	262 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	263 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	264 char* bot = (char*)_regions.at(0)->bottom();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	265 if (_seq_bottom == NULL \|\| bot < _seq_bottom) _seq_bottom = bot;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	266 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	267
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	268 size_t HeapRegionSeq::length() {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	269 return _regions.length();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	270 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	271
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	272 size_t HeapRegionSeq::free_suffix() {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	273 size_t res = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	274 int first = _regions.length() - 1;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	275 int cur = first;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	276 while (cur >= 0 &&
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	277 (_regions.at(cur)->is_empty()
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	278 && (first == cur
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	279 \|\| (_regions.at(cur+1)->bottom() ==
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	280 _regions.at(cur)->end())))) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	281 res++;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	282 cur--;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	283 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	284 return res;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	285 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	286
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	287 HeapWord* HeapRegionSeq::obj_allocate(size_t word_size) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	288 int cur = _alloc_search_start;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	289 // Make sure "cur" is a valid index.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	290 assert(cur >= 0, "Invariant.");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	291 HeapWord* res = alloc_obj_from_region_index(cur, word_size);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	292 if (res == NULL)
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	293 res = alloc_obj_from_region_index(0, word_size);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	294 return res;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	295 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	296
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	297 void HeapRegionSeq::iterate(HeapRegionClosure* blk) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	298 iterate_from((HeapRegion*)NULL, blk);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	299 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	300
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	301 // The first argument r is the heap region at which iteration begins.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	302 // This operation runs fastest when r is NULL, or the heap region for
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	303 // which a HeapRegionClosure most recently returned true, or the
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	304 // heap region immediately to its right in the sequence. In all
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	305 // other cases a linear search is required to find the index of r.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	306
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	307 void HeapRegionSeq::iterate_from(HeapRegion* r, HeapRegionClosure* blk) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	308
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	309 // :::: FIXME ::::
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	310 // Static cache value is bad, especially when we start doing parallel
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	311 // remembered set update. For now just don't cache anything (the
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	312 // code in the def'd out blocks).
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	313
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	314 #if 0
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	315 static int cached_j = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	316 #endif
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	317 int len = _regions.length();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	318 int j = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	319 // Find the index of r.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	320 if (r != NULL) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	321 #if 0
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	322 assert(cached_j >= 0, "Invariant.");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	323 if ((cached_j < len) && (r == _regions.at(cached_j))) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	324 j = cached_j;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	325 } else if ((cached_j + 1 < len) && (r == _regions.at(cached_j + 1))) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	326 j = cached_j + 1;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	327 } else {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	328 j = find(r);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	329 #endif
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	330 if (j < 0) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	331 j = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	332 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	333 #if 0
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	334 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	335 #endif
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	336 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	337 int i;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	338 for (i = j; i < len; i += 1) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	339 int res = blk->doHeapRegion(_regions.at(i));
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	340 if (res) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	341 #if 0
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	342 cached_j = i;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	343 #endif
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	344 blk->incomplete();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	345 return;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	346 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	347 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	348 for (i = 0; i < j; i += 1) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	349 int res = blk->doHeapRegion(_regions.at(i));
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	350 if (res) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	351 #if 0
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	352 cached_j = i;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	353 #endif
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	354 blk->incomplete();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	355 return;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	356 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	357 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	358 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	359
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	360 void HeapRegionSeq::iterate_from(int idx, HeapRegionClosure* blk) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	361 int len = _regions.length();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	362 int i;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	363 for (i = idx; i < len; i++) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	364 if (blk->doHeapRegion(_regions.at(i))) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	365 blk->incomplete();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	366 return;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	367 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	368 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	369 for (i = 0; i < idx; i++) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	370 if (blk->doHeapRegion(_regions.at(i))) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	371 blk->incomplete();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	372 return;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	373 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	374 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	375 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	376
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	377 MemRegion HeapRegionSeq::shrink_by(size_t shrink_bytes,
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	378 size_t& num_regions_deleted) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	379 assert(shrink_bytes % os::vm_page_size() == 0, "unaligned");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	380 assert(shrink_bytes % HeapRegion::GrainBytes == 0, "unaligned");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	381
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	382 if (_regions.length() == 0) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	383 num_regions_deleted = 0;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	384 return MemRegion();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	385 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	386 int j = _regions.length() - 1;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	387 HeapWord* end = _regions.at(j)->end();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	388 HeapWord* last_start = end;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	389 while (j >= 0 && shrink_bytes > 0) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	390 HeapRegion* cur = _regions.at(j);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	391 // We have to leave humongous regions where they are,
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	392 // and work around them.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	393 if (cur->isHumongous()) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	394 return MemRegion(last_start, end);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	395 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	396 assert(cur == _regions.top(), "Should be top");
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	397 if (!cur->is_empty()) break;
960 eb058abd0562 6861557: G1: assert(top() == bottom() \|\| zfs == Allocated,"Region must be empty, or ...") ysr parents: 677 diff changeset	398 cur->reset_zero_fill();
342 37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	399 shrink_bytes -= cur->capacity();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	400 num_regions_deleted++;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	401 _regions.pop();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	402 last_start = cur->bottom();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	403 // We need to delete these somehow, but can't currently do so here: if
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	404 // we do, the ZF thread may still access the deleted region. We'll
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	405 // leave this here as a reminder that we have to do something about
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	406 // this.
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	407 // delete cur;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	408 j--;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	409 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	410 return MemRegion(last_start, end);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	411 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	412
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	413
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	414 class PrintHeapRegionClosure : public HeapRegionClosure {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	415 public:
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	416 bool doHeapRegion(HeapRegion* r) {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	417 gclog_or_tty->print(PTR_FORMAT ":", r);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	418 r->print();
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	419 return false;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	420 }
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	421 };
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	422
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	423 void HeapRegionSeq::print() {
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	424 PrintHeapRegionClosure cl;
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	425 iterate(&cl);
37f87013dfd8 6711316: Open source the Garbage-First garbage collector ysr parents: diff changeset	426 }

Mercurial > hg > truffle

annotate src/share/vm/gc_implementation/g1/heapRegionSeq.cpp @ 2133:2250ee17e258