duke@435: /*
duke@435:  * Copyright 1998-2007 Sun Microsystems, Inc.  All Rights Reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
duke@435:  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435:  * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435:  * have any questions.
duke@435:  *
duke@435:  */
duke@435: 
duke@435: #include "incls/_precompiled.incl"
duke@435: #include "incls/_parseHelper.cpp.incl"
duke@435: 
duke@435: //------------------------------make_dtrace_method_entry_exit ----------------
duke@435: // Dtrace -- record entry or exit of a method if compiled with dtrace support
duke@435: void GraphKit::make_dtrace_method_entry_exit(ciMethod* method, bool is_entry) {
duke@435:   const TypeFunc *call_type    = OptoRuntime::dtrace_method_entry_exit_Type();
duke@435:   address         call_address = is_entry ? CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry) :
duke@435:                                             CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit);
duke@435:   const char     *call_name    = is_entry ? "dtrace_method_entry" : "dtrace_method_exit";
duke@435: 
duke@435:   // Get base of thread-local storage area
duke@435:   Node* thread = _gvn.transform( new (C, 1) ThreadLocalNode() );
duke@435: 
duke@435:   // Get method
duke@435:   const TypeInstPtr* method_type = TypeInstPtr::make(TypePtr::Constant, method->klass(), true, method, 0);
duke@435:   Node *method_node = _gvn.transform( new (C, 1) ConPNode(method_type) );
duke@435: 
duke@435:   kill_dead_locals();
duke@435: 
duke@435:   // For some reason, this call reads only raw memory.
duke@435:   const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
duke@435:   make_runtime_call(RC_LEAF | RC_NARROW_MEM,
duke@435:                     call_type, call_address,
duke@435:                     call_name, raw_adr_type,
duke@435:                     thread, method_node);
duke@435: }
duke@435: 
duke@435: 
duke@435: //=============================================================================
duke@435: //------------------------------do_checkcast-----------------------------------
duke@435: void Parse::do_checkcast() {
duke@435:   bool will_link;
duke@435:   ciKlass* klass = iter().get_klass(will_link);
duke@435: 
duke@435:   Node *obj = peek();
duke@435: 
duke@435:   // Throw uncommon trap if class is not loaded or the value we are casting
duke@435:   // _from_ is not loaded, and value is not null.  If the value _is_ NULL,
duke@435:   // then the checkcast does nothing.
duke@435:   const TypeInstPtr *tp = _gvn.type(obj)->isa_instptr();
duke@435:   if (!will_link || (tp && !tp->is_loaded())) {
duke@435:     if (C->log() != NULL) {
duke@435:       if (!will_link) {
duke@435:         C->log()->elem("assert_null reason='checkcast' klass='%d'",
duke@435:                        C->log()->identify(klass));
duke@435:       }
duke@435:       if (tp && !tp->is_loaded()) {
duke@435:         // %%% Cannot happen?
duke@435:         C->log()->elem("assert_null reason='checkcast source' klass='%d'",
duke@435:                        C->log()->identify(tp->klass()));
duke@435:       }
duke@435:     }
duke@435:     do_null_assert(obj, T_OBJECT);
duke@435:     assert( stopped() || _gvn.type(peek())->higher_equal(TypePtr::NULL_PTR), "what's left behind is null" );
duke@435:     if (!stopped()) {
duke@435:       profile_null_checkcast();
duke@435:     }
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   Node *res = gen_checkcast(obj, makecon(TypeKlassPtr::make(klass)) );
duke@435: 
duke@435:   // Pop from stack AFTER gen_checkcast because it can uncommon trap and
duke@435:   // the debug info has to be correct.
duke@435:   pop();
duke@435:   push(res);
duke@435: }
duke@435: 
duke@435: 
duke@435: //------------------------------do_instanceof----------------------------------
duke@435: void Parse::do_instanceof() {
duke@435:   if (stopped())  return;
duke@435:   // We would like to return false if class is not loaded, emitting a
duke@435:   // dependency, but Java requires instanceof to load its operand.
duke@435: 
duke@435:   // Throw uncommon trap if class is not loaded
duke@435:   bool will_link;
duke@435:   ciKlass* klass = iter().get_klass(will_link);
duke@435: 
duke@435:   if (!will_link) {
duke@435:     if (C->log() != NULL) {
duke@435:       C->log()->elem("assert_null reason='instanceof' klass='%d'",
duke@435:                      C->log()->identify(klass));
duke@435:     }
duke@435:     do_null_assert(peek(), T_OBJECT);
duke@435:     assert( stopped() || _gvn.type(peek())->higher_equal(TypePtr::NULL_PTR), "what's left behind is null" );
duke@435:     if (!stopped()) {
duke@435:       // The object is now known to be null.
duke@435:       // Shortcut the effect of gen_instanceof and return "false" directly.
duke@435:       pop();                   // pop the null
duke@435:       push(_gvn.intcon(0));    // push false answer
duke@435:     }
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   // Push the bool result back on stack
duke@435:   push( gen_instanceof( pop(), makecon(TypeKlassPtr::make(klass)) ) );
duke@435: }
duke@435: 
duke@435: //------------------------------array_store_check------------------------------
duke@435: // pull array from stack and check that the store is valid
duke@435: void Parse::array_store_check() {
duke@435: 
duke@435:   // Shorthand access to array store elements
duke@435:   Node *obj = stack(_sp-1);
duke@435:   Node *idx = stack(_sp-2);
duke@435:   Node *ary = stack(_sp-3);
duke@435: 
duke@435:   if (_gvn.type(obj) == TypePtr::NULL_PTR) {
duke@435:     // There's never a type check on null values.
duke@435:     // This cutout lets us avoid the uncommon_trap(Reason_array_check)
duke@435:     // below, which turns into a performance liability if the
duke@435:     // gen_checkcast folds up completely.
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   // Extract the array klass type
duke@435:   int klass_offset = oopDesc::klass_offset_in_bytes();
duke@435:   Node* p = basic_plus_adr( ary, ary, klass_offset );
duke@435:   // p's type is array-of-OOPS plus klass_offset
duke@435:   Node* array_klass = _gvn.transform(new (C, 3) LoadKlassNode(0, immutable_memory(), p, TypeInstPtr::KLASS));
duke@435:   // Get the array klass
duke@435:   const TypeKlassPtr *tak = _gvn.type(array_klass)->is_klassptr();
duke@435: 
duke@435:   // array_klass's type is generally INexact array-of-oop.  Heroically
duke@435:   // cast the array klass to EXACT array and uncommon-trap if the cast
duke@435:   // fails.
duke@435:   bool always_see_exact_class = false;
duke@435:   if (MonomorphicArrayCheck
duke@435:       && !too_many_traps(Deoptimization::Reason_array_check)) {
duke@435:     always_see_exact_class = true;
duke@435:     // (If no MDO at all, hope for the best, until a trap actually occurs.)
duke@435:   }
duke@435: 
duke@435:   // Is the array klass is exactly its defined type?
duke@435:   if (always_see_exact_class && !tak->klass_is_exact()) {
duke@435:     // Make a constant out of the inexact array klass
duke@435:     const TypeKlassPtr *extak = tak->cast_to_exactness(true)->is_klassptr();
duke@435:     Node* con = makecon(extak);
duke@435:     Node* cmp = _gvn.transform(new (C, 3) CmpPNode( array_klass, con ));
duke@435:     Node* bol = _gvn.transform(new (C, 2) BoolNode( cmp, BoolTest::eq ));
duke@435:     Node* ctrl= control();
duke@435:     { BuildCutout unless(this, bol, PROB_MAX);
duke@435:       uncommon_trap(Deoptimization::Reason_array_check,
duke@435:                     Deoptimization::Action_maybe_recompile,
duke@435:                     tak->klass());
duke@435:     }
duke@435:     if (stopped()) {          // MUST uncommon-trap?
duke@435:       set_control(ctrl);      // Then Don't Do It, just fall into the normal checking
duke@435:     } else {                  // Cast array klass to exactness:
duke@435:       // Use the exact constant value we know it is.
duke@435:       replace_in_map(array_klass,con);
duke@435:       CompileLog* log = C->log();
duke@435:       if (log != NULL) {
duke@435:         log->elem("cast_up reason='monomorphic_array' from='%d' to='(exact)'",
duke@435:                   log->identify(tak->klass()));
duke@435:       }
duke@435:       array_klass = con;      // Use cast value moving forward
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   // Come here for polymorphic array klasses
duke@435: 
duke@435:   // Extract the array element class
duke@435:   int element_klass_offset = objArrayKlass::element_klass_offset_in_bytes() + sizeof(oopDesc);
duke@435:   Node *p2 = basic_plus_adr(array_klass, array_klass, element_klass_offset);
duke@435:   Node *a_e_klass = _gvn.transform(new (C, 3) LoadKlassNode(0, immutable_memory(), p2, tak));
duke@435: 
duke@435:   // Check (the hard way) and throw if not a subklass.
duke@435:   // Result is ignored, we just need the CFG effects.
duke@435:   gen_checkcast( obj, a_e_klass );
duke@435: }
duke@435: 
duke@435: 
duke@435: //------------------------------do_new-----------------------------------------
duke@435: void Parse::do_new() {
duke@435:   kill_dead_locals();
duke@435: 
duke@435:   bool will_link;
duke@435:   ciInstanceKlass* klass = iter().get_klass(will_link)->as_instance_klass();
duke@435:   assert(will_link, "_new: typeflow responsibility");
duke@435: 
duke@435:   // Should initialize, or throw an InstantiationError?
duke@435:   if (!klass->is_initialized() ||
duke@435:       klass->is_abstract() || klass->is_interface() ||
duke@435:       klass->name() == ciSymbol::java_lang_Class() ||
duke@435:       iter().is_unresolved_klass()) {
duke@435:     uncommon_trap(Deoptimization::Reason_uninitialized,
duke@435:                   Deoptimization::Action_reinterpret,
duke@435:                   klass);
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   Node* kls = makecon(TypeKlassPtr::make(klass));
duke@435:   Node* obj = new_instance(kls);
duke@435: 
duke@435:   // Push resultant oop onto stack
duke@435:   push(obj);
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: //------------------------------dump_map_adr_mem-------------------------------
duke@435: // Debug dump of the mapping from address types to MergeMemNode indices.
duke@435: void Parse::dump_map_adr_mem() const {
duke@435:   tty->print_cr("--- Mapping from address types to memory Nodes ---");
duke@435:   MergeMemNode *mem = map() == NULL ? NULL : (map()->memory()->is_MergeMem() ?
duke@435:                                       map()->memory()->as_MergeMem() : NULL);
duke@435:   for (uint i = 0; i < (uint)C->num_alias_types(); i++) {
duke@435:     C->alias_type(i)->print_on(tty);
duke@435:     tty->print("\t");
duke@435:     // Node mapping, if any
duke@435:     if (mem && i < mem->req() && mem->in(i) && mem->in(i) != mem->empty_memory()) {
duke@435:       mem->in(i)->dump();
duke@435:     } else {
duke@435:       tty->cr();
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: #endif
duke@435: 
duke@435: 
duke@435: //=============================================================================
duke@435: //
duke@435: // parser methods for profiling
duke@435: 
duke@435: 
duke@435: //----------------------test_counter_against_threshold ------------------------
duke@435: void Parse::test_counter_against_threshold(Node* cnt, int limit) {
duke@435:   // Test the counter against the limit and uncommon trap if greater.
duke@435: 
duke@435:   // This code is largely copied from the range check code in
duke@435:   // array_addressing()
duke@435: 
duke@435:   // Test invocation count vs threshold
duke@435:   Node *threshold = makecon(TypeInt::make(limit));
duke@435:   Node *chk   = _gvn.transform( new (C, 3) CmpUNode( cnt, threshold) );
duke@435:   BoolTest::mask btest = BoolTest::lt;
duke@435:   Node *tst   = _gvn.transform( new (C, 2) BoolNode( chk, btest) );
duke@435:   // Branch to failure if threshold exceeded
duke@435:   { BuildCutout unless(this, tst, PROB_ALWAYS);
duke@435:     uncommon_trap(Deoptimization::Reason_age,
duke@435:                   Deoptimization::Action_maybe_recompile);
duke@435:   }
duke@435: }
duke@435: 
duke@435: //----------------------increment_and_test_invocation_counter-------------------
duke@435: void Parse::increment_and_test_invocation_counter(int limit) {
duke@435:   if (!count_invocations()) return;
duke@435: 
duke@435:   // Get the methodOop node.
duke@435:   const TypePtr* adr_type = TypeOopPtr::make_from_constant(method());
duke@435:   Node *methodOop_node = makecon(adr_type);
duke@435: 
duke@435:   // Load the interpreter_invocation_counter from the methodOop.
duke@435:   int offset = methodOopDesc::interpreter_invocation_counter_offset_in_bytes();
duke@435:   Node* adr_node = basic_plus_adr(methodOop_node, methodOop_node, offset);
duke@435:   Node* cnt = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type);
duke@435: 
duke@435:   test_counter_against_threshold(cnt, limit);
duke@435: 
duke@435:   // Add one to the counter and store
duke@435:   Node* incr = _gvn.transform(new (C, 3) AddINode(cnt, _gvn.intcon(1)));
duke@435:   store_to_memory( NULL, adr_node, incr, T_INT, adr_type );
duke@435: }
duke@435: 
duke@435: //----------------------------method_data_addressing---------------------------
duke@435: Node* Parse::method_data_addressing(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
duke@435:   // Get offset within methodDataOop of the data array
duke@435:   ByteSize data_offset = methodDataOopDesc::data_offset();
duke@435: 
duke@435:   // Get cell offset of the ProfileData within data array
duke@435:   int cell_offset = md->dp_to_di(data->dp());
duke@435: 
duke@435:   // Add in counter_offset, the # of bytes into the ProfileData of counter or flag
duke@435:   int offset = in_bytes(data_offset) + cell_offset + in_bytes(counter_offset);
duke@435: 
duke@435:   const TypePtr* adr_type = TypeOopPtr::make_from_constant(md);
duke@435:   Node* mdo = makecon(adr_type);
duke@435:   Node* ptr = basic_plus_adr(mdo, mdo, offset);
duke@435: 
duke@435:   if (stride != 0) {
duke@435:     Node* str = _gvn.MakeConX(stride);
duke@435:     Node* scale = _gvn.transform( new (C, 3) MulXNode( idx, str ) );
duke@435:     ptr   = _gvn.transform( new (C, 4) AddPNode( mdo, ptr, scale ) );
duke@435:   }
duke@435: 
duke@435:   return ptr;
duke@435: }
duke@435: 
duke@435: //--------------------------increment_md_counter_at----------------------------
duke@435: void Parse::increment_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, Node* idx, uint stride) {
duke@435:   Node* adr_node = method_data_addressing(md, data, counter_offset, idx, stride);
duke@435: 
duke@435:   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
duke@435:   Node* cnt  = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type);
duke@435:   Node* incr = _gvn.transform(new (C, 3) AddINode(cnt, _gvn.intcon(DataLayout::counter_increment)));
duke@435:   store_to_memory(NULL, adr_node, incr, T_INT, adr_type );
duke@435: }
duke@435: 
duke@435: //--------------------------test_for_osr_md_counter_at-------------------------
duke@435: void Parse::test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, int limit) {
duke@435:   Node* adr_node = method_data_addressing(md, data, counter_offset);
duke@435: 
duke@435:   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
duke@435:   Node* cnt  = make_load(NULL, adr_node, TypeInt::INT, T_INT, adr_type);
duke@435: 
duke@435:   test_counter_against_threshold(cnt, limit);
duke@435: }
duke@435: 
duke@435: //-------------------------------set_md_flag_at--------------------------------
duke@435: void Parse::set_md_flag_at(ciMethodData* md, ciProfileData* data, int flag_constant) {
duke@435:   Node* adr_node = method_data_addressing(md, data, DataLayout::flags_offset());
duke@435: 
duke@435:   const TypePtr* adr_type = _gvn.type(adr_node)->is_ptr();
duke@435:   Node* flags = make_load(NULL, adr_node, TypeInt::BYTE, T_BYTE, adr_type);
duke@435:   Node* incr = _gvn.transform(new (C, 3) OrINode(flags, _gvn.intcon(flag_constant)));
duke@435:   store_to_memory(NULL, adr_node, incr, T_BYTE, adr_type);
duke@435: }
duke@435: 
duke@435: //----------------------------profile_taken_branch-----------------------------
duke@435: void Parse::profile_taken_branch(int target_bci, bool force_update) {
duke@435:   // This is a potential osr_site if we have a backedge.
duke@435:   int cur_bci = bci();
duke@435:   bool osr_site =
duke@435:     (target_bci <= cur_bci) && count_invocations() && UseOnStackReplacement;
duke@435: 
duke@435:   // If we are going to OSR, restart at the target bytecode.
duke@435:   set_bci(target_bci);
duke@435: 
duke@435:   // To do: factor out the the limit calculations below. These duplicate
duke@435:   // the similar limit calculations in the interpreter.
duke@435: 
duke@435:   if (method_data_update() || force_update) {
duke@435:     ciMethodData* md = method()->method_data();
duke@435:     assert(md != NULL, "expected valid ciMethodData");
duke@435:     ciProfileData* data = md->bci_to_data(cur_bci);
duke@435:     assert(data->is_JumpData(), "need JumpData for taken branch");
duke@435:     increment_md_counter_at(md, data, JumpData::taken_offset());
duke@435:   }
duke@435: 
duke@435:   // In the new tiered system this is all we need to do. In the old
duke@435:   // (c2 based) tiered sytem we must do the code below.
duke@435: #ifndef TIERED
duke@435:   if (method_data_update()) {
duke@435:     ciMethodData* md = method()->method_data();
duke@435:     if (osr_site) {
duke@435:       ciProfileData* data = md->bci_to_data(cur_bci);
duke@435:       int limit = (CompileThreshold
duke@435:                    * (OnStackReplacePercentage - InterpreterProfilePercentage)) / 100;
duke@435:       test_for_osr_md_counter_at(md, data, JumpData::taken_offset(), limit);
duke@435:     }
duke@435:   } else {
duke@435:     // With method data update off, use the invocation counter to trigger an
duke@435:     // OSR compilation, as done in the interpreter.
duke@435:     if (osr_site) {
duke@435:       int limit = (CompileThreshold * OnStackReplacePercentage) / 100;
duke@435:       increment_and_test_invocation_counter(limit);
duke@435:     }
duke@435:   }
duke@435: #endif // TIERED
duke@435: 
duke@435:   // Restore the original bytecode.
duke@435:   set_bci(cur_bci);
duke@435: }
duke@435: 
duke@435: //--------------------------profile_not_taken_branch---------------------------
duke@435: void Parse::profile_not_taken_branch(bool force_update) {
duke@435: 
duke@435:   if (method_data_update() || force_update) {
duke@435:     ciMethodData* md = method()->method_data();
duke@435:     assert(md != NULL, "expected valid ciMethodData");
duke@435:     ciProfileData* data = md->bci_to_data(bci());
duke@435:     assert(data->is_BranchData(), "need BranchData for not taken branch");
duke@435:     increment_md_counter_at(md, data, BranchData::not_taken_offset());
duke@435:   }
duke@435: 
duke@435: }
duke@435: 
duke@435: //---------------------------------profile_call--------------------------------
duke@435: void Parse::profile_call(Node* receiver) {
duke@435:   if (!method_data_update()) return;
duke@435: 
duke@435:   profile_generic_call();
duke@435: 
duke@435:   switch (bc()) {
duke@435:   case Bytecodes::_invokevirtual:
duke@435:   case Bytecodes::_invokeinterface:
duke@435:     profile_receiver_type(receiver);
duke@435:     break;
duke@435:   case Bytecodes::_invokestatic:
duke@435:   case Bytecodes::_invokespecial:
duke@435:     break;
duke@435:   default: fatal("unexpected call bytecode");
duke@435:   }
duke@435: }
duke@435: 
duke@435: //------------------------------profile_generic_call---------------------------
duke@435: void Parse::profile_generic_call() {
duke@435:   assert(method_data_update(), "must be generating profile code");
duke@435: 
duke@435:   ciMethodData* md = method()->method_data();
duke@435:   assert(md != NULL, "expected valid ciMethodData");
duke@435:   ciProfileData* data = md->bci_to_data(bci());
duke@435:   assert(data->is_CounterData(), "need CounterData for not taken branch");
duke@435:   increment_md_counter_at(md, data, CounterData::count_offset());
duke@435: }
duke@435: 
duke@435: //-----------------------------profile_receiver_type---------------------------
duke@435: void Parse::profile_receiver_type(Node* receiver) {
duke@435:   assert(method_data_update(), "must be generating profile code");
duke@435: 
duke@435:   // Skip if we aren't tracking receivers
duke@435:   if (TypeProfileWidth < 1) return;
duke@435: 
duke@435:   ciMethodData* md = method()->method_data();
duke@435:   assert(md != NULL, "expected valid ciMethodData");
duke@435:   ciProfileData* data = md->bci_to_data(bci());
duke@435:   assert(data->is_ReceiverTypeData(), "need ReceiverTypeData here");
duke@435:   ciReceiverTypeData* rdata = (ciReceiverTypeData*)data->as_ReceiverTypeData();
duke@435: 
duke@435:   Node* method_data = method_data_addressing(md, rdata, in_ByteSize(0));
duke@435: 
duke@435:   // Using an adr_type of TypePtr::BOTTOM to work around anti-dep problems.
duke@435:   // A better solution might be to use TypeRawPtr::BOTTOM with RC_NARROW_MEM.
duke@435:   make_runtime_call(RC_LEAF, OptoRuntime::profile_receiver_type_Type(),
duke@435:                     CAST_FROM_FN_PTR(address,
duke@435:                                      OptoRuntime::profile_receiver_type_C),
duke@435:                     "profile_receiver_type_C",
duke@435:                     TypePtr::BOTTOM,
duke@435:                     method_data, receiver);
duke@435: }
duke@435: 
duke@435: //---------------------------------profile_ret---------------------------------
duke@435: void Parse::profile_ret(int target_bci) {
duke@435:   if (!method_data_update()) return;
duke@435: 
duke@435:   // Skip if we aren't tracking ret targets
duke@435:   if (TypeProfileWidth < 1) return;
duke@435: 
duke@435:   ciMethodData* md = method()->method_data();
duke@435:   assert(md != NULL, "expected valid ciMethodData");
duke@435:   ciProfileData* data = md->bci_to_data(bci());
duke@435:   assert(data->is_RetData(), "need RetData for ret");
duke@435:   ciRetData* ret_data = (ciRetData*)data->as_RetData();
duke@435: 
duke@435:   // Look for the target_bci is already in the table
duke@435:   uint row;
duke@435:   bool table_full = true;
duke@435:   for (row = 0; row < ret_data->row_limit(); row++) {
duke@435:     int key = ret_data->bci(row);
duke@435:     table_full &= (key != RetData::no_bci);
duke@435:     if (key == target_bci) break;
duke@435:   }
duke@435: 
duke@435:   if (row >= ret_data->row_limit()) {
duke@435:     // The target_bci was not found in the table.
duke@435:     if (!table_full) {
duke@435:       // XXX: Make slow call to update RetData
duke@435:     }
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   // the target_bci is already in the table
duke@435:   increment_md_counter_at(md, data, RetData::bci_count_offset(row));
duke@435: }
duke@435: 
duke@435: //--------------------------profile_null_checkcast----------------------------
duke@435: void Parse::profile_null_checkcast() {
duke@435:   // Set the null-seen flag, done in conjunction with the usual null check. We
duke@435:   // never unset the flag, so this is a one-way switch.
duke@435:   if (!method_data_update()) return;
duke@435: 
duke@435:   ciMethodData* md = method()->method_data();
duke@435:   assert(md != NULL, "expected valid ciMethodData");
duke@435:   ciProfileData* data = md->bci_to_data(bci());
duke@435:   assert(data->is_BitData(), "need BitData for checkcast");
duke@435:   set_md_flag_at(md, data, BitData::null_seen_byte_constant());
duke@435: }
duke@435: 
duke@435: //-----------------------------profile_switch_case-----------------------------
duke@435: void Parse::profile_switch_case(int table_index) {
duke@435:   if (!method_data_update()) return;
duke@435: 
duke@435:   ciMethodData* md = method()->method_data();
duke@435:   assert(md != NULL, "expected valid ciMethodData");
duke@435: 
duke@435:   ciProfileData* data = md->bci_to_data(bci());
duke@435:   assert(data->is_MultiBranchData(), "need MultiBranchData for switch case");
duke@435:   if (table_index >= 0) {
duke@435:     increment_md_counter_at(md, data, MultiBranchData::case_count_offset(table_index));
duke@435:   } else {
duke@435:     increment_md_counter_at(md, data, MultiBranchData::default_count_offset());
duke@435:   }
duke@435: }