1 /*
2 * Copyright (c) 2001, 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/g1/collectionSetChooser.hpp"
27 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
28 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
29 #include "gc_implementation/g1/g1ErgoVerbose.hpp"
30 #include "memory/space.inline.hpp"
31 #include "runtime/atomic.inline.hpp"
32
33 // Even though we don't use the GC efficiency in our heuristics as
34 // much as we used to, we still order according to GC efficiency. This
35 // will cause regions with a lot of live objects and large RSets to
36 // end up at the end of the array. Given that we might skip collecting
37 // the last few old regions, if after a few mixed GCs the remaining
38 // have reclaimable bytes under a certain threshold, the hope is that
39 // the ones we'll skip are ones with both large RSets and a lot of
40 // live objects, not the ones with just a lot of live objects if we
41 // ordered according to the amount of reclaimable bytes per region.
42 static int order_regions(HeapRegion* hr1, HeapRegion* hr2) {
43 if (hr1 == NULL) {
44 if (hr2 == NULL) {
45 return 0;
46 } else {
47 return 1;
48 }
49 } else if (hr2 == NULL) {
50 return -1;
|
1 /*
2 * Copyright (c) 2001, 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/g1/collectionSetChooser.hpp"
27 #include "gc/g1/g1CollectedHeap.inline.hpp"
28 #include "gc/g1/g1CollectorPolicy.hpp"
29 #include "gc/g1/g1ErgoVerbose.hpp"
30 #include "gc/shared/space.inline.hpp"
31 #include "runtime/atomic.inline.hpp"
32
33 // Even though we don't use the GC efficiency in our heuristics as
34 // much as we used to, we still order according to GC efficiency. This
35 // will cause regions with a lot of live objects and large RSets to
36 // end up at the end of the array. Given that we might skip collecting
37 // the last few old regions, if after a few mixed GCs the remaining
38 // have reclaimable bytes under a certain threshold, the hope is that
39 // the ones we'll skip are ones with both large RSets and a lot of
40 // live objects, not the ones with just a lot of live objects if we
41 // ordered according to the amount of reclaimable bytes per region.
42 static int order_regions(HeapRegion* hr1, HeapRegion* hr2) {
43 if (hr1 == NULL) {
44 if (hr2 == NULL) {
45 return 0;
46 } else {
47 return 1;
48 }
49 } else if (hr2 == NULL) {
50 return -1;
|