< prev index next >

src/hotspot/share/gc/shared/collectedHeap.hpp

Print this page

267 
268   // Support for java.lang.Runtime.maxMemory():  return the maximum amount of
269   // memory that the vm could make available for storing 'normal' java objects.
270   // This is based on the reserved address space, but should not include space
271   // that the vm uses internally for bookkeeping or temporary storage
272   // (e.g., in the case of the young gen, one of the survivor
273   // spaces).
274   virtual size_t max_capacity() const = 0;
275 
276   // Returns "TRUE" iff "p" points into the committed areas of the heap.
277   // This method can be expensive so avoid using it in performance critical
278   // code.
279   virtual bool is_in(const void* p) const = 0;
280 
281   DEBUG_ONLY(bool is_in_or_null(const void* p) const { return p == NULL || is_in(p); })
282 
283   void set_gc_cause(GCCause::Cause v);
284   GCCause::Cause gc_cause() { return _gc_cause; }
285 
286   oop obj_allocate(Klass* klass, size_t size, TRAPS);

287   virtual oop array_allocate(Klass* klass, size_t size, int length, bool do_zero, TRAPS);
288   oop class_allocate(Klass* klass, size_t size, TRAPS);
289 
290   // Utilities for turning raw memory into filler objects.
291   //
292   // min_fill_size() is the smallest region that can be filled.
293   // fill_with_objects() can fill arbitrary-sized regions of the heap using
294   // multiple objects.  fill_with_object() is for regions known to be smaller
295   // than the largest array of integers; it uses a single object to fill the
296   // region and has slightly less overhead.
297   static size_t min_fill_size() {
298     return size_t(align_object_size(oopDesc::header_size()));
299   }
300 
301   static void fill_with_objects(HeapWord* start, size_t words, bool zap = true);
302 
303   static void fill_with_object(HeapWord* start, size_t words, bool zap = true);
304   static void fill_with_object(MemRegion region, bool zap = true) {
305     fill_with_object(region.start(), region.word_size(), zap);
306   }

267 
268   // Support for java.lang.Runtime.maxMemory():  return the maximum amount of
269   // memory that the vm could make available for storing 'normal' java objects.
270   // This is based on the reserved address space, but should not include space
271   // that the vm uses internally for bookkeeping or temporary storage
272   // (e.g., in the case of the young gen, one of the survivor
273   // spaces).
274   virtual size_t max_capacity() const = 0;
275 
276   // Returns "TRUE" iff "p" points into the committed areas of the heap.
277   // This method can be expensive so avoid using it in performance critical
278   // code.
279   virtual bool is_in(const void* p) const = 0;
280 
281   DEBUG_ONLY(bool is_in_or_null(const void* p) const { return p == NULL || is_in(p); })
282 
283   void set_gc_cause(GCCause::Cause v);
284   GCCause::Cause gc_cause() { return _gc_cause; }
285 
286   oop obj_allocate(Klass* klass, size_t size, TRAPS);
287   oop obj_buffer_allocate(Klass* klass, size_t size, TRAPS); // doesn't clear memory
288   virtual oop array_allocate(Klass* klass, size_t size, int length, bool do_zero, TRAPS);
289   oop class_allocate(Klass* klass, size_t size, TRAPS);
290 
291   // Utilities for turning raw memory into filler objects.
292   //
293   // min_fill_size() is the smallest region that can be filled.
294   // fill_with_objects() can fill arbitrary-sized regions of the heap using
295   // multiple objects.  fill_with_object() is for regions known to be smaller
296   // than the largest array of integers; it uses a single object to fill the
297   // region and has slightly less overhead.
298   static size_t min_fill_size() {
299     return size_t(align_object_size(oopDesc::header_size()));
300   }
301 
302   static void fill_with_objects(HeapWord* start, size_t words, bool zap = true);
303 
304   static void fill_with_object(HeapWord* start, size_t words, bool zap = true);
305   static void fill_with_object(MemRegion region, bool zap = true) {
306     fill_with_object(region.start(), region.word_size(), zap);
307   }
< prev index next >