1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/*
* Copyright 2005-2007 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*
*/
inline void oopDesc::update_contents(ParCompactionManager* cm) {
// The klass field must be updated before anything else
// can be done.
DEBUG_ONLY(klassOopDesc* original_klass = klass());
// Can the option to update and/or copy be moved up in the
// call chain to avoid calling into here?
if (PSParallelCompact::should_update_klass(klass())) {
update_header();
assert(klass()->is_klass(), "Not updated correctly");
} else {
assert(klass()->is_klass(), "Not updated");
}
Klass* new_klass = blueprint();
if (!new_klass->oop_is_typeArray()) {
// It might contain oops beyond the header, so take the virtual call.
new_klass->oop_update_pointers(cm, this);
}
// Else skip it. The typeArrayKlass in the header never needs scavenging.
}
inline void oopDesc::update_contents(ParCompactionManager* cm,
HeapWord* begin_limit,
HeapWord* end_limit) {
// The klass field must be updated before anything else
// can be done.
debug_only(klassOopDesc* original_klass = klass());
update_contents(cm, klass(), begin_limit, end_limit);
}
inline void oopDesc::update_contents(ParCompactionManager* cm,
klassOop old_klass,
HeapWord* begin_limit,
HeapWord* end_limit) {
klassOop updated_klass =
PSParallelCompact::summary_data().calc_new_klass(old_klass);
// Needs to be boundary aware for the 64 bit case
// update_header();
// The klass has moved. Is the location of the klass
// within the limits?
if ((((HeapWord*)&_metadata._klass) >= begin_limit) &&
(((HeapWord*)&_metadata._klass) < end_limit)) {
set_klass(updated_klass);
}
Klass* klass = updated_klass->klass_part();
if (!klass->oop_is_typeArray()) {
// It might contain oops beyond the header, so take the virtual call.
klass->oop_update_pointers(cm, this, begin_limit, end_limit);
}
// Else skip it. The typeArrayKlass in the header never needs scavenging.
}
inline void oopDesc::follow_contents(ParCompactionManager* cm) {
assert (PSParallelCompact::mark_bitmap()->is_marked(this),
"should be marked");
blueprint()->oop_follow_contents(cm, this);
}
// Used by parallel old GC.
inline void oopDesc::follow_header(ParCompactionManager* cm) {
if (UseCompressedOops) {
PSParallelCompact::mark_and_push(cm, compressed_klass_addr());
} else {
PSParallelCompact::mark_and_push(cm, klass_addr());
}
}
inline oop oopDesc::forward_to_atomic(oop p) {
assert(ParNewGeneration::is_legal_forward_ptr(p),
"illegal forwarding pointer value.");
markOop oldMark = mark();
markOop forwardPtrMark = markOopDesc::encode_pointer_as_mark(p);
markOop curMark;
assert(forwardPtrMark->decode_pointer() == p, "encoding must be reversable");
assert(sizeof(markOop) == sizeof(intptr_t), "CAS below requires this.");
while (!is_forwarded()) {
curMark = (markOop)Atomic::cmpxchg_ptr(forwardPtrMark, &_mark, oldMark);
if (curMark == oldMark) {
assert(is_forwarded(), "the CAS should have succeeded.");
return NULL;
}
oldMark = curMark;
}
return forwardee();
}
inline void oopDesc::update_header() {
if (UseCompressedOops) {
PSParallelCompact::adjust_pointer(compressed_klass_addr());
} else {
PSParallelCompact::adjust_pointer(klass_addr());
}
}
inline void oopDesc::update_header(HeapWord* beg_addr, HeapWord* end_addr) {
if (UseCompressedOops) {
PSParallelCompact::adjust_pointer(compressed_klass_addr(),
beg_addr, end_addr);
} else {
PSParallelCompact::adjust_pointer(klass_addr(), beg_addr, end_addr);
}
}
|
