1 /*
2 * Copyright (c) 2003, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc_implementation/parallelScavenge/adjoiningGenerations.hpp"
27 #include "gc_implementation/parallelScavenge/adjoiningVirtualSpaces.hpp"
28 #include "gc_implementation/parallelScavenge/generationSizer.hpp"
29 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
30
31 // If boundary moving is being used, create the young gen and old
32 // gen with ASPSYoungGen and ASPSOldGen, respectively. Revert to
33 // the old behavior otherwise (with PSYoungGen and PSOldGen).
34
35 AdjoiningGenerations::AdjoiningGenerations(ReservedSpace old_young_rs,
36 GenerationSizer* policy,
37 size_t alignment) :
38 _virtual_spaces(old_young_rs, policy->min_old_size(),
39 policy->min_young_size(), alignment) {
40 size_t init_low_byte_size = policy->initial_old_size();
41 size_t min_low_byte_size = policy->min_old_size();
42 size_t max_low_byte_size = policy->max_old_size();
43 size_t init_high_byte_size = policy->initial_young_size();
44 size_t min_high_byte_size = policy->min_young_size();
45 size_t max_high_byte_size = policy->max_young_size();
46
47 assert(min_low_byte_size <= init_low_byte_size &&
48 init_low_byte_size <= max_low_byte_size, "Parameter check");
49 assert(min_high_byte_size <= init_high_byte_size &&
|
1 /*
2 * Copyright (c) 2003, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/parallel/adjoiningGenerations.hpp"
27 #include "gc/parallel/adjoiningVirtualSpaces.hpp"
28 #include "gc/parallel/generationSizer.hpp"
29 #include "gc/parallel/parallelScavengeHeap.hpp"
30
31 // If boundary moving is being used, create the young gen and old
32 // gen with ASPSYoungGen and ASPSOldGen, respectively. Revert to
33 // the old behavior otherwise (with PSYoungGen and PSOldGen).
34
35 AdjoiningGenerations::AdjoiningGenerations(ReservedSpace old_young_rs,
36 GenerationSizer* policy,
37 size_t alignment) :
38 _virtual_spaces(old_young_rs, policy->min_old_size(),
39 policy->min_young_size(), alignment) {
40 size_t init_low_byte_size = policy->initial_old_size();
41 size_t min_low_byte_size = policy->min_old_size();
42 size_t max_low_byte_size = policy->max_old_size();
43 size_t init_high_byte_size = policy->initial_young_size();
44 size_t min_high_byte_size = policy->min_young_size();
45 size_t max_high_byte_size = policy->max_young_size();
46
47 assert(min_low_byte_size <= init_low_byte_size &&
48 init_low_byte_size <= max_low_byte_size, "Parameter check");
49 assert(min_high_byte_size <= init_high_byte_size &&
|