21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_GC_PARALLEL_PSSCAVENGE_INLINE_HPP
  26 #define SHARE_VM_GC_PARALLEL_PSSCAVENGE_INLINE_HPP
  27 
  28 #include "gc/parallel/cardTableExtension.hpp"
  29 #include "gc/parallel/parallelScavengeHeap.hpp"
  30 #include "gc/parallel/psPromotionManager.inline.hpp"
  31 #include "gc/parallel/psScavenge.hpp"
  32 #include "logging/log.hpp"
  33 #include "memory/iterator.hpp"
  34 #include "utilities/globalDefinitions.hpp"
  35 
  36 inline void PSScavenge::save_to_space_top_before_gc() {
  37   ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
  38   _to_space_top_before_gc = heap->young_gen()->to_space()->top();
  39 }
  40 









  41 template <class T> inline bool PSScavenge::should_scavenge(T* p) {
  42   T heap_oop = oopDesc::load_heap_oop(p);
  43   return PSScavenge::is_obj_in_young(heap_oop);
  44 }
  45 
  46 template <class T>
  47 inline bool PSScavenge::should_scavenge(T* p, MutableSpace* to_space) {
  48   if (should_scavenge(p)) {
  49     oop obj = oopDesc::load_decode_heap_oop_not_null(p);
  50     // Skip objects copied to to_space since the scavenge started.
  51     HeapWord* const addr = (HeapWord*)obj;
  52     return addr < to_space_top_before_gc() || addr >= to_space->end();
  53   }
  54   return false;
  55 }
  56 
  57 template <class T>
  58 inline bool PSScavenge::should_scavenge(T* p, bool check_to_space) {
  59   if (check_to_space) {
  60     ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();

  21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_GC_PARALLEL_PSSCAVENGE_INLINE_HPP
  26 #define SHARE_VM_GC_PARALLEL_PSSCAVENGE_INLINE_HPP
  27 
  28 #include "gc/parallel/cardTableExtension.hpp"
  29 #include "gc/parallel/parallelScavengeHeap.hpp"
  30 #include "gc/parallel/psPromotionManager.inline.hpp"
  31 #include "gc/parallel/psScavenge.hpp"
  32 #include "logging/log.hpp"
  33 #include "memory/iterator.hpp"
  34 #include "utilities/globalDefinitions.hpp"
  35 
  36 inline void PSScavenge::save_to_space_top_before_gc() {
  37   ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
  38   _to_space_top_before_gc = heap->young_gen()->to_space()->top();
  39 }
  40 
  41 // Adaptive size policy support.  When the young generation/old generation
  42 // boundary moves, _young_generation_boundary must be reset
  43 void PSScavenge::set_young_generation_boundary(HeapWord* v) {
  44   _young_generation_boundary = v;
  45   if (UseCompressedOops) {
  46     _young_generation_boundary_compressed = (uintptr_t)oopDesc::encode_heap_oop((oop)v);
  47   }
  48 }
  49 
  50 template <class T> inline bool PSScavenge::should_scavenge(T* p) {
  51   T heap_oop = oopDesc::load_heap_oop(p);
  52   return PSScavenge::is_obj_in_young(heap_oop);
  53 }
  54 
  55 template <class T>
  56 inline bool PSScavenge::should_scavenge(T* p, MutableSpace* to_space) {
  57   if (should_scavenge(p)) {
  58     oop obj = oopDesc::load_decode_heap_oop_not_null(p);
  59     // Skip objects copied to to_space since the scavenge started.
  60     HeapWord* const addr = (HeapWord*)obj;
  61     return addr < to_space_top_before_gc() || addr >= to_space->end();
  62   }
  63   return false;
  64 }
  65 
  66 template <class T>
  67 inline bool PSScavenge::should_scavenge(T* p, bool check_to_space) {
  68   if (check_to_space) {
  69     ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();