Mercurial > hg > truffle
view src/share/vm/gc_implementation/parallelScavenge/adjoiningVirtualSpaces.cpp @ 1359:23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
Summary: Make sure that two marking cycles do not overlap, i.e., a new one can only start after the concurrent marking thread finishes all its work. In the fix I piggy-back a couple of minor extra fixes: some general code reformatting for consistency (only around the code I modified), the removal of a field (G1CollectorPolicy::_should_initiate_conc_mark) which doesn't seem to be used at all (it's only set but never read), as well as moving the "is GC locker active" test earlier into the G1 pause / Full GC and using a more appropriate method for it.
Reviewed-by: johnc, jmasa, jcoomes, ysr
author | tonyp |
---|---|
date | Tue, 06 Apr 2010 10:59:45 -0400 |
parents | a61af66fc99e |
children | c18cbe5936b8 |
line wrap: on
line source
/* * Copyright 2003-2005 Sun Microsystems, Inc. All Rights Reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, * CA 95054 USA or visit www.sun.com if you need additional information or * have any questions. * */ # include "incls/_precompiled.incl" # include "incls/_adjoiningVirtualSpaces.cpp.incl" AdjoiningVirtualSpaces::AdjoiningVirtualSpaces(ReservedSpace rs, size_t min_low_byte_size, size_t min_high_byte_size, size_t alignment) : _reserved_space(rs), _min_low_byte_size(min_low_byte_size), _min_high_byte_size(min_high_byte_size), _low(0), _high(0), _alignment(alignment) {} // The maximum byte sizes are for the initial layout of the // virtual spaces and are not the limit on the maximum bytes sizes. void AdjoiningVirtualSpaces::initialize(size_t max_low_byte_size, size_t init_low_byte_size, size_t init_high_byte_size) { // The reserved spaces for the two parts of the virtual space. ReservedSpace old_rs = _reserved_space.first_part(max_low_byte_size); ReservedSpace young_rs = _reserved_space.last_part(max_low_byte_size); _low = new PSVirtualSpace(old_rs, alignment()); if (!_low->expand_by(init_low_byte_size)) { vm_exit_during_initialization("Could not reserve enough space for " "object heap"); } _high = new PSVirtualSpaceHighToLow(young_rs, alignment()); if (!_high->expand_by(init_high_byte_size)) { vm_exit_during_initialization("Could not reserve enough space for " "object heap"); } } bool AdjoiningVirtualSpaces::adjust_boundary_up(size_t change_in_bytes) { assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check"); size_t actual_change = low()->expand_into(high(), change_in_bytes); return actual_change != 0; } bool AdjoiningVirtualSpaces::adjust_boundary_down(size_t change_in_bytes) { assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check"); size_t actual_change = high()->expand_into(low(), change_in_bytes); return actual_change != 0; }