15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_GC_G1_HEAPREGION_INLINE_HPP 26 #define SHARE_VM_GC_G1_HEAPREGION_INLINE_HPP 27 28 #include "gc/g1/g1BlockOffsetTable.inline.hpp" 29 #include "gc/g1/g1CollectedHeap.inline.hpp" 30 #include "gc/g1/heapRegion.hpp" 31 #include "gc/shared/space.hpp" 32 #include "oops/oop.inline.hpp" 33 #include "runtime/atomic.inline.hpp" 34 35 inline HeapWord* G1OffsetTableContigSpace::allocate_impl(size_t min_word_size, 36 size_t desired_word_size, 37 size_t* actual_size) { 38 HeapWord* obj = top(); 39 size_t available = pointer_delta(end(), obj); 40 size_t want_to_allocate = MIN2(available, desired_word_size); 41 if (want_to_allocate >= min_word_size) { 42 HeapWord* new_top = obj + want_to_allocate; 43 set_top(new_top); 44 assert(is_aligned(obj) && is_aligned(new_top), "checking alignment"); 45 *actual_size = want_to_allocate; 46 return obj; 47 } else { 48 return NULL; 49 } 50 } 51 52 inline HeapWord* G1OffsetTableContigSpace::par_allocate_impl(size_t min_word_size, 53 size_t desired_word_size, 54 size_t* actual_size) { 55 do { 56 HeapWord* obj = top(); 57 size_t available = pointer_delta(end(), obj); 58 size_t want_to_allocate = MIN2(available, desired_word_size); 59 if (want_to_allocate >= min_word_size) { 60 HeapWord* new_top = obj + want_to_allocate; 61 HeapWord* result = (HeapWord*)Atomic::cmpxchg_ptr(new_top, top_addr(), obj); 62 // result can be one of two: 63 // the old top value: the exchange succeeded 64 // otherwise: the new value of the top is returned. 65 if (result == obj) { 66 assert(is_aligned(obj) && is_aligned(new_top), "checking alignment"); 67 *actual_size = want_to_allocate; 68 return obj; 69 } 70 } else { 71 return NULL; 72 } 73 } while (true); 74 } 75 76 inline HeapWord* G1OffsetTableContigSpace::allocate(size_t min_word_size, 77 size_t desired_word_size, 78 size_t* actual_size) { 79 HeapWord* res = allocate_impl(min_word_size, desired_word_size, actual_size); 80 if (res != NULL) { 81 _offsets.alloc_block(res, *actual_size); 82 } 83 return res; 84 } 85 86 inline HeapWord* G1OffsetTableContigSpace::allocate(size_t word_size) { 87 size_t temp; 88 return allocate(word_size, word_size, &temp); 89 } 90 91 inline HeapWord* G1OffsetTableContigSpace::par_allocate(size_t word_size) { 92 size_t temp; 93 return par_allocate(word_size, word_size, &temp); 94 } 95 96 // Because of the requirement of keeping "_offsets" up to date with the 97 // allocations, we sequentialize these with a lock. Therefore, best if 98 // this is used for larger LAB allocations only. 99 inline HeapWord* G1OffsetTableContigSpace::par_allocate(size_t min_word_size, 100 size_t desired_word_size, 101 size_t* actual_size) { 102 MutexLocker x(&_par_alloc_lock); 103 return allocate(min_word_size, desired_word_size, actual_size); 104 } 105 106 inline HeapWord* G1OffsetTableContigSpace::block_start(const void* p) { 107 return _offsets.block_start(p); 108 } 109 110 inline HeapWord* 111 G1OffsetTableContigSpace::block_start_const(const void* p) const { 112 return _offsets.block_start_const(p); 113 } 114 115 inline bool 116 HeapRegion::block_is_obj(const HeapWord* p) const { 117 G1CollectedHeap* g1h = G1CollectedHeap::heap(); 118 119 if (!this->is_in(p)) { 120 assert(is_continues_humongous(), "This case can only happen for humongous regions"); 121 return (p == humongous_start_region()->bottom()); 122 } 123 if (ClassUnloadingWithConcurrentMark) { 124 return !g1h->is_obj_dead(oop(p), this); 125 } 126 return p < top(); 127 } 128 129 inline size_t 130 HeapRegion::block_size(const HeapWord *addr) const { 131 if (addr == top()) { 132 return pointer_delta(end(), addr); | 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_GC_G1_HEAPREGION_INLINE_HPP 26 #define SHARE_VM_GC_G1_HEAPREGION_INLINE_HPP 27 28 #include "gc/g1/g1BlockOffsetTable.inline.hpp" 29 #include "gc/g1/g1CollectedHeap.inline.hpp" 30 #include "gc/g1/heapRegion.hpp" 31 #include "gc/shared/space.hpp" 32 #include "oops/oop.inline.hpp" 33 #include "runtime/atomic.inline.hpp" 34 35 inline HeapWord* G1ContiguousSpace::allocate_impl(size_t min_word_size, 36 size_t desired_word_size, 37 size_t* actual_size) { 38 HeapWord* obj = top(); 39 size_t available = pointer_delta(end(), obj); 40 size_t want_to_allocate = MIN2(available, desired_word_size); 41 if (want_to_allocate >= min_word_size) { 42 HeapWord* new_top = obj + want_to_allocate; 43 set_top(new_top); 44 assert(is_aligned(obj) && is_aligned(new_top), "checking alignment"); 45 *actual_size = want_to_allocate; 46 return obj; 47 } else { 48 return NULL; 49 } 50 } 51 52 inline HeapWord* G1ContiguousSpace::par_allocate_impl(size_t min_word_size, 53 size_t desired_word_size, 54 size_t* actual_size) { 55 do { 56 HeapWord* obj = top(); 57 size_t available = pointer_delta(end(), obj); 58 size_t want_to_allocate = MIN2(available, desired_word_size); 59 if (want_to_allocate >= min_word_size) { 60 HeapWord* new_top = obj + want_to_allocate; 61 HeapWord* result = (HeapWord*)Atomic::cmpxchg_ptr(new_top, top_addr(), obj); 62 // result can be one of two: 63 // the old top value: the exchange succeeded 64 // otherwise: the new value of the top is returned. 65 if (result == obj) { 66 assert(is_aligned(obj) && is_aligned(new_top), "checking alignment"); 67 *actual_size = want_to_allocate; 68 return obj; 69 } 70 } else { 71 return NULL; 72 } 73 } while (true); 74 } 75 76 inline HeapWord* G1ContiguousSpace::allocate(size_t min_word_size, 77 size_t desired_word_size, 78 size_t* actual_size) { 79 HeapWord* res = allocate_impl(min_word_size, desired_word_size, actual_size); 80 if (res != NULL) { 81 _bot_part.alloc_block(res, *actual_size); 82 } 83 return res; 84 } 85 86 inline HeapWord* G1ContiguousSpace::allocate(size_t word_size) { 87 size_t temp; 88 return allocate(word_size, word_size, &temp); 89 } 90 91 inline HeapWord* G1ContiguousSpace::par_allocate(size_t word_size) { 92 size_t temp; 93 return par_allocate(word_size, word_size, &temp); 94 } 95 96 // Because of the requirement of keeping "_offsets" up to date with the 97 // allocations, we sequentialize these with a lock. Therefore, best if 98 // this is used for larger LAB allocations only. 99 inline HeapWord* G1ContiguousSpace::par_allocate(size_t min_word_size, 100 size_t desired_word_size, 101 size_t* actual_size) { 102 MutexLocker x(&_par_alloc_lock); 103 return allocate(min_word_size, desired_word_size, actual_size); 104 } 105 106 inline HeapWord* G1ContiguousSpace::block_start(const void* p) { 107 return _bot_part.block_start(p); 108 } 109 110 inline HeapWord* 111 G1ContiguousSpace::block_start_const(const void* p) const { 112 return _bot_part.block_start_const(p); 113 } 114 115 inline bool 116 HeapRegion::block_is_obj(const HeapWord* p) const { 117 G1CollectedHeap* g1h = G1CollectedHeap::heap(); 118 119 if (!this->is_in(p)) { 120 assert(is_continues_humongous(), "This case can only happen for humongous regions"); 121 return (p == humongous_start_region()->bottom()); 122 } 123 if (ClassUnloadingWithConcurrentMark) { 124 return !g1h->is_obj_dead(oop(p), this); 125 } 126 return p < top(); 127 } 128 129 inline size_t 130 HeapRegion::block_size(const HeapWord *addr) const { 131 if (addr == top()) { 132 return pointer_delta(end(), addr); |