Mercurial > hg > truffle
annotate src/share/vm/oops/instanceKlass.cpp @ 1930:2d26b0046e0d
Merge.
author | Thomas Wuerthinger <wuerthinger@ssw.jku.at> |
---|---|
date | Tue, 30 Nov 2010 14:53:30 +0100 |
parents | a7b84a5e16c6 d5d065957597 |
children | 06f017f7daa7 |
rev | line source |
---|---|
0 | 1 /* |
1783 | 2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1490
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1490
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1490
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
25 # include "incls/_precompiled.incl" | |
26 # include "incls/_instanceKlass.cpp.incl" | |
27 | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
28 #ifdef DTRACE_ENABLED |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
29 |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
30 HS_DTRACE_PROBE_DECL4(hotspot, class__initialization__required, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
31 char*, intptr_t, oop, intptr_t); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
32 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__recursive, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
33 char*, intptr_t, oop, intptr_t, int); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
34 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__concurrent, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
35 char*, intptr_t, oop, intptr_t, int); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
36 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__erroneous, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
37 char*, intptr_t, oop, intptr_t, int); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
38 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__super__failed, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
39 char*, intptr_t, oop, intptr_t, int); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
40 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__clinit, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
41 char*, intptr_t, oop, intptr_t, int); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
42 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__error, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
43 char*, intptr_t, oop, intptr_t, int); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
44 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__end, |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
45 char*, intptr_t, oop, intptr_t, int); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
46 |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
47 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
48 { \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
49 char* data = NULL; \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
50 int len = 0; \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
51 symbolOop name = (clss)->name(); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
52 if (name != NULL) { \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
53 data = (char*)name->bytes(); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
54 len = name->utf8_length(); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
55 } \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
56 HS_DTRACE_PROBE4(hotspot, class__initialization__##type, \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
57 data, len, (clss)->class_loader(), thread_type); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
58 } |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
59 |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
60 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
61 { \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
62 char* data = NULL; \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
63 int len = 0; \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
64 symbolOop name = (clss)->name(); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
65 if (name != NULL) { \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
66 data = (char*)name->bytes(); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
67 len = name->utf8_length(); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
68 } \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
69 HS_DTRACE_PROBE5(hotspot, class__initialization__##type, \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
70 data, len, (clss)->class_loader(), thread_type, wait); \ |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
71 } |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
72 |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
73 #else // ndef DTRACE_ENABLED |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
74 |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
75 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
76 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
77 |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
78 #endif // ndef DTRACE_ENABLED |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
79 |
0 | 80 bool instanceKlass::should_be_initialized() const { |
81 return !is_initialized(); | |
82 } | |
83 | |
84 klassVtable* instanceKlass::vtable() const { | |
85 return new klassVtable(as_klassOop(), start_of_vtable(), vtable_length() / vtableEntry::size()); | |
86 } | |
87 | |
88 klassItable* instanceKlass::itable() const { | |
89 return new klassItable(as_klassOop()); | |
90 } | |
91 | |
92 void instanceKlass::eager_initialize(Thread *thread) { | |
93 if (!EagerInitialization) return; | |
94 | |
95 if (this->is_not_initialized()) { | |
96 // abort if the the class has a class initializer | |
97 if (this->class_initializer() != NULL) return; | |
98 | |
99 // abort if it is java.lang.Object (initialization is handled in genesis) | |
100 klassOop super = this->super(); | |
101 if (super == NULL) return; | |
102 | |
103 // abort if the super class should be initialized | |
104 if (!instanceKlass::cast(super)->is_initialized()) return; | |
105 | |
106 // call body to expose the this pointer | |
107 instanceKlassHandle this_oop(thread, this->as_klassOop()); | |
108 eager_initialize_impl(this_oop); | |
109 } | |
110 } | |
111 | |
112 | |
113 void instanceKlass::eager_initialize_impl(instanceKlassHandle this_oop) { | |
114 EXCEPTION_MARK; | |
115 ObjectLocker ol(this_oop, THREAD); | |
116 | |
117 // abort if someone beat us to the initialization | |
118 if (!this_oop->is_not_initialized()) return; // note: not equivalent to is_initialized() | |
119 | |
120 ClassState old_state = this_oop->_init_state; | |
121 link_class_impl(this_oop, true, THREAD); | |
122 if (HAS_PENDING_EXCEPTION) { | |
123 CLEAR_PENDING_EXCEPTION; | |
124 // Abort if linking the class throws an exception. | |
125 | |
126 // Use a test to avoid redundantly resetting the state if there's | |
127 // no change. Set_init_state() asserts that state changes make | |
128 // progress, whereas here we might just be spinning in place. | |
129 if( old_state != this_oop->_init_state ) | |
130 this_oop->set_init_state (old_state); | |
131 } else { | |
132 // linking successfull, mark class as initialized | |
133 this_oop->set_init_state (fully_initialized); | |
134 // trace | |
135 if (TraceClassInitialization) { | |
136 ResourceMark rm(THREAD); | |
137 tty->print_cr("[Initialized %s without side effects]", this_oop->external_name()); | |
138 } | |
139 } | |
140 } | |
141 | |
142 | |
143 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization | |
144 // process. The step comments refers to the procedure described in that section. | |
145 // Note: implementation moved to static method to expose the this pointer. | |
146 void instanceKlass::initialize(TRAPS) { | |
147 if (this->should_be_initialized()) { | |
148 HandleMark hm(THREAD); | |
149 instanceKlassHandle this_oop(THREAD, this->as_klassOop()); | |
150 initialize_impl(this_oop, CHECK); | |
151 // Note: at this point the class may be initialized | |
152 // OR it may be in the state of being initialized | |
153 // in case of recursive initialization! | |
154 } else { | |
155 assert(is_initialized(), "sanity check"); | |
156 } | |
157 } | |
158 | |
159 | |
160 bool instanceKlass::verify_code( | |
161 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) { | |
162 // 1) Verify the bytecodes | |
163 Verifier::Mode mode = | |
164 throw_verifyerror ? Verifier::ThrowException : Verifier::NoException; | |
973
ad6585fd4087
6830542: Performance: JVM_DefineClass already verified.
acorn
parents:
964
diff
changeset
|
165 return Verifier::verify(this_oop, mode, this_oop->should_verify_class(), CHECK_false); |
0 | 166 } |
167 | |
168 | |
169 // Used exclusively by the shared spaces dump mechanism to prevent | |
170 // classes mapped into the shared regions in new VMs from appearing linked. | |
171 | |
172 void instanceKlass::unlink_class() { | |
173 assert(is_linked(), "must be linked"); | |
174 _init_state = loaded; | |
175 } | |
176 | |
177 void instanceKlass::link_class(TRAPS) { | |
178 assert(is_loaded(), "must be loaded"); | |
179 if (!is_linked()) { | |
180 instanceKlassHandle this_oop(THREAD, this->as_klassOop()); | |
181 link_class_impl(this_oop, true, CHECK); | |
182 } | |
183 } | |
184 | |
185 // Called to verify that a class can link during initialization, without | |
186 // throwing a VerifyError. | |
187 bool instanceKlass::link_class_or_fail(TRAPS) { | |
188 assert(is_loaded(), "must be loaded"); | |
189 if (!is_linked()) { | |
190 instanceKlassHandle this_oop(THREAD, this->as_klassOop()); | |
191 link_class_impl(this_oop, false, CHECK_false); | |
192 } | |
193 return is_linked(); | |
194 } | |
195 | |
196 bool instanceKlass::link_class_impl( | |
197 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) { | |
198 // check for error state | |
199 if (this_oop->is_in_error_state()) { | |
200 ResourceMark rm(THREAD); | |
201 THROW_MSG_(vmSymbols::java_lang_NoClassDefFoundError(), | |
202 this_oop->external_name(), false); | |
203 } | |
204 // return if already verified | |
205 if (this_oop->is_linked()) { | |
206 return true; | |
207 } | |
208 | |
209 // Timing | |
210 // timer handles recursion | |
211 assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl"); | |
212 JavaThread* jt = (JavaThread*)THREAD; | |
213 | |
214 // link super class before linking this class | |
215 instanceKlassHandle super(THREAD, this_oop->super()); | |
216 if (super.not_null()) { | |
217 if (super->is_interface()) { // check if super class is an interface | |
218 ResourceMark rm(THREAD); | |
219 Exceptions::fthrow( | |
220 THREAD_AND_LOCATION, | |
221 vmSymbolHandles::java_lang_IncompatibleClassChangeError(), | |
222 "class %s has interface %s as super class", | |
223 this_oop->external_name(), | |
224 super->external_name() | |
225 ); | |
226 return false; | |
227 } | |
228 | |
229 link_class_impl(super, throw_verifyerror, CHECK_false); | |
230 } | |
231 | |
232 // link all interfaces implemented by this class before linking this class | |
233 objArrayHandle interfaces (THREAD, this_oop->local_interfaces()); | |
234 int num_interfaces = interfaces->length(); | |
235 for (int index = 0; index < num_interfaces; index++) { | |
236 HandleMark hm(THREAD); | |
237 instanceKlassHandle ih(THREAD, klassOop(interfaces->obj_at(index))); | |
238 link_class_impl(ih, throw_verifyerror, CHECK_false); | |
239 } | |
240 | |
241 // in case the class is linked in the process of linking its superclasses | |
242 if (this_oop->is_linked()) { | |
243 return true; | |
244 } | |
245 | |
875
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
246 // trace only the link time for this klass that includes |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
247 // the verification time |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
248 PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
249 ClassLoader::perf_class_link_selftime(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
250 ClassLoader::perf_classes_linked(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
251 jt->get_thread_stat()->perf_recursion_counts_addr(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
252 jt->get_thread_stat()->perf_timers_addr(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
253 PerfClassTraceTime::CLASS_LINK); |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
254 |
0 | 255 // verification & rewriting |
256 { | |
257 ObjectLocker ol(this_oop, THREAD); | |
258 // rewritten will have been set if loader constraint error found | |
259 // on an earlier link attempt | |
260 // don't verify or rewrite if already rewritten | |
261 if (!this_oop->is_linked()) { | |
262 if (!this_oop->is_rewritten()) { | |
263 { | |
264 // Timer includes any side effects of class verification (resolution, | |
265 // etc), but not recursive entry into verify_code(). | |
875
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
266 PerfClassTraceTime timer(ClassLoader::perf_class_verify_time(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
267 ClassLoader::perf_class_verify_selftime(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
268 ClassLoader::perf_classes_verified(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
269 jt->get_thread_stat()->perf_recursion_counts_addr(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
270 jt->get_thread_stat()->perf_timers_addr(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
271 PerfClassTraceTime::CLASS_VERIFY); |
0 | 272 bool verify_ok = verify_code(this_oop, throw_verifyerror, THREAD); |
273 if (!verify_ok) { | |
274 return false; | |
275 } | |
276 } | |
277 | |
278 // Just in case a side-effect of verify linked this class already | |
279 // (which can sometimes happen since the verifier loads classes | |
280 // using custom class loaders, which are free to initialize things) | |
281 if (this_oop->is_linked()) { | |
282 return true; | |
283 } | |
284 | |
285 // also sets rewritten | |
286 this_oop->rewrite_class(CHECK_false); | |
287 } | |
288 | |
289 // Initialize the vtable and interface table after | |
290 // methods have been rewritten since rewrite may | |
291 // fabricate new methodOops. | |
292 // also does loader constraint checking | |
293 if (!this_oop()->is_shared()) { | |
294 ResourceMark rm(THREAD); | |
295 this_oop->vtable()->initialize_vtable(true, CHECK_false); | |
296 this_oop->itable()->initialize_itable(true, CHECK_false); | |
297 } | |
298 #ifdef ASSERT | |
299 else { | |
300 ResourceMark rm(THREAD); | |
301 this_oop->vtable()->verify(tty, true); | |
302 // In case itable verification is ever added. | |
303 // this_oop->itable()->verify(tty, true); | |
304 } | |
305 #endif | |
306 this_oop->set_init_state(linked); | |
307 if (JvmtiExport::should_post_class_prepare()) { | |
308 Thread *thread = THREAD; | |
309 assert(thread->is_Java_thread(), "thread->is_Java_thread()"); | |
310 JvmtiExport::post_class_prepare((JavaThread *) thread, this_oop()); | |
311 } | |
312 } | |
313 } | |
314 return true; | |
315 } | |
316 | |
317 | |
318 // Rewrite the byte codes of all of the methods of a class. | |
319 // Three cases: | |
320 // During the link of a newly loaded class. | |
321 // During the preloading of classes to be written to the shared spaces. | |
322 // - Rewrite the methods and update the method entry points. | |
323 // | |
324 // During the link of a class in the shared spaces. | |
325 // - The methods were already rewritten, update the metho entry points. | |
326 // | |
327 // The rewriter must be called exactly once. Rewriting must happen after | |
328 // verification but before the first method of the class is executed. | |
329 | |
330 void instanceKlass::rewrite_class(TRAPS) { | |
331 assert(is_loaded(), "must be loaded"); | |
332 instanceKlassHandle this_oop(THREAD, this->as_klassOop()); | |
333 if (this_oop->is_rewritten()) { | |
334 assert(this_oop()->is_shared(), "rewriting an unshared class?"); | |
335 return; | |
336 } | |
337 Rewriter::rewrite(this_oop, CHECK); // No exception can happen here | |
338 this_oop->set_rewritten(); | |
339 } | |
340 | |
341 | |
342 void instanceKlass::initialize_impl(instanceKlassHandle this_oop, TRAPS) { | |
343 // Make sure klass is linked (verified) before initialization | |
344 // A class could already be verified, since it has been reflected upon. | |
345 this_oop->link_class(CHECK); | |
346 | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
347 DTRACE_CLASSINIT_PROBE(required, instanceKlass::cast(this_oop()), -1); |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
348 |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
349 bool wait = false; |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
350 |
0 | 351 // refer to the JVM book page 47 for description of steps |
352 // Step 1 | |
353 { ObjectLocker ol(this_oop, THREAD); | |
354 | |
355 Thread *self = THREAD; // it's passed the current thread | |
356 | |
357 // Step 2 | |
358 // If we were to use wait() instead of waitInterruptibly() then | |
359 // we might end up throwing IE from link/symbol resolution sites | |
360 // that aren't expected to throw. This would wreak havoc. See 6320309. | |
361 while(this_oop->is_being_initialized() && !this_oop->is_reentrant_initialization(self)) { | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
362 wait = true; |
0 | 363 ol.waitUninterruptibly(CHECK); |
364 } | |
365 | |
366 // Step 3 | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
367 if (this_oop->is_being_initialized() && this_oop->is_reentrant_initialization(self)) { |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
368 DTRACE_CLASSINIT_PROBE_WAIT(recursive, instanceKlass::cast(this_oop()), -1,wait); |
0 | 369 return; |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
370 } |
0 | 371 |
372 // Step 4 | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
373 if (this_oop->is_initialized()) { |
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
374 DTRACE_CLASSINIT_PROBE_WAIT(concurrent, instanceKlass::cast(this_oop()), -1,wait); |
0 | 375 return; |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
376 } |
0 | 377 |
378 // Step 5 | |
379 if (this_oop->is_in_error_state()) { | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
380 DTRACE_CLASSINIT_PROBE_WAIT(erroneous, instanceKlass::cast(this_oop()), -1,wait); |
0 | 381 ResourceMark rm(THREAD); |
382 const char* desc = "Could not initialize class "; | |
383 const char* className = this_oop->external_name(); | |
384 size_t msglen = strlen(desc) + strlen(className) + 1; | |
1751
2528b5bd749c
6980262: Memory leak when exception is thrown in static initializer
kamg
parents:
1706
diff
changeset
|
385 char* message = NEW_RESOURCE_ARRAY(char, msglen); |
0 | 386 if (NULL == message) { |
387 // Out of memory: can't create detailed error message | |
388 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className); | |
389 } else { | |
390 jio_snprintf(message, msglen, "%s%s", desc, className); | |
391 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message); | |
392 } | |
393 } | |
394 | |
395 // Step 6 | |
396 this_oop->set_init_state(being_initialized); | |
397 this_oop->set_init_thread(self); | |
398 } | |
399 | |
400 // Step 7 | |
401 klassOop super_klass = this_oop->super(); | |
402 if (super_klass != NULL && !this_oop->is_interface() && Klass::cast(super_klass)->should_be_initialized()) { | |
403 Klass::cast(super_klass)->initialize(THREAD); | |
404 | |
405 if (HAS_PENDING_EXCEPTION) { | |
406 Handle e(THREAD, PENDING_EXCEPTION); | |
407 CLEAR_PENDING_EXCEPTION; | |
408 { | |
409 EXCEPTION_MARK; | |
410 this_oop->set_initialization_state_and_notify(initialization_error, THREAD); // Locks object, set state, and notify all waiting threads | |
411 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, superclass initialization error is thrown below | |
412 } | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
413 DTRACE_CLASSINIT_PROBE_WAIT(super__failed, instanceKlass::cast(this_oop()), -1,wait); |
0 | 414 THROW_OOP(e()); |
415 } | |
416 } | |
417 | |
418 // Step 8 | |
419 { | |
420 assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl"); | |
421 JavaThread* jt = (JavaThread*)THREAD; | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
422 DTRACE_CLASSINIT_PROBE_WAIT(clinit, instanceKlass::cast(this_oop()), -1,wait); |
0 | 423 // Timer includes any side effects of class initialization (resolution, |
424 // etc), but not recursive entry into call_class_initializer(). | |
875
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
425 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
426 ClassLoader::perf_class_init_selftime(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
427 ClassLoader::perf_classes_inited(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
428 jt->get_thread_stat()->perf_recursion_counts_addr(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
429 jt->get_thread_stat()->perf_timers_addr(), |
6a93908f268f
6857194: Add hotspot perf counters to aid class loading performance measurement
mchung
parents:
676
diff
changeset
|
430 PerfClassTraceTime::CLASS_CLINIT); |
0 | 431 this_oop->call_class_initializer(THREAD); |
432 } | |
433 | |
434 // Step 9 | |
435 if (!HAS_PENDING_EXCEPTION) { | |
436 this_oop->set_initialization_state_and_notify(fully_initialized, CHECK); | |
437 { ResourceMark rm(THREAD); | |
438 debug_only(this_oop->vtable()->verify(tty, true);) | |
439 } | |
440 } | |
441 else { | |
442 // Step 10 and 11 | |
443 Handle e(THREAD, PENDING_EXCEPTION); | |
444 CLEAR_PENDING_EXCEPTION; | |
445 { | |
446 EXCEPTION_MARK; | |
447 this_oop->set_initialization_state_and_notify(initialization_error, THREAD); | |
448 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below | |
449 } | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
450 DTRACE_CLASSINIT_PROBE_WAIT(error, instanceKlass::cast(this_oop()), -1,wait); |
1142 | 451 if (e->is_a(SystemDictionary::Error_klass())) { |
0 | 452 THROW_OOP(e()); |
453 } else { | |
454 JavaCallArguments args(e); | |
455 THROW_ARG(vmSymbolHandles::java_lang_ExceptionInInitializerError(), | |
456 vmSymbolHandles::throwable_void_signature(), | |
457 &args); | |
458 } | |
459 } | |
1324
e392695de029
6935224: Adding new DTrace probes to work with Palantir
fparain
parents:
1155
diff
changeset
|
460 DTRACE_CLASSINIT_PROBE_WAIT(end, instanceKlass::cast(this_oop()), -1,wait); |
0 | 461 } |
462 | |
463 | |
464 // Note: implementation moved to static method to expose the this pointer. | |
465 void instanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) { | |
466 instanceKlassHandle kh(THREAD, this->as_klassOop()); | |
467 set_initialization_state_and_notify_impl(kh, state, CHECK); | |
468 } | |
469 | |
470 void instanceKlass::set_initialization_state_and_notify_impl(instanceKlassHandle this_oop, ClassState state, TRAPS) { | |
471 ObjectLocker ol(this_oop, THREAD); | |
472 this_oop->set_init_state(state); | |
473 ol.notify_all(CHECK); | |
474 } | |
475 | |
476 void instanceKlass::add_implementor(klassOop k) { | |
477 assert(Compile_lock->owned_by_self(), ""); | |
478 // Filter out my subinterfaces. | |
479 // (Note: Interfaces are never on the subklass list.) | |
480 if (instanceKlass::cast(k)->is_interface()) return; | |
481 | |
482 // Filter out subclasses whose supers already implement me. | |
483 // (Note: CHA must walk subclasses of direct implementors | |
484 // in order to locate indirect implementors.) | |
485 klassOop sk = instanceKlass::cast(k)->super(); | |
486 if (sk != NULL && instanceKlass::cast(sk)->implements_interface(as_klassOop())) | |
487 // We only need to check one immediate superclass, since the | |
488 // implements_interface query looks at transitive_interfaces. | |
489 // Any supers of the super have the same (or fewer) transitive_interfaces. | |
490 return; | |
491 | |
492 // Update number of implementors | |
493 int i = _nof_implementors++; | |
494 | |
495 // Record this implementor, if there are not too many already | |
496 if (i < implementors_limit) { | |
497 assert(_implementors[i] == NULL, "should be exactly one implementor"); | |
498 oop_store_without_check((oop*)&_implementors[i], k); | |
499 } else if (i == implementors_limit) { | |
500 // clear out the list on first overflow | |
501 for (int i2 = 0; i2 < implementors_limit; i2++) | |
502 oop_store_without_check((oop*)&_implementors[i2], NULL); | |
503 } | |
504 | |
505 // The implementor also implements the transitive_interfaces | |
506 for (int index = 0; index < local_interfaces()->length(); index++) { | |
507 instanceKlass::cast(klassOop(local_interfaces()->obj_at(index)))->add_implementor(k); | |
508 } | |
509 } | |
510 | |
511 void instanceKlass::init_implementor() { | |
512 for (int i = 0; i < implementors_limit; i++) | |
513 oop_store_without_check((oop*)&_implementors[i], NULL); | |
514 _nof_implementors = 0; | |
515 } | |
516 | |
517 | |
518 void instanceKlass::process_interfaces(Thread *thread) { | |
519 // link this class into the implementors list of every interface it implements | |
520 KlassHandle this_as_oop (thread, this->as_klassOop()); | |
521 for (int i = local_interfaces()->length() - 1; i >= 0; i--) { | |
522 assert(local_interfaces()->obj_at(i)->is_klass(), "must be a klass"); | |
523 instanceKlass* interf = instanceKlass::cast(klassOop(local_interfaces()->obj_at(i))); | |
524 assert(interf->is_interface(), "expected interface"); | |
525 interf->add_implementor(this_as_oop()); | |
526 } | |
527 } | |
528 | |
529 bool instanceKlass::can_be_primary_super_slow() const { | |
530 if (is_interface()) | |
531 return false; | |
532 else | |
533 return Klass::can_be_primary_super_slow(); | |
534 } | |
535 | |
536 objArrayOop instanceKlass::compute_secondary_supers(int num_extra_slots, TRAPS) { | |
537 // The secondaries are the implemented interfaces. | |
538 instanceKlass* ik = instanceKlass::cast(as_klassOop()); | |
539 objArrayHandle interfaces (THREAD, ik->transitive_interfaces()); | |
540 int num_secondaries = num_extra_slots + interfaces->length(); | |
541 if (num_secondaries == 0) { | |
542 return Universe::the_empty_system_obj_array(); | |
543 } else if (num_extra_slots == 0) { | |
544 return interfaces(); | |
545 } else { | |
546 // a mix of both | |
547 objArrayOop secondaries = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL); | |
548 for (int i = 0; i < interfaces->length(); i++) { | |
549 secondaries->obj_at_put(num_extra_slots+i, interfaces->obj_at(i)); | |
550 } | |
551 return secondaries; | |
552 } | |
553 } | |
554 | |
555 bool instanceKlass::compute_is_subtype_of(klassOop k) { | |
556 if (Klass::cast(k)->is_interface()) { | |
557 return implements_interface(k); | |
558 } else { | |
559 return Klass::compute_is_subtype_of(k); | |
560 } | |
561 } | |
562 | |
563 bool instanceKlass::implements_interface(klassOop k) const { | |
564 if (as_klassOop() == k) return true; | |
565 assert(Klass::cast(k)->is_interface(), "should be an interface class"); | |
566 for (int i = 0; i < transitive_interfaces()->length(); i++) { | |
567 if (transitive_interfaces()->obj_at(i) == k) { | |
568 return true; | |
569 } | |
570 } | |
571 return false; | |
572 } | |
573 | |
574 objArrayOop instanceKlass::allocate_objArray(int n, int length, TRAPS) { | |
1445
a7b84a5e16c6
Remove caching for constant pool entries (same index can be used to retrieve e.g. type and field). Fast fail on bailout in C1X.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1324
diff
changeset
|
575 if (length < 0) { |
a7b84a5e16c6
Remove caching for constant pool entries (same index can be used to retrieve e.g. type and field). Fast fail on bailout in C1X.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1324
diff
changeset
|
576 THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); |
a7b84a5e16c6
Remove caching for constant pool entries (same index can be used to retrieve e.g. type and field). Fast fail on bailout in C1X.
Thomas Wuerthinger <wuerthinger@ssw.jku.at>
parents:
1324
diff
changeset
|
577 } |
0 | 578 if (length > arrayOopDesc::max_array_length(T_OBJECT)) { |
876
1413494da700
6850957: Honor -XX:OnOutOfMemoryError when array size exceeds VM limit
martin
parents:
875
diff
changeset
|
579 report_java_out_of_memory("Requested array size exceeds VM limit"); |
0 | 580 THROW_OOP_0(Universe::out_of_memory_error_array_size()); |
581 } | |
582 int size = objArrayOopDesc::object_size(length); | |
583 klassOop ak = array_klass(n, CHECK_NULL); | |
584 KlassHandle h_ak (THREAD, ak); | |
585 objArrayOop o = | |
586 (objArrayOop)CollectedHeap::array_allocate(h_ak, size, length, CHECK_NULL); | |
587 return o; | |
588 } | |
589 | |
590 instanceOop instanceKlass::register_finalizer(instanceOop i, TRAPS) { | |
591 if (TraceFinalizerRegistration) { | |
592 tty->print("Registered "); | |
593 i->print_value_on(tty); | |
594 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", (address)i); | |
595 } | |
596 instanceHandle h_i(THREAD, i); | |
597 // Pass the handle as argument, JavaCalls::call expects oop as jobjects | |
598 JavaValue result(T_VOID); | |
599 JavaCallArguments args(h_i); | |
600 methodHandle mh (THREAD, Universe::finalizer_register_method()); | |
601 JavaCalls::call(&result, mh, &args, CHECK_NULL); | |
602 return h_i(); | |
603 } | |
604 | |
605 instanceOop instanceKlass::allocate_instance(TRAPS) { | |
606 bool has_finalizer_flag = has_finalizer(); // Query before possible GC | |
607 int size = size_helper(); // Query before forming handle. | |
608 | |
609 KlassHandle h_k(THREAD, as_klassOop()); | |
610 | |
611 instanceOop i; | |
612 | |
613 i = (instanceOop)CollectedHeap::obj_allocate(h_k, size, CHECK_NULL); | |
614 if (has_finalizer_flag && !RegisterFinalizersAtInit) { | |
615 i = register_finalizer(i, CHECK_NULL); | |
616 } | |
617 return i; | |
618 } | |
619 | |
620 instanceOop instanceKlass::allocate_permanent_instance(TRAPS) { | |
621 // Finalizer registration occurs in the Object.<init> constructor | |
622 // and constructors normally aren't run when allocating perm | |
623 // instances so simply disallow finalizable perm objects. This can | |
624 // be relaxed if a need for it is found. | |
625 assert(!has_finalizer(), "perm objects not allowed to have finalizers"); | |
626 int size = size_helper(); // Query before forming handle. | |
627 KlassHandle h_k(THREAD, as_klassOop()); | |
628 instanceOop i = (instanceOop) | |
629 CollectedHeap::permanent_obj_allocate(h_k, size, CHECK_NULL); | |
630 return i; | |
631 } | |
632 | |
633 void instanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) { | |
634 if (is_interface() || is_abstract()) { | |
635 ResourceMark rm(THREAD); | |
636 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError() | |
637 : vmSymbols::java_lang_InstantiationException(), external_name()); | |
638 } | |
1142 | 639 if (as_klassOop() == SystemDictionary::Class_klass()) { |
0 | 640 ResourceMark rm(THREAD); |
641 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError() | |
642 : vmSymbols::java_lang_IllegalAccessException(), external_name()); | |
643 } | |
644 } | |
645 | |
646 klassOop instanceKlass::array_klass_impl(bool or_null, int n, TRAPS) { | |
647 instanceKlassHandle this_oop(THREAD, as_klassOop()); | |
648 return array_klass_impl(this_oop, or_null, n, THREAD); | |
649 } | |
650 | |
651 klassOop instanceKlass::array_klass_impl(instanceKlassHandle this_oop, bool or_null, int n, TRAPS) { | |
652 if (this_oop->array_klasses() == NULL) { | |
653 if (or_null) return NULL; | |
654 | |
655 ResourceMark rm; | |
656 JavaThread *jt = (JavaThread *)THREAD; | |
657 { | |
658 // Atomic creation of array_klasses | |
659 MutexLocker mc(Compile_lock, THREAD); // for vtables | |
660 MutexLocker ma(MultiArray_lock, THREAD); | |
661 | |
662 // Check if update has already taken place | |
663 if (this_oop->array_klasses() == NULL) { | |
664 objArrayKlassKlass* oakk = | |
665 (objArrayKlassKlass*)Universe::objArrayKlassKlassObj()->klass_part(); | |
666 | |
667 klassOop k = oakk->allocate_objArray_klass(1, this_oop, CHECK_NULL); | |
668 this_oop->set_array_klasses(k); | |
669 } | |
670 } | |
671 } | |
672 // _this will always be set at this point | |
673 objArrayKlass* oak = (objArrayKlass*)this_oop->array_klasses()->klass_part(); | |
674 if (or_null) { | |
675 return oak->array_klass_or_null(n); | |
676 } | |
677 return oak->array_klass(n, CHECK_NULL); | |
678 } | |
679 | |
680 klassOop instanceKlass::array_klass_impl(bool or_null, TRAPS) { | |
681 return array_klass_impl(or_null, 1, THREAD); | |
682 } | |
683 | |
684 void instanceKlass::call_class_initializer(TRAPS) { | |
685 instanceKlassHandle ik (THREAD, as_klassOop()); | |
686 call_class_initializer_impl(ik, THREAD); | |
687 } | |
688 | |
689 static int call_class_initializer_impl_counter = 0; // for debugging | |
690 | |
691 methodOop instanceKlass::class_initializer() { | |
692 return find_method(vmSymbols::class_initializer_name(), vmSymbols::void_method_signature()); | |
693 } | |
694 | |
695 void instanceKlass::call_class_initializer_impl(instanceKlassHandle this_oop, TRAPS) { | |
696 methodHandle h_method(THREAD, this_oop->class_initializer()); | |
697 assert(!this_oop->is_initialized(), "we cannot initialize twice"); | |
698 if (TraceClassInitialization) { | |
699 tty->print("%d Initializing ", call_class_initializer_impl_counter++); | |
700 this_oop->name()->print_value(); | |
701 tty->print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", (address)this_oop()); | |
702 } | |
703 if (h_method() != NULL) { | |
704 JavaCallArguments args; // No arguments | |
705 JavaValue result(T_VOID); | |
706 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args) | |
707 } | |
708 } | |
709 | |
710 | |
711 void instanceKlass::mask_for(methodHandle method, int bci, | |
712 InterpreterOopMap* entry_for) { | |
713 // Dirty read, then double-check under a lock. | |
714 if (_oop_map_cache == NULL) { | |
715 // Otherwise, allocate a new one. | |
716 MutexLocker x(OopMapCacheAlloc_lock); | |
717 // First time use. Allocate a cache in C heap | |
718 if (_oop_map_cache == NULL) { | |
719 _oop_map_cache = new OopMapCache(); | |
720 } | |
721 } | |
722 // _oop_map_cache is constant after init; lookup below does is own locking. | |
723 _oop_map_cache->lookup(method, bci, entry_for); | |
724 } | |
725 | |
726 | |
727 bool instanceKlass::find_local_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const { | |
728 const int n = fields()->length(); | |
729 for (int i = 0; i < n; i += next_offset ) { | |
730 int name_index = fields()->ushort_at(i + name_index_offset); | |
731 int sig_index = fields()->ushort_at(i + signature_index_offset); | |
732 symbolOop f_name = constants()->symbol_at(name_index); | |
733 symbolOop f_sig = constants()->symbol_at(sig_index); | |
734 if (f_name == name && f_sig == sig) { | |
735 fd->initialize(as_klassOop(), i); | |
736 return true; | |
737 } | |
738 } | |
739 return false; | |
740 } | |
741 | |
742 | |
743 void instanceKlass::field_names_and_sigs_iterate(OopClosure* closure) { | |
744 const int n = fields()->length(); | |
745 for (int i = 0; i < n; i += next_offset ) { | |
746 int name_index = fields()->ushort_at(i + name_index_offset); | |
747 symbolOop name = constants()->symbol_at(name_index); | |
748 closure->do_oop((oop*)&name); | |
749 | |
750 int sig_index = fields()->ushort_at(i + signature_index_offset); | |
751 symbolOop sig = constants()->symbol_at(sig_index); | |
752 closure->do_oop((oop*)&sig); | |
753 } | |
754 } | |
755 | |
756 | |
757 klassOop instanceKlass::find_interface_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const { | |
758 const int n = local_interfaces()->length(); | |
759 for (int i = 0; i < n; i++) { | |
760 klassOop intf1 = klassOop(local_interfaces()->obj_at(i)); | |
761 assert(Klass::cast(intf1)->is_interface(), "just checking type"); | |
762 // search for field in current interface | |
763 if (instanceKlass::cast(intf1)->find_local_field(name, sig, fd)) { | |
764 assert(fd->is_static(), "interface field must be static"); | |
765 return intf1; | |
766 } | |
767 // search for field in direct superinterfaces | |
768 klassOop intf2 = instanceKlass::cast(intf1)->find_interface_field(name, sig, fd); | |
769 if (intf2 != NULL) return intf2; | |
770 } | |
771 // otherwise field lookup fails | |
772 return NULL; | |
773 } | |
774 | |
775 | |
776 klassOop instanceKlass::find_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const { | |
777 // search order according to newest JVM spec (5.4.3.2, p.167). | |
778 // 1) search for field in current klass | |
779 if (find_local_field(name, sig, fd)) { | |
780 return as_klassOop(); | |
781 } | |
782 // 2) search for field recursively in direct superinterfaces | |
783 { klassOop intf = find_interface_field(name, sig, fd); | |
784 if (intf != NULL) return intf; | |
785 } | |
786 // 3) apply field lookup recursively if superclass exists | |
787 { klassOop supr = super(); | |
788 if (supr != NULL) return instanceKlass::cast(supr)->find_field(name, sig, fd); | |
789 } | |
790 // 4) otherwise field lookup fails | |
791 return NULL; | |
792 } | |
793 | |
794 | |
795 klassOop instanceKlass::find_field(symbolOop name, symbolOop sig, bool is_static, fieldDescriptor* fd) const { | |
796 // search order according to newest JVM spec (5.4.3.2, p.167). | |
797 // 1) search for field in current klass | |
798 if (find_local_field(name, sig, fd)) { | |
799 if (fd->is_static() == is_static) return as_klassOop(); | |
800 } | |
801 // 2) search for field recursively in direct superinterfaces | |
802 if (is_static) { | |
803 klassOop intf = find_interface_field(name, sig, fd); | |
804 if (intf != NULL) return intf; | |
805 } | |
806 // 3) apply field lookup recursively if superclass exists | |
807 { klassOop supr = super(); | |
808 if (supr != NULL) return instanceKlass::cast(supr)->find_field(name, sig, is_static, fd); | |
809 } | |
810 // 4) otherwise field lookup fails | |
811 return NULL; | |
812 } | |
813 | |
814 | |
815 bool instanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { | |
816 int length = fields()->length(); | |
817 for (int i = 0; i < length; i += next_offset) { | |
818 if (offset_from_fields( i ) == offset) { | |
819 fd->initialize(as_klassOop(), i); | |
820 if (fd->is_static() == is_static) return true; | |
821 } | |
822 } | |
823 return false; | |
824 } | |
825 | |
826 | |
827 bool instanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { | |
828 klassOop klass = as_klassOop(); | |
829 while (klass != NULL) { | |
830 if (instanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) { | |
831 return true; | |
832 } | |
833 klass = Klass::cast(klass)->super(); | |
834 } | |
835 return false; | |
836 } | |
837 | |
838 | |
839 void instanceKlass::methods_do(void f(methodOop method)) { | |
840 int len = methods()->length(); | |
841 for (int index = 0; index < len; index++) { | |
842 methodOop m = methodOop(methods()->obj_at(index)); | |
843 assert(m->is_method(), "must be method"); | |
844 f(m); | |
845 } | |
846 } | |
847 | |
848 void instanceKlass::do_local_static_fields(FieldClosure* cl) { | |
849 fieldDescriptor fd; | |
850 int length = fields()->length(); | |
851 for (int i = 0; i < length; i += next_offset) { | |
852 fd.initialize(as_klassOop(), i); | |
853 if (fd.is_static()) cl->do_field(&fd); | |
854 } | |
855 } | |
856 | |
857 | |
858 void instanceKlass::do_local_static_fields(void f(fieldDescriptor*, TRAPS), TRAPS) { | |
859 instanceKlassHandle h_this(THREAD, as_klassOop()); | |
860 do_local_static_fields_impl(h_this, f, CHECK); | |
861 } | |
862 | |
863 | |
864 void instanceKlass::do_local_static_fields_impl(instanceKlassHandle this_oop, void f(fieldDescriptor* fd, TRAPS), TRAPS) { | |
865 fieldDescriptor fd; | |
866 int length = this_oop->fields()->length(); | |
867 for (int i = 0; i < length; i += next_offset) { | |
868 fd.initialize(this_oop(), i); | |
869 if (fd.is_static()) { f(&fd, CHECK); } // Do NOT remove {}! (CHECK macro expands into several statements) | |
870 } | |
871 } | |
872 | |
873 | |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
874 static int compare_fields_by_offset(int* a, int* b) { |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
875 return a[0] - b[0]; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
876 } |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
877 |
0 | 878 void instanceKlass::do_nonstatic_fields(FieldClosure* cl) { |
879 instanceKlass* super = superklass(); | |
880 if (super != NULL) { | |
881 super->do_nonstatic_fields(cl); | |
882 } | |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
883 fieldDescriptor fd; |
0 | 884 int length = fields()->length(); |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
885 // In DebugInfo nonstatic fields are sorted by offset. |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
886 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1)); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
887 int j = 0; |
0 | 888 for (int i = 0; i < length; i += next_offset) { |
889 fd.initialize(as_klassOop(), i); | |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
890 if (!fd.is_static()) { |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
891 fields_sorted[j + 0] = fd.offset(); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
892 fields_sorted[j + 1] = i; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
893 j += 2; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
894 } |
0 | 895 } |
44
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
896 if (j > 0) { |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
897 length = j; |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
898 // _sort_Fn is defined in growableArray.hpp. |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
899 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
900 for (int i = 0; i < length; i += 2) { |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
901 fd.initialize(as_klassOop(), fields_sorted[i + 1]); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
902 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields"); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
903 cl->do_field(&fd); |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
904 } |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
905 } |
52fed2ec0afb
6667620: (Escape Analysis) fix deoptimization for scalar replaced objects
kvn
parents:
0
diff
changeset
|
906 FREE_C_HEAP_ARRAY(int, fields_sorted); |
0 | 907 } |
908 | |
909 | |
910 void instanceKlass::array_klasses_do(void f(klassOop k)) { | |
911 if (array_klasses() != NULL) | |
912 arrayKlass::cast(array_klasses())->array_klasses_do(f); | |
913 } | |
914 | |
915 | |
916 void instanceKlass::with_array_klasses_do(void f(klassOop k)) { | |
917 f(as_klassOop()); | |
918 array_klasses_do(f); | |
919 } | |
920 | |
921 #ifdef ASSERT | |
922 static int linear_search(objArrayOop methods, symbolOop name, symbolOop signature) { | |
923 int len = methods->length(); | |
924 for (int index = 0; index < len; index++) { | |
925 methodOop m = (methodOop)(methods->obj_at(index)); | |
926 assert(m->is_method(), "must be method"); | |
927 if (m->signature() == signature && m->name() == name) { | |
928 return index; | |
929 } | |
930 } | |
931 return -1; | |
932 } | |
933 #endif | |
934 | |
935 methodOop instanceKlass::find_method(symbolOop name, symbolOop signature) const { | |
936 return instanceKlass::find_method(methods(), name, signature); | |
937 } | |
938 | |
939 methodOop instanceKlass::find_method(objArrayOop methods, symbolOop name, symbolOop signature) { | |
940 int len = methods->length(); | |
941 // methods are sorted, so do binary search | |
942 int l = 0; | |
943 int h = len - 1; | |
944 while (l <= h) { | |
945 int mid = (l + h) >> 1; | |
946 methodOop m = (methodOop)methods->obj_at(mid); | |
947 assert(m->is_method(), "must be method"); | |
948 int res = m->name()->fast_compare(name); | |
949 if (res == 0) { | |
950 // found matching name; do linear search to find matching signature | |
951 // first, quick check for common case | |
952 if (m->signature() == signature) return m; | |
953 // search downwards through overloaded methods | |
954 int i; | |
955 for (i = mid - 1; i >= l; i--) { | |
956 methodOop m = (methodOop)methods->obj_at(i); | |
957 assert(m->is_method(), "must be method"); | |
958 if (m->name() != name) break; | |
959 if (m->signature() == signature) return m; | |
960 } | |
961 // search upwards | |
962 for (i = mid + 1; i <= h; i++) { | |
963 methodOop m = (methodOop)methods->obj_at(i); | |
964 assert(m->is_method(), "must be method"); | |
965 if (m->name() != name) break; | |
966 if (m->signature() == signature) return m; | |
967 } | |
968 // not found | |
969 #ifdef ASSERT | |
970 int index = linear_search(methods, name, signature); | |
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1324
diff
changeset
|
971 assert(index == -1, err_msg("binary search should have found entry %d", index)); |
0 | 972 #endif |
973 return NULL; | |
974 } else if (res < 0) { | |
975 l = mid + 1; | |
976 } else { | |
977 h = mid - 1; | |
978 } | |
979 } | |
980 #ifdef ASSERT | |
981 int index = linear_search(methods, name, signature); | |
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1324
diff
changeset
|
982 assert(index == -1, err_msg("binary search should have found entry %d", index)); |
0 | 983 #endif |
984 return NULL; | |
985 } | |
986 | |
987 methodOop instanceKlass::uncached_lookup_method(symbolOop name, symbolOop signature) const { | |
988 klassOop klass = as_klassOop(); | |
989 while (klass != NULL) { | |
990 methodOop method = instanceKlass::cast(klass)->find_method(name, signature); | |
991 if (method != NULL) return method; | |
992 klass = instanceKlass::cast(klass)->super(); | |
993 } | |
994 return NULL; | |
995 } | |
996 | |
997 // lookup a method in all the interfaces that this class implements | |
998 methodOop instanceKlass::lookup_method_in_all_interfaces(symbolOop name, | |
999 symbolOop signature) const { | |
1000 objArrayOop all_ifs = instanceKlass::cast(as_klassOop())->transitive_interfaces(); | |
1001 int num_ifs = all_ifs->length(); | |
1002 instanceKlass *ik = NULL; | |
1003 for (int i = 0; i < num_ifs; i++) { | |
1004 ik = instanceKlass::cast(klassOop(all_ifs->obj_at(i))); | |
1005 methodOop m = ik->lookup_method(name, signature); | |
1006 if (m != NULL) { | |
1007 return m; | |
1008 } | |
1009 } | |
1010 return NULL; | |
1011 } | |
1012 | |
1013 /* jni_id_for_impl for jfieldIds only */ | |
1014 JNIid* instanceKlass::jni_id_for_impl(instanceKlassHandle this_oop, int offset) { | |
1015 MutexLocker ml(JfieldIdCreation_lock); | |
1016 // Retry lookup after we got the lock | |
1017 JNIid* probe = this_oop->jni_ids() == NULL ? NULL : this_oop->jni_ids()->find(offset); | |
1018 if (probe == NULL) { | |
1019 // Slow case, allocate new static field identifier | |
1020 probe = new JNIid(this_oop->as_klassOop(), offset, this_oop->jni_ids()); | |
1021 this_oop->set_jni_ids(probe); | |
1022 } | |
1023 return probe; | |
1024 } | |
1025 | |
1026 | |
1027 /* jni_id_for for jfieldIds only */ | |
1028 JNIid* instanceKlass::jni_id_for(int offset) { | |
1029 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset); | |
1030 if (probe == NULL) { | |
1031 probe = jni_id_for_impl(this->as_klassOop(), offset); | |
1032 } | |
1033 return probe; | |
1034 } | |
1035 | |
1036 | |
1037 // Lookup or create a jmethodID. | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1038 // This code is called by the VMThread and JavaThreads so the |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1039 // locking has to be done very carefully to avoid deadlocks |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1040 // and/or other cache consistency problems. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1041 // |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1042 jmethodID instanceKlass::get_jmethod_id(instanceKlassHandle ik_h, methodHandle method_h) { |
0 | 1043 size_t idnum = (size_t)method_h->method_idnum(); |
1044 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire(); | |
1045 size_t length = 0; | |
1046 jmethodID id = NULL; | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1047 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1048 // We use a double-check locking idiom here because this cache is |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1049 // performance sensitive. In the normal system, this cache only |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1050 // transitions from NULL to non-NULL which is safe because we use |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1051 // release_set_methods_jmethod_ids() to advertise the new cache. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1052 // A partially constructed cache should never be seen by a racing |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1053 // thread. We also use release_store_ptr() to save a new jmethodID |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1054 // in the cache so a partially constructed jmethodID should never be |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1055 // seen either. Cache reads of existing jmethodIDs proceed without a |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1056 // lock, but cache writes of a new jmethodID requires uniqueness and |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1057 // creation of the cache itself requires no leaks so a lock is |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1058 // generally acquired in those two cases. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1059 // |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1060 // If the RedefineClasses() API has been used, then this cache can |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1061 // grow and we'll have transitions from non-NULL to bigger non-NULL. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1062 // Cache creation requires no leaks and we require safety between all |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1063 // cache accesses and freeing of the old cache so a lock is generally |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1064 // acquired when the RedefineClasses() API has been used. |
0 | 1065 |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1066 if (jmeths != NULL) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1067 // the cache already exists |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1068 if (!ik_h->idnum_can_increment()) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1069 // the cache can't grow so we can just get the current values |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1070 get_jmethod_id_length_value(jmeths, idnum, &length, &id); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1071 } else { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1072 // cache can grow so we have to be more careful |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1073 if (Threads::number_of_threads() == 0 || |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1074 SafepointSynchronize::is_at_safepoint()) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1075 // we're single threaded or at a safepoint - no locking needed |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1076 get_jmethod_id_length_value(jmeths, idnum, &length, &id); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1077 } else { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1078 MutexLocker ml(JmethodIdCreation_lock); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1079 get_jmethod_id_length_value(jmeths, idnum, &length, &id); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1080 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1081 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1082 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1083 // implied else: |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1084 // we need to allocate a cache so default length and id values are good |
0 | 1085 |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1086 if (jmeths == NULL || // no cache yet |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1087 length <= idnum || // cache is too short |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1088 id == NULL) { // cache doesn't contain entry |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1089 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1090 // This function can be called by the VMThread so we have to do all |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1091 // things that might block on a safepoint before grabbing the lock. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1092 // Otherwise, we can deadlock with the VMThread or have a cache |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1093 // consistency issue. These vars keep track of what we might have |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1094 // to free after the lock is dropped. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1095 jmethodID to_dealloc_id = NULL; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1096 jmethodID* to_dealloc_jmeths = NULL; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1097 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1098 // may not allocate new_jmeths or use it if we allocate it |
0 | 1099 jmethodID* new_jmeths = NULL; |
1100 if (length <= idnum) { | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1101 // allocate a new cache that might be used |
0 | 1102 size_t size = MAX2(idnum+1, (size_t)ik_h->idnum_allocated_count()); |
1103 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1); | |
1104 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID)); | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1105 // cache size is stored in element[0], other elements offset by one |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1106 new_jmeths[0] = (jmethodID)size; |
0 | 1107 } |
1108 | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1109 // allocate a new jmethodID that might be used |
0 | 1110 jmethodID new_id = NULL; |
1111 if (method_h->is_old() && !method_h->is_obsolete()) { | |
1112 // The method passed in is old (but not obsolete), we need to use the current version | |
1113 methodOop current_method = ik_h->method_with_idnum((int)idnum); | |
1114 assert(current_method != NULL, "old and but not obsolete, so should exist"); | |
1115 methodHandle current_method_h(current_method == NULL? method_h() : current_method); | |
1116 new_id = JNIHandles::make_jmethod_id(current_method_h); | |
1117 } else { | |
1118 // It is the current version of the method or an obsolete method, | |
1119 // use the version passed in | |
1120 new_id = JNIHandles::make_jmethod_id(method_h); | |
1121 } | |
1122 | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1123 if (Threads::number_of_threads() == 0 || |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1124 SafepointSynchronize::is_at_safepoint()) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1125 // we're single threaded or at a safepoint - no locking needed |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1126 id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths, |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1127 &to_dealloc_id, &to_dealloc_jmeths); |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1128 } else { |
0 | 1129 MutexLocker ml(JmethodIdCreation_lock); |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1130 id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths, |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1131 &to_dealloc_id, &to_dealloc_jmeths); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1132 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1133 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1134 // The lock has been dropped so we can free resources. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1135 // Free up either the old cache or the new cache if we allocated one. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1136 if (to_dealloc_jmeths != NULL) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1137 FreeHeap(to_dealloc_jmeths); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1138 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1139 // free up the new ID since it wasn't needed |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1140 if (to_dealloc_id != NULL) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1141 JNIHandles::destroy_jmethod_id(to_dealloc_id); |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1142 } |
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1143 } |
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1144 return id; |
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1145 } |
0 | 1146 |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1147 |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1148 // Common code to fetch the jmethodID from the cache or update the |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1149 // cache with the new jmethodID. This function should never do anything |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1150 // that causes the caller to go to a safepoint or we can deadlock with |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1151 // the VMThread or have cache consistency issues. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1152 // |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1153 jmethodID instanceKlass::get_jmethod_id_fetch_or_update( |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1154 instanceKlassHandle ik_h, size_t idnum, jmethodID new_id, |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1155 jmethodID* new_jmeths, jmethodID* to_dealloc_id_p, |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1156 jmethodID** to_dealloc_jmeths_p) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1157 assert(new_id != NULL, "sanity check"); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1158 assert(to_dealloc_id_p != NULL, "sanity check"); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1159 assert(to_dealloc_jmeths_p != NULL, "sanity check"); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1160 assert(Threads::number_of_threads() == 0 || |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1161 SafepointSynchronize::is_at_safepoint() || |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1162 JmethodIdCreation_lock->owned_by_self(), "sanity check"); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1163 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1164 // reacquire the cache - we are locked, single threaded or at a safepoint |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1165 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire(); |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1166 jmethodID id = NULL; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1167 size_t length = 0; |
0 | 1168 |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1169 if (jmeths == NULL || // no cache yet |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1170 (length = (size_t)jmeths[0]) <= idnum) { // cache is too short |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1171 if (jmeths != NULL) { |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1172 // copy any existing entries from the old cache |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1173 for (size_t index = 0; index < length; index++) { |
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1174 new_jmeths[index+1] = jmeths[index+1]; |
0 | 1175 } |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1176 *to_dealloc_jmeths_p = jmeths; // save old cache for later delete |
0 | 1177 } |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1178 ik_h->release_set_methods_jmethod_ids(jmeths = new_jmeths); |
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1179 } else { |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1180 // fetch jmethodID (if any) from the existing cache |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1181 id = jmeths[idnum+1]; |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1182 *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1183 } |
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1184 if (id == NULL) { |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1185 // No matching jmethodID in the existing cache or we have a new |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1186 // cache or we just grew the cache. This cache write is done here |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1187 // by the first thread to win the foot race because a jmethodID |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1188 // needs to be unique once it is generally available. |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1189 id = new_id; |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1190 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1191 // The jmethodID cache can be read while unlocked so we have to |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1192 // make sure the new jmethodID is complete before installing it |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1193 // in the cache. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1194 OrderAccess::release_store_ptr(&jmeths[idnum+1], id); |
49
31000d79ec71
6453355: 4/4 new No_Safepoint_Verifier uses fail during GC
dcubed
parents:
47
diff
changeset
|
1195 } else { |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1196 *to_dealloc_id_p = new_id; // save new id for later delete |
0 | 1197 } |
1198 return id; | |
1199 } | |
1200 | |
1201 | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1202 // Common code to get the jmethodID cache length and the jmethodID |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1203 // value at index idnum if there is one. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1204 // |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1205 void instanceKlass::get_jmethod_id_length_value(jmethodID* cache, |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1206 size_t idnum, size_t *length_p, jmethodID* id_p) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1207 assert(cache != NULL, "sanity check"); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1208 assert(length_p != NULL, "sanity check"); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1209 assert(id_p != NULL, "sanity check"); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1210 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1211 // cache size is stored in element[0], other elements offset by one |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1212 *length_p = (size_t)cache[0]; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1213 if (*length_p <= idnum) { // cache is too short |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1214 *id_p = NULL; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1215 } else { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1216 *id_p = cache[idnum+1]; // fetch jmethodID (if any) |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1217 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1218 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1219 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1220 |
0 | 1221 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles |
1222 jmethodID instanceKlass::jmethod_id_or_null(methodOop method) { | |
1223 size_t idnum = (size_t)method->method_idnum(); | |
1224 jmethodID* jmeths = methods_jmethod_ids_acquire(); | |
1225 size_t length; // length assigned as debugging crumb | |
1226 jmethodID id = NULL; | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1227 if (jmeths != NULL && // If there is a cache |
0 | 1228 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough, |
1229 id = jmeths[idnum+1]; // Look up the id (may be NULL) | |
1230 } | |
1231 return id; | |
1232 } | |
1233 | |
1234 | |
1235 // Cache an itable index | |
1236 void instanceKlass::set_cached_itable_index(size_t idnum, int index) { | |
1237 int* indices = methods_cached_itable_indices_acquire(); | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1238 int* to_dealloc_indices = NULL; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1239 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1240 // We use a double-check locking idiom here because this cache is |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1241 // performance sensitive. In the normal system, this cache only |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1242 // transitions from NULL to non-NULL which is safe because we use |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1243 // release_set_methods_cached_itable_indices() to advertise the |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1244 // new cache. A partially constructed cache should never be seen |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1245 // by a racing thread. Cache reads and writes proceed without a |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1246 // lock, but creation of the cache itself requires no leaks so a |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1247 // lock is generally acquired in that case. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1248 // |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1249 // If the RedefineClasses() API has been used, then this cache can |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1250 // grow and we'll have transitions from non-NULL to bigger non-NULL. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1251 // Cache creation requires no leaks and we require safety between all |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1252 // cache accesses and freeing of the old cache so a lock is generally |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1253 // acquired when the RedefineClasses() API has been used. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1254 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1255 if (indices == NULL || idnum_can_increment()) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1256 // we need a cache or the cache can grow |
0 | 1257 MutexLocker ml(JNICachedItableIndex_lock); |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1258 // reacquire the cache to see if another thread already did the work |
0 | 1259 indices = methods_cached_itable_indices_acquire(); |
1260 size_t length = 0; | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1261 // cache size is stored in element[0], other elements offset by one |
0 | 1262 if (indices == NULL || (length = (size_t)indices[0]) <= idnum) { |
1263 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count()); | |
1264 int* new_indices = NEW_C_HEAP_ARRAY(int, size+1); | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1265 new_indices[0] = (int)size; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1266 // copy any existing entries |
0 | 1267 size_t i; |
1268 for (i = 0; i < length; i++) { | |
1269 new_indices[i+1] = indices[i+1]; | |
1270 } | |
1271 // Set all the rest to -1 | |
1272 for (i = length; i < size; i++) { | |
1273 new_indices[i+1] = -1; | |
1274 } | |
1275 if (indices != NULL) { | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1276 // We have an old cache to delete so save it for after we |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1277 // drop the lock. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1278 to_dealloc_indices = indices; |
0 | 1279 } |
1280 release_set_methods_cached_itable_indices(indices = new_indices); | |
1281 } | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1282 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1283 if (idnum_can_increment()) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1284 // this cache can grow so we have to write to it safely |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1285 indices[idnum+1] = index; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1286 } |
0 | 1287 } else { |
1288 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); | |
1289 } | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1290 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1291 if (!idnum_can_increment()) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1292 // The cache cannot grow and this JNI itable index value does not |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1293 // have to be unique like a jmethodID. If there is a race to set it, |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1294 // it doesn't matter. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1295 indices[idnum+1] = index; |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1296 } |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1297 |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1298 if (to_dealloc_indices != NULL) { |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1299 // we allocated a new cache so free the old one |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1300 FreeHeap(to_dealloc_indices); |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
1301 } |
0 | 1302 } |
1303 | |
1304 | |
1305 // Retrieve a cached itable index | |
1306 int instanceKlass::cached_itable_index(size_t idnum) { | |
1307 int* indices = methods_cached_itable_indices_acquire(); | |
1308 if (indices != NULL && ((size_t)indices[0]) > idnum) { | |
1309 // indices exist and are long enough, retrieve possible cached | |
1310 return indices[idnum+1]; | |
1311 } | |
1312 return -1; | |
1313 } | |
1314 | |
1315 | |
1316 // | |
1317 // nmethodBucket is used to record dependent nmethods for | |
1318 // deoptimization. nmethod dependencies are actually <klass, method> | |
1319 // pairs but we really only care about the klass part for purposes of | |
1320 // finding nmethods which might need to be deoptimized. Instead of | |
1321 // recording the method, a count of how many times a particular nmethod | |
1322 // was recorded is kept. This ensures that any recording errors are | |
1323 // noticed since an nmethod should be removed as many times are it's | |
1324 // added. | |
1325 // | |
1326 class nmethodBucket { | |
1327 private: | |
1328 nmethod* _nmethod; | |
1329 int _count; | |
1330 nmethodBucket* _next; | |
1331 | |
1332 public: | |
1333 nmethodBucket(nmethod* nmethod, nmethodBucket* next) { | |
1334 _nmethod = nmethod; | |
1335 _next = next; | |
1336 _count = 1; | |
1337 } | |
1338 int count() { return _count; } | |
1339 int increment() { _count += 1; return _count; } | |
1340 int decrement() { _count -= 1; assert(_count >= 0, "don't underflow"); return _count; } | |
1341 nmethodBucket* next() { return _next; } | |
1342 void set_next(nmethodBucket* b) { _next = b; } | |
1343 nmethod* get_nmethod() { return _nmethod; } | |
1344 }; | |
1345 | |
1346 | |
1347 // | |
1348 // Walk the list of dependent nmethods searching for nmethods which | |
1349 // are dependent on the klassOop that was passed in and mark them for | |
1350 // deoptimization. Returns the number of nmethods found. | |
1351 // | |
1352 int instanceKlass::mark_dependent_nmethods(DepChange& changes) { | |
1353 assert_locked_or_safepoint(CodeCache_lock); | |
1354 int found = 0; | |
1355 nmethodBucket* b = _dependencies; | |
1356 while (b != NULL) { | |
1357 nmethod* nm = b->get_nmethod(); | |
1358 // since dependencies aren't removed until an nmethod becomes a zombie, | |
1359 // the dependency list may contain nmethods which aren't alive. | |
1360 if (nm->is_alive() && !nm->is_marked_for_deoptimization() && nm->check_dependency_on(changes)) { | |
1361 if (TraceDependencies) { | |
1362 ResourceMark rm; | |
1363 tty->print_cr("Marked for deoptimization"); | |
1364 tty->print_cr(" context = %s", this->external_name()); | |
1365 changes.print(); | |
1366 nm->print(); | |
1367 nm->print_dependencies(); | |
1368 } | |
1369 nm->mark_for_deoptimization(); | |
1370 found++; | |
1371 } | |
1372 b = b->next(); | |
1373 } | |
1374 return found; | |
1375 } | |
1376 | |
1377 | |
1378 // | |
1379 // Add an nmethodBucket to the list of dependencies for this nmethod. | |
1380 // It's possible that an nmethod has multiple dependencies on this klass | |
1381 // so a count is kept for each bucket to guarantee that creation and | |
1382 // deletion of dependencies is consistent. | |
1383 // | |
1384 void instanceKlass::add_dependent_nmethod(nmethod* nm) { | |
1385 assert_locked_or_safepoint(CodeCache_lock); | |
1386 nmethodBucket* b = _dependencies; | |
1387 nmethodBucket* last = NULL; | |
1388 while (b != NULL) { | |
1389 if (nm == b->get_nmethod()) { | |
1390 b->increment(); | |
1391 return; | |
1392 } | |
1393 b = b->next(); | |
1394 } | |
1395 _dependencies = new nmethodBucket(nm, _dependencies); | |
1396 } | |
1397 | |
1398 | |
1399 // | |
1400 // Decrement count of the nmethod in the dependency list and remove | |
1401 // the bucket competely when the count goes to 0. This method must | |
1402 // find a corresponding bucket otherwise there's a bug in the | |
1403 // recording of dependecies. | |
1404 // | |
1405 void instanceKlass::remove_dependent_nmethod(nmethod* nm) { | |
1406 assert_locked_or_safepoint(CodeCache_lock); | |
1407 nmethodBucket* b = _dependencies; | |
1408 nmethodBucket* last = NULL; | |
1409 while (b != NULL) { | |
1410 if (nm == b->get_nmethod()) { | |
1411 if (b->decrement() == 0) { | |
1412 if (last == NULL) { | |
1413 _dependencies = b->next(); | |
1414 } else { | |
1415 last->set_next(b->next()); | |
1416 } | |
1417 delete b; | |
1418 } | |
1419 return; | |
1420 } | |
1421 last = b; | |
1422 b = b->next(); | |
1423 } | |
1424 #ifdef ASSERT | |
1425 tty->print_cr("### %s can't find dependent nmethod:", this->external_name()); | |
1426 nm->print(); | |
1427 #endif // ASSERT | |
1428 ShouldNotReachHere(); | |
1429 } | |
1430 | |
1431 | |
1432 #ifndef PRODUCT | |
1433 void instanceKlass::print_dependent_nmethods(bool verbose) { | |
1434 nmethodBucket* b = _dependencies; | |
1435 int idx = 0; | |
1436 while (b != NULL) { | |
1437 nmethod* nm = b->get_nmethod(); | |
1438 tty->print("[%d] count=%d { ", idx++, b->count()); | |
1439 if (!verbose) { | |
1440 nm->print_on(tty, "nmethod"); | |
1441 tty->print_cr(" } "); | |
1442 } else { | |
1443 nm->print(); | |
1444 nm->print_dependencies(); | |
1445 tty->print_cr("--- } "); | |
1446 } | |
1447 b = b->next(); | |
1448 } | |
1449 } | |
1450 | |
1451 | |
1452 bool instanceKlass::is_dependent_nmethod(nmethod* nm) { | |
1453 nmethodBucket* b = _dependencies; | |
1454 while (b != NULL) { | |
1455 if (nm == b->get_nmethod()) { | |
1456 return true; | |
1457 } | |
1458 b = b->next(); | |
1459 } | |
1460 return false; | |
1461 } | |
1462 #endif //PRODUCT | |
1463 | |
1464 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1465 #ifdef ASSERT |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1466 template <class T> void assert_is_in(T *p) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1467 T heap_oop = oopDesc::load_heap_oop(p); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1468 if (!oopDesc::is_null(heap_oop)) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1469 oop o = oopDesc::decode_heap_oop_not_null(heap_oop); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1470 assert(Universe::heap()->is_in(o), "should be in heap"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1471 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1472 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1473 template <class T> void assert_is_in_closed_subset(T *p) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1474 T heap_oop = oopDesc::load_heap_oop(p); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1475 if (!oopDesc::is_null(heap_oop)) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1476 oop o = oopDesc::decode_heap_oop_not_null(heap_oop); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1477 assert(Universe::heap()->is_in_closed_subset(o), "should be in closed"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1478 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1479 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1480 template <class T> void assert_is_in_reserved(T *p) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1481 T heap_oop = oopDesc::load_heap_oop(p); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1482 if (!oopDesc::is_null(heap_oop)) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1483 oop o = oopDesc::decode_heap_oop_not_null(heap_oop); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1484 assert(Universe::heap()->is_in_reserved(o), "should be in reserved"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1485 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1486 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1487 template <class T> void assert_nothing(T *p) {} |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1488 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1489 #else |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1490 template <class T> void assert_is_in(T *p) {} |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1491 template <class T> void assert_is_in_closed_subset(T *p) {} |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1492 template <class T> void assert_is_in_reserved(T *p) {} |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1493 template <class T> void assert_nothing(T *p) {} |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1494 #endif // ASSERT |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1495 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1496 // |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1497 // Macros that iterate over areas of oops which are specialized on type of |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1498 // oop pointer either narrow or wide, depending on UseCompressedOops |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1499 // |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1500 // Parameters are: |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1501 // T - type of oop to point to (either oop or narrowOop) |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1502 // start_p - starting pointer for region to iterate over |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1503 // count - number of oops or narrowOops to iterate over |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1504 // do_oop - action to perform on each oop (it's arbitrary C code which |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1505 // makes it more efficient to put in a macro rather than making |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1506 // it a template function) |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1507 // assert_fn - assert function which is template function because performance |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1508 // doesn't matter when enabled. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1509 #define InstanceKlass_SPECIALIZED_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1510 T, start_p, count, do_oop, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1511 assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1512 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1513 T* p = (T*)(start_p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1514 T* const end = p + (count); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1515 while (p < end) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1516 (assert_fn)(p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1517 do_oop; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1518 ++p; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1519 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1520 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1521 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1522 #define InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1523 T, start_p, count, do_oop, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1524 assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1525 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1526 T* const start = (T*)(start_p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1527 T* p = start + (count); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1528 while (start < p) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1529 --p; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1530 (assert_fn)(p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1531 do_oop; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1532 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1533 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1534 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1535 #define InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1536 T, start_p, count, low, high, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1537 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1538 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1539 T* const l = (T*)(low); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1540 T* const h = (T*)(high); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1541 assert(mask_bits((intptr_t)l, sizeof(T)-1) == 0 && \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1542 mask_bits((intptr_t)h, sizeof(T)-1) == 0, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1543 "bounded region must be properly aligned"); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1544 T* p = (T*)(start_p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1545 T* end = p + (count); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1546 if (p < l) p = l; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1547 if (end > h) end = h; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1548 while (p < end) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1549 (assert_fn)(p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1550 do_oop; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1551 ++p; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1552 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1553 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1554 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1555 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1556 // The following macros call specialized macros, passing either oop or |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1557 // narrowOop as the specialization type. These test the UseCompressedOops |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1558 // flag. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1559 #define InstanceKlass_OOP_ITERATE(start_p, count, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1560 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1561 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1562 if (UseCompressedOops) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1563 InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1564 start_p, count, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1565 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1566 } else { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1567 InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1568 start_p, count, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1569 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1570 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1571 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1572 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1573 #define InstanceKlass_BOUNDED_OOP_ITERATE(start_p, count, low, high, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1574 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1575 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1576 if (UseCompressedOops) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1577 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1578 start_p, count, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1579 low, high, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1580 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1581 } else { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1582 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1583 start_p, count, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1584 low, high, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1585 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1586 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1587 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1588 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1589 #define InstanceKlass_OOP_MAP_ITERATE(obj, do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1590 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1591 /* Compute oopmap block range. The common case \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1592 is nonstatic_oop_map_size == 1. */ \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1593 OopMapBlock* map = start_of_nonstatic_oop_maps(); \ |
938 | 1594 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1595 if (UseCompressedOops) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1596 while (map < end_map) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1597 InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \ |
938 | 1598 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1599 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1600 ++map; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1601 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1602 } else { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1603 while (map < end_map) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1604 InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \ |
938 | 1605 obj->obj_field_addr<oop>(map->offset()), map->count(), \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1606 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1607 ++map; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1608 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1609 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1610 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1611 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1612 #define InstanceKlass_OOP_MAP_REVERSE_ITERATE(obj, do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1613 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1614 OopMapBlock* const start_map = start_of_nonstatic_oop_maps(); \ |
938 | 1615 OopMapBlock* map = start_map + nonstatic_oop_map_count(); \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1616 if (UseCompressedOops) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1617 while (start_map < map) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1618 --map; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1619 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(narrowOop, \ |
938 | 1620 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1621 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1622 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1623 } else { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1624 while (start_map < map) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1625 --map; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1626 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(oop, \ |
938 | 1627 obj->obj_field_addr<oop>(map->offset()), map->count(), \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1628 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1629 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1630 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1631 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1632 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1633 #define InstanceKlass_BOUNDED_OOP_MAP_ITERATE(obj, low, high, do_oop, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1634 assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1635 { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1636 /* Compute oopmap block range. The common case is \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1637 nonstatic_oop_map_size == 1, so we accept the \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1638 usually non-existent extra overhead of examining \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1639 all the maps. */ \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1640 OopMapBlock* map = start_of_nonstatic_oop_maps(); \ |
938 | 1641 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1642 if (UseCompressedOops) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1643 while (map < end_map) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1644 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \ |
938 | 1645 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1646 low, high, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1647 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1648 ++map; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1649 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1650 } else { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1651 while (map < end_map) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1652 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \ |
938 | 1653 obj->obj_field_addr<oop>(map->offset()), map->count(), \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1654 low, high, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1655 do_oop, assert_fn) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1656 ++map; \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1657 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1658 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1659 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1660 |
0 | 1661 void instanceKlass::follow_static_fields() { |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1662 InstanceKlass_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1663 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1664 MarkSweep::mark_and_push(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1665 assert_is_in_closed_subset) |
0 | 1666 } |
1667 | |
1668 #ifndef SERIALGC | |
1669 void instanceKlass::follow_static_fields(ParCompactionManager* cm) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1670 InstanceKlass_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1671 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1672 PSParallelCompact::mark_and_push(cm, p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1673 assert_is_in) |
0 | 1674 } |
1675 #endif // SERIALGC | |
1676 | |
1677 void instanceKlass::adjust_static_fields() { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1678 InstanceKlass_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1679 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1680 MarkSweep::adjust_pointer(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1681 assert_nothing) |
0 | 1682 } |
1683 | |
1684 #ifndef SERIALGC | |
1685 void instanceKlass::update_static_fields() { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1686 InstanceKlass_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1687 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1688 PSParallelCompact::adjust_pointer(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1689 assert_nothing) |
0 | 1690 } |
1691 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1692 void instanceKlass::update_static_fields(HeapWord* beg_addr, HeapWord* end_addr) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1693 InstanceKlass_BOUNDED_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1694 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1695 beg_addr, end_addr, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1696 PSParallelCompact::adjust_pointer(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1697 assert_nothing ) |
0 | 1698 } |
1699 #endif // SERIALGC | |
1700 | |
1701 void instanceKlass::oop_follow_contents(oop obj) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1702 assert(obj != NULL, "can't follow the content of NULL object"); |
0 | 1703 obj->follow_header(); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1704 InstanceKlass_OOP_MAP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1705 obj, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1706 MarkSweep::mark_and_push(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1707 assert_is_in_closed_subset) |
0 | 1708 } |
1709 | |
1710 #ifndef SERIALGC | |
1711 void instanceKlass::oop_follow_contents(ParCompactionManager* cm, | |
1712 oop obj) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1713 assert(obj != NULL, "can't follow the content of NULL object"); |
0 | 1714 obj->follow_header(cm); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1715 InstanceKlass_OOP_MAP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1716 obj, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1717 PSParallelCompact::mark_and_push(cm, p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1718 assert_is_in) |
0 | 1719 } |
1720 #endif // SERIALGC | |
1721 | |
1722 // closure's do_header() method dicates whether the given closure should be | |
1723 // applied to the klass ptr in the object header. | |
1724 | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1725 #define InstanceKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1726 \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1727 int instanceKlass::oop_oop_iterate##nv_suffix(oop obj, OopClosureType* closure) { \ |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1728 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1729 /* header */ \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1730 if (closure->do_header()) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1731 obj->oop_iterate_header(closure); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1732 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1733 InstanceKlass_OOP_MAP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1734 obj, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1735 SpecializationStats:: \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1736 record_do_oop_call##nv_suffix(SpecializationStats::ik); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1737 (closure)->do_oop##nv_suffix(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1738 assert_is_in_closed_subset) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1739 return size_helper(); \ |
0 | 1740 } |
1741 | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1742 #ifndef SERIALGC |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1743 #define InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1744 \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1745 int instanceKlass::oop_oop_iterate_backwards##nv_suffix(oop obj, \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1746 OopClosureType* closure) { \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1747 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik); \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1748 /* header */ \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1749 if (closure->do_header()) { \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1750 obj->oop_iterate_header(closure); \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1751 } \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1752 /* instance variables */ \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1753 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1754 obj, \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1755 SpecializationStats::record_do_oop_call##nv_suffix(SpecializationStats::ik);\ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1756 (closure)->do_oop##nv_suffix(p), \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1757 assert_is_in_closed_subset) \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1758 return size_helper(); \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1759 } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1760 #endif // !SERIALGC |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1761 |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1762 #define InstanceKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1763 \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1764 int instanceKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1765 OopClosureType* closure, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1766 MemRegion mr) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1767 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1768 if (closure->do_header()) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1769 obj->oop_iterate_header(closure, mr); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1770 } \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1771 InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1772 obj, mr.start(), mr.end(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1773 (closure)->do_oop##nv_suffix(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1774 assert_is_in_closed_subset) \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1775 return size_helper(); \ |
0 | 1776 } |
1777 | |
1778 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN) | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1779 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN) |
0 | 1780 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN_m) |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1781 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN_m) |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1782 #ifndef SERIALGC |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1783 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN) |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1784 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN) |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
1785 #endif // !SERIALGC |
0 | 1786 |
1787 void instanceKlass::iterate_static_fields(OopClosure* closure) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1788 InstanceKlass_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1789 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1790 closure->do_oop(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1791 assert_is_in_reserved) |
0 | 1792 } |
1793 | |
1794 void instanceKlass::iterate_static_fields(OopClosure* closure, | |
1795 MemRegion mr) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1796 InstanceKlass_BOUNDED_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1797 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1798 mr.start(), mr.end(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1799 (closure)->do_oop_v(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1800 assert_is_in_closed_subset) |
0 | 1801 } |
1802 | |
1803 int instanceKlass::oop_adjust_pointers(oop obj) { | |
1804 int size = size_helper(); | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1805 InstanceKlass_OOP_MAP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1806 obj, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1807 MarkSweep::adjust_pointer(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1808 assert_is_in) |
0 | 1809 obj->adjust_header(); |
1810 return size; | |
1811 } | |
1812 | |
1813 #ifndef SERIALGC | |
1814 void instanceKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1815 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1816 obj, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1817 if (PSScavenge::should_scavenge(p)) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1818 pm->claim_or_forward_depth(p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1819 }, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1820 assert_nothing ) |
0 | 1821 } |
1822 | |
1823 int instanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1824 InstanceKlass_OOP_MAP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1825 obj, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1826 PSParallelCompact::adjust_pointer(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1827 assert_nothing) |
0 | 1828 return size_helper(); |
1829 } | |
1830 | |
1831 int instanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, | |
1832 HeapWord* beg_addr, HeapWord* end_addr) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1833 InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1834 obj, beg_addr, end_addr, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1835 PSParallelCompact::adjust_pointer(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1836 assert_nothing) |
0 | 1837 return size_helper(); |
1838 } | |
1839 | |
1840 void instanceKlass::push_static_fields(PSPromotionManager* pm) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1841 InstanceKlass_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1842 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1843 if (PSScavenge::should_scavenge(p)) { \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1844 pm->claim_or_forward_depth(p); \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1845 }, \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1846 assert_nothing ) |
0 | 1847 } |
1848 | |
1849 void instanceKlass::copy_static_fields(ParCompactionManager* cm) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1850 InstanceKlass_OOP_ITERATE( \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1851 start_of_static_fields(), static_oop_field_size(), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1852 PSParallelCompact::adjust_pointer(p), \ |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
1853 assert_is_in) |
0 | 1854 } |
1855 #endif // SERIALGC | |
1856 | |
1857 // This klass is alive but the implementor link is not followed/updated. | |
1858 // Subklass and sibling links are handled by Klass::follow_weak_klass_links | |
1859 | |
1860 void instanceKlass::follow_weak_klass_links( | |
1861 BoolObjectClosure* is_alive, OopClosure* keep_alive) { | |
1862 assert(is_alive->do_object_b(as_klassOop()), "this oop should be live"); | |
1863 if (ClassUnloading) { | |
1864 for (int i = 0; i < implementors_limit; i++) { | |
1865 klassOop impl = _implementors[i]; | |
1866 if (impl == NULL) break; // no more in the list | |
1867 if (!is_alive->do_object_b(impl)) { | |
1868 // remove this guy from the list by overwriting him with the tail | |
1869 int lasti = --_nof_implementors; | |
1870 assert(lasti >= i && lasti < implementors_limit, "just checking"); | |
1871 _implementors[i] = _implementors[lasti]; | |
1872 _implementors[lasti] = NULL; | |
1873 --i; // rerun the loop at this index | |
1874 } | |
1875 } | |
1876 } else { | |
1877 for (int i = 0; i < implementors_limit; i++) { | |
1878 keep_alive->do_oop(&adr_implementors()[i]); | |
1879 } | |
1880 } | |
1881 Klass::follow_weak_klass_links(is_alive, keep_alive); | |
1882 } | |
1883 | |
1884 void instanceKlass::remove_unshareable_info() { | |
1885 Klass::remove_unshareable_info(); | |
1886 init_implementor(); | |
1887 } | |
1888 | |
1889 static void clear_all_breakpoints(methodOop m) { | |
1890 m->clear_all_breakpoints(); | |
1891 } | |
1892 | |
1893 void instanceKlass::release_C_heap_structures() { | |
1894 // Deallocate oop map cache | |
1895 if (_oop_map_cache != NULL) { | |
1896 delete _oop_map_cache; | |
1897 _oop_map_cache = NULL; | |
1898 } | |
1899 | |
1900 // Deallocate JNI identifiers for jfieldIDs | |
1901 JNIid::deallocate(jni_ids()); | |
1902 set_jni_ids(NULL); | |
1903 | |
1904 jmethodID* jmeths = methods_jmethod_ids_acquire(); | |
1905 if (jmeths != (jmethodID*)NULL) { | |
1906 release_set_methods_jmethod_ids(NULL); | |
1907 FreeHeap(jmeths); | |
1908 } | |
1909 | |
1910 int* indices = methods_cached_itable_indices_acquire(); | |
1911 if (indices != (int*)NULL) { | |
1912 release_set_methods_cached_itable_indices(NULL); | |
1913 FreeHeap(indices); | |
1914 } | |
1915 | |
1916 // release dependencies | |
1917 nmethodBucket* b = _dependencies; | |
1918 _dependencies = NULL; | |
1919 while (b != NULL) { | |
1920 nmethodBucket* next = b->next(); | |
1921 delete b; | |
1922 b = next; | |
1923 } | |
1924 | |
1925 // Deallocate breakpoint records | |
1926 if (breakpoints() != 0x0) { | |
1927 methods_do(clear_all_breakpoints); | |
1928 assert(breakpoints() == 0x0, "should have cleared breakpoints"); | |
1929 } | |
1930 | |
1931 // deallocate information about previous versions | |
1932 if (_previous_versions != NULL) { | |
1933 for (int i = _previous_versions->length() - 1; i >= 0; i--) { | |
1934 PreviousVersionNode * pv_node = _previous_versions->at(i); | |
1935 delete pv_node; | |
1936 } | |
1937 delete _previous_versions; | |
1938 _previous_versions = NULL; | |
1939 } | |
1940 | |
1941 // deallocate the cached class file | |
1942 if (_cached_class_file_bytes != NULL) { | |
1943 os::free(_cached_class_file_bytes); | |
1944 _cached_class_file_bytes = NULL; | |
1945 _cached_class_file_len = 0; | |
1946 } | |
1947 } | |
1948 | |
1039
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
1949 const char* instanceKlass::signature_name() const { |
0 | 1950 const char* src = (const char*) (name()->as_C_string()); |
1951 const int src_length = (int)strlen(src); | |
1952 char* dest = NEW_RESOURCE_ARRAY(char, src_length + 3); | |
1953 int src_index = 0; | |
1954 int dest_index = 0; | |
1955 dest[dest_index++] = 'L'; | |
1956 while (src_index < src_length) { | |
1957 dest[dest_index++] = src[src_index++]; | |
1958 } | |
1959 dest[dest_index++] = ';'; | |
1960 dest[dest_index] = '\0'; | |
1961 return dest; | |
1962 } | |
1963 | |
1964 // different verisons of is_same_class_package | |
1965 bool instanceKlass::is_same_class_package(klassOop class2) { | |
1966 klassOop class1 = as_klassOop(); | |
1967 oop classloader1 = instanceKlass::cast(class1)->class_loader(); | |
1968 symbolOop classname1 = Klass::cast(class1)->name(); | |
1969 | |
1970 if (Klass::cast(class2)->oop_is_objArray()) { | |
1971 class2 = objArrayKlass::cast(class2)->bottom_klass(); | |
1972 } | |
1973 oop classloader2; | |
1974 if (Klass::cast(class2)->oop_is_instance()) { | |
1975 classloader2 = instanceKlass::cast(class2)->class_loader(); | |
1976 } else { | |
1977 assert(Klass::cast(class2)->oop_is_typeArray(), "should be type array"); | |
1978 classloader2 = NULL; | |
1979 } | |
1980 symbolOop classname2 = Klass::cast(class2)->name(); | |
1981 | |
1982 return instanceKlass::is_same_class_package(classloader1, classname1, | |
1983 classloader2, classname2); | |
1984 } | |
1985 | |
1986 bool instanceKlass::is_same_class_package(oop classloader2, symbolOop classname2) { | |
1987 klassOop class1 = as_klassOop(); | |
1988 oop classloader1 = instanceKlass::cast(class1)->class_loader(); | |
1989 symbolOop classname1 = Klass::cast(class1)->name(); | |
1990 | |
1991 return instanceKlass::is_same_class_package(classloader1, classname1, | |
1992 classloader2, classname2); | |
1993 } | |
1994 | |
1995 // return true if two classes are in the same package, classloader | |
1996 // and classname information is enough to determine a class's package | |
1997 bool instanceKlass::is_same_class_package(oop class_loader1, symbolOop class_name1, | |
1998 oop class_loader2, symbolOop class_name2) { | |
1999 if (class_loader1 != class_loader2) { | |
2000 return false; | |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2001 } else if (class_name1 == class_name2) { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2002 return true; // skip painful bytewise comparison |
0 | 2003 } else { |
2004 ResourceMark rm; | |
2005 | |
2006 // The symbolOop's are in UTF8 encoding. Since we only need to check explicitly | |
2007 // for ASCII characters ('/', 'L', '['), we can keep them in UTF8 encoding. | |
2008 // Otherwise, we just compare jbyte values between the strings. | |
2009 jbyte *name1 = class_name1->base(); | |
2010 jbyte *name2 = class_name2->base(); | |
2011 | |
2012 jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/'); | |
2013 jbyte *last_slash2 = UTF8::strrchr(name2, class_name2->utf8_length(), '/'); | |
2014 | |
2015 if ((last_slash1 == NULL) || (last_slash2 == NULL)) { | |
2016 // One of the two doesn't have a package. Only return true | |
2017 // if the other one also doesn't have a package. | |
2018 return last_slash1 == last_slash2; | |
2019 } else { | |
2020 // Skip over '['s | |
2021 if (*name1 == '[') { | |
2022 do { | |
2023 name1++; | |
2024 } while (*name1 == '['); | |
2025 if (*name1 != 'L') { | |
2026 // Something is terribly wrong. Shouldn't be here. | |
2027 return false; | |
2028 } | |
2029 } | |
2030 if (*name2 == '[') { | |
2031 do { | |
2032 name2++; | |
2033 } while (*name2 == '['); | |
2034 if (*name2 != 'L') { | |
2035 // Something is terribly wrong. Shouldn't be here. | |
2036 return false; | |
2037 } | |
2038 } | |
2039 | |
2040 // Check that package part is identical | |
2041 int length1 = last_slash1 - name1; | |
2042 int length2 = last_slash2 - name2; | |
2043 | |
2044 return UTF8::equal(name1, length1, name2, length2); | |
2045 } | |
2046 } | |
2047 } | |
2048 | |
652
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2049 // Returns true iff super_method can be overridden by a method in targetclassname |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2050 // See JSL 3rd edition 8.4.6.1 |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2051 // Assumes name-signature match |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2052 // "this" is instanceKlass of super_method which must exist |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2053 // note that the instanceKlass of the method in the targetclassname has not always been created yet |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2054 bool instanceKlass::is_override(methodHandle super_method, Handle targetclassloader, symbolHandle targetclassname, TRAPS) { |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2055 // Private methods can not be overridden |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2056 if (super_method->is_private()) { |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2057 return false; |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2058 } |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2059 // If super method is accessible, then override |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2060 if ((super_method->is_protected()) || |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2061 (super_method->is_public())) { |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2062 return true; |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2063 } |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2064 // Package-private methods are not inherited outside of package |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2065 assert(super_method->is_package_private(), "must be package private"); |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2066 return(is_same_class_package(targetclassloader(), targetclassname())); |
4aaa9f5e02a8
4766230: Hotspot vtable inconsistencies cause core dumps. 6579515. 6582242.
acorn
parents:
605
diff
changeset
|
2067 } |
0 | 2068 |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2069 /* defined for now in jvm.cpp, for historical reasons *-- |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2070 klassOop instanceKlass::compute_enclosing_class_impl(instanceKlassHandle self, |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2071 symbolOop& simple_name_result, TRAPS) { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2072 ... |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2073 } |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2074 */ |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2075 |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2076 // tell if two classes have the same enclosing class (at package level) |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2077 bool instanceKlass::is_same_package_member_impl(instanceKlassHandle class1, |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2078 klassOop class2_oop, TRAPS) { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2079 if (class2_oop == class1->as_klassOop()) return true; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2080 if (!Klass::cast(class2_oop)->oop_is_instance()) return false; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2081 instanceKlassHandle class2(THREAD, class2_oop); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2082 |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2083 // must be in same package before we try anything else |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2084 if (!class1->is_same_class_package(class2->class_loader(), class2->name())) |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2085 return false; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2086 |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2087 // As long as there is an outer1.getEnclosingClass, |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2088 // shift the search outward. |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2089 instanceKlassHandle outer1 = class1; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2090 for (;;) { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2091 // As we walk along, look for equalities between outer1 and class2. |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2092 // Eventually, the walks will terminate as outer1 stops |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2093 // at the top-level class around the original class. |
1126
933a3e806ce6
6895168: JCK api/signaturetest/sigtest.basic.html#basic test fails for jdk 5.0 with HS 16 in nightly build
xlu
parents:
1039
diff
changeset
|
2094 bool ignore_inner_is_member; |
933a3e806ce6
6895168: JCK api/signaturetest/sigtest.basic.html#basic test fails for jdk 5.0 with HS 16 in nightly build
xlu
parents:
1039
diff
changeset
|
2095 klassOop next = outer1->compute_enclosing_class(&ignore_inner_is_member, |
933a3e806ce6
6895168: JCK api/signaturetest/sigtest.basic.html#basic test fails for jdk 5.0 with HS 16 in nightly build
xlu
parents:
1039
diff
changeset
|
2096 CHECK_false); |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2097 if (next == NULL) break; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2098 if (next == class2()) return true; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2099 outer1 = instanceKlassHandle(THREAD, next); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2100 } |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2101 |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2102 // Now do the same for class2. |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2103 instanceKlassHandle outer2 = class2; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2104 for (;;) { |
1126
933a3e806ce6
6895168: JCK api/signaturetest/sigtest.basic.html#basic test fails for jdk 5.0 with HS 16 in nightly build
xlu
parents:
1039
diff
changeset
|
2105 bool ignore_inner_is_member; |
933a3e806ce6
6895168: JCK api/signaturetest/sigtest.basic.html#basic test fails for jdk 5.0 with HS 16 in nightly build
xlu
parents:
1039
diff
changeset
|
2106 klassOop next = outer2->compute_enclosing_class(&ignore_inner_is_member, |
933a3e806ce6
6895168: JCK api/signaturetest/sigtest.basic.html#basic test fails for jdk 5.0 with HS 16 in nightly build
xlu
parents:
1039
diff
changeset
|
2107 CHECK_false); |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2108 if (next == NULL) break; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2109 // Might as well check the new outer against all available values. |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2110 if (next == class1()) return true; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2111 if (next == outer1()) return true; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2112 outer2 = instanceKlassHandle(THREAD, next); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2113 } |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2114 |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2115 // If by this point we have not found an equality between the |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2116 // two classes, we know they are in separate package members. |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2117 return false; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2118 } |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2119 |
0 | 2120 |
2121 jint instanceKlass::compute_modifier_flags(TRAPS) const { | |
2122 klassOop k = as_klassOop(); | |
2123 jint access = access_flags().as_int(); | |
2124 | |
2125 // But check if it happens to be member class. | |
2126 typeArrayOop inner_class_list = inner_classes(); | |
2127 int length = (inner_class_list == NULL) ? 0 : inner_class_list->length(); | |
2128 assert (length % instanceKlass::inner_class_next_offset == 0, "just checking"); | |
2129 if (length > 0) { | |
2130 typeArrayHandle inner_class_list_h(THREAD, inner_class_list); | |
2131 instanceKlassHandle ik(THREAD, k); | |
2132 for (int i = 0; i < length; i += instanceKlass::inner_class_next_offset) { | |
2133 int ioff = inner_class_list_h->ushort_at( | |
2134 i + instanceKlass::inner_class_inner_class_info_offset); | |
2135 | |
2136 // Inner class attribute can be zero, skip it. | |
2137 // Strange but true: JVM spec. allows null inner class refs. | |
2138 if (ioff == 0) continue; | |
2139 | |
2140 // only look at classes that are already loaded | |
2141 // since we are looking for the flags for our self. | |
2142 symbolOop inner_name = ik->constants()->klass_name_at(ioff); | |
2143 if ((ik->name() == inner_name)) { | |
2144 // This is really a member class. | |
2145 access = inner_class_list_h->ushort_at(i + instanceKlass::inner_class_access_flags_offset); | |
2146 break; | |
2147 } | |
2148 } | |
2149 } | |
2150 // Remember to strip ACC_SUPER bit | |
2151 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS; | |
2152 } | |
2153 | |
2154 jint instanceKlass::jvmti_class_status() const { | |
2155 jint result = 0; | |
2156 | |
2157 if (is_linked()) { | |
2158 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED; | |
2159 } | |
2160 | |
2161 if (is_initialized()) { | |
2162 assert(is_linked(), "Class status is not consistent"); | |
2163 result |= JVMTI_CLASS_STATUS_INITIALIZED; | |
2164 } | |
2165 if (is_in_error_state()) { | |
2166 result |= JVMTI_CLASS_STATUS_ERROR; | |
2167 } | |
2168 return result; | |
2169 } | |
2170 | |
2171 methodOop instanceKlass::method_at_itable(klassOop holder, int index, TRAPS) { | |
2172 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable(); | |
2173 int method_table_offset_in_words = ioe->offset()/wordSize; | |
2174 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words()) | |
2175 / itableOffsetEntry::size(); | |
2176 | |
2177 for (int cnt = 0 ; ; cnt ++, ioe ++) { | |
605 | 2178 // If the interface isn't implemented by the receiver class, |
0 | 2179 // the VM should throw IncompatibleClassChangeError. |
2180 if (cnt >= nof_interfaces) { | |
2181 THROW_OOP_0(vmSymbols::java_lang_IncompatibleClassChangeError()); | |
2182 } | |
2183 | |
2184 klassOop ik = ioe->interface_klass(); | |
2185 if (ik == holder) break; | |
2186 } | |
2187 | |
2188 itableMethodEntry* ime = ioe->first_method_entry(as_klassOop()); | |
2189 methodOop m = ime[index].method(); | |
2190 if (m == NULL) { | |
2191 THROW_OOP_0(vmSymbols::java_lang_AbstractMethodError()); | |
2192 } | |
2193 return m; | |
2194 } | |
2195 | |
2196 // On-stack replacement stuff | |
2197 void instanceKlass::add_osr_nmethod(nmethod* n) { | |
2198 // only one compilation can be active | |
2199 NEEDS_CLEANUP | |
2200 // This is a short non-blocking critical region, so the no safepoint check is ok. | |
2201 OsrList_lock->lock_without_safepoint_check(); | |
2202 assert(n->is_osr_method(), "wrong kind of nmethod"); | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
876
diff
changeset
|
2203 n->set_osr_link(osr_nmethods_head()); |
0 | 2204 set_osr_nmethods_head(n); |
1783 | 2205 // Raise the highest osr level if necessary |
2206 if (TieredCompilation) { | |
2207 methodOop m = n->method(); | |
2208 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level())); | |
2209 } | |
0 | 2210 // Remember to unlock again |
2211 OsrList_lock->unlock(); | |
1783 | 2212 |
2213 // Get rid of the osr methods for the same bci that have lower levels. | |
2214 if (TieredCompilation) { | |
2215 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) { | |
2216 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true); | |
2217 if (inv != NULL && inv->is_in_use()) { | |
2218 inv->make_not_entrant(); | |
2219 } | |
2220 } | |
2221 } | |
0 | 2222 } |
2223 | |
2224 | |
2225 void instanceKlass::remove_osr_nmethod(nmethod* n) { | |
2226 // This is a short non-blocking critical region, so the no safepoint check is ok. | |
2227 OsrList_lock->lock_without_safepoint_check(); | |
2228 assert(n->is_osr_method(), "wrong kind of nmethod"); | |
2229 nmethod* last = NULL; | |
2230 nmethod* cur = osr_nmethods_head(); | |
1783 | 2231 int max_level = CompLevel_none; // Find the max comp level excluding n |
2232 methodOop m = n->method(); | |
0 | 2233 // Search for match |
2234 while(cur != NULL && cur != n) { | |
1783 | 2235 if (TieredCompilation) { |
2236 // Find max level before n | |
2237 max_level = MAX2(max_level, cur->comp_level()); | |
2238 } | |
0 | 2239 last = cur; |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
876
diff
changeset
|
2240 cur = cur->osr_link(); |
0 | 2241 } |
1783 | 2242 nmethod* next = NULL; |
0 | 2243 if (cur == n) { |
1783 | 2244 next = cur->osr_link(); |
0 | 2245 if (last == NULL) { |
2246 // Remove first element | |
1783 | 2247 set_osr_nmethods_head(next); |
0 | 2248 } else { |
1783 | 2249 last->set_osr_link(next); |
0 | 2250 } |
2251 } | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
876
diff
changeset
|
2252 n->set_osr_link(NULL); |
1783 | 2253 if (TieredCompilation) { |
2254 cur = next; | |
2255 while (cur != NULL) { | |
2256 // Find max level after n | |
2257 max_level = MAX2(max_level, cur->comp_level()); | |
2258 cur = cur->osr_link(); | |
2259 } | |
2260 m->set_highest_osr_comp_level(max_level); | |
2261 } | |
0 | 2262 // Remember to unlock again |
2263 OsrList_lock->unlock(); | |
2264 } | |
2265 | |
1783 | 2266 nmethod* instanceKlass::lookup_osr_nmethod(const methodOop m, int bci, int comp_level, bool match_level) const { |
0 | 2267 // This is a short non-blocking critical region, so the no safepoint check is ok. |
2268 OsrList_lock->lock_without_safepoint_check(); | |
2269 nmethod* osr = osr_nmethods_head(); | |
1783 | 2270 nmethod* best = NULL; |
0 | 2271 while (osr != NULL) { |
2272 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain"); | |
1783 | 2273 // There can be a time when a c1 osr method exists but we are waiting |
2274 // for a c2 version. When c2 completes its osr nmethod we will trash | |
2275 // the c1 version and only be able to find the c2 version. However | |
2276 // while we overflow in the c1 code at back branches we don't want to | |
2277 // try and switch to the same code as we are already running | |
2278 | |
0 | 2279 if (osr->method() == m && |
2280 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) { | |
1783 | 2281 if (match_level) { |
2282 if (osr->comp_level() == comp_level) { | |
2283 // Found a match - return it. | |
2284 OsrList_lock->unlock(); | |
2285 return osr; | |
2286 } | |
2287 } else { | |
2288 if (best == NULL || (osr->comp_level() > best->comp_level())) { | |
2289 if (osr->comp_level() == CompLevel_highest_tier) { | |
2290 // Found the best possible - return it. | |
2291 OsrList_lock->unlock(); | |
2292 return osr; | |
2293 } | |
2294 best = osr; | |
2295 } | |
2296 } | |
0 | 2297 } |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
876
diff
changeset
|
2298 osr = osr->osr_link(); |
0 | 2299 } |
2300 OsrList_lock->unlock(); | |
1783 | 2301 if (best != NULL && best->comp_level() >= comp_level && match_level == false) { |
2302 return best; | |
2303 } | |
0 | 2304 return NULL; |
2305 } | |
2306 | |
2307 // ----------------------------------------------------------------------------------------------------- | |
2308 #ifndef PRODUCT | |
2309 | |
2310 // Printing | |
2311 | |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2312 #define BULLET " - " |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2313 |
0 | 2314 void FieldPrinter::do_field(fieldDescriptor* fd) { |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2315 _st->print(BULLET); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2316 if (fd->is_static() || (_obj == NULL)) { |
0 | 2317 fd->print_on(_st); |
2318 _st->cr(); | |
2319 } else { | |
2320 fd->print_on_for(_st, _obj); | |
2321 _st->cr(); | |
2322 } | |
2323 } | |
2324 | |
2325 | |
2326 void instanceKlass::oop_print_on(oop obj, outputStream* st) { | |
2327 Klass::oop_print_on(obj, st); | |
2328 | |
1142 | 2329 if (as_klassOop() == SystemDictionary::String_klass()) { |
0 | 2330 typeArrayOop value = java_lang_String::value(obj); |
2331 juint offset = java_lang_String::offset(obj); | |
2332 juint length = java_lang_String::length(obj); | |
2333 if (value != NULL && | |
2334 value->is_typeArray() && | |
2335 offset <= (juint) value->length() && | |
2336 offset + length <= (juint) value->length()) { | |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2337 st->print(BULLET"string: "); |
0 | 2338 Handle h_obj(obj); |
2339 java_lang_String::print(h_obj, st); | |
2340 st->cr(); | |
2341 if (!WizardMode) return; // that is enough | |
2342 } | |
2343 } | |
2344 | |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2345 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj)); |
0 | 2346 FieldPrinter print_nonstatic_field(st, obj); |
2347 do_nonstatic_fields(&print_nonstatic_field); | |
2348 | |
1142 | 2349 if (as_klassOop() == SystemDictionary::Class_klass()) { |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2350 st->print(BULLET"signature: "); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2351 java_lang_Class::print_signature(obj, st); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2352 st->cr(); |
0 | 2353 klassOop mirrored_klass = java_lang_Class::as_klassOop(obj); |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2354 st->print(BULLET"fake entry for mirror: "); |
0 | 2355 mirrored_klass->print_value_on(st); |
2356 st->cr(); | |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2357 st->print(BULLET"fake entry resolved_constructor: "); |
0 | 2358 methodOop ctor = java_lang_Class::resolved_constructor(obj); |
2359 ctor->print_value_on(st); | |
2360 klassOop array_klass = java_lang_Class::array_klass(obj); | |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2361 st->cr(); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2362 st->print(BULLET"fake entry for array: "); |
0 | 2363 array_klass->print_value_on(st); |
2364 st->cr(); | |
1039
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
2365 } else if (as_klassOop() == SystemDictionary::MethodType_klass()) { |
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
2366 st->print(BULLET"signature: "); |
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
2367 java_dyn_MethodType::print_signature(obj, st); |
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
2368 st->cr(); |
0 | 2369 } |
2370 } | |
2371 | |
1155
4e6abf09f540
6912062: disassembler plugin needs to produce symbolic information in product mode
jrose
parents:
1144
diff
changeset
|
2372 #endif //PRODUCT |
4e6abf09f540
6912062: disassembler plugin needs to produce symbolic information in product mode
jrose
parents:
1144
diff
changeset
|
2373 |
0 | 2374 void instanceKlass::oop_print_value_on(oop obj, outputStream* st) { |
2375 st->print("a "); | |
2376 name()->print_value_on(st); | |
2377 obj->print_address_on(st); | |
1142 | 2378 if (as_klassOop() == SystemDictionary::String_klass() |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2379 && java_lang_String::value(obj) != NULL) { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2380 ResourceMark rm; |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2381 int len = java_lang_String::length(obj); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2382 int plen = (len < 24 ? len : 12); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2383 char* str = java_lang_String::as_utf8_string(obj, 0, plen); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2384 st->print(" = \"%s\"", str); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2385 if (len > plen) |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2386 st->print("...[%d]", len); |
1142 | 2387 } else if (as_klassOop() == SystemDictionary::Class_klass()) { |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2388 klassOop k = java_lang_Class::as_klassOop(obj); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2389 st->print(" = "); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2390 if (k != NULL) { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2391 k->print_value_on(st); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2392 } else { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2393 const char* tname = type2name(java_lang_Class::primitive_type(obj)); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2394 st->print("%s", tname ? tname : "type?"); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2395 } |
1039
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
2396 } else if (as_klassOop() == SystemDictionary::MethodType_klass()) { |
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
2397 st->print(" = "); |
987e948ebbc8
6815692: method handle code needs some cleanup (post-6655638)
jrose
parents:
997
diff
changeset
|
2398 java_dyn_MethodType::print_signature(obj, st); |
665
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2399 } else if (java_lang_boxing_object::is_instance(obj)) { |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2400 st->print(" = "); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2401 java_lang_boxing_object::print(obj, st); |
c89f86385056
6814659: separable cleanups and subroutines for 6655638
jrose
parents:
605
diff
changeset
|
2402 } |
0 | 2403 } |
2404 | |
2405 const char* instanceKlass::internal_name() const { | |
2406 return external_name(); | |
2407 } | |
2408 | |
2409 // Verification | |
2410 | |
2411 class VerifyFieldClosure: public OopClosure { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2412 protected: |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2413 template <class T> void do_oop_work(T* p) { |
0 | 2414 guarantee(Universe::heap()->is_in_closed_subset(p), "should be in heap"); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2415 oop obj = oopDesc::load_decode_heap_oop(p); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2416 if (!obj->is_oop_or_null()) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2417 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p, (address)obj); |
0 | 2418 Universe::print(); |
2419 guarantee(false, "boom"); | |
2420 } | |
2421 } | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2422 public: |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2423 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2424 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); } |
0 | 2425 }; |
2426 | |
2427 void instanceKlass::oop_verify_on(oop obj, outputStream* st) { | |
2428 Klass::oop_verify_on(obj, st); | |
2429 VerifyFieldClosure blk; | |
2430 oop_oop_iterate(obj, &blk); | |
2431 } | |
2432 | |
2433 #ifndef PRODUCT | |
2434 | |
2435 void instanceKlass::verify_class_klass_nonstatic_oop_maps(klassOop k) { | |
2436 // This verification code is disabled. JDK_Version::is_gte_jdk14x_version() | |
2437 // cannot be called since this function is called before the VM is | |
2438 // able to determine what JDK version is running with. | |
2439 // The check below always is false since 1.4. | |
2440 return; | |
2441 | |
2442 // This verification code temporarily disabled for the 1.4 | |
2443 // reflection implementation since java.lang.Class now has | |
2444 // Java-level instance fields. Should rewrite this to handle this | |
2445 // case. | |
2446 if (!(JDK_Version::is_gte_jdk14x_version() && UseNewReflection)) { | |
2447 // Verify that java.lang.Class instances have a fake oop field added. | |
2448 instanceKlass* ik = instanceKlass::cast(k); | |
2449 | |
2450 // Check that we have the right class | |
2451 static bool first_time = true; | |
1142 | 2452 guarantee(k == SystemDictionary::Class_klass() && first_time, "Invalid verify of maps"); |
0 | 2453 first_time = false; |
2454 const int extra = java_lang_Class::number_of_fake_oop_fields; | |
2455 guarantee(ik->nonstatic_field_size() == extra, "just checking"); | |
938 | 2456 guarantee(ik->nonstatic_oop_map_count() == 1, "just checking"); |
0 | 2457 guarantee(ik->size_helper() == align_object_size(instanceOopDesc::header_size() + extra), "just checking"); |
2458 | |
2459 // Check that the map is (2,extra) | |
2460 int offset = java_lang_Class::klass_offset; | |
2461 | |
2462 OopMapBlock* map = ik->start_of_nonstatic_oop_maps(); | |
939
9eebd3ac74cf
6845368: large objects cause a crash or unexpected exception
jcoomes
parents:
938
diff
changeset
|
2463 guarantee(map->offset() == offset && map->count() == (unsigned int) extra, |
9eebd3ac74cf
6845368: large objects cause a crash or unexpected exception
jcoomes
parents:
938
diff
changeset
|
2464 "sanity"); |
0 | 2465 } |
2466 } | |
2467 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2468 #endif // ndef PRODUCT |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2469 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2470 // JNIid class for jfieldIDs only |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2471 // Note to reviewers: |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2472 // These JNI functions are just moved over to column 1 and not changed |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2473 // in the compressed oops workspace. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2474 JNIid::JNIid(klassOop holder, int offset, JNIid* next) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2475 _holder = holder; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2476 _offset = offset; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2477 _next = next; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2478 debug_only(_is_static_field_id = false;) |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2479 } |
0 | 2480 |
2481 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2482 JNIid* JNIid::find(int offset) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2483 JNIid* current = this; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2484 while (current != NULL) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2485 if (current->offset() == offset) return current; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2486 current = current->next(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2487 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2488 return NULL; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2489 } |
0 | 2490 |
2491 void JNIid::oops_do(OopClosure* f) { | |
2492 for (JNIid* cur = this; cur != NULL; cur = cur->next()) { | |
2493 f->do_oop(cur->holder_addr()); | |
2494 } | |
2495 } | |
2496 | |
2497 void JNIid::deallocate(JNIid* current) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2498 while (current != NULL) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2499 JNIid* next = current->next(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2500 delete current; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2501 current = next; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2502 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2503 } |
0 | 2504 |
2505 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2506 void JNIid::verify(klassOop holder) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2507 int first_field_offset = instanceKlass::cast(holder)->offset_of_static_fields(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2508 int end_field_offset; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2509 end_field_offset = first_field_offset + (instanceKlass::cast(holder)->static_field_size() * wordSize); |
0 | 2510 |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2511 JNIid* current = this; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2512 while (current != NULL) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2513 guarantee(current->holder() == holder, "Invalid klass in JNIid"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2514 #ifdef ASSERT |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2515 int o = current->offset(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2516 if (current->is_static_field_id()) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2517 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2518 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2519 #endif |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2520 current = current->next(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2521 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2522 } |
0 | 2523 |
2524 | |
2525 #ifdef ASSERT | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2526 void instanceKlass::set_init_state(ClassState state) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2527 bool good_state = as_klassOop()->is_shared() ? (_init_state <= state) |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2528 : (_init_state < state); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2529 assert(good_state || state == allocated, "illegal state transition"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2530 _init_state = state; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2531 } |
0 | 2532 #endif |
2533 | |
2534 | |
2535 // RedefineClasses() support for previous versions: | |
2536 | |
2537 // Add an information node that contains weak references to the | |
2538 // interesting parts of the previous version of the_class. | |
977
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
2539 // This is also where we clean out any unused weak references. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
2540 // Note that while we delete nodes from the _previous_versions |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
2541 // array, we never delete the array itself until the klass is |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
2542 // unloaded. The has_been_redefined() query depends on that fact. |
74a5db69c1fe
6419370: 4/4 new jmethodID code has tiny holes in synchronization
dcubed
parents:
974
diff
changeset
|
2543 // |
0 | 2544 void instanceKlass::add_previous_version(instanceKlassHandle ikh, |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2545 BitMap* emcp_methods, int emcp_method_count) { |
0 | 2546 assert(Thread::current()->is_VM_thread(), |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
52
diff
changeset
|
2547 "only VMThread can add previous versions"); |
0 | 2548 |
2549 if (_previous_versions == NULL) { | |
2550 // This is the first previous version so make some space. | |
2551 // Start with 2 elements under the assumption that the class | |
2552 // won't be redefined much. | |
2553 _previous_versions = new (ResourceObj::C_HEAP) | |
2554 GrowableArray<PreviousVersionNode *>(2, true); | |
2555 } | |
2556 | |
2557 // RC_TRACE macro has an embedded ResourceMark | |
2558 RC_TRACE(0x00000100, ("adding previous version ref for %s @%d, EMCP_cnt=%d", | |
2559 ikh->external_name(), _previous_versions->length(), emcp_method_count)); | |
2560 constantPoolHandle cp_h(ikh->constants()); | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2561 jobject cp_ref; |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2562 if (cp_h->is_shared()) { |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2563 // a shared ConstantPool requires a regular reference; a weak |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2564 // reference would be collectible |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2565 cp_ref = JNIHandles::make_global(cp_h); |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2566 } else { |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2567 cp_ref = JNIHandles::make_weak_global(cp_h); |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2568 } |
0 | 2569 PreviousVersionNode * pv_node = NULL; |
2570 objArrayOop old_methods = ikh->methods(); | |
2571 | |
2572 if (emcp_method_count == 0) { | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2573 // non-shared ConstantPool gets a weak reference |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2574 pv_node = new PreviousVersionNode(cp_ref, !cp_h->is_shared(), NULL); |
0 | 2575 RC_TRACE(0x00000400, |
2576 ("add: all methods are obsolete; flushing any EMCP weak refs")); | |
2577 } else { | |
2578 int local_count = 0; | |
2579 GrowableArray<jweak>* method_refs = new (ResourceObj::C_HEAP) | |
2580 GrowableArray<jweak>(emcp_method_count, true); | |
2581 for (int i = 0; i < old_methods->length(); i++) { | |
2582 if (emcp_methods->at(i)) { | |
2583 // this old method is EMCP so save a weak ref | |
2584 methodOop old_method = (methodOop) old_methods->obj_at(i); | |
2585 methodHandle old_method_h(old_method); | |
2586 jweak method_ref = JNIHandles::make_weak_global(old_method_h); | |
2587 method_refs->append(method_ref); | |
2588 if (++local_count >= emcp_method_count) { | |
2589 // no more EMCP methods so bail out now | |
2590 break; | |
2591 } | |
2592 } | |
2593 } | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2594 // non-shared ConstantPool gets a weak reference |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2595 pv_node = new PreviousVersionNode(cp_ref, !cp_h->is_shared(), method_refs); |
0 | 2596 } |
2597 | |
2598 _previous_versions->append(pv_node); | |
2599 | |
2600 // Using weak references allows the interesting parts of previous | |
2601 // classes to be GC'ed when they are no longer needed. Since the | |
2602 // caller is the VMThread and we are at a safepoint, this is a good | |
2603 // time to clear out unused weak references. | |
2604 | |
2605 RC_TRACE(0x00000400, ("add: previous version length=%d", | |
2606 _previous_versions->length())); | |
2607 | |
2608 // skip the last entry since we just added it | |
2609 for (int i = _previous_versions->length() - 2; i >= 0; i--) { | |
2610 // check the previous versions array for a GC'ed weak refs | |
2611 pv_node = _previous_versions->at(i); | |
2612 cp_ref = pv_node->prev_constant_pool(); | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2613 assert(cp_ref != NULL, "cp ref was unexpectedly cleared"); |
0 | 2614 if (cp_ref == NULL) { |
2615 delete pv_node; | |
2616 _previous_versions->remove_at(i); | |
2617 // Since we are traversing the array backwards, we don't have to | |
2618 // do anything special with the index. | |
2619 continue; // robustness | |
2620 } | |
2621 | |
2622 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); | |
2623 if (cp == NULL) { | |
2624 // this entry has been GC'ed so remove it | |
2625 delete pv_node; | |
2626 _previous_versions->remove_at(i); | |
2627 // Since we are traversing the array backwards, we don't have to | |
2628 // do anything special with the index. | |
2629 continue; | |
2630 } else { | |
2631 RC_TRACE(0x00000400, ("add: previous version @%d is alive", i)); | |
2632 } | |
2633 | |
2634 GrowableArray<jweak>* method_refs = pv_node->prev_EMCP_methods(); | |
2635 if (method_refs != NULL) { | |
2636 RC_TRACE(0x00000400, ("add: previous methods length=%d", | |
2637 method_refs->length())); | |
2638 for (int j = method_refs->length() - 1; j >= 0; j--) { | |
2639 jweak method_ref = method_refs->at(j); | |
2640 assert(method_ref != NULL, "weak method ref was unexpectedly cleared"); | |
2641 if (method_ref == NULL) { | |
2642 method_refs->remove_at(j); | |
2643 // Since we are traversing the array backwards, we don't have to | |
2644 // do anything special with the index. | |
2645 continue; // robustness | |
2646 } | |
2647 | |
2648 methodOop method = (methodOop)JNIHandles::resolve(method_ref); | |
2649 if (method == NULL || emcp_method_count == 0) { | |
2650 // This method entry has been GC'ed or the current | |
2651 // RedefineClasses() call has made all methods obsolete | |
2652 // so remove it. | |
2653 JNIHandles::destroy_weak_global(method_ref); | |
2654 method_refs->remove_at(j); | |
2655 } else { | |
2656 // RC_TRACE macro has an embedded ResourceMark | |
2657 RC_TRACE(0x00000400, | |
2658 ("add: %s(%s): previous method @%d in version @%d is alive", | |
2659 method->name()->as_C_string(), method->signature()->as_C_string(), | |
2660 j, i)); | |
2661 } | |
2662 } | |
2663 } | |
2664 } | |
2665 | |
2666 int obsolete_method_count = old_methods->length() - emcp_method_count; | |
2667 | |
2668 if (emcp_method_count != 0 && obsolete_method_count != 0 && | |
2669 _previous_versions->length() > 1) { | |
2670 // We have a mix of obsolete and EMCP methods. If there is more | |
2671 // than the previous version that we just added, then we have to | |
2672 // clear out any matching EMCP method entries the hard way. | |
2673 int local_count = 0; | |
2674 for (int i = 0; i < old_methods->length(); i++) { | |
2675 if (!emcp_methods->at(i)) { | |
2676 // only obsolete methods are interesting | |
2677 methodOop old_method = (methodOop) old_methods->obj_at(i); | |
2678 symbolOop m_name = old_method->name(); | |
2679 symbolOop m_signature = old_method->signature(); | |
2680 | |
2681 // skip the last entry since we just added it | |
2682 for (int j = _previous_versions->length() - 2; j >= 0; j--) { | |
2683 // check the previous versions array for a GC'ed weak refs | |
2684 pv_node = _previous_versions->at(j); | |
2685 cp_ref = pv_node->prev_constant_pool(); | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2686 assert(cp_ref != NULL, "cp ref was unexpectedly cleared"); |
0 | 2687 if (cp_ref == NULL) { |
2688 delete pv_node; | |
2689 _previous_versions->remove_at(j); | |
2690 // Since we are traversing the array backwards, we don't have to | |
2691 // do anything special with the index. | |
2692 continue; // robustness | |
2693 } | |
2694 | |
2695 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); | |
2696 if (cp == NULL) { | |
2697 // this entry has been GC'ed so remove it | |
2698 delete pv_node; | |
2699 _previous_versions->remove_at(j); | |
2700 // Since we are traversing the array backwards, we don't have to | |
2701 // do anything special with the index. | |
2702 continue; | |
2703 } | |
2704 | |
2705 GrowableArray<jweak>* method_refs = pv_node->prev_EMCP_methods(); | |
2706 if (method_refs == NULL) { | |
2707 // We have run into a PreviousVersion generation where | |
2708 // all methods were made obsolete during that generation's | |
2709 // RedefineClasses() operation. At the time of that | |
2710 // operation, all EMCP methods were flushed so we don't | |
2711 // have to go back any further. | |
2712 // | |
2713 // A NULL method_refs is different than an empty method_refs. | |
2714 // We cannot infer any optimizations about older generations | |
2715 // from an empty method_refs for the current generation. | |
2716 break; | |
2717 } | |
2718 | |
2719 for (int k = method_refs->length() - 1; k >= 0; k--) { | |
2720 jweak method_ref = method_refs->at(k); | |
2721 assert(method_ref != NULL, | |
2722 "weak method ref was unexpectedly cleared"); | |
2723 if (method_ref == NULL) { | |
2724 method_refs->remove_at(k); | |
2725 // Since we are traversing the array backwards, we don't | |
2726 // have to do anything special with the index. | |
2727 continue; // robustness | |
2728 } | |
2729 | |
2730 methodOop method = (methodOop)JNIHandles::resolve(method_ref); | |
2731 if (method == NULL) { | |
2732 // this method entry has been GC'ed so skip it | |
2733 JNIHandles::destroy_weak_global(method_ref); | |
2734 method_refs->remove_at(k); | |
2735 continue; | |
2736 } | |
2737 | |
2738 if (method->name() == m_name && | |
2739 method->signature() == m_signature) { | |
2740 // The current RedefineClasses() call has made all EMCP | |
2741 // versions of this method obsolete so mark it as obsolete | |
2742 // and remove the weak ref. | |
2743 RC_TRACE(0x00000400, | |
2744 ("add: %s(%s): flush obsolete method @%d in version @%d", | |
2745 m_name->as_C_string(), m_signature->as_C_string(), k, j)); | |
2746 | |
2747 method->set_is_obsolete(); | |
2748 JNIHandles::destroy_weak_global(method_ref); | |
2749 method_refs->remove_at(k); | |
2750 break; | |
2751 } | |
2752 } | |
2753 | |
2754 // The previous loop may not find a matching EMCP method, but | |
2755 // that doesn't mean that we can optimize and not go any | |
2756 // further back in the PreviousVersion generations. The EMCP | |
2757 // method for this generation could have already been GC'ed, | |
2758 // but there still may be an older EMCP method that has not | |
2759 // been GC'ed. | |
2760 } | |
2761 | |
2762 if (++local_count >= obsolete_method_count) { | |
2763 // no more obsolete methods so bail out now | |
2764 break; | |
2765 } | |
2766 } | |
2767 } | |
2768 } | |
2769 } // end add_previous_version() | |
2770 | |
2771 | |
2772 // Determine if instanceKlass has a previous version. | |
2773 bool instanceKlass::has_previous_version() const { | |
2774 if (_previous_versions == NULL) { | |
2775 // no previous versions array so answer is easy | |
2776 return false; | |
2777 } | |
2778 | |
2779 for (int i = _previous_versions->length() - 1; i >= 0; i--) { | |
2780 // Check the previous versions array for an info node that hasn't | |
2781 // been GC'ed | |
2782 PreviousVersionNode * pv_node = _previous_versions->at(i); | |
2783 | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2784 jobject cp_ref = pv_node->prev_constant_pool(); |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2785 assert(cp_ref != NULL, "cp reference was unexpectedly cleared"); |
0 | 2786 if (cp_ref == NULL) { |
2787 continue; // robustness | |
2788 } | |
2789 | |
2790 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); | |
2791 if (cp != NULL) { | |
2792 // we have at least one previous version | |
2793 return true; | |
2794 } | |
2795 | |
2796 // We don't have to check the method refs. If the constant pool has | |
2797 // been GC'ed then so have the methods. | |
2798 } | |
2799 | |
2800 // all of the underlying nodes' info has been GC'ed | |
2801 return false; | |
2802 } // end has_previous_version() | |
2803 | |
2804 methodOop instanceKlass::method_with_idnum(int idnum) { | |
2805 methodOop m = NULL; | |
2806 if (idnum < methods()->length()) { | |
2807 m = (methodOop) methods()->obj_at(idnum); | |
2808 } | |
2809 if (m == NULL || m->method_idnum() != idnum) { | |
2810 for (int index = 0; index < methods()->length(); ++index) { | |
2811 m = (methodOop) methods()->obj_at(index); | |
2812 if (m->method_idnum() == idnum) { | |
2813 return m; | |
2814 } | |
2815 } | |
2816 } | |
2817 return m; | |
2818 } | |
2819 | |
2820 | |
2821 // Set the annotation at 'idnum' to 'anno'. | |
2822 // We don't want to create or extend the array if 'anno' is NULL, since that is the | |
2823 // default value. However, if the array exists and is long enough, we must set NULL values. | |
2824 void instanceKlass::set_methods_annotations_of(int idnum, typeArrayOop anno, objArrayOop* md_p) { | |
2825 objArrayOop md = *md_p; | |
2826 if (md != NULL && md->length() > idnum) { | |
2827 md->obj_at_put(idnum, anno); | |
2828 } else if (anno != NULL) { | |
2829 // create the array | |
2830 int length = MAX2(idnum+1, (int)_idnum_allocated_count); | |
2831 md = oopFactory::new_system_objArray(length, Thread::current()); | |
2832 if (*md_p != NULL) { | |
2833 // copy the existing entries | |
2834 for (int index = 0; index < (*md_p)->length(); index++) { | |
2835 md->obj_at_put(index, (*md_p)->obj_at(index)); | |
2836 } | |
2837 } | |
2838 set_annotations(md, md_p); | |
2839 md->obj_at_put(idnum, anno); | |
2840 } // if no array and idnum isn't included there is nothing to do | |
2841 } | |
2842 | |
2843 // Construct a PreviousVersionNode entry for the array hung off | |
2844 // the instanceKlass. | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2845 PreviousVersionNode::PreviousVersionNode(jobject prev_constant_pool, |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2846 bool prev_cp_is_weak, GrowableArray<jweak>* prev_EMCP_methods) { |
0 | 2847 |
2848 _prev_constant_pool = prev_constant_pool; | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2849 _prev_cp_is_weak = prev_cp_is_weak; |
0 | 2850 _prev_EMCP_methods = prev_EMCP_methods; |
2851 } | |
2852 | |
2853 | |
2854 // Destroy a PreviousVersionNode | |
2855 PreviousVersionNode::~PreviousVersionNode() { | |
2856 if (_prev_constant_pool != NULL) { | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2857 if (_prev_cp_is_weak) { |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2858 JNIHandles::destroy_weak_global(_prev_constant_pool); |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2859 } else { |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2860 JNIHandles::destroy_global(_prev_constant_pool); |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2861 } |
0 | 2862 } |
2863 | |
2864 if (_prev_EMCP_methods != NULL) { | |
2865 for (int i = _prev_EMCP_methods->length() - 1; i >= 0; i--) { | |
2866 jweak method_ref = _prev_EMCP_methods->at(i); | |
2867 if (method_ref != NULL) { | |
2868 JNIHandles::destroy_weak_global(method_ref); | |
2869 } | |
2870 } | |
2871 delete _prev_EMCP_methods; | |
2872 } | |
2873 } | |
2874 | |
2875 | |
2876 // Construct a PreviousVersionInfo entry | |
2877 PreviousVersionInfo::PreviousVersionInfo(PreviousVersionNode *pv_node) { | |
2878 _prev_constant_pool_handle = constantPoolHandle(); // NULL handle | |
2879 _prev_EMCP_method_handles = NULL; | |
2880 | |
47
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2881 jobject cp_ref = pv_node->prev_constant_pool(); |
2c106685d6d0
6497639: 4/3 Profiling Swing application caused JVM crash
dcubed
parents:
0
diff
changeset
|
2882 assert(cp_ref != NULL, "constant pool ref was unexpectedly cleared"); |
0 | 2883 if (cp_ref == NULL) { |
2884 return; // robustness | |
2885 } | |
2886 | |
2887 constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); | |
2888 if (cp == NULL) { | |
2889 // Weak reference has been GC'ed. Since the constant pool has been | |
2890 // GC'ed, the methods have also been GC'ed. | |
2891 return; | |
2892 } | |
2893 | |
2894 // make the constantPoolOop safe to return | |
2895 _prev_constant_pool_handle = constantPoolHandle(cp); | |
2896 | |
2897 GrowableArray<jweak>* method_refs = pv_node->prev_EMCP_methods(); | |
2898 if (method_refs == NULL) { | |
2899 // the instanceKlass did not have any EMCP methods | |
2900 return; | |
2901 } | |
2902 | |
2903 _prev_EMCP_method_handles = new GrowableArray<methodHandle>(10); | |
2904 | |
2905 int n_methods = method_refs->length(); | |
2906 for (int i = 0; i < n_methods; i++) { | |
2907 jweak method_ref = method_refs->at(i); | |
2908 assert(method_ref != NULL, "weak method ref was unexpectedly cleared"); | |
2909 if (method_ref == NULL) { | |
2910 continue; // robustness | |
2911 } | |
2912 | |
2913 methodOop method = (methodOop)JNIHandles::resolve(method_ref); | |
2914 if (method == NULL) { | |
2915 // this entry has been GC'ed so skip it | |
2916 continue; | |
2917 } | |
2918 | |
2919 // make the methodOop safe to return | |
2920 _prev_EMCP_method_handles->append(methodHandle(method)); | |
2921 } | |
2922 } | |
2923 | |
2924 | |
2925 // Destroy a PreviousVersionInfo | |
2926 PreviousVersionInfo::~PreviousVersionInfo() { | |
2927 // Since _prev_EMCP_method_handles is not C-heap allocated, we | |
2928 // don't have to delete it. | |
2929 } | |
2930 | |
2931 | |
2932 // Construct a helper for walking the previous versions array | |
2933 PreviousVersionWalker::PreviousVersionWalker(instanceKlass *ik) { | |
2934 _previous_versions = ik->previous_versions(); | |
2935 _current_index = 0; | |
2936 // _hm needs no initialization | |
2937 _current_p = NULL; | |
2938 } | |
2939 | |
2940 | |
2941 // Destroy a PreviousVersionWalker | |
2942 PreviousVersionWalker::~PreviousVersionWalker() { | |
2943 // Delete the current info just in case the caller didn't walk to | |
2944 // the end of the previous versions list. No harm if _current_p is | |
2945 // already NULL. | |
2946 delete _current_p; | |
2947 | |
2948 // When _hm is destroyed, all the Handles returned in | |
2949 // PreviousVersionInfo objects will be destroyed. | |
2950 // Also, after this destructor is finished it will be | |
2951 // safe to delete the GrowableArray allocated in the | |
2952 // PreviousVersionInfo objects. | |
2953 } | |
2954 | |
2955 | |
2956 // Return the interesting information for the next previous version | |
2957 // of the klass. Returns NULL if there are no more previous versions. | |
2958 PreviousVersionInfo* PreviousVersionWalker::next_previous_version() { | |
2959 if (_previous_versions == NULL) { | |
2960 // no previous versions so nothing to return | |
2961 return NULL; | |
2962 } | |
2963 | |
2964 delete _current_p; // cleanup the previous info for the caller | |
2965 _current_p = NULL; // reset to NULL so we don't delete same object twice | |
2966 | |
2967 int length = _previous_versions->length(); | |
2968 | |
2969 while (_current_index < length) { | |
2970 PreviousVersionNode * pv_node = _previous_versions->at(_current_index++); | |
2971 PreviousVersionInfo * pv_info = new (ResourceObj::C_HEAP) | |
2972 PreviousVersionInfo(pv_node); | |
2973 | |
2974 constantPoolHandle cp_h = pv_info->prev_constant_pool_handle(); | |
2975 if (cp_h.is_null()) { | |
2976 delete pv_info; | |
2977 | |
2978 // The underlying node's info has been GC'ed so try the next one. | |
2979 // We don't have to check the methods. If the constant pool has | |
2980 // GC'ed then so have the methods. | |
2981 continue; | |
2982 } | |
2983 | |
2984 // Found a node with non GC'ed info so return it. The caller will | |
2985 // need to delete pv_info when they are done with it. | |
2986 _current_p = pv_info; | |
2987 return pv_info; | |
2988 } | |
2989 | |
2990 // all of the underlying nodes' info has been GC'ed | |
2991 return NULL; | |
2992 } // end next_previous_version() |