equal
deleted
inserted
replaced
24 |
24 |
25 #include "precompiled.hpp" |
25 #include "precompiled.hpp" |
26 #include "gc/g1/collectionSetChooser.hpp" |
26 #include "gc/g1/collectionSetChooser.hpp" |
27 #include "gc/g1/g1CollectedHeap.inline.hpp" |
27 #include "gc/g1/g1CollectedHeap.inline.hpp" |
28 #include "gc/shared/space.inline.hpp" |
28 #include "gc/shared/space.inline.hpp" |
29 #include "runtime/atomic.inline.hpp" |
29 #include "runtime/atomic.hpp" |
30 |
30 |
31 // Even though we don't use the GC efficiency in our heuristics as |
31 // Even though we don't use the GC efficiency in our heuristics as |
32 // much as we used to, we still order according to GC efficiency. This |
32 // much as we used to, we still order according to GC efficiency. This |
33 // will cause regions with a lot of live objects and large RSets to |
33 // will cause regions with a lot of live objects and large RSets to |
34 // end up at the end of the array. Given that we might skip collecting |
34 // end up at the end of the array. Given that we might skip collecting |