equal
deleted
inserted
replaced
163 // We may support a shared contiguous allocation area, if the youngest |
163 // We may support a shared contiguous allocation area, if the youngest |
164 // generation does. |
164 // generation does. |
165 bool supports_inline_contig_alloc() const; |
165 bool supports_inline_contig_alloc() const; |
166 HeapWord** top_addr() const; |
166 HeapWord** top_addr() const; |
167 HeapWord** end_addr() const; |
167 HeapWord** end_addr() const; |
168 |
|
169 // Return an estimate of the maximum allocation that could be performed |
|
170 // without triggering any collection activity. In a generational |
|
171 // collector, for example, this is probably the largest allocation that |
|
172 // could be supported in the youngest generation. It is "unsafe" because |
|
173 // no locks are taken; the result should be treated as an approximation, |
|
174 // not a guarantee. |
|
175 size_t unsafe_max_alloc(); |
|
176 |
168 |
177 // Does this heap support heap inspection? (+PrintClassHistogram) |
169 // Does this heap support heap inspection? (+PrintClassHistogram) |
178 virtual bool supports_heap_inspection() const { return true; } |
170 virtual bool supports_heap_inspection() const { return true; } |
179 |
171 |
180 // Perform a full collection of the heap; intended for use in implementing |
172 // Perform a full collection of the heap; intended for use in implementing |