1 /*
   2  * Copyright (c) 1998, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "ci/ciValueKlass.hpp"
  27 #include "classfile/systemDictionary.hpp"
  28 #include "compiler/compileLog.hpp"
  29 #include "oops/objArrayKlass.hpp"
  30 #include "oops/valueArrayKlass.hpp"
  31 #include "opto/addnode.hpp"
  32 #include "opto/memnode.hpp"
  33 #include "opto/mulnode.hpp"
  34 #include "opto/parse.hpp"
  35 #include "opto/rootnode.hpp"
  36 #include "opto/runtime.hpp"
  37 #include "opto/valuetypenode.hpp"
  38 #include "runtime/sharedRuntime.hpp"
  39 
  40 //------------------------------make_dtrace_method_entry_exit ----------------
  41 // Dtrace -- record entry or exit of a method if compiled with dtrace support
  42 void GraphKit::make_dtrace_method_entry_exit(ciMethod* method, bool is_entry) {
  43   const TypeFunc *call_type    = OptoRuntime::dtrace_method_entry_exit_Type();
  44   address         call_address = is_entry ? CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry) :
  45                                             CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit);
  46   const char     *call_name    = is_entry ? "dtrace_method_entry" : "dtrace_method_exit";
  47 
  48   // Get base of thread-local storage area
  49   Node* thread = _gvn.transform( new ThreadLocalNode() );
  50 
  51   // Get method
  52   const TypePtr* method_type = TypeMetadataPtr::make(method);
  53   Node *method_node = _gvn.transform(ConNode::make(method_type));
  54 
  55   kill_dead_locals();
  56 
  57   // For some reason, this call reads only raw memory.
  58   const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
  59   make_runtime_call(RC_LEAF | RC_NARROW_MEM,
  60                     call_type, call_address,
  61                     call_name, raw_adr_type,
  62                     thread, method_node);
  63 }
  64 
  65 
  66 //=============================================================================
  67 //------------------------------do_checkcast-----------------------------------
  68 void Parse::do_checkcast() {
  69   bool will_link;
  70   ciKlass* klass = iter().get_klass(will_link);
  71 
  72   Node *obj = peek();
  73 
  74   // Throw uncommon trap if class is not loaded or the value we are casting
  75   // _from_ is not loaded, and value is not null.  If the value _is_ NULL,
  76   // then the checkcast does nothing.
  77   const TypeOopPtr *tp = _gvn.type(obj)->isa_oopptr();
  78   if (!will_link || (tp && tp->klass() && !tp->klass()->is_loaded())) {
  79     if (C->log() != NULL) {
  80       if (!will_link) {
  81         C->log()->elem("assert_null reason='checkcast' klass='%d'",
  82                        C->log()->identify(klass));
  83       }
  84       if (tp && tp->klass() && !tp->klass()->is_loaded()) {
  85         // %%% Cannot happen?
  86         C->log()->elem("assert_null reason='checkcast source' klass='%d'",
  87                        C->log()->identify(tp->klass()));
  88       }
  89     }
  90     null_assert(obj);
  91     assert( stopped() || _gvn.type(peek())->higher_equal(TypePtr::NULL_PTR), "what's left behind is null" );
  92     if (!stopped()) {
  93       profile_null_checkcast();
  94     }
  95     return;
  96   }
  97 
  98   Node *res = gen_checkcast(obj, makecon(TypeKlassPtr::make(klass)) );
  99   if (stopped()) {
 100     return;
 101   }
 102 
 103   // Pop from stack AFTER gen_checkcast because it can uncommon trap and
 104   // the debug info has to be correct.
 105   pop();
 106   push(res);
 107 }
 108 
 109 
 110 //------------------------------do_instanceof----------------------------------
 111 void Parse::do_instanceof() {
 112   if (stopped())  return;
 113   // We would like to return false if class is not loaded, emitting a
 114   // dependency, but Java requires instanceof to load its operand.
 115 
 116   // Throw uncommon trap if class is not loaded
 117   bool will_link;
 118   ciKlass* klass = iter().get_klass(will_link);
 119 
 120   if (!will_link) {
 121     if (C->log() != NULL) {
 122       C->log()->elem("assert_null reason='instanceof' klass='%d'",
 123                      C->log()->identify(klass));
 124     }
 125     null_assert(peek());
 126     assert( stopped() || _gvn.type(peek())->higher_equal(TypePtr::NULL_PTR), "what's left behind is null" );
 127     if (!stopped()) {
 128       // The object is now known to be null.
 129       // Shortcut the effect of gen_instanceof and return "false" directly.
 130       pop();                   // pop the null
 131       push(_gvn.intcon(0));    // push false answer
 132     }
 133     return;
 134   }
 135 
 136   // Push the bool result back on stack
 137   Node* res = gen_instanceof(peek(), makecon(TypeKlassPtr::make(klass)), true);
 138 
 139   // Pop from stack AFTER gen_instanceof because it can uncommon trap.
 140   pop();
 141   push(res);
 142 }
 143 
 144 //------------------------------array_store_check------------------------------
 145 // pull array from stack and check that the store is valid
 146 Node* Parse::array_store_check() {
 147   // Shorthand access to array store elements without popping them.
 148   Node *obj = peek(0);
 149   Node *idx = peek(1);
 150   Node *ary = peek(2);
 151 
 152   const Type* elemtype = _gvn.type(ary)->is_aryptr()->elem();
 153   const TypeOopPtr* elemptr = elemtype->make_oopptr();
 154   bool is_value_array = elemtype->isa_valuetype() != NULL || (elemptr != NULL && elemptr->is_valuetypeptr());
 155   bool can_be_value_array = is_value_array || (elemptr != NULL && (elemptr->can_be_value_type()));
 156 
 157   if (_gvn.type(obj) == TypePtr::NULL_PTR) {
 158     // There's never a type check on null values.
 159     // This cutout lets us avoid the uncommon_trap(Reason_array_check)
 160     // below, which turns into a performance liability if the
 161     // gen_checkcast folds up completely.
 162     if (is_value_array) {
 163       // Can not store null into a value type array
 164       uncommon_trap(Deoptimization::Reason_null_check, Deoptimization::Action_none);
 165       return obj;
 166     } else if (can_be_value_array) {
 167       // Throw exception if array is a value type array
 168       gen_value_type_array_guard(ary, zerocon(T_OBJECT));
 169       return obj;
 170     }
 171     return obj;
 172   }
 173 
 174   // Extract the array klass type
 175   Node* array_klass = load_object_klass(ary);
 176   // Get the array klass
 177   const TypeKlassPtr *tak = _gvn.type(array_klass)->is_klassptr();
 178 
 179   // The type of array_klass is usually INexact array-of-oop.  Heroically
 180   // cast array_klass to EXACT array and uncommon-trap if the cast fails.
 181   // Make constant out of the inexact array klass, but use it only if the cast
 182   // succeeds.
 183   bool always_see_exact_class = false;
 184   if (MonomorphicArrayCheck
 185       && !too_many_traps(Deoptimization::Reason_array_check)
 186       && !tak->klass_is_exact()
 187       && tak != TypeKlassPtr::OBJECT) {
 188       // Regarding the fourth condition in the if-statement from above:
 189       //
 190       // If the compiler has determined that the type of array 'ary' (represented
 191       // by 'array_klass') is java/lang/Object, the compiler must not assume that
 192       // the array 'ary' is monomorphic.
 193       //
 194       // If 'ary' were of type java/lang/Object, this arraystore would have to fail,
 195       // because it is not possible to perform a arraystore into an object that is not
 196       // a "proper" array.
 197       //
 198       // Therefore, let's obtain at runtime the type of 'ary' and check if we can still
 199       // successfully perform the store.
 200       //
 201       // The implementation reasons for the condition are the following:
 202       //
 203       // java/lang/Object is the superclass of all arrays, but it is represented by the VM
 204       // as an InstanceKlass. The checks generated by gen_checkcast() (see below) expect
 205       // 'array_klass' to be ObjArrayKlass, which can result in invalid memory accesses.
 206       //
 207       // See issue JDK-8057622 for details.
 208 
 209     always_see_exact_class = true;
 210     // (If no MDO at all, hope for the best, until a trap actually occurs.)
 211 
 212     // Make a constant out of the inexact array klass
 213     const TypeKlassPtr *extak = tak->cast_to_exactness(true)->is_klassptr();
 214     Node* con = makecon(extak);
 215     Node* cmp = _gvn.transform(new CmpPNode( array_klass, con ));
 216     Node* bol = _gvn.transform(new BoolNode( cmp, BoolTest::eq ));
 217     Node* ctrl= control();
 218     { BuildCutout unless(this, bol, PROB_MAX);
 219       uncommon_trap(Deoptimization::Reason_array_check,
 220                     Deoptimization::Action_maybe_recompile,
 221                     tak->klass());
 222     }
 223     if (stopped()) {          // MUST uncommon-trap?
 224       set_control(ctrl);      // Then Don't Do It, just fall into the normal checking
 225     } else {                  // Cast array klass to exactness:
 226       // Use the exact constant value we know it is.
 227       replace_in_map(array_klass,con);
 228       CompileLog* log = C->log();
 229       if (log != NULL) {
 230         log->elem("cast_up reason='monomorphic_array' from='%d' to='(exact)'",
 231                   log->identify(tak->klass()));
 232       }
 233       array_klass = con;      // Use cast value moving forward
 234     }
 235   }
 236 
 237   // Come here for polymorphic array klasses
 238 
 239   // Extract the array element class
 240   int element_klass_offset = in_bytes(ArrayKlass::element_klass_offset());
 241 
 242   Node *p2 = basic_plus_adr(array_klass, array_klass, element_klass_offset);
 243   // We are allowed to use the constant type only if cast succeeded. If always_see_exact_class is true,
 244   // we must set a control edge from the IfTrue node created by the uncommon_trap above to the
 245   // LoadKlassNode.
 246   Node* a_e_klass = _gvn.transform(LoadKlassNode::make(_gvn, always_see_exact_class ? control() : NULL,
 247                                                        immutable_memory(), p2, tak));
 248 
 249   // Handle value type arrays
 250   if (is_value_array) {
 251     // We statically know that this is a value type array, use precise klass ptr
 252     ciValueKlass* vk = elemtype->isa_valuetype() ? elemtype->is_valuetype()->value_klass() :
 253                                                    elemptr->value_klass();
 254     a_e_klass = makecon(TypeKlassPtr::make(vk));
 255   } else if (can_be_value_array && !obj->is_ValueType() && _gvn.type(obj)->is_oopptr()->can_be_value_type()) {
 256     // We cannot statically determine if the array is a value type array
 257     // and we also don't know if 'obj' is a value type. Emit runtime checks.
 258     gen_value_type_array_guard(ary, obj, a_e_klass);
 259   }
 260 
 261   // Check (the hard way) and throw if not a subklass.
 262   return gen_checkcast(obj, a_e_klass);
 263 }
 264 
 265 
 266 void Parse::emit_guard_for_new(ciInstanceKlass* klass) {
 267   if ((!klass->is_initialized() && !klass->is_being_initialized()) ||
 268       klass->is_abstract() || klass->is_interface() ||
 269       klass->name() == ciSymbol::java_lang_Class() ||
 270       iter().is_unresolved_klass()) {
 271     uncommon_trap(Deoptimization::Reason_uninitialized,
 272                   Deoptimization::Action_reinterpret,
 273                   klass);
 274   } if (klass->is_being_initialized()) {
 275     // Emit guarded new
 276     //   if (klass->_init_thread != current_thread ||
 277     //       klass->_init_state != being_initialized)
 278     //      uncommon_trap
 279     Node* cur_thread = _gvn.transform( new ThreadLocalNode() );
 280     Node* merge = new RegionNode(3);
 281     _gvn.set_type(merge, Type::CONTROL);
 282     Node* kls = makecon(TypeKlassPtr::make(klass));
 283 
 284     Node* init_thread_offset = _gvn.MakeConX(in_bytes(InstanceKlass::init_thread_offset()));
 285     Node* adr_node = basic_plus_adr(kls, kls, init_thread_offset);
 286     Node* init_thread = make_load(NULL, adr_node, TypeRawPtr::BOTTOM, T_ADDRESS, MemNode::unordered);
 287     Node *tst   = Bool( CmpP( init_thread, cur_thread), BoolTest::eq);
 288     IfNode* iff = create_and_map_if(control(), tst, PROB_ALWAYS, COUNT_UNKNOWN);
 289     set_control(IfTrue(iff));
 290     merge->set_req(1, IfFalse(iff));
 291 
 292     Node* init_state_offset = _gvn.MakeConX(in_bytes(InstanceKlass::init_state_offset()));
 293     adr_node = basic_plus_adr(kls, kls, init_state_offset);
 294     // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler
 295     // can generate code to load it as unsigned byte.
 296     Node* init_state = make_load(NULL, adr_node, TypeInt::UBYTE, T_BOOLEAN, MemNode::unordered);
 297     Node* being_init = _gvn.intcon(InstanceKlass::being_initialized);
 298     tst   = Bool( CmpI( init_state, being_init), BoolTest::eq);
 299     iff = create_and_map_if(control(), tst, PROB_ALWAYS, COUNT_UNKNOWN);
 300     set_control(IfTrue(iff));
 301     merge->set_req(2, IfFalse(iff));
 302 
 303     PreserveJVMState pjvms(this);
 304     record_for_igvn(merge);
 305     set_control(merge);
 306 
 307     uncommon_trap(Deoptimization::Reason_uninitialized,
 308                   Deoptimization::Action_reinterpret,
 309                   klass);
 310   }
 311 }
 312 
 313 
 314 //------------------------------do_new-----------------------------------------
 315 void Parse::do_new() {
 316   kill_dead_locals();
 317 
 318   bool will_link;
 319   ciInstanceKlass* klass = iter().get_klass(will_link)->as_instance_klass();
 320   assert(will_link, "_new: typeflow responsibility");
 321 
 322   // Should initialize, or throw an InstantiationError?
 323   emit_guard_for_new(klass);
 324   if (stopped()) return;
 325 
 326   Node* kls = makecon(TypeKlassPtr::make(klass));
 327   Node* obj = new_instance(kls);
 328 
 329   // Push resultant oop onto stack
 330   push(obj);
 331 
 332   // Keep track of whether opportunities exist for StringBuilder
 333   // optimizations.
 334   if (OptimizeStringConcat &&
 335       (klass == C->env()->StringBuilder_klass() ||
 336        klass == C->env()->StringBuffer_klass())) {
 337     C->set_has_stringbuilder(true);
 338   }
 339 
 340   // Keep track of boxed values for EliminateAutoBox optimizations.
 341   if (C->eliminate_boxing() && klass->is_box_klass()) {
 342     C->set_has_boxed_value(true);
 343   }
 344 }
 345 
 346 //------------------------------do_defaultvalue---------------------------------
 347 void Parse::do_defaultvalue() {
 348   bool will_link;
 349   ciValueKlass* vk = iter().get_klass(will_link)->as_value_klass();
 350   assert(will_link, "defaultvalue: typeflow responsibility");
 351 
 352   // Should initialize, or throw an InstantiationError?
 353   emit_guard_for_new(vk);
 354   if (stopped()) return;
 355 
 356   // Create and push a new default ValueTypeNode
 357   push(ValueTypeNode::make_default(_gvn, vk));
 358 }
 359 
 360 //------------------------------do_withfield------------------------------------
 361 void Parse::do_withfield() {
 362   bool will_link;
 363   ciField* field = iter().get_field(will_link);
 364   assert(will_link, "withfield: typeflow responsibility");
 365   BasicType bt = field->layout_type();
 366   Node* val = type2size[bt] == 1 ? pop() : pop_pair();
 367   Node* vt = pop();
 368   assert(vt->is_ValueType(), "value type expected here");
 369 
 370   ValueTypeNode* new_vt = vt->clone()->as_ValueType();
 371   new_vt->set_oop(_gvn.zerocon(T_VALUETYPE));
 372   int offset = field->offset();
 373   uint i = 0;
 374   for (; i < new_vt->field_count() && new_vt->field_offset(i) != offset; i++) {}
 375   assert(i < new_vt->field_count(), "field not found");
 376   new_vt->set_field_value(i, val);
 377 
 378   push(_gvn.transform(new_vt));
 379 }
 380 
 381 #ifndef PRODUCT
 382 //------------------------------dump_map_adr_mem-------------------------------
 383 // Debug dump of the mapping from address types to MergeMemNode indices.
 384 void Parse::dump_map_adr_mem() const {
 385   tty->print_cr("--- Mapping from address types to memory Nodes ---");
 386   MergeMemNode *mem = map() == NULL ? NULL : (map()->memory()->is_MergeMem() ?
 387                                       map()->memory()->as_MergeMem() : NULL);
 388   for (uint i = 0; i < (uint)C->num_alias_types(); i++) {
 389     C->alias_type(i)->print_on(tty);
 390     tty->print("\t");
 391     // Node mapping, if any
 392     if (mem && i < mem->req() && mem->in(i) && mem->in(i) != mem->empty_memory()) {
 393       mem->in(i)->dump();
 394     } else {
 395       tty->cr();
 396     }
 397   }
 398 }
 399 
 400 #endif
 401 
 402 
 403 //=============================================================================
 404 //
 405 // parser methods for profiling
 406 
 407 
 408 //----------------------test_counter_against_threshold ------------------------
 409 void Parse::test_counter_against_threshold(Node* cnt, int limit) {
 410   // Test the counter against the limit and uncommon trap if greater.
 411 
 412   // This code is largely copied from the range check code in
 413   // array_addressing()
 414 
 415   // Test invocation count vs threshold
 416   Node *threshold = makecon(TypeInt::make(limit));
 417   Node *chk   = _gvn.transform( new CmpUNode( cnt, threshold) );
 418   BoolTest::mask btest = BoolTest::lt;
 419   Node *tst   = _gvn.transform( new BoolNode( chk, btest) );
 420   // Branch to failure if threshold exceeded
 421   { BuildCutout unless(this, tst, PROB_ALWAYS);
 422     uncommon_trap(Deoptimization::Reason_age,
 423                   Deoptimization::Action_maybe_recompile);
 424   }
 425 }
 426 
 427 //----------------------increment_and_test_invocation_counter-------------------
 428 void Parse::increment_and_test_invocation_counter(int limit) {
 429   if (!count_invocations()) return;
 430 
 431   // Get the Method* node.
 432   ciMethod* m = method();
 433   MethodCounters* counters_adr = m->ensure_method_counters();
 434   if (counters_adr == NULL) {
 435     C->record_failure("method counters allocation failed");
 436     return;
 437   }
 438 
 439   Node* ctrl = control();
 440   const TypePtr* adr_type = TypeRawPtr::make((address) counters_adr);
 441   Node *counters_node = makecon(adr_type);
 442   Node* adr_iic_node = basic_plus_adr(counters_node, counters_node,
 443     MethodCounters::interpreter_invocation_counter_offset_in_bytes());
 444   Node* cnt = make_load(ctrl, adr_iic_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
 445 
 446   test_counter_against_threshold(cnt, limit);
 447 
 448   // Add one to the counter and store
 449   Node* incr = _gvn.transform(new AddINode(cnt, _gvn.intcon(1)));
 450   store_to_memory(ctrl, adr_iic_node, incr, T_INT, adr_type, MemNode::unordered);
 451 }
 452 
 453 //----------------------------method_data_addressing---------------------------
 454 Node* Parse::method_data_addressing(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
 455   // Get offset within MethodData* of the data array
 456   ByteSize data_offset = MethodData::data_offset();
 457 
 458   // Get cell offset of the ProfileData within data array
 459   int cell_offset = md->dp_to_di(data->dp());
 460 
 461   // Add in counter_offset, the # of bytes into the ProfileData of counter or flag
 462   int offset = in_bytes(data_offset) + cell_offset + in_bytes(counter_offset);
 463 
 464   const TypePtr* adr_type = TypeMetadataPtr::make(md);
 465   Node* mdo = makecon(adr_type);
 466   Node* ptr = basic_plus_adr(mdo, mdo, offset);
 467 
 468   if (stride != 0) {
 469     Node* str = _gvn.MakeConX(stride);
 470     Node* scale = _gvn.transform( new MulXNode( idx, str ) );
 471     ptr   = _gvn.transform( new AddPNode( mdo, ptr, scale ) );
 472   }
 473 
 474   return ptr;
 475 }
 476 
 477 //--------------------------increment_md_counter_at----------------------------
 478 void Parse::increment_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
 479   Node* adr_node = method_data_addressing(md, data, counter_offset, idx, stride);
 480 
 481   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
 482   Node* cnt  = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
 483   Node* incr = _gvn.transform(new AddINode(cnt, _gvn.intcon(DataLayout::counter_increment)));
 484   store_to_memory(NULL, adr_node, incr, T_INT, adr_type, MemNode::unordered);
 485 }
 486 
 487 //--------------------------test_for_osr_md_counter_at-------------------------
 488 void Parse::test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, int limit) {
 489   Node* adr_node = method_data_addressing(md, data, counter_offset);
 490 
 491   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
 492   Node* cnt  = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
 493 
 494   test_counter_against_threshold(cnt, limit);
 495 }
 496 
 497 //-------------------------------set_md_flag_at--------------------------------
 498 void Parse::set_md_flag_at(ciMethodData* md, ciProfileData* data, int flag_constant) {
 499   Node* adr_node = method_data_addressing(md, data, DataLayout::flags_offset());
 500 
 501   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
 502   Node* flags = make_load(NULL, adr_node, TypeInt::BYTE, T_BYTE, adr_type, MemNode::unordered);
 503   Node* incr = _gvn.transform(new OrINode(flags, _gvn.intcon(flag_constant)));
 504   store_to_memory(NULL, adr_node, incr, T_BYTE, adr_type, MemNode::unordered);
 505 }
 506 
 507 //----------------------------profile_taken_branch-----------------------------
 508 void Parse::profile_taken_branch(int target_bci, bool force_update) {
 509   // This is a potential osr_site if we have a backedge.
 510   int cur_bci = bci();
 511   bool osr_site =
 512     (target_bci <= cur_bci) && count_invocations() && UseOnStackReplacement;
 513 
 514   // If we are going to OSR, restart at the target bytecode.
 515   set_bci(target_bci);
 516 
 517   // To do: factor out the the limit calculations below. These duplicate
 518   // the similar limit calculations in the interpreter.
 519 
 520   if (method_data_update() || force_update) {
 521     ciMethodData* md = method()->method_data();
 522     assert(md != NULL, "expected valid ciMethodData");
 523     ciProfileData* data = md->bci_to_data(cur_bci);
 524     assert(data != NULL && data->is_JumpData(), "need JumpData for taken branch");
 525     increment_md_counter_at(md, data, JumpData::taken_offset());
 526   }
 527 
 528   // In the new tiered system this is all we need to do. In the old
 529   // (c2 based) tiered sytem we must do the code below.
 530 #ifndef TIERED
 531   if (method_data_update()) {
 532     ciMethodData* md = method()->method_data();
 533     if (osr_site) {
 534       ciProfileData* data = md->bci_to_data(cur_bci);
 535       assert(data != NULL && data->is_JumpData(), "need JumpData for taken branch");
 536       int limit = (CompileThreshold
 537                    * (OnStackReplacePercentage - InterpreterProfilePercentage)) / 100;
 538       test_for_osr_md_counter_at(md, data, JumpData::taken_offset(), limit);
 539     }
 540   } else {
 541     // With method data update off, use the invocation counter to trigger an
 542     // OSR compilation, as done in the interpreter.
 543     if (osr_site) {
 544       int limit = (CompileThreshold * OnStackReplacePercentage) / 100;
 545       increment_and_test_invocation_counter(limit);
 546     }
 547   }
 548 #endif // TIERED
 549 
 550   // Restore the original bytecode.
 551   set_bci(cur_bci);
 552 }
 553 
 554 //--------------------------profile_not_taken_branch---------------------------
 555 void Parse::profile_not_taken_branch(bool force_update) {
 556 
 557   if (method_data_update() || force_update) {
 558     ciMethodData* md = method()->method_data();
 559     assert(md != NULL, "expected valid ciMethodData");
 560     ciProfileData* data = md->bci_to_data(bci());
 561     assert(data != NULL && data->is_BranchData(), "need BranchData for not taken branch");
 562     increment_md_counter_at(md, data, BranchData::not_taken_offset());
 563   }
 564 
 565 }
 566 
 567 //---------------------------------profile_call--------------------------------
 568 void Parse::profile_call(Node* receiver) {
 569   if (!method_data_update()) return;
 570 
 571   switch (bc()) {
 572   case Bytecodes::_invokevirtual:
 573   case Bytecodes::_invokeinterface:
 574     profile_receiver_type(receiver);
 575     break;
 576   case Bytecodes::_invokestatic:
 577   case Bytecodes::_invokedynamic:
 578   case Bytecodes::_invokespecial:
 579     profile_generic_call();
 580     break;
 581   default: fatal("unexpected call bytecode");
 582   }
 583 }
 584 
 585 //------------------------------profile_generic_call---------------------------
 586 void Parse::profile_generic_call() {
 587   assert(method_data_update(), "must be generating profile code");
 588 
 589   ciMethodData* md = method()->method_data();
 590   assert(md != NULL, "expected valid ciMethodData");
 591   ciProfileData* data = md->bci_to_data(bci());
 592   assert(data != NULL && data->is_CounterData(), "need CounterData for not taken branch");
 593   increment_md_counter_at(md, data, CounterData::count_offset());
 594 }
 595 
 596 //-----------------------------profile_receiver_type---------------------------
 597 void Parse::profile_receiver_type(Node* receiver) {
 598   assert(method_data_update(), "must be generating profile code");
 599 
 600   ciMethodData* md = method()->method_data();
 601   assert(md != NULL, "expected valid ciMethodData");
 602   ciProfileData* data = md->bci_to_data(bci());
 603   assert(data != NULL && data->is_ReceiverTypeData(), "need ReceiverTypeData here");
 604 
 605   // Skip if we aren't tracking receivers
 606   if (TypeProfileWidth < 1) {
 607     increment_md_counter_at(md, data, CounterData::count_offset());
 608     return;
 609   }
 610   ciReceiverTypeData* rdata = (ciReceiverTypeData*)data->as_ReceiverTypeData();
 611 
 612   Node* method_data = method_data_addressing(md, rdata, in_ByteSize(0));
 613 
 614   // Using an adr_type of TypePtr::BOTTOM to work around anti-dep problems.
 615   // A better solution might be to use TypeRawPtr::BOTTOM with RC_NARROW_MEM.
 616   make_runtime_call(RC_LEAF, OptoRuntime::profile_receiver_type_Type(),
 617                     CAST_FROM_FN_PTR(address,
 618                                      OptoRuntime::profile_receiver_type_C),
 619                     "profile_receiver_type_C",
 620                     TypePtr::BOTTOM,
 621                     method_data, receiver);
 622 }
 623 
 624 //---------------------------------profile_ret---------------------------------
 625 void Parse::profile_ret(int target_bci) {
 626   if (!method_data_update()) return;
 627 
 628   // Skip if we aren't tracking ret targets
 629   if (TypeProfileWidth < 1) return;
 630 
 631   ciMethodData* md = method()->method_data();
 632   assert(md != NULL, "expected valid ciMethodData");
 633   ciProfileData* data = md->bci_to_data(bci());
 634   assert(data != NULL && data->is_RetData(), "need RetData for ret");
 635   ciRetData* ret_data = (ciRetData*)data->as_RetData();
 636 
 637   // Look for the target_bci is already in the table
 638   uint row;
 639   bool table_full = true;
 640   for (row = 0; row < ret_data->row_limit(); row++) {
 641     int key = ret_data->bci(row);
 642     table_full &= (key != RetData::no_bci);
 643     if (key == target_bci) break;
 644   }
 645 
 646   if (row >= ret_data->row_limit()) {
 647     // The target_bci was not found in the table.
 648     if (!table_full) {
 649       // XXX: Make slow call to update RetData
 650     }
 651     return;
 652   }
 653 
 654   // the target_bci is already in the table
 655   increment_md_counter_at(md, data, RetData::bci_count_offset(row));
 656 }
 657 
 658 //--------------------------profile_null_checkcast----------------------------
 659 void Parse::profile_null_checkcast() {
 660   // Set the null-seen flag, done in conjunction with the usual null check. We
 661   // never unset the flag, so this is a one-way switch.
 662   if (!method_data_update()) return;
 663 
 664   ciMethodData* md = method()->method_data();
 665   assert(md != NULL, "expected valid ciMethodData");
 666   ciProfileData* data = md->bci_to_data(bci());
 667   assert(data != NULL && data->is_BitData(), "need BitData for checkcast");
 668   set_md_flag_at(md, data, BitData::null_seen_byte_constant());
 669 }
 670 
 671 //-----------------------------profile_switch_case-----------------------------
 672 void Parse::profile_switch_case(int table_index) {
 673   if (!method_data_update()) return;
 674 
 675   ciMethodData* md = method()->method_data();
 676   assert(md != NULL, "expected valid ciMethodData");
 677 
 678   ciProfileData* data = md->bci_to_data(bci());
 679   assert(data != NULL && data->is_MultiBranchData(), "need MultiBranchData for switch case");
 680   if (table_index >= 0) {
 681     increment_md_counter_at(md, data, MultiBranchData::case_count_offset(table_index));
 682   } else {
 683     increment_md_counter_at(md, data, MultiBranchData::default_count_offset());
 684   }
 685 }