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