< prev index next >

src/hotspot/share/cds/archiveUtils.hpp

Print this page

 34 #include "runtime/semaphore.hpp"
 35 #include "utilities/bitMap.hpp"
 36 #include "utilities/exceptions.hpp"
 37 #include "utilities/macros.hpp"
 38 
 39 class BootstrapInfo;
 40 class ReservedSpace;
 41 class VirtualSpace;
 42 
 43 template<class E> class Array;
 44 template<class E> class GrowableArray;
 45 
 46 // ArchivePtrMarker is used to mark the location of pointers embedded in a CDS archive. E.g., when an
 47 // InstanceKlass k is dumped, we mark the location of the k->_name pointer by effectively calling
 48 // mark_pointer(/*ptr_loc=*/&k->_name). It's required that (_prt_base <= ptr_loc < _ptr_end). _ptr_base is
 49 // fixed, but _ptr_end can be expanded as more objects are dumped.
 50 class ArchivePtrMarker : AllStatic {
 51   static CHeapBitMap*  _ptrmap;
 52   static CHeapBitMap*  _rw_ptrmap;
 53   static CHeapBitMap*  _ro_ptrmap;

 54   static VirtualSpace* _vs;
 55 
 56   // Once _ptrmap is compacted, we don't allow bit marking anymore. This is to
 57   // avoid unintentional copy operations after the bitmap has been finalized and written.
 58   static bool         _compacted;
 59 
 60   static address* ptr_base() { return (address*)_vs->low();  } // committed lower bound (inclusive)
 61   static address* ptr_end()  { return (address*)_vs->high(); } // committed upper bound (exclusive)
 62 
 63 public:
 64   static void initialize(CHeapBitMap* ptrmap, VirtualSpace* vs);
 65   static void initialize_rw_ro_maps(CHeapBitMap* rw_ptrmap, CHeapBitMap* ro_ptrmap);
 66   static void mark_pointer(address* ptr_loc);
 67   static void clear_pointer(address* ptr_loc);
 68   static void compact(address relocatable_base, address relocatable_end);
 69   static void compact(size_t max_non_null_offset);
 70 
 71   template <typename T>
 72   static void mark_pointer(T* ptr_loc) {
 73     mark_pointer((address*)ptr_loc);
 74   }
 75 
 76   template <typename T>
 77   static void set_and_mark_pointer(T* ptr_loc, T ptr_value) {
 78     *ptr_loc = ptr_value;
 79     mark_pointer(ptr_loc);
 80   }
 81 
 82   static CHeapBitMap* ptrmap() {
 83     return _ptrmap;
 84   }
 85 
 86   static CHeapBitMap* rw_ptrmap() {
 87     return _rw_ptrmap;
 88   }
 89 
 90   static CHeapBitMap* ro_ptrmap() {
 91     return _ro_ptrmap;
 92   }
 93 




 94   static void reset_map_and_vs() {
 95     _ptrmap = nullptr;
 96     _rw_ptrmap = nullptr;
 97     _ro_ptrmap = nullptr;

 98     _vs = nullptr;
 99   }
100 };
101 
102 // SharedDataRelocator is used to shift pointers in the CDS archive.
103 //
104 // The CDS archive is basically a contiguous block of memory (divided into several regions)
105 // that contains multiple objects. The objects may contain direct pointers that point to other objects
106 // within the archive (e.g., InstanceKlass::_name points to a Symbol in the archive). During dumping, we
107 // built a bitmap that marks the locations of all these pointers (using ArchivePtrMarker, see comments above).
108 //
109 // The contents of the archive assumes that it's mapped at the default SharedBaseAddress (e.g. 0x800000000).
110 // If the archive ends up being mapped at a different address (e.g. 0x810000000), SharedDataRelocator
111 // is used to shift each marked pointer by a delta (0x10000000 in this example), so that it points to
112 // the actually mapped location of the target object.
113 class SharedDataRelocator: public BitMapClosure {
114   // for all (address** p), where (is_marked(p) && _patch_base <= p && p < _patch_end) { *p += delta; }
115 
116   // Patch all pointers within this region that are marked.
117   address* _patch_base;

254   char* region_top() { return nullptr; }
255 };
256 
257 class ArchiveUtils {
258   template <typename T> static Array<T>* archive_non_ptr_array(GrowableArray<T>* tmp_array);
259   template <typename T> static Array<T>* archive_ptr_array(GrowableArray<T>* tmp_array);
260 
261 public:
262   static void log_to_classlist(BootstrapInfo* bootstrap_specifier, TRAPS) NOT_CDS_RETURN;
263   static bool has_aot_initialized_mirror(InstanceKlass* src_ik);
264 
265   template <typename T, ENABLE_IF(!std::is_pointer<T>::value)>
266   static Array<T>* archive_array(GrowableArray<T>* tmp_array) {
267     return archive_non_ptr_array(tmp_array);
268   }
269 
270   template <typename T, ENABLE_IF(std::is_pointer<T>::value)>
271   static Array<T>* archive_array(GrowableArray<T>* tmp_array) {
272     return archive_ptr_array(tmp_array);
273   }






274 };
275 
276 class HeapRootSegments {
277 private:
278   size_t _base_offset;
279   size_t _count;
280   int _roots_count;
281   size_t _max_size_in_bytes;
282   int _max_size_in_elems;
283 
284 public:
285   size_t base_offset() { return _base_offset; }
286   size_t count() { return _count; }
287   int roots_count() { return _roots_count; }
288   size_t max_size_in_bytes() { return _max_size_in_bytes; }
289   int max_size_in_elems() { return _max_size_in_elems; }
290 
291   size_t size_in_bytes(size_t seg_idx);
292   int size_in_elems(size_t seg_idx);
293   size_t segment_offset(size_t seg_idx);

 34 #include "runtime/semaphore.hpp"
 35 #include "utilities/bitMap.hpp"
 36 #include "utilities/exceptions.hpp"
 37 #include "utilities/macros.hpp"
 38 
 39 class BootstrapInfo;
 40 class ReservedSpace;
 41 class VirtualSpace;
 42 
 43 template<class E> class Array;
 44 template<class E> class GrowableArray;
 45 
 46 // ArchivePtrMarker is used to mark the location of pointers embedded in a CDS archive. E.g., when an
 47 // InstanceKlass k is dumped, we mark the location of the k->_name pointer by effectively calling
 48 // mark_pointer(/*ptr_loc=*/&k->_name). It's required that (_prt_base <= ptr_loc < _ptr_end). _ptr_base is
 49 // fixed, but _ptr_end can be expanded as more objects are dumped.
 50 class ArchivePtrMarker : AllStatic {
 51   static CHeapBitMap*  _ptrmap;
 52   static CHeapBitMap*  _rw_ptrmap;
 53   static CHeapBitMap*  _ro_ptrmap;
 54   static CHeapBitMap*  _ac_ptrmap;
 55   static VirtualSpace* _vs;
 56 
 57   // Once _ptrmap is compacted, we don't allow bit marking anymore. This is to
 58   // avoid unintentional copy operations after the bitmap has been finalized and written.
 59   static bool         _compacted;
 60 
 61   static address* ptr_base() { return (address*)_vs->low();  } // committed lower bound (inclusive)
 62   static address* ptr_end()  { return (address*)_vs->high(); } // committed upper bound (exclusive)
 63 
 64 public:
 65   static void initialize(CHeapBitMap* ptrmap, VirtualSpace* vs);
 66   static void initialize_rw_ro_ac_maps(CHeapBitMap* rw_ptrmap, CHeapBitMap* ro_ptrmap, CHeapBitMap* ac_ptrmap);
 67   static void mark_pointer(address* ptr_loc);
 68   static void clear_pointer(address* ptr_loc);
 69   static void compact(address relocatable_base, address relocatable_end);
 70   static void compact(size_t max_non_null_offset);
 71 
 72   template <typename T>
 73   static void mark_pointer(T* ptr_loc) {
 74     mark_pointer((address*)ptr_loc);
 75   }
 76 
 77   template <typename T>
 78   static void set_and_mark_pointer(T* ptr_loc, T ptr_value) {
 79     *ptr_loc = ptr_value;
 80     mark_pointer(ptr_loc);
 81   }
 82 
 83   static CHeapBitMap* ptrmap() {
 84     return _ptrmap;
 85   }
 86 
 87   static CHeapBitMap* rw_ptrmap() {
 88     return _rw_ptrmap;
 89   }
 90 
 91   static CHeapBitMap* ro_ptrmap() {
 92     return _ro_ptrmap;
 93   }
 94 
 95   static CHeapBitMap* ac_ptrmap() {
 96     return _ac_ptrmap;
 97   }
 98 
 99   static void reset_map_and_vs() {
100     _ptrmap = nullptr;
101     _rw_ptrmap = nullptr;
102     _ro_ptrmap = nullptr;
103     _ac_ptrmap = nullptr;
104     _vs = nullptr;
105   }
106 };
107 
108 // SharedDataRelocator is used to shift pointers in the CDS archive.
109 //
110 // The CDS archive is basically a contiguous block of memory (divided into several regions)
111 // that contains multiple objects. The objects may contain direct pointers that point to other objects
112 // within the archive (e.g., InstanceKlass::_name points to a Symbol in the archive). During dumping, we
113 // built a bitmap that marks the locations of all these pointers (using ArchivePtrMarker, see comments above).
114 //
115 // The contents of the archive assumes that it's mapped at the default SharedBaseAddress (e.g. 0x800000000).
116 // If the archive ends up being mapped at a different address (e.g. 0x810000000), SharedDataRelocator
117 // is used to shift each marked pointer by a delta (0x10000000 in this example), so that it points to
118 // the actually mapped location of the target object.
119 class SharedDataRelocator: public BitMapClosure {
120   // for all (address** p), where (is_marked(p) && _patch_base <= p && p < _patch_end) { *p += delta; }
121 
122   // Patch all pointers within this region that are marked.
123   address* _patch_base;

260   char* region_top() { return nullptr; }
261 };
262 
263 class ArchiveUtils {
264   template <typename T> static Array<T>* archive_non_ptr_array(GrowableArray<T>* tmp_array);
265   template <typename T> static Array<T>* archive_ptr_array(GrowableArray<T>* tmp_array);
266 
267 public:
268   static void log_to_classlist(BootstrapInfo* bootstrap_specifier, TRAPS) NOT_CDS_RETURN;
269   static bool has_aot_initialized_mirror(InstanceKlass* src_ik);
270 
271   template <typename T, ENABLE_IF(!std::is_pointer<T>::value)>
272   static Array<T>* archive_array(GrowableArray<T>* tmp_array) {
273     return archive_non_ptr_array(tmp_array);
274   }
275 
276   template <typename T, ENABLE_IF(std::is_pointer<T>::value)>
277   static Array<T>* archive_array(GrowableArray<T>* tmp_array) {
278     return archive_ptr_array(tmp_array);
279   }
280 
281   static const char* builtin_loader_name_or_null(oop loader); // "boot", "platform", "app", or nullptr
282   static const char* builtin_loader_name(oop loader); // "boot", "platform", or "app". Asserts if not a built-in-loader.
283 
284   static bool builtin_loader_from_type(const char* loader_type, oop* value_ret);
285   static oop builtin_loader_from_type(int loader_type);
286 };
287 
288 class HeapRootSegments {
289 private:
290   size_t _base_offset;
291   size_t _count;
292   int _roots_count;
293   size_t _max_size_in_bytes;
294   int _max_size_in_elems;
295 
296 public:
297   size_t base_offset() { return _base_offset; }
298   size_t count() { return _count; }
299   int roots_count() { return _roots_count; }
300   size_t max_size_in_bytes() { return _max_size_in_bytes; }
301   int max_size_in_elems() { return _max_size_in_elems; }
302 
303   size_t size_in_bytes(size_t seg_idx);
304   int size_in_elems(size_t seg_idx);
305   size_t segment_offset(size_t seg_idx);
< prev index next >