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