duke@435: /*
stefank@2314:  * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "gc_implementation/parallelScavenge/adjoiningVirtualSpaces.hpp"
stefank@4336: #include "memory/allocation.inline.hpp"
stefank@2314: #include "runtime/java.hpp"
duke@435: 
duke@435: AdjoiningVirtualSpaces::AdjoiningVirtualSpaces(ReservedSpace rs,
duke@435:                                                size_t min_low_byte_size,
duke@435:                                                size_t min_high_byte_size,
duke@435:                                                size_t alignment) :
duke@435:   _reserved_space(rs), _min_low_byte_size(min_low_byte_size),
duke@435:   _min_high_byte_size(min_high_byte_size), _low(0), _high(0),
duke@435:   _alignment(alignment) {}
duke@435: 
duke@435: // The maximum byte sizes are for the initial layout of the
duke@435: // virtual spaces and are not the limit on the maximum bytes sizes.
duke@435: void AdjoiningVirtualSpaces::initialize(size_t max_low_byte_size,
duke@435:                                         size_t init_low_byte_size,
duke@435:                                         size_t init_high_byte_size) {
duke@435: 
duke@435:   // The reserved spaces for the two parts of the virtual space.
duke@435:   ReservedSpace old_rs   = _reserved_space.first_part(max_low_byte_size);
duke@435:   ReservedSpace young_rs = _reserved_space.last_part(max_low_byte_size);
duke@435: 
duke@435:   _low = new PSVirtualSpace(old_rs, alignment());
duke@435:   if (!_low->expand_by(init_low_byte_size)) {
duke@435:     vm_exit_during_initialization("Could not reserve enough space for "
duke@435:                                   "object heap");
duke@435:   }
duke@435: 
duke@435:   _high = new PSVirtualSpaceHighToLow(young_rs, alignment());
duke@435:   if (!_high->expand_by(init_high_byte_size)) {
duke@435:     vm_exit_during_initialization("Could not reserve enough space for "
duke@435:                                   "object heap");
duke@435:   }
duke@435: }
duke@435: 
duke@435: bool AdjoiningVirtualSpaces::adjust_boundary_up(size_t change_in_bytes) {
duke@435:   assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check");
duke@435:   size_t actual_change = low()->expand_into(high(), change_in_bytes);
duke@435:   return actual_change != 0;
duke@435: }
duke@435: 
duke@435: bool AdjoiningVirtualSpaces::adjust_boundary_down(size_t change_in_bytes) {
duke@435:   assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check");
duke@435:   size_t actual_change = high()->expand_into(low(), change_in_bytes);
duke@435:   return actual_change != 0;
duke@435: }