1 /*
   2  * Copyright (c) 2013, 2015, Red Hat, Inc. and/or its affiliates.
   3  *
   4  * This code is free software; you can redistribute it and/or modify it
   5  * under the terms of the GNU General Public License version 2 only, as
   6  * published by the Free Software Foundation.
   7  *
   8  * This code is distributed in the hope that it will be useful, but WITHOUT
   9  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  11  * version 2 for more details (a copy is included in the LICENSE file that
  12  * accompanied this code).
  13  *
  14  * You should have received a copy of the GNU General Public License version
  15  * 2 along with this work; if not, write to the Free Software Foundation,
  16  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  17  *
  18  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  19  * or visit www.oracle.com if you need additional information or have any
  20  * questions.
  21  *
  22  */
  23 
  24 #ifndef SHARE_VM_GC_SHENANDOAH_SHENANDOAHHEAPREGION_HPP
  25 #define SHARE_VM_GC_SHENANDOAH_SHENANDOAHHEAPREGION_HPP
  26 
  27 #include "gc/shared/space.hpp"
  28 #include "memory/universe.hpp"
  29 #include "utilities/sizes.hpp"
  30 
  31 class ShenandoahHeapRegion : public ContiguousSpace {
  32 private:
  33   static Monitor _mem_protect_lock;
  34 
  35 public:
  36   static size_t RegionSizeBytes;
  37   static size_t RegionSizeShift;
  38 
  39 private:
  40   ShenandoahHeap* _heap;
  41   size_t _region_number;
  42   volatile jint _live_data;
  43   MemRegion reserved;
  44 
  45   bool _humongous_start;
  46   bool _humongous_continuation;
  47 
  48   bool _recycled;
  49 
  50   HeapWord* _new_top;
  51 
  52   volatile jint _critical_pins;
  53 
  54 #ifdef ASSERT
  55   int _mem_protection_level;
  56 #endif
  57 
  58 public:
  59   ShenandoahHeapRegion(ShenandoahHeap* heap, HeapWord* start, size_t regionSize, size_t index);
  60 
  61   static void setup_heap_region_size(size_t initial_heap_size, size_t max_heap_size);
  62 
  63   size_t region_number() const;
  64 
  65   // Allocation (return NULL if full)
  66   inline HeapWord* allocate(size_t word_size);
  67 
  68   // Roll back the previous allocation of an object with specified size.
  69   // Returns TRUE when successful, FALSE if not successful or not supported.
  70   bool rollback_allocation(uint size);
  71 
  72   void clear_live_data();
  73   void set_live_data(size_t s);
  74   inline void increase_live_data_words(jint s);
  75 
  76   void set_recently_allocated(bool value);
  77   bool is_recently_allocated() const;
  78 
  79   bool has_live() const;
  80   size_t get_live_data_bytes() const;
  81   size_t get_live_data_words() const;
  82 
  83   void print_on(outputStream* st) const;
  84 
  85   size_t garbage() const;
  86 
  87   void recycle();
  88 
  89   void object_iterate_interruptible(ObjectClosure* blk, bool allow_cancel);
  90 
  91   HeapWord* object_iterate_careful(ObjectClosureCareful* cl);
  92 
  93   HeapWord* block_start_const(const void* p) const;
  94 
  95   // Just before GC we need to fill the current region.
  96   void fill_region();
  97 
  98   bool in_collection_set() const;
  99 
 100   void set_in_collection_set(bool b);
 101 
 102   void set_humongous_start(bool start);
 103   void set_humongous_continuation(bool continuation);
 104 
 105   bool is_humongous() const;
 106   bool is_humongous_start() const;
 107   bool is_humongous_continuation() const;
 108 
 109 #ifdef ASSERT
 110   void memProtectionOn();
 111   void memProtectionOff();
 112 #endif
 113 
 114   // The following are for humongous regions.  We need to save the
 115   markOop saved_mark_word;
 116   void save_mark_word(oop obj) {saved_mark_word = obj->mark();}
 117   markOop mark_word() {return saved_mark_word;}
 118 
 119   virtual CompactibleSpace* next_compaction_space() const;
 120 
 121   // Override for scan_and_forward support.
 122   void prepare_for_compaction(CompactPoint* cp);
 123   void adjust_pointers();
 124   void compact();
 125 
 126   void set_new_top(HeapWord* new_top) { _new_top = new_top; }
 127   HeapWord* new_top() const { return _new_top; }
 128 
 129   void pin();
 130   void unpin();
 131 
 132   bool is_pinned();
 133 
 134 };
 135 
 136 #endif // SHARE_VM_GC_SHENANDOAH_SHENANDOAHHEAPREGION_HPP