author | jrose |
Tue, 21 Apr 2009 23:21:04 -0700 | |
changeset 2570 | ecc7862946d4 |
parent 2105 | 347008ce7984 |
child 4584 | e2a449e8cc6f |
permissions | -rw-r--r-- |
1 | 1 |
/* |
2105 | 2 |
* Copyright 1998-2009 Sun Microsystems, Inc. All Rights Reserved. |
1 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
|
20 |
* CA 95054 USA or visit www.sun.com if you need additional information or |
|
21 |
* have any questions. |
|
22 |
* |
|
23 |
*/ |
|
24 |
||
25 |
#include "incls/_precompiled.incl" |
|
26 |
#include "incls/_cpCacheKlass.cpp.incl" |
|
27 |
||
28 |
||
29 |
int constantPoolCacheKlass::oop_size(oop obj) const { |
|
30 |
assert(obj->is_constantPoolCache(), "must be constantPool"); |
|
31 |
return constantPoolCacheOop(obj)->object_size(); |
|
32 |
} |
|
33 |
||
34 |
||
2006
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
35 |
constantPoolCacheOop constantPoolCacheKlass::allocate(int length, |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
36 |
bool is_conc_safe, |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
37 |
TRAPS) { |
1 | 38 |
// allocate memory |
39 |
int size = constantPoolCacheOopDesc::object_size(length); |
|
2006
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
40 |
|
1 | 41 |
KlassHandle klass (THREAD, as_klassOop()); |
2006
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
42 |
|
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
43 |
// This is the original code. The code from permanent_obj_allocate() |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
44 |
// was in-lined to allow the setting of is_conc_safe before the klass |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
45 |
// is installed. |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
46 |
// constantPoolCacheOop cache = (constantPoolCacheOop) |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
47 |
// CollectedHeap::permanent_obj_allocate(klass, size, CHECK_NULL); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
48 |
|
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
49 |
oop obj = CollectedHeap::permanent_obj_allocate_no_klass_install(klass, size, CHECK_NULL); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
50 |
constantPoolCacheOop cache = (constantPoolCacheOop) obj; |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
51 |
cache->set_is_conc_safe(is_conc_safe); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
52 |
// The store to is_conc_safe must be visible before the klass |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
53 |
// is set. This should be done safely because _is_conc_safe has |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
54 |
// been declared volatile. If there are any problems, consider adding |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
55 |
// OrderAccess::storestore(); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
56 |
CollectedHeap::post_allocation_install_obj_klass(klass, obj, size); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
57 |
NOT_PRODUCT(Universe::heap()->check_for_bad_heap_word_value((HeapWord*) obj, |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
58 |
size)); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
59 |
|
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
60 |
// The length field affects the size of the object. The allocation |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
61 |
// above allocates the correct size (see calculation of "size") but |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
62 |
// the size() method of the constant pool cache oop will not reflect |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
63 |
// that size until the correct length is set. |
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
64 |
cache->set_length(length); |
2006
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
65 |
|
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
66 |
// The store of the length must be visible before is_conc_safe is |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
67 |
// set to a safe state. |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
68 |
// This should be done safely because _is_conc_safe has |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
69 |
// been declared volatile. If there are any problems, consider adding |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
70 |
// OrderAccess::storestore(); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
71 |
cache->set_is_conc_safe(methodOopDesc::IsSafeConc); |
1 | 72 |
cache->set_constant_pool(NULL); |
73 |
return cache; |
|
74 |
} |
|
75 |
||
76 |
klassOop constantPoolCacheKlass::create_klass(TRAPS) { |
|
77 |
constantPoolCacheKlass o; |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
78 |
KlassHandle h_this_klass(THREAD, Universe::klassKlassObj()); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
79 |
KlassHandle k = base_create_klass(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
80 |
// Make sure size calculation is right |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
81 |
assert(k()->size() == align_object_size(header_size()), "wrong size for object"); |
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
82 |
java_lang_Class::create_mirror(k, CHECK_NULL); // Allocate mirror |
1 | 83 |
return k(); |
84 |
} |
|
85 |
||
86 |
||
87 |
void constantPoolCacheKlass::oop_follow_contents(oop obj) { |
|
88 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
89 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
90 |
// Performance tweak: We skip iterating over the klass pointer since we |
|
91 |
// know that Universe::constantPoolCacheKlassObj never moves. |
|
92 |
// gc of constant pool cache instance variables |
|
93 |
MarkSweep::mark_and_push((oop*)cache->constant_pool_addr()); |
|
94 |
// gc of constant pool cache entries |
|
95 |
int i = cache->length(); |
|
96 |
while (i-- > 0) cache->entry_at(i)->follow_contents(); |
|
97 |
} |
|
98 |
||
99 |
#ifndef SERIALGC |
|
100 |
void constantPoolCacheKlass::oop_follow_contents(ParCompactionManager* cm, |
|
101 |
oop obj) { |
|
102 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
103 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
104 |
// Performance tweak: We skip iterating over the klass pointer since we |
|
105 |
// know that Universe::constantPoolCacheKlassObj never moves. |
|
106 |
// gc of constant pool cache instance variables |
|
107 |
PSParallelCompact::mark_and_push(cm, (oop*)cache->constant_pool_addr()); |
|
108 |
// gc of constant pool cache entries |
|
109 |
int i = cache->length(); |
|
110 |
while (i-- > 0) cache->entry_at(i)->follow_contents(cm); |
|
111 |
} |
|
112 |
#endif // SERIALGC |
|
113 |
||
114 |
||
115 |
int constantPoolCacheKlass::oop_oop_iterate(oop obj, OopClosure* blk) { |
|
116 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
117 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
118 |
// Get size before changing pointers. |
|
119 |
// Don't call size() or oop_size() since that is a virtual call. |
|
120 |
int size = cache->object_size(); |
|
121 |
// Performance tweak: We skip iterating over the klass pointer since we |
|
122 |
// know that Universe::constantPoolCacheKlassObj never moves. |
|
123 |
// iteration over constant pool cache instance variables |
|
124 |
blk->do_oop((oop*)cache->constant_pool_addr()); |
|
125 |
// iteration over constant pool cache entries |
|
126 |
for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->oop_iterate(blk); |
|
127 |
return size; |
|
128 |
} |
|
129 |
||
130 |
||
131 |
int constantPoolCacheKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { |
|
132 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
133 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
134 |
// Get size before changing pointers. |
|
135 |
// Don't call size() or oop_size() since that is a virtual call. |
|
136 |
int size = cache->object_size(); |
|
137 |
// Performance tweak: We skip iterating over the klass pointer since we |
|
138 |
// know that Universe::constantPoolCacheKlassObj never moves. |
|
139 |
// iteration over constant pool cache instance variables |
|
140 |
oop* addr = (oop*)cache->constant_pool_addr(); |
|
141 |
if (mr.contains(addr)) blk->do_oop(addr); |
|
142 |
// iteration over constant pool cache entries |
|
143 |
for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->oop_iterate_m(blk, mr); |
|
144 |
return size; |
|
145 |
} |
|
146 |
||
147 |
int constantPoolCacheKlass::oop_adjust_pointers(oop obj) { |
|
148 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
149 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
150 |
// Get size before changing pointers. |
|
151 |
// Don't call size() or oop_size() since that is a virtual call. |
|
152 |
int size = cache->object_size(); |
|
153 |
// Performance tweak: We skip iterating over the klass pointer since we |
|
154 |
// know that Universe::constantPoolCacheKlassObj never moves. |
|
155 |
// Iteration over constant pool cache instance variables |
|
156 |
MarkSweep::adjust_pointer((oop*)cache->constant_pool_addr()); |
|
157 |
// iteration over constant pool cache entries |
|
158 |
for (int i = 0; i < cache->length(); i++) |
|
159 |
cache->entry_at(i)->adjust_pointers(); |
|
160 |
return size; |
|
161 |
} |
|
162 |
||
2006
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
163 |
bool constantPoolCacheKlass::oop_is_conc_safe(oop obj) const { |
2010
c13462bbad17
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
2006
diff
changeset
|
164 |
assert(obj->is_constantPoolCache(), "should be constant pool"); |
2006
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
165 |
return constantPoolCacheOop(obj)->is_conc_safe(); |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
166 |
} |
f2d2f0f20063
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
670
diff
changeset
|
167 |
|
1 | 168 |
#ifndef SERIALGC |
169 |
void constantPoolCacheKlass::oop_copy_contents(PSPromotionManager* pm, |
|
170 |
oop obj) { |
|
171 |
assert(obj->is_constantPoolCache(), "should be constant pool"); |
|
2570
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
172 |
if (EnableInvokeDynamic) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
173 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
174 |
// during a scavenge, it is safe to inspect my pool, since it is perm |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
175 |
constantPoolOop pool = cache->constant_pool(); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
176 |
assert(pool->is_constantPool(), "should be constant pool"); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
177 |
if (pool->has_invokedynamic()) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
178 |
for (int i = 0; i < cache->length(); i++) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
179 |
ConstantPoolCacheEntry* e = cache->entry_at(i); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
180 |
oop* p = (oop*)&e->_f1; |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
181 |
if (e->is_secondary_entry()) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
182 |
if (PSScavenge::should_scavenge(p)) |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
183 |
pm->claim_or_forward_breadth(p); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
184 |
assert(!(e->is_vfinal() && PSScavenge::should_scavenge((oop*)&e->_f2)), |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
185 |
"no live oops here"); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
186 |
} |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
187 |
} |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
188 |
} |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
189 |
} |
1 | 190 |
} |
191 |
||
192 |
void constantPoolCacheKlass::oop_push_contents(PSPromotionManager* pm, |
|
193 |
oop obj) { |
|
194 |
assert(obj->is_constantPoolCache(), "should be constant pool"); |
|
2570
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
195 |
if (EnableInvokeDynamic) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
196 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
197 |
// during a scavenge, it is safe to inspect my pool, since it is perm |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
198 |
constantPoolOop pool = cache->constant_pool(); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
199 |
assert(pool->is_constantPool(), "should be constant pool"); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
200 |
if (pool->has_invokedynamic()) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
201 |
for (int i = 0; i < cache->length(); i++) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
202 |
ConstantPoolCacheEntry* e = cache->entry_at(i); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
203 |
oop* p = (oop*)&e->_f1; |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
204 |
if (e->is_secondary_entry()) { |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
205 |
if (PSScavenge::should_scavenge(p)) |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
206 |
pm->claim_or_forward_depth(p); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
207 |
assert(!(e->is_vfinal() && PSScavenge::should_scavenge((oop*)&e->_f2)), |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
208 |
"no live oops here"); |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
209 |
} |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
210 |
} |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
211 |
} |
ecc7862946d4
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
2105
diff
changeset
|
212 |
} |
1 | 213 |
} |
214 |
||
215 |
int |
|
216 |
constantPoolCacheKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { |
|
217 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
218 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
219 |
||
220 |
// Iteration over constant pool cache instance variables |
|
221 |
PSParallelCompact::adjust_pointer((oop*)cache->constant_pool_addr()); |
|
222 |
||
223 |
// iteration over constant pool cache entries |
|
224 |
for (int i = 0; i < cache->length(); ++i) { |
|
225 |
cache->entry_at(i)->update_pointers(); |
|
226 |
} |
|
227 |
||
228 |
return cache->object_size(); |
|
229 |
} |
|
230 |
||
231 |
int |
|
232 |
constantPoolCacheKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, |
|
233 |
HeapWord* beg_addr, |
|
234 |
HeapWord* end_addr) { |
|
235 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
236 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
237 |
||
238 |
// Iteration over constant pool cache instance variables |
|
239 |
oop* p; |
|
240 |
p = (oop*)cache->constant_pool_addr(); |
|
241 |
PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); |
|
242 |
||
243 |
// Iteration over constant pool cache entries |
|
244 |
for (int i = 0; i < cache->length(); ++i) { |
|
245 |
cache->entry_at(i)->update_pointers(beg_addr, end_addr); |
|
246 |
} |
|
247 |
return cache->object_size(); |
|
248 |
} |
|
249 |
#endif // SERIALGC |
|
250 |
||
251 |
#ifndef PRODUCT |
|
252 |
||
253 |
void constantPoolCacheKlass::oop_print_on(oop obj, outputStream* st) { |
|
254 |
assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
255 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
256 |
// super print |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
257 |
Klass::oop_print_on(obj, st); |
1 | 258 |
// print constant pool cache entries |
259 |
for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->print(st, i); |
|
260 |
} |
|
261 |
||
262 |
#endif |
|
263 |
||
264 |
void constantPoolCacheKlass::oop_verify_on(oop obj, outputStream* st) { |
|
265 |
guarantee(obj->is_constantPoolCache(), "obj must be constant pool cache"); |
|
266 |
constantPoolCacheOop cache = (constantPoolCacheOop)obj; |
|
267 |
// super verify |
|
360
21d113ecbf6a
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
1
diff
changeset
|
268 |
Klass::oop_verify_on(obj, st); |
1 | 269 |
// print constant pool cache entries |
270 |
for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->verify(st); |
|
271 |
} |
|
272 |
||
273 |
||
274 |
const char* constantPoolCacheKlass::internal_name() const { |
|
275 |
return "{constant pool cache}"; |
|
276 |
} |