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 *
23 */
24
25 inline PSPromotionManager* PSPromotionManager::manager_array(int index) {
26 assert(_manager_array != NULL, "access of NULL manager_array");
27 assert(index >= 0 && index <= (int)ParallelGCThreads, "out of range manager_array access");
28 return _manager_array[index];
29 }
30
31 template <class T>
32 inline void PSPromotionManager::claim_or_forward_internal_depth(T* p) {
33 if (p != NULL) { // XXX: error if p != NULL here
34 oop o = oopDesc::load_decode_heap_oop_not_null(p);
35 if (o->is_forwarded()) {
36 o = o->forwardee();
37 // Card mark
38 if (PSScavenge::is_obj_in_young((HeapWord*) o)) {
39 PSScavenge::card_table()->inline_write_ref_field_gc(p, o);
40 }
41 oopDesc::encode_store_heap_oop_not_null(p, o);
42 } else {
43 push_depth(p);
44 }
60 assert(PSChunkLargeArrays, "invariant");
61 oop const old = unmask_chunked_array_oop(p);
62 process_array_chunk(old);
63 } else {
64 if (p.is_narrow()) {
65 assert(UseCompressedOops, "Error");
66 PSScavenge::copy_and_push_safe_barrier(this, (narrowOop*)p);
67 } else {
68 PSScavenge::copy_and_push_safe_barrier(this, (oop*)p);
69 }
70 }
71 }
72
73 #if TASKQUEUE_STATS
74 void PSPromotionManager::record_steal(StarTask& p) {
75 if (is_oop_masked(p)) {
76 ++_masked_steals;
77 }
78 }
79 #endif // TASKQUEUE_STATS
|
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 *
23 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_INLINE_HPP
27
28 #include "gc_implementation/parallelScavenge/psPromotionManager.hpp"
29 #include "gc_implementation/parallelScavenge/psScavenge.hpp"
30
31 inline PSPromotionManager* PSPromotionManager::manager_array(int index) {
32 assert(_manager_array != NULL, "access of NULL manager_array");
33 assert(index >= 0 && index <= (int)ParallelGCThreads, "out of range manager_array access");
34 return _manager_array[index];
35 }
36
37 template <class T>
38 inline void PSPromotionManager::claim_or_forward_internal_depth(T* p) {
39 if (p != NULL) { // XXX: error if p != NULL here
40 oop o = oopDesc::load_decode_heap_oop_not_null(p);
41 if (o->is_forwarded()) {
42 o = o->forwardee();
43 // Card mark
44 if (PSScavenge::is_obj_in_young((HeapWord*) o)) {
45 PSScavenge::card_table()->inline_write_ref_field_gc(p, o);
46 }
47 oopDesc::encode_store_heap_oop_not_null(p, o);
48 } else {
49 push_depth(p);
50 }
66 assert(PSChunkLargeArrays, "invariant");
67 oop const old = unmask_chunked_array_oop(p);
68 process_array_chunk(old);
69 } else {
70 if (p.is_narrow()) {
71 assert(UseCompressedOops, "Error");
72 PSScavenge::copy_and_push_safe_barrier(this, (narrowOop*)p);
73 } else {
74 PSScavenge::copy_and_push_safe_barrier(this, (oop*)p);
75 }
76 }
77 }
78
79 #if TASKQUEUE_STATS
80 void PSPromotionManager::record_steal(StarTask& p) {
81 if (is_oop_masked(p)) {
82 ++_masked_steals;
83 }
84 }
85 #endif // TASKQUEUE_STATS
86
87 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_INLINE_HPP
|