1 /*
2 * Copyright (c) 2002, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
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 *
107 public:
108 PSOldPromotionLAB() : _start_array(NULL) { }
109 PSOldPromotionLAB(ObjectStartArray* start_array) : _start_array(start_array) { }
110
111 void set_start_array(ObjectStartArray* start_array) { _start_array = start_array; }
112
113 void flush();
114
115 // Not MT safe
116 HeapWord* allocate(size_t size) {
117 // Cannot test for this now that we're doing promotion failures
118 // assert(_state != flushed, "Sanity");
119 assert(_start_array != NULL, "Sanity");
120 HeapWord* obj = top();
121 HeapWord* new_top = obj + size;
122 // The 'new_top>obj' check is needed to detect overflow of obj+size.
123 if (new_top > obj && new_top <= end()) {
124 set_top(new_top);
125 assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top),
126 "checking alignment");
127 _start_array->allocate_block(obj);
128 return obj;
129 }
130
131 return NULL;
132 }
133
134 debug_only(virtual bool lab_is_valid(MemRegion lab));
135 };
136
137 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONLAB_HPP
|
1 /*
2 * Copyright (c) 2002, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
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 *
107 public:
108 PSOldPromotionLAB() : _start_array(NULL) { }
109 PSOldPromotionLAB(ObjectStartArray* start_array) : _start_array(start_array) { }
110
111 void set_start_array(ObjectStartArray* start_array) { _start_array = start_array; }
112
113 void flush();
114
115 // Not MT safe
116 HeapWord* allocate(size_t size) {
117 // Cannot test for this now that we're doing promotion failures
118 // assert(_state != flushed, "Sanity");
119 assert(_start_array != NULL, "Sanity");
120 HeapWord* obj = top();
121 HeapWord* new_top = obj + size;
122 // The 'new_top>obj' check is needed to detect overflow of obj+size.
123 if (new_top > obj && new_top <= end()) {
124 set_top(new_top);
125 assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top),
126 "checking alignment");
127 assert(_start_array->covered_region().contains(MemRegion(obj, size)), "Allocated beyond end of covered region");
128 _start_array->allocate_block(obj);
129 return obj;
130 }
131
132 return NULL;
133 }
134
135 debug_only(virtual bool lab_is_valid(MemRegion lab));
136 };
137
138 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONLAB_HPP
|