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