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 TypeAryPtr* ary_t = _gvn.type(ary)->is_aryptr();
 153   const Type* elemtype = ary_t->elem();
 154   const TypeOopPtr* elemptr = elemtype->make_oopptr();
 155   bool is_value_array = elemtype->isa_valuetype() != NULL || (elemptr != NULL && elemptr->is_valuetypeptr());
 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     return obj;
 163   }
 164 
 165   // Extract the array klass type
 166   Node* array_klass = load_object_klass(ary);
 167   // Get the array klass
 168   const TypeKlassPtr *tak = _gvn.type(array_klass)->is_klassptr();
 169 
 170   // The type of array_klass is usually INexact array-of-oop.  Heroically
 171   // cast array_klass to EXACT array and uncommon-trap if the cast fails.
 172   // Make constant out of the inexact array klass, but use it only if the cast
 173   // succeeds.
 174   bool always_see_exact_class = false;
 175   if (MonomorphicArrayCheck
 176       && !too_many_traps(Deoptimization::Reason_array_check)
 177       && !tak->klass_is_exact()
 178       && tak != TypeKlassPtr::OBJECT) {
 179       // Regarding the fourth condition in the if-statement from above:
 180       //
 181       // If the compiler has determined that the type of array 'ary' (represented
 182       // by 'array_klass') is java/lang/Object, the compiler must not assume that
 183       // the array 'ary' is monomorphic.
 184       //
 185       // If 'ary' were of type java/lang/Object, this arraystore would have to fail,
 186       // because it is not possible to perform a arraystore into an object that is not
 187       // a "proper" array.
 188       //
 189       // Therefore, let's obtain at runtime the type of 'ary' and check if we can still
 190       // successfully perform the store.
 191       //
 192       // The implementation reasons for the condition are the following:
 193       //
 194       // java/lang/Object is the superclass of all arrays, but it is represented by the VM
 195       // as an InstanceKlass. The checks generated by gen_checkcast() (see below) expect
 196       // 'array_klass' to be ObjArrayKlass, which can result in invalid memory accesses.
 197       //
 198       // See issue JDK-8057622 for details.
 199 
 200     always_see_exact_class = true;
 201     // (If no MDO at all, hope for the best, until a trap actually occurs.)
 202 
 203     // Make a constant out of the inexact array klass
 204     const TypeKlassPtr *extak = tak->cast_to_exactness(true)->is_klassptr();
 205     Node* con = makecon(extak);
 206     Node* cmp = _gvn.transform(new CmpPNode( array_klass, con ));
 207     Node* bol = _gvn.transform(new BoolNode( cmp, BoolTest::eq ));
 208     Node* ctrl= control();
 209     { BuildCutout unless(this, bol, PROB_MAX);
 210       uncommon_trap(Deoptimization::Reason_array_check,
 211                     Deoptimization::Action_maybe_recompile,
 212                     tak->klass());
 213     }
 214     if (stopped()) {          // MUST uncommon-trap?
 215       set_control(ctrl);      // Then Don't Do It, just fall into the normal checking
 216     } else {                  // Cast array klass to exactness:
 217       // Use the exact constant value we know it is.
 218       replace_in_map(array_klass,con);
 219       CompileLog* log = C->log();
 220       if (log != NULL) {
 221         log->elem("cast_up reason='monomorphic_array' from='%d' to='(exact)'",
 222                   log->identify(tak->klass()));
 223       }
 224       array_klass = con;      // Use cast value moving forward
 225     }
 226   }
 227 
 228   // Come here for polymorphic array klasses
 229 
 230   // Extract the array element class
 231   int element_klass_offset = in_bytes(ArrayKlass::element_klass_offset());
 232 
 233   Node *p2 = basic_plus_adr(array_klass, array_klass, element_klass_offset);
 234   // We are allowed to use the constant type only if cast succeeded. If always_see_exact_class is true,
 235   // we must set a control edge from the IfTrue node created by the uncommon_trap above to the
 236   // LoadKlassNode.
 237   Node* a_e_klass = _gvn.transform(LoadKlassNode::make(_gvn, always_see_exact_class ? control() : NULL,
 238                                                        immutable_memory(), p2, tak));
 239 
 240   // Handle value type arrays
 241   if (is_value_array) {
 242     // We statically know that this is a value type array, use precise klass ptr
 243     ciValueKlass* vk = elemtype->isa_valuetype() ? elemtype->is_valuetype()->value_klass() :
 244                                                    elemptr->value_klass();
 245     a_e_klass = makecon(TypeKlassPtr::make(vk));
 246   }
 247 
 248   // Check (the hard way) and throw if not a subklass.
 249   return gen_checkcast(obj, a_e_klass);
 250 }
 251 
 252 
 253 void Parse::emit_guard_for_new(ciInstanceKlass* klass) {
 254   if ((!klass->is_initialized() && !klass->is_being_initialized()) ||
 255       klass->is_abstract() || klass->is_interface() ||
 256       klass->name() == ciSymbol::java_lang_Class() ||
 257       iter().is_unresolved_klass()) {
 258     uncommon_trap(Deoptimization::Reason_uninitialized,
 259                   Deoptimization::Action_reinterpret,
 260                   klass);
 261   } if (klass->is_being_initialized()) {
 262     // Emit guarded new
 263     //   if (klass->_init_thread != current_thread ||
 264     //       klass->_init_state != being_initialized)
 265     //      uncommon_trap
 266     Node* cur_thread = _gvn.transform( new ThreadLocalNode() );
 267     Node* merge = new RegionNode(3);
 268     _gvn.set_type(merge, Type::CONTROL);
 269     Node* kls = makecon(TypeKlassPtr::make(klass));
 270 
 271     Node* init_thread_offset = _gvn.MakeConX(in_bytes(InstanceKlass::init_thread_offset()));
 272     Node* adr_node = basic_plus_adr(kls, kls, init_thread_offset);
 273     Node* init_thread = make_load(NULL, adr_node, TypeRawPtr::BOTTOM, T_ADDRESS, MemNode::unordered);
 274     Node *tst   = Bool( CmpP( init_thread, cur_thread), BoolTest::eq);
 275     IfNode* iff = create_and_map_if(control(), tst, PROB_ALWAYS, COUNT_UNKNOWN);
 276     set_control(IfTrue(iff));
 277     merge->set_req(1, IfFalse(iff));
 278 
 279     Node* init_state_offset = _gvn.MakeConX(in_bytes(InstanceKlass::init_state_offset()));
 280     adr_node = basic_plus_adr(kls, kls, init_state_offset);
 281     // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler
 282     // can generate code to load it as unsigned byte.
 283     Node* init_state = make_load(NULL, adr_node, TypeInt::UBYTE, T_BOOLEAN, MemNode::unordered);
 284     Node* being_init = _gvn.intcon(InstanceKlass::being_initialized);
 285     tst   = Bool( CmpI( init_state, being_init), BoolTest::eq);
 286     iff = create_and_map_if(control(), tst, PROB_ALWAYS, COUNT_UNKNOWN);
 287     set_control(IfTrue(iff));
 288     merge->set_req(2, IfFalse(iff));
 289 
 290     PreserveJVMState pjvms(this);
 291     record_for_igvn(merge);
 292     set_control(merge);
 293 
 294     uncommon_trap(Deoptimization::Reason_uninitialized,
 295                   Deoptimization::Action_reinterpret,
 296                   klass);
 297   }
 298 }
 299 
 300 
 301 //------------------------------do_new-----------------------------------------
 302 void Parse::do_new() {
 303   kill_dead_locals();
 304 
 305   bool will_link;
 306   ciInstanceKlass* klass = iter().get_klass(will_link)->as_instance_klass();
 307   assert(will_link, "_new: typeflow responsibility");
 308 
 309   // Should initialize, or throw an InstantiationError?
 310   emit_guard_for_new(klass);
 311   if (stopped()) return;
 312 
 313   Node* kls = makecon(TypeKlassPtr::make(klass));
 314   Node* obj = new_instance(kls);
 315 
 316   // Push resultant oop onto stack
 317   push(obj);
 318 
 319   // Keep track of whether opportunities exist for StringBuilder
 320   // optimizations.
 321   if (OptimizeStringConcat &&
 322       (klass == C->env()->StringBuilder_klass() ||
 323        klass == C->env()->StringBuffer_klass())) {
 324     C->set_has_stringbuilder(true);
 325   }
 326 
 327   // Keep track of boxed values for EliminateAutoBox optimizations.
 328   if (C->eliminate_boxing() && klass->is_box_klass()) {
 329     C->set_has_boxed_value(true);
 330   }
 331 }
 332 
 333 //------------------------------do_defaultvalue---------------------------------
 334 void Parse::do_defaultvalue() {
 335   bool will_link;
 336   ciValueKlass* vk = iter().get_klass(will_link)->as_value_klass();
 337   assert(will_link, "defaultvalue: typeflow responsibility");
 338 
 339   // Should initialize, or throw an InstantiationError?
 340   emit_guard_for_new(vk);
 341   if (stopped()) return;
 342 
 343   // Always scalarize default value because it's not NULL by definition
 344   push(ValueTypeNode::make_default(_gvn, vk));
 345 }
 346 
 347 //------------------------------do_withfield------------------------------------
 348 void Parse::do_withfield() {
 349   bool will_link;
 350   ciField* field = iter().get_field(will_link);
 351   assert(will_link, "withfield: typeflow responsibility");
 352   BasicType bt = field->layout_type();
 353   Node* val = type2size[bt] == 1 ? pop() : pop_pair();
 354   ciValueKlass* holder_klass = field->holder()->as_value_klass();
 355   Node* holder = pop();
 356 
 357   if (!holder->is_ValueType()) {
 358     assert(!gvn().type(holder)->maybe_null(), "should never be null");
 359     inc_sp(2);
 360     holder = ValueTypeNode::make_from_oop(this, holder, holder_klass);
 361     if (field->is_flattenable() && !val->is_ValueType() && gvn().type(val)->maybe_null()) {
 362       assert(val->bottom_type()->remove_speculative() == TypePtr::NULL_PTR, "Anything other than null?");
 363       uncommon_trap(Deoptimization::Reason_null_check, Deoptimization::Action_none);
 364       return;
 365     }
 366     dec_sp(2);
 367   }
 368 
 369   // Clone the value type node and set the new field value
 370   ValueTypeNode* new_vt = holder->clone()->as_ValueType();
 371   new_vt->set_oop(_gvn.zerocon(T_VALUETYPE));
 372   gvn().set_type(new_vt, new_vt->bottom_type());
 373   new_vt->set_field_value_by_offset(field->offset(), val);
 374 
 375   if (holder_klass->is_scalarizable()) {
 376     push(_gvn.transform(new_vt));
 377   } else {
 378     push(new_vt->allocate(this)->get_oop());
 379   }
 380 }
 381 
 382 #ifndef PRODUCT
 383 //------------------------------dump_map_adr_mem-------------------------------
 384 // Debug dump of the mapping from address types to MergeMemNode indices.
 385 void Parse::dump_map_adr_mem() const {
 386   tty->print_cr("--- Mapping from address types to memory Nodes ---");
 387   MergeMemNode *mem = map() == NULL ? NULL : (map()->memory()->is_MergeMem() ?
 388                                       map()->memory()->as_MergeMem() : NULL);
 389   for (uint i = 0; i < (uint)C->num_alias_types(); i++) {
 390     C->alias_type(i)->print_on(tty);
 391     tty->print("\t");
 392     // Node mapping, if any
 393     if (mem && i < mem->req() && mem->in(i) && mem->in(i) != mem->empty_memory()) {
 394       mem->in(i)->dump();
 395     } else {
 396       tty->cr();
 397     }
 398   }
 399 }
 400 
 401 #endif
 402 
 403 
 404 //=============================================================================
 405 //
 406 // parser methods for profiling
 407 
 408 
 409 //----------------------test_counter_against_threshold ------------------------
 410 void Parse::test_counter_against_threshold(Node* cnt, int limit) {
 411   // Test the counter against the limit and uncommon trap if greater.
 412 
 413   // This code is largely copied from the range check code in
 414   // array_addressing()
 415 
 416   // Test invocation count vs threshold
 417   Node *threshold = makecon(TypeInt::make(limit));
 418   Node *chk   = _gvn.transform( new CmpUNode( cnt, threshold) );
 419   BoolTest::mask btest = BoolTest::lt;
 420   Node *tst   = _gvn.transform( new BoolNode( chk, btest) );
 421   // Branch to failure if threshold exceeded
 422   { BuildCutout unless(this, tst, PROB_ALWAYS);
 423     uncommon_trap(Deoptimization::Reason_age,
 424                   Deoptimization::Action_maybe_recompile);
 425   }
 426 }
 427 
 428 //----------------------increment_and_test_invocation_counter-------------------
 429 void Parse::increment_and_test_invocation_counter(int limit) {
 430   if (!count_invocations()) return;
 431 
 432   // Get the Method* node.
 433   ciMethod* m = method();
 434   MethodCounters* counters_adr = m->ensure_method_counters();
 435   if (counters_adr == NULL) {
 436     C->record_failure("method counters allocation failed");
 437     return;
 438   }
 439 
 440   Node* ctrl = control();
 441   const TypePtr* adr_type = TypeRawPtr::make((address) counters_adr);
 442   Node *counters_node = makecon(adr_type);
 443   Node* adr_iic_node = basic_plus_adr(counters_node, counters_node,
 444     MethodCounters::interpreter_invocation_counter_offset_in_bytes());
 445   Node* cnt = make_load(ctrl, adr_iic_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
 446 
 447   test_counter_against_threshold(cnt, limit);
 448 
 449   // Add one to the counter and store
 450   Node* incr = _gvn.transform(new AddINode(cnt, _gvn.intcon(1)));
 451   store_to_memory(ctrl, adr_iic_node, incr, T_INT, adr_type, MemNode::unordered);
 452 }
 453 
 454 //----------------------------method_data_addressing---------------------------
 455 Node* Parse::method_data_addressing(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
 456   // Get offset within MethodData* of the data array
 457   ByteSize data_offset = MethodData::data_offset();
 458 
 459   // Get cell offset of the ProfileData within data array
 460   int cell_offset = md->dp_to_di(data->dp());
 461 
 462   // Add in counter_offset, the # of bytes into the ProfileData of counter or flag
 463   int offset = in_bytes(data_offset) + cell_offset + in_bytes(counter_offset);
 464 
 465   const TypePtr* adr_type = TypeMetadataPtr::make(md);
 466   Node* mdo = makecon(adr_type);
 467   Node* ptr = basic_plus_adr(mdo, mdo, offset);
 468 
 469   if (stride != 0) {
 470     Node* str = _gvn.MakeConX(stride);
 471     Node* scale = _gvn.transform( new MulXNode( idx, str ) );
 472     ptr   = _gvn.transform( new AddPNode( mdo, ptr, scale ) );
 473   }
 474 
 475   return ptr;
 476 }
 477 
 478 //--------------------------increment_md_counter_at----------------------------
 479 void Parse::increment_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
 480   Node* adr_node = method_data_addressing(md, data, counter_offset, idx, stride);
 481 
 482   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
 483   Node* cnt  = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
 484   Node* incr = _gvn.transform(new AddINode(cnt, _gvn.intcon(DataLayout::counter_increment)));
 485   store_to_memory(NULL, adr_node, incr, T_INT, adr_type, MemNode::unordered);
 486 }
 487 
 488 //--------------------------test_for_osr_md_counter_at-------------------------
 489 void Parse::test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, int limit) {
 490   Node* adr_node = method_data_addressing(md, data, counter_offset);
 491 
 492   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
 493   Node* cnt  = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
 494 
 495   test_counter_against_threshold(cnt, limit);
 496 }
 497 
 498 //-------------------------------set_md_flag_at--------------------------------
 499 void Parse::set_md_flag_at(ciMethodData* md, ciProfileData* data, int flag_constant) {
 500   Node* adr_node = method_data_addressing(md, data, DataLayout::flags_offset());
 501 
 502   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
 503   Node* flags = make_load(NULL, adr_node, TypeInt::BYTE, T_BYTE, adr_type, MemNode::unordered);
 504   Node* incr = _gvn.transform(new OrINode(flags, _gvn.intcon(flag_constant)));
 505   store_to_memory(NULL, adr_node, incr, T_BYTE, adr_type, MemNode::unordered);
 506 }
 507 
 508 //----------------------------profile_taken_branch-----------------------------
 509 void Parse::profile_taken_branch(int target_bci, bool force_update) {
 510   // This is a potential osr_site if we have a backedge.
 511   int cur_bci = bci();
 512   bool osr_site =
 513     (target_bci <= cur_bci) && count_invocations() && UseOnStackReplacement;
 514 
 515   // If we are going to OSR, restart at the target bytecode.
 516   set_bci(target_bci);
 517 
 518   // To do: factor out the the limit calculations below. These duplicate
 519   // the similar limit calculations in the interpreter.
 520 
 521   if (method_data_update() || force_update) {
 522     ciMethodData* md = method()->method_data();
 523     assert(md != NULL, "expected valid ciMethodData");
 524     ciProfileData* data = md->bci_to_data(cur_bci);
 525     assert(data != NULL && data->is_JumpData(), "need JumpData for taken branch");
 526     increment_md_counter_at(md, data, JumpData::taken_offset());
 527   }
 528 
 529   // In the new tiered system this is all we need to do. In the old
 530   // (c2 based) tiered sytem we must do the code below.
 531 #ifndef TIERED
 532   if (method_data_update()) {
 533     ciMethodData* md = method()->method_data();
 534     if (osr_site) {
 535       ciProfileData* data = md->bci_to_data(cur_bci);
 536       assert(data != NULL && data->is_JumpData(), "need JumpData for taken branch");
 537       int limit = (CompileThreshold
 538                    * (OnStackReplacePercentage - InterpreterProfilePercentage)) / 100;
 539       test_for_osr_md_counter_at(md, data, JumpData::taken_offset(), limit);
 540     }
 541   } else {
 542     // With method data update off, use the invocation counter to trigger an
 543     // OSR compilation, as done in the interpreter.
 544     if (osr_site) {
 545       int limit = (CompileThreshold * OnStackReplacePercentage) / 100;
 546       increment_and_test_invocation_counter(limit);
 547     }
 548   }
 549 #endif // TIERED
 550 
 551   // Restore the original bytecode.
 552   set_bci(cur_bci);
 553 }
 554 
 555 //--------------------------profile_not_taken_branch---------------------------
 556 void Parse::profile_not_taken_branch(bool force_update) {
 557 
 558   if (method_data_update() || force_update) {
 559     ciMethodData* md = method()->method_data();
 560     assert(md != NULL, "expected valid ciMethodData");
 561     ciProfileData* data = md->bci_to_data(bci());
 562     assert(data != NULL && data->is_BranchData(), "need BranchData for not taken branch");
 563     increment_md_counter_at(md, data, BranchData::not_taken_offset());
 564   }
 565 
 566 }
 567 
 568 //---------------------------------profile_call--------------------------------
 569 void Parse::profile_call(Node* receiver) {
 570   if (!method_data_update()) return;
 571 
 572   switch (bc()) {
 573   case Bytecodes::_invokevirtual:
 574   case Bytecodes::_invokeinterface:
 575     profile_receiver_type(receiver);
 576     break;
 577   case Bytecodes::_invokestatic:
 578   case Bytecodes::_invokedynamic:
 579   case Bytecodes::_invokespecial:
 580     profile_generic_call();
 581     break;
 582   default: fatal("unexpected call bytecode");
 583   }
 584 }
 585 
 586 //------------------------------profile_generic_call---------------------------
 587 void Parse::profile_generic_call() {
 588   assert(method_data_update(), "must be generating profile code");
 589 
 590   ciMethodData* md = method()->method_data();
 591   assert(md != NULL, "expected valid ciMethodData");
 592   ciProfileData* data = md->bci_to_data(bci());
 593   assert(data != NULL && data->is_CounterData(), "need CounterData for not taken branch");
 594   increment_md_counter_at(md, data, CounterData::count_offset());
 595 }
 596 
 597 //-----------------------------profile_receiver_type---------------------------
 598 void Parse::profile_receiver_type(Node* receiver) {
 599   assert(method_data_update(), "must be generating profile code");
 600 
 601   ciMethodData* md = method()->method_data();
 602   assert(md != NULL, "expected valid ciMethodData");
 603   ciProfileData* data = md->bci_to_data(bci());
 604   assert(data != NULL && data->is_ReceiverTypeData(), "need ReceiverTypeData here");
 605 
 606   // Skip if we aren't tracking receivers
 607   if (TypeProfileWidth < 1) {
 608     increment_md_counter_at(md, data, CounterData::count_offset());
 609     return;
 610   }
 611   ciReceiverTypeData* rdata = (ciReceiverTypeData*)data->as_ReceiverTypeData();
 612 
 613   Node* method_data = method_data_addressing(md, rdata, in_ByteSize(0));
 614 
 615   // Using an adr_type of TypePtr::BOTTOM to work around anti-dep problems.
 616   // A better solution might be to use TypeRawPtr::BOTTOM with RC_NARROW_MEM.
 617   make_runtime_call(RC_LEAF, OptoRuntime::profile_receiver_type_Type(),
 618                     CAST_FROM_FN_PTR(address,
 619                                      OptoRuntime::profile_receiver_type_C),
 620                     "profile_receiver_type_C",
 621                     TypePtr::BOTTOM,
 622                     method_data, receiver);
 623 }
 624 
 625 //---------------------------------profile_ret---------------------------------
 626 void Parse::profile_ret(int target_bci) {
 627   if (!method_data_update()) return;
 628 
 629   // Skip if we aren't tracking ret targets
 630   if (TypeProfileWidth < 1) return;
 631 
 632   ciMethodData* md = method()->method_data();
 633   assert(md != NULL, "expected valid ciMethodData");
 634   ciProfileData* data = md->bci_to_data(bci());
 635   assert(data != NULL && data->is_RetData(), "need RetData for ret");
 636   ciRetData* ret_data = (ciRetData*)data->as_RetData();
 637 
 638   // Look for the target_bci is already in the table
 639   uint row;
 640   bool table_full = true;
 641   for (row = 0; row < ret_data->row_limit(); row++) {
 642     int key = ret_data->bci(row);
 643     table_full &= (key != RetData::no_bci);
 644     if (key == target_bci) break;
 645   }
 646 
 647   if (row >= ret_data->row_limit()) {
 648     // The target_bci was not found in the table.
 649     if (!table_full) {
 650       // XXX: Make slow call to update RetData
 651     }
 652     return;
 653   }
 654 
 655   // the target_bci is already in the table
 656   increment_md_counter_at(md, data, RetData::bci_count_offset(row));
 657 }
 658 
 659 //--------------------------profile_null_checkcast----------------------------
 660 void Parse::profile_null_checkcast() {
 661   // Set the null-seen flag, done in conjunction with the usual null check. We
 662   // never unset the flag, so this is a one-way switch.
 663   if (!method_data_update()) return;
 664 
 665   ciMethodData* md = method()->method_data();
 666   assert(md != NULL, "expected valid ciMethodData");
 667   ciProfileData* data = md->bci_to_data(bci());
 668   assert(data != NULL && data->is_BitData(), "need BitData for checkcast");
 669   set_md_flag_at(md, data, BitData::null_seen_byte_constant());
 670 }
 671 
 672 //-----------------------------profile_switch_case-----------------------------
 673 void Parse::profile_switch_case(int table_index) {
 674   if (!method_data_update()) return;
 675 
 676   ciMethodData* md = method()->method_data();
 677   assert(md != NULL, "expected valid ciMethodData");
 678 
 679   ciProfileData* data = md->bci_to_data(bci());
 680   assert(data != NULL && data->is_MultiBranchData(), "need MultiBranchData for switch case");
 681   if (table_index >= 0) {
 682     increment_md_counter_at(md, data, MultiBranchData::case_count_offset(table_index));
 683   } else {
 684     increment_md_counter_at(md, data, MultiBranchData::default_count_offset());
 685   }
 686 }