src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.cpp

changeset 5369
71180a6e5080
parent 5166
7c5a1b62f53d
child 6337
ab36007d6358
child 6493
3205e78d8193
equal deleted inserted replaced
5338:cedf20e2a655 5369:71180a6e5080
2014 */ \ 2014 */ \
2015 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); \ 2015 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); \
2016 } 2016 }
2017 2017
2018 ALL_SINCE_SAVE_MARKS_CLOSURES(CFLS_OOP_SINCE_SAVE_MARKS_DEFN) 2018 ALL_SINCE_SAVE_MARKS_CLOSURES(CFLS_OOP_SINCE_SAVE_MARKS_DEFN)
2019
2020
2021 void CompactibleFreeListSpace::object_iterate_since_last_GC(ObjectClosure* cl) {
2022 // ugghh... how would one do this efficiently for a non-contiguous space?
2023 guarantee(false, "NYI");
2024 }
2025 2019
2026 bool CompactibleFreeListSpace::linearAllocationWouldFail() const { 2020 bool CompactibleFreeListSpace::linearAllocationWouldFail() const {
2027 return _smallLinearAllocBlock._word_size == 0; 2021 return _smallLinearAllocBlock._word_size == 0;
2028 } 2022 }
2029 2023

mercurial