1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/gc_implementation/parallelScavenge/adjoiningVirtualSpaces.cpp Wed Apr 27 01:25:04 2016 +0800
1.3 @@ -0,0 +1,71 @@
1.4 +/*
1.5 + * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.23 + * or visit www.oracle.com if you need additional information or have any
1.24 + * questions.
1.25 + *
1.26 + */
1.27 +
1.28 +#include "precompiled.hpp"
1.29 +#include "gc_implementation/parallelScavenge/adjoiningVirtualSpaces.hpp"
1.30 +#include "memory/allocation.inline.hpp"
1.31 +#include "runtime/java.hpp"
1.32 +
1.33 +AdjoiningVirtualSpaces::AdjoiningVirtualSpaces(ReservedSpace rs,
1.34 + size_t min_low_byte_size,
1.35 + size_t min_high_byte_size,
1.36 + size_t alignment) :
1.37 + _reserved_space(rs), _min_low_byte_size(min_low_byte_size),
1.38 + _min_high_byte_size(min_high_byte_size), _low(0), _high(0),
1.39 + _alignment(alignment) {}
1.40 +
1.41 +// The maximum byte sizes are for the initial layout of the
1.42 +// virtual spaces and are not the limit on the maximum bytes sizes.
1.43 +void AdjoiningVirtualSpaces::initialize(size_t max_low_byte_size,
1.44 + size_t init_low_byte_size,
1.45 + size_t init_high_byte_size) {
1.46 +
1.47 + // The reserved spaces for the two parts of the virtual space.
1.48 + ReservedSpace old_rs = _reserved_space.first_part(max_low_byte_size);
1.49 + ReservedSpace young_rs = _reserved_space.last_part(max_low_byte_size);
1.50 +
1.51 + _low = new PSVirtualSpace(old_rs, alignment());
1.52 + if (!_low->expand_by(init_low_byte_size)) {
1.53 + vm_exit_during_initialization("Could not reserve enough space for "
1.54 + "object heap");
1.55 + }
1.56 +
1.57 + _high = new PSVirtualSpaceHighToLow(young_rs, alignment());
1.58 + if (!_high->expand_by(init_high_byte_size)) {
1.59 + vm_exit_during_initialization("Could not reserve enough space for "
1.60 + "object heap");
1.61 + }
1.62 +}
1.63 +
1.64 +bool AdjoiningVirtualSpaces::adjust_boundary_up(size_t change_in_bytes) {
1.65 + assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check");
1.66 + size_t actual_change = low()->expand_into(high(), change_in_bytes);
1.67 + return actual_change != 0;
1.68 +}
1.69 +
1.70 +bool AdjoiningVirtualSpaces::adjust_boundary_down(size_t change_in_bytes) {
1.71 + assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check");
1.72 + size_t actual_change = high()->expand_into(low(), change_in_bytes);
1.73 + return actual_change != 0;
1.74 +}
