Print this page
rev 4530 : 6843375: Debuggee VM crashes performing mark-sweep-compact
Reviewed-by: stefank, jmasa
| Split |
Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/prims/jvmtiImpl.cpp
+++ new/src/share/vm/prims/jvmtiImpl.cpp
1 1 /*
2 2 * Copyright (c) 2003, 2013, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "classfile/systemDictionary.hpp"
27 27 #include "interpreter/interpreter.hpp"
28 28 #include "jvmtifiles/jvmtiEnv.hpp"
29 29 #include "memory/resourceArea.hpp"
30 30 #include "oops/instanceKlass.hpp"
31 31 #include "prims/jvmtiAgentThread.hpp"
32 32 #include "prims/jvmtiEventController.inline.hpp"
33 33 #include "prims/jvmtiImpl.hpp"
34 34 #include "prims/jvmtiRedefineClasses.hpp"
35 35 #include "runtime/atomic.hpp"
36 36 #include "runtime/deoptimization.hpp"
37 37 #include "runtime/handles.hpp"
38 38 #include "runtime/handles.inline.hpp"
39 39 #include "runtime/interfaceSupport.hpp"
40 40 #include "runtime/javaCalls.hpp"
41 41 #include "runtime/os.hpp"
42 42 #include "runtime/serviceThread.hpp"
43 43 #include "runtime/signature.hpp"
44 44 #include "runtime/vframe.hpp"
45 45 #include "runtime/vframe_hp.hpp"
46 46 #include "runtime/vm_operations.hpp"
47 47 #include "utilities/exceptions.hpp"
48 48 #ifdef TARGET_OS_FAMILY_linux
49 49 # include "thread_linux.inline.hpp"
50 50 #endif
51 51 #ifdef TARGET_OS_FAMILY_solaris
52 52 # include "thread_solaris.inline.hpp"
53 53 #endif
54 54 #ifdef TARGET_OS_FAMILY_windows
55 55 # include "thread_windows.inline.hpp"
56 56 #endif
57 57 #ifdef TARGET_OS_FAMILY_bsd
58 58 # include "thread_bsd.inline.hpp"
59 59 #endif
60 60
61 61 //
62 62 // class JvmtiAgentThread
63 63 //
64 64 // JavaThread used to wrap a thread started by an agent
65 65 // using the JVMTI method RunAgentThread.
66 66 //
67 67
68 68 JvmtiAgentThread::JvmtiAgentThread(JvmtiEnv* env, jvmtiStartFunction start_fn, const void *start_arg)
69 69 : JavaThread(start_function_wrapper) {
70 70 _env = env;
71 71 _start_fn = start_fn;
72 72 _start_arg = start_arg;
73 73 }
74 74
75 75 void
76 76 JvmtiAgentThread::start_function_wrapper(JavaThread *thread, TRAPS) {
77 77 // It is expected that any Agent threads will be created as
78 78 // Java Threads. If this is the case, notification of the creation
79 79 // of the thread is given in JavaThread::thread_main().
80 80 assert(thread->is_Java_thread(), "debugger thread should be a Java Thread");
81 81 assert(thread == JavaThread::current(), "sanity check");
82 82
83 83 JvmtiAgentThread *dthread = (JvmtiAgentThread *)thread;
84 84 dthread->call_start_function();
85 85 }
86 86
87 87 void
88 88 JvmtiAgentThread::call_start_function() {
89 89 ThreadToNativeFromVM transition(this);
90 90 _start_fn(_env->jvmti_external(), jni_environment(), (void*)_start_arg);
91 91 }
92 92
93 93
94 94 //
95 95 // class GrowableCache - private methods
96 96 //
97 97
98 98 void GrowableCache::recache() {
99 99 int len = _elements->length();
100 100
101 101 FREE_C_HEAP_ARRAY(address, _cache, mtInternal);
102 102 _cache = NEW_C_HEAP_ARRAY(address,len+1, mtInternal);
103 103
104 104 for (int i=0; i<len; i++) {
105 105 _cache[i] = _elements->at(i)->getCacheValue();
106 106 //
107 107 // The cache entry has gone bad. Without a valid frame pointer
108 108 // value, the entry is useless so we simply delete it in product
109 109 // mode. The call to remove() will rebuild the cache again
110 110 // without the bad entry.
111 111 //
112 112 if (_cache[i] == NULL) {
113 113 assert(false, "cannot recache NULL elements");
114 114 remove(i);
115 115 return;
116 116 }
117 117 }
118 118 _cache[len] = NULL;
119 119
120 120 _listener_fun(_this_obj,_cache);
121 121 }
122 122
123 123 bool GrowableCache::equals(void* v, GrowableElement *e2) {
124 124 GrowableElement *e1 = (GrowableElement *) v;
125 125 assert(e1 != NULL, "e1 != NULL");
126 126 assert(e2 != NULL, "e2 != NULL");
127 127
128 128 return e1->equals(e2);
129 129 }
130 130
131 131 //
132 132 // class GrowableCache - public methods
133 133 //
134 134
135 135 GrowableCache::GrowableCache() {
136 136 _this_obj = NULL;
137 137 _listener_fun = NULL;
138 138 _elements = NULL;
139 139 _cache = NULL;
140 140 }
141 141
142 142 GrowableCache::~GrowableCache() {
143 143 clear();
144 144 delete _elements;
145 145 FREE_C_HEAP_ARRAY(address, _cache, mtInternal);
146 146 }
147 147
148 148 void GrowableCache::initialize(void *this_obj, void listener_fun(void *, address*) ) {
149 149 _this_obj = this_obj;
150 150 _listener_fun = listener_fun;
151 151 _elements = new (ResourceObj::C_HEAP, mtInternal) GrowableArray<GrowableElement*>(5,true);
152 152 recache();
153 153 }
154 154
155 155 // number of elements in the collection
156 156 int GrowableCache::length() {
157 157 return _elements->length();
158 158 }
159 159
160 160 // get the value of the index element in the collection
161 161 GrowableElement* GrowableCache::at(int index) {
162 162 GrowableElement *e = (GrowableElement *) _elements->at(index);
163 163 assert(e != NULL, "e != NULL");
164 164 return e;
165 165 }
166 166
167 167 int GrowableCache::find(GrowableElement* e) {
168 168 return _elements->find(e, GrowableCache::equals);
169 169 }
170 170
171 171 // append a copy of the element to the end of the collection
172 172 void GrowableCache::append(GrowableElement* e) {
173 173 GrowableElement *new_e = e->clone();
174 174 _elements->append(new_e);
175 175 recache();
176 176 }
177 177
178 178 // insert a copy of the element using lessthan()
179 179 void GrowableCache::insert(GrowableElement* e) {
180 180 GrowableElement *new_e = e->clone();
181 181 _elements->append(new_e);
182 182
183 183 int n = length()-2;
184 184 for (int i=n; i>=0; i--) {
185 185 GrowableElement *e1 = _elements->at(i);
186 186 GrowableElement *e2 = _elements->at(i+1);
187 187 if (e2->lessThan(e1)) {
188 188 _elements->at_put(i+1, e1);
189 189 _elements->at_put(i, e2);
190 190 }
191 191 }
192 192
193 193 recache();
194 194 }
195 195
196 196 // remove the element at index
197 197 void GrowableCache::remove (int index) {
198 198 GrowableElement *e = _elements->at(index);
199 199 assert(e != NULL, "e != NULL");
200 200 _elements->remove(e);
201 201 delete e;
202 202 recache();
203 203 }
204 204
205 205 // clear out all elements, release all heap space and
206 206 // let our listener know that things have changed.
207 207 void GrowableCache::clear() {
208 208 int len = _elements->length();
209 209 for (int i=0; i<len; i++) {
210 210 delete _elements->at(i);
211 211 }
212 212 _elements->clear();
213 213 recache();
214 214 }
215 215
216 216 void GrowableCache::oops_do(OopClosure* f) {
217 217 int len = _elements->length();
218 218 for (int i=0; i<len; i++) {
219 219 GrowableElement *e = _elements->at(i);
220 220 e->oops_do(f);
221 221 }
222 222 }
223 223
224 224 void GrowableCache::gc_epilogue() {
225 225 int len = _elements->length();
226 226 for (int i=0; i<len; i++) {
227 227 _cache[i] = _elements->at(i)->getCacheValue();
228 228 }
229 229 }
230 230
231 231 //
232 232 // class JvmtiBreakpoint
233 233 //
234 234
235 235 JvmtiBreakpoint::JvmtiBreakpoint() {
236 236 _method = NULL;
237 237 _bci = 0;
238 238 #ifdef CHECK_UNHANDLED_OOPS
239 239 // This one is always allocated with new, but check it just in case.
240 240 Thread *thread = Thread::current();
241 241 if (thread->is_in_stack((address)&_method)) {
242 242 thread->allow_unhandled_oop((oop*)&_method);
243 243 }
244 244 #endif // CHECK_UNHANDLED_OOPS
245 245 }
246 246
247 247 JvmtiBreakpoint::JvmtiBreakpoint(methodOop m_method, jlocation location) {
248 248 _method = m_method;
249 249 assert(_method != NULL, "_method != NULL");
250 250 _bci = (int) location;
251 251 #ifdef CHECK_UNHANDLED_OOPS
252 252 // Could be allocated with new and wouldn't be on the unhandled oop list.
253 253 Thread *thread = Thread::current();
254 254 if (thread->is_in_stack((address)&_method)) {
255 255 thread->allow_unhandled_oop(&_method);
256 256 }
257 257 #endif // CHECK_UNHANDLED_OOPS
258 258
259 259 assert(_bci >= 0, "_bci >= 0");
260 260 }
261 261
262 262 void JvmtiBreakpoint::copy(JvmtiBreakpoint& bp) {
263 263 _method = bp._method;
264 264 _bci = bp._bci;
265 265 }
266 266
267 267 bool JvmtiBreakpoint::lessThan(JvmtiBreakpoint& bp) {
268 268 Unimplemented();
269 269 return false;
270 270 }
271 271
272 272 bool JvmtiBreakpoint::equals(JvmtiBreakpoint& bp) {
273 273 return _method == bp._method
274 274 && _bci == bp._bci;
275 275 }
276 276
277 277 bool JvmtiBreakpoint::is_valid() {
278 278 return _method != NULL &&
279 279 _bci >= 0;
280 280 }
281 281
282 282 address JvmtiBreakpoint::getBcp() {
283 283 return _method->bcp_from(_bci);
284 284 }
285 285
286 286 void JvmtiBreakpoint::each_method_version_do(method_action meth_act) {
287 287 ((methodOopDesc*)_method->*meth_act)(_bci);
288 288
289 289 // add/remove breakpoint to/from versions of the method that
290 290 // are EMCP. Directly or transitively obsolete methods are
291 291 // not saved in the PreviousVersionInfo.
292 292 Thread *thread = Thread::current();
293 293 instanceKlassHandle ikh = instanceKlassHandle(thread, _method->method_holder());
294 294 Symbol* m_name = _method->name();
295 295 Symbol* m_signature = _method->signature();
296 296
297 297 {
298 298 ResourceMark rm(thread);
299 299 // PreviousVersionInfo objects returned via PreviousVersionWalker
300 300 // contain a GrowableArray of handles. We have to clean up the
301 301 // GrowableArray _after_ the PreviousVersionWalker destructor
302 302 // has destroyed the handles.
303 303 {
304 304 // search previous versions if they exist
305 305 PreviousVersionWalker pvw((instanceKlass *)ikh()->klass_part());
306 306 for (PreviousVersionInfo * pv_info = pvw.next_previous_version();
307 307 pv_info != NULL; pv_info = pvw.next_previous_version()) {
308 308 GrowableArray<methodHandle>* methods =
309 309 pv_info->prev_EMCP_method_handles();
310 310
311 311 if (methods == NULL) {
312 312 // We have run into a PreviousVersion generation where
313 313 // all methods were made obsolete during that generation's
314 314 // RedefineClasses() operation. At the time of that
315 315 // operation, all EMCP methods were flushed so we don't
316 316 // have to go back any further.
317 317 //
318 318 // A NULL methods array is different than an empty methods
319 319 // array. We cannot infer any optimizations about older
320 320 // generations from an empty methods array for the current
321 321 // generation.
322 322 break;
323 323 }
324 324
325 325 for (int i = methods->length() - 1; i >= 0; i--) {
326 326 methodHandle method = methods->at(i);
327 327 if (method->name() == m_name && method->signature() == m_signature) {
328 328 RC_TRACE(0x00000800, ("%sing breakpoint in %s(%s)",
329 329 meth_act == &methodOopDesc::set_breakpoint ? "sett" : "clear",
330 330 method->name()->as_C_string(),
331 331 method->signature()->as_C_string()));
332 332 assert(!method->is_obsolete(), "only EMCP methods here");
333 333
334 334 ((methodOopDesc*)method()->*meth_act)(_bci);
335 335 break;
336 336 }
337 337 }
338 338 }
339 339 } // pvw is cleaned up
340 340 } // rm is cleaned up
341 341 }
342 342
343 343 void JvmtiBreakpoint::set() {
344 344 each_method_version_do(&methodOopDesc::set_breakpoint);
345 345 }
346 346
347 347 void JvmtiBreakpoint::clear() {
348 348 each_method_version_do(&methodOopDesc::clear_breakpoint);
349 349 }
350 350
351 351 void JvmtiBreakpoint::print() {
352 352 #ifndef PRODUCT
353 353 const char *class_name = (_method == NULL) ? "NULL" : _method->klass_name()->as_C_string();
354 354 const char *method_name = (_method == NULL) ? "NULL" : _method->name()->as_C_string();
355 355
356 356 tty->print("Breakpoint(%s,%s,%d,%p)",class_name, method_name, _bci, getBcp());
357 357 #endif
358 358 }
359 359
360 360
361 361 //
362 362 // class VM_ChangeBreakpoints
363 363 //
364 364 // Modify the Breakpoints data structure at a safepoint
|
↓ open down ↓ |
364 lines elided |
↑ open up ↑ |
365 365 //
366 366
367 367 void VM_ChangeBreakpoints::doit() {
368 368 switch (_operation) {
369 369 case SET_BREAKPOINT:
370 370 _breakpoints->set_at_safepoint(*_bp);
371 371 break;
372 372 case CLEAR_BREAKPOINT:
373 373 _breakpoints->clear_at_safepoint(*_bp);
374 374 break;
375 - case CLEAR_ALL_BREAKPOINT:
376 - _breakpoints->clearall_at_safepoint();
377 - break;
378 375 default:
379 376 assert(false, "Unknown operation");
380 377 }
381 378 }
382 379
383 380 void VM_ChangeBreakpoints::oops_do(OopClosure* f) {
384 - // This operation keeps breakpoints alive
385 - if (_breakpoints != NULL) {
386 - _breakpoints->oops_do(f);
387 - }
381 + // The JvmtiBreakpoints in _breakpoints will be visited via
382 + // JvmtiExport::oops_do.
388 383 if (_bp != NULL) {
389 384 _bp->oops_do(f);
390 385 }
391 386 }
392 387
393 388 //
394 389 // class JvmtiBreakpoints
395 390 //
396 391 // a JVMTI internal collection of JvmtiBreakpoint
397 392 //
398 393
399 394 JvmtiBreakpoints::JvmtiBreakpoints(void listener_fun(void *,address *)) {
400 395 _bps.initialize(this,listener_fun);
401 396 }
402 397
403 398 JvmtiBreakpoints:: ~JvmtiBreakpoints() {}
404 399
405 400 void JvmtiBreakpoints::oops_do(OopClosure* f) {
406 401 _bps.oops_do(f);
407 402 }
408 403
409 404 void JvmtiBreakpoints::gc_epilogue() {
410 405 _bps.gc_epilogue();
411 406 }
412 407
413 408 void JvmtiBreakpoints::print() {
414 409 #ifndef PRODUCT
415 410 ResourceMark rm;
416 411
417 412 int n = _bps.length();
418 413 for (int i=0; i<n; i++) {
419 414 JvmtiBreakpoint& bp = _bps.at(i);
420 415 tty->print("%d: ", i);
421 416 bp.print();
422 417 tty->print_cr("");
423 418 }
424 419 #endif
425 420 }
426 421
427 422
428 423 void JvmtiBreakpoints::set_at_safepoint(JvmtiBreakpoint& bp) {
429 424 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
430 425
431 426 int i = _bps.find(bp);
432 427 if (i == -1) {
433 428 _bps.append(bp);
434 429 bp.set();
435 430 }
436 431 }
437 432
|
↓ open down ↓ |
40 lines elided |
↑ open up ↑ |
438 433 void JvmtiBreakpoints::clear_at_safepoint(JvmtiBreakpoint& bp) {
439 434 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
440 435
441 436 int i = _bps.find(bp);
442 437 if (i != -1) {
443 438 _bps.remove(i);
444 439 bp.clear();
445 440 }
446 441 }
447 442
448 -void JvmtiBreakpoints::clearall_at_safepoint() {
449 - assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
450 -
451 - int len = _bps.length();
452 - for (int i=0; i<len; i++) {
453 - _bps.at(i).clear();
454 - }
455 - _bps.clear();
456 -}
457 -
458 443 int JvmtiBreakpoints::length() { return _bps.length(); }
459 444
460 445 int JvmtiBreakpoints::set(JvmtiBreakpoint& bp) {
461 446 if ( _bps.find(bp) != -1) {
462 447 return JVMTI_ERROR_DUPLICATE;
463 448 }
464 - VM_ChangeBreakpoints set_breakpoint(this,VM_ChangeBreakpoints::SET_BREAKPOINT, &bp);
449 + VM_ChangeBreakpoints set_breakpoint(VM_ChangeBreakpoints::SET_BREAKPOINT, &bp);
465 450 VMThread::execute(&set_breakpoint);
466 451 return JVMTI_ERROR_NONE;
467 452 }
468 453
469 454 int JvmtiBreakpoints::clear(JvmtiBreakpoint& bp) {
470 455 if ( _bps.find(bp) == -1) {
471 456 return JVMTI_ERROR_NOT_FOUND;
472 457 }
473 458
474 - VM_ChangeBreakpoints clear_breakpoint(this,VM_ChangeBreakpoints::CLEAR_BREAKPOINT, &bp);
459 + VM_ChangeBreakpoints clear_breakpoint(VM_ChangeBreakpoints::CLEAR_BREAKPOINT, &bp);
475 460 VMThread::execute(&clear_breakpoint);
476 461 return JVMTI_ERROR_NONE;
477 462 }
478 463
479 464 void JvmtiBreakpoints::clearall_in_class_at_safepoint(klassOop klass) {
480 465 bool changed = true;
481 466 // We are going to run thru the list of bkpts
482 467 // and delete some. This deletion probably alters
483 468 // the list in some implementation defined way such
484 469 // that when we delete entry i, the next entry might
485 470 // no longer be at i+1. To be safe, each time we delete
486 471 // an entry, we'll just start again from the beginning.
487 472 // We'll stop when we make a pass thru the whole list without
488 473 // deleting anything.
489 474 while (changed) {
490 475 int len = _bps.length();
491 476 changed = false;
492 477 for (int i = 0; i < len; i++) {
493 478 JvmtiBreakpoint& bp = _bps.at(i);
494 479 if (bp.method()->method_holder() == klass) {
|
↓ open down ↓ |
10 lines elided |
↑ open up ↑ |
495 480 bp.clear();
496 481 _bps.remove(i);
497 482 // This changed 'i' so we have to start over.
498 483 changed = true;
499 484 break;
500 485 }
501 486 }
502 487 }
503 488 }
504 489
505 -void JvmtiBreakpoints::clearall() {
506 - VM_ChangeBreakpoints clearall_breakpoint(this,VM_ChangeBreakpoints::CLEAR_ALL_BREAKPOINT);
507 - VMThread::execute(&clearall_breakpoint);
508 -}
509 -
510 490 //
511 491 // class JvmtiCurrentBreakpoints
512 492 //
513 493
514 494 JvmtiBreakpoints *JvmtiCurrentBreakpoints::_jvmti_breakpoints = NULL;
515 495 address * JvmtiCurrentBreakpoints::_breakpoint_list = NULL;
516 496
517 497
518 498 JvmtiBreakpoints& JvmtiCurrentBreakpoints::get_jvmti_breakpoints() {
519 499 if (_jvmti_breakpoints != NULL) return (*_jvmti_breakpoints);
520 500 _jvmti_breakpoints = new JvmtiBreakpoints(listener_fun);
521 501 assert(_jvmti_breakpoints != NULL, "_jvmti_breakpoints != NULL");
522 502 return (*_jvmti_breakpoints);
523 503 }
524 504
525 505 void JvmtiCurrentBreakpoints::listener_fun(void *this_obj, address *cache) {
526 506 JvmtiBreakpoints *this_jvmti = (JvmtiBreakpoints *) this_obj;
527 507 assert(this_jvmti != NULL, "this_jvmti != NULL");
528 508
529 509 debug_only(int n = this_jvmti->length(););
530 510 assert(cache[n] == NULL, "cache must be NULL terminated");
531 511
532 512 set_breakpoint_list(cache);
533 513 }
534 514
535 515
536 516 void JvmtiCurrentBreakpoints::oops_do(OopClosure* f) {
537 517 if (_jvmti_breakpoints != NULL) {
538 518 _jvmti_breakpoints->oops_do(f);
539 519 }
540 520 }
541 521
542 522 void JvmtiCurrentBreakpoints::gc_epilogue() {
543 523 if (_jvmti_breakpoints != NULL) {
544 524 _jvmti_breakpoints->gc_epilogue();
545 525 }
546 526 }
547 527
548 528 ///////////////////////////////////////////////////////////////
549 529 //
550 530 // class VM_GetOrSetLocal
551 531 //
552 532
553 533 // Constructor for non-object getter
554 534 VM_GetOrSetLocal::VM_GetOrSetLocal(JavaThread* thread, jint depth, int index, BasicType type)
555 535 : _thread(thread)
556 536 , _calling_thread(NULL)
557 537 , _depth(depth)
558 538 , _index(index)
559 539 , _type(type)
560 540 , _set(false)
561 541 , _jvf(NULL)
562 542 , _result(JVMTI_ERROR_NONE)
563 543 {
564 544 }
565 545
566 546 // Constructor for object or non-object setter
567 547 VM_GetOrSetLocal::VM_GetOrSetLocal(JavaThread* thread, jint depth, int index, BasicType type, jvalue value)
568 548 : _thread(thread)
569 549 , _calling_thread(NULL)
570 550 , _depth(depth)
571 551 , _index(index)
572 552 , _type(type)
573 553 , _value(value)
574 554 , _set(true)
575 555 , _jvf(NULL)
576 556 , _result(JVMTI_ERROR_NONE)
577 557 {
578 558 }
579 559
580 560 // Constructor for object getter
581 561 VM_GetOrSetLocal::VM_GetOrSetLocal(JavaThread* thread, JavaThread* calling_thread, jint depth, int index)
582 562 : _thread(thread)
583 563 , _calling_thread(calling_thread)
584 564 , _depth(depth)
585 565 , _index(index)
586 566 , _type(T_OBJECT)
587 567 , _set(false)
588 568 , _jvf(NULL)
589 569 , _result(JVMTI_ERROR_NONE)
590 570 {
591 571 }
592 572
593 573 vframe *VM_GetOrSetLocal::get_vframe() {
594 574 if (!_thread->has_last_Java_frame()) {
595 575 return NULL;
596 576 }
597 577 RegisterMap reg_map(_thread);
598 578 vframe *vf = _thread->last_java_vframe(®_map);
599 579 int d = 0;
600 580 while ((vf != NULL) && (d < _depth)) {
601 581 vf = vf->java_sender();
602 582 d++;
603 583 }
604 584 return vf;
605 585 }
606 586
607 587 javaVFrame *VM_GetOrSetLocal::get_java_vframe() {
608 588 vframe* vf = get_vframe();
609 589 if (vf == NULL) {
610 590 _result = JVMTI_ERROR_NO_MORE_FRAMES;
611 591 return NULL;
612 592 }
613 593 javaVFrame *jvf = (javaVFrame*)vf;
614 594
615 595 if (!vf->is_java_frame()) {
616 596 _result = JVMTI_ERROR_OPAQUE_FRAME;
617 597 return NULL;
618 598 }
619 599 return jvf;
620 600 }
621 601
622 602 // Check that the klass is assignable to a type with the given signature.
623 603 // Another solution could be to use the function Klass::is_subtype_of(type).
624 604 // But the type class can be forced to load/initialize eagerly in such a case.
625 605 // This may cause unexpected consequences like CFLH or class-init JVMTI events.
626 606 // It is better to avoid such a behavior.
627 607 bool VM_GetOrSetLocal::is_assignable(const char* ty_sign, Klass* klass, Thread* thread) {
628 608 assert(ty_sign != NULL, "type signature must not be NULL");
629 609 assert(thread != NULL, "thread must not be NULL");
630 610 assert(klass != NULL, "klass must not be NULL");
631 611
632 612 int len = (int) strlen(ty_sign);
633 613 if (ty_sign[0] == 'L' && ty_sign[len-1] == ';') { // Need pure class/interface name
634 614 ty_sign++;
635 615 len -= 2;
636 616 }
637 617 TempNewSymbol ty_sym = SymbolTable::new_symbol(ty_sign, len, thread);
638 618 if (klass->name() == ty_sym) {
639 619 return true;
640 620 }
641 621 // Compare primary supers
642 622 int super_depth = klass->super_depth();
643 623 int idx;
644 624 for (idx = 0; idx < super_depth; idx++) {
645 625 if (Klass::cast(klass->primary_super_of_depth(idx))->name() == ty_sym) {
646 626 return true;
647 627 }
648 628 }
649 629 // Compare secondary supers
650 630 objArrayOop sec_supers = klass->secondary_supers();
651 631 for (idx = 0; idx < sec_supers->length(); idx++) {
652 632 if (Klass::cast((klassOop) sec_supers->obj_at(idx))->name() == ty_sym) {
653 633 return true;
654 634 }
655 635 }
656 636 return false;
657 637 }
658 638
659 639 // Checks error conditions:
660 640 // JVMTI_ERROR_INVALID_SLOT
661 641 // JVMTI_ERROR_TYPE_MISMATCH
662 642 // Returns: 'true' - everything is Ok, 'false' - error code
663 643
664 644 bool VM_GetOrSetLocal::check_slot_type(javaVFrame* jvf) {
665 645 methodOop method_oop = jvf->method();
666 646 if (!method_oop->has_localvariable_table()) {
667 647 // Just to check index boundaries
668 648 jint extra_slot = (_type == T_LONG || _type == T_DOUBLE) ? 1 : 0;
669 649 if (_index < 0 || _index + extra_slot >= method_oop->max_locals()) {
670 650 _result = JVMTI_ERROR_INVALID_SLOT;
671 651 return false;
672 652 }
673 653 return true;
674 654 }
675 655
676 656 jint num_entries = method_oop->localvariable_table_length();
677 657 if (num_entries == 0) {
678 658 _result = JVMTI_ERROR_INVALID_SLOT;
679 659 return false; // There are no slots
680 660 }
681 661 int signature_idx = -1;
682 662 int vf_bci = jvf->bci();
683 663 LocalVariableTableElement* table = method_oop->localvariable_table_start();
684 664 for (int i = 0; i < num_entries; i++) {
685 665 int start_bci = table[i].start_bci;
686 666 int end_bci = start_bci + table[i].length;
687 667
688 668 // Here we assume that locations of LVT entries
689 669 // with the same slot number cannot be overlapped
690 670 if (_index == (jint) table[i].slot && start_bci <= vf_bci && vf_bci <= end_bci) {
691 671 signature_idx = (int) table[i].descriptor_cp_index;
692 672 break;
693 673 }
694 674 }
695 675 if (signature_idx == -1) {
696 676 _result = JVMTI_ERROR_INVALID_SLOT;
697 677 return false; // Incorrect slot index
698 678 }
699 679 Symbol* sign_sym = method_oop->constants()->symbol_at(signature_idx);
700 680 const char* signature = (const char *) sign_sym->as_utf8();
701 681 BasicType slot_type = char2type(signature[0]);
702 682
703 683 switch (slot_type) {
704 684 case T_BYTE:
705 685 case T_SHORT:
706 686 case T_CHAR:
707 687 case T_BOOLEAN:
708 688 slot_type = T_INT;
709 689 break;
710 690 case T_ARRAY:
711 691 slot_type = T_OBJECT;
712 692 break;
713 693 };
714 694 if (_type != slot_type) {
715 695 _result = JVMTI_ERROR_TYPE_MISMATCH;
716 696 return false;
717 697 }
718 698
719 699 jobject jobj = _value.l;
720 700 if (_set && slot_type == T_OBJECT && jobj != NULL) { // NULL reference is allowed
721 701 // Check that the jobject class matches the return type signature.
722 702 JavaThread* cur_thread = JavaThread::current();
723 703 HandleMark hm(cur_thread);
724 704
725 705 Handle obj = Handle(cur_thread, JNIHandles::resolve_external_guard(jobj));
726 706 NULL_CHECK(obj, (_result = JVMTI_ERROR_INVALID_OBJECT, false));
727 707 KlassHandle ob_kh = KlassHandle(cur_thread, obj->klass());
728 708 NULL_CHECK(ob_kh, (_result = JVMTI_ERROR_INVALID_OBJECT, false));
729 709
730 710 if (!is_assignable(signature, Klass::cast(ob_kh()), cur_thread)) {
731 711 _result = JVMTI_ERROR_TYPE_MISMATCH;
732 712 return false;
733 713 }
734 714 }
735 715 return true;
736 716 }
737 717
738 718 static bool can_be_deoptimized(vframe* vf) {
739 719 return (vf->is_compiled_frame() && vf->fr().can_be_deoptimized());
740 720 }
741 721
742 722 bool VM_GetOrSetLocal::doit_prologue() {
743 723 _jvf = get_java_vframe();
744 724 NULL_CHECK(_jvf, false);
745 725
746 726 if (_jvf->method()->is_native()) {
747 727 if (getting_receiver() && !_jvf->method()->is_static()) {
748 728 return true;
749 729 } else {
750 730 _result = JVMTI_ERROR_OPAQUE_FRAME;
751 731 return false;
752 732 }
753 733 }
754 734
755 735 if (!check_slot_type(_jvf)) {
756 736 return false;
757 737 }
758 738 return true;
759 739 }
760 740
761 741 void VM_GetOrSetLocal::doit() {
762 742 if (_set) {
763 743 // Force deoptimization of frame if compiled because it's
764 744 // possible the compiler emitted some locals as constant values,
765 745 // meaning they are not mutable.
766 746 if (can_be_deoptimized(_jvf)) {
767 747
768 748 // Schedule deoptimization so that eventually the local
769 749 // update will be written to an interpreter frame.
770 750 Deoptimization::deoptimize_frame(_jvf->thread(), _jvf->fr().id());
771 751
772 752 // Now store a new value for the local which will be applied
773 753 // once deoptimization occurs. Note however that while this
774 754 // write is deferred until deoptimization actually happens
775 755 // can vframe created after this point will have its locals
776 756 // reflecting this update so as far as anyone can see the
777 757 // write has already taken place.
778 758
779 759 // If we are updating an oop then get the oop from the handle
780 760 // since the handle will be long gone by the time the deopt
781 761 // happens. The oop stored in the deferred local will be
782 762 // gc'd on its own.
783 763 if (_type == T_OBJECT) {
784 764 _value.l = (jobject) (JNIHandles::resolve_external_guard(_value.l));
785 765 }
786 766 // Re-read the vframe so we can see that it is deoptimized
787 767 // [ Only need because of assert in update_local() ]
788 768 _jvf = get_java_vframe();
789 769 ((compiledVFrame*)_jvf)->update_local(_type, _index, _value);
790 770 return;
791 771 }
792 772 StackValueCollection *locals = _jvf->locals();
793 773 HandleMark hm;
794 774
795 775 switch (_type) {
796 776 case T_INT: locals->set_int_at (_index, _value.i); break;
797 777 case T_LONG: locals->set_long_at (_index, _value.j); break;
798 778 case T_FLOAT: locals->set_float_at (_index, _value.f); break;
799 779 case T_DOUBLE: locals->set_double_at(_index, _value.d); break;
800 780 case T_OBJECT: {
801 781 Handle ob_h(JNIHandles::resolve_external_guard(_value.l));
802 782 locals->set_obj_at (_index, ob_h);
803 783 break;
804 784 }
805 785 default: ShouldNotReachHere();
806 786 }
807 787 _jvf->set_locals(locals);
808 788 } else {
809 789 if (_jvf->method()->is_native() && _jvf->is_compiled_frame()) {
810 790 assert(getting_receiver(), "Can only get here when getting receiver");
811 791 oop receiver = _jvf->fr().get_native_receiver();
812 792 _value.l = JNIHandles::make_local(_calling_thread, receiver);
813 793 } else {
814 794 StackValueCollection *locals = _jvf->locals();
815 795
816 796 if (locals->at(_index)->type() == T_CONFLICT) {
817 797 memset(&_value, 0, sizeof(_value));
818 798 _value.l = NULL;
819 799 return;
820 800 }
821 801
822 802 switch (_type) {
823 803 case T_INT: _value.i = locals->int_at (_index); break;
824 804 case T_LONG: _value.j = locals->long_at (_index); break;
825 805 case T_FLOAT: _value.f = locals->float_at (_index); break;
826 806 case T_DOUBLE: _value.d = locals->double_at(_index); break;
827 807 case T_OBJECT: {
828 808 // Wrap the oop to be returned in a local JNI handle since
829 809 // oops_do() no longer applies after doit() is finished.
830 810 oop obj = locals->obj_at(_index)();
831 811 _value.l = JNIHandles::make_local(_calling_thread, obj);
832 812 break;
833 813 }
834 814 default: ShouldNotReachHere();
835 815 }
836 816 }
837 817 }
838 818 }
839 819
840 820
841 821 bool VM_GetOrSetLocal::allow_nested_vm_operations() const {
842 822 return true; // May need to deoptimize
843 823 }
844 824
845 825
846 826 VM_GetReceiver::VM_GetReceiver(
847 827 JavaThread* thread, JavaThread* caller_thread, jint depth)
848 828 : VM_GetOrSetLocal(thread, caller_thread, depth, 0) {}
849 829
850 830 /////////////////////////////////////////////////////////////////////////////////////////
851 831
852 832 //
853 833 // class JvmtiSuspendControl - see comments in jvmtiImpl.hpp
854 834 //
855 835
856 836 bool JvmtiSuspendControl::suspend(JavaThread *java_thread) {
857 837 // external suspend should have caught suspending a thread twice
858 838
859 839 // Immediate suspension required for JPDA back-end so JVMTI agent threads do
860 840 // not deadlock due to later suspension on transitions while holding
861 841 // raw monitors. Passing true causes the immediate suspension.
862 842 // java_suspend() will catch threads in the process of exiting
863 843 // and will ignore them.
864 844 java_thread->java_suspend();
865 845
866 846 // It would be nice to have the following assertion in all the time,
867 847 // but it is possible for a racing resume request to have resumed
868 848 // this thread right after we suspended it. Temporarily enable this
869 849 // assertion if you are chasing a different kind of bug.
870 850 //
871 851 // assert(java_lang_Thread::thread(java_thread->threadObj()) == NULL ||
872 852 // java_thread->is_being_ext_suspended(), "thread is not suspended");
873 853
874 854 if (java_lang_Thread::thread(java_thread->threadObj()) == NULL) {
875 855 // check again because we can get delayed in java_suspend():
876 856 // the thread is in process of exiting.
877 857 return false;
878 858 }
879 859
880 860 return true;
881 861 }
882 862
883 863 bool JvmtiSuspendControl::resume(JavaThread *java_thread) {
884 864 // external suspend should have caught resuming a thread twice
885 865 assert(java_thread->is_being_ext_suspended(), "thread should be suspended");
886 866
887 867 // resume thread
888 868 {
889 869 // must always grab Threads_lock, see JVM_SuspendThread
890 870 MutexLocker ml(Threads_lock);
891 871 java_thread->java_resume();
892 872 }
893 873
894 874 return true;
895 875 }
896 876
897 877
898 878 void JvmtiSuspendControl::print() {
899 879 #ifndef PRODUCT
900 880 MutexLocker mu(Threads_lock);
901 881 ResourceMark rm;
902 882
903 883 tty->print("Suspended Threads: [");
904 884 for (JavaThread *thread = Threads::first(); thread != NULL; thread = thread->next()) {
905 885 #if JVMTI_TRACE
906 886 const char *name = JvmtiTrace::safe_get_thread_name(thread);
907 887 #else
908 888 const char *name = "";
909 889 #endif /*JVMTI_TRACE */
910 890 tty->print("%s(%c ", name, thread->is_being_ext_suspended() ? 'S' : '_');
911 891 if (!thread->has_last_Java_frame()) {
912 892 tty->print("no stack");
913 893 }
914 894 tty->print(") ");
915 895 }
916 896 tty->print_cr("]");
917 897 #endif
918 898 }
919 899
920 900 JvmtiDeferredEvent JvmtiDeferredEvent::compiled_method_load_event(
921 901 nmethod* nm) {
922 902 JvmtiDeferredEvent event = JvmtiDeferredEvent(TYPE_COMPILED_METHOD_LOAD);
923 903 event._event_data.compiled_method_load = nm;
924 904 // Keep the nmethod alive until the ServiceThread can process
925 905 // this deferred event.
926 906 nmethodLocker::lock_nmethod(nm);
927 907 return event;
928 908 }
929 909
930 910 JvmtiDeferredEvent JvmtiDeferredEvent::compiled_method_unload_event(
931 911 nmethod* nm, jmethodID id, const void* code) {
932 912 JvmtiDeferredEvent event = JvmtiDeferredEvent(TYPE_COMPILED_METHOD_UNLOAD);
933 913 event._event_data.compiled_method_unload.nm = nm;
934 914 event._event_data.compiled_method_unload.method_id = id;
935 915 event._event_data.compiled_method_unload.code_begin = code;
936 916 // Keep the nmethod alive until the ServiceThread can process
937 917 // this deferred event. This will keep the memory for the
938 918 // generated code from being reused too early. We pass
939 919 // zombie_ok == true here so that our nmethod that was just
940 920 // made into a zombie can be locked.
941 921 nmethodLocker::lock_nmethod(nm, true /* zombie_ok */);
942 922 return event;
943 923 }
944 924
945 925 JvmtiDeferredEvent JvmtiDeferredEvent::dynamic_code_generated_event(
946 926 const char* name, const void* code_begin, const void* code_end) {
947 927 JvmtiDeferredEvent event = JvmtiDeferredEvent(TYPE_DYNAMIC_CODE_GENERATED);
948 928 // Need to make a copy of the name since we don't know how long
949 929 // the event poster will keep it around after we enqueue the
950 930 // deferred event and return. strdup() failure is handled in
951 931 // the post() routine below.
952 932 event._event_data.dynamic_code_generated.name = os::strdup(name);
953 933 event._event_data.dynamic_code_generated.code_begin = code_begin;
954 934 event._event_data.dynamic_code_generated.code_end = code_end;
955 935 return event;
956 936 }
957 937
958 938 void JvmtiDeferredEvent::post() {
959 939 assert(ServiceThread::is_service_thread(Thread::current()),
960 940 "Service thread must post enqueued events");
961 941 switch(_type) {
962 942 case TYPE_COMPILED_METHOD_LOAD: {
963 943 nmethod* nm = _event_data.compiled_method_load;
964 944 JvmtiExport::post_compiled_method_load(nm);
965 945 // done with the deferred event so unlock the nmethod
966 946 nmethodLocker::unlock_nmethod(nm);
967 947 break;
968 948 }
969 949 case TYPE_COMPILED_METHOD_UNLOAD: {
970 950 nmethod* nm = _event_data.compiled_method_unload.nm;
971 951 JvmtiExport::post_compiled_method_unload(
972 952 _event_data.compiled_method_unload.method_id,
973 953 _event_data.compiled_method_unload.code_begin);
974 954 // done with the deferred event so unlock the nmethod
975 955 nmethodLocker::unlock_nmethod(nm);
976 956 break;
977 957 }
978 958 case TYPE_DYNAMIC_CODE_GENERATED: {
979 959 JvmtiExport::post_dynamic_code_generated_internal(
980 960 // if strdup failed give the event a default name
981 961 (_event_data.dynamic_code_generated.name == NULL)
982 962 ? "unknown_code" : _event_data.dynamic_code_generated.name,
983 963 _event_data.dynamic_code_generated.code_begin,
984 964 _event_data.dynamic_code_generated.code_end);
985 965 if (_event_data.dynamic_code_generated.name != NULL) {
986 966 // release our copy
987 967 os::free((void *)_event_data.dynamic_code_generated.name);
988 968 }
989 969 break;
990 970 }
991 971 default:
992 972 ShouldNotReachHere();
993 973 }
994 974 }
995 975
996 976 JvmtiDeferredEventQueue::QueueNode* JvmtiDeferredEventQueue::_queue_tail = NULL;
997 977 JvmtiDeferredEventQueue::QueueNode* JvmtiDeferredEventQueue::_queue_head = NULL;
998 978
999 979 volatile JvmtiDeferredEventQueue::QueueNode*
1000 980 JvmtiDeferredEventQueue::_pending_list = NULL;
1001 981
1002 982 bool JvmtiDeferredEventQueue::has_events() {
1003 983 assert(Service_lock->owned_by_self(), "Must own Service_lock");
1004 984 return _queue_head != NULL || _pending_list != NULL;
1005 985 }
1006 986
1007 987 void JvmtiDeferredEventQueue::enqueue(const JvmtiDeferredEvent& event) {
1008 988 assert(Service_lock->owned_by_self(), "Must own Service_lock");
1009 989
1010 990 process_pending_events();
1011 991
1012 992 // Events get added to the end of the queue (and are pulled off the front).
1013 993 QueueNode* node = new QueueNode(event);
1014 994 if (_queue_tail == NULL) {
1015 995 _queue_tail = _queue_head = node;
1016 996 } else {
1017 997 assert(_queue_tail->next() == NULL, "Must be the last element in the list");
1018 998 _queue_tail->set_next(node);
1019 999 _queue_tail = node;
1020 1000 }
1021 1001
1022 1002 Service_lock->notify_all();
1023 1003 assert((_queue_head == NULL) == (_queue_tail == NULL),
1024 1004 "Inconsistent queue markers");
1025 1005 }
1026 1006
1027 1007 JvmtiDeferredEvent JvmtiDeferredEventQueue::dequeue() {
1028 1008 assert(Service_lock->owned_by_self(), "Must own Service_lock");
1029 1009
1030 1010 process_pending_events();
1031 1011
1032 1012 assert(_queue_head != NULL, "Nothing to dequeue");
1033 1013
1034 1014 if (_queue_head == NULL) {
1035 1015 // Just in case this happens in product; it shouldn't but let's not crash
1036 1016 return JvmtiDeferredEvent();
1037 1017 }
1038 1018
1039 1019 QueueNode* node = _queue_head;
1040 1020 _queue_head = _queue_head->next();
1041 1021 if (_queue_head == NULL) {
1042 1022 _queue_tail = NULL;
1043 1023 }
1044 1024
1045 1025 assert((_queue_head == NULL) == (_queue_tail == NULL),
1046 1026 "Inconsistent queue markers");
1047 1027
1048 1028 JvmtiDeferredEvent event = node->event();
1049 1029 delete node;
1050 1030 return event;
1051 1031 }
1052 1032
1053 1033 void JvmtiDeferredEventQueue::add_pending_event(
1054 1034 const JvmtiDeferredEvent& event) {
1055 1035
1056 1036 QueueNode* node = new QueueNode(event);
1057 1037
1058 1038 bool success = false;
1059 1039 QueueNode* prev_value = (QueueNode*)_pending_list;
1060 1040 do {
1061 1041 node->set_next(prev_value);
1062 1042 prev_value = (QueueNode*)Atomic::cmpxchg_ptr(
1063 1043 (void*)node, (volatile void*)&_pending_list, (void*)node->next());
1064 1044 } while (prev_value != node->next());
1065 1045 }
1066 1046
1067 1047 // This method transfers any events that were added by someone NOT holding
1068 1048 // the lock into the mainline queue.
1069 1049 void JvmtiDeferredEventQueue::process_pending_events() {
1070 1050 assert(Service_lock->owned_by_self(), "Must own Service_lock");
1071 1051
1072 1052 if (_pending_list != NULL) {
1073 1053 QueueNode* head =
1074 1054 (QueueNode*)Atomic::xchg_ptr(NULL, (volatile void*)&_pending_list);
1075 1055
1076 1056 assert((_queue_head == NULL) == (_queue_tail == NULL),
1077 1057 "Inconsistent queue markers");
1078 1058
1079 1059 if (head != NULL) {
1080 1060 // Since we've treated the pending list as a stack (with newer
1081 1061 // events at the beginning), we need to join the bottom of the stack
1082 1062 // with the 'tail' of the queue in order to get the events in the
1083 1063 // right order. We do this by reversing the pending list and appending
1084 1064 // it to the queue.
1085 1065
1086 1066 QueueNode* new_tail = head;
1087 1067 QueueNode* new_head = NULL;
1088 1068
1089 1069 // This reverses the list
1090 1070 QueueNode* prev = new_tail;
1091 1071 QueueNode* node = new_tail->next();
1092 1072 new_tail->set_next(NULL);
1093 1073 while (node != NULL) {
1094 1074 QueueNode* next = node->next();
1095 1075 node->set_next(prev);
1096 1076 prev = node;
1097 1077 node = next;
1098 1078 }
1099 1079 new_head = prev;
1100 1080
1101 1081 // Now append the new list to the queue
1102 1082 if (_queue_tail != NULL) {
1103 1083 _queue_tail->set_next(new_head);
1104 1084 } else { // _queue_head == NULL
1105 1085 _queue_head = new_head;
1106 1086 }
1107 1087 _queue_tail = new_tail;
1108 1088 }
1109 1089 }
1110 1090 }
|
↓ open down ↓ |
591 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX