duke@435: /*
duke@435:  * Copyright 2005-2006 Sun Microsystems, Inc.  All Rights Reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
duke@435:  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435:  * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435:  * have any questions.
duke@435:  *
duke@435:  */
duke@435: 
duke@435: 
duke@435: #include "incls/_precompiled.incl"
duke@435: #include "incls/_bcEscapeAnalyzer.cpp.incl"
duke@435: 
duke@435: 
duke@435: #ifndef PRODUCT
duke@435:   #define TRACE_BCEA(level, code)                                            \
duke@435:     if (EstimateArgEscape && BCEATraceLevel >= level) {                        \
duke@435:       code;                                                                  \
duke@435:     }
duke@435: #else
duke@435:   #define TRACE_BCEA(level, code)
duke@435: #endif
duke@435: 
duke@435: // Maintain a map of which aguments a local variable or
duke@435: // stack slot may contain.  In addition to tracking
duke@435: // arguments, it tracks two special values, "allocated"
duke@435: // which represents any object allocated in the current
duke@435: // method, and "unknown" which is any other object.
duke@435: // Up to 30 arguments are handled, with the last one
duke@435: // representing summary information for any extra arguments
duke@435: class BCEscapeAnalyzer::ArgumentMap {
duke@435:   uint  _bits;
duke@435:   enum {MAXBIT = 29,
duke@435:         ALLOCATED = 1,
duke@435:         UNKNOWN = 2};
duke@435: 
duke@435:   uint int_to_bit(uint e) const {
duke@435:     if (e > MAXBIT)
duke@435:       e = MAXBIT;
duke@435:     return (1 << (e + 2));
duke@435:   }
duke@435: 
duke@435: public:
duke@435:   ArgumentMap()                         { _bits = 0;}
duke@435:   void set_bits(uint bits)              { _bits = bits;}
duke@435:   uint get_bits() const                 { return _bits;}
duke@435:   void clear()                          { _bits = 0;}
duke@435:   void set_all()                        { _bits = ~0u; }
duke@435:   bool is_empty() const                 { return _bits == 0; }
duke@435:   bool contains(uint var) const         { return (_bits & int_to_bit(var)) != 0; }
duke@435:   bool is_singleton(uint var) const     { return (_bits == int_to_bit(var)); }
duke@435:   bool contains_unknown() const         { return (_bits & UNKNOWN) != 0; }
duke@435:   bool contains_allocated() const       { return (_bits & ALLOCATED) != 0; }
duke@435:   bool contains_vars() const            { return (_bits & (((1 << MAXBIT) -1) << 2)) != 0; }
duke@435:   void set(uint var)                    { _bits = int_to_bit(var); }
duke@435:   void add(uint var)                    { _bits |= int_to_bit(var); }
duke@435:   void add_unknown()                    { _bits = UNKNOWN; }
duke@435:   void add_allocated()                  { _bits = ALLOCATED; }
duke@435:   void set_union(const ArgumentMap &am)     { _bits |= am._bits; }
duke@435:   void set_intersect(const ArgumentMap &am) { _bits |= am._bits; }
duke@435:   void set_difference(const ArgumentMap &am) { _bits &=  ~am._bits; }
duke@435:   void operator=(const ArgumentMap &am) { _bits = am._bits; }
duke@435:   bool operator==(const ArgumentMap &am) { return _bits == am._bits; }
duke@435:   bool operator!=(const ArgumentMap &am) { return _bits != am._bits; }
duke@435: };
duke@435: 
duke@435: class BCEscapeAnalyzer::StateInfo {
duke@435: public:
duke@435:   ArgumentMap *_vars;
duke@435:   ArgumentMap *_stack;
duke@435:   short _stack_height;
duke@435:   short _max_stack;
duke@435:   bool _initialized;
duke@435:   ArgumentMap empty_map;
duke@435: 
duke@435:   StateInfo() {
duke@435:     empty_map.clear();
duke@435:   }
duke@435: 
duke@435:   ArgumentMap raw_pop()  { assert(_stack_height > 0, "stack underflow"); return _stack[--_stack_height]; }
duke@435:   ArgumentMap  apop()    { return raw_pop(); }
duke@435:   void spop()            { raw_pop(); }
duke@435:   void lpop()            { spop(); spop(); }
duke@435:   void raw_push(ArgumentMap i)   { assert(_stack_height < _max_stack, "stack overflow"); _stack[_stack_height++] = i; }
duke@435:   void apush(ArgumentMap i)      { raw_push(i); }
duke@435:   void spush()           { raw_push(empty_map); }
duke@435:   void lpush()           { spush(); spush(); }
duke@435: 
duke@435: };
duke@435: 
duke@435: void BCEscapeAnalyzer::set_returned(ArgumentMap vars) {
kvn@480:   for (int i = 0; i < _arg_size; i++) {
duke@435:     if (vars.contains(i))
duke@435:       _arg_returned.set_bit(i);
duke@435:   }
duke@435:   _return_local = _return_local && !(vars.contains_unknown() || vars.contains_allocated());
duke@435:   _return_allocated = _return_allocated && vars.contains_allocated() && !(vars.contains_unknown() || vars.contains_vars());
duke@435: }
duke@435: 
duke@435: // return true if any element of vars is an argument
duke@435: bool BCEscapeAnalyzer::is_argument(ArgumentMap vars) {
kvn@480:   for (int i = 0; i < _arg_size; i++) {
duke@435:     if (vars.contains(i))
duke@435:       return true;
duke@435:   }
duke@435:   return false;
duke@435: }
duke@435: 
duke@435: // return true if any element of vars is an arg_stack argument
duke@435: bool BCEscapeAnalyzer::is_arg_stack(ArgumentMap vars){
duke@435:   if (_conservative)
duke@435:     return true;
kvn@480:   for (int i = 0; i < _arg_size; i++) {
duke@435:     if (vars.contains(i) && _arg_stack.at(i))
duke@435:       return true;
duke@435:   }
duke@435:   return false;
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::clear_bits(ArgumentMap vars, BitMap &bm) {
kvn@480:   for (int i = 0; i < _arg_size; i++) {
duke@435:     if (vars.contains(i)) {
duke@435:       bm.clear_bit(i);
duke@435:     }
duke@435:   }
duke@435: }
kvn@480: 
duke@435: void BCEscapeAnalyzer::set_method_escape(ArgumentMap vars) {
duke@435:   clear_bits(vars, _arg_local);
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::set_global_escape(ArgumentMap vars) {
duke@435:   clear_bits(vars, _arg_local);
duke@435:   clear_bits(vars, _arg_stack);
duke@435:   if (vars.contains_allocated())
duke@435:     _allocated_escapes = true;
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::set_dirty(ArgumentMap vars) {
duke@435:   clear_bits(vars, _dirty);
duke@435: }
duke@435: 
kvn@480: void BCEscapeAnalyzer::set_modified(ArgumentMap vars, int offs, int size) {
kvn@480: 
kvn@480:   for (int i = 0; i < _arg_size; i++) {
kvn@480:     if (vars.contains(i)) {
kvn@480:       set_arg_modified(i, offs, size);
kvn@480:     }
kvn@480:   }
kvn@480:   if (vars.contains_unknown())
kvn@480:     _unknown_modified = true;
kvn@480: }
kvn@480: 
duke@435: bool BCEscapeAnalyzer::is_recursive_call(ciMethod* callee) {
duke@435:   for (BCEscapeAnalyzer* scope = this; scope != NULL; scope = scope->_parent) {
duke@435:     if (scope->method() == callee) {
duke@435:       return true;
duke@435:     }
duke@435:   }
duke@435:   return false;
duke@435: }
duke@435: 
kvn@480: bool BCEscapeAnalyzer::is_arg_modified(int arg, int offset, int size_in_bytes) {
kvn@480:   if (offset == OFFSET_ANY)
kvn@480:     return _arg_modified[arg] != 0;
kvn@480:   assert(arg >= 0 && arg < _arg_size, "must be an argument.");
kvn@480:   bool modified = false;
kvn@480:   int l = offset / HeapWordSize;
kvn@480:   int h = round_to(offset + size_in_bytes, HeapWordSize) / HeapWordSize;
kvn@480:   if (l > ARG_OFFSET_MAX)
kvn@480:     l = ARG_OFFSET_MAX;
kvn@480:   if (h > ARG_OFFSET_MAX+1)
kvn@480:     h = ARG_OFFSET_MAX + 1;
kvn@480:   for (int i = l; i < h; i++) {
kvn@480:     modified = modified || (_arg_modified[arg] & (1 << i)) != 0;
kvn@480:   }
kvn@480:   return modified;
kvn@480: }
kvn@480: 
kvn@480: void BCEscapeAnalyzer::set_arg_modified(int arg, int offset, int size_in_bytes) {
kvn@480:   if (offset == OFFSET_ANY) {
kvn@480:     _arg_modified[arg] =  (uint) -1;
kvn@480:     return;
kvn@480:   }
kvn@480:   assert(arg >= 0 && arg < _arg_size, "must be an argument.");
kvn@480:   int l = offset / HeapWordSize;
kvn@480:   int h = round_to(offset + size_in_bytes, HeapWordSize) / HeapWordSize;
kvn@480:   if (l > ARG_OFFSET_MAX)
kvn@480:     l = ARG_OFFSET_MAX;
kvn@480:   if (h > ARG_OFFSET_MAX+1)
kvn@480:     h = ARG_OFFSET_MAX + 1;
kvn@480:   for (int i = l; i < h; i++) {
kvn@480:     _arg_modified[arg] |= (1 << i);
kvn@480:   }
kvn@480: }
kvn@480: 
duke@435: void BCEscapeAnalyzer::invoke(StateInfo &state, Bytecodes::Code code, ciMethod* target, ciKlass* holder) {
duke@435:   int i;
duke@435: 
duke@435:   // retrieve information about the callee
duke@435:   ciInstanceKlass* klass = target->holder();
duke@435:   ciInstanceKlass* calling_klass = method()->holder();
duke@435:   ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
duke@435:   ciInstanceKlass* actual_recv = callee_holder;
duke@435: 
kvn@589:   // some methods are obviously bindable without any type checks so
kvn@589:   // convert them directly to an invokespecial.
kvn@589:   if (target->is_loaded() && !target->is_abstract() &&
kvn@589:       target->can_be_statically_bound() && code == Bytecodes::_invokevirtual) {
kvn@589:     code = Bytecodes::_invokespecial;
kvn@589:   }
kvn@589: 
duke@435:   // compute size of arguments
duke@435:   int arg_size = target->arg_size();
duke@435:   if (!target->is_loaded() && code == Bytecodes::_invokestatic) {
duke@435:     arg_size--;
duke@435:   }
duke@435:   int arg_base = MAX2(state._stack_height - arg_size, 0);
duke@435: 
duke@435:   // direct recursive calls are skipped if they can be bound statically without introducing
duke@435:   // dependencies and if parameters are passed at the same position as in the current method
duke@435:   // other calls are skipped if there are no unescaped arguments passed to them
duke@435:   bool directly_recursive = (method() == target) &&
duke@435:                (code != Bytecodes::_invokevirtual || target->is_final_method() || state._stack[arg_base] .is_empty());
duke@435: 
duke@435:   // check if analysis of callee can safely be skipped
duke@435:   bool skip_callee = true;
duke@435:   for (i = state._stack_height - 1; i >= arg_base && skip_callee; i--) {
duke@435:     ArgumentMap arg = state._stack[i];
duke@435:     skip_callee = !is_argument(arg) || !is_arg_stack(arg) || (directly_recursive && arg.is_singleton(i - arg_base));
duke@435:   }
duke@435:   if (skip_callee) {
duke@435:     TRACE_BCEA(3, tty->print_cr("[EA] skipping method %s::%s", holder->name()->as_utf8(), target->name()->as_utf8()));
duke@435:     for (i = 0; i < arg_size; i++) {
duke@435:       set_method_escape(state.raw_pop());
duke@435:     }
kvn@480:     _unknown_modified = true;  // assume the worst since we don't analyze the called method
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   // determine actual method (use CHA if necessary)
duke@435:   ciMethod* inline_target = NULL;
duke@435:   if (target->is_loaded() && klass->is_loaded()
duke@435:       && (klass->is_initialized() || klass->is_interface() && target->holder()->is_initialized())
duke@435:       && target->will_link(klass, callee_holder, code)) {
duke@435:     if (code == Bytecodes::_invokestatic
duke@435:         || code == Bytecodes::_invokespecial
duke@435:         || code == Bytecodes::_invokevirtual && target->is_final_method()) {
duke@435:       inline_target = target;
duke@435:     } else {
duke@435:       inline_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   if (inline_target != NULL && !is_recursive_call(inline_target)) {
duke@435:     // analyze callee
duke@435:     BCEscapeAnalyzer analyzer(inline_target, this);
duke@435: 
duke@435:     // adjust escape state of actual parameters
duke@435:     bool must_record_dependencies = false;
duke@435:     for (i = arg_size - 1; i >= 0; i--) {
duke@435:       ArgumentMap arg = state.raw_pop();
duke@435:       if (!is_argument(arg))
duke@435:         continue;
kvn@480:       for (int j = 0; j < _arg_size; j++) {
kvn@480:         if (arg.contains(j)) {
kvn@480:           _arg_modified[j] |= analyzer._arg_modified[i];
kvn@480:         }
kvn@480:       }
duke@435:       if (!is_arg_stack(arg)) {
duke@435:         // arguments have already been recognized as escaping
duke@435:       } else if (analyzer.is_arg_stack(i) && !analyzer.is_arg_returned(i)) {
duke@435:         set_method_escape(arg);
duke@435:         must_record_dependencies = true;
duke@435:       } else {
duke@435:         set_global_escape(arg);
duke@435:       }
duke@435:     }
kvn@480:     _unknown_modified = _unknown_modified || analyzer.has_non_arg_side_affects();
duke@435: 
duke@435:     // record dependencies if at least one parameter retained stack-allocatable
duke@435:     if (must_record_dependencies) {
duke@435:       if (code == Bytecodes::_invokeinterface || code == Bytecodes::_invokevirtual && !target->is_final_method()) {
duke@435:         _dependencies.append(actual_recv);
duke@435:         _dependencies.append(inline_target);
duke@435:       }
duke@435:       _dependencies.appendAll(analyzer.dependencies());
duke@435:     }
duke@435:   } else {
duke@435:     TRACE_BCEA(1, tty->print_cr("[EA] virtual method %s is not monomorphic.",
duke@435:                                 target->name()->as_utf8()));
duke@435:     // conservatively mark all actual parameters as escaping globally
duke@435:     for (i = 0; i < arg_size; i++) {
duke@435:       ArgumentMap arg = state.raw_pop();
duke@435:       if (!is_argument(arg))
duke@435:         continue;
kvn@480:       set_modified(arg, OFFSET_ANY, type2size[T_INT]*HeapWordSize);
duke@435:       set_global_escape(arg);
duke@435:     }
kvn@480:     _unknown_modified = true;  // assume the worst since we don't know the called method
duke@435:   }
duke@435: }
duke@435: 
duke@435: bool BCEscapeAnalyzer::contains(uint arg_set1, uint arg_set2) {
duke@435:   return ((~arg_set1) | arg_set2) == 0;
duke@435: }
duke@435: 
duke@435: 
duke@435: void BCEscapeAnalyzer::iterate_one_block(ciBlock *blk, StateInfo &state, GrowableArray<ciBlock *> &successors) {
duke@435: 
duke@435:   blk->set_processed();
duke@435:   ciBytecodeStream s(method());
duke@435:   int limit_bci = blk->limit_bci();
duke@435:   bool fall_through = false;
duke@435:   ArgumentMap allocated_obj;
duke@435:   allocated_obj.add_allocated();
duke@435:   ArgumentMap unknown_obj;
duke@435:   unknown_obj.add_unknown();
duke@435:   ArgumentMap empty_map;
duke@435: 
duke@435:   s.reset_to_bci(blk->start_bci());
duke@435:   while (s.next() != ciBytecodeStream::EOBC() && s.cur_bci() < limit_bci) {
duke@435:     fall_through = true;
duke@435:     switch (s.cur_bc()) {
duke@435:       case Bytecodes::_nop:
duke@435:         break;
duke@435:       case Bytecodes::_aconst_null:
duke@435:         state.apush(empty_map);
duke@435:         break;
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::_fconst_0:
duke@435:       case Bytecodes::_fconst_1:
duke@435:       case Bytecodes::_fconst_2:
duke@435:       case Bytecodes::_bipush:
duke@435:       case Bytecodes::_sipush:
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_lconst_0:
duke@435:       case Bytecodes::_lconst_1:
duke@435:       case Bytecodes::_dconst_0:
duke@435:       case Bytecodes::_dconst_1:
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_ldc:
duke@435:       case Bytecodes::_ldc_w:
duke@435:       case Bytecodes::_ldc2_w:
duke@435:         if (type2size[s.get_constant().basic_type()] == 1) {
duke@435:           state.spush();
duke@435:         } else {
duke@435:           state.lpush();
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_aload:
duke@435:         state.apush(state._vars[s.get_index()]);
duke@435:         break;
duke@435:       case Bytecodes::_iload:
duke@435:       case Bytecodes::_fload:
duke@435:       case Bytecodes::_iload_0:
duke@435:       case Bytecodes::_iload_1:
duke@435:       case Bytecodes::_iload_2:
duke@435:       case Bytecodes::_iload_3:
duke@435:       case Bytecodes::_fload_0:
duke@435:       case Bytecodes::_fload_1:
duke@435:       case Bytecodes::_fload_2:
duke@435:       case Bytecodes::_fload_3:
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_lload:
duke@435:       case Bytecodes::_dload:
duke@435:       case Bytecodes::_lload_0:
duke@435:       case Bytecodes::_lload_1:
duke@435:       case Bytecodes::_lload_2:
duke@435:       case Bytecodes::_lload_3:
duke@435:       case Bytecodes::_dload_0:
duke@435:       case Bytecodes::_dload_1:
duke@435:       case Bytecodes::_dload_2:
duke@435:       case Bytecodes::_dload_3:
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_aload_0:
duke@435:         state.apush(state._vars[0]);
duke@435:         break;
duke@435:       case Bytecodes::_aload_1:
duke@435:         state.apush(state._vars[1]);
duke@435:         break;
duke@435:       case Bytecodes::_aload_2:
duke@435:         state.apush(state._vars[2]);
duke@435:         break;
duke@435:       case Bytecodes::_aload_3:
duke@435:         state.apush(state._vars[3]);
duke@435:         break;
duke@435:       case Bytecodes::_iaload:
duke@435:       case Bytecodes::_faload:
duke@435:       case Bytecodes::_baload:
duke@435:       case Bytecodes::_caload:
duke@435:       case Bytecodes::_saload:
duke@435:         state.spop();
duke@435:         set_method_escape(state.apop());
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_laload:
duke@435:       case Bytecodes::_daload:
duke@435:         state.spop();
duke@435:         set_method_escape(state.apop());
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_aaload:
duke@435:         { state.spop();
duke@435:           ArgumentMap array = state.apop();
duke@435:           set_method_escape(array);
duke@435:           state.apush(unknown_obj);
duke@435:           set_dirty(array);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_istore:
duke@435:       case Bytecodes::_fstore:
duke@435:       case Bytecodes::_istore_0:
duke@435:       case Bytecodes::_istore_1:
duke@435:       case Bytecodes::_istore_2:
duke@435:       case Bytecodes::_istore_3:
duke@435:       case Bytecodes::_fstore_0:
duke@435:       case Bytecodes::_fstore_1:
duke@435:       case Bytecodes::_fstore_2:
duke@435:       case Bytecodes::_fstore_3:
duke@435:         state.spop();
duke@435:         break;
duke@435:       case Bytecodes::_lstore:
duke@435:       case Bytecodes::_dstore:
duke@435:       case Bytecodes::_lstore_0:
duke@435:       case Bytecodes::_lstore_1:
duke@435:       case Bytecodes::_lstore_2:
duke@435:       case Bytecodes::_lstore_3:
duke@435:       case Bytecodes::_dstore_0:
duke@435:       case Bytecodes::_dstore_1:
duke@435:       case Bytecodes::_dstore_2:
duke@435:       case Bytecodes::_dstore_3:
duke@435:         state.lpop();
duke@435:         break;
duke@435:       case Bytecodes::_astore:
duke@435:         state._vars[s.get_index()] = state.apop();
duke@435:         break;
duke@435:       case Bytecodes::_astore_0:
duke@435:         state._vars[0] = state.apop();
duke@435:         break;
duke@435:       case Bytecodes::_astore_1:
duke@435:         state._vars[1] = state.apop();
duke@435:         break;
duke@435:       case Bytecodes::_astore_2:
duke@435:         state._vars[2] = state.apop();
duke@435:         break;
duke@435:       case Bytecodes::_astore_3:
duke@435:         state._vars[3] = state.apop();
duke@435:         break;
duke@435:       case Bytecodes::_iastore:
duke@435:       case Bytecodes::_fastore:
duke@435:       case Bytecodes::_bastore:
duke@435:       case Bytecodes::_castore:
duke@435:       case Bytecodes::_sastore:
duke@435:       {
duke@435:         state.spop();
duke@435:         state.spop();
duke@435:         ArgumentMap arr = state.apop();
duke@435:         set_method_escape(arr);
kvn@480:         set_modified(arr, OFFSET_ANY, type2size[T_INT]*HeapWordSize);
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_lastore:
duke@435:       case Bytecodes::_dastore:
duke@435:       {
duke@435:         state.lpop();
duke@435:         state.spop();
duke@435:         ArgumentMap arr = state.apop();
duke@435:         set_method_escape(arr);
kvn@480:         set_modified(arr, OFFSET_ANY, type2size[T_LONG]*HeapWordSize);
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_aastore:
duke@435:       {
duke@435:         set_global_escape(state.apop());
duke@435:         state.spop();
duke@435:         ArgumentMap arr = state.apop();
kvn@480:         set_modified(arr, OFFSET_ANY, type2size[T_OBJECT]*HeapWordSize);
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_pop:
duke@435:         state.raw_pop();
duke@435:         break;
duke@435:       case Bytecodes::_pop2:
duke@435:         state.raw_pop();
duke@435:         state.raw_pop();
duke@435:         break;
duke@435:       case Bytecodes::_dup:
duke@435:         { ArgumentMap w1 = state.raw_pop();
duke@435:           state.raw_push(w1);
duke@435:           state.raw_push(w1);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_dup_x1:
duke@435:         { ArgumentMap w1 = state.raw_pop();
duke@435:           ArgumentMap w2 = state.raw_pop();
duke@435:           state.raw_push(w1);
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_dup_x2:
duke@435:         { ArgumentMap w1 = state.raw_pop();
duke@435:           ArgumentMap w2 = state.raw_pop();
duke@435:           ArgumentMap w3 = state.raw_pop();
duke@435:           state.raw_push(w1);
duke@435:           state.raw_push(w3);
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_dup2:
duke@435:         { ArgumentMap w1 = state.raw_pop();
duke@435:           ArgumentMap w2 = state.raw_pop();
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_dup2_x1:
duke@435:         { ArgumentMap w1 = state.raw_pop();
duke@435:           ArgumentMap w2 = state.raw_pop();
duke@435:           ArgumentMap w3 = state.raw_pop();
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:           state.raw_push(w3);
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_dup2_x2:
duke@435:         { ArgumentMap w1 = state.raw_pop();
duke@435:           ArgumentMap w2 = state.raw_pop();
duke@435:           ArgumentMap w3 = state.raw_pop();
duke@435:           ArgumentMap w4 = state.raw_pop();
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:           state.raw_push(w4);
duke@435:           state.raw_push(w3);
duke@435:           state.raw_push(w2);
duke@435:           state.raw_push(w1);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_swap:
duke@435:         { ArgumentMap w1 = state.raw_pop();
duke@435:           ArgumentMap w2 = state.raw_pop();
duke@435:           state.raw_push(w1);
duke@435:           state.raw_push(w2);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_iadd:
duke@435:       case Bytecodes::_fadd:
duke@435:       case Bytecodes::_isub:
duke@435:       case Bytecodes::_fsub:
duke@435:       case Bytecodes::_imul:
duke@435:       case Bytecodes::_fmul:
duke@435:       case Bytecodes::_idiv:
duke@435:       case Bytecodes::_fdiv:
duke@435:       case Bytecodes::_irem:
duke@435:       case Bytecodes::_frem:
duke@435:       case Bytecodes::_iand:
duke@435:       case Bytecodes::_ior:
duke@435:       case Bytecodes::_ixor:
duke@435:         state.spop();
duke@435:         state.spop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_ladd:
duke@435:       case Bytecodes::_dadd:
duke@435:       case Bytecodes::_lsub:
duke@435:       case Bytecodes::_dsub:
duke@435:       case Bytecodes::_lmul:
duke@435:       case Bytecodes::_dmul:
duke@435:       case Bytecodes::_ldiv:
duke@435:       case Bytecodes::_ddiv:
duke@435:       case Bytecodes::_lrem:
duke@435:       case Bytecodes::_drem:
duke@435:       case Bytecodes::_land:
duke@435:       case Bytecodes::_lor:
duke@435:       case Bytecodes::_lxor:
duke@435:         state.lpop();
duke@435:         state.lpop();
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_ishl:
duke@435:       case Bytecodes::_ishr:
duke@435:       case Bytecodes::_iushr:
duke@435:         state.spop();
duke@435:         state.spop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_lshl:
duke@435:       case Bytecodes::_lshr:
duke@435:       case Bytecodes::_lushr:
duke@435:         state.spop();
duke@435:         state.lpop();
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_ineg:
duke@435:       case Bytecodes::_fneg:
duke@435:         state.spop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_lneg:
duke@435:       case Bytecodes::_dneg:
duke@435:         state.lpop();
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_iinc:
duke@435:         break;
duke@435:       case Bytecodes::_i2l:
duke@435:       case Bytecodes::_i2d:
duke@435:       case Bytecodes::_f2l:
duke@435:       case Bytecodes::_f2d:
duke@435:         state.spop();
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_i2f:
duke@435:       case Bytecodes::_f2i:
duke@435:         state.spop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_l2i:
duke@435:       case Bytecodes::_l2f:
duke@435:       case Bytecodes::_d2i:
duke@435:       case Bytecodes::_d2f:
duke@435:         state.lpop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_l2d:
duke@435:       case Bytecodes::_d2l:
duke@435:         state.lpop();
duke@435:         state.lpush();
duke@435:         break;
duke@435:       case Bytecodes::_i2b:
duke@435:       case Bytecodes::_i2c:
duke@435:       case Bytecodes::_i2s:
duke@435:         state.spop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_lcmp:
duke@435:       case Bytecodes::_dcmpl:
duke@435:       case Bytecodes::_dcmpg:
duke@435:         state.lpop();
duke@435:         state.lpop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_fcmpl:
duke@435:       case Bytecodes::_fcmpg:
duke@435:         state.spop();
duke@435:         state.spop();
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_ifeq:
duke@435:       case Bytecodes::_ifne:
duke@435:       case Bytecodes::_iflt:
duke@435:       case Bytecodes::_ifge:
duke@435:       case Bytecodes::_ifgt:
duke@435:       case Bytecodes::_ifle:
duke@435:       {
duke@435:         state.spop();
duke@435:         int dest_bci = s.get_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_if_icmpeq:
duke@435:       case Bytecodes::_if_icmpne:
duke@435:       case Bytecodes::_if_icmplt:
duke@435:       case Bytecodes::_if_icmpge:
duke@435:       case Bytecodes::_if_icmpgt:
duke@435:       case Bytecodes::_if_icmple:
duke@435:       {
duke@435:         state.spop();
duke@435:         state.spop();
duke@435:         int dest_bci = s.get_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_if_acmpeq:
duke@435:       case Bytecodes::_if_acmpne:
duke@435:       {
duke@435:         set_method_escape(state.apop());
duke@435:         set_method_escape(state.apop());
duke@435:         int dest_bci = s.get_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_goto:
duke@435:       {
duke@435:         int dest_bci = s.get_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_jsr:
duke@435:       {
duke@435:         int dest_bci = s.get_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         state.apush(empty_map);
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_ret:
duke@435:         // we don't track  the destination of a "ret" instruction
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       case Bytecodes::_return:
duke@435:         assert(s.next_bci() == limit_bci, "return must end block");
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       case Bytecodes::_tableswitch:
duke@435:         {
duke@435:           state.spop();
duke@435:           Bytecode_tableswitch* switch_ = Bytecode_tableswitch_at(s.cur_bcp());
duke@435:           int len = switch_->length();
duke@435:           int dest_bci;
duke@435:           for (int i = 0; i < len; i++) {
duke@435:             dest_bci = s.cur_bci() + switch_->dest_offset_at(i);
duke@435:             assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:             successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:           }
duke@435:           dest_bci = s.cur_bci() + switch_->default_offset();
duke@435:           assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:           successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:           assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:           fall_through = false;
duke@435:           break;
duke@435:         }
duke@435:       case Bytecodes::_lookupswitch:
duke@435:         {
duke@435:           state.spop();
duke@435:           Bytecode_lookupswitch* switch_ = Bytecode_lookupswitch_at(s.cur_bcp());
duke@435:           int len = switch_->number_of_pairs();
duke@435:           int dest_bci;
duke@435:           for (int i = 0; i < len; i++) {
duke@435:             dest_bci = s.cur_bci() + switch_->pair_at(i)->offset();
duke@435:             assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:             successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:           }
duke@435:           dest_bci = s.cur_bci() + switch_->default_offset();
duke@435:           assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:           successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:           fall_through = false;
duke@435:           break;
duke@435:         }
duke@435:       case Bytecodes::_ireturn:
duke@435:       case Bytecodes::_freturn:
duke@435:         state.spop();
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       case Bytecodes::_lreturn:
duke@435:       case Bytecodes::_dreturn:
duke@435:         state.lpop();
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       case Bytecodes::_areturn:
duke@435:         set_returned(state.apop());
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       case Bytecodes::_getstatic:
duke@435:       case Bytecodes::_getfield:
duke@435:         { bool will_link;
duke@435:           ciField* field = s.get_field(will_link);
duke@435:           BasicType field_type = field->type()->basic_type();
duke@435:           if (s.cur_bc() != Bytecodes::_getstatic) {
duke@435:             set_method_escape(state.apop());
duke@435:           }
duke@435:           if (field_type == T_OBJECT || field_type == T_ARRAY) {
duke@435:             state.apush(unknown_obj);
duke@435:           } else if (type2size[field_type] == 1) {
duke@435:             state.spush();
duke@435:           } else {
duke@435:             state.lpush();
duke@435:           }
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_putstatic:
duke@435:       case Bytecodes::_putfield:
duke@435:         { bool will_link;
duke@435:           ciField* field = s.get_field(will_link);
duke@435:           BasicType field_type = field->type()->basic_type();
duke@435:           if (field_type == T_OBJECT || field_type == T_ARRAY) {
duke@435:             set_global_escape(state.apop());
duke@435:           } else if (type2size[field_type] == 1) {
duke@435:             state.spop();
duke@435:           } else {
duke@435:             state.lpop();
duke@435:           }
duke@435:           if (s.cur_bc() != Bytecodes::_putstatic) {
duke@435:             ArgumentMap p = state.apop();
duke@435:             set_method_escape(p);
kvn@480:             set_modified(p, will_link ? field->offset() : OFFSET_ANY, type2size[field_type]*HeapWordSize);
duke@435:           }
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_invokevirtual:
duke@435:       case Bytecodes::_invokespecial:
duke@435:       case Bytecodes::_invokestatic:
duke@435:       case Bytecodes::_invokeinterface:
duke@435:         { bool will_link;
duke@435:           ciMethod* target = s.get_method(will_link);
duke@435:           ciKlass* holder = s.get_declared_method_holder();
duke@435:           invoke(state, s.cur_bc(), target, holder);
duke@435:           ciType* return_type = target->return_type();
duke@435:           if (!return_type->is_primitive_type()) {
duke@435:             state.apush(unknown_obj);
duke@435:           } else if (return_type->is_one_word()) {
duke@435:             state.spush();
duke@435:           } else if (return_type->is_two_word()) {
duke@435:             state.lpush();
duke@435:           }
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_xxxunusedxxx:
duke@435:         ShouldNotReachHere();
duke@435:         break;
duke@435:       case Bytecodes::_new:
duke@435:         state.apush(allocated_obj);
duke@435:         break;
duke@435:       case Bytecodes::_newarray:
duke@435:       case Bytecodes::_anewarray:
duke@435:         state.spop();
duke@435:         state.apush(allocated_obj);
duke@435:         break;
duke@435:       case Bytecodes::_multianewarray:
duke@435:         { int i = s.cur_bcp()[3];
duke@435:           while (i-- > 0) state.spop();
duke@435:           state.apush(allocated_obj);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_arraylength:
duke@435:         set_method_escape(state.apop());
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_athrow:
duke@435:         set_global_escape(state.apop());
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       case Bytecodes::_checkcast:
duke@435:         { ArgumentMap obj = state.apop();
duke@435:           set_method_escape(obj);
duke@435:           state.apush(obj);
duke@435:         }
duke@435:         break;
duke@435:       case Bytecodes::_instanceof:
duke@435:         set_method_escape(state.apop());
duke@435:         state.spush();
duke@435:         break;
duke@435:       case Bytecodes::_monitorenter:
duke@435:       case Bytecodes::_monitorexit:
duke@435:         state.apop();
duke@435:         break;
duke@435:       case Bytecodes::_wide:
duke@435:         ShouldNotReachHere();
duke@435:         break;
duke@435:       case Bytecodes::_ifnull:
duke@435:       case Bytecodes::_ifnonnull:
duke@435:       {
duke@435:         set_method_escape(state.apop());
duke@435:         int dest_bci = s.get_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_goto_w:
duke@435:       {
duke@435:         int dest_bci = s.get_far_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_jsr_w:
duke@435:       {
duke@435:         int dest_bci = s.get_far_dest();
duke@435:         assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block");
duke@435:         assert(s.next_bci() == limit_bci, "branch must end block");
duke@435:         state.apush(empty_map);
duke@435:         successors.push(_methodBlocks->block_containing(dest_bci));
duke@435:         fall_through = false;
duke@435:         break;
duke@435:       }
duke@435:       case Bytecodes::_breakpoint:
duke@435:         break;
duke@435:       default:
duke@435:         ShouldNotReachHere();
duke@435:         break;
duke@435:     }
duke@435: 
duke@435:   }
duke@435:   if (fall_through) {
duke@435:     int fall_through_bci = s.cur_bci();
duke@435:     if (fall_through_bci < _method->code_size()) {
duke@435:       assert(_methodBlocks->is_block_start(fall_through_bci), "must fall through to block start.");
duke@435:       successors.push(_methodBlocks->block_containing(fall_through_bci));
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::merge_block_states(StateInfo *blockstates, ciBlock *dest, StateInfo *s_state) {
kvn@480:   StateInfo *d_state = blockstates + dest->index();
duke@435:   int nlocals = _method->max_locals();
duke@435: 
duke@435:   // exceptions may cause transfer of control to handlers in the middle of a
duke@435:   // block, so we don't merge the incoming state of exception handlers
duke@435:   if (dest->is_handler())
duke@435:     return;
duke@435:   if (!d_state->_initialized ) {
duke@435:     // destination not initialized, just copy
duke@435:     for (int i = 0; i < nlocals; i++) {
duke@435:       d_state->_vars[i] = s_state->_vars[i];
duke@435:     }
duke@435:     for (int i = 0; i < s_state->_stack_height; i++) {
duke@435:       d_state->_stack[i] = s_state->_stack[i];
duke@435:     }
duke@435:     d_state->_stack_height = s_state->_stack_height;
duke@435:     d_state->_max_stack = s_state->_max_stack;
duke@435:     d_state->_initialized = true;
duke@435:   } else if (!dest->processed()) {
duke@435:     // we have not yet walked the bytecodes of dest, we can merge
duke@435:     // the states
duke@435:     assert(d_state->_stack_height == s_state->_stack_height, "computed stack heights must match");
duke@435:     for (int i = 0; i < nlocals; i++) {
duke@435:       d_state->_vars[i].set_union(s_state->_vars[i]);
duke@435:     }
duke@435:     for (int i = 0; i < s_state->_stack_height; i++) {
duke@435:       d_state->_stack[i].set_union(s_state->_stack[i]);
duke@435:     }
duke@435:   } else {
duke@435:     // the bytecodes of dest have already been processed, mark any
duke@435:     // arguments in the source state which are not in the dest state
duke@435:     // as global escape.
duke@435:     // Future refinement:  we only need to mark these variable to the
duke@435:     // maximum escape of any variables in dest state
duke@435:     assert(d_state->_stack_height == s_state->_stack_height, "computed stack heights must match");
duke@435:     ArgumentMap extra_vars;
duke@435:     for (int i = 0; i < nlocals; i++) {
duke@435:       ArgumentMap t;
duke@435:       t = s_state->_vars[i];
duke@435:       t.set_difference(d_state->_vars[i]);
duke@435:       extra_vars.set_union(t);
duke@435:     }
duke@435:     for (int i = 0; i < s_state->_stack_height; i++) {
duke@435:       ArgumentMap t;
kvn@480:       //extra_vars |= !d_state->_vars[i] & s_state->_vars[i];
duke@435:       t.clear();
duke@435:       t = s_state->_stack[i];
duke@435:       t.set_difference(d_state->_stack[i]);
duke@435:       extra_vars.set_union(t);
duke@435:     }
duke@435:     set_global_escape(extra_vars);
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::iterate_blocks(Arena *arena) {
duke@435:   int numblocks = _methodBlocks->num_blocks();
duke@435:   int stkSize   = _method->max_stack();
duke@435:   int numLocals = _method->max_locals();
duke@435:   StateInfo state;
duke@435: 
duke@435:   int datacount = (numblocks + 1) * (stkSize + numLocals);
duke@435:   int datasize = datacount * sizeof(ArgumentMap);
kvn@480:   StateInfo *blockstates = (StateInfo *) arena->Amalloc(numblocks * sizeof(StateInfo));
duke@435:   ArgumentMap *statedata  = (ArgumentMap *) arena->Amalloc(datasize);
duke@435:   for (int i = 0; i < datacount; i++) ::new ((void*)&statedata[i]) ArgumentMap();
duke@435:   ArgumentMap *dp = statedata;
duke@435:   state._vars = dp;
duke@435:   dp += numLocals;
duke@435:   state._stack = dp;
duke@435:   dp += stkSize;
duke@435:   state._initialized = false;
duke@435:   state._max_stack = stkSize;
duke@435:   for (int i = 0; i < numblocks; i++) {
duke@435:     blockstates[i]._vars = dp;
duke@435:     dp += numLocals;
duke@435:     blockstates[i]._stack = dp;
duke@435:     dp += stkSize;
duke@435:     blockstates[i]._initialized = false;
duke@435:     blockstates[i]._stack_height = 0;
duke@435:     blockstates[i]._max_stack  = stkSize;
duke@435:   }
duke@435:   GrowableArray<ciBlock *> worklist(arena, numblocks / 4, 0, NULL);
duke@435:   GrowableArray<ciBlock *> successors(arena, 4, 0, NULL);
duke@435: 
duke@435:   _methodBlocks->clear_processed();
duke@435: 
duke@435:   // initialize block 0 state from method signature
duke@435:   ArgumentMap allVars;   // all oop arguments to method
duke@435:   ciSignature* sig = method()->signature();
duke@435:   int j = 0;
kvn@480:   ciBlock* first_blk = _methodBlocks->block_containing(0);
kvn@480:   int fb_i = first_blk->index();
duke@435:   if (!method()->is_static()) {
duke@435:     // record information for "this"
kvn@480:     blockstates[fb_i]._vars[j].set(j);
duke@435:     allVars.add(j);
duke@435:     j++;
duke@435:   }
duke@435:   for (int i = 0; i < sig->count(); i++) {
duke@435:     ciType* t = sig->type_at(i);
duke@435:     if (!t->is_primitive_type()) {
kvn@480:       blockstates[fb_i]._vars[j].set(j);
duke@435:       allVars.add(j);
duke@435:     }
duke@435:     j += t->size();
duke@435:   }
kvn@480:   blockstates[fb_i]._initialized = true;
duke@435:   assert(j == _arg_size, "just checking");
duke@435: 
duke@435:   ArgumentMap unknown_map;
duke@435:   unknown_map.add_unknown();
duke@435: 
kvn@480:   worklist.push(first_blk);
duke@435:   while(worklist.length() > 0) {
duke@435:     ciBlock *blk = worklist.pop();
kvn@480:     StateInfo *blkState = blockstates + blk->index();
duke@435:     if (blk->is_handler() || blk->is_ret_target()) {
duke@435:       // for an exception handler or a target of a ret instruction, we assume the worst case,
kvn@480:       // that any variable could contain any argument
duke@435:       for (int i = 0; i < numLocals; i++) {
duke@435:         state._vars[i] = allVars;
duke@435:       }
duke@435:       if (blk->is_handler()) {
duke@435:         state._stack_height = 1;
duke@435:       } else {
duke@435:         state._stack_height = blkState->_stack_height;
duke@435:       }
duke@435:       for (int i = 0; i < state._stack_height; i++) {
kvn@480: // ??? should this be unknown_map ???
duke@435:         state._stack[i] = allVars;
duke@435:       }
duke@435:     } else {
duke@435:       for (int i = 0; i < numLocals; i++) {
duke@435:         state._vars[i] = blkState->_vars[i];
duke@435:       }
duke@435:       for (int i = 0; i < blkState->_stack_height; i++) {
duke@435:         state._stack[i] = blkState->_stack[i];
duke@435:       }
duke@435:       state._stack_height = blkState->_stack_height;
duke@435:     }
duke@435:     iterate_one_block(blk, state, successors);
duke@435:     // if this block has any exception handlers, push them
duke@435:     // onto successor list
duke@435:     if (blk->has_handler()) {
duke@435:       DEBUG_ONLY(int handler_count = 0;)
duke@435:       int blk_start = blk->start_bci();
duke@435:       int blk_end = blk->limit_bci();
duke@435:       for (int i = 0; i < numblocks; i++) {
duke@435:         ciBlock *b = _methodBlocks->block(i);
duke@435:         if (b->is_handler()) {
duke@435:           int ex_start = b->ex_start_bci();
duke@435:           int ex_end = b->ex_limit_bci();
duke@435:           if ((ex_start >= blk_start && ex_start < blk_end) ||
duke@435:               (ex_end > blk_start && ex_end <= blk_end)) {
duke@435:             successors.push(b);
duke@435:           }
duke@435:           DEBUG_ONLY(handler_count++;)
duke@435:         }
duke@435:       }
duke@435:       assert(handler_count > 0, "must find at least one handler");
duke@435:     }
duke@435:     // merge computed variable state with successors
duke@435:     while(successors.length() > 0) {
duke@435:       ciBlock *succ = successors.pop();
duke@435:       merge_block_states(blockstates, succ, &state);
duke@435:       if (!succ->processed())
duke@435:         worklist.push(succ);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: bool BCEscapeAnalyzer::do_analysis() {
duke@435:   Arena* arena = CURRENT_ENV->arena();
duke@435:   // identify basic blocks
duke@435:   _methodBlocks = _method->get_method_blocks();
duke@435: 
duke@435:   iterate_blocks(arena);
duke@435:   // TEMPORARY
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: vmIntrinsics::ID BCEscapeAnalyzer::known_intrinsic() {
duke@435:   vmIntrinsics::ID iid = method()->intrinsic_id();
duke@435: 
duke@435:   if (iid == vmIntrinsics::_getClass ||
kvn@480:       iid ==  vmIntrinsics::_fillInStackTrace ||
duke@435:       iid == vmIntrinsics::_hashCode)
duke@435:     return iid;
duke@435:   else
duke@435:     return vmIntrinsics::_none;
duke@435: }
duke@435: 
duke@435: bool BCEscapeAnalyzer::compute_escape_for_intrinsic(vmIntrinsics::ID iid) {
kvn@480:   ArgumentMap arg;
kvn@480:   arg.clear();
duke@435:   switch (iid) {
duke@435:   case vmIntrinsics::_getClass:
duke@435:     _return_local = false;
duke@435:     break;
kvn@480:   case vmIntrinsics::_fillInStackTrace:
kvn@480:     arg.set(0); // 'this'
kvn@480:     set_returned(arg);
kvn@480:     break;
duke@435:   case vmIntrinsics::_hashCode:
duke@435:     // initialized state is correct
duke@435:     break;
duke@435:   default:
duke@435:     assert(false, "unexpected intrinsic");
duke@435:   }
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::initialize() {
duke@435:   int i;
duke@435: 
duke@435:   // clear escape information (method may have been deoptimized)
duke@435:   methodData()->clear_escape_info();
duke@435: 
duke@435:   // initialize escape state of object parameters
duke@435:   ciSignature* sig = method()->signature();
duke@435:   int j = 0;
duke@435:   if (!method()->is_static()) {
duke@435:     _arg_local.set_bit(0);
duke@435:     _arg_stack.set_bit(0);
duke@435:     j++;
duke@435:   }
duke@435:   for (i = 0; i < sig->count(); i++) {
duke@435:     ciType* t = sig->type_at(i);
duke@435:     if (!t->is_primitive_type()) {
duke@435:       _arg_local.set_bit(j);
duke@435:       _arg_stack.set_bit(j);
duke@435:     }
duke@435:     j += t->size();
duke@435:   }
duke@435:   assert(j == _arg_size, "just checking");
duke@435: 
duke@435:   // start with optimistic assumption
duke@435:   ciType *rt = _method->return_type();
duke@435:   if (rt->is_primitive_type()) {
duke@435:     _return_local = false;
duke@435:     _return_allocated = false;
duke@435:   } else {
duke@435:     _return_local = true;
duke@435:     _return_allocated = true;
duke@435:   }
duke@435:   _allocated_escapes = false;
kvn@480:   _unknown_modified = false;
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::clear_escape_info() {
duke@435:   ciSignature* sig = method()->signature();
duke@435:   int arg_count = sig->count();
duke@435:   ArgumentMap var;
kvn@480:   if (!method()->is_static()) {
kvn@480:     arg_count++;  // allow for "this"
kvn@480:   }
duke@435:   for (int i = 0; i < arg_count; i++) {
kvn@480:     set_arg_modified(i, OFFSET_ANY, 4);
duke@435:     var.clear();
duke@435:     var.set(i);
kvn@480:     set_modified(var, OFFSET_ANY, 4);
duke@435:     set_global_escape(var);
duke@435:   }
duke@435:   _arg_local.clear();
duke@435:   _arg_stack.clear();
duke@435:   _arg_returned.clear();
duke@435:   _return_local = false;
duke@435:   _return_allocated = false;
duke@435:   _allocated_escapes = true;
kvn@480:   _unknown_modified = true;
duke@435: }
duke@435: 
duke@435: 
duke@435: void BCEscapeAnalyzer::compute_escape_info() {
duke@435:   int i;
duke@435:   assert(!methodData()->has_escape_info(), "do not overwrite escape info");
duke@435: 
duke@435:   vmIntrinsics::ID iid = known_intrinsic();
duke@435: 
duke@435:   // check if method can be analyzed
duke@435:   if (iid ==  vmIntrinsics::_none && (method()->is_abstract() || method()->is_native() || !method()->holder()->is_initialized()
duke@435:       || _level > MaxBCEAEstimateLevel
duke@435:       || method()->code_size() > MaxBCEAEstimateSize)) {
duke@435:     if (BCEATraceLevel >= 1) {
duke@435:       tty->print("Skipping method because: ");
duke@435:       if (method()->is_abstract())
duke@435:         tty->print_cr("method is abstract.");
duke@435:       else if (method()->is_native())
duke@435:         tty->print_cr("method is native.");
duke@435:       else if (!method()->holder()->is_initialized())
duke@435:         tty->print_cr("class of method is not initialized.");
duke@435:       else if (_level > MaxBCEAEstimateLevel)
duke@435:         tty->print_cr("level (%d) exceeds MaxBCEAEstimateLevel (%d).",
duke@435:                       _level, MaxBCEAEstimateLevel);
duke@435:       else if (method()->code_size() > MaxBCEAEstimateSize)
duke@435:         tty->print_cr("code size (%d) exceeds MaxBCEAEstimateSize.",
duke@435:                       method()->code_size(), MaxBCEAEstimateSize);
duke@435:       else
duke@435:         ShouldNotReachHere();
duke@435:     }
duke@435:     clear_escape_info();
duke@435: 
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   if (BCEATraceLevel >= 1) {
duke@435:     tty->print("[EA] estimating escape information for");
duke@435:     if (iid != vmIntrinsics::_none)
duke@435:       tty->print(" intrinsic");
duke@435:     method()->print_short_name();
duke@435:     tty->print_cr(" (%d bytes)", method()->code_size());
duke@435:   }
duke@435: 
duke@435:   bool success;
duke@435: 
duke@435:   initialize();
duke@435: 
kvn@513:   // Do not scan method if it has no object parameters and
kvn@513:   // does not returns an object (_return_allocated is set in initialize()).
kvn@513:   if (_arg_local.is_empty() && !_return_allocated) {
kvn@513:     // Clear all info since method's bytecode was not analysed and
kvn@513:     // set pessimistic escape information.
kvn@513:     clear_escape_info();
kvn@513:     methodData()->set_eflag(methodDataOopDesc::allocated_escapes);
kvn@513:     methodData()->set_eflag(methodDataOopDesc::unknown_modified);
duke@435:     methodData()->set_eflag(methodDataOopDesc::estimated);
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   if (iid != vmIntrinsics::_none)
duke@435:     success = compute_escape_for_intrinsic(iid);
duke@435:   else {
duke@435:     success = do_analysis();
duke@435:   }
duke@435: 
kvn@513:   // don't store interprocedural escape information if it introduces
kvn@513:   // dependencies or if method data is empty
duke@435:   //
duke@435:   if (!has_dependencies() && !methodData()->is_empty()) {
duke@435:     for (i = 0; i < _arg_size; i++) {
duke@435:       if (_arg_local.at(i)) {
duke@435:         assert(_arg_stack.at(i), "inconsistent escape info");
duke@435:         methodData()->set_arg_local(i);
duke@435:         methodData()->set_arg_stack(i);
duke@435:       } else if (_arg_stack.at(i)) {
duke@435:         methodData()->set_arg_stack(i);
duke@435:       }
duke@435:       if (_arg_returned.at(i)) {
duke@435:         methodData()->set_arg_returned(i);
duke@435:       }
kvn@480:       methodData()->set_arg_modified(i, _arg_modified[i]);
duke@435:     }
duke@435:     if (_return_local) {
duke@435:       methodData()->set_eflag(methodDataOopDesc::return_local);
duke@435:     }
kvn@513:     if (_return_allocated) {
kvn@513:       methodData()->set_eflag(methodDataOopDesc::return_allocated);
kvn@513:     }
kvn@513:     if (_allocated_escapes) {
kvn@513:       methodData()->set_eflag(methodDataOopDesc::allocated_escapes);
kvn@513:     }
kvn@513:     if (_unknown_modified) {
kvn@513:       methodData()->set_eflag(methodDataOopDesc::unknown_modified);
kvn@513:     }
duke@435:     methodData()->set_eflag(methodDataOopDesc::estimated);
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::read_escape_info() {
duke@435:   assert(methodData()->has_escape_info(), "no escape info available");
duke@435: 
duke@435:   // read escape information from method descriptor
duke@435:   for (int i = 0; i < _arg_size; i++) {
duke@435:     _arg_local.at_put(i, methodData()->is_arg_local(i));
duke@435:     _arg_stack.at_put(i, methodData()->is_arg_stack(i));
duke@435:     _arg_returned.at_put(i, methodData()->is_arg_returned(i));
kvn@480:     _arg_modified[i] = methodData()->arg_modified(i);
duke@435:   }
duke@435:   _return_local = methodData()->eflag_set(methodDataOopDesc::return_local);
kvn@513:   _return_allocated = methodData()->eflag_set(methodDataOopDesc::return_allocated);
kvn@513:   _allocated_escapes = methodData()->eflag_set(methodDataOopDesc::allocated_escapes);
kvn@513:   _unknown_modified = methodData()->eflag_set(methodDataOopDesc::unknown_modified);
duke@435: 
duke@435: }
duke@435: 
kvn@513: #ifndef PRODUCT
kvn@513: void BCEscapeAnalyzer::dump() {
kvn@513:   tty->print("[EA] estimated escape information for");
kvn@513:   method()->print_short_name();
kvn@513:   tty->print_cr(has_dependencies() ? " (not stored)" : "");
kvn@513:   tty->print("     non-escaping args:      ");
kvn@513:   _arg_local.print_on(tty);
kvn@513:   tty->print("     stack-allocatable args: ");
kvn@513:   _arg_stack.print_on(tty);
kvn@513:   if (_return_local) {
kvn@513:     tty->print("     returned args:          ");
kvn@513:     _arg_returned.print_on(tty);
kvn@513:   } else if (is_return_allocated()) {
kvn@513:     tty->print_cr("     return allocated value");
kvn@513:   } else {
kvn@513:     tty->print_cr("     return non-local value");
kvn@513:   }
kvn@513:   tty->print("     modified args: ");
kvn@513:   for (int i = 0; i < _arg_size; i++) {
kvn@513:     if (_arg_modified[i] == 0)
kvn@513:       tty->print("    0");
kvn@513:     else
kvn@513:       tty->print("    0x%x", _arg_modified[i]);
kvn@513:   }
kvn@513:   tty->cr();
kvn@513:   tty->print("     flags: ");
kvn@513:   if (_return_allocated)
kvn@513:     tty->print(" return_allocated");
kvn@513:   if (_allocated_escapes)
kvn@513:     tty->print(" allocated_escapes");
kvn@513:   if (_unknown_modified)
kvn@513:     tty->print(" unknown_modified");
kvn@513:   tty->cr();
kvn@513: }
kvn@513: #endif
duke@435: 
duke@435: BCEscapeAnalyzer::BCEscapeAnalyzer(ciMethod* method, BCEscapeAnalyzer* parent)
duke@435:     : _conservative(method == NULL || !EstimateArgEscape)
duke@435:     , _method(method)
duke@435:     , _methodData(method ? method->method_data() : NULL)
duke@435:     , _arg_size(method ? method->arg_size() : 0)
duke@435:     , _stack()
duke@435:     , _arg_local(_arg_size)
duke@435:     , _arg_stack(_arg_size)
duke@435:     , _arg_returned(_arg_size)
duke@435:     , _dirty(_arg_size)
duke@435:     , _return_local(false)
duke@435:     , _return_allocated(false)
duke@435:     , _allocated_escapes(false)
kvn@480:     , _unknown_modified(false)
duke@435:     , _dependencies()
duke@435:     , _parent(parent)
duke@435:     , _level(parent == NULL ? 0 : parent->level() + 1) {
duke@435:   if (!_conservative) {
duke@435:     _arg_local.clear();
duke@435:     _arg_stack.clear();
duke@435:     _arg_returned.clear();
duke@435:     _dirty.clear();
duke@435:     Arena* arena = CURRENT_ENV->arena();
kvn@480:     _arg_modified = (uint *) arena->Amalloc(_arg_size * sizeof(uint));
kvn@480:     Copy::zero_to_bytes(_arg_modified, _arg_size * sizeof(uint));
duke@435: 
duke@435:     if (methodData() == NULL)
duke@435:       return;
duke@435:     bool printit = _method->should_print_assembly();
duke@435:     if (methodData()->has_escape_info()) {
duke@435:       TRACE_BCEA(2, tty->print_cr("[EA] Reading previous results for %s.%s",
duke@435:                                   method->holder()->name()->as_utf8(),
duke@435:                                   method->name()->as_utf8()));
duke@435:       read_escape_info();
duke@435:     } else {
duke@435:       TRACE_BCEA(2, tty->print_cr("[EA] computing results for %s.%s",
duke@435:                                   method->holder()->name()->as_utf8(),
duke@435:                                   method->name()->as_utf8()));
duke@435: 
duke@435:       compute_escape_info();
duke@435:       methodData()->update_escape_info();
duke@435:     }
kvn@513: #ifndef PRODUCT
kvn@513:     if (BCEATraceLevel >= 3) {
kvn@513:       // dump escape information
kvn@513:       dump();
kvn@513:     }
kvn@513: #endif
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BCEscapeAnalyzer::copy_dependencies(Dependencies *deps) {
duke@435:   if(!has_dependencies())
duke@435:     return;
duke@435:   for (int i = 0; i < _dependencies.length(); i+=2) {
duke@435:     ciKlass *k = _dependencies[i]->as_klass();
duke@435:     ciMethod *m = _dependencies[i+1]->as_method();
duke@435:     deps->assert_unique_concrete_method(k, m);
duke@435:   }
duke@435: }