Mercurial > hg > graal-jvmci-8
annotate src/share/vm/prims/jvmtiImpl.cpp @ 2014:4de5f4101cfd
Merge
author | iveresov |
---|---|
date | Wed, 08 Dec 2010 17:50:49 -0800 |
parents | f95d63e2154a |
children | 09b4dd4f152b |
rev | line source |
---|---|
0 | 1 /* |
1972 | 2 * Copyright (c) 2003, 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:
611
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
611
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:
611
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "classfile/systemDictionary.hpp" | |
27 #include "interpreter/interpreter.hpp" | |
28 #include "jvmtifiles/jvmtiEnv.hpp" | |
29 #include "memory/resourceArea.hpp" | |
30 #include "oops/instanceKlass.hpp" | |
31 #include "prims/jvmtiAgentThread.hpp" | |
32 #include "prims/jvmtiEventController.inline.hpp" | |
33 #include "prims/jvmtiImpl.hpp" | |
34 #include "prims/jvmtiRedefineClasses.hpp" | |
35 #include "runtime/deoptimization.hpp" | |
36 #include "runtime/handles.hpp" | |
37 #include "runtime/handles.inline.hpp" | |
38 #include "runtime/interfaceSupport.hpp" | |
39 #include "runtime/javaCalls.hpp" | |
40 #include "runtime/signature.hpp" | |
41 #include "runtime/vframe.hpp" | |
42 #include "runtime/vframe_hp.hpp" | |
43 #include "runtime/vm_operations.hpp" | |
44 #include "utilities/exceptions.hpp" | |
45 #ifdef TARGET_OS_FAMILY_linux | |
46 # include "thread_linux.inline.hpp" | |
47 #endif | |
48 #ifdef TARGET_OS_FAMILY_solaris | |
49 # include "thread_solaris.inline.hpp" | |
50 #endif | |
51 #ifdef TARGET_OS_FAMILY_windows | |
52 # include "thread_windows.inline.hpp" | |
53 #endif | |
0 | 54 |
55 // | |
56 // class JvmtiAgentThread | |
57 // | |
58 // JavaThread used to wrap a thread started by an agent | |
59 // using the JVMTI method RunAgentThread. | |
60 // | |
61 | |
62 JvmtiAgentThread::JvmtiAgentThread(JvmtiEnv* env, jvmtiStartFunction start_fn, const void *start_arg) | |
63 : JavaThread(start_function_wrapper) { | |
64 _env = env; | |
65 _start_fn = start_fn; | |
66 _start_arg = start_arg; | |
67 } | |
68 | |
69 void | |
70 JvmtiAgentThread::start_function_wrapper(JavaThread *thread, TRAPS) { | |
71 // It is expected that any Agent threads will be created as | |
72 // Java Threads. If this is the case, notification of the creation | |
73 // of the thread is given in JavaThread::thread_main(). | |
74 assert(thread->is_Java_thread(), "debugger thread should be a Java Thread"); | |
75 assert(thread == JavaThread::current(), "sanity check"); | |
76 | |
77 JvmtiAgentThread *dthread = (JvmtiAgentThread *)thread; | |
78 dthread->call_start_function(); | |
79 } | |
80 | |
81 void | |
82 JvmtiAgentThread::call_start_function() { | |
83 ThreadToNativeFromVM transition(this); | |
84 _start_fn(_env->jvmti_external(), jni_environment(), (void*)_start_arg); | |
85 } | |
86 | |
87 | |
88 // | |
89 // class GrowableCache - private methods | |
90 // | |
91 | |
92 void GrowableCache::recache() { | |
93 int len = _elements->length(); | |
94 | |
95 FREE_C_HEAP_ARRAY(address, _cache); | |
96 _cache = NEW_C_HEAP_ARRAY(address,len+1); | |
97 | |
98 for (int i=0; i<len; i++) { | |
99 _cache[i] = _elements->at(i)->getCacheValue(); | |
100 // | |
101 // The cache entry has gone bad. Without a valid frame pointer | |
102 // value, the entry is useless so we simply delete it in product | |
103 // mode. The call to remove() will rebuild the cache again | |
104 // without the bad entry. | |
105 // | |
106 if (_cache[i] == NULL) { | |
107 assert(false, "cannot recache NULL elements"); | |
108 remove(i); | |
109 return; | |
110 } | |
111 } | |
112 _cache[len] = NULL; | |
113 | |
114 _listener_fun(_this_obj,_cache); | |
115 } | |
116 | |
117 bool GrowableCache::equals(void* v, GrowableElement *e2) { | |
118 GrowableElement *e1 = (GrowableElement *) v; | |
119 assert(e1 != NULL, "e1 != NULL"); | |
120 assert(e2 != NULL, "e2 != NULL"); | |
121 | |
122 return e1->equals(e2); | |
123 } | |
124 | |
125 // | |
126 // class GrowableCache - public methods | |
127 // | |
128 | |
129 GrowableCache::GrowableCache() { | |
130 _this_obj = NULL; | |
131 _listener_fun = NULL; | |
132 _elements = NULL; | |
133 _cache = NULL; | |
134 } | |
135 | |
136 GrowableCache::~GrowableCache() { | |
137 clear(); | |
138 delete _elements; | |
139 FREE_C_HEAP_ARRAY(address, _cache); | |
140 } | |
141 | |
142 void GrowableCache::initialize(void *this_obj, void listener_fun(void *, address*) ) { | |
143 _this_obj = this_obj; | |
144 _listener_fun = listener_fun; | |
145 _elements = new (ResourceObj::C_HEAP) GrowableArray<GrowableElement*>(5,true); | |
146 recache(); | |
147 } | |
148 | |
149 // number of elements in the collection | |
150 int GrowableCache::length() { | |
151 return _elements->length(); | |
152 } | |
153 | |
154 // get the value of the index element in the collection | |
155 GrowableElement* GrowableCache::at(int index) { | |
156 GrowableElement *e = (GrowableElement *) _elements->at(index); | |
157 assert(e != NULL, "e != NULL"); | |
158 return e; | |
159 } | |
160 | |
161 int GrowableCache::find(GrowableElement* e) { | |
162 return _elements->find(e, GrowableCache::equals); | |
163 } | |
164 | |
165 // append a copy of the element to the end of the collection | |
166 void GrowableCache::append(GrowableElement* e) { | |
167 GrowableElement *new_e = e->clone(); | |
168 _elements->append(new_e); | |
169 recache(); | |
170 } | |
171 | |
172 // insert a copy of the element using lessthan() | |
173 void GrowableCache::insert(GrowableElement* e) { | |
174 GrowableElement *new_e = e->clone(); | |
175 _elements->append(new_e); | |
176 | |
177 int n = length()-2; | |
178 for (int i=n; i>=0; i--) { | |
179 GrowableElement *e1 = _elements->at(i); | |
180 GrowableElement *e2 = _elements->at(i+1); | |
181 if (e2->lessThan(e1)) { | |
182 _elements->at_put(i+1, e1); | |
183 _elements->at_put(i, e2); | |
184 } | |
185 } | |
186 | |
187 recache(); | |
188 } | |
189 | |
190 // remove the element at index | |
191 void GrowableCache::remove (int index) { | |
192 GrowableElement *e = _elements->at(index); | |
193 assert(e != NULL, "e != NULL"); | |
194 _elements->remove(e); | |
195 delete e; | |
196 recache(); | |
197 } | |
198 | |
199 // clear out all elements, release all heap space and | |
200 // let our listener know that things have changed. | |
201 void GrowableCache::clear() { | |
202 int len = _elements->length(); | |
203 for (int i=0; i<len; i++) { | |
204 delete _elements->at(i); | |
205 } | |
206 _elements->clear(); | |
207 recache(); | |
208 } | |
209 | |
210 void GrowableCache::oops_do(OopClosure* f) { | |
211 int len = _elements->length(); | |
212 for (int i=0; i<len; i++) { | |
213 GrowableElement *e = _elements->at(i); | |
214 e->oops_do(f); | |
215 } | |
216 } | |
217 | |
218 void GrowableCache::gc_epilogue() { | |
219 int len = _elements->length(); | |
220 // recompute the new cache value after GC | |
221 for (int i=0; i<len; i++) { | |
222 _cache[i] = _elements->at(i)->getCacheValue(); | |
223 } | |
224 } | |
225 | |
226 // | |
227 // class JvmtiBreakpoint | |
228 // | |
229 | |
230 JvmtiBreakpoint::JvmtiBreakpoint() { | |
231 _method = NULL; | |
232 _bci = 0; | |
233 #ifdef CHECK_UNHANDLED_OOPS | |
234 // This one is always allocated with new, but check it just in case. | |
235 Thread *thread = Thread::current(); | |
236 if (thread->is_in_stack((address)&_method)) { | |
237 thread->allow_unhandled_oop((oop*)&_method); | |
238 } | |
239 #endif // CHECK_UNHANDLED_OOPS | |
240 } | |
241 | |
242 JvmtiBreakpoint::JvmtiBreakpoint(methodOop m_method, jlocation location) { | |
243 _method = m_method; | |
244 assert(_method != NULL, "_method != NULL"); | |
245 _bci = (int) location; | |
246 #ifdef CHECK_UNHANDLED_OOPS | |
247 // Could be allocated with new and wouldn't be on the unhandled oop list. | |
248 Thread *thread = Thread::current(); | |
249 if (thread->is_in_stack((address)&_method)) { | |
250 thread->allow_unhandled_oop(&_method); | |
251 } | |
252 #endif // CHECK_UNHANDLED_OOPS | |
253 | |
254 assert(_bci >= 0, "_bci >= 0"); | |
255 } | |
256 | |
257 void JvmtiBreakpoint::copy(JvmtiBreakpoint& bp) { | |
258 _method = bp._method; | |
259 _bci = bp._bci; | |
260 } | |
261 | |
262 bool JvmtiBreakpoint::lessThan(JvmtiBreakpoint& bp) { | |
263 Unimplemented(); | |
264 return false; | |
265 } | |
266 | |
267 bool JvmtiBreakpoint::equals(JvmtiBreakpoint& bp) { | |
268 return _method == bp._method | |
269 && _bci == bp._bci; | |
270 } | |
271 | |
272 bool JvmtiBreakpoint::is_valid() { | |
273 return _method != NULL && | |
274 _bci >= 0; | |
275 } | |
276 | |
277 address JvmtiBreakpoint::getBcp() { | |
278 return _method->bcp_from(_bci); | |
279 } | |
280 | |
281 void JvmtiBreakpoint::each_method_version_do(method_action meth_act) { | |
282 ((methodOopDesc*)_method->*meth_act)(_bci); | |
283 | |
284 // add/remove breakpoint to/from versions of the method that | |
285 // are EMCP. Directly or transitively obsolete methods are | |
286 // not saved in the PreviousVersionInfo. | |
287 Thread *thread = Thread::current(); | |
288 instanceKlassHandle ikh = instanceKlassHandle(thread, _method->method_holder()); | |
289 symbolOop m_name = _method->name(); | |
290 symbolOop m_signature = _method->signature(); | |
291 | |
292 { | |
293 ResourceMark rm(thread); | |
294 // PreviousVersionInfo objects returned via PreviousVersionWalker | |
295 // contain a GrowableArray of handles. We have to clean up the | |
296 // GrowableArray _after_ the PreviousVersionWalker destructor | |
297 // has destroyed the handles. | |
298 { | |
299 // search previous versions if they exist | |
300 PreviousVersionWalker pvw((instanceKlass *)ikh()->klass_part()); | |
301 for (PreviousVersionInfo * pv_info = pvw.next_previous_version(); | |
302 pv_info != NULL; pv_info = pvw.next_previous_version()) { | |
303 GrowableArray<methodHandle>* methods = | |
304 pv_info->prev_EMCP_method_handles(); | |
305 | |
306 if (methods == NULL) { | |
307 // We have run into a PreviousVersion generation where | |
308 // all methods were made obsolete during that generation's | |
309 // RedefineClasses() operation. At the time of that | |
310 // operation, all EMCP methods were flushed so we don't | |
311 // have to go back any further. | |
312 // | |
313 // A NULL methods array is different than an empty methods | |
314 // array. We cannot infer any optimizations about older | |
315 // generations from an empty methods array for the current | |
316 // generation. | |
317 break; | |
318 } | |
319 | |
320 for (int i = methods->length() - 1; i >= 0; i--) { | |
321 methodHandle method = methods->at(i); | |
322 if (method->name() == m_name && method->signature() == m_signature) { | |
323 RC_TRACE(0x00000800, ("%sing breakpoint in %s(%s)", | |
324 meth_act == &methodOopDesc::set_breakpoint ? "sett" : "clear", | |
325 method->name()->as_C_string(), | |
326 method->signature()->as_C_string())); | |
327 assert(!method->is_obsolete(), "only EMCP methods here"); | |
328 | |
329 ((methodOopDesc*)method()->*meth_act)(_bci); | |
330 break; | |
331 } | |
332 } | |
333 } | |
334 } // pvw is cleaned up | |
335 } // rm is cleaned up | |
336 } | |
337 | |
338 void JvmtiBreakpoint::set() { | |
339 each_method_version_do(&methodOopDesc::set_breakpoint); | |
340 } | |
341 | |
342 void JvmtiBreakpoint::clear() { | |
343 each_method_version_do(&methodOopDesc::clear_breakpoint); | |
344 } | |
345 | |
346 void JvmtiBreakpoint::print() { | |
347 #ifndef PRODUCT | |
348 const char *class_name = (_method == NULL) ? "NULL" : _method->klass_name()->as_C_string(); | |
349 const char *method_name = (_method == NULL) ? "NULL" : _method->name()->as_C_string(); | |
350 | |
351 tty->print("Breakpoint(%s,%s,%d,%p)",class_name, method_name, _bci, getBcp()); | |
352 #endif | |
353 } | |
354 | |
355 | |
356 // | |
357 // class VM_ChangeBreakpoints | |
358 // | |
359 // Modify the Breakpoints data structure at a safepoint | |
360 // | |
361 | |
362 void VM_ChangeBreakpoints::doit() { | |
363 switch (_operation) { | |
364 case SET_BREAKPOINT: | |
365 _breakpoints->set_at_safepoint(*_bp); | |
366 break; | |
367 case CLEAR_BREAKPOINT: | |
368 _breakpoints->clear_at_safepoint(*_bp); | |
369 break; | |
370 case CLEAR_ALL_BREAKPOINT: | |
371 _breakpoints->clearall_at_safepoint(); | |
372 break; | |
373 default: | |
374 assert(false, "Unknown operation"); | |
375 } | |
376 } | |
377 | |
378 void VM_ChangeBreakpoints::oops_do(OopClosure* f) { | |
379 // This operation keeps breakpoints alive | |
380 if (_breakpoints != NULL) { | |
381 _breakpoints->oops_do(f); | |
382 } | |
383 if (_bp != NULL) { | |
384 _bp->oops_do(f); | |
385 } | |
386 } | |
387 | |
388 // | |
389 // class JvmtiBreakpoints | |
390 // | |
391 // a JVMTI internal collection of JvmtiBreakpoint | |
392 // | |
393 | |
394 JvmtiBreakpoints::JvmtiBreakpoints(void listener_fun(void *,address *)) { | |
395 _bps.initialize(this,listener_fun); | |
396 } | |
397 | |
398 JvmtiBreakpoints:: ~JvmtiBreakpoints() {} | |
399 | |
400 void JvmtiBreakpoints::oops_do(OopClosure* f) { | |
401 _bps.oops_do(f); | |
402 } | |
403 | |
404 void JvmtiBreakpoints::gc_epilogue() { | |
405 _bps.gc_epilogue(); | |
406 } | |
407 | |
408 void JvmtiBreakpoints::print() { | |
409 #ifndef PRODUCT | |
410 ResourceMark rm; | |
411 | |
412 int n = _bps.length(); | |
413 for (int i=0; i<n; i++) { | |
414 JvmtiBreakpoint& bp = _bps.at(i); | |
415 tty->print("%d: ", i); | |
416 bp.print(); | |
417 tty->print_cr(""); | |
418 } | |
419 #endif | |
420 } | |
421 | |
422 | |
423 void JvmtiBreakpoints::set_at_safepoint(JvmtiBreakpoint& bp) { | |
424 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint"); | |
425 | |
426 int i = _bps.find(bp); | |
427 if (i == -1) { | |
428 _bps.append(bp); | |
429 bp.set(); | |
430 } | |
431 } | |
432 | |
433 void JvmtiBreakpoints::clear_at_safepoint(JvmtiBreakpoint& bp) { | |
434 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint"); | |
435 | |
436 int i = _bps.find(bp); | |
437 if (i != -1) { | |
438 _bps.remove(i); | |
439 bp.clear(); | |
440 } | |
441 } | |
442 | |
443 void JvmtiBreakpoints::clearall_at_safepoint() { | |
444 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint"); | |
445 | |
446 int len = _bps.length(); | |
447 for (int i=0; i<len; i++) { | |
448 _bps.at(i).clear(); | |
449 } | |
450 _bps.clear(); | |
451 } | |
452 | |
453 int JvmtiBreakpoints::length() { return _bps.length(); } | |
454 | |
455 int JvmtiBreakpoints::set(JvmtiBreakpoint& bp) { | |
456 if ( _bps.find(bp) != -1) { | |
457 return JVMTI_ERROR_DUPLICATE; | |
458 } | |
459 VM_ChangeBreakpoints set_breakpoint(this,VM_ChangeBreakpoints::SET_BREAKPOINT, &bp); | |
460 VMThread::execute(&set_breakpoint); | |
461 return JVMTI_ERROR_NONE; | |
462 } | |
463 | |
464 int JvmtiBreakpoints::clear(JvmtiBreakpoint& bp) { | |
465 if ( _bps.find(bp) == -1) { | |
466 return JVMTI_ERROR_NOT_FOUND; | |
467 } | |
468 | |
469 VM_ChangeBreakpoints clear_breakpoint(this,VM_ChangeBreakpoints::CLEAR_BREAKPOINT, &bp); | |
470 VMThread::execute(&clear_breakpoint); | |
471 return JVMTI_ERROR_NONE; | |
472 } | |
473 | |
474 void JvmtiBreakpoints::clearall_in_class_at_safepoint(klassOop klass) { | |
475 bool changed = true; | |
476 // We are going to run thru the list of bkpts | |
477 // and delete some. This deletion probably alters | |
478 // the list in some implementation defined way such | |
479 // that when we delete entry i, the next entry might | |
480 // no longer be at i+1. To be safe, each time we delete | |
481 // an entry, we'll just start again from the beginning. | |
482 // We'll stop when we make a pass thru the whole list without | |
483 // deleting anything. | |
484 while (changed) { | |
485 int len = _bps.length(); | |
486 changed = false; | |
487 for (int i = 0; i < len; i++) { | |
488 JvmtiBreakpoint& bp = _bps.at(i); | |
489 if (bp.method()->method_holder() == klass) { | |
490 bp.clear(); | |
491 _bps.remove(i); | |
492 // This changed 'i' so we have to start over. | |
493 changed = true; | |
494 break; | |
495 } | |
496 } | |
497 } | |
498 } | |
499 | |
500 void JvmtiBreakpoints::clearall() { | |
501 VM_ChangeBreakpoints clearall_breakpoint(this,VM_ChangeBreakpoints::CLEAR_ALL_BREAKPOINT); | |
502 VMThread::execute(&clearall_breakpoint); | |
503 } | |
504 | |
505 // | |
506 // class JvmtiCurrentBreakpoints | |
507 // | |
508 | |
509 JvmtiBreakpoints *JvmtiCurrentBreakpoints::_jvmti_breakpoints = NULL; | |
510 address * JvmtiCurrentBreakpoints::_breakpoint_list = NULL; | |
511 | |
512 | |
513 JvmtiBreakpoints& JvmtiCurrentBreakpoints::get_jvmti_breakpoints() { | |
514 if (_jvmti_breakpoints != NULL) return (*_jvmti_breakpoints); | |
515 _jvmti_breakpoints = new JvmtiBreakpoints(listener_fun); | |
516 assert(_jvmti_breakpoints != NULL, "_jvmti_breakpoints != NULL"); | |
517 return (*_jvmti_breakpoints); | |
518 } | |
519 | |
520 void JvmtiCurrentBreakpoints::listener_fun(void *this_obj, address *cache) { | |
521 JvmtiBreakpoints *this_jvmti = (JvmtiBreakpoints *) this_obj; | |
522 assert(this_jvmti != NULL, "this_jvmti != NULL"); | |
523 | |
524 debug_only(int n = this_jvmti->length();); | |
525 assert(cache[n] == NULL, "cache must be NULL terminated"); | |
526 | |
527 set_breakpoint_list(cache); | |
528 } | |
529 | |
530 | |
531 void JvmtiCurrentBreakpoints::oops_do(OopClosure* f) { | |
532 if (_jvmti_breakpoints != NULL) { | |
533 _jvmti_breakpoints->oops_do(f); | |
534 } | |
535 } | |
536 | |
537 void JvmtiCurrentBreakpoints::gc_epilogue() { | |
538 if (_jvmti_breakpoints != NULL) { | |
539 _jvmti_breakpoints->gc_epilogue(); | |
540 } | |
541 } | |
542 | |
543 | |
544 /////////////////////////////////////////////////////////////// | |
545 // | |
546 // class VM_GetOrSetLocal | |
547 // | |
548 | |
549 // Constructor for non-object getter | |
550 VM_GetOrSetLocal::VM_GetOrSetLocal(JavaThread* thread, jint depth, int index, BasicType type) | |
551 : _thread(thread) | |
552 , _calling_thread(NULL) | |
553 , _depth(depth) | |
554 , _index(index) | |
555 , _type(type) | |
556 , _set(false) | |
557 , _jvf(NULL) | |
558 , _result(JVMTI_ERROR_NONE) | |
559 { | |
560 } | |
561 | |
562 // Constructor for object or non-object setter | |
563 VM_GetOrSetLocal::VM_GetOrSetLocal(JavaThread* thread, jint depth, int index, BasicType type, jvalue value) | |
564 : _thread(thread) | |
565 , _calling_thread(NULL) | |
566 , _depth(depth) | |
567 , _index(index) | |
568 , _type(type) | |
569 , _value(value) | |
570 , _set(true) | |
571 , _jvf(NULL) | |
572 , _result(JVMTI_ERROR_NONE) | |
573 { | |
574 } | |
575 | |
576 // Constructor for object getter | |
577 VM_GetOrSetLocal::VM_GetOrSetLocal(JavaThread* thread, JavaThread* calling_thread, jint depth, int index) | |
578 : _thread(thread) | |
579 , _calling_thread(calling_thread) | |
580 , _depth(depth) | |
581 , _index(index) | |
582 , _type(T_OBJECT) | |
583 , _set(false) | |
584 , _jvf(NULL) | |
585 , _result(JVMTI_ERROR_NONE) | |
586 { | |
587 } | |
588 | |
589 | |
590 vframe *VM_GetOrSetLocal::get_vframe() { | |
591 if (!_thread->has_last_Java_frame()) { | |
592 return NULL; | |
593 } | |
594 RegisterMap reg_map(_thread); | |
595 vframe *vf = _thread->last_java_vframe(®_map); | |
596 int d = 0; | |
597 while ((vf != NULL) && (d < _depth)) { | |
598 vf = vf->java_sender(); | |
599 d++; | |
600 } | |
601 return vf; | |
602 } | |
603 | |
604 javaVFrame *VM_GetOrSetLocal::get_java_vframe() { | |
605 vframe* vf = get_vframe(); | |
606 if (vf == NULL) { | |
607 _result = JVMTI_ERROR_NO_MORE_FRAMES; | |
608 return NULL; | |
609 } | |
610 javaVFrame *jvf = (javaVFrame*)vf; | |
611 | |
612 if (!vf->is_java_frame() || jvf->method()->is_native()) { | |
613 _result = JVMTI_ERROR_OPAQUE_FRAME; | |
614 return NULL; | |
615 } | |
616 return jvf; | |
617 } | |
618 | |
619 // Check that the klass is assignable to a type with the given signature. | |
620 // Another solution could be to use the function Klass::is_subtype_of(type). | |
621 // But the type class can be forced to load/initialize eagerly in such a case. | |
622 // This may cause unexpected consequences like CFLH or class-init JVMTI events. | |
623 // It is better to avoid such a behavior. | |
624 bool VM_GetOrSetLocal::is_assignable(const char* ty_sign, Klass* klass, Thread* thread) { | |
625 assert(ty_sign != NULL, "type signature must not be NULL"); | |
626 assert(thread != NULL, "thread must not be NULL"); | |
627 assert(klass != NULL, "klass must not be NULL"); | |
628 | |
629 int len = (int) strlen(ty_sign); | |
630 if (ty_sign[0] == 'L' && ty_sign[len-1] == ';') { // Need pure class/interface name | |
631 ty_sign++; | |
632 len -= 2; | |
633 } | |
634 symbolHandle ty_sym = oopFactory::new_symbol_handle(ty_sign, len, thread); | |
635 if (klass->name() == ty_sym()) { | |
636 return true; | |
637 } | |
638 // Compare primary supers | |
639 int super_depth = klass->super_depth(); | |
640 int idx; | |
641 for (idx = 0; idx < super_depth; idx++) { | |
642 if (Klass::cast(klass->primary_super_of_depth(idx))->name() == ty_sym()) { | |
643 return true; | |
644 } | |
645 } | |
646 // Compare secondary supers | |
647 objArrayOop sec_supers = klass->secondary_supers(); | |
648 for (idx = 0; idx < sec_supers->length(); idx++) { | |
649 if (Klass::cast((klassOop) sec_supers->obj_at(idx))->name() == ty_sym()) { | |
650 return true; | |
651 } | |
652 } | |
653 return false; | |
654 } | |
655 | |
656 // Checks error conditions: | |
657 // JVMTI_ERROR_INVALID_SLOT | |
658 // JVMTI_ERROR_TYPE_MISMATCH | |
659 // Returns: 'true' - everything is Ok, 'false' - error code | |
660 | |
661 bool VM_GetOrSetLocal::check_slot_type(javaVFrame* jvf) { | |
662 methodOop method_oop = jvf->method(); | |
663 if (!method_oop->has_localvariable_table()) { | |
664 // Just to check index boundaries | |
665 jint extra_slot = (_type == T_LONG || _type == T_DOUBLE) ? 1 : 0; | |
666 if (_index < 0 || _index + extra_slot >= method_oop->max_locals()) { | |
667 _result = JVMTI_ERROR_INVALID_SLOT; | |
668 return false; | |
669 } | |
670 return true; | |
671 } | |
672 | |
673 jint num_entries = method_oop->localvariable_table_length(); | |
674 if (num_entries == 0) { | |
675 _result = JVMTI_ERROR_INVALID_SLOT; | |
676 return false; // There are no slots | |
677 } | |
678 int signature_idx = -1; | |
679 int vf_bci = jvf->bci(); | |
680 LocalVariableTableElement* table = method_oop->localvariable_table_start(); | |
681 for (int i = 0; i < num_entries; i++) { | |
682 int start_bci = table[i].start_bci; | |
683 int end_bci = start_bci + table[i].length; | |
684 | |
685 // Here we assume that locations of LVT entries | |
686 // with the same slot number cannot be overlapped | |
687 if (_index == (jint) table[i].slot && start_bci <= vf_bci && vf_bci <= end_bci) { | |
688 signature_idx = (int) table[i].descriptor_cp_index; | |
689 break; | |
690 } | |
691 } | |
692 if (signature_idx == -1) { | |
693 _result = JVMTI_ERROR_INVALID_SLOT; | |
694 return false; // Incorrect slot index | |
695 } | |
696 symbolOop sign_sym = method_oop->constants()->symbol_at(signature_idx); | |
697 const char* signature = (const char *) sign_sym->as_utf8(); | |
698 BasicType slot_type = char2type(signature[0]); | |
699 | |
700 switch (slot_type) { | |
701 case T_BYTE: | |
702 case T_SHORT: | |
703 case T_CHAR: | |
704 case T_BOOLEAN: | |
705 slot_type = T_INT; | |
706 break; | |
707 case T_ARRAY: | |
708 slot_type = T_OBJECT; | |
709 break; | |
710 }; | |
711 if (_type != slot_type) { | |
712 _result = JVMTI_ERROR_TYPE_MISMATCH; | |
713 return false; | |
714 } | |
715 | |
716 jobject jobj = _value.l; | |
717 if (_set && slot_type == T_OBJECT && jobj != NULL) { // NULL reference is allowed | |
718 // Check that the jobject class matches the return type signature. | |
719 JavaThread* cur_thread = JavaThread::current(); | |
720 HandleMark hm(cur_thread); | |
721 | |
722 Handle obj = Handle(cur_thread, JNIHandles::resolve_external_guard(jobj)); | |
723 NULL_CHECK(obj, (_result = JVMTI_ERROR_INVALID_OBJECT, false)); | |
724 KlassHandle ob_kh = KlassHandle(cur_thread, obj->klass()); | |
725 NULL_CHECK(ob_kh, (_result = JVMTI_ERROR_INVALID_OBJECT, false)); | |
726 | |
727 if (!is_assignable(signature, Klass::cast(ob_kh()), cur_thread)) { | |
728 _result = JVMTI_ERROR_TYPE_MISMATCH; | |
729 return false; | |
730 } | |
731 } | |
732 return true; | |
733 } | |
734 | |
735 static bool can_be_deoptimized(vframe* vf) { | |
736 return (vf->is_compiled_frame() && vf->fr().can_be_deoptimized()); | |
737 } | |
738 | |
739 bool VM_GetOrSetLocal::doit_prologue() { | |
740 _jvf = get_java_vframe(); | |
741 NULL_CHECK(_jvf, false); | |
742 | |
743 if (!check_slot_type(_jvf)) { | |
744 return false; | |
745 } | |
746 return true; | |
747 } | |
748 | |
749 void VM_GetOrSetLocal::doit() { | |
750 if (_set) { | |
751 // Force deoptimization of frame if compiled because it's | |
752 // possible the compiler emitted some locals as constant values, | |
753 // meaning they are not mutable. | |
754 if (can_be_deoptimized(_jvf)) { | |
755 | |
756 // Schedule deoptimization so that eventually the local | |
757 // update will be written to an interpreter frame. | |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1552
diff
changeset
|
758 Deoptimization::deoptimize_frame(_jvf->thread(), _jvf->fr().id()); |
0 | 759 |
760 // Now store a new value for the local which will be applied | |
761 // once deoptimization occurs. Note however that while this | |
762 // write is deferred until deoptimization actually happens | |
763 // can vframe created after this point will have its locals | |
764 // reflecting this update so as far as anyone can see the | |
765 // write has already taken place. | |
766 | |
767 // If we are updating an oop then get the oop from the handle | |
768 // since the handle will be long gone by the time the deopt | |
769 // happens. The oop stored in the deferred local will be | |
770 // gc'd on its own. | |
771 if (_type == T_OBJECT) { | |
772 _value.l = (jobject) (JNIHandles::resolve_external_guard(_value.l)); | |
773 } | |
774 // Re-read the vframe so we can see that it is deoptimized | |
775 // [ Only need because of assert in update_local() ] | |
776 _jvf = get_java_vframe(); | |
777 ((compiledVFrame*)_jvf)->update_local(_type, _index, _value); | |
778 return; | |
779 } | |
780 StackValueCollection *locals = _jvf->locals(); | |
781 HandleMark hm; | |
782 | |
783 switch (_type) { | |
784 case T_INT: locals->set_int_at (_index, _value.i); break; | |
785 case T_LONG: locals->set_long_at (_index, _value.j); break; | |
786 case T_FLOAT: locals->set_float_at (_index, _value.f); break; | |
787 case T_DOUBLE: locals->set_double_at(_index, _value.d); break; | |
788 case T_OBJECT: { | |
789 Handle ob_h(JNIHandles::resolve_external_guard(_value.l)); | |
790 locals->set_obj_at (_index, ob_h); | |
791 break; | |
792 } | |
793 default: ShouldNotReachHere(); | |
794 } | |
795 _jvf->set_locals(locals); | |
796 } else { | |
797 StackValueCollection *locals = _jvf->locals(); | |
798 | |
799 if (locals->at(_index)->type() == T_CONFLICT) { | |
800 memset(&_value, 0, sizeof(_value)); | |
801 _value.l = NULL; | |
802 return; | |
803 } | |
804 | |
805 switch (_type) { | |
806 case T_INT: _value.i = locals->int_at (_index); break; | |
807 case T_LONG: _value.j = locals->long_at (_index); break; | |
808 case T_FLOAT: _value.f = locals->float_at (_index); break; | |
809 case T_DOUBLE: _value.d = locals->double_at(_index); break; | |
810 case T_OBJECT: { | |
811 // Wrap the oop to be returned in a local JNI handle since | |
812 // oops_do() no longer applies after doit() is finished. | |
813 oop obj = locals->obj_at(_index)(); | |
814 _value.l = JNIHandles::make_local(_calling_thread, obj); | |
815 break; | |
816 } | |
817 default: ShouldNotReachHere(); | |
818 } | |
819 } | |
820 } | |
821 | |
822 | |
823 bool VM_GetOrSetLocal::allow_nested_vm_operations() const { | |
824 return true; // May need to deoptimize | |
825 } | |
826 | |
827 | |
828 ///////////////////////////////////////////////////////////////////////////////////////// | |
829 | |
830 // | |
831 // class JvmtiSuspendControl - see comments in jvmtiImpl.hpp | |
832 // | |
833 | |
834 bool JvmtiSuspendControl::suspend(JavaThread *java_thread) { | |
835 // external suspend should have caught suspending a thread twice | |
836 | |
837 // Immediate suspension required for JPDA back-end so JVMTI agent threads do | |
838 // not deadlock due to later suspension on transitions while holding | |
839 // raw monitors. Passing true causes the immediate suspension. | |
840 // java_suspend() will catch threads in the process of exiting | |
841 // and will ignore them. | |
842 java_thread->java_suspend(); | |
843 | |
844 // It would be nice to have the following assertion in all the time, | |
845 // but it is possible for a racing resume request to have resumed | |
846 // this thread right after we suspended it. Temporarily enable this | |
847 // assertion if you are chasing a different kind of bug. | |
848 // | |
849 // assert(java_lang_Thread::thread(java_thread->threadObj()) == NULL || | |
850 // java_thread->is_being_ext_suspended(), "thread is not suspended"); | |
851 | |
852 if (java_lang_Thread::thread(java_thread->threadObj()) == NULL) { | |
853 // check again because we can get delayed in java_suspend(): | |
854 // the thread is in process of exiting. | |
855 return false; | |
856 } | |
857 | |
858 return true; | |
859 } | |
860 | |
861 bool JvmtiSuspendControl::resume(JavaThread *java_thread) { | |
862 // external suspend should have caught resuming a thread twice | |
863 assert(java_thread->is_being_ext_suspended(), "thread should be suspended"); | |
864 | |
865 // resume thread | |
866 { | |
867 // must always grab Threads_lock, see JVM_SuspendThread | |
868 MutexLocker ml(Threads_lock); | |
869 java_thread->java_resume(); | |
870 } | |
871 | |
872 return true; | |
873 } | |
874 | |
875 | |
876 void JvmtiSuspendControl::print() { | |
877 #ifndef PRODUCT | |
878 MutexLocker mu(Threads_lock); | |
879 ResourceMark rm; | |
880 | |
881 tty->print("Suspended Threads: ["); | |
882 for (JavaThread *thread = Threads::first(); thread != NULL; thread = thread->next()) { | |
883 #if JVMTI_TRACE | |
884 const char *name = JvmtiTrace::safe_get_thread_name(thread); | |
885 #else | |
886 const char *name = ""; | |
887 #endif /*JVMTI_TRACE */ | |
888 tty->print("%s(%c ", name, thread->is_being_ext_suspended() ? 'S' : '_'); | |
889 if (!thread->has_last_Java_frame()) { | |
890 tty->print("no stack"); | |
891 } | |
892 tty->print(") "); | |
893 } | |
894 tty->print_cr("]"); | |
895 #endif | |
896 } |