duke@435: /* never@2462: * Copyright (c) 2000, 2011, Oracle and/or its affiliates. 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: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "ci/ciConstant.hpp" stefank@2314: #include "ci/ciField.hpp" stefank@2314: #include "ci/ciMethod.hpp" stefank@2314: #include "ci/ciMethodData.hpp" stefank@2314: #include "ci/ciObjArrayKlass.hpp" stefank@2314: #include "ci/ciStreams.hpp" stefank@2314: #include "ci/ciTypeArrayKlass.hpp" stefank@2314: #include "ci/ciTypeFlow.hpp" stefank@2314: #include "compiler/compileLog.hpp" stefank@2314: #include "interpreter/bytecode.hpp" stefank@2314: #include "interpreter/bytecodes.hpp" stefank@2314: #include "memory/allocation.inline.hpp" stefank@2314: #include "runtime/deoptimization.hpp" stefank@2314: #include "utilities/growableArray.hpp" duke@435: duke@435: // ciTypeFlow::JsrSet duke@435: // duke@435: // A JsrSet represents some set of JsrRecords. This class duke@435: // is used to record a set of all jsr routines which we permit duke@435: // execution to return (ret) from. duke@435: // duke@435: // During abstract interpretation, JsrSets are used to determine duke@435: // whether two paths which reach a given block are unique, and duke@435: // should be cloned apart, or are compatible, and should merge duke@435: // together. duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::JsrSet::JsrSet duke@435: ciTypeFlow::JsrSet::JsrSet(Arena* arena, int default_len) { duke@435: if (arena != NULL) { duke@435: // Allocate growable array in Arena. duke@435: _set = new (arena) GrowableArray(arena, default_len, 0, NULL); duke@435: } else { duke@435: // Allocate growable array in current ResourceArea. duke@435: _set = new GrowableArray(4, 0, NULL, false); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::JsrSet::copy_into duke@435: void ciTypeFlow::JsrSet::copy_into(JsrSet* jsrs) { duke@435: int len = size(); duke@435: jsrs->_set->clear(); duke@435: for (int i = 0; i < len; i++) { duke@435: jsrs->_set->append(_set->at(i)); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::JsrSet::is_compatible_with duke@435: // duke@435: // !!!! MISGIVINGS ABOUT THIS... disregard duke@435: // duke@435: // Is this JsrSet compatible with some other JsrSet? duke@435: // duke@435: // In set-theoretic terms, a JsrSet can be viewed as a partial function duke@435: // from entry addresses to return addresses. Two JsrSets A and B are duke@435: // compatible iff duke@435: // duke@435: // For any x, duke@435: // A(x) defined and B(x) defined implies A(x) == B(x) duke@435: // duke@435: // Less formally, two JsrSets are compatible when they have identical duke@435: // return addresses for any entry addresses they share in common. duke@435: bool ciTypeFlow::JsrSet::is_compatible_with(JsrSet* other) { duke@435: // Walk through both sets in parallel. If the same entry address duke@435: // appears in both sets, then the return address must match for duke@435: // the sets to be compatible. duke@435: int size1 = size(); duke@435: int size2 = other->size(); duke@435: duke@435: // Special case. If nothing is on the jsr stack, then there can duke@435: // be no ret. duke@435: if (size2 == 0) { duke@435: return true; duke@435: } else if (size1 != size2) { duke@435: return false; duke@435: } else { duke@435: for (int i = 0; i < size1; i++) { duke@435: JsrRecord* record1 = record_at(i); duke@435: JsrRecord* record2 = other->record_at(i); duke@435: if (record1->entry_address() != record2->entry_address() || duke@435: record1->return_address() != record2->return_address()) { duke@435: return false; duke@435: } duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: #if 0 duke@435: int pos1 = 0; duke@435: int pos2 = 0; duke@435: int size1 = size(); duke@435: int size2 = other->size(); duke@435: while (pos1 < size1 && pos2 < size2) { duke@435: JsrRecord* record1 = record_at(pos1); duke@435: JsrRecord* record2 = other->record_at(pos2); duke@435: int entry1 = record1->entry_address(); duke@435: int entry2 = record2->entry_address(); duke@435: if (entry1 < entry2) { duke@435: pos1++; duke@435: } else if (entry1 > entry2) { duke@435: pos2++; duke@435: } else { duke@435: if (record1->return_address() == record2->return_address()) { duke@435: pos1++; duke@435: pos2++; duke@435: } else { duke@435: // These two JsrSets are incompatible. duke@435: return false; duke@435: } duke@435: } duke@435: } duke@435: // The two JsrSets agree. duke@435: return true; duke@435: #endif duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::JsrSet::insert_jsr_record duke@435: // duke@435: // Insert the given JsrRecord into the JsrSet, maintaining the order duke@435: // of the set and replacing any element with the same entry address. duke@435: void ciTypeFlow::JsrSet::insert_jsr_record(JsrRecord* record) { duke@435: int len = size(); duke@435: int entry = record->entry_address(); duke@435: int pos = 0; duke@435: for ( ; pos < len; pos++) { duke@435: JsrRecord* current = record_at(pos); duke@435: if (entry == current->entry_address()) { duke@435: // Stomp over this entry. duke@435: _set->at_put(pos, record); duke@435: assert(size() == len, "must be same size"); duke@435: return; duke@435: } else if (entry < current->entry_address()) { duke@435: break; duke@435: } duke@435: } duke@435: duke@435: // Insert the record into the list. duke@435: JsrRecord* swap = record; duke@435: JsrRecord* temp = NULL; duke@435: for ( ; pos < len; pos++) { duke@435: temp = _set->at(pos); duke@435: _set->at_put(pos, swap); duke@435: swap = temp; duke@435: } duke@435: _set->append(swap); duke@435: assert(size() == len+1, "must be larger"); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::JsrSet::remove_jsr_record duke@435: // duke@435: // Remove the JsrRecord with the given return address from the JsrSet. duke@435: void ciTypeFlow::JsrSet::remove_jsr_record(int return_address) { duke@435: int len = size(); duke@435: for (int i = 0; i < len; i++) { duke@435: if (record_at(i)->return_address() == return_address) { duke@435: // We have found the proper entry. Remove it from the duke@435: // JsrSet and exit. duke@435: for (int j = i+1; j < len ; j++) { duke@435: _set->at_put(j-1, _set->at(j)); duke@435: } duke@435: _set->trunc_to(len-1); duke@435: assert(size() == len-1, "must be smaller"); duke@435: return; duke@435: } duke@435: } duke@435: assert(false, "verify: returning from invalid subroutine"); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::JsrSet::apply_control duke@435: // duke@435: // Apply the effect of a control-flow bytecode on the JsrSet. The duke@435: // only bytecodes that modify the JsrSet are jsr and ret. duke@435: void ciTypeFlow::JsrSet::apply_control(ciTypeFlow* analyzer, duke@435: ciBytecodeStream* str, duke@435: ciTypeFlow::StateVector* state) { duke@435: Bytecodes::Code code = str->cur_bc(); duke@435: if (code == Bytecodes::_jsr) { duke@435: JsrRecord* record = duke@435: analyzer->make_jsr_record(str->get_dest(), str->next_bci()); duke@435: insert_jsr_record(record); duke@435: } else if (code == Bytecodes::_jsr_w) { duke@435: JsrRecord* record = duke@435: analyzer->make_jsr_record(str->get_far_dest(), str->next_bci()); duke@435: insert_jsr_record(record); duke@435: } else if (code == Bytecodes::_ret) { duke@435: Cell local = state->local(str->get_index()); duke@435: ciType* return_address = state->type_at(local); duke@435: assert(return_address->is_return_address(), "verify: wrong type"); duke@435: if (size() == 0) { duke@435: // Ret-state underflow: Hit a ret w/o any previous jsrs. Bail out. duke@435: // This can happen when a loop is inside a finally clause (4614060). duke@435: analyzer->record_failure("OSR in finally clause"); duke@435: return; duke@435: } duke@435: remove_jsr_record(return_address->as_return_address()->bci()); duke@435: } duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::JsrSet::print_on duke@435: void ciTypeFlow::JsrSet::print_on(outputStream* st) const { duke@435: st->print("{ "); duke@435: int num_elements = size(); duke@435: if (num_elements > 0) { duke@435: int i = 0; duke@435: for( ; i < num_elements - 1; i++) { duke@435: _set->at(i)->print_on(st); duke@435: st->print(", "); duke@435: } duke@435: _set->at(i)->print_on(st); duke@435: st->print(" "); duke@435: } duke@435: st->print("}"); duke@435: } duke@435: #endif duke@435: duke@435: // ciTypeFlow::StateVector duke@435: // duke@435: // A StateVector summarizes the type information at some point in duke@435: // the program. duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::type_meet duke@435: // duke@435: // Meet two types. duke@435: // duke@435: // The semi-lattice of types use by this analysis are modeled on those duke@435: // of the verifier. The lattice is as follows: duke@435: // duke@435: // top_type() >= all non-extremal types >= bottom_type duke@435: // and duke@435: // Every primitive type is comparable only with itself. The meet of duke@435: // reference types is determined by their kind: instance class, duke@435: // interface, or array class. The meet of two types of the same duke@435: // kind is their least common ancestor. The meet of two types of duke@435: // different kinds is always java.lang.Object. duke@435: ciType* ciTypeFlow::StateVector::type_meet_internal(ciType* t1, ciType* t2, ciTypeFlow* analyzer) { duke@435: assert(t1 != t2, "checked in caller"); duke@435: if (t1->equals(top_type())) { duke@435: return t2; duke@435: } else if (t2->equals(top_type())) { duke@435: return t1; duke@435: } else if (t1->is_primitive_type() || t2->is_primitive_type()) { duke@435: // Special case null_type. null_type meet any reference type T duke@435: // is T. null_type meet null_type is null_type. duke@435: if (t1->equals(null_type())) { duke@435: if (!t2->is_primitive_type() || t2->equals(null_type())) { duke@435: return t2; duke@435: } duke@435: } else if (t2->equals(null_type())) { duke@435: if (!t1->is_primitive_type()) { duke@435: return t1; duke@435: } duke@435: } duke@435: duke@435: // At least one of the two types is a non-top primitive type. duke@435: // The other type is not equal to it. Fall to bottom. duke@435: return bottom_type(); duke@435: } else { duke@435: // Both types are non-top non-primitive types. That is, duke@435: // both types are either instanceKlasses or arrayKlasses. duke@435: ciKlass* object_klass = analyzer->env()->Object_klass(); duke@435: ciKlass* k1 = t1->as_klass(); duke@435: ciKlass* k2 = t2->as_klass(); duke@435: if (k1->equals(object_klass) || k2->equals(object_klass)) { duke@435: return object_klass; duke@435: } else if (!k1->is_loaded() || !k2->is_loaded()) { duke@435: // Unloaded classes fall to java.lang.Object at a merge. duke@435: return object_klass; duke@435: } else if (k1->is_interface() != k2->is_interface()) { duke@435: // When an interface meets a non-interface, we get Object; duke@435: // This is what the verifier does. duke@435: return object_klass; duke@435: } else if (k1->is_array_klass() || k2->is_array_klass()) { duke@435: // When an array meets a non-array, we get Object. duke@435: // When objArray meets typeArray, we also get Object. duke@435: // And when typeArray meets different typeArray, we again get Object. duke@435: // But when objArray meets objArray, we look carefully at element types. duke@435: if (k1->is_obj_array_klass() && k2->is_obj_array_klass()) { duke@435: // Meet the element types, then construct the corresponding array type. duke@435: ciKlass* elem1 = k1->as_obj_array_klass()->element_klass(); duke@435: ciKlass* elem2 = k2->as_obj_array_klass()->element_klass(); duke@435: ciKlass* elem = type_meet_internal(elem1, elem2, analyzer)->as_klass(); duke@435: // Do an easy shortcut if one type is a super of the other. duke@435: if (elem == elem1) { duke@435: assert(k1 == ciObjArrayKlass::make(elem), "shortcut is OK"); duke@435: return k1; duke@435: } else if (elem == elem2) { duke@435: assert(k2 == ciObjArrayKlass::make(elem), "shortcut is OK"); duke@435: return k2; duke@435: } else { duke@435: return ciObjArrayKlass::make(elem); duke@435: } duke@435: } else { duke@435: return object_klass; duke@435: } duke@435: } else { duke@435: // Must be two plain old instance klasses. duke@435: assert(k1->is_instance_klass(), "previous cases handle non-instances"); duke@435: assert(k2->is_instance_klass(), "previous cases handle non-instances"); duke@435: return k1->least_common_ancestor(k2); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::StateVector duke@435: // duke@435: // Build a new state vector duke@435: ciTypeFlow::StateVector::StateVector(ciTypeFlow* analyzer) { duke@435: _outer = analyzer; duke@435: _stack_size = -1; duke@435: _monitor_count = -1; duke@435: // Allocate the _types array duke@435: int max_cells = analyzer->max_cells(); duke@435: _types = (ciType**)analyzer->arena()->Amalloc(sizeof(ciType*) * max_cells); duke@435: for (int i=0; iget_flow_analysis(); duke@435: if (non_osr_flow->failing()) { duke@435: record_failure(non_osr_flow->failure_reason()); duke@435: return NULL; duke@435: } duke@435: JsrSet* jsrs = new JsrSet(NULL, 16); duke@435: Block* non_osr_block = non_osr_flow->existing_block_at(start_bci(), jsrs); duke@435: if (non_osr_block == NULL) { duke@435: record_failure("cannot reach OSR point"); duke@435: return NULL; duke@435: } duke@435: // load up the non-OSR state at this point duke@435: non_osr_block->copy_state_into(state); duke@435: int non_osr_start = non_osr_block->start(); duke@435: if (non_osr_start != start_bci()) { duke@435: // must flow forward from it duke@435: if (CITraceTypeFlow) { duke@435: tty->print_cr(">> Interpreting pre-OSR block %d:", non_osr_start); duke@435: } duke@435: Block* block = block_at(non_osr_start, jsrs); duke@435: assert(block->limit() == start_bci(), "must flow forward to start"); duke@435: flow_block(block, state, jsrs); duke@435: } duke@435: return state; duke@435: // Note: The code below would be an incorrect for an OSR flow, duke@435: // even if it were possible for an OSR entry point to be at bci zero. duke@435: } duke@435: // "Push" the method signature into the first few locals. duke@435: state->set_stack_size(-max_locals()); duke@435: if (!method()->is_static()) { duke@435: state->push(method()->holder()); duke@435: assert(state->tos() == state->local(0), ""); duke@435: } duke@435: for (ciSignatureStream str(method()->signature()); duke@435: !str.at_return_type(); duke@435: str.next()) { duke@435: state->push_translate(str.type()); duke@435: } duke@435: // Set the rest of the locals to bottom. duke@435: Cell cell = state->next_cell(state->tos()); duke@435: state->set_stack_size(0); duke@435: int limit = state->limit_cell(); duke@435: for (; cell < limit; cell = state->next_cell(cell)) { duke@435: state->set_type_at(cell, state->bottom_type()); duke@435: } duke@435: // Lock an object, if necessary. duke@435: state->set_monitor_count(method()->is_synchronized() ? 1 : 0); duke@435: return state; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::copy_into duke@435: // duke@435: // Copy our value into some other StateVector duke@435: void ciTypeFlow::StateVector::copy_into(ciTypeFlow::StateVector* copy) duke@435: const { duke@435: copy->set_stack_size(stack_size()); duke@435: copy->set_monitor_count(monitor_count()); duke@435: Cell limit = limit_cell(); duke@435: for (Cell c = start_cell(); c < limit; c = next_cell(c)) { duke@435: copy->set_type_at(c, type_at(c)); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::meet duke@435: // duke@435: // Meets this StateVector with another, destructively modifying this duke@435: // one. Returns true if any modification takes place. duke@435: bool ciTypeFlow::StateVector::meet(const ciTypeFlow::StateVector* incoming) { duke@435: if (monitor_count() == -1) { duke@435: set_monitor_count(incoming->monitor_count()); duke@435: } duke@435: assert(monitor_count() == incoming->monitor_count(), "monitors must match"); duke@435: duke@435: if (stack_size() == -1) { duke@435: set_stack_size(incoming->stack_size()); duke@435: Cell limit = limit_cell(); duke@435: #ifdef ASSERT duke@435: { for (Cell c = start_cell(); c < limit; c = next_cell(c)) { duke@435: assert(type_at(c) == top_type(), ""); duke@435: } } duke@435: #endif duke@435: // Make a simple copy of the incoming state. duke@435: for (Cell c = start_cell(); c < limit; c = next_cell(c)) { duke@435: set_type_at(c, incoming->type_at(c)); duke@435: } duke@435: return true; // it is always different the first time duke@435: } duke@435: #ifdef ASSERT duke@435: if (stack_size() != incoming->stack_size()) { duke@435: _outer->method()->print_codes(); duke@435: tty->print_cr("!!!! Stack size conflict"); duke@435: tty->print_cr("Current state:"); duke@435: print_on(tty); duke@435: tty->print_cr("Incoming state:"); duke@435: ((StateVector*)incoming)->print_on(tty); duke@435: } duke@435: #endif duke@435: assert(stack_size() == incoming->stack_size(), "sanity"); duke@435: duke@435: bool different = false; duke@435: Cell limit = limit_cell(); duke@435: for (Cell c = start_cell(); c < limit; c = next_cell(c)) { duke@435: ciType* t1 = type_at(c); duke@435: ciType* t2 = incoming->type_at(c); duke@435: if (!t1->equals(t2)) { duke@435: ciType* new_type = type_meet(t1, t2); duke@435: if (!t1->equals(new_type)) { duke@435: set_type_at(c, new_type); duke@435: different = true; duke@435: } duke@435: } duke@435: } duke@435: return different; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::meet_exception duke@435: // duke@435: // Meets this StateVector with another, destructively modifying this duke@435: // one. The incoming state is coming via an exception. Returns true duke@435: // if any modification takes place. duke@435: bool ciTypeFlow::StateVector::meet_exception(ciInstanceKlass* exc, duke@435: const ciTypeFlow::StateVector* incoming) { duke@435: if (monitor_count() == -1) { duke@435: set_monitor_count(incoming->monitor_count()); duke@435: } duke@435: assert(monitor_count() == incoming->monitor_count(), "monitors must match"); duke@435: duke@435: if (stack_size() == -1) { duke@435: set_stack_size(1); duke@435: } duke@435: duke@435: assert(stack_size() == 1, "must have one-element stack"); duke@435: duke@435: bool different = false; duke@435: duke@435: // Meet locals from incoming array. duke@435: Cell limit = local(_outer->max_locals()-1); duke@435: for (Cell c = start_cell(); c <= limit; c = next_cell(c)) { duke@435: ciType* t1 = type_at(c); duke@435: ciType* t2 = incoming->type_at(c); duke@435: if (!t1->equals(t2)) { duke@435: ciType* new_type = type_meet(t1, t2); duke@435: if (!t1->equals(new_type)) { duke@435: set_type_at(c, new_type); duke@435: different = true; duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Handle stack separately. When an exception occurs, the duke@435: // only stack entry is the exception instance. duke@435: ciType* tos_type = type_at_tos(); duke@435: if (!tos_type->equals(exc)) { duke@435: ciType* new_type = type_meet(tos_type, exc); duke@435: if (!tos_type->equals(new_type)) { duke@435: set_type_at_tos(new_type); duke@435: different = true; duke@435: } duke@435: } duke@435: duke@435: return different; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::push_translate duke@435: void ciTypeFlow::StateVector::push_translate(ciType* type) { duke@435: BasicType basic_type = type->basic_type(); duke@435: if (basic_type == T_BOOLEAN || basic_type == T_CHAR || duke@435: basic_type == T_BYTE || basic_type == T_SHORT) { duke@435: push_int(); duke@435: } else { duke@435: push(type); duke@435: if (type->is_two_word()) { duke@435: push(half_type(type)); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_aaload duke@435: void ciTypeFlow::StateVector::do_aaload(ciBytecodeStream* str) { duke@435: pop_int(); duke@435: ciObjArrayKlass* array_klass = pop_objArray(); duke@435: if (array_klass == NULL) { duke@435: // Did aaload on a null reference; push a null and ignore the exception. duke@435: // This instruction will never continue normally. All we have to do duke@435: // is report a value that will meet correctly with any downstream duke@435: // reference types on paths that will truly be executed. This null type duke@435: // meets with any reference type to yield that same reference type. twisti@1040: // (The compiler will generate an unconditional exception here.) duke@435: push(null_type()); duke@435: return; duke@435: } duke@435: if (!array_klass->is_loaded()) { duke@435: // Only fails for some -Xcomp runs duke@435: trap(str, array_klass, duke@435: Deoptimization::make_trap_request duke@435: (Deoptimization::Reason_unloaded, duke@435: Deoptimization::Action_reinterpret)); duke@435: return; duke@435: } duke@435: ciKlass* element_klass = array_klass->element_klass(); duke@435: if (!element_klass->is_loaded() && element_klass->is_instance_klass()) { duke@435: Untested("unloaded array element class in ciTypeFlow"); duke@435: trap(str, element_klass, duke@435: Deoptimization::make_trap_request duke@435: (Deoptimization::Reason_unloaded, duke@435: Deoptimization::Action_reinterpret)); duke@435: } else { duke@435: push_object(element_klass); duke@435: } duke@435: } duke@435: duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_checkcast duke@435: void ciTypeFlow::StateVector::do_checkcast(ciBytecodeStream* str) { duke@435: bool will_link; duke@435: ciKlass* klass = str->get_klass(will_link); duke@435: if (!will_link) { duke@435: // VM's interpreter will not load 'klass' if object is NULL. duke@435: // Type flow after this block may still be needed in two situations: duke@435: // 1) C2 uses do_null_assert() and continues compilation for later blocks duke@435: // 2) C2 does an OSR compile in a later block (see bug 4778368). duke@435: pop_object(); duke@435: do_null_assert(klass); duke@435: } else { duke@435: pop_object(); duke@435: push_object(klass); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_getfield duke@435: void ciTypeFlow::StateVector::do_getfield(ciBytecodeStream* str) { duke@435: // could add assert here for type of object. duke@435: pop_object(); duke@435: do_getstatic(str); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_getstatic duke@435: void ciTypeFlow::StateVector::do_getstatic(ciBytecodeStream* str) { duke@435: bool will_link; duke@435: ciField* field = str->get_field(will_link); duke@435: if (!will_link) { duke@435: trap(str, field->holder(), str->get_field_holder_index()); duke@435: } else { duke@435: ciType* field_type = field->type(); duke@435: if (!field_type->is_loaded()) { duke@435: // Normally, we need the field's type to be loaded if we are to duke@435: // do anything interesting with its value. duke@435: // We used to do this: trap(str, str->get_field_signature_index()); duke@435: // duke@435: // There is one good reason not to trap here. Execution can duke@435: // get past this "getfield" or "getstatic" if the value of duke@435: // the field is null. As long as the value is null, the class duke@435: // does not need to be loaded! The compiler must assume that duke@435: // the value of the unloaded class reference is null; if the code duke@435: // ever sees a non-null value, loading has occurred. duke@435: // duke@435: // This actually happens often enough to be annoying. If the duke@435: // compiler throws an uncommon trap at this bytecode, you can duke@435: // get an endless loop of recompilations, when all the code duke@435: // needs to do is load a series of null values. Also, a trap duke@435: // here can make an OSR entry point unreachable, triggering the duke@435: // assert on non_osr_block in ciTypeFlow::get_start_state. duke@435: // (See bug 4379915.) duke@435: do_null_assert(field_type->as_klass()); duke@435: } else { duke@435: push_translate(field_type); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_invoke duke@435: void ciTypeFlow::StateVector::do_invoke(ciBytecodeStream* str, duke@435: bool has_receiver) { duke@435: bool will_link; duke@435: ciMethod* method = str->get_method(will_link); duke@435: if (!will_link) { duke@435: // We weren't able to find the method. twisti@1572: if (str->cur_bc() == Bytecodes::_invokedynamic) { twisti@1572: trap(str, NULL, twisti@1572: Deoptimization::make_trap_request twisti@1572: (Deoptimization::Reason_uninitialized, twisti@1572: Deoptimization::Action_reinterpret)); twisti@1572: } else { twisti@1572: ciKlass* unloaded_holder = method->holder(); twisti@1572: trap(str, unloaded_holder, str->get_method_holder_index()); twisti@1572: } duke@435: } else { duke@435: ciSignature* signature = method->signature(); duke@435: ciSignatureStream sigstr(signature); duke@435: int arg_size = signature->size(); duke@435: int stack_base = stack_size() - arg_size; duke@435: int i = 0; duke@435: for( ; !sigstr.at_return_type(); sigstr.next()) { duke@435: ciType* type = sigstr.type(); duke@435: ciType* stack_type = type_at(stack(stack_base + i++)); duke@435: // Do I want to check this type? duke@435: // assert(stack_type->is_subtype_of(type), "bad type for field value"); duke@435: if (type->is_two_word()) { duke@435: ciType* stack_type2 = type_at(stack(stack_base + i++)); duke@435: assert(stack_type2->equals(half_type(type)), "must be 2nd half"); duke@435: } duke@435: } duke@435: assert(arg_size == i, "must match"); duke@435: for (int j = 0; j < arg_size; j++) { duke@435: pop(); duke@435: } duke@435: if (has_receiver) { duke@435: // Check this? duke@435: pop_object(); duke@435: } duke@435: assert(!sigstr.is_done(), "must have return type"); duke@435: ciType* return_type = sigstr.type(); duke@435: if (!return_type->is_void()) { duke@435: if (!return_type->is_loaded()) { duke@435: // As in do_getstatic(), generally speaking, we need the return type to duke@435: // be loaded if we are to do anything interesting with its value. duke@435: // We used to do this: trap(str, str->get_method_signature_index()); duke@435: // duke@435: // We do not trap here since execution can get past this invoke if duke@435: // the return value is null. As long as the value is null, the class duke@435: // does not need to be loaded! The compiler must assume that duke@435: // the value of the unloaded class reference is null; if the code duke@435: // ever sees a non-null value, loading has occurred. duke@435: // duke@435: // See do_getstatic() for similar explanation, as well as bug 4684993. duke@435: do_null_assert(return_type->as_klass()); duke@435: } else { duke@435: push_translate(return_type); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_jsr duke@435: void ciTypeFlow::StateVector::do_jsr(ciBytecodeStream* str) { duke@435: push(ciReturnAddress::make(str->next_bci())); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_ldc duke@435: void ciTypeFlow::StateVector::do_ldc(ciBytecodeStream* str) { duke@435: ciConstant con = str->get_constant(); duke@435: BasicType basic_type = con.basic_type(); duke@435: if (basic_type == T_ILLEGAL) { duke@435: // OutOfMemoryError in the CI while loading constant duke@435: push_null(); duke@435: outer()->record_failure("ldc did not link"); duke@435: return; duke@435: } duke@435: if (basic_type == T_OBJECT || basic_type == T_ARRAY) { duke@435: ciObject* obj = con.as_object(); duke@435: if (obj->is_null_object()) { duke@435: push_null(); duke@435: } else { jrose@1959: assert(!obj->is_klass(), "must be java_mirror of klass"); duke@435: push_object(obj->klass()); duke@435: } duke@435: } else { duke@435: push_translate(ciType::make(basic_type)); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_multianewarray duke@435: void ciTypeFlow::StateVector::do_multianewarray(ciBytecodeStream* str) { duke@435: int dimensions = str->get_dimensions(); duke@435: bool will_link; duke@435: ciArrayKlass* array_klass = str->get_klass(will_link)->as_array_klass(); duke@435: if (!will_link) { duke@435: trap(str, array_klass, str->get_klass_index()); duke@435: } else { duke@435: for (int i = 0; i < dimensions; i++) { duke@435: pop_int(); duke@435: } duke@435: push_object(array_klass); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_new duke@435: void ciTypeFlow::StateVector::do_new(ciBytecodeStream* str) { duke@435: bool will_link; duke@435: ciKlass* klass = str->get_klass(will_link); never@802: if (!will_link || str->is_unresolved_klass()) { duke@435: trap(str, klass, str->get_klass_index()); duke@435: } else { duke@435: push_object(klass); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_newarray duke@435: void ciTypeFlow::StateVector::do_newarray(ciBytecodeStream* str) { duke@435: pop_int(); duke@435: ciKlass* klass = ciTypeArrayKlass::make((BasicType)str->get_index()); duke@435: push_object(klass); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_putfield duke@435: void ciTypeFlow::StateVector::do_putfield(ciBytecodeStream* str) { duke@435: do_putstatic(str); duke@435: if (_trap_bci != -1) return; // unloaded field holder, etc. duke@435: // could add assert here for type of object. duke@435: pop_object(); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_putstatic duke@435: void ciTypeFlow::StateVector::do_putstatic(ciBytecodeStream* str) { duke@435: bool will_link; duke@435: ciField* field = str->get_field(will_link); duke@435: if (!will_link) { duke@435: trap(str, field->holder(), str->get_field_holder_index()); duke@435: } else { duke@435: ciType* field_type = field->type(); duke@435: ciType* type = pop_value(); duke@435: // Do I want to check this type? duke@435: // assert(type->is_subtype_of(field_type), "bad type for field value"); duke@435: if (field_type->is_two_word()) { duke@435: ciType* type2 = pop_value(); duke@435: assert(type2->is_two_word(), "must be 2nd half"); duke@435: assert(type == half_type(type2), "must be 2nd half"); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_ret duke@435: void ciTypeFlow::StateVector::do_ret(ciBytecodeStream* str) { duke@435: Cell index = local(str->get_index()); duke@435: duke@435: ciType* address = type_at(index); duke@435: assert(address->is_return_address(), "bad return address"); duke@435: set_type_at(index, bottom_type()); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::trap duke@435: // duke@435: // Stop interpretation of this path with a trap. duke@435: void ciTypeFlow::StateVector::trap(ciBytecodeStream* str, ciKlass* klass, int index) { duke@435: _trap_bci = str->cur_bci(); duke@435: _trap_index = index; duke@435: duke@435: // Log information about this trap: duke@435: CompileLog* log = outer()->env()->log(); duke@435: if (log != NULL) { duke@435: int mid = log->identify(outer()->method()); duke@435: int kid = (klass == NULL)? -1: log->identify(klass); duke@435: log->begin_elem("uncommon_trap method='%d' bci='%d'", mid, str->cur_bci()); duke@435: char buf[100]; duke@435: log->print(" %s", Deoptimization::format_trap_request(buf, sizeof(buf), duke@435: index)); duke@435: if (kid >= 0) duke@435: log->print(" klass='%d'", kid); duke@435: log->end_elem(); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::do_null_assert duke@435: // Corresponds to graphKit::do_null_assert. duke@435: void ciTypeFlow::StateVector::do_null_assert(ciKlass* unloaded_klass) { duke@435: if (unloaded_klass->is_loaded()) { duke@435: // We failed to link, but we can still compute with this class, duke@435: // since it is loaded somewhere. The compiler will uncommon_trap duke@435: // if the object is not null, but the typeflow pass can not assume duke@435: // that the object will be null, otherwise it may incorrectly tell duke@435: // the parser that an object is known to be null. 4761344, 4807707 duke@435: push_object(unloaded_klass); duke@435: } else { duke@435: // The class is not loaded anywhere. It is safe to model the duke@435: // null in the typestates, because we can compile in a null check duke@435: // which will deoptimize us if someone manages to load the duke@435: // class later. duke@435: push_null(); duke@435: } duke@435: } duke@435: duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::apply_one_bytecode duke@435: // duke@435: // Apply the effect of one bytecode to this StateVector duke@435: bool ciTypeFlow::StateVector::apply_one_bytecode(ciBytecodeStream* str) { duke@435: _trap_bci = -1; duke@435: _trap_index = 0; duke@435: duke@435: if (CITraceTypeFlow) { duke@435: tty->print_cr(">> Interpreting bytecode %d:%s", str->cur_bci(), duke@435: Bytecodes::name(str->cur_bc())); duke@435: } duke@435: duke@435: switch(str->cur_bc()) { duke@435: case Bytecodes::_aaload: do_aaload(str); break; duke@435: duke@435: case Bytecodes::_aastore: duke@435: { duke@435: pop_object(); duke@435: pop_int(); duke@435: pop_objArray(); duke@435: break; duke@435: } duke@435: case Bytecodes::_aconst_null: duke@435: { duke@435: push_null(); duke@435: break; duke@435: } duke@435: case Bytecodes::_aload: load_local_object(str->get_index()); break; duke@435: case Bytecodes::_aload_0: load_local_object(0); break; duke@435: case Bytecodes::_aload_1: load_local_object(1); break; duke@435: case Bytecodes::_aload_2: load_local_object(2); break; duke@435: case Bytecodes::_aload_3: load_local_object(3); break; duke@435: duke@435: case Bytecodes::_anewarray: duke@435: { duke@435: pop_int(); duke@435: bool will_link; duke@435: ciKlass* element_klass = str->get_klass(will_link); duke@435: if (!will_link) { duke@435: trap(str, element_klass, str->get_klass_index()); duke@435: } else { duke@435: push_object(ciObjArrayKlass::make(element_klass)); duke@435: } duke@435: break; duke@435: } duke@435: case Bytecodes::_areturn: duke@435: case Bytecodes::_ifnonnull: duke@435: case Bytecodes::_ifnull: duke@435: { duke@435: pop_object(); duke@435: break; duke@435: } duke@435: case Bytecodes::_monitorenter: duke@435: { duke@435: pop_object(); duke@435: set_monitor_count(monitor_count() + 1); duke@435: break; duke@435: } duke@435: case Bytecodes::_monitorexit: duke@435: { duke@435: pop_object(); duke@435: assert(monitor_count() > 0, "must be a monitor to exit from"); duke@435: set_monitor_count(monitor_count() - 1); duke@435: break; duke@435: } duke@435: case Bytecodes::_arraylength: duke@435: { duke@435: pop_array(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_astore: store_local_object(str->get_index()); break; duke@435: case Bytecodes::_astore_0: store_local_object(0); break; duke@435: case Bytecodes::_astore_1: store_local_object(1); break; duke@435: case Bytecodes::_astore_2: store_local_object(2); break; duke@435: case Bytecodes::_astore_3: store_local_object(3); break; duke@435: duke@435: case Bytecodes::_athrow: duke@435: { duke@435: NEEDS_CLEANUP; duke@435: pop_object(); duke@435: break; duke@435: } duke@435: case Bytecodes::_baload: duke@435: case Bytecodes::_caload: duke@435: case Bytecodes::_iaload: duke@435: case Bytecodes::_saload: duke@435: { duke@435: pop_int(); duke@435: ciTypeArrayKlass* array_klass = pop_typeArray(); duke@435: // Put assert here for right type? duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_bastore: duke@435: case Bytecodes::_castore: duke@435: case Bytecodes::_iastore: duke@435: case Bytecodes::_sastore: duke@435: { duke@435: pop_int(); duke@435: pop_int(); duke@435: pop_typeArray(); duke@435: // assert here? duke@435: break; duke@435: } duke@435: case Bytecodes::_bipush: duke@435: case Bytecodes::_iconst_m1: duke@435: case Bytecodes::_iconst_0: duke@435: case Bytecodes::_iconst_1: duke@435: case Bytecodes::_iconst_2: duke@435: case Bytecodes::_iconst_3: duke@435: case Bytecodes::_iconst_4: duke@435: case Bytecodes::_iconst_5: duke@435: case Bytecodes::_sipush: duke@435: { duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_checkcast: do_checkcast(str); break; duke@435: duke@435: case Bytecodes::_d2f: duke@435: { duke@435: pop_double(); duke@435: push_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_d2i: duke@435: { duke@435: pop_double(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_d2l: duke@435: { duke@435: pop_double(); duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_dadd: duke@435: case Bytecodes::_ddiv: duke@435: case Bytecodes::_dmul: duke@435: case Bytecodes::_drem: duke@435: case Bytecodes::_dsub: duke@435: { duke@435: pop_double(); duke@435: pop_double(); duke@435: push_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_daload: duke@435: { duke@435: pop_int(); duke@435: ciTypeArrayKlass* array_klass = pop_typeArray(); duke@435: // Put assert here for right type? duke@435: push_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_dastore: duke@435: { duke@435: pop_double(); duke@435: pop_int(); duke@435: pop_typeArray(); duke@435: // assert here? duke@435: break; duke@435: } duke@435: case Bytecodes::_dcmpg: duke@435: case Bytecodes::_dcmpl: duke@435: { duke@435: pop_double(); duke@435: pop_double(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_dconst_0: duke@435: case Bytecodes::_dconst_1: duke@435: { duke@435: push_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_dload: load_local_double(str->get_index()); break; duke@435: case Bytecodes::_dload_0: load_local_double(0); break; duke@435: case Bytecodes::_dload_1: load_local_double(1); break; duke@435: case Bytecodes::_dload_2: load_local_double(2); break; duke@435: case Bytecodes::_dload_3: load_local_double(3); break; duke@435: duke@435: case Bytecodes::_dneg: duke@435: { duke@435: pop_double(); duke@435: push_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_dreturn: duke@435: { duke@435: pop_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_dstore: store_local_double(str->get_index()); break; duke@435: case Bytecodes::_dstore_0: store_local_double(0); break; duke@435: case Bytecodes::_dstore_1: store_local_double(1); break; duke@435: case Bytecodes::_dstore_2: store_local_double(2); break; duke@435: case Bytecodes::_dstore_3: store_local_double(3); break; duke@435: duke@435: case Bytecodes::_dup: duke@435: { duke@435: push(type_at_tos()); duke@435: break; duke@435: } duke@435: case Bytecodes::_dup_x1: duke@435: { duke@435: ciType* value1 = pop_value(); duke@435: ciType* value2 = pop_value(); duke@435: push(value1); duke@435: push(value2); duke@435: push(value1); duke@435: break; duke@435: } duke@435: case Bytecodes::_dup_x2: duke@435: { duke@435: ciType* value1 = pop_value(); duke@435: ciType* value2 = pop_value(); duke@435: ciType* value3 = pop_value(); duke@435: push(value1); duke@435: push(value3); duke@435: push(value2); duke@435: push(value1); duke@435: break; duke@435: } duke@435: case Bytecodes::_dup2: duke@435: { duke@435: ciType* value1 = pop_value(); duke@435: ciType* value2 = pop_value(); duke@435: push(value2); duke@435: push(value1); duke@435: push(value2); duke@435: push(value1); duke@435: break; duke@435: } duke@435: case Bytecodes::_dup2_x1: duke@435: { duke@435: ciType* value1 = pop_value(); duke@435: ciType* value2 = pop_value(); duke@435: ciType* value3 = pop_value(); duke@435: push(value2); duke@435: push(value1); duke@435: push(value3); duke@435: push(value2); duke@435: push(value1); duke@435: break; duke@435: } duke@435: case Bytecodes::_dup2_x2: duke@435: { duke@435: ciType* value1 = pop_value(); duke@435: ciType* value2 = pop_value(); duke@435: ciType* value3 = pop_value(); duke@435: ciType* value4 = pop_value(); duke@435: push(value2); duke@435: push(value1); duke@435: push(value4); duke@435: push(value3); duke@435: push(value2); duke@435: push(value1); duke@435: break; duke@435: } duke@435: case Bytecodes::_f2d: duke@435: { duke@435: pop_float(); duke@435: push_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_f2i: duke@435: { duke@435: pop_float(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_f2l: duke@435: { duke@435: pop_float(); duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_fadd: duke@435: case Bytecodes::_fdiv: duke@435: case Bytecodes::_fmul: duke@435: case Bytecodes::_frem: duke@435: case Bytecodes::_fsub: duke@435: { duke@435: pop_float(); duke@435: pop_float(); duke@435: push_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_faload: duke@435: { duke@435: pop_int(); duke@435: ciTypeArrayKlass* array_klass = pop_typeArray(); duke@435: // Put assert here. duke@435: push_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_fastore: duke@435: { duke@435: pop_float(); duke@435: pop_int(); duke@435: ciTypeArrayKlass* array_klass = pop_typeArray(); duke@435: // Put assert here. duke@435: break; duke@435: } duke@435: case Bytecodes::_fcmpg: duke@435: case Bytecodes::_fcmpl: duke@435: { duke@435: pop_float(); duke@435: pop_float(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_fconst_0: duke@435: case Bytecodes::_fconst_1: duke@435: case Bytecodes::_fconst_2: duke@435: { duke@435: push_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_fload: load_local_float(str->get_index()); break; duke@435: case Bytecodes::_fload_0: load_local_float(0); break; duke@435: case Bytecodes::_fload_1: load_local_float(1); break; duke@435: case Bytecodes::_fload_2: load_local_float(2); break; duke@435: case Bytecodes::_fload_3: load_local_float(3); break; duke@435: duke@435: case Bytecodes::_fneg: duke@435: { duke@435: pop_float(); duke@435: push_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_freturn: duke@435: { duke@435: pop_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_fstore: store_local_float(str->get_index()); break; duke@435: case Bytecodes::_fstore_0: store_local_float(0); break; duke@435: case Bytecodes::_fstore_1: store_local_float(1); break; duke@435: case Bytecodes::_fstore_2: store_local_float(2); break; duke@435: case Bytecodes::_fstore_3: store_local_float(3); break; duke@435: duke@435: case Bytecodes::_getfield: do_getfield(str); break; duke@435: case Bytecodes::_getstatic: do_getstatic(str); break; duke@435: duke@435: case Bytecodes::_goto: duke@435: case Bytecodes::_goto_w: duke@435: case Bytecodes::_nop: duke@435: case Bytecodes::_return: duke@435: { duke@435: // do nothing. duke@435: break; duke@435: } duke@435: case Bytecodes::_i2b: duke@435: case Bytecodes::_i2c: duke@435: case Bytecodes::_i2s: duke@435: case Bytecodes::_ineg: duke@435: { duke@435: pop_int(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_i2d: duke@435: { duke@435: pop_int(); duke@435: push_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_i2f: duke@435: { duke@435: pop_int(); duke@435: push_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_i2l: duke@435: { duke@435: pop_int(); duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_iadd: duke@435: case Bytecodes::_iand: duke@435: case Bytecodes::_idiv: duke@435: case Bytecodes::_imul: duke@435: case Bytecodes::_ior: duke@435: case Bytecodes::_irem: duke@435: case Bytecodes::_ishl: duke@435: case Bytecodes::_ishr: duke@435: case Bytecodes::_isub: duke@435: case Bytecodes::_iushr: duke@435: case Bytecodes::_ixor: duke@435: { duke@435: pop_int(); duke@435: pop_int(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_if_acmpeq: duke@435: case Bytecodes::_if_acmpne: duke@435: { duke@435: pop_object(); duke@435: pop_object(); duke@435: break; duke@435: } duke@435: case Bytecodes::_if_icmpeq: duke@435: case Bytecodes::_if_icmpge: duke@435: case Bytecodes::_if_icmpgt: duke@435: case Bytecodes::_if_icmple: duke@435: case Bytecodes::_if_icmplt: duke@435: case Bytecodes::_if_icmpne: duke@435: { duke@435: pop_int(); duke@435: pop_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_ifeq: duke@435: case Bytecodes::_ifle: duke@435: case Bytecodes::_iflt: duke@435: case Bytecodes::_ifge: duke@435: case Bytecodes::_ifgt: duke@435: case Bytecodes::_ifne: duke@435: case Bytecodes::_ireturn: duke@435: case Bytecodes::_lookupswitch: duke@435: case Bytecodes::_tableswitch: duke@435: { duke@435: pop_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_iinc: duke@435: { never@802: int lnum = str->get_index(); never@802: check_int(local(lnum)); never@802: store_to_local(lnum); duke@435: break; duke@435: } duke@435: case Bytecodes::_iload: load_local_int(str->get_index()); break; duke@435: case Bytecodes::_iload_0: load_local_int(0); break; duke@435: case Bytecodes::_iload_1: load_local_int(1); break; duke@435: case Bytecodes::_iload_2: load_local_int(2); break; duke@435: case Bytecodes::_iload_3: load_local_int(3); break; duke@435: duke@435: case Bytecodes::_instanceof: duke@435: { duke@435: // Check for uncommon trap: duke@435: do_checkcast(str); duke@435: pop_object(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_invokeinterface: do_invoke(str, true); break; duke@435: case Bytecodes::_invokespecial: do_invoke(str, true); break; duke@435: case Bytecodes::_invokestatic: do_invoke(str, false); break; duke@435: case Bytecodes::_invokevirtual: do_invoke(str, true); break; twisti@1572: case Bytecodes::_invokedynamic: do_invoke(str, false); break; duke@435: duke@435: case Bytecodes::_istore: store_local_int(str->get_index()); break; duke@435: case Bytecodes::_istore_0: store_local_int(0); break; duke@435: case Bytecodes::_istore_1: store_local_int(1); break; duke@435: case Bytecodes::_istore_2: store_local_int(2); break; duke@435: case Bytecodes::_istore_3: store_local_int(3); break; duke@435: duke@435: case Bytecodes::_jsr: duke@435: case Bytecodes::_jsr_w: do_jsr(str); break; duke@435: duke@435: case Bytecodes::_l2d: duke@435: { duke@435: pop_long(); duke@435: push_double(); duke@435: break; duke@435: } duke@435: case Bytecodes::_l2f: duke@435: { duke@435: pop_long(); duke@435: push_float(); duke@435: break; duke@435: } duke@435: case Bytecodes::_l2i: duke@435: { duke@435: pop_long(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_ladd: duke@435: case Bytecodes::_land: duke@435: case Bytecodes::_ldiv: duke@435: case Bytecodes::_lmul: duke@435: case Bytecodes::_lor: duke@435: case Bytecodes::_lrem: duke@435: case Bytecodes::_lsub: duke@435: case Bytecodes::_lxor: duke@435: { duke@435: pop_long(); duke@435: pop_long(); duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_laload: duke@435: { duke@435: pop_int(); duke@435: ciTypeArrayKlass* array_klass = pop_typeArray(); duke@435: // Put assert here for right type? duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_lastore: duke@435: { duke@435: pop_long(); duke@435: pop_int(); duke@435: pop_typeArray(); duke@435: // assert here? duke@435: break; duke@435: } duke@435: case Bytecodes::_lcmp: duke@435: { duke@435: pop_long(); duke@435: pop_long(); duke@435: push_int(); duke@435: break; duke@435: } duke@435: case Bytecodes::_lconst_0: duke@435: case Bytecodes::_lconst_1: duke@435: { duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_ldc: duke@435: case Bytecodes::_ldc_w: duke@435: case Bytecodes::_ldc2_w: duke@435: { duke@435: do_ldc(str); duke@435: break; duke@435: } duke@435: duke@435: case Bytecodes::_lload: load_local_long(str->get_index()); break; duke@435: case Bytecodes::_lload_0: load_local_long(0); break; duke@435: case Bytecodes::_lload_1: load_local_long(1); break; duke@435: case Bytecodes::_lload_2: load_local_long(2); break; duke@435: case Bytecodes::_lload_3: load_local_long(3); break; duke@435: duke@435: case Bytecodes::_lneg: duke@435: { duke@435: pop_long(); duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_lreturn: duke@435: { duke@435: pop_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_lshl: duke@435: case Bytecodes::_lshr: duke@435: case Bytecodes::_lushr: duke@435: { duke@435: pop_int(); duke@435: pop_long(); duke@435: push_long(); duke@435: break; duke@435: } duke@435: case Bytecodes::_lstore: store_local_long(str->get_index()); break; duke@435: case Bytecodes::_lstore_0: store_local_long(0); break; duke@435: case Bytecodes::_lstore_1: store_local_long(1); break; duke@435: case Bytecodes::_lstore_2: store_local_long(2); break; duke@435: case Bytecodes::_lstore_3: store_local_long(3); break; duke@435: duke@435: case Bytecodes::_multianewarray: do_multianewarray(str); break; duke@435: duke@435: case Bytecodes::_new: do_new(str); break; duke@435: duke@435: case Bytecodes::_newarray: do_newarray(str); break; duke@435: duke@435: case Bytecodes::_pop: duke@435: { duke@435: pop(); duke@435: break; duke@435: } duke@435: case Bytecodes::_pop2: duke@435: { duke@435: pop(); duke@435: pop(); duke@435: break; duke@435: } duke@435: duke@435: case Bytecodes::_putfield: do_putfield(str); break; duke@435: case Bytecodes::_putstatic: do_putstatic(str); break; duke@435: duke@435: case Bytecodes::_ret: do_ret(str); break; duke@435: duke@435: case Bytecodes::_swap: duke@435: { duke@435: ciType* value1 = pop_value(); duke@435: ciType* value2 = pop_value(); duke@435: push(value1); duke@435: push(value2); duke@435: break; duke@435: } duke@435: case Bytecodes::_wide: duke@435: default: duke@435: { duke@435: // The iterator should skip this. duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } duke@435: } duke@435: duke@435: if (CITraceTypeFlow) { duke@435: print_on(tty); duke@435: } duke@435: duke@435: return (_trap_bci != -1); duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::print_cell_on duke@435: void ciTypeFlow::StateVector::print_cell_on(outputStream* st, Cell c) const { duke@435: ciType* type = type_at(c); duke@435: if (type == top_type()) { duke@435: st->print("top"); duke@435: } else if (type == bottom_type()) { duke@435: st->print("bottom"); duke@435: } else if (type == null_type()) { duke@435: st->print("null"); duke@435: } else if (type == long2_type()) { duke@435: st->print("long2"); duke@435: } else if (type == double2_type()) { duke@435: st->print("double2"); duke@435: } else if (is_int(type)) { duke@435: st->print("int"); duke@435: } else if (is_long(type)) { duke@435: st->print("long"); duke@435: } else if (is_float(type)) { duke@435: st->print("float"); duke@435: } else if (is_double(type)) { duke@435: st->print("double"); duke@435: } else if (type->is_return_address()) { duke@435: st->print("address(%d)", type->as_return_address()->bci()); duke@435: } else { duke@435: if (type->is_klass()) { duke@435: type->as_klass()->name()->print_symbol_on(st); duke@435: } else { duke@435: st->print("UNEXPECTED TYPE"); duke@435: type->print(); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::StateVector::print_on duke@435: void ciTypeFlow::StateVector::print_on(outputStream* st) const { duke@435: int num_locals = _outer->max_locals(); duke@435: int num_stack = stack_size(); duke@435: int num_monitors = monitor_count(); duke@435: st->print_cr(" State : locals %d, stack %d, monitors %d", num_locals, num_stack, num_monitors); duke@435: if (num_stack >= 0) { duke@435: int i; duke@435: for (i = 0; i < num_locals; i++) { duke@435: st->print(" local %2d : ", i); duke@435: print_cell_on(st, local(i)); duke@435: st->cr(); duke@435: } duke@435: for (i = 0; i < num_stack; i++) { duke@435: st->print(" stack %2d : ", i); duke@435: print_cell_on(st, stack(i)); duke@435: st->cr(); duke@435: } duke@435: } duke@435: } duke@435: #endif duke@435: never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::SuccIter::next never@802: // never@802: void ciTypeFlow::SuccIter::next() { never@802: int succ_ct = _pred->successors()->length(); never@802: int next = _index + 1; never@802: if (next < succ_ct) { never@802: _index = next; never@802: _succ = _pred->successors()->at(next); never@802: return; never@802: } never@802: for (int i = next - succ_ct; i < _pred->exceptions()->length(); i++) { never@802: // Do not compile any code for unloaded exception types. never@802: // Following compiler passes are responsible for doing this also. never@802: ciInstanceKlass* exception_klass = _pred->exc_klasses()->at(i); never@802: if (exception_klass->is_loaded()) { never@802: _index = next; never@802: _succ = _pred->exceptions()->at(i); never@802: return; never@802: } never@802: next++; never@802: } never@802: _index = -1; never@802: _succ = NULL; never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::SuccIter::set_succ never@802: // never@802: void ciTypeFlow::SuccIter::set_succ(Block* succ) { never@802: int succ_ct = _pred->successors()->length(); never@802: if (_index < succ_ct) { never@802: _pred->successors()->at_put(_index, succ); never@802: } else { never@802: int idx = _index - succ_ct; never@802: _pred->exceptions()->at_put(idx, succ); never@802: } never@802: } never@802: duke@435: // ciTypeFlow::Block duke@435: // duke@435: // A basic block. duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::Block::Block duke@435: ciTypeFlow::Block::Block(ciTypeFlow* outer, duke@435: ciBlock *ciblk, duke@435: ciTypeFlow::JsrSet* jsrs) { duke@435: _ciblock = ciblk; duke@435: _exceptions = NULL; duke@435: _exc_klasses = NULL; duke@435: _successors = NULL; duke@435: _state = new (outer->arena()) StateVector(outer); duke@435: JsrSet* new_jsrs = duke@435: new (outer->arena()) JsrSet(outer->arena(), jsrs->size()); duke@435: jsrs->copy_into(new_jsrs); duke@435: _jsrs = new_jsrs; duke@435: _next = NULL; duke@435: _on_work_list = false; never@802: _backedge_copy = false; never@802: _exception_entry = false; duke@435: _trap_bci = -1; duke@435: _trap_index = 0; never@802: df_init(); duke@435: duke@435: if (CITraceTypeFlow) { duke@435: tty->print_cr(">> Created new block"); duke@435: print_on(tty); duke@435: } duke@435: duke@435: assert(this->outer() == outer, "outer link set up"); duke@435: assert(!outer->have_block_count(), "must not have mapped blocks yet"); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Block::df_init never@802: void ciTypeFlow::Block::df_init() { never@802: _pre_order = -1; assert(!has_pre_order(), ""); never@802: _post_order = -1; assert(!has_post_order(), ""); never@802: _loop = NULL; never@802: _irreducible_entry = false; never@802: _rpo_next = NULL; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::Block::successors duke@435: // duke@435: // Get the successors for this Block. duke@435: GrowableArray* duke@435: ciTypeFlow::Block::successors(ciBytecodeStream* str, duke@435: ciTypeFlow::StateVector* state, duke@435: ciTypeFlow::JsrSet* jsrs) { duke@435: if (_successors == NULL) { duke@435: if (CITraceTypeFlow) { duke@435: tty->print(">> Computing successors for block "); duke@435: print_value_on(tty); duke@435: tty->cr(); duke@435: } duke@435: duke@435: ciTypeFlow* analyzer = outer(); duke@435: Arena* arena = analyzer->arena(); duke@435: Block* block = NULL; duke@435: bool has_successor = !has_trap() && duke@435: (control() != ciBlock::fall_through_bci || limit() < analyzer->code_size()); duke@435: if (!has_successor) { duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 1, 0, NULL); duke@435: // No successors duke@435: } else if (control() == ciBlock::fall_through_bci) { duke@435: assert(str->cur_bci() == limit(), "bad block end"); duke@435: // This block simply falls through to the next. duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 1, 0, NULL); duke@435: duke@435: Block* block = analyzer->block_at(limit(), _jsrs); duke@435: assert(_successors->length() == FALL_THROUGH, ""); duke@435: _successors->append(block); duke@435: } else { duke@435: int current_bci = str->cur_bci(); duke@435: int next_bci = str->next_bci(); duke@435: int branch_bci = -1; duke@435: Block* target = NULL; duke@435: assert(str->next_bci() == limit(), "bad block end"); duke@435: // This block is not a simple fall-though. Interpret duke@435: // the current bytecode to find our successors. duke@435: switch (str->cur_bc()) { duke@435: case Bytecodes::_ifeq: case Bytecodes::_ifne: duke@435: case Bytecodes::_iflt: case Bytecodes::_ifge: duke@435: case Bytecodes::_ifgt: case Bytecodes::_ifle: duke@435: case Bytecodes::_if_icmpeq: case Bytecodes::_if_icmpne: duke@435: case Bytecodes::_if_icmplt: case Bytecodes::_if_icmpge: duke@435: case Bytecodes::_if_icmpgt: case Bytecodes::_if_icmple: duke@435: case Bytecodes::_if_acmpeq: case Bytecodes::_if_acmpne: duke@435: case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: duke@435: // Our successors are the branch target and the next bci. duke@435: branch_bci = str->get_dest(); duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 2, 0, NULL); duke@435: assert(_successors->length() == IF_NOT_TAKEN, ""); duke@435: _successors->append(analyzer->block_at(next_bci, jsrs)); duke@435: assert(_successors->length() == IF_TAKEN, ""); duke@435: _successors->append(analyzer->block_at(branch_bci, jsrs)); duke@435: break; duke@435: duke@435: case Bytecodes::_goto: duke@435: branch_bci = str->get_dest(); duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 1, 0, NULL); duke@435: assert(_successors->length() == GOTO_TARGET, ""); never@802: _successors->append(analyzer->block_at(branch_bci, jsrs)); duke@435: break; duke@435: duke@435: case Bytecodes::_jsr: duke@435: branch_bci = str->get_dest(); duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 1, 0, NULL); duke@435: assert(_successors->length() == GOTO_TARGET, ""); duke@435: _successors->append(analyzer->block_at(branch_bci, jsrs)); duke@435: break; duke@435: duke@435: case Bytecodes::_goto_w: duke@435: case Bytecodes::_jsr_w: duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 1, 0, NULL); duke@435: assert(_successors->length() == GOTO_TARGET, ""); duke@435: _successors->append(analyzer->block_at(str->get_far_dest(), jsrs)); duke@435: break; duke@435: duke@435: case Bytecodes::_tableswitch: { never@2462: Bytecode_tableswitch tableswitch(str); duke@435: never@2462: int len = tableswitch.length(); duke@435: _successors = duke@435: new (arena) GrowableArray(arena, len+1, 0, NULL); never@2462: int bci = current_bci + tableswitch.default_offset(); duke@435: Block* block = analyzer->block_at(bci, jsrs); duke@435: assert(_successors->length() == SWITCH_DEFAULT, ""); duke@435: _successors->append(block); duke@435: while (--len >= 0) { never@2462: int bci = current_bci + tableswitch.dest_offset_at(len); duke@435: block = analyzer->block_at(bci, jsrs); duke@435: assert(_successors->length() >= SWITCH_CASES, ""); duke@435: _successors->append_if_missing(block); duke@435: } duke@435: break; duke@435: } duke@435: duke@435: case Bytecodes::_lookupswitch: { never@2462: Bytecode_lookupswitch lookupswitch(str); duke@435: never@2462: int npairs = lookupswitch.number_of_pairs(); duke@435: _successors = duke@435: new (arena) GrowableArray(arena, npairs+1, 0, NULL); never@2462: int bci = current_bci + lookupswitch.default_offset(); duke@435: Block* block = analyzer->block_at(bci, jsrs); duke@435: assert(_successors->length() == SWITCH_DEFAULT, ""); duke@435: _successors->append(block); duke@435: while(--npairs >= 0) { never@2462: LookupswitchPair pair = lookupswitch.pair_at(npairs); never@2462: int bci = current_bci + pair.offset(); duke@435: Block* block = analyzer->block_at(bci, jsrs); duke@435: assert(_successors->length() >= SWITCH_CASES, ""); duke@435: _successors->append_if_missing(block); duke@435: } duke@435: break; duke@435: } duke@435: duke@435: case Bytecodes::_athrow: case Bytecodes::_ireturn: duke@435: case Bytecodes::_lreturn: case Bytecodes::_freturn: duke@435: case Bytecodes::_dreturn: case Bytecodes::_areturn: duke@435: case Bytecodes::_return: duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 1, 0, NULL); duke@435: // No successors duke@435: break; duke@435: duke@435: case Bytecodes::_ret: { duke@435: _successors = duke@435: new (arena) GrowableArray(arena, 1, 0, NULL); duke@435: duke@435: Cell local = state->local(str->get_index()); duke@435: ciType* return_address = state->type_at(local); duke@435: assert(return_address->is_return_address(), "verify: wrong type"); duke@435: int bci = return_address->as_return_address()->bci(); duke@435: assert(_successors->length() == GOTO_TARGET, ""); duke@435: _successors->append(analyzer->block_at(bci, jsrs)); duke@435: break; duke@435: } duke@435: duke@435: case Bytecodes::_wide: duke@435: default: duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } duke@435: } duke@435: } duke@435: return _successors; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::Block:compute_exceptions duke@435: // duke@435: // Compute the exceptional successors and types for this Block. duke@435: void ciTypeFlow::Block::compute_exceptions() { duke@435: assert(_exceptions == NULL && _exc_klasses == NULL, "repeat"); duke@435: duke@435: if (CITraceTypeFlow) { duke@435: tty->print(">> Computing exceptions for block "); duke@435: print_value_on(tty); duke@435: tty->cr(); duke@435: } duke@435: duke@435: ciTypeFlow* analyzer = outer(); duke@435: Arena* arena = analyzer->arena(); duke@435: duke@435: // Any bci in the block will do. duke@435: ciExceptionHandlerStream str(analyzer->method(), start()); duke@435: duke@435: // Allocate our growable arrays. duke@435: int exc_count = str.count(); duke@435: _exceptions = new (arena) GrowableArray(arena, exc_count, 0, NULL); duke@435: _exc_klasses = new (arena) GrowableArray(arena, exc_count, duke@435: 0, NULL); duke@435: duke@435: for ( ; !str.is_done(); str.next()) { duke@435: ciExceptionHandler* handler = str.handler(); duke@435: int bci = handler->handler_bci(); duke@435: ciInstanceKlass* klass = NULL; duke@435: if (bci == -1) { duke@435: // There is no catch all. It is possible to exit the method. duke@435: break; duke@435: } duke@435: if (handler->is_catch_all()) { duke@435: klass = analyzer->env()->Throwable_klass(); duke@435: } else { duke@435: klass = handler->catch_klass(); duke@435: } duke@435: _exceptions->append(analyzer->block_at(bci, _jsrs)); duke@435: _exc_klasses->append(klass); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Block::set_backedge_copy never@802: // Use this only to make a pre-existing public block into a backedge copy. never@802: void ciTypeFlow::Block::set_backedge_copy(bool z) { never@802: assert(z || (z == is_backedge_copy()), "cannot make a backedge copy public"); never@802: _backedge_copy = z; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Block::is_clonable_exit never@802: // never@802: // At most 2 normal successors, one of which continues looping, never@802: // and all exceptional successors must exit. never@802: bool ciTypeFlow::Block::is_clonable_exit(ciTypeFlow::Loop* lp) { never@802: int normal_cnt = 0; never@802: int in_loop_cnt = 0; never@802: for (SuccIter iter(this); !iter.done(); iter.next()) { never@802: Block* succ = iter.succ(); never@802: if (iter.is_normal_ctrl()) { never@802: if (++normal_cnt > 2) return false; never@802: if (lp->contains(succ->loop())) { never@802: if (++in_loop_cnt > 1) return false; never@802: } never@802: } else { never@802: if (lp->contains(succ->loop())) return false; never@802: } never@802: } never@802: return in_loop_cnt == 1; never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Block::looping_succ never@802: // never@802: ciTypeFlow::Block* ciTypeFlow::Block::looping_succ(ciTypeFlow::Loop* lp) { never@802: assert(successors()->length() <= 2, "at most 2 normal successors"); never@802: for (SuccIter iter(this); !iter.done(); iter.next()) { never@802: Block* succ = iter.succ(); never@802: if (lp->contains(succ->loop())) { never@802: return succ; never@802: } never@802: } never@802: return NULL; duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::Block::print_value_on duke@435: void ciTypeFlow::Block::print_value_on(outputStream* st) const { never@802: if (has_pre_order()) st->print("#%-2d ", pre_order()); never@802: if (has_rpo()) st->print("rpo#%-2d ", rpo()); duke@435: st->print("[%d - %d)", start(), limit()); never@802: if (is_loop_head()) st->print(" lphd"); never@802: if (is_irreducible_entry()) st->print(" irred"); duke@435: if (_jsrs->size() > 0) { st->print("/"); _jsrs->print_on(st); } never@802: if (is_backedge_copy()) st->print("/backedge_copy"); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::Block::print_on duke@435: void ciTypeFlow::Block::print_on(outputStream* st) const { duke@435: if ((Verbose || WizardMode)) { duke@435: outer()->method()->print_codes_on(start(), limit(), st); duke@435: } duke@435: st->print_cr(" ==================================================== "); duke@435: st->print (" "); duke@435: print_value_on(st); never@802: st->print(" Stored locals: "); def_locals()->print_on(st, outer()->method()->max_locals()); tty->cr(); never@802: if (loop() && loop()->parent() != NULL) { never@802: st->print(" loops:"); never@802: Loop* lp = loop(); never@802: do { never@802: st->print(" %d<-%d", lp->head()->pre_order(),lp->tail()->pre_order()); never@802: if (lp->is_irreducible()) st->print("(ir)"); never@802: lp = lp->parent(); never@802: } while (lp->parent() != NULL); never@802: } duke@435: st->cr(); duke@435: _state->print_on(st); duke@435: if (_successors == NULL) { duke@435: st->print_cr(" No successor information"); duke@435: } else { duke@435: int num_successors = _successors->length(); duke@435: st->print_cr(" Successors : %d", num_successors); duke@435: for (int i = 0; i < num_successors; i++) { duke@435: Block* successor = _successors->at(i); duke@435: st->print(" "); duke@435: successor->print_value_on(st); duke@435: st->cr(); duke@435: } duke@435: } duke@435: if (_exceptions == NULL) { duke@435: st->print_cr(" No exception information"); duke@435: } else { duke@435: int num_exceptions = _exceptions->length(); duke@435: st->print_cr(" Exceptions : %d", num_exceptions); duke@435: for (int i = 0; i < num_exceptions; i++) { duke@435: Block* exc_succ = _exceptions->at(i); duke@435: ciInstanceKlass* exc_klass = _exc_klasses->at(i); duke@435: st->print(" "); duke@435: exc_succ->print_value_on(st); duke@435: st->print(" -- "); duke@435: exc_klass->name()->print_symbol_on(st); duke@435: st->cr(); duke@435: } duke@435: } duke@435: if (has_trap()) { duke@435: st->print_cr(" Traps on %d with trap index %d", trap_bci(), trap_index()); duke@435: } duke@435: st->print_cr(" ==================================================== "); duke@435: } duke@435: #endif duke@435: never@802: #ifndef PRODUCT never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::LocalSet::print_on never@802: void ciTypeFlow::LocalSet::print_on(outputStream* st, int limit) const { never@802: st->print("{"); never@802: for (int i = 0; i < max; i++) { never@802: if (test(i)) st->print(" %d", i); never@802: } never@802: if (limit > max) { never@802: st->print(" %d..%d ", max, limit); never@802: } never@802: st->print(" }"); never@802: } never@802: #endif never@802: duke@435: // ciTypeFlow duke@435: // duke@435: // This is a pass over the bytecodes which computes the following: duke@435: // basic block structure duke@435: // interpreter type-states (a la the verifier) duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::ciTypeFlow duke@435: ciTypeFlow::ciTypeFlow(ciEnv* env, ciMethod* method, int osr_bci) { duke@435: _env = env; duke@435: _method = method; duke@435: _methodBlocks = method->get_method_blocks(); duke@435: _max_locals = method->max_locals(); duke@435: _max_stack = method->max_stack(); duke@435: _code_size = method->code_size(); never@802: _has_irreducible_entry = false; duke@435: _osr_bci = osr_bci; duke@435: _failure_reason = NULL; twisti@2201: assert(0 <= start_bci() && start_bci() < code_size() , err_msg("correct osr_bci argument: 0 <= %d < %d", start_bci(), code_size())); duke@435: _work_list = NULL; duke@435: duke@435: _ciblock_count = _methodBlocks->num_blocks(); duke@435: _idx_to_blocklist = NEW_ARENA_ARRAY(arena(), GrowableArray*, _ciblock_count); duke@435: for (int i = 0; i < _ciblock_count; i++) { duke@435: _idx_to_blocklist[i] = NULL; duke@435: } duke@435: _block_map = NULL; // until all blocks are seen duke@435: _jsr_count = 0; duke@435: _jsr_records = NULL; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::work_list_next duke@435: // duke@435: // Get the next basic block from our work list. duke@435: ciTypeFlow::Block* ciTypeFlow::work_list_next() { duke@435: assert(!work_list_empty(), "work list must not be empty"); duke@435: Block* next_block = _work_list; duke@435: _work_list = next_block->next(); duke@435: next_block->set_next(NULL); duke@435: next_block->set_on_work_list(false); duke@435: return next_block; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::add_to_work_list duke@435: // duke@435: // Add a basic block to our work list. never@802: // List is sorted by decreasing postorder sort (same as increasing RPO) duke@435: void ciTypeFlow::add_to_work_list(ciTypeFlow::Block* block) { duke@435: assert(!block->is_on_work_list(), "must not already be on work list"); duke@435: duke@435: if (CITraceTypeFlow) { never@802: tty->print(">> Adding block "); duke@435: block->print_value_on(tty); duke@435: tty->print_cr(" to the work list : "); duke@435: } duke@435: duke@435: block->set_on_work_list(true); never@802: never@802: // decreasing post order sort never@802: never@802: Block* prev = NULL; never@802: Block* current = _work_list; never@802: int po = block->post_order(); never@802: while (current != NULL) { never@802: if (!current->has_post_order() || po > current->post_order()) never@802: break; never@802: prev = current; never@802: current = current->next(); never@802: } never@802: if (prev == NULL) { duke@435: block->set_next(_work_list); duke@435: _work_list = block; duke@435: } else { never@802: block->set_next(current); never@802: prev->set_next(block); duke@435: } never@802: duke@435: if (CITraceTypeFlow) { duke@435: tty->cr(); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::block_at duke@435: // duke@435: // Return the block beginning at bci which has a JsrSet compatible duke@435: // with jsrs. duke@435: ciTypeFlow::Block* ciTypeFlow::block_at(int bci, ciTypeFlow::JsrSet* jsrs, CreateOption option) { duke@435: // First find the right ciBlock. duke@435: if (CITraceTypeFlow) { duke@435: tty->print(">> Requesting block for %d/", bci); duke@435: jsrs->print_on(tty); duke@435: tty->cr(); duke@435: } duke@435: duke@435: ciBlock* ciblk = _methodBlocks->block_containing(bci); duke@435: assert(ciblk->start_bci() == bci, "bad ciBlock boundaries"); duke@435: Block* block = get_block_for(ciblk->index(), jsrs, option); duke@435: never@802: assert(block == NULL? (option == no_create): block->is_backedge_copy() == (option == create_backedge_copy), "create option consistent with result"); duke@435: duke@435: if (CITraceTypeFlow) { duke@435: if (block != NULL) { duke@435: tty->print(">> Found block "); duke@435: block->print_value_on(tty); duke@435: tty->cr(); duke@435: } else { duke@435: tty->print_cr(">> No such block."); duke@435: } duke@435: } duke@435: duke@435: return block; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::make_jsr_record duke@435: // duke@435: // Make a JsrRecord for a given (entry, return) pair, if such a record duke@435: // does not already exist. duke@435: ciTypeFlow::JsrRecord* ciTypeFlow::make_jsr_record(int entry_address, duke@435: int return_address) { duke@435: if (_jsr_records == NULL) { duke@435: _jsr_records = new (arena()) GrowableArray(arena(), duke@435: _jsr_count, duke@435: 0, duke@435: NULL); duke@435: } duke@435: JsrRecord* record = NULL; duke@435: int len = _jsr_records->length(); duke@435: for (int i = 0; i < len; i++) { duke@435: JsrRecord* record = _jsr_records->at(i); duke@435: if (record->entry_address() == entry_address && duke@435: record->return_address() == return_address) { duke@435: return record; duke@435: } duke@435: } duke@435: duke@435: record = new (arena()) JsrRecord(entry_address, return_address); duke@435: _jsr_records->append(record); duke@435: return record; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::flow_exceptions duke@435: // duke@435: // Merge the current state into all exceptional successors at the duke@435: // current point in the code. duke@435: void ciTypeFlow::flow_exceptions(GrowableArray* exceptions, duke@435: GrowableArray* exc_klasses, duke@435: ciTypeFlow::StateVector* state) { duke@435: int len = exceptions->length(); duke@435: assert(exc_klasses->length() == len, "must have same length"); duke@435: for (int i = 0; i < len; i++) { duke@435: Block* block = exceptions->at(i); duke@435: ciInstanceKlass* exception_klass = exc_klasses->at(i); duke@435: duke@435: if (!exception_klass->is_loaded()) { duke@435: // Do not compile any code for unloaded exception types. duke@435: // Following compiler passes are responsible for doing this also. duke@435: continue; duke@435: } duke@435: duke@435: if (block->meet_exception(exception_klass, state)) { never@802: // Block was modified and has PO. Add it to the work list. never@802: if (block->has_post_order() && never@802: !block->is_on_work_list()) { duke@435: add_to_work_list(block); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::flow_successors duke@435: // duke@435: // Merge the current state into all successors at the current point duke@435: // in the code. duke@435: void ciTypeFlow::flow_successors(GrowableArray* successors, duke@435: ciTypeFlow::StateVector* state) { duke@435: int len = successors->length(); duke@435: for (int i = 0; i < len; i++) { duke@435: Block* block = successors->at(i); duke@435: if (block->meet(state)) { never@802: // Block was modified and has PO. Add it to the work list. never@802: if (block->has_post_order() && never@802: !block->is_on_work_list()) { duke@435: add_to_work_list(block); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::can_trap duke@435: // duke@435: // Tells if a given instruction is able to generate an exception edge. duke@435: bool ciTypeFlow::can_trap(ciBytecodeStream& str) { duke@435: // Cf. GenerateOopMap::do_exception_edge. duke@435: if (!Bytecodes::can_trap(str.cur_bc())) return false; duke@435: duke@435: switch (str.cur_bc()) { jrose@1920: // %%% FIXME: ldc of Class can generate an exception duke@435: case Bytecodes::_ldc: duke@435: case Bytecodes::_ldc_w: duke@435: case Bytecodes::_ldc2_w: duke@435: case Bytecodes::_aload_0: duke@435: // These bytecodes can trap for rewriting. We need to assume that duke@435: // they do not throw exceptions to make the monitor analysis work. duke@435: return false; duke@435: duke@435: case Bytecodes::_ireturn: duke@435: case Bytecodes::_lreturn: duke@435: case Bytecodes::_freturn: duke@435: case Bytecodes::_dreturn: duke@435: case Bytecodes::_areturn: duke@435: case Bytecodes::_return: duke@435: // We can assume the monitor stack is empty in this analysis. duke@435: return false; duke@435: duke@435: case Bytecodes::_monitorexit: duke@435: // We can assume monitors are matched in this analysis. duke@435: return false; duke@435: } duke@435: duke@435: return true; duke@435: } duke@435: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::clone_loop_heads never@802: // never@802: // Clone the loop heads never@802: bool ciTypeFlow::clone_loop_heads(Loop* lp, StateVector* temp_vector, JsrSet* temp_set) { never@802: bool rslt = false; never@802: for (PreorderLoops iter(loop_tree_root()); !iter.done(); iter.next()) { never@802: lp = iter.current(); never@802: Block* head = lp->head(); never@802: if (lp == loop_tree_root() || never@802: lp->is_irreducible() || never@802: !head->is_clonable_exit(lp)) never@802: continue; never@802: never@802: // check not already cloned never@802: if (head->backedge_copy_count() != 0) never@802: continue; never@802: never@802: // check _no_ shared head below us never@802: Loop* ch; never@802: for (ch = lp->child(); ch != NULL && ch->head() != head; ch = ch->sibling()); never@802: if (ch != NULL) never@802: continue; never@802: never@802: // Clone head never@802: Block* new_head = head->looping_succ(lp); never@802: Block* clone = clone_loop_head(lp, temp_vector, temp_set); never@802: // Update lp's info never@802: clone->set_loop(lp); never@802: lp->set_head(new_head); never@802: lp->set_tail(clone); never@802: // And move original head into outer loop never@802: head->set_loop(lp->parent()); never@802: never@802: rslt = true; never@802: } never@802: return rslt; never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::clone_loop_head never@802: // never@802: // Clone lp's head and replace tail's successors with clone. never@802: // never@802: // | never@802: // v never@802: // head <-> body never@802: // | never@802: // v never@802: // exit never@802: // never@802: // new_head never@802: // never@802: // | never@802: // v never@802: // head ----------\ never@802: // | | never@802: // | v never@802: // | clone <-> body never@802: // | | never@802: // | /--/ never@802: // | | never@802: // v v never@802: // exit never@802: // never@802: ciTypeFlow::Block* ciTypeFlow::clone_loop_head(Loop* lp, StateVector* temp_vector, JsrSet* temp_set) { never@802: Block* head = lp->head(); never@802: Block* tail = lp->tail(); never@802: if (CITraceTypeFlow) { never@802: tty->print(">> Requesting clone of loop head "); head->print_value_on(tty); never@802: tty->print(" for predecessor "); tail->print_value_on(tty); never@802: tty->cr(); never@802: } never@802: Block* clone = block_at(head->start(), head->jsrs(), create_backedge_copy); never@802: assert(clone->backedge_copy_count() == 1, "one backedge copy for all back edges"); never@802: never@802: assert(!clone->has_pre_order(), "just created"); never@802: clone->set_next_pre_order(); never@802: never@802: // Insert clone after (orig) tail in reverse post order never@802: clone->set_rpo_next(tail->rpo_next()); never@802: tail->set_rpo_next(clone); never@802: never@802: // tail->head becomes tail->clone never@802: for (SuccIter iter(tail); !iter.done(); iter.next()) { never@802: if (iter.succ() == head) { never@802: iter.set_succ(clone); never@802: } never@802: } never@802: flow_block(tail, temp_vector, temp_set); never@802: if (head == tail) { never@802: // For self-loops, clone->head becomes clone->clone never@802: flow_block(clone, temp_vector, temp_set); never@802: for (SuccIter iter(clone); !iter.done(); iter.next()) { never@802: if (iter.succ() == head) { never@802: iter.set_succ(clone); never@802: break; never@802: } never@802: } never@802: } never@802: flow_block(clone, temp_vector, temp_set); never@802: never@802: return clone; never@802: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::flow_block duke@435: // duke@435: // Interpret the effects of the bytecodes on the incoming state duke@435: // vector of a basic block. Push the changed state to succeeding duke@435: // basic blocks. duke@435: void ciTypeFlow::flow_block(ciTypeFlow::Block* block, duke@435: ciTypeFlow::StateVector* state, duke@435: ciTypeFlow::JsrSet* jsrs) { duke@435: if (CITraceTypeFlow) { duke@435: tty->print("\n>> ANALYZING BLOCK : "); duke@435: tty->cr(); duke@435: block->print_on(tty); duke@435: } duke@435: assert(block->has_pre_order(), "pre-order is assigned before 1st flow"); duke@435: duke@435: int start = block->start(); duke@435: int limit = block->limit(); duke@435: int control = block->control(); duke@435: if (control != ciBlock::fall_through_bci) { duke@435: limit = control; duke@435: } duke@435: duke@435: // Grab the state from the current block. duke@435: block->copy_state_into(state); never@802: state->def_locals()->clear(); duke@435: duke@435: GrowableArray* exceptions = block->exceptions(); duke@435: GrowableArray* exc_klasses = block->exc_klasses(); duke@435: bool has_exceptions = exceptions->length() > 0; duke@435: never@802: bool exceptions_used = false; never@802: duke@435: ciBytecodeStream str(method()); duke@435: str.reset_to_bci(start); duke@435: Bytecodes::Code code; duke@435: while ((code = str.next()) != ciBytecodeStream::EOBC() && duke@435: str.cur_bci() < limit) { duke@435: // Check for exceptional control flow from this point. duke@435: if (has_exceptions && can_trap(str)) { duke@435: flow_exceptions(exceptions, exc_klasses, state); never@802: exceptions_used = true; duke@435: } duke@435: // Apply the effects of the current bytecode to our state. duke@435: bool res = state->apply_one_bytecode(&str); duke@435: duke@435: // Watch for bailouts. duke@435: if (failing()) return; duke@435: duke@435: if (res) { duke@435: duke@435: // We have encountered a trap. Record it in this block. duke@435: block->set_trap(state->trap_bci(), state->trap_index()); duke@435: duke@435: if (CITraceTypeFlow) { duke@435: tty->print_cr(">> Found trap"); duke@435: block->print_on(tty); duke@435: } duke@435: never@802: // Save set of locals defined in this block never@802: block->def_locals()->add(state->def_locals()); never@802: duke@435: // Record (no) successors. duke@435: block->successors(&str, state, jsrs); duke@435: never@802: assert(!has_exceptions || exceptions_used, "Not removing exceptions"); never@802: duke@435: // Discontinue interpretation of this Block. duke@435: return; duke@435: } duke@435: } duke@435: duke@435: GrowableArray* successors = NULL; duke@435: if (control != ciBlock::fall_through_bci) { duke@435: // Check for exceptional control flow from this point. duke@435: if (has_exceptions && can_trap(str)) { duke@435: flow_exceptions(exceptions, exc_klasses, state); never@802: exceptions_used = true; duke@435: } duke@435: duke@435: // Fix the JsrSet to reflect effect of the bytecode. duke@435: block->copy_jsrs_into(jsrs); duke@435: jsrs->apply_control(this, &str, state); duke@435: duke@435: // Find successor edges based on old state and new JsrSet. duke@435: successors = block->successors(&str, state, jsrs); duke@435: duke@435: // Apply the control changes to the state. duke@435: state->apply_one_bytecode(&str); duke@435: } else { duke@435: // Fall through control duke@435: successors = block->successors(&str, NULL, NULL); duke@435: } duke@435: never@802: // Save set of locals defined in this block never@802: block->def_locals()->add(state->def_locals()); never@802: never@802: // Remove untaken exception paths never@802: if (!exceptions_used) never@802: exceptions->clear(); never@802: duke@435: // Pass our state to successors. duke@435: flow_successors(successors, state); duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ never@802: // ciTypeFlow::PostOrderLoops::next never@802: // never@802: // Advance to next loop tree using a postorder, left-to-right traversal. never@802: void ciTypeFlow::PostorderLoops::next() { never@802: assert(!done(), "must not be done."); never@802: if (_current->sibling() != NULL) { never@802: _current = _current->sibling(); never@802: while (_current->child() != NULL) { never@802: _current = _current->child(); never@802: } never@802: } else { never@802: _current = _current->parent(); never@802: } never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::PreOrderLoops::next never@802: // never@802: // Advance to next loop tree using a preorder, left-to-right traversal. never@802: void ciTypeFlow::PreorderLoops::next() { never@802: assert(!done(), "must not be done."); never@802: if (_current->child() != NULL) { never@802: _current = _current->child(); never@802: } else if (_current->sibling() != NULL) { never@802: _current = _current->sibling(); never@802: } else { never@802: while (_current != _root && _current->sibling() == NULL) { never@802: _current = _current->parent(); never@802: } never@802: if (_current == _root) { never@802: _current = NULL; never@802: assert(done(), "must be done."); never@802: } else { never@802: assert(_current->sibling() != NULL, "must be more to do"); never@802: _current = _current->sibling(); never@802: } never@802: } never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Loop::sorted_merge never@802: // never@802: // Merge the branch lp into this branch, sorting on the loop head never@802: // pre_orders. Returns the leaf of the merged branch. never@802: // Child and sibling pointers will be setup later. never@802: // Sort is (looking from leaf towards the root) never@802: // descending on primary key: loop head's pre_order, and never@802: // ascending on secondary key: loop tail's pre_order. never@802: ciTypeFlow::Loop* ciTypeFlow::Loop::sorted_merge(Loop* lp) { never@802: Loop* leaf = this; never@802: Loop* prev = NULL; never@802: Loop* current = leaf; never@802: while (lp != NULL) { never@802: int lp_pre_order = lp->head()->pre_order(); never@802: // Find insertion point for "lp" never@802: while (current != NULL) { never@802: if (current == lp) never@802: return leaf; // Already in list never@802: if (current->head()->pre_order() < lp_pre_order) never@802: break; never@802: if (current->head()->pre_order() == lp_pre_order && never@802: current->tail()->pre_order() > lp->tail()->pre_order()) { never@802: break; never@802: } never@802: prev = current; never@802: current = current->parent(); never@802: } never@802: Loop* next_lp = lp->parent(); // Save future list of items to insert never@802: // Insert lp before current never@802: lp->set_parent(current); never@802: if (prev != NULL) { never@802: prev->set_parent(lp); never@802: } else { never@802: leaf = lp; never@802: } never@802: prev = lp; // Inserted item is new prev[ious] never@802: lp = next_lp; // Next item to insert never@802: } never@802: return leaf; never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::build_loop_tree never@802: // never@802: // Incrementally build loop tree. never@802: void ciTypeFlow::build_loop_tree(Block* blk) { never@802: assert(!blk->is_post_visited(), "precondition"); never@802: Loop* innermost = NULL; // merge of loop tree branches over all successors never@802: never@802: for (SuccIter iter(blk); !iter.done(); iter.next()) { never@802: Loop* lp = NULL; never@802: Block* succ = iter.succ(); never@802: if (!succ->is_post_visited()) { never@802: // Found backedge since predecessor post visited, but successor is not never@802: assert(succ->pre_order() <= blk->pre_order(), "should be backedge"); never@802: never@802: // Create a LoopNode to mark this loop. never@802: lp = new (arena()) Loop(succ, blk); never@802: if (succ->loop() == NULL) never@802: succ->set_loop(lp); never@802: // succ->loop will be updated to innermost loop on a later call, when blk==succ never@802: never@802: } else { // Nested loop never@802: lp = succ->loop(); never@802: never@802: // If succ is loop head, find outer loop. never@802: while (lp != NULL && lp->head() == succ) { never@802: lp = lp->parent(); never@802: } never@802: if (lp == NULL) { never@802: // Infinite loop, it's parent is the root never@802: lp = loop_tree_root(); never@802: } never@802: } never@802: never@802: // Check for irreducible loop. never@802: // Successor has already been visited. If the successor's loop head never@802: // has already been post-visited, then this is another entry into the loop. never@802: while (lp->head()->is_post_visited() && lp != loop_tree_root()) { never@802: _has_irreducible_entry = true; never@802: lp->set_irreducible(succ); never@802: if (!succ->is_on_work_list()) { never@802: // Assume irreducible entries need more data flow never@802: add_to_work_list(succ); never@802: } never@1426: Loop* plp = lp->parent(); never@1426: if (plp == NULL) { never@1426: // This only happens for some irreducible cases. The parent never@1426: // will be updated during a later pass. never@1426: break; never@1426: } never@1426: lp = plp; never@802: } never@802: never@802: // Merge loop tree branch for all successors. never@802: innermost = innermost == NULL ? lp : innermost->sorted_merge(lp); never@802: never@802: } // end loop never@802: never@802: if (innermost == NULL) { never@802: assert(blk->successors()->length() == 0, "CFG exit"); never@802: blk->set_loop(loop_tree_root()); never@802: } else if (innermost->head() == blk) { never@802: // If loop header, complete the tree pointers never@802: if (blk->loop() != innermost) { never@802: #if ASSERT never@802: assert(blk->loop()->head() == innermost->head(), "same head"); never@802: Loop* dl; never@802: for (dl = innermost; dl != NULL && dl != blk->loop(); dl = dl->parent()); never@802: assert(dl == blk->loop(), "blk->loop() already in innermost list"); never@802: #endif never@802: blk->set_loop(innermost); never@802: } never@802: innermost->def_locals()->add(blk->def_locals()); never@802: Loop* l = innermost; never@802: Loop* p = l->parent(); never@802: while (p && l->head() == blk) { never@802: l->set_sibling(p->child()); // Put self on parents 'next child' never@802: p->set_child(l); // Make self the first child of parent never@802: p->def_locals()->add(l->def_locals()); never@802: l = p; // Walk up the parent chain never@802: p = l->parent(); never@802: } never@802: } else { never@802: blk->set_loop(innermost); never@802: innermost->def_locals()->add(blk->def_locals()); never@802: } never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Loop::contains never@802: // never@802: // Returns true if lp is nested loop. never@802: bool ciTypeFlow::Loop::contains(ciTypeFlow::Loop* lp) const { never@802: assert(lp != NULL, ""); never@802: if (this == lp || head() == lp->head()) return true; never@802: int depth1 = depth(); never@802: int depth2 = lp->depth(); never@802: if (depth1 > depth2) never@802: return false; never@802: while (depth1 < depth2) { never@802: depth2--; never@802: lp = lp->parent(); never@802: } never@802: return this == lp; never@802: } never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Loop::depth never@802: // never@802: // Loop depth never@802: int ciTypeFlow::Loop::depth() const { never@802: int dp = 0; never@802: for (Loop* lp = this->parent(); lp != NULL; lp = lp->parent()) never@802: dp++; never@802: return dp; never@802: } never@802: never@802: #ifndef PRODUCT never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::Loop::print never@802: void ciTypeFlow::Loop::print(outputStream* st, int indent) const { never@802: for (int i = 0; i < indent; i++) st->print(" "); never@802: st->print("%d<-%d %s", never@802: is_root() ? 0 : this->head()->pre_order(), never@802: is_root() ? 0 : this->tail()->pre_order(), never@802: is_irreducible()?" irr":""); never@802: st->print(" defs: "); never@802: def_locals()->print_on(st, _head->outer()->method()->max_locals()); never@802: st->cr(); never@802: for (Loop* ch = child(); ch != NULL; ch = ch->sibling()) never@802: ch->print(st, indent+2); never@802: } never@802: #endif never@802: never@802: // ------------------------------------------------------------------ never@802: // ciTypeFlow::df_flow_types never@802: // never@802: // Perform the depth first type flow analysis. Helper for flow_types. never@802: void ciTypeFlow::df_flow_types(Block* start, never@802: bool do_flow, never@802: StateVector* temp_vector, never@802: JsrSet* temp_set) { never@802: int dft_len = 100; kvn@2040: GrowableArray stk(dft_len); never@802: never@802: ciBlock* dummy = _methodBlocks->make_dummy_block(); never@802: JsrSet* root_set = new JsrSet(NULL, 0); never@802: Block* root_head = new (arena()) Block(this, dummy, root_set); never@802: Block* root_tail = new (arena()) Block(this, dummy, root_set); never@802: root_head->set_pre_order(0); never@802: root_head->set_post_order(0); never@802: root_tail->set_pre_order(max_jint); never@802: root_tail->set_post_order(max_jint); never@802: set_loop_tree_root(new (arena()) Loop(root_head, root_tail)); never@802: never@802: stk.push(start); never@802: never@802: _next_pre_order = 0; // initialize pre_order counter never@802: _rpo_list = NULL; never@802: int next_po = 0; // initialize post_order counter never@802: never@802: // Compute RPO and the control flow graph never@802: int size; never@802: while ((size = stk.length()) > 0) { never@802: Block* blk = stk.top(); // Leave node on stack never@802: if (!blk->is_visited()) { never@802: // forward arc in graph never@802: assert (!blk->has_pre_order(), ""); never@802: blk->set_next_pre_order(); never@802: never@802: if (_next_pre_order >= MaxNodeLimit / 2) { never@802: // Too many basic blocks. Bail out. never@802: // This can happen when try/finally constructs are nested to depth N, never@802: // and there is O(2**N) cloning of jsr bodies. See bug 4697245! never@802: // "MaxNodeLimit / 2" is used because probably the parser will never@802: // generate at least twice that many nodes and bail out. never@802: record_failure("too many basic blocks"); never@802: return; never@802: } never@802: if (do_flow) { never@802: flow_block(blk, temp_vector, temp_set); never@802: if (failing()) return; // Watch for bailouts. never@802: } never@802: } else if (!blk->is_post_visited()) { never@802: // cross or back arc never@802: for (SuccIter iter(blk); !iter.done(); iter.next()) { never@802: Block* succ = iter.succ(); never@802: if (!succ->is_visited()) { never@802: stk.push(succ); never@802: } never@802: } never@802: if (stk.length() == size) { never@802: // There were no additional children, post visit node now never@802: stk.pop(); // Remove node from stack never@802: never@802: build_loop_tree(blk); never@802: blk->set_post_order(next_po++); // Assign post order never@802: prepend_to_rpo_list(blk); never@802: assert(blk->is_post_visited(), ""); never@802: never@802: if (blk->is_loop_head() && !blk->is_on_work_list()) { never@802: // Assume loop heads need more data flow never@802: add_to_work_list(blk); never@802: } never@802: } never@802: } else { never@802: stk.pop(); // Remove post-visited node from stack never@802: } never@802: } never@802: } never@802: never@802: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::flow_types duke@435: // duke@435: // Perform the type flow analysis, creating and cloning Blocks as duke@435: // necessary. duke@435: void ciTypeFlow::flow_types() { duke@435: ResourceMark rm; duke@435: StateVector* temp_vector = new StateVector(this); duke@435: JsrSet* temp_set = new JsrSet(NULL, 16); duke@435: duke@435: // Create the method entry block. never@802: Block* start = block_at(start_bci(), temp_set); duke@435: duke@435: // Load the initial state into it. duke@435: const StateVector* start_state = get_start_state(); duke@435: if (failing()) return; never@802: start->meet(start_state); duke@435: never@802: // Depth first visit never@802: df_flow_types(start, true /*do flow*/, temp_vector, temp_set); never@802: never@802: if (failing()) return; never@802: assert(_rpo_list == start, "must be start"); never@802: never@802: // Any loops found? never@802: if (loop_tree_root()->child() != NULL && never@802: env()->comp_level() >= CompLevel_full_optimization) { never@802: // Loop optimizations are not performed on Tier1 compiles. never@802: never@802: bool changed = clone_loop_heads(loop_tree_root(), temp_vector, temp_set); never@802: never@802: // If some loop heads were cloned, recompute postorder and loop tree never@802: if (changed) { never@802: loop_tree_root()->set_child(NULL); never@802: for (Block* blk = _rpo_list; blk != NULL;) { never@802: Block* next = blk->rpo_next(); never@802: blk->df_init(); never@802: blk = next; never@802: } never@802: df_flow_types(start, false /*no flow*/, temp_vector, temp_set); never@802: } never@802: } never@802: never@802: if (CITraceTypeFlow) { never@802: tty->print_cr("\nLoop tree"); never@802: loop_tree_root()->print(); never@802: } never@802: never@802: // Continue flow analysis until fixed point reached never@802: never@802: debug_only(int max_block = _next_pre_order;) never@802: duke@435: while (!work_list_empty()) { never@802: Block* blk = work_list_next(); never@802: assert (blk->has_post_order(), "post order assigned above"); duke@435: never@802: flow_block(blk, temp_vector, temp_set); duke@435: never@802: assert (max_block == _next_pre_order, "no new blocks"); never@802: assert (!failing(), "no more bailouts"); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::map_blocks duke@435: // never@802: // Create the block map, which indexes blocks in reverse post-order. duke@435: void ciTypeFlow::map_blocks() { duke@435: assert(_block_map == NULL, "single initialization"); never@802: int block_ct = _next_pre_order; never@802: _block_map = NEW_ARENA_ARRAY(arena(), Block*, block_ct); never@802: assert(block_ct == block_count(), ""); never@802: never@802: Block* blk = _rpo_list; never@802: for (int m = 0; m < block_ct; m++) { never@802: int rpo = blk->rpo(); never@802: assert(rpo == m, "should be sequential"); never@802: _block_map[rpo] = blk; never@802: blk = blk->rpo_next(); duke@435: } never@802: assert(blk == NULL, "should be done"); never@802: never@802: for (int j = 0; j < block_ct; j++) { never@802: assert(_block_map[j] != NULL, "must not drop any blocks"); never@802: Block* block = _block_map[j]; duke@435: // Remove dead blocks from successor lists: duke@435: for (int e = 0; e <= 1; e++) { duke@435: GrowableArray* l = e? block->exceptions(): block->successors(); never@802: for (int k = 0; k < l->length(); k++) { never@802: Block* s = l->at(k); never@802: if (!s->has_post_order()) { duke@435: if (CITraceTypeFlow) { duke@435: tty->print("Removing dead %s successor of #%d: ", (e? "exceptional": "normal"), block->pre_order()); duke@435: s->print_value_on(tty); duke@435: tty->cr(); duke@435: } duke@435: l->remove(s); never@802: --k; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::get_block_for duke@435: // duke@435: // Find a block with this ciBlock which has a compatible JsrSet. duke@435: // If no such block exists, create it, unless the option is no_create. never@802: // If the option is create_backedge_copy, always create a fresh backedge copy. duke@435: ciTypeFlow::Block* ciTypeFlow::get_block_for(int ciBlockIndex, ciTypeFlow::JsrSet* jsrs, CreateOption option) { duke@435: Arena* a = arena(); duke@435: GrowableArray* blocks = _idx_to_blocklist[ciBlockIndex]; duke@435: if (blocks == NULL) { duke@435: // Query only? duke@435: if (option == no_create) return NULL; duke@435: duke@435: // Allocate the growable array. duke@435: blocks = new (a) GrowableArray(a, 4, 0, NULL); duke@435: _idx_to_blocklist[ciBlockIndex] = blocks; duke@435: } duke@435: never@802: if (option != create_backedge_copy) { duke@435: int len = blocks->length(); duke@435: for (int i = 0; i < len; i++) { duke@435: Block* block = blocks->at(i); never@802: if (!block->is_backedge_copy() && block->is_compatible_with(jsrs)) { duke@435: return block; duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Query only? duke@435: if (option == no_create) return NULL; duke@435: duke@435: // We did not find a compatible block. Create one. duke@435: Block* new_block = new (a) Block(this, _methodBlocks->block(ciBlockIndex), jsrs); never@802: if (option == create_backedge_copy) new_block->set_backedge_copy(true); duke@435: blocks->append(new_block); duke@435: return new_block; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ never@802: // ciTypeFlow::backedge_copy_count duke@435: // never@802: int ciTypeFlow::backedge_copy_count(int ciBlockIndex, ciTypeFlow::JsrSet* jsrs) const { duke@435: GrowableArray* blocks = _idx_to_blocklist[ciBlockIndex]; duke@435: duke@435: if (blocks == NULL) { duke@435: return 0; duke@435: } duke@435: duke@435: int count = 0; duke@435: int len = blocks->length(); duke@435: for (int i = 0; i < len; i++) { duke@435: Block* block = blocks->at(i); never@802: if (block->is_backedge_copy() && block->is_compatible_with(jsrs)) { duke@435: count++; duke@435: } duke@435: } duke@435: duke@435: return count; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::do_flow duke@435: // duke@435: // Perform type inference flow analysis. duke@435: void ciTypeFlow::do_flow() { duke@435: if (CITraceTypeFlow) { duke@435: tty->print_cr("\nPerforming flow analysis on method"); duke@435: method()->print(); duke@435: if (is_osr_flow()) tty->print(" at OSR bci %d", start_bci()); duke@435: tty->cr(); duke@435: method()->print_codes(); duke@435: } duke@435: if (CITraceTypeFlow) { duke@435: tty->print_cr("Initial CI Blocks"); duke@435: print_on(tty); duke@435: } duke@435: flow_types(); duke@435: // Watch for bailouts. duke@435: if (failing()) { duke@435: return; duke@435: } never@802: never@802: map_blocks(); never@802: duke@435: if (CIPrintTypeFlow || CITraceTypeFlow) { never@802: rpo_print_on(tty); duke@435: } duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::record_failure() duke@435: // The ciTypeFlow object keeps track of failure reasons separately from the ciEnv. duke@435: // This is required because there is not a 1-1 relation between the ciEnv and duke@435: // the TypeFlow passes within a compilation task. For example, if the compiler duke@435: // is considering inlining a method, it will request a TypeFlow. If that fails, duke@435: // the compilation as a whole may continue without the inlining. Some TypeFlow duke@435: // requests are not optional; if they fail the requestor is responsible for duke@435: // copying the failure reason up to the ciEnv. (See Parse::Parse.) duke@435: void ciTypeFlow::record_failure(const char* reason) { duke@435: if (env()->log() != NULL) { duke@435: env()->log()->elem("failure reason='%s' phase='typeflow'", reason); duke@435: } duke@435: if (_failure_reason == NULL) { duke@435: // Record the first failure reason. duke@435: _failure_reason = reason; duke@435: } duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: // ------------------------------------------------------------------ duke@435: // ciTypeFlow::print_on duke@435: void ciTypeFlow::print_on(outputStream* st) const { duke@435: // Walk through CI blocks duke@435: st->print_cr("********************************************************"); duke@435: st->print ("TypeFlow for "); duke@435: method()->name()->print_symbol_on(st); duke@435: int limit_bci = code_size(); duke@435: st->print_cr(" %d bytes", limit_bci); duke@435: ciMethodBlocks *mblks = _methodBlocks; duke@435: ciBlock* current = NULL; duke@435: for (int bci = 0; bci < limit_bci; bci++) { duke@435: ciBlock* blk = mblks->block_containing(bci); duke@435: if (blk != NULL && blk != current) { duke@435: current = blk; duke@435: current->print_on(st); duke@435: duke@435: GrowableArray* blocks = _idx_to_blocklist[blk->index()]; duke@435: int num_blocks = (blocks == NULL) ? 0 : blocks->length(); duke@435: duke@435: if (num_blocks == 0) { duke@435: st->print_cr(" No Blocks"); duke@435: } else { duke@435: for (int i = 0; i < num_blocks; i++) { duke@435: Block* block = blocks->at(i); duke@435: block->print_on(st); duke@435: } duke@435: } duke@435: st->print_cr("--------------------------------------------------------"); duke@435: st->cr(); duke@435: } duke@435: } duke@435: st->print_cr("********************************************************"); duke@435: st->cr(); duke@435: } never@802: never@802: void ciTypeFlow::rpo_print_on(outputStream* st) const { never@802: st->print_cr("********************************************************"); never@802: st->print ("TypeFlow for "); never@802: method()->name()->print_symbol_on(st); never@802: int limit_bci = code_size(); never@802: st->print_cr(" %d bytes", limit_bci); never@802: for (Block* blk = _rpo_list; blk != NULL; blk = blk->rpo_next()) { never@802: blk->print_on(st); never@802: st->print_cr("--------------------------------------------------------"); never@802: st->cr(); never@802: } never@802: st->print_cr("********************************************************"); never@802: st->cr(); never@802: } duke@435: #endif