src/share/vm/opto/parseHelper.cpp

Thu, 07 Oct 2010 21:40:55 -0700

author
never
date
Thu, 07 Oct 2010 21:40:55 -0700
changeset 2199
75588558f1bf
parent 2101
4b29a725c43c
child 2314
f95d63e2154a
permissions
-rw-r--r--

6980792: Crash "exception happened outside interpreter, nmethods and vtable stubs (1)"
Reviewed-by: kvn

duke@435 1 /*
never@2000 2 * Copyright (c) 1998, 2010, 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
duke@435 25 #include "incls/_precompiled.incl"
duke@435 26 #include "incls/_parseHelper.cpp.incl"
duke@435 27
duke@435 28 //------------------------------make_dtrace_method_entry_exit ----------------
duke@435 29 // Dtrace -- record entry or exit of a method if compiled with dtrace support
duke@435 30 void GraphKit::make_dtrace_method_entry_exit(ciMethod* method, bool is_entry) {
duke@435 31 const TypeFunc *call_type = OptoRuntime::dtrace_method_entry_exit_Type();
duke@435 32 address call_address = is_entry ? CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry) :
duke@435 33 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit);
duke@435 34 const char *call_name = is_entry ? "dtrace_method_entry" : "dtrace_method_exit";
duke@435 35
duke@435 36 // Get base of thread-local storage area
duke@435 37 Node* thread = _gvn.transform( new (C, 1) ThreadLocalNode() );
duke@435 38
duke@435 39 // Get method
duke@435 40 const TypeInstPtr* method_type = TypeInstPtr::make(TypePtr::Constant, method->klass(), true, method, 0);
kvn@599 41 Node *method_node = _gvn.transform( ConNode::make(C, method_type) );
duke@435 42
duke@435 43 kill_dead_locals();
duke@435 44
duke@435 45 // For some reason, this call reads only raw memory.
duke@435 46 const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
duke@435 47 make_runtime_call(RC_LEAF | RC_NARROW_MEM,
duke@435 48 call_type, call_address,
duke@435 49 call_name, raw_adr_type,
duke@435 50 thread, method_node);
duke@435 51 }
duke@435 52
duke@435 53
duke@435 54 //=============================================================================
duke@435 55 //------------------------------do_checkcast-----------------------------------
duke@435 56 void Parse::do_checkcast() {
duke@435 57 bool will_link;
duke@435 58 ciKlass* klass = iter().get_klass(will_link);
duke@435 59
duke@435 60 Node *obj = peek();
duke@435 61
duke@435 62 // Throw uncommon trap if class is not loaded or the value we are casting
duke@435 63 // _from_ is not loaded, and value is not null. If the value _is_ NULL,
duke@435 64 // then the checkcast does nothing.
duke@435 65 const TypeInstPtr *tp = _gvn.type(obj)->isa_instptr();
duke@435 66 if (!will_link || (tp && !tp->is_loaded())) {
duke@435 67 if (C->log() != NULL) {
duke@435 68 if (!will_link) {
duke@435 69 C->log()->elem("assert_null reason='checkcast' klass='%d'",
duke@435 70 C->log()->identify(klass));
duke@435 71 }
duke@435 72 if (tp && !tp->is_loaded()) {
duke@435 73 // %%% Cannot happen?
duke@435 74 C->log()->elem("assert_null reason='checkcast source' klass='%d'",
duke@435 75 C->log()->identify(tp->klass()));
duke@435 76 }
duke@435 77 }
duke@435 78 do_null_assert(obj, T_OBJECT);
duke@435 79 assert( stopped() || _gvn.type(peek())->higher_equal(TypePtr::NULL_PTR), "what's left behind is null" );
duke@435 80 if (!stopped()) {
duke@435 81 profile_null_checkcast();
duke@435 82 }
duke@435 83 return;
duke@435 84 }
duke@435 85
duke@435 86 Node *res = gen_checkcast(obj, makecon(TypeKlassPtr::make(klass)) );
duke@435 87
duke@435 88 // Pop from stack AFTER gen_checkcast because it can uncommon trap and
duke@435 89 // the debug info has to be correct.
duke@435 90 pop();
duke@435 91 push(res);
duke@435 92 }
duke@435 93
duke@435 94
duke@435 95 //------------------------------do_instanceof----------------------------------
duke@435 96 void Parse::do_instanceof() {
duke@435 97 if (stopped()) return;
duke@435 98 // We would like to return false if class is not loaded, emitting a
duke@435 99 // dependency, but Java requires instanceof to load its operand.
duke@435 100
duke@435 101 // Throw uncommon trap if class is not loaded
duke@435 102 bool will_link;
duke@435 103 ciKlass* klass = iter().get_klass(will_link);
duke@435 104
duke@435 105 if (!will_link) {
duke@435 106 if (C->log() != NULL) {
duke@435 107 C->log()->elem("assert_null reason='instanceof' klass='%d'",
duke@435 108 C->log()->identify(klass));
duke@435 109 }
duke@435 110 do_null_assert(peek(), T_OBJECT);
duke@435 111 assert( stopped() || _gvn.type(peek())->higher_equal(TypePtr::NULL_PTR), "what's left behind is null" );
duke@435 112 if (!stopped()) {
duke@435 113 // The object is now known to be null.
duke@435 114 // Shortcut the effect of gen_instanceof and return "false" directly.
duke@435 115 pop(); // pop the null
duke@435 116 push(_gvn.intcon(0)); // push false answer
duke@435 117 }
duke@435 118 return;
duke@435 119 }
duke@435 120
duke@435 121 // Push the bool result back on stack
jrose@2101 122 Node* res = gen_instanceof(peek(), makecon(TypeKlassPtr::make(klass)));
jrose@2101 123
jrose@2101 124 // Pop from stack AFTER gen_instanceof because it can uncommon trap.
jrose@2101 125 pop();
jrose@2101 126 push(res);
duke@435 127 }
duke@435 128
duke@435 129 //------------------------------array_store_check------------------------------
duke@435 130 // pull array from stack and check that the store is valid
duke@435 131 void Parse::array_store_check() {
duke@435 132
duke@435 133 // Shorthand access to array store elements
duke@435 134 Node *obj = stack(_sp-1);
duke@435 135 Node *idx = stack(_sp-2);
duke@435 136 Node *ary = stack(_sp-3);
duke@435 137
duke@435 138 if (_gvn.type(obj) == TypePtr::NULL_PTR) {
duke@435 139 // There's never a type check on null values.
duke@435 140 // This cutout lets us avoid the uncommon_trap(Reason_array_check)
duke@435 141 // below, which turns into a performance liability if the
duke@435 142 // gen_checkcast folds up completely.
duke@435 143 return;
duke@435 144 }
duke@435 145
duke@435 146 // Extract the array klass type
duke@435 147 int klass_offset = oopDesc::klass_offset_in_bytes();
duke@435 148 Node* p = basic_plus_adr( ary, ary, klass_offset );
duke@435 149 // p's type is array-of-OOPS plus klass_offset
kvn@599 150 Node* array_klass = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeInstPtr::KLASS) );
duke@435 151 // Get the array klass
duke@435 152 const TypeKlassPtr *tak = _gvn.type(array_klass)->is_klassptr();
duke@435 153
duke@435 154 // array_klass's type is generally INexact array-of-oop. Heroically
duke@435 155 // cast the array klass to EXACT array and uncommon-trap if the cast
duke@435 156 // fails.
duke@435 157 bool always_see_exact_class = false;
duke@435 158 if (MonomorphicArrayCheck
duke@435 159 && !too_many_traps(Deoptimization::Reason_array_check)) {
duke@435 160 always_see_exact_class = true;
duke@435 161 // (If no MDO at all, hope for the best, until a trap actually occurs.)
duke@435 162 }
duke@435 163
duke@435 164 // Is the array klass is exactly its defined type?
duke@435 165 if (always_see_exact_class && !tak->klass_is_exact()) {
duke@435 166 // Make a constant out of the inexact array klass
duke@435 167 const TypeKlassPtr *extak = tak->cast_to_exactness(true)->is_klassptr();
duke@435 168 Node* con = makecon(extak);
duke@435 169 Node* cmp = _gvn.transform(new (C, 3) CmpPNode( array_klass, con ));
duke@435 170 Node* bol = _gvn.transform(new (C, 2) BoolNode( cmp, BoolTest::eq ));
duke@435 171 Node* ctrl= control();
duke@435 172 { BuildCutout unless(this, bol, PROB_MAX);
duke@435 173 uncommon_trap(Deoptimization::Reason_array_check,
duke@435 174 Deoptimization::Action_maybe_recompile,
duke@435 175 tak->klass());
duke@435 176 }
duke@435 177 if (stopped()) { // MUST uncommon-trap?
duke@435 178 set_control(ctrl); // Then Don't Do It, just fall into the normal checking
duke@435 179 } else { // Cast array klass to exactness:
duke@435 180 // Use the exact constant value we know it is.
duke@435 181 replace_in_map(array_klass,con);
duke@435 182 CompileLog* log = C->log();
duke@435 183 if (log != NULL) {
duke@435 184 log->elem("cast_up reason='monomorphic_array' from='%d' to='(exact)'",
duke@435 185 log->identify(tak->klass()));
duke@435 186 }
duke@435 187 array_klass = con; // Use cast value moving forward
duke@435 188 }
duke@435 189 }
duke@435 190
duke@435 191 // Come here for polymorphic array klasses
duke@435 192
duke@435 193 // Extract the array element class
duke@435 194 int element_klass_offset = objArrayKlass::element_klass_offset_in_bytes() + sizeof(oopDesc);
duke@435 195 Node *p2 = basic_plus_adr(array_klass, array_klass, element_klass_offset);
kvn@599 196 Node *a_e_klass = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p2, tak) );
duke@435 197
duke@435 198 // Check (the hard way) and throw if not a subklass.
duke@435 199 // Result is ignored, we just need the CFG effects.
duke@435 200 gen_checkcast( obj, a_e_klass );
duke@435 201 }
duke@435 202
duke@435 203
never@2000 204 void Parse::emit_guard_for_new(ciInstanceKlass* klass) {
never@2000 205 // Emit guarded new
never@2000 206 // if (klass->_init_thread != current_thread ||
never@2000 207 // klass->_init_state != being_initialized)
never@2000 208 // uncommon_trap
never@2000 209 Node* cur_thread = _gvn.transform( new (C, 1) ThreadLocalNode() );
never@2000 210 Node* merge = new (C, 3) RegionNode(3);
never@2000 211 _gvn.set_type(merge, Type::CONTROL);
never@2000 212 Node* kls = makecon(TypeKlassPtr::make(klass));
never@2000 213
never@2000 214 Node* init_thread_offset = _gvn.MakeConX(instanceKlass::init_thread_offset_in_bytes() + klassOopDesc::klass_part_offset_in_bytes());
never@2000 215 Node* adr_node = basic_plus_adr(kls, kls, init_thread_offset);
never@2000 216 Node* init_thread = make_load(NULL, adr_node, TypeRawPtr::BOTTOM, T_ADDRESS);
never@2000 217 Node *tst = Bool( CmpP( init_thread, cur_thread), BoolTest::eq);
never@2000 218 IfNode* iff = create_and_map_if(control(), tst, PROB_ALWAYS, COUNT_UNKNOWN);
never@2000 219 set_control(IfTrue(iff));
never@2000 220 merge->set_req(1, IfFalse(iff));
never@2000 221
never@2000 222 Node* init_state_offset = _gvn.MakeConX(instanceKlass::init_state_offset_in_bytes() + klassOopDesc::klass_part_offset_in_bytes());
never@2000 223 adr_node = basic_plus_adr(kls, kls, init_state_offset);
never@2000 224 Node* init_state = make_load(NULL, adr_node, TypeInt::INT, T_INT);
never@2000 225 Node* being_init = _gvn.intcon(instanceKlass::being_initialized);
never@2000 226 tst = Bool( CmpI( init_state, being_init), BoolTest::eq);
never@2000 227 iff = create_and_map_if(control(), tst, PROB_ALWAYS, COUNT_UNKNOWN);
never@2000 228 set_control(IfTrue(iff));
never@2000 229 merge->set_req(2, IfFalse(iff));
never@2000 230
never@2000 231 PreserveJVMState pjvms(this);
never@2000 232 record_for_igvn(merge);
never@2000 233 set_control(merge);
never@2000 234
never@2000 235 uncommon_trap(Deoptimization::Reason_uninitialized,
never@2000 236 Deoptimization::Action_reinterpret,
never@2000 237 klass);
never@2000 238 }
never@2000 239
never@2000 240
duke@435 241 //------------------------------do_new-----------------------------------------
duke@435 242 void Parse::do_new() {
duke@435 243 kill_dead_locals();
duke@435 244
duke@435 245 bool will_link;
duke@435 246 ciInstanceKlass* klass = iter().get_klass(will_link)->as_instance_klass();
duke@435 247 assert(will_link, "_new: typeflow responsibility");
duke@435 248
duke@435 249 // Should initialize, or throw an InstantiationError?
never@2000 250 if (!klass->is_initialized() && !klass->is_being_initialized() ||
duke@435 251 klass->is_abstract() || klass->is_interface() ||
duke@435 252 klass->name() == ciSymbol::java_lang_Class() ||
duke@435 253 iter().is_unresolved_klass()) {
duke@435 254 uncommon_trap(Deoptimization::Reason_uninitialized,
duke@435 255 Deoptimization::Action_reinterpret,
duke@435 256 klass);
duke@435 257 return;
duke@435 258 }
never@2000 259 if (klass->is_being_initialized()) {
never@2000 260 emit_guard_for_new(klass);
never@2000 261 }
duke@435 262
duke@435 263 Node* kls = makecon(TypeKlassPtr::make(klass));
duke@435 264 Node* obj = new_instance(kls);
duke@435 265
duke@435 266 // Push resultant oop onto stack
duke@435 267 push(obj);
never@1515 268
never@1515 269 // Keep track of whether opportunities exist for StringBuilder
never@1515 270 // optimizations.
never@1515 271 if (OptimizeStringConcat &&
never@1515 272 (klass == C->env()->StringBuilder_klass() ||
never@1515 273 klass == C->env()->StringBuffer_klass())) {
never@1515 274 C->set_has_stringbuilder(true);
never@1515 275 }
duke@435 276 }
duke@435 277
duke@435 278 #ifndef PRODUCT
duke@435 279 //------------------------------dump_map_adr_mem-------------------------------
duke@435 280 // Debug dump of the mapping from address types to MergeMemNode indices.
duke@435 281 void Parse::dump_map_adr_mem() const {
duke@435 282 tty->print_cr("--- Mapping from address types to memory Nodes ---");
duke@435 283 MergeMemNode *mem = map() == NULL ? NULL : (map()->memory()->is_MergeMem() ?
duke@435 284 map()->memory()->as_MergeMem() : NULL);
duke@435 285 for (uint i = 0; i < (uint)C->num_alias_types(); i++) {
duke@435 286 C->alias_type(i)->print_on(tty);
duke@435 287 tty->print("\t");
duke@435 288 // Node mapping, if any
duke@435 289 if (mem && i < mem->req() && mem->in(i) && mem->in(i) != mem->empty_memory()) {
duke@435 290 mem->in(i)->dump();
duke@435 291 } else {
duke@435 292 tty->cr();
duke@435 293 }
duke@435 294 }
duke@435 295 }
duke@435 296
duke@435 297 #endif
duke@435 298
duke@435 299
duke@435 300 //=============================================================================
duke@435 301 //
duke@435 302 // parser methods for profiling
duke@435 303
duke@435 304
duke@435 305 //----------------------test_counter_against_threshold ------------------------
duke@435 306 void Parse::test_counter_against_threshold(Node* cnt, int limit) {
duke@435 307 // Test the counter against the limit and uncommon trap if greater.
duke@435 308
duke@435 309 // This code is largely copied from the range check code in
duke@435 310 // array_addressing()
duke@435 311
duke@435 312 // Test invocation count vs threshold
duke@435 313 Node *threshold = makecon(TypeInt::make(limit));
duke@435 314 Node *chk = _gvn.transform( new (C, 3) CmpUNode( cnt, threshold) );
duke@435 315 BoolTest::mask btest = BoolTest::lt;
duke@435 316 Node *tst = _gvn.transform( new (C, 2) BoolNode( chk, btest) );
duke@435 317 // Branch to failure if threshold exceeded
duke@435 318 { BuildCutout unless(this, tst, PROB_ALWAYS);
duke@435 319 uncommon_trap(Deoptimization::Reason_age,
duke@435 320 Deoptimization::Action_maybe_recompile);
duke@435 321 }
duke@435 322 }
duke@435 323
duke@435 324 //----------------------increment_and_test_invocation_counter-------------------
duke@435 325 void Parse::increment_and_test_invocation_counter(int limit) {
duke@435 326 if (!count_invocations()) return;
duke@435 327
duke@435 328 // Get the methodOop node.
duke@435 329 const TypePtr* adr_type = TypeOopPtr::make_from_constant(method());
duke@435 330 Node *methodOop_node = makecon(adr_type);
duke@435 331
duke@435 332 // Load the interpreter_invocation_counter from the methodOop.
duke@435 333 int offset = methodOopDesc::interpreter_invocation_counter_offset_in_bytes();
duke@435 334 Node* adr_node = basic_plus_adr(methodOop_node, methodOop_node, offset);
duke@435 335 Node* cnt = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type);
duke@435 336
duke@435 337 test_counter_against_threshold(cnt, limit);
duke@435 338
duke@435 339 // Add one to the counter and store
duke@435 340 Node* incr = _gvn.transform(new (C, 3) AddINode(cnt, _gvn.intcon(1)));
duke@435 341 store_to_memory( NULL, adr_node, incr, T_INT, adr_type );
duke@435 342 }
duke@435 343
duke@435 344 //----------------------------method_data_addressing---------------------------
duke@435 345 Node* Parse::method_data_addressing(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
duke@435 346 // Get offset within methodDataOop of the data array
duke@435 347 ByteSize data_offset = methodDataOopDesc::data_offset();
duke@435 348
duke@435 349 // Get cell offset of the ProfileData within data array
duke@435 350 int cell_offset = md->dp_to_di(data->dp());
duke@435 351
duke@435 352 // Add in counter_offset, the # of bytes into the ProfileData of counter or flag
duke@435 353 int offset = in_bytes(data_offset) + cell_offset + in_bytes(counter_offset);
duke@435 354
duke@435 355 const TypePtr* adr_type = TypeOopPtr::make_from_constant(md);
duke@435 356 Node* mdo = makecon(adr_type);
duke@435 357 Node* ptr = basic_plus_adr(mdo, mdo, offset);
duke@435 358
duke@435 359 if (stride != 0) {
duke@435 360 Node* str = _gvn.MakeConX(stride);
duke@435 361 Node* scale = _gvn.transform( new (C, 3) MulXNode( idx, str ) );
duke@435 362 ptr = _gvn.transform( new (C, 4) AddPNode( mdo, ptr, scale ) );
duke@435 363 }
duke@435 364
duke@435 365 return ptr;
duke@435 366 }
duke@435 367
duke@435 368 //--------------------------increment_md_counter_at----------------------------
duke@435 369 void Parse::increment_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
duke@435 370 Node* adr_node = method_data_addressing(md, data, counter_offset, idx, stride);
duke@435 371
duke@435 372 const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
duke@435 373 Node* cnt = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type);
duke@435 374 Node* incr = _gvn.transform(new (C, 3) AddINode(cnt, _gvn.intcon(DataLayout::counter_increment)));
duke@435 375 store_to_memory(NULL, adr_node, incr, T_INT, adr_type );
duke@435 376 }
duke@435 377
duke@435 378 //--------------------------test_for_osr_md_counter_at-------------------------
duke@435 379 void Parse::test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, int limit) {
duke@435 380 Node* adr_node = method_data_addressing(md, data, counter_offset);
duke@435 381
duke@435 382 const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
duke@435 383 Node* cnt = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type);
duke@435 384
duke@435 385 test_counter_against_threshold(cnt, limit);
duke@435 386 }
duke@435 387
duke@435 388 //-------------------------------set_md_flag_at--------------------------------
duke@435 389 void Parse::set_md_flag_at(ciMethodData* md, ciProfileData* data, int flag_constant) {
duke@435 390 Node* adr_node = method_data_addressing(md, data, DataLayout::flags_offset());
duke@435 391
duke@435 392 const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
duke@435 393 Node* flags = make_load(NULL, adr_node, TypeInt::BYTE, T_BYTE, adr_type);
duke@435 394 Node* incr = _gvn.transform(new (C, 3) OrINode(flags, _gvn.intcon(flag_constant)));
duke@435 395 store_to_memory(NULL, adr_node, incr, T_BYTE, adr_type);
duke@435 396 }
duke@435 397
duke@435 398 //----------------------------profile_taken_branch-----------------------------
duke@435 399 void Parse::profile_taken_branch(int target_bci, bool force_update) {
duke@435 400 // This is a potential osr_site if we have a backedge.
duke@435 401 int cur_bci = bci();
duke@435 402 bool osr_site =
duke@435 403 (target_bci <= cur_bci) && count_invocations() && UseOnStackReplacement;
duke@435 404
duke@435 405 // If we are going to OSR, restart at the target bytecode.
duke@435 406 set_bci(target_bci);
duke@435 407
duke@435 408 // To do: factor out the the limit calculations below. These duplicate
duke@435 409 // the similar limit calculations in the interpreter.
duke@435 410
duke@435 411 if (method_data_update() || force_update) {
duke@435 412 ciMethodData* md = method()->method_data();
duke@435 413 assert(md != NULL, "expected valid ciMethodData");
duke@435 414 ciProfileData* data = md->bci_to_data(cur_bci);
duke@435 415 assert(data->is_JumpData(), "need JumpData for taken branch");
duke@435 416 increment_md_counter_at(md, data, JumpData::taken_offset());
duke@435 417 }
duke@435 418
duke@435 419 // In the new tiered system this is all we need to do. In the old
duke@435 420 // (c2 based) tiered sytem we must do the code below.
duke@435 421 #ifndef TIERED
duke@435 422 if (method_data_update()) {
duke@435 423 ciMethodData* md = method()->method_data();
duke@435 424 if (osr_site) {
duke@435 425 ciProfileData* data = md->bci_to_data(cur_bci);
duke@435 426 int limit = (CompileThreshold
duke@435 427 * (OnStackReplacePercentage - InterpreterProfilePercentage)) / 100;
duke@435 428 test_for_osr_md_counter_at(md, data, JumpData::taken_offset(), limit);
duke@435 429 }
duke@435 430 } else {
duke@435 431 // With method data update off, use the invocation counter to trigger an
duke@435 432 // OSR compilation, as done in the interpreter.
duke@435 433 if (osr_site) {
duke@435 434 int limit = (CompileThreshold * OnStackReplacePercentage) / 100;
duke@435 435 increment_and_test_invocation_counter(limit);
duke@435 436 }
duke@435 437 }
duke@435 438 #endif // TIERED
duke@435 439
duke@435 440 // Restore the original bytecode.
duke@435 441 set_bci(cur_bci);
duke@435 442 }
duke@435 443
duke@435 444 //--------------------------profile_not_taken_branch---------------------------
duke@435 445 void Parse::profile_not_taken_branch(bool force_update) {
duke@435 446
duke@435 447 if (method_data_update() || force_update) {
duke@435 448 ciMethodData* md = method()->method_data();
duke@435 449 assert(md != NULL, "expected valid ciMethodData");
duke@435 450 ciProfileData* data = md->bci_to_data(bci());
duke@435 451 assert(data->is_BranchData(), "need BranchData for not taken branch");
duke@435 452 increment_md_counter_at(md, data, BranchData::not_taken_offset());
duke@435 453 }
duke@435 454
duke@435 455 }
duke@435 456
duke@435 457 //---------------------------------profile_call--------------------------------
duke@435 458 void Parse::profile_call(Node* receiver) {
duke@435 459 if (!method_data_update()) return;
duke@435 460
duke@435 461 switch (bc()) {
duke@435 462 case Bytecodes::_invokevirtual:
duke@435 463 case Bytecodes::_invokeinterface:
duke@435 464 profile_receiver_type(receiver);
duke@435 465 break;
duke@435 466 case Bytecodes::_invokestatic:
jrose@1161 467 case Bytecodes::_invokedynamic:
duke@435 468 case Bytecodes::_invokespecial:
kvn@1641 469 profile_generic_call();
duke@435 470 break;
duke@435 471 default: fatal("unexpected call bytecode");
duke@435 472 }
duke@435 473 }
duke@435 474
duke@435 475 //------------------------------profile_generic_call---------------------------
duke@435 476 void Parse::profile_generic_call() {
duke@435 477 assert(method_data_update(), "must be generating profile code");
duke@435 478
duke@435 479 ciMethodData* md = method()->method_data();
duke@435 480 assert(md != NULL, "expected valid ciMethodData");
duke@435 481 ciProfileData* data = md->bci_to_data(bci());
duke@435 482 assert(data->is_CounterData(), "need CounterData for not taken branch");
duke@435 483 increment_md_counter_at(md, data, CounterData::count_offset());
duke@435 484 }
duke@435 485
duke@435 486 //-----------------------------profile_receiver_type---------------------------
duke@435 487 void Parse::profile_receiver_type(Node* receiver) {
duke@435 488 assert(method_data_update(), "must be generating profile code");
duke@435 489
duke@435 490 ciMethodData* md = method()->method_data();
duke@435 491 assert(md != NULL, "expected valid ciMethodData");
duke@435 492 ciProfileData* data = md->bci_to_data(bci());
duke@435 493 assert(data->is_ReceiverTypeData(), "need ReceiverTypeData here");
kvn@1641 494
kvn@1641 495 // Skip if we aren't tracking receivers
kvn@1641 496 if (TypeProfileWidth < 1) {
kvn@1641 497 increment_md_counter_at(md, data, CounterData::count_offset());
kvn@1641 498 return;
kvn@1641 499 }
duke@435 500 ciReceiverTypeData* rdata = (ciReceiverTypeData*)data->as_ReceiverTypeData();
duke@435 501
duke@435 502 Node* method_data = method_data_addressing(md, rdata, in_ByteSize(0));
duke@435 503
duke@435 504 // Using an adr_type of TypePtr::BOTTOM to work around anti-dep problems.
duke@435 505 // A better solution might be to use TypeRawPtr::BOTTOM with RC_NARROW_MEM.
duke@435 506 make_runtime_call(RC_LEAF, OptoRuntime::profile_receiver_type_Type(),
duke@435 507 CAST_FROM_FN_PTR(address,
duke@435 508 OptoRuntime::profile_receiver_type_C),
duke@435 509 "profile_receiver_type_C",
duke@435 510 TypePtr::BOTTOM,
duke@435 511 method_data, receiver);
duke@435 512 }
duke@435 513
duke@435 514 //---------------------------------profile_ret---------------------------------
duke@435 515 void Parse::profile_ret(int target_bci) {
duke@435 516 if (!method_data_update()) return;
duke@435 517
duke@435 518 // Skip if we aren't tracking ret targets
duke@435 519 if (TypeProfileWidth < 1) return;
duke@435 520
duke@435 521 ciMethodData* md = method()->method_data();
duke@435 522 assert(md != NULL, "expected valid ciMethodData");
duke@435 523 ciProfileData* data = md->bci_to_data(bci());
duke@435 524 assert(data->is_RetData(), "need RetData for ret");
duke@435 525 ciRetData* ret_data = (ciRetData*)data->as_RetData();
duke@435 526
duke@435 527 // Look for the target_bci is already in the table
duke@435 528 uint row;
duke@435 529 bool table_full = true;
duke@435 530 for (row = 0; row < ret_data->row_limit(); row++) {
duke@435 531 int key = ret_data->bci(row);
duke@435 532 table_full &= (key != RetData::no_bci);
duke@435 533 if (key == target_bci) break;
duke@435 534 }
duke@435 535
duke@435 536 if (row >= ret_data->row_limit()) {
duke@435 537 // The target_bci was not found in the table.
duke@435 538 if (!table_full) {
duke@435 539 // XXX: Make slow call to update RetData
duke@435 540 }
duke@435 541 return;
duke@435 542 }
duke@435 543
duke@435 544 // the target_bci is already in the table
duke@435 545 increment_md_counter_at(md, data, RetData::bci_count_offset(row));
duke@435 546 }
duke@435 547
duke@435 548 //--------------------------profile_null_checkcast----------------------------
duke@435 549 void Parse::profile_null_checkcast() {
duke@435 550 // Set the null-seen flag, done in conjunction with the usual null check. We
duke@435 551 // never unset the flag, so this is a one-way switch.
duke@435 552 if (!method_data_update()) return;
duke@435 553
duke@435 554 ciMethodData* md = method()->method_data();
duke@435 555 assert(md != NULL, "expected valid ciMethodData");
duke@435 556 ciProfileData* data = md->bci_to_data(bci());
duke@435 557 assert(data->is_BitData(), "need BitData for checkcast");
duke@435 558 set_md_flag_at(md, data, BitData::null_seen_byte_constant());
duke@435 559 }
duke@435 560
duke@435 561 //-----------------------------profile_switch_case-----------------------------
duke@435 562 void Parse::profile_switch_case(int table_index) {
duke@435 563 if (!method_data_update()) return;
duke@435 564
duke@435 565 ciMethodData* md = method()->method_data();
duke@435 566 assert(md != NULL, "expected valid ciMethodData");
duke@435 567
duke@435 568 ciProfileData* data = md->bci_to_data(bci());
duke@435 569 assert(data->is_MultiBranchData(), "need MultiBranchData for switch case");
duke@435 570 if (table_index >= 0) {
duke@435 571 increment_md_counter_at(md, data, MultiBranchData::case_count_offset(table_index));
duke@435 572 } else {
duke@435 573 increment_md_counter_at(md, data, MultiBranchData::default_count_offset());
duke@435 574 }
duke@435 575 }

mercurial