Thu, 15 May 2008 22:40:43 -0700
6700102: c2 assertion "counter_changed,"failed dependencies, but counter didn't change")" with AggressiveOpts
Summary: Bytecode Escape Analyzer does not have the check for the case described in 6389127.
Reviewed-by: never
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2005-2006 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | |
duke@435 | 26 | #include "incls/_precompiled.incl" |
duke@435 | 27 | #include "incls/_bcEscapeAnalyzer.cpp.incl" |
duke@435 | 28 | |
duke@435 | 29 | |
duke@435 | 30 | #ifndef PRODUCT |
duke@435 | 31 | #define TRACE_BCEA(level, code) \ |
duke@435 | 32 | if (EstimateArgEscape && BCEATraceLevel >= level) { \ |
duke@435 | 33 | code; \ |
duke@435 | 34 | } |
duke@435 | 35 | #else |
duke@435 | 36 | #define TRACE_BCEA(level, code) |
duke@435 | 37 | #endif |
duke@435 | 38 | |
duke@435 | 39 | // Maintain a map of which aguments a local variable or |
duke@435 | 40 | // stack slot may contain. In addition to tracking |
duke@435 | 41 | // arguments, it tracks two special values, "allocated" |
duke@435 | 42 | // which represents any object allocated in the current |
duke@435 | 43 | // method, and "unknown" which is any other object. |
duke@435 | 44 | // Up to 30 arguments are handled, with the last one |
duke@435 | 45 | // representing summary information for any extra arguments |
duke@435 | 46 | class BCEscapeAnalyzer::ArgumentMap { |
duke@435 | 47 | uint _bits; |
duke@435 | 48 | enum {MAXBIT = 29, |
duke@435 | 49 | ALLOCATED = 1, |
duke@435 | 50 | UNKNOWN = 2}; |
duke@435 | 51 | |
duke@435 | 52 | uint int_to_bit(uint e) const { |
duke@435 | 53 | if (e > MAXBIT) |
duke@435 | 54 | e = MAXBIT; |
duke@435 | 55 | return (1 << (e + 2)); |
duke@435 | 56 | } |
duke@435 | 57 | |
duke@435 | 58 | public: |
duke@435 | 59 | ArgumentMap() { _bits = 0;} |
duke@435 | 60 | void set_bits(uint bits) { _bits = bits;} |
duke@435 | 61 | uint get_bits() const { return _bits;} |
duke@435 | 62 | void clear() { _bits = 0;} |
duke@435 | 63 | void set_all() { _bits = ~0u; } |
duke@435 | 64 | bool is_empty() const { return _bits == 0; } |
duke@435 | 65 | bool contains(uint var) const { return (_bits & int_to_bit(var)) != 0; } |
duke@435 | 66 | bool is_singleton(uint var) const { return (_bits == int_to_bit(var)); } |
duke@435 | 67 | bool contains_unknown() const { return (_bits & UNKNOWN) != 0; } |
duke@435 | 68 | bool contains_allocated() const { return (_bits & ALLOCATED) != 0; } |
duke@435 | 69 | bool contains_vars() const { return (_bits & (((1 << MAXBIT) -1) << 2)) != 0; } |
duke@435 | 70 | void set(uint var) { _bits = int_to_bit(var); } |
duke@435 | 71 | void add(uint var) { _bits |= int_to_bit(var); } |
duke@435 | 72 | void add_unknown() { _bits = UNKNOWN; } |
duke@435 | 73 | void add_allocated() { _bits = ALLOCATED; } |
duke@435 | 74 | void set_union(const ArgumentMap &am) { _bits |= am._bits; } |
duke@435 | 75 | void set_intersect(const ArgumentMap &am) { _bits |= am._bits; } |
duke@435 | 76 | void set_difference(const ArgumentMap &am) { _bits &= ~am._bits; } |
duke@435 | 77 | void operator=(const ArgumentMap &am) { _bits = am._bits; } |
duke@435 | 78 | bool operator==(const ArgumentMap &am) { return _bits == am._bits; } |
duke@435 | 79 | bool operator!=(const ArgumentMap &am) { return _bits != am._bits; } |
duke@435 | 80 | }; |
duke@435 | 81 | |
duke@435 | 82 | class BCEscapeAnalyzer::StateInfo { |
duke@435 | 83 | public: |
duke@435 | 84 | ArgumentMap *_vars; |
duke@435 | 85 | ArgumentMap *_stack; |
duke@435 | 86 | short _stack_height; |
duke@435 | 87 | short _max_stack; |
duke@435 | 88 | bool _initialized; |
duke@435 | 89 | ArgumentMap empty_map; |
duke@435 | 90 | |
duke@435 | 91 | StateInfo() { |
duke@435 | 92 | empty_map.clear(); |
duke@435 | 93 | } |
duke@435 | 94 | |
duke@435 | 95 | ArgumentMap raw_pop() { assert(_stack_height > 0, "stack underflow"); return _stack[--_stack_height]; } |
duke@435 | 96 | ArgumentMap apop() { return raw_pop(); } |
duke@435 | 97 | void spop() { raw_pop(); } |
duke@435 | 98 | void lpop() { spop(); spop(); } |
duke@435 | 99 | void raw_push(ArgumentMap i) { assert(_stack_height < _max_stack, "stack overflow"); _stack[_stack_height++] = i; } |
duke@435 | 100 | void apush(ArgumentMap i) { raw_push(i); } |
duke@435 | 101 | void spush() { raw_push(empty_map); } |
duke@435 | 102 | void lpush() { spush(); spush(); } |
duke@435 | 103 | |
duke@435 | 104 | }; |
duke@435 | 105 | |
duke@435 | 106 | void BCEscapeAnalyzer::set_returned(ArgumentMap vars) { |
kvn@480 | 107 | for (int i = 0; i < _arg_size; i++) { |
duke@435 | 108 | if (vars.contains(i)) |
duke@435 | 109 | _arg_returned.set_bit(i); |
duke@435 | 110 | } |
duke@435 | 111 | _return_local = _return_local && !(vars.contains_unknown() || vars.contains_allocated()); |
duke@435 | 112 | _return_allocated = _return_allocated && vars.contains_allocated() && !(vars.contains_unknown() || vars.contains_vars()); |
duke@435 | 113 | } |
duke@435 | 114 | |
duke@435 | 115 | // return true if any element of vars is an argument |
duke@435 | 116 | bool BCEscapeAnalyzer::is_argument(ArgumentMap vars) { |
kvn@480 | 117 | for (int i = 0; i < _arg_size; i++) { |
duke@435 | 118 | if (vars.contains(i)) |
duke@435 | 119 | return true; |
duke@435 | 120 | } |
duke@435 | 121 | return false; |
duke@435 | 122 | } |
duke@435 | 123 | |
duke@435 | 124 | // return true if any element of vars is an arg_stack argument |
duke@435 | 125 | bool BCEscapeAnalyzer::is_arg_stack(ArgumentMap vars){ |
duke@435 | 126 | if (_conservative) |
duke@435 | 127 | return true; |
kvn@480 | 128 | for (int i = 0; i < _arg_size; i++) { |
duke@435 | 129 | if (vars.contains(i) && _arg_stack.at(i)) |
duke@435 | 130 | return true; |
duke@435 | 131 | } |
duke@435 | 132 | return false; |
duke@435 | 133 | } |
duke@435 | 134 | |
duke@435 | 135 | void BCEscapeAnalyzer::clear_bits(ArgumentMap vars, BitMap &bm) { |
kvn@480 | 136 | for (int i = 0; i < _arg_size; i++) { |
duke@435 | 137 | if (vars.contains(i)) { |
duke@435 | 138 | bm.clear_bit(i); |
duke@435 | 139 | } |
duke@435 | 140 | } |
duke@435 | 141 | } |
kvn@480 | 142 | |
duke@435 | 143 | void BCEscapeAnalyzer::set_method_escape(ArgumentMap vars) { |
duke@435 | 144 | clear_bits(vars, _arg_local); |
duke@435 | 145 | } |
duke@435 | 146 | |
duke@435 | 147 | void BCEscapeAnalyzer::set_global_escape(ArgumentMap vars) { |
duke@435 | 148 | clear_bits(vars, _arg_local); |
duke@435 | 149 | clear_bits(vars, _arg_stack); |
duke@435 | 150 | if (vars.contains_allocated()) |
duke@435 | 151 | _allocated_escapes = true; |
duke@435 | 152 | } |
duke@435 | 153 | |
duke@435 | 154 | void BCEscapeAnalyzer::set_dirty(ArgumentMap vars) { |
duke@435 | 155 | clear_bits(vars, _dirty); |
duke@435 | 156 | } |
duke@435 | 157 | |
kvn@480 | 158 | void BCEscapeAnalyzer::set_modified(ArgumentMap vars, int offs, int size) { |
kvn@480 | 159 | |
kvn@480 | 160 | for (int i = 0; i < _arg_size; i++) { |
kvn@480 | 161 | if (vars.contains(i)) { |
kvn@480 | 162 | set_arg_modified(i, offs, size); |
kvn@480 | 163 | } |
kvn@480 | 164 | } |
kvn@480 | 165 | if (vars.contains_unknown()) |
kvn@480 | 166 | _unknown_modified = true; |
kvn@480 | 167 | } |
kvn@480 | 168 | |
duke@435 | 169 | bool BCEscapeAnalyzer::is_recursive_call(ciMethod* callee) { |
duke@435 | 170 | for (BCEscapeAnalyzer* scope = this; scope != NULL; scope = scope->_parent) { |
duke@435 | 171 | if (scope->method() == callee) { |
duke@435 | 172 | return true; |
duke@435 | 173 | } |
duke@435 | 174 | } |
duke@435 | 175 | return false; |
duke@435 | 176 | } |
duke@435 | 177 | |
kvn@480 | 178 | bool BCEscapeAnalyzer::is_arg_modified(int arg, int offset, int size_in_bytes) { |
kvn@480 | 179 | if (offset == OFFSET_ANY) |
kvn@480 | 180 | return _arg_modified[arg] != 0; |
kvn@480 | 181 | assert(arg >= 0 && arg < _arg_size, "must be an argument."); |
kvn@480 | 182 | bool modified = false; |
kvn@480 | 183 | int l = offset / HeapWordSize; |
kvn@480 | 184 | int h = round_to(offset + size_in_bytes, HeapWordSize) / HeapWordSize; |
kvn@480 | 185 | if (l > ARG_OFFSET_MAX) |
kvn@480 | 186 | l = ARG_OFFSET_MAX; |
kvn@480 | 187 | if (h > ARG_OFFSET_MAX+1) |
kvn@480 | 188 | h = ARG_OFFSET_MAX + 1; |
kvn@480 | 189 | for (int i = l; i < h; i++) { |
kvn@480 | 190 | modified = modified || (_arg_modified[arg] & (1 << i)) != 0; |
kvn@480 | 191 | } |
kvn@480 | 192 | return modified; |
kvn@480 | 193 | } |
kvn@480 | 194 | |
kvn@480 | 195 | void BCEscapeAnalyzer::set_arg_modified(int arg, int offset, int size_in_bytes) { |
kvn@480 | 196 | if (offset == OFFSET_ANY) { |
kvn@480 | 197 | _arg_modified[arg] = (uint) -1; |
kvn@480 | 198 | return; |
kvn@480 | 199 | } |
kvn@480 | 200 | assert(arg >= 0 && arg < _arg_size, "must be an argument."); |
kvn@480 | 201 | int l = offset / HeapWordSize; |
kvn@480 | 202 | int h = round_to(offset + size_in_bytes, HeapWordSize) / HeapWordSize; |
kvn@480 | 203 | if (l > ARG_OFFSET_MAX) |
kvn@480 | 204 | l = ARG_OFFSET_MAX; |
kvn@480 | 205 | if (h > ARG_OFFSET_MAX+1) |
kvn@480 | 206 | h = ARG_OFFSET_MAX + 1; |
kvn@480 | 207 | for (int i = l; i < h; i++) { |
kvn@480 | 208 | _arg_modified[arg] |= (1 << i); |
kvn@480 | 209 | } |
kvn@480 | 210 | } |
kvn@480 | 211 | |
duke@435 | 212 | void BCEscapeAnalyzer::invoke(StateInfo &state, Bytecodes::Code code, ciMethod* target, ciKlass* holder) { |
duke@435 | 213 | int i; |
duke@435 | 214 | |
duke@435 | 215 | // retrieve information about the callee |
duke@435 | 216 | ciInstanceKlass* klass = target->holder(); |
duke@435 | 217 | ciInstanceKlass* calling_klass = method()->holder(); |
duke@435 | 218 | ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder); |
duke@435 | 219 | ciInstanceKlass* actual_recv = callee_holder; |
duke@435 | 220 | |
kvn@589 | 221 | // some methods are obviously bindable without any type checks so |
kvn@589 | 222 | // convert them directly to an invokespecial. |
kvn@589 | 223 | if (target->is_loaded() && !target->is_abstract() && |
kvn@589 | 224 | target->can_be_statically_bound() && code == Bytecodes::_invokevirtual) { |
kvn@589 | 225 | code = Bytecodes::_invokespecial; |
kvn@589 | 226 | } |
kvn@589 | 227 | |
duke@435 | 228 | // compute size of arguments |
duke@435 | 229 | int arg_size = target->arg_size(); |
duke@435 | 230 | if (!target->is_loaded() && code == Bytecodes::_invokestatic) { |
duke@435 | 231 | arg_size--; |
duke@435 | 232 | } |
duke@435 | 233 | int arg_base = MAX2(state._stack_height - arg_size, 0); |
duke@435 | 234 | |
duke@435 | 235 | // direct recursive calls are skipped if they can be bound statically without introducing |
duke@435 | 236 | // dependencies and if parameters are passed at the same position as in the current method |
duke@435 | 237 | // other calls are skipped if there are no unescaped arguments passed to them |
duke@435 | 238 | bool directly_recursive = (method() == target) && |
duke@435 | 239 | (code != Bytecodes::_invokevirtual || target->is_final_method() || state._stack[arg_base] .is_empty()); |
duke@435 | 240 | |
duke@435 | 241 | // check if analysis of callee can safely be skipped |
duke@435 | 242 | bool skip_callee = true; |
duke@435 | 243 | for (i = state._stack_height - 1; i >= arg_base && skip_callee; i--) { |
duke@435 | 244 | ArgumentMap arg = state._stack[i]; |
duke@435 | 245 | skip_callee = !is_argument(arg) || !is_arg_stack(arg) || (directly_recursive && arg.is_singleton(i - arg_base)); |
duke@435 | 246 | } |
duke@435 | 247 | if (skip_callee) { |
duke@435 | 248 | TRACE_BCEA(3, tty->print_cr("[EA] skipping method %s::%s", holder->name()->as_utf8(), target->name()->as_utf8())); |
duke@435 | 249 | for (i = 0; i < arg_size; i++) { |
duke@435 | 250 | set_method_escape(state.raw_pop()); |
duke@435 | 251 | } |
kvn@480 | 252 | _unknown_modified = true; // assume the worst since we don't analyze the called method |
duke@435 | 253 | return; |
duke@435 | 254 | } |
duke@435 | 255 | |
duke@435 | 256 | // determine actual method (use CHA if necessary) |
duke@435 | 257 | ciMethod* inline_target = NULL; |
duke@435 | 258 | if (target->is_loaded() && klass->is_loaded() |
duke@435 | 259 | && (klass->is_initialized() || klass->is_interface() && target->holder()->is_initialized()) |
duke@435 | 260 | && target->will_link(klass, callee_holder, code)) { |
duke@435 | 261 | if (code == Bytecodes::_invokestatic |
duke@435 | 262 | || code == Bytecodes::_invokespecial |
duke@435 | 263 | || code == Bytecodes::_invokevirtual && target->is_final_method()) { |
duke@435 | 264 | inline_target = target; |
duke@435 | 265 | } else { |
duke@435 | 266 | inline_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv); |
duke@435 | 267 | } |
duke@435 | 268 | } |
duke@435 | 269 | |
duke@435 | 270 | if (inline_target != NULL && !is_recursive_call(inline_target)) { |
duke@435 | 271 | // analyze callee |
duke@435 | 272 | BCEscapeAnalyzer analyzer(inline_target, this); |
duke@435 | 273 | |
duke@435 | 274 | // adjust escape state of actual parameters |
duke@435 | 275 | bool must_record_dependencies = false; |
duke@435 | 276 | for (i = arg_size - 1; i >= 0; i--) { |
duke@435 | 277 | ArgumentMap arg = state.raw_pop(); |
duke@435 | 278 | if (!is_argument(arg)) |
duke@435 | 279 | continue; |
kvn@480 | 280 | for (int j = 0; j < _arg_size; j++) { |
kvn@480 | 281 | if (arg.contains(j)) { |
kvn@480 | 282 | _arg_modified[j] |= analyzer._arg_modified[i]; |
kvn@480 | 283 | } |
kvn@480 | 284 | } |
duke@435 | 285 | if (!is_arg_stack(arg)) { |
duke@435 | 286 | // arguments have already been recognized as escaping |
duke@435 | 287 | } else if (analyzer.is_arg_stack(i) && !analyzer.is_arg_returned(i)) { |
duke@435 | 288 | set_method_escape(arg); |
duke@435 | 289 | must_record_dependencies = true; |
duke@435 | 290 | } else { |
duke@435 | 291 | set_global_escape(arg); |
duke@435 | 292 | } |
duke@435 | 293 | } |
kvn@480 | 294 | _unknown_modified = _unknown_modified || analyzer.has_non_arg_side_affects(); |
duke@435 | 295 | |
duke@435 | 296 | // record dependencies if at least one parameter retained stack-allocatable |
duke@435 | 297 | if (must_record_dependencies) { |
duke@435 | 298 | if (code == Bytecodes::_invokeinterface || code == Bytecodes::_invokevirtual && !target->is_final_method()) { |
duke@435 | 299 | _dependencies.append(actual_recv); |
duke@435 | 300 | _dependencies.append(inline_target); |
duke@435 | 301 | } |
duke@435 | 302 | _dependencies.appendAll(analyzer.dependencies()); |
duke@435 | 303 | } |
duke@435 | 304 | } else { |
duke@435 | 305 | TRACE_BCEA(1, tty->print_cr("[EA] virtual method %s is not monomorphic.", |
duke@435 | 306 | target->name()->as_utf8())); |
duke@435 | 307 | // conservatively mark all actual parameters as escaping globally |
duke@435 | 308 | for (i = 0; i < arg_size; i++) { |
duke@435 | 309 | ArgumentMap arg = state.raw_pop(); |
duke@435 | 310 | if (!is_argument(arg)) |
duke@435 | 311 | continue; |
kvn@480 | 312 | set_modified(arg, OFFSET_ANY, type2size[T_INT]*HeapWordSize); |
duke@435 | 313 | set_global_escape(arg); |
duke@435 | 314 | } |
kvn@480 | 315 | _unknown_modified = true; // assume the worst since we don't know the called method |
duke@435 | 316 | } |
duke@435 | 317 | } |
duke@435 | 318 | |
duke@435 | 319 | bool BCEscapeAnalyzer::contains(uint arg_set1, uint arg_set2) { |
duke@435 | 320 | return ((~arg_set1) | arg_set2) == 0; |
duke@435 | 321 | } |
duke@435 | 322 | |
duke@435 | 323 | |
duke@435 | 324 | void BCEscapeAnalyzer::iterate_one_block(ciBlock *blk, StateInfo &state, GrowableArray<ciBlock *> &successors) { |
duke@435 | 325 | |
duke@435 | 326 | blk->set_processed(); |
duke@435 | 327 | ciBytecodeStream s(method()); |
duke@435 | 328 | int limit_bci = blk->limit_bci(); |
duke@435 | 329 | bool fall_through = false; |
duke@435 | 330 | ArgumentMap allocated_obj; |
duke@435 | 331 | allocated_obj.add_allocated(); |
duke@435 | 332 | ArgumentMap unknown_obj; |
duke@435 | 333 | unknown_obj.add_unknown(); |
duke@435 | 334 | ArgumentMap empty_map; |
duke@435 | 335 | |
duke@435 | 336 | s.reset_to_bci(blk->start_bci()); |
duke@435 | 337 | while (s.next() != ciBytecodeStream::EOBC() && s.cur_bci() < limit_bci) { |
duke@435 | 338 | fall_through = true; |
duke@435 | 339 | switch (s.cur_bc()) { |
duke@435 | 340 | case Bytecodes::_nop: |
duke@435 | 341 | break; |
duke@435 | 342 | case Bytecodes::_aconst_null: |
duke@435 | 343 | state.apush(empty_map); |
duke@435 | 344 | break; |
duke@435 | 345 | case Bytecodes::_iconst_m1: |
duke@435 | 346 | case Bytecodes::_iconst_0: |
duke@435 | 347 | case Bytecodes::_iconst_1: |
duke@435 | 348 | case Bytecodes::_iconst_2: |
duke@435 | 349 | case Bytecodes::_iconst_3: |
duke@435 | 350 | case Bytecodes::_iconst_4: |
duke@435 | 351 | case Bytecodes::_iconst_5: |
duke@435 | 352 | case Bytecodes::_fconst_0: |
duke@435 | 353 | case Bytecodes::_fconst_1: |
duke@435 | 354 | case Bytecodes::_fconst_2: |
duke@435 | 355 | case Bytecodes::_bipush: |
duke@435 | 356 | case Bytecodes::_sipush: |
duke@435 | 357 | state.spush(); |
duke@435 | 358 | break; |
duke@435 | 359 | case Bytecodes::_lconst_0: |
duke@435 | 360 | case Bytecodes::_lconst_1: |
duke@435 | 361 | case Bytecodes::_dconst_0: |
duke@435 | 362 | case Bytecodes::_dconst_1: |
duke@435 | 363 | state.lpush(); |
duke@435 | 364 | break; |
duke@435 | 365 | case Bytecodes::_ldc: |
duke@435 | 366 | case Bytecodes::_ldc_w: |
duke@435 | 367 | case Bytecodes::_ldc2_w: |
duke@435 | 368 | if (type2size[s.get_constant().basic_type()] == 1) { |
duke@435 | 369 | state.spush(); |
duke@435 | 370 | } else { |
duke@435 | 371 | state.lpush(); |
duke@435 | 372 | } |
duke@435 | 373 | break; |
duke@435 | 374 | case Bytecodes::_aload: |
duke@435 | 375 | state.apush(state._vars[s.get_index()]); |
duke@435 | 376 | break; |
duke@435 | 377 | case Bytecodes::_iload: |
duke@435 | 378 | case Bytecodes::_fload: |
duke@435 | 379 | case Bytecodes::_iload_0: |
duke@435 | 380 | case Bytecodes::_iload_1: |
duke@435 | 381 | case Bytecodes::_iload_2: |
duke@435 | 382 | case Bytecodes::_iload_3: |
duke@435 | 383 | case Bytecodes::_fload_0: |
duke@435 | 384 | case Bytecodes::_fload_1: |
duke@435 | 385 | case Bytecodes::_fload_2: |
duke@435 | 386 | case Bytecodes::_fload_3: |
duke@435 | 387 | state.spush(); |
duke@435 | 388 | break; |
duke@435 | 389 | case Bytecodes::_lload: |
duke@435 | 390 | case Bytecodes::_dload: |
duke@435 | 391 | case Bytecodes::_lload_0: |
duke@435 | 392 | case Bytecodes::_lload_1: |
duke@435 | 393 | case Bytecodes::_lload_2: |
duke@435 | 394 | case Bytecodes::_lload_3: |
duke@435 | 395 | case Bytecodes::_dload_0: |
duke@435 | 396 | case Bytecodes::_dload_1: |
duke@435 | 397 | case Bytecodes::_dload_2: |
duke@435 | 398 | case Bytecodes::_dload_3: |
duke@435 | 399 | state.lpush(); |
duke@435 | 400 | break; |
duke@435 | 401 | case Bytecodes::_aload_0: |
duke@435 | 402 | state.apush(state._vars[0]); |
duke@435 | 403 | break; |
duke@435 | 404 | case Bytecodes::_aload_1: |
duke@435 | 405 | state.apush(state._vars[1]); |
duke@435 | 406 | break; |
duke@435 | 407 | case Bytecodes::_aload_2: |
duke@435 | 408 | state.apush(state._vars[2]); |
duke@435 | 409 | break; |
duke@435 | 410 | case Bytecodes::_aload_3: |
duke@435 | 411 | state.apush(state._vars[3]); |
duke@435 | 412 | break; |
duke@435 | 413 | case Bytecodes::_iaload: |
duke@435 | 414 | case Bytecodes::_faload: |
duke@435 | 415 | case Bytecodes::_baload: |
duke@435 | 416 | case Bytecodes::_caload: |
duke@435 | 417 | case Bytecodes::_saload: |
duke@435 | 418 | state.spop(); |
duke@435 | 419 | set_method_escape(state.apop()); |
duke@435 | 420 | state.spush(); |
duke@435 | 421 | break; |
duke@435 | 422 | case Bytecodes::_laload: |
duke@435 | 423 | case Bytecodes::_daload: |
duke@435 | 424 | state.spop(); |
duke@435 | 425 | set_method_escape(state.apop()); |
duke@435 | 426 | state.lpush(); |
duke@435 | 427 | break; |
duke@435 | 428 | case Bytecodes::_aaload: |
duke@435 | 429 | { state.spop(); |
duke@435 | 430 | ArgumentMap array = state.apop(); |
duke@435 | 431 | set_method_escape(array); |
duke@435 | 432 | state.apush(unknown_obj); |
duke@435 | 433 | set_dirty(array); |
duke@435 | 434 | } |
duke@435 | 435 | break; |
duke@435 | 436 | case Bytecodes::_istore: |
duke@435 | 437 | case Bytecodes::_fstore: |
duke@435 | 438 | case Bytecodes::_istore_0: |
duke@435 | 439 | case Bytecodes::_istore_1: |
duke@435 | 440 | case Bytecodes::_istore_2: |
duke@435 | 441 | case Bytecodes::_istore_3: |
duke@435 | 442 | case Bytecodes::_fstore_0: |
duke@435 | 443 | case Bytecodes::_fstore_1: |
duke@435 | 444 | case Bytecodes::_fstore_2: |
duke@435 | 445 | case Bytecodes::_fstore_3: |
duke@435 | 446 | state.spop(); |
duke@435 | 447 | break; |
duke@435 | 448 | case Bytecodes::_lstore: |
duke@435 | 449 | case Bytecodes::_dstore: |
duke@435 | 450 | case Bytecodes::_lstore_0: |
duke@435 | 451 | case Bytecodes::_lstore_1: |
duke@435 | 452 | case Bytecodes::_lstore_2: |
duke@435 | 453 | case Bytecodes::_lstore_3: |
duke@435 | 454 | case Bytecodes::_dstore_0: |
duke@435 | 455 | case Bytecodes::_dstore_1: |
duke@435 | 456 | case Bytecodes::_dstore_2: |
duke@435 | 457 | case Bytecodes::_dstore_3: |
duke@435 | 458 | state.lpop(); |
duke@435 | 459 | break; |
duke@435 | 460 | case Bytecodes::_astore: |
duke@435 | 461 | state._vars[s.get_index()] = state.apop(); |
duke@435 | 462 | break; |
duke@435 | 463 | case Bytecodes::_astore_0: |
duke@435 | 464 | state._vars[0] = state.apop(); |
duke@435 | 465 | break; |
duke@435 | 466 | case Bytecodes::_astore_1: |
duke@435 | 467 | state._vars[1] = state.apop(); |
duke@435 | 468 | break; |
duke@435 | 469 | case Bytecodes::_astore_2: |
duke@435 | 470 | state._vars[2] = state.apop(); |
duke@435 | 471 | break; |
duke@435 | 472 | case Bytecodes::_astore_3: |
duke@435 | 473 | state._vars[3] = state.apop(); |
duke@435 | 474 | break; |
duke@435 | 475 | case Bytecodes::_iastore: |
duke@435 | 476 | case Bytecodes::_fastore: |
duke@435 | 477 | case Bytecodes::_bastore: |
duke@435 | 478 | case Bytecodes::_castore: |
duke@435 | 479 | case Bytecodes::_sastore: |
duke@435 | 480 | { |
duke@435 | 481 | state.spop(); |
duke@435 | 482 | state.spop(); |
duke@435 | 483 | ArgumentMap arr = state.apop(); |
duke@435 | 484 | set_method_escape(arr); |
kvn@480 | 485 | set_modified(arr, OFFSET_ANY, type2size[T_INT]*HeapWordSize); |
duke@435 | 486 | break; |
duke@435 | 487 | } |
duke@435 | 488 | case Bytecodes::_lastore: |
duke@435 | 489 | case Bytecodes::_dastore: |
duke@435 | 490 | { |
duke@435 | 491 | state.lpop(); |
duke@435 | 492 | state.spop(); |
duke@435 | 493 | ArgumentMap arr = state.apop(); |
duke@435 | 494 | set_method_escape(arr); |
kvn@480 | 495 | set_modified(arr, OFFSET_ANY, type2size[T_LONG]*HeapWordSize); |
duke@435 | 496 | break; |
duke@435 | 497 | } |
duke@435 | 498 | case Bytecodes::_aastore: |
duke@435 | 499 | { |
duke@435 | 500 | set_global_escape(state.apop()); |
duke@435 | 501 | state.spop(); |
duke@435 | 502 | ArgumentMap arr = state.apop(); |
kvn@480 | 503 | set_modified(arr, OFFSET_ANY, type2size[T_OBJECT]*HeapWordSize); |
duke@435 | 504 | break; |
duke@435 | 505 | } |
duke@435 | 506 | case Bytecodes::_pop: |
duke@435 | 507 | state.raw_pop(); |
duke@435 | 508 | break; |
duke@435 | 509 | case Bytecodes::_pop2: |
duke@435 | 510 | state.raw_pop(); |
duke@435 | 511 | state.raw_pop(); |
duke@435 | 512 | break; |
duke@435 | 513 | case Bytecodes::_dup: |
duke@435 | 514 | { ArgumentMap w1 = state.raw_pop(); |
duke@435 | 515 | state.raw_push(w1); |
duke@435 | 516 | state.raw_push(w1); |
duke@435 | 517 | } |
duke@435 | 518 | break; |
duke@435 | 519 | case Bytecodes::_dup_x1: |
duke@435 | 520 | { ArgumentMap w1 = state.raw_pop(); |
duke@435 | 521 | ArgumentMap w2 = state.raw_pop(); |
duke@435 | 522 | state.raw_push(w1); |
duke@435 | 523 | state.raw_push(w2); |
duke@435 | 524 | state.raw_push(w1); |
duke@435 | 525 | } |
duke@435 | 526 | break; |
duke@435 | 527 | case Bytecodes::_dup_x2: |
duke@435 | 528 | { ArgumentMap w1 = state.raw_pop(); |
duke@435 | 529 | ArgumentMap w2 = state.raw_pop(); |
duke@435 | 530 | ArgumentMap w3 = state.raw_pop(); |
duke@435 | 531 | state.raw_push(w1); |
duke@435 | 532 | state.raw_push(w3); |
duke@435 | 533 | state.raw_push(w2); |
duke@435 | 534 | state.raw_push(w1); |
duke@435 | 535 | } |
duke@435 | 536 | break; |
duke@435 | 537 | case Bytecodes::_dup2: |
duke@435 | 538 | { ArgumentMap w1 = state.raw_pop(); |
duke@435 | 539 | ArgumentMap w2 = state.raw_pop(); |
duke@435 | 540 | state.raw_push(w2); |
duke@435 | 541 | state.raw_push(w1); |
duke@435 | 542 | state.raw_push(w2); |
duke@435 | 543 | state.raw_push(w1); |
duke@435 | 544 | } |
duke@435 | 545 | break; |
duke@435 | 546 | case Bytecodes::_dup2_x1: |
duke@435 | 547 | { ArgumentMap w1 = state.raw_pop(); |
duke@435 | 548 | ArgumentMap w2 = state.raw_pop(); |
duke@435 | 549 | ArgumentMap w3 = state.raw_pop(); |
duke@435 | 550 | state.raw_push(w2); |
duke@435 | 551 | state.raw_push(w1); |
duke@435 | 552 | state.raw_push(w3); |
duke@435 | 553 | state.raw_push(w2); |
duke@435 | 554 | state.raw_push(w1); |
duke@435 | 555 | } |
duke@435 | 556 | break; |
duke@435 | 557 | case Bytecodes::_dup2_x2: |
duke@435 | 558 | { ArgumentMap w1 = state.raw_pop(); |
duke@435 | 559 | ArgumentMap w2 = state.raw_pop(); |
duke@435 | 560 | ArgumentMap w3 = state.raw_pop(); |
duke@435 | 561 | ArgumentMap w4 = state.raw_pop(); |
duke@435 | 562 | state.raw_push(w2); |
duke@435 | 563 | state.raw_push(w1); |
duke@435 | 564 | state.raw_push(w4); |
duke@435 | 565 | state.raw_push(w3); |
duke@435 | 566 | state.raw_push(w2); |
duke@435 | 567 | state.raw_push(w1); |
duke@435 | 568 | } |
duke@435 | 569 | break; |
duke@435 | 570 | case Bytecodes::_swap: |
duke@435 | 571 | { ArgumentMap w1 = state.raw_pop(); |
duke@435 | 572 | ArgumentMap w2 = state.raw_pop(); |
duke@435 | 573 | state.raw_push(w1); |
duke@435 | 574 | state.raw_push(w2); |
duke@435 | 575 | } |
duke@435 | 576 | break; |
duke@435 | 577 | case Bytecodes::_iadd: |
duke@435 | 578 | case Bytecodes::_fadd: |
duke@435 | 579 | case Bytecodes::_isub: |
duke@435 | 580 | case Bytecodes::_fsub: |
duke@435 | 581 | case Bytecodes::_imul: |
duke@435 | 582 | case Bytecodes::_fmul: |
duke@435 | 583 | case Bytecodes::_idiv: |
duke@435 | 584 | case Bytecodes::_fdiv: |
duke@435 | 585 | case Bytecodes::_irem: |
duke@435 | 586 | case Bytecodes::_frem: |
duke@435 | 587 | case Bytecodes::_iand: |
duke@435 | 588 | case Bytecodes::_ior: |
duke@435 | 589 | case Bytecodes::_ixor: |
duke@435 | 590 | state.spop(); |
duke@435 | 591 | state.spop(); |
duke@435 | 592 | state.spush(); |
duke@435 | 593 | break; |
duke@435 | 594 | case Bytecodes::_ladd: |
duke@435 | 595 | case Bytecodes::_dadd: |
duke@435 | 596 | case Bytecodes::_lsub: |
duke@435 | 597 | case Bytecodes::_dsub: |
duke@435 | 598 | case Bytecodes::_lmul: |
duke@435 | 599 | case Bytecodes::_dmul: |
duke@435 | 600 | case Bytecodes::_ldiv: |
duke@435 | 601 | case Bytecodes::_ddiv: |
duke@435 | 602 | case Bytecodes::_lrem: |
duke@435 | 603 | case Bytecodes::_drem: |
duke@435 | 604 | case Bytecodes::_land: |
duke@435 | 605 | case Bytecodes::_lor: |
duke@435 | 606 | case Bytecodes::_lxor: |
duke@435 | 607 | state.lpop(); |
duke@435 | 608 | state.lpop(); |
duke@435 | 609 | state.lpush(); |
duke@435 | 610 | break; |
duke@435 | 611 | case Bytecodes::_ishl: |
duke@435 | 612 | case Bytecodes::_ishr: |
duke@435 | 613 | case Bytecodes::_iushr: |
duke@435 | 614 | state.spop(); |
duke@435 | 615 | state.spop(); |
duke@435 | 616 | state.spush(); |
duke@435 | 617 | break; |
duke@435 | 618 | case Bytecodes::_lshl: |
duke@435 | 619 | case Bytecodes::_lshr: |
duke@435 | 620 | case Bytecodes::_lushr: |
duke@435 | 621 | state.spop(); |
duke@435 | 622 | state.lpop(); |
duke@435 | 623 | state.lpush(); |
duke@435 | 624 | break; |
duke@435 | 625 | case Bytecodes::_ineg: |
duke@435 | 626 | case Bytecodes::_fneg: |
duke@435 | 627 | state.spop(); |
duke@435 | 628 | state.spush(); |
duke@435 | 629 | break; |
duke@435 | 630 | case Bytecodes::_lneg: |
duke@435 | 631 | case Bytecodes::_dneg: |
duke@435 | 632 | state.lpop(); |
duke@435 | 633 | state.lpush(); |
duke@435 | 634 | break; |
duke@435 | 635 | case Bytecodes::_iinc: |
duke@435 | 636 | break; |
duke@435 | 637 | case Bytecodes::_i2l: |
duke@435 | 638 | case Bytecodes::_i2d: |
duke@435 | 639 | case Bytecodes::_f2l: |
duke@435 | 640 | case Bytecodes::_f2d: |
duke@435 | 641 | state.spop(); |
duke@435 | 642 | state.lpush(); |
duke@435 | 643 | break; |
duke@435 | 644 | case Bytecodes::_i2f: |
duke@435 | 645 | case Bytecodes::_f2i: |
duke@435 | 646 | state.spop(); |
duke@435 | 647 | state.spush(); |
duke@435 | 648 | break; |
duke@435 | 649 | case Bytecodes::_l2i: |
duke@435 | 650 | case Bytecodes::_l2f: |
duke@435 | 651 | case Bytecodes::_d2i: |
duke@435 | 652 | case Bytecodes::_d2f: |
duke@435 | 653 | state.lpop(); |
duke@435 | 654 | state.spush(); |
duke@435 | 655 | break; |
duke@435 | 656 | case Bytecodes::_l2d: |
duke@435 | 657 | case Bytecodes::_d2l: |
duke@435 | 658 | state.lpop(); |
duke@435 | 659 | state.lpush(); |
duke@435 | 660 | break; |
duke@435 | 661 | case Bytecodes::_i2b: |
duke@435 | 662 | case Bytecodes::_i2c: |
duke@435 | 663 | case Bytecodes::_i2s: |
duke@435 | 664 | state.spop(); |
duke@435 | 665 | state.spush(); |
duke@435 | 666 | break; |
duke@435 | 667 | case Bytecodes::_lcmp: |
duke@435 | 668 | case Bytecodes::_dcmpl: |
duke@435 | 669 | case Bytecodes::_dcmpg: |
duke@435 | 670 | state.lpop(); |
duke@435 | 671 | state.lpop(); |
duke@435 | 672 | state.spush(); |
duke@435 | 673 | break; |
duke@435 | 674 | case Bytecodes::_fcmpl: |
duke@435 | 675 | case Bytecodes::_fcmpg: |
duke@435 | 676 | state.spop(); |
duke@435 | 677 | state.spop(); |
duke@435 | 678 | state.spush(); |
duke@435 | 679 | break; |
duke@435 | 680 | case Bytecodes::_ifeq: |
duke@435 | 681 | case Bytecodes::_ifne: |
duke@435 | 682 | case Bytecodes::_iflt: |
duke@435 | 683 | case Bytecodes::_ifge: |
duke@435 | 684 | case Bytecodes::_ifgt: |
duke@435 | 685 | case Bytecodes::_ifle: |
duke@435 | 686 | { |
duke@435 | 687 | state.spop(); |
duke@435 | 688 | int dest_bci = s.get_dest(); |
duke@435 | 689 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 690 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 691 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 692 | break; |
duke@435 | 693 | } |
duke@435 | 694 | case Bytecodes::_if_icmpeq: |
duke@435 | 695 | case Bytecodes::_if_icmpne: |
duke@435 | 696 | case Bytecodes::_if_icmplt: |
duke@435 | 697 | case Bytecodes::_if_icmpge: |
duke@435 | 698 | case Bytecodes::_if_icmpgt: |
duke@435 | 699 | case Bytecodes::_if_icmple: |
duke@435 | 700 | { |
duke@435 | 701 | state.spop(); |
duke@435 | 702 | state.spop(); |
duke@435 | 703 | int dest_bci = s.get_dest(); |
duke@435 | 704 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 705 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 706 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 707 | break; |
duke@435 | 708 | } |
duke@435 | 709 | case Bytecodes::_if_acmpeq: |
duke@435 | 710 | case Bytecodes::_if_acmpne: |
duke@435 | 711 | { |
duke@435 | 712 | set_method_escape(state.apop()); |
duke@435 | 713 | set_method_escape(state.apop()); |
duke@435 | 714 | int dest_bci = s.get_dest(); |
duke@435 | 715 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 716 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 717 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 718 | break; |
duke@435 | 719 | } |
duke@435 | 720 | case Bytecodes::_goto: |
duke@435 | 721 | { |
duke@435 | 722 | int dest_bci = s.get_dest(); |
duke@435 | 723 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 724 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 725 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 726 | fall_through = false; |
duke@435 | 727 | break; |
duke@435 | 728 | } |
duke@435 | 729 | case Bytecodes::_jsr: |
duke@435 | 730 | { |
duke@435 | 731 | int dest_bci = s.get_dest(); |
duke@435 | 732 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 733 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 734 | state.apush(empty_map); |
duke@435 | 735 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 736 | fall_through = false; |
duke@435 | 737 | break; |
duke@435 | 738 | } |
duke@435 | 739 | case Bytecodes::_ret: |
duke@435 | 740 | // we don't track the destination of a "ret" instruction |
duke@435 | 741 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 742 | fall_through = false; |
duke@435 | 743 | break; |
duke@435 | 744 | case Bytecodes::_return: |
duke@435 | 745 | assert(s.next_bci() == limit_bci, "return must end block"); |
duke@435 | 746 | fall_through = false; |
duke@435 | 747 | break; |
duke@435 | 748 | case Bytecodes::_tableswitch: |
duke@435 | 749 | { |
duke@435 | 750 | state.spop(); |
duke@435 | 751 | Bytecode_tableswitch* switch_ = Bytecode_tableswitch_at(s.cur_bcp()); |
duke@435 | 752 | int len = switch_->length(); |
duke@435 | 753 | int dest_bci; |
duke@435 | 754 | for (int i = 0; i < len; i++) { |
duke@435 | 755 | dest_bci = s.cur_bci() + switch_->dest_offset_at(i); |
duke@435 | 756 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 757 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 758 | } |
duke@435 | 759 | dest_bci = s.cur_bci() + switch_->default_offset(); |
duke@435 | 760 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 761 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 762 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 763 | fall_through = false; |
duke@435 | 764 | break; |
duke@435 | 765 | } |
duke@435 | 766 | case Bytecodes::_lookupswitch: |
duke@435 | 767 | { |
duke@435 | 768 | state.spop(); |
duke@435 | 769 | Bytecode_lookupswitch* switch_ = Bytecode_lookupswitch_at(s.cur_bcp()); |
duke@435 | 770 | int len = switch_->number_of_pairs(); |
duke@435 | 771 | int dest_bci; |
duke@435 | 772 | for (int i = 0; i < len; i++) { |
duke@435 | 773 | dest_bci = s.cur_bci() + switch_->pair_at(i)->offset(); |
duke@435 | 774 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 775 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 776 | } |
duke@435 | 777 | dest_bci = s.cur_bci() + switch_->default_offset(); |
duke@435 | 778 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 779 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 780 | fall_through = false; |
duke@435 | 781 | break; |
duke@435 | 782 | } |
duke@435 | 783 | case Bytecodes::_ireturn: |
duke@435 | 784 | case Bytecodes::_freturn: |
duke@435 | 785 | state.spop(); |
duke@435 | 786 | fall_through = false; |
duke@435 | 787 | break; |
duke@435 | 788 | case Bytecodes::_lreturn: |
duke@435 | 789 | case Bytecodes::_dreturn: |
duke@435 | 790 | state.lpop(); |
duke@435 | 791 | fall_through = false; |
duke@435 | 792 | break; |
duke@435 | 793 | case Bytecodes::_areturn: |
duke@435 | 794 | set_returned(state.apop()); |
duke@435 | 795 | fall_through = false; |
duke@435 | 796 | break; |
duke@435 | 797 | case Bytecodes::_getstatic: |
duke@435 | 798 | case Bytecodes::_getfield: |
duke@435 | 799 | { bool will_link; |
duke@435 | 800 | ciField* field = s.get_field(will_link); |
duke@435 | 801 | BasicType field_type = field->type()->basic_type(); |
duke@435 | 802 | if (s.cur_bc() != Bytecodes::_getstatic) { |
duke@435 | 803 | set_method_escape(state.apop()); |
duke@435 | 804 | } |
duke@435 | 805 | if (field_type == T_OBJECT || field_type == T_ARRAY) { |
duke@435 | 806 | state.apush(unknown_obj); |
duke@435 | 807 | } else if (type2size[field_type] == 1) { |
duke@435 | 808 | state.spush(); |
duke@435 | 809 | } else { |
duke@435 | 810 | state.lpush(); |
duke@435 | 811 | } |
duke@435 | 812 | } |
duke@435 | 813 | break; |
duke@435 | 814 | case Bytecodes::_putstatic: |
duke@435 | 815 | case Bytecodes::_putfield: |
duke@435 | 816 | { bool will_link; |
duke@435 | 817 | ciField* field = s.get_field(will_link); |
duke@435 | 818 | BasicType field_type = field->type()->basic_type(); |
duke@435 | 819 | if (field_type == T_OBJECT || field_type == T_ARRAY) { |
duke@435 | 820 | set_global_escape(state.apop()); |
duke@435 | 821 | } else if (type2size[field_type] == 1) { |
duke@435 | 822 | state.spop(); |
duke@435 | 823 | } else { |
duke@435 | 824 | state.lpop(); |
duke@435 | 825 | } |
duke@435 | 826 | if (s.cur_bc() != Bytecodes::_putstatic) { |
duke@435 | 827 | ArgumentMap p = state.apop(); |
duke@435 | 828 | set_method_escape(p); |
kvn@480 | 829 | set_modified(p, will_link ? field->offset() : OFFSET_ANY, type2size[field_type]*HeapWordSize); |
duke@435 | 830 | } |
duke@435 | 831 | } |
duke@435 | 832 | break; |
duke@435 | 833 | case Bytecodes::_invokevirtual: |
duke@435 | 834 | case Bytecodes::_invokespecial: |
duke@435 | 835 | case Bytecodes::_invokestatic: |
duke@435 | 836 | case Bytecodes::_invokeinterface: |
duke@435 | 837 | { bool will_link; |
duke@435 | 838 | ciMethod* target = s.get_method(will_link); |
duke@435 | 839 | ciKlass* holder = s.get_declared_method_holder(); |
duke@435 | 840 | invoke(state, s.cur_bc(), target, holder); |
duke@435 | 841 | ciType* return_type = target->return_type(); |
duke@435 | 842 | if (!return_type->is_primitive_type()) { |
duke@435 | 843 | state.apush(unknown_obj); |
duke@435 | 844 | } else if (return_type->is_one_word()) { |
duke@435 | 845 | state.spush(); |
duke@435 | 846 | } else if (return_type->is_two_word()) { |
duke@435 | 847 | state.lpush(); |
duke@435 | 848 | } |
duke@435 | 849 | } |
duke@435 | 850 | break; |
duke@435 | 851 | case Bytecodes::_xxxunusedxxx: |
duke@435 | 852 | ShouldNotReachHere(); |
duke@435 | 853 | break; |
duke@435 | 854 | case Bytecodes::_new: |
duke@435 | 855 | state.apush(allocated_obj); |
duke@435 | 856 | break; |
duke@435 | 857 | case Bytecodes::_newarray: |
duke@435 | 858 | case Bytecodes::_anewarray: |
duke@435 | 859 | state.spop(); |
duke@435 | 860 | state.apush(allocated_obj); |
duke@435 | 861 | break; |
duke@435 | 862 | case Bytecodes::_multianewarray: |
duke@435 | 863 | { int i = s.cur_bcp()[3]; |
duke@435 | 864 | while (i-- > 0) state.spop(); |
duke@435 | 865 | state.apush(allocated_obj); |
duke@435 | 866 | } |
duke@435 | 867 | break; |
duke@435 | 868 | case Bytecodes::_arraylength: |
duke@435 | 869 | set_method_escape(state.apop()); |
duke@435 | 870 | state.spush(); |
duke@435 | 871 | break; |
duke@435 | 872 | case Bytecodes::_athrow: |
duke@435 | 873 | set_global_escape(state.apop()); |
duke@435 | 874 | fall_through = false; |
duke@435 | 875 | break; |
duke@435 | 876 | case Bytecodes::_checkcast: |
duke@435 | 877 | { ArgumentMap obj = state.apop(); |
duke@435 | 878 | set_method_escape(obj); |
duke@435 | 879 | state.apush(obj); |
duke@435 | 880 | } |
duke@435 | 881 | break; |
duke@435 | 882 | case Bytecodes::_instanceof: |
duke@435 | 883 | set_method_escape(state.apop()); |
duke@435 | 884 | state.spush(); |
duke@435 | 885 | break; |
duke@435 | 886 | case Bytecodes::_monitorenter: |
duke@435 | 887 | case Bytecodes::_monitorexit: |
duke@435 | 888 | state.apop(); |
duke@435 | 889 | break; |
duke@435 | 890 | case Bytecodes::_wide: |
duke@435 | 891 | ShouldNotReachHere(); |
duke@435 | 892 | break; |
duke@435 | 893 | case Bytecodes::_ifnull: |
duke@435 | 894 | case Bytecodes::_ifnonnull: |
duke@435 | 895 | { |
duke@435 | 896 | set_method_escape(state.apop()); |
duke@435 | 897 | int dest_bci = s.get_dest(); |
duke@435 | 898 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 899 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 900 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 901 | break; |
duke@435 | 902 | } |
duke@435 | 903 | case Bytecodes::_goto_w: |
duke@435 | 904 | { |
duke@435 | 905 | int dest_bci = s.get_far_dest(); |
duke@435 | 906 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 907 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 908 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 909 | fall_through = false; |
duke@435 | 910 | break; |
duke@435 | 911 | } |
duke@435 | 912 | case Bytecodes::_jsr_w: |
duke@435 | 913 | { |
duke@435 | 914 | int dest_bci = s.get_far_dest(); |
duke@435 | 915 | assert(_methodBlocks->is_block_start(dest_bci), "branch destination must start a block"); |
duke@435 | 916 | assert(s.next_bci() == limit_bci, "branch must end block"); |
duke@435 | 917 | state.apush(empty_map); |
duke@435 | 918 | successors.push(_methodBlocks->block_containing(dest_bci)); |
duke@435 | 919 | fall_through = false; |
duke@435 | 920 | break; |
duke@435 | 921 | } |
duke@435 | 922 | case Bytecodes::_breakpoint: |
duke@435 | 923 | break; |
duke@435 | 924 | default: |
duke@435 | 925 | ShouldNotReachHere(); |
duke@435 | 926 | break; |
duke@435 | 927 | } |
duke@435 | 928 | |
duke@435 | 929 | } |
duke@435 | 930 | if (fall_through) { |
duke@435 | 931 | int fall_through_bci = s.cur_bci(); |
duke@435 | 932 | if (fall_through_bci < _method->code_size()) { |
duke@435 | 933 | assert(_methodBlocks->is_block_start(fall_through_bci), "must fall through to block start."); |
duke@435 | 934 | successors.push(_methodBlocks->block_containing(fall_through_bci)); |
duke@435 | 935 | } |
duke@435 | 936 | } |
duke@435 | 937 | } |
duke@435 | 938 | |
duke@435 | 939 | void BCEscapeAnalyzer::merge_block_states(StateInfo *blockstates, ciBlock *dest, StateInfo *s_state) { |
kvn@480 | 940 | StateInfo *d_state = blockstates + dest->index(); |
duke@435 | 941 | int nlocals = _method->max_locals(); |
duke@435 | 942 | |
duke@435 | 943 | // exceptions may cause transfer of control to handlers in the middle of a |
duke@435 | 944 | // block, so we don't merge the incoming state of exception handlers |
duke@435 | 945 | if (dest->is_handler()) |
duke@435 | 946 | return; |
duke@435 | 947 | if (!d_state->_initialized ) { |
duke@435 | 948 | // destination not initialized, just copy |
duke@435 | 949 | for (int i = 0; i < nlocals; i++) { |
duke@435 | 950 | d_state->_vars[i] = s_state->_vars[i]; |
duke@435 | 951 | } |
duke@435 | 952 | for (int i = 0; i < s_state->_stack_height; i++) { |
duke@435 | 953 | d_state->_stack[i] = s_state->_stack[i]; |
duke@435 | 954 | } |
duke@435 | 955 | d_state->_stack_height = s_state->_stack_height; |
duke@435 | 956 | d_state->_max_stack = s_state->_max_stack; |
duke@435 | 957 | d_state->_initialized = true; |
duke@435 | 958 | } else if (!dest->processed()) { |
duke@435 | 959 | // we have not yet walked the bytecodes of dest, we can merge |
duke@435 | 960 | // the states |
duke@435 | 961 | assert(d_state->_stack_height == s_state->_stack_height, "computed stack heights must match"); |
duke@435 | 962 | for (int i = 0; i < nlocals; i++) { |
duke@435 | 963 | d_state->_vars[i].set_union(s_state->_vars[i]); |
duke@435 | 964 | } |
duke@435 | 965 | for (int i = 0; i < s_state->_stack_height; i++) { |
duke@435 | 966 | d_state->_stack[i].set_union(s_state->_stack[i]); |
duke@435 | 967 | } |
duke@435 | 968 | } else { |
duke@435 | 969 | // the bytecodes of dest have already been processed, mark any |
duke@435 | 970 | // arguments in the source state which are not in the dest state |
duke@435 | 971 | // as global escape. |
duke@435 | 972 | // Future refinement: we only need to mark these variable to the |
duke@435 | 973 | // maximum escape of any variables in dest state |
duke@435 | 974 | assert(d_state->_stack_height == s_state->_stack_height, "computed stack heights must match"); |
duke@435 | 975 | ArgumentMap extra_vars; |
duke@435 | 976 | for (int i = 0; i < nlocals; i++) { |
duke@435 | 977 | ArgumentMap t; |
duke@435 | 978 | t = s_state->_vars[i]; |
duke@435 | 979 | t.set_difference(d_state->_vars[i]); |
duke@435 | 980 | extra_vars.set_union(t); |
duke@435 | 981 | } |
duke@435 | 982 | for (int i = 0; i < s_state->_stack_height; i++) { |
duke@435 | 983 | ArgumentMap t; |
kvn@480 | 984 | //extra_vars |= !d_state->_vars[i] & s_state->_vars[i]; |
duke@435 | 985 | t.clear(); |
duke@435 | 986 | t = s_state->_stack[i]; |
duke@435 | 987 | t.set_difference(d_state->_stack[i]); |
duke@435 | 988 | extra_vars.set_union(t); |
duke@435 | 989 | } |
duke@435 | 990 | set_global_escape(extra_vars); |
duke@435 | 991 | } |
duke@435 | 992 | } |
duke@435 | 993 | |
duke@435 | 994 | void BCEscapeAnalyzer::iterate_blocks(Arena *arena) { |
duke@435 | 995 | int numblocks = _methodBlocks->num_blocks(); |
duke@435 | 996 | int stkSize = _method->max_stack(); |
duke@435 | 997 | int numLocals = _method->max_locals(); |
duke@435 | 998 | StateInfo state; |
duke@435 | 999 | |
duke@435 | 1000 | int datacount = (numblocks + 1) * (stkSize + numLocals); |
duke@435 | 1001 | int datasize = datacount * sizeof(ArgumentMap); |
kvn@480 | 1002 | StateInfo *blockstates = (StateInfo *) arena->Amalloc(numblocks * sizeof(StateInfo)); |
duke@435 | 1003 | ArgumentMap *statedata = (ArgumentMap *) arena->Amalloc(datasize); |
duke@435 | 1004 | for (int i = 0; i < datacount; i++) ::new ((void*)&statedata[i]) ArgumentMap(); |
duke@435 | 1005 | ArgumentMap *dp = statedata; |
duke@435 | 1006 | state._vars = dp; |
duke@435 | 1007 | dp += numLocals; |
duke@435 | 1008 | state._stack = dp; |
duke@435 | 1009 | dp += stkSize; |
duke@435 | 1010 | state._initialized = false; |
duke@435 | 1011 | state._max_stack = stkSize; |
duke@435 | 1012 | for (int i = 0; i < numblocks; i++) { |
duke@435 | 1013 | blockstates[i]._vars = dp; |
duke@435 | 1014 | dp += numLocals; |
duke@435 | 1015 | blockstates[i]._stack = dp; |
duke@435 | 1016 | dp += stkSize; |
duke@435 | 1017 | blockstates[i]._initialized = false; |
duke@435 | 1018 | blockstates[i]._stack_height = 0; |
duke@435 | 1019 | blockstates[i]._max_stack = stkSize; |
duke@435 | 1020 | } |
duke@435 | 1021 | GrowableArray<ciBlock *> worklist(arena, numblocks / 4, 0, NULL); |
duke@435 | 1022 | GrowableArray<ciBlock *> successors(arena, 4, 0, NULL); |
duke@435 | 1023 | |
duke@435 | 1024 | _methodBlocks->clear_processed(); |
duke@435 | 1025 | |
duke@435 | 1026 | // initialize block 0 state from method signature |
duke@435 | 1027 | ArgumentMap allVars; // all oop arguments to method |
duke@435 | 1028 | ciSignature* sig = method()->signature(); |
duke@435 | 1029 | int j = 0; |
kvn@480 | 1030 | ciBlock* first_blk = _methodBlocks->block_containing(0); |
kvn@480 | 1031 | int fb_i = first_blk->index(); |
duke@435 | 1032 | if (!method()->is_static()) { |
duke@435 | 1033 | // record information for "this" |
kvn@480 | 1034 | blockstates[fb_i]._vars[j].set(j); |
duke@435 | 1035 | allVars.add(j); |
duke@435 | 1036 | j++; |
duke@435 | 1037 | } |
duke@435 | 1038 | for (int i = 0; i < sig->count(); i++) { |
duke@435 | 1039 | ciType* t = sig->type_at(i); |
duke@435 | 1040 | if (!t->is_primitive_type()) { |
kvn@480 | 1041 | blockstates[fb_i]._vars[j].set(j); |
duke@435 | 1042 | allVars.add(j); |
duke@435 | 1043 | } |
duke@435 | 1044 | j += t->size(); |
duke@435 | 1045 | } |
kvn@480 | 1046 | blockstates[fb_i]._initialized = true; |
duke@435 | 1047 | assert(j == _arg_size, "just checking"); |
duke@435 | 1048 | |
duke@435 | 1049 | ArgumentMap unknown_map; |
duke@435 | 1050 | unknown_map.add_unknown(); |
duke@435 | 1051 | |
kvn@480 | 1052 | worklist.push(first_blk); |
duke@435 | 1053 | while(worklist.length() > 0) { |
duke@435 | 1054 | ciBlock *blk = worklist.pop(); |
kvn@480 | 1055 | StateInfo *blkState = blockstates + blk->index(); |
duke@435 | 1056 | if (blk->is_handler() || blk->is_ret_target()) { |
duke@435 | 1057 | // for an exception handler or a target of a ret instruction, we assume the worst case, |
kvn@480 | 1058 | // that any variable could contain any argument |
duke@435 | 1059 | for (int i = 0; i < numLocals; i++) { |
duke@435 | 1060 | state._vars[i] = allVars; |
duke@435 | 1061 | } |
duke@435 | 1062 | if (blk->is_handler()) { |
duke@435 | 1063 | state._stack_height = 1; |
duke@435 | 1064 | } else { |
duke@435 | 1065 | state._stack_height = blkState->_stack_height; |
duke@435 | 1066 | } |
duke@435 | 1067 | for (int i = 0; i < state._stack_height; i++) { |
kvn@480 | 1068 | // ??? should this be unknown_map ??? |
duke@435 | 1069 | state._stack[i] = allVars; |
duke@435 | 1070 | } |
duke@435 | 1071 | } else { |
duke@435 | 1072 | for (int i = 0; i < numLocals; i++) { |
duke@435 | 1073 | state._vars[i] = blkState->_vars[i]; |
duke@435 | 1074 | } |
duke@435 | 1075 | for (int i = 0; i < blkState->_stack_height; i++) { |
duke@435 | 1076 | state._stack[i] = blkState->_stack[i]; |
duke@435 | 1077 | } |
duke@435 | 1078 | state._stack_height = blkState->_stack_height; |
duke@435 | 1079 | } |
duke@435 | 1080 | iterate_one_block(blk, state, successors); |
duke@435 | 1081 | // if this block has any exception handlers, push them |
duke@435 | 1082 | // onto successor list |
duke@435 | 1083 | if (blk->has_handler()) { |
duke@435 | 1084 | DEBUG_ONLY(int handler_count = 0;) |
duke@435 | 1085 | int blk_start = blk->start_bci(); |
duke@435 | 1086 | int blk_end = blk->limit_bci(); |
duke@435 | 1087 | for (int i = 0; i < numblocks; i++) { |
duke@435 | 1088 | ciBlock *b = _methodBlocks->block(i); |
duke@435 | 1089 | if (b->is_handler()) { |
duke@435 | 1090 | int ex_start = b->ex_start_bci(); |
duke@435 | 1091 | int ex_end = b->ex_limit_bci(); |
duke@435 | 1092 | if ((ex_start >= blk_start && ex_start < blk_end) || |
duke@435 | 1093 | (ex_end > blk_start && ex_end <= blk_end)) { |
duke@435 | 1094 | successors.push(b); |
duke@435 | 1095 | } |
duke@435 | 1096 | DEBUG_ONLY(handler_count++;) |
duke@435 | 1097 | } |
duke@435 | 1098 | } |
duke@435 | 1099 | assert(handler_count > 0, "must find at least one handler"); |
duke@435 | 1100 | } |
duke@435 | 1101 | // merge computed variable state with successors |
duke@435 | 1102 | while(successors.length() > 0) { |
duke@435 | 1103 | ciBlock *succ = successors.pop(); |
duke@435 | 1104 | merge_block_states(blockstates, succ, &state); |
duke@435 | 1105 | if (!succ->processed()) |
duke@435 | 1106 | worklist.push(succ); |
duke@435 | 1107 | } |
duke@435 | 1108 | } |
duke@435 | 1109 | } |
duke@435 | 1110 | |
duke@435 | 1111 | bool BCEscapeAnalyzer::do_analysis() { |
duke@435 | 1112 | Arena* arena = CURRENT_ENV->arena(); |
duke@435 | 1113 | // identify basic blocks |
duke@435 | 1114 | _methodBlocks = _method->get_method_blocks(); |
duke@435 | 1115 | |
duke@435 | 1116 | iterate_blocks(arena); |
duke@435 | 1117 | // TEMPORARY |
duke@435 | 1118 | return true; |
duke@435 | 1119 | } |
duke@435 | 1120 | |
duke@435 | 1121 | vmIntrinsics::ID BCEscapeAnalyzer::known_intrinsic() { |
duke@435 | 1122 | vmIntrinsics::ID iid = method()->intrinsic_id(); |
duke@435 | 1123 | |
duke@435 | 1124 | if (iid == vmIntrinsics::_getClass || |
kvn@480 | 1125 | iid == vmIntrinsics::_fillInStackTrace || |
duke@435 | 1126 | iid == vmIntrinsics::_hashCode) |
duke@435 | 1127 | return iid; |
duke@435 | 1128 | else |
duke@435 | 1129 | return vmIntrinsics::_none; |
duke@435 | 1130 | } |
duke@435 | 1131 | |
duke@435 | 1132 | bool BCEscapeAnalyzer::compute_escape_for_intrinsic(vmIntrinsics::ID iid) { |
kvn@480 | 1133 | ArgumentMap arg; |
kvn@480 | 1134 | arg.clear(); |
duke@435 | 1135 | switch (iid) { |
duke@435 | 1136 | case vmIntrinsics::_getClass: |
duke@435 | 1137 | _return_local = false; |
duke@435 | 1138 | break; |
kvn@480 | 1139 | case vmIntrinsics::_fillInStackTrace: |
kvn@480 | 1140 | arg.set(0); // 'this' |
kvn@480 | 1141 | set_returned(arg); |
kvn@480 | 1142 | break; |
duke@435 | 1143 | case vmIntrinsics::_hashCode: |
duke@435 | 1144 | // initialized state is correct |
duke@435 | 1145 | break; |
duke@435 | 1146 | default: |
duke@435 | 1147 | assert(false, "unexpected intrinsic"); |
duke@435 | 1148 | } |
duke@435 | 1149 | return true; |
duke@435 | 1150 | } |
duke@435 | 1151 | |
duke@435 | 1152 | void BCEscapeAnalyzer::initialize() { |
duke@435 | 1153 | int i; |
duke@435 | 1154 | |
duke@435 | 1155 | // clear escape information (method may have been deoptimized) |
duke@435 | 1156 | methodData()->clear_escape_info(); |
duke@435 | 1157 | |
duke@435 | 1158 | // initialize escape state of object parameters |
duke@435 | 1159 | ciSignature* sig = method()->signature(); |
duke@435 | 1160 | int j = 0; |
duke@435 | 1161 | if (!method()->is_static()) { |
duke@435 | 1162 | _arg_local.set_bit(0); |
duke@435 | 1163 | _arg_stack.set_bit(0); |
duke@435 | 1164 | j++; |
duke@435 | 1165 | } |
duke@435 | 1166 | for (i = 0; i < sig->count(); i++) { |
duke@435 | 1167 | ciType* t = sig->type_at(i); |
duke@435 | 1168 | if (!t->is_primitive_type()) { |
duke@435 | 1169 | _arg_local.set_bit(j); |
duke@435 | 1170 | _arg_stack.set_bit(j); |
duke@435 | 1171 | } |
duke@435 | 1172 | j += t->size(); |
duke@435 | 1173 | } |
duke@435 | 1174 | assert(j == _arg_size, "just checking"); |
duke@435 | 1175 | |
duke@435 | 1176 | // start with optimistic assumption |
duke@435 | 1177 | ciType *rt = _method->return_type(); |
duke@435 | 1178 | if (rt->is_primitive_type()) { |
duke@435 | 1179 | _return_local = false; |
duke@435 | 1180 | _return_allocated = false; |
duke@435 | 1181 | } else { |
duke@435 | 1182 | _return_local = true; |
duke@435 | 1183 | _return_allocated = true; |
duke@435 | 1184 | } |
duke@435 | 1185 | _allocated_escapes = false; |
kvn@480 | 1186 | _unknown_modified = false; |
duke@435 | 1187 | } |
duke@435 | 1188 | |
duke@435 | 1189 | void BCEscapeAnalyzer::clear_escape_info() { |
duke@435 | 1190 | ciSignature* sig = method()->signature(); |
duke@435 | 1191 | int arg_count = sig->count(); |
duke@435 | 1192 | ArgumentMap var; |
kvn@480 | 1193 | if (!method()->is_static()) { |
kvn@480 | 1194 | arg_count++; // allow for "this" |
kvn@480 | 1195 | } |
duke@435 | 1196 | for (int i = 0; i < arg_count; i++) { |
kvn@480 | 1197 | set_arg_modified(i, OFFSET_ANY, 4); |
duke@435 | 1198 | var.clear(); |
duke@435 | 1199 | var.set(i); |
kvn@480 | 1200 | set_modified(var, OFFSET_ANY, 4); |
duke@435 | 1201 | set_global_escape(var); |
duke@435 | 1202 | } |
duke@435 | 1203 | _arg_local.clear(); |
duke@435 | 1204 | _arg_stack.clear(); |
duke@435 | 1205 | _arg_returned.clear(); |
duke@435 | 1206 | _return_local = false; |
duke@435 | 1207 | _return_allocated = false; |
duke@435 | 1208 | _allocated_escapes = true; |
kvn@480 | 1209 | _unknown_modified = true; |
duke@435 | 1210 | } |
duke@435 | 1211 | |
duke@435 | 1212 | |
duke@435 | 1213 | void BCEscapeAnalyzer::compute_escape_info() { |
duke@435 | 1214 | int i; |
duke@435 | 1215 | assert(!methodData()->has_escape_info(), "do not overwrite escape info"); |
duke@435 | 1216 | |
duke@435 | 1217 | vmIntrinsics::ID iid = known_intrinsic(); |
duke@435 | 1218 | |
duke@435 | 1219 | // check if method can be analyzed |
duke@435 | 1220 | if (iid == vmIntrinsics::_none && (method()->is_abstract() || method()->is_native() || !method()->holder()->is_initialized() |
duke@435 | 1221 | || _level > MaxBCEAEstimateLevel |
duke@435 | 1222 | || method()->code_size() > MaxBCEAEstimateSize)) { |
duke@435 | 1223 | if (BCEATraceLevel >= 1) { |
duke@435 | 1224 | tty->print("Skipping method because: "); |
duke@435 | 1225 | if (method()->is_abstract()) |
duke@435 | 1226 | tty->print_cr("method is abstract."); |
duke@435 | 1227 | else if (method()->is_native()) |
duke@435 | 1228 | tty->print_cr("method is native."); |
duke@435 | 1229 | else if (!method()->holder()->is_initialized()) |
duke@435 | 1230 | tty->print_cr("class of method is not initialized."); |
duke@435 | 1231 | else if (_level > MaxBCEAEstimateLevel) |
duke@435 | 1232 | tty->print_cr("level (%d) exceeds MaxBCEAEstimateLevel (%d).", |
duke@435 | 1233 | _level, MaxBCEAEstimateLevel); |
duke@435 | 1234 | else if (method()->code_size() > MaxBCEAEstimateSize) |
duke@435 | 1235 | tty->print_cr("code size (%d) exceeds MaxBCEAEstimateSize.", |
duke@435 | 1236 | method()->code_size(), MaxBCEAEstimateSize); |
duke@435 | 1237 | else |
duke@435 | 1238 | ShouldNotReachHere(); |
duke@435 | 1239 | } |
duke@435 | 1240 | clear_escape_info(); |
duke@435 | 1241 | |
duke@435 | 1242 | return; |
duke@435 | 1243 | } |
duke@435 | 1244 | |
duke@435 | 1245 | if (BCEATraceLevel >= 1) { |
duke@435 | 1246 | tty->print("[EA] estimating escape information for"); |
duke@435 | 1247 | if (iid != vmIntrinsics::_none) |
duke@435 | 1248 | tty->print(" intrinsic"); |
duke@435 | 1249 | method()->print_short_name(); |
duke@435 | 1250 | tty->print_cr(" (%d bytes)", method()->code_size()); |
duke@435 | 1251 | } |
duke@435 | 1252 | |
duke@435 | 1253 | bool success; |
duke@435 | 1254 | |
duke@435 | 1255 | initialize(); |
duke@435 | 1256 | |
kvn@513 | 1257 | // Do not scan method if it has no object parameters and |
kvn@513 | 1258 | // does not returns an object (_return_allocated is set in initialize()). |
kvn@513 | 1259 | if (_arg_local.is_empty() && !_return_allocated) { |
kvn@513 | 1260 | // Clear all info since method's bytecode was not analysed and |
kvn@513 | 1261 | // set pessimistic escape information. |
kvn@513 | 1262 | clear_escape_info(); |
kvn@513 | 1263 | methodData()->set_eflag(methodDataOopDesc::allocated_escapes); |
kvn@513 | 1264 | methodData()->set_eflag(methodDataOopDesc::unknown_modified); |
duke@435 | 1265 | methodData()->set_eflag(methodDataOopDesc::estimated); |
duke@435 | 1266 | return; |
duke@435 | 1267 | } |
duke@435 | 1268 | |
duke@435 | 1269 | if (iid != vmIntrinsics::_none) |
duke@435 | 1270 | success = compute_escape_for_intrinsic(iid); |
duke@435 | 1271 | else { |
duke@435 | 1272 | success = do_analysis(); |
duke@435 | 1273 | } |
duke@435 | 1274 | |
kvn@513 | 1275 | // don't store interprocedural escape information if it introduces |
kvn@513 | 1276 | // dependencies or if method data is empty |
duke@435 | 1277 | // |
duke@435 | 1278 | if (!has_dependencies() && !methodData()->is_empty()) { |
duke@435 | 1279 | for (i = 0; i < _arg_size; i++) { |
duke@435 | 1280 | if (_arg_local.at(i)) { |
duke@435 | 1281 | assert(_arg_stack.at(i), "inconsistent escape info"); |
duke@435 | 1282 | methodData()->set_arg_local(i); |
duke@435 | 1283 | methodData()->set_arg_stack(i); |
duke@435 | 1284 | } else if (_arg_stack.at(i)) { |
duke@435 | 1285 | methodData()->set_arg_stack(i); |
duke@435 | 1286 | } |
duke@435 | 1287 | if (_arg_returned.at(i)) { |
duke@435 | 1288 | methodData()->set_arg_returned(i); |
duke@435 | 1289 | } |
kvn@480 | 1290 | methodData()->set_arg_modified(i, _arg_modified[i]); |
duke@435 | 1291 | } |
duke@435 | 1292 | if (_return_local) { |
duke@435 | 1293 | methodData()->set_eflag(methodDataOopDesc::return_local); |
duke@435 | 1294 | } |
kvn@513 | 1295 | if (_return_allocated) { |
kvn@513 | 1296 | methodData()->set_eflag(methodDataOopDesc::return_allocated); |
kvn@513 | 1297 | } |
kvn@513 | 1298 | if (_allocated_escapes) { |
kvn@513 | 1299 | methodData()->set_eflag(methodDataOopDesc::allocated_escapes); |
kvn@513 | 1300 | } |
kvn@513 | 1301 | if (_unknown_modified) { |
kvn@513 | 1302 | methodData()->set_eflag(methodDataOopDesc::unknown_modified); |
kvn@513 | 1303 | } |
duke@435 | 1304 | methodData()->set_eflag(methodDataOopDesc::estimated); |
duke@435 | 1305 | } |
duke@435 | 1306 | } |
duke@435 | 1307 | |
duke@435 | 1308 | void BCEscapeAnalyzer::read_escape_info() { |
duke@435 | 1309 | assert(methodData()->has_escape_info(), "no escape info available"); |
duke@435 | 1310 | |
duke@435 | 1311 | // read escape information from method descriptor |
duke@435 | 1312 | for (int i = 0; i < _arg_size; i++) { |
duke@435 | 1313 | _arg_local.at_put(i, methodData()->is_arg_local(i)); |
duke@435 | 1314 | _arg_stack.at_put(i, methodData()->is_arg_stack(i)); |
duke@435 | 1315 | _arg_returned.at_put(i, methodData()->is_arg_returned(i)); |
kvn@480 | 1316 | _arg_modified[i] = methodData()->arg_modified(i); |
duke@435 | 1317 | } |
duke@435 | 1318 | _return_local = methodData()->eflag_set(methodDataOopDesc::return_local); |
kvn@513 | 1319 | _return_allocated = methodData()->eflag_set(methodDataOopDesc::return_allocated); |
kvn@513 | 1320 | _allocated_escapes = methodData()->eflag_set(methodDataOopDesc::allocated_escapes); |
kvn@513 | 1321 | _unknown_modified = methodData()->eflag_set(methodDataOopDesc::unknown_modified); |
duke@435 | 1322 | |
duke@435 | 1323 | } |
duke@435 | 1324 | |
kvn@513 | 1325 | #ifndef PRODUCT |
kvn@513 | 1326 | void BCEscapeAnalyzer::dump() { |
kvn@513 | 1327 | tty->print("[EA] estimated escape information for"); |
kvn@513 | 1328 | method()->print_short_name(); |
kvn@513 | 1329 | tty->print_cr(has_dependencies() ? " (not stored)" : ""); |
kvn@513 | 1330 | tty->print(" non-escaping args: "); |
kvn@513 | 1331 | _arg_local.print_on(tty); |
kvn@513 | 1332 | tty->print(" stack-allocatable args: "); |
kvn@513 | 1333 | _arg_stack.print_on(tty); |
kvn@513 | 1334 | if (_return_local) { |
kvn@513 | 1335 | tty->print(" returned args: "); |
kvn@513 | 1336 | _arg_returned.print_on(tty); |
kvn@513 | 1337 | } else if (is_return_allocated()) { |
kvn@513 | 1338 | tty->print_cr(" return allocated value"); |
kvn@513 | 1339 | } else { |
kvn@513 | 1340 | tty->print_cr(" return non-local value"); |
kvn@513 | 1341 | } |
kvn@513 | 1342 | tty->print(" modified args: "); |
kvn@513 | 1343 | for (int i = 0; i < _arg_size; i++) { |
kvn@513 | 1344 | if (_arg_modified[i] == 0) |
kvn@513 | 1345 | tty->print(" 0"); |
kvn@513 | 1346 | else |
kvn@513 | 1347 | tty->print(" 0x%x", _arg_modified[i]); |
kvn@513 | 1348 | } |
kvn@513 | 1349 | tty->cr(); |
kvn@513 | 1350 | tty->print(" flags: "); |
kvn@513 | 1351 | if (_return_allocated) |
kvn@513 | 1352 | tty->print(" return_allocated"); |
kvn@513 | 1353 | if (_allocated_escapes) |
kvn@513 | 1354 | tty->print(" allocated_escapes"); |
kvn@513 | 1355 | if (_unknown_modified) |
kvn@513 | 1356 | tty->print(" unknown_modified"); |
kvn@513 | 1357 | tty->cr(); |
kvn@513 | 1358 | } |
kvn@513 | 1359 | #endif |
duke@435 | 1360 | |
duke@435 | 1361 | BCEscapeAnalyzer::BCEscapeAnalyzer(ciMethod* method, BCEscapeAnalyzer* parent) |
duke@435 | 1362 | : _conservative(method == NULL || !EstimateArgEscape) |
duke@435 | 1363 | , _method(method) |
duke@435 | 1364 | , _methodData(method ? method->method_data() : NULL) |
duke@435 | 1365 | , _arg_size(method ? method->arg_size() : 0) |
duke@435 | 1366 | , _stack() |
duke@435 | 1367 | , _arg_local(_arg_size) |
duke@435 | 1368 | , _arg_stack(_arg_size) |
duke@435 | 1369 | , _arg_returned(_arg_size) |
duke@435 | 1370 | , _dirty(_arg_size) |
duke@435 | 1371 | , _return_local(false) |
duke@435 | 1372 | , _return_allocated(false) |
duke@435 | 1373 | , _allocated_escapes(false) |
kvn@480 | 1374 | , _unknown_modified(false) |
duke@435 | 1375 | , _dependencies() |
duke@435 | 1376 | , _parent(parent) |
duke@435 | 1377 | , _level(parent == NULL ? 0 : parent->level() + 1) { |
duke@435 | 1378 | if (!_conservative) { |
duke@435 | 1379 | _arg_local.clear(); |
duke@435 | 1380 | _arg_stack.clear(); |
duke@435 | 1381 | _arg_returned.clear(); |
duke@435 | 1382 | _dirty.clear(); |
duke@435 | 1383 | Arena* arena = CURRENT_ENV->arena(); |
kvn@480 | 1384 | _arg_modified = (uint *) arena->Amalloc(_arg_size * sizeof(uint)); |
kvn@480 | 1385 | Copy::zero_to_bytes(_arg_modified, _arg_size * sizeof(uint)); |
duke@435 | 1386 | |
duke@435 | 1387 | if (methodData() == NULL) |
duke@435 | 1388 | return; |
duke@435 | 1389 | bool printit = _method->should_print_assembly(); |
duke@435 | 1390 | if (methodData()->has_escape_info()) { |
duke@435 | 1391 | TRACE_BCEA(2, tty->print_cr("[EA] Reading previous results for %s.%s", |
duke@435 | 1392 | method->holder()->name()->as_utf8(), |
duke@435 | 1393 | method->name()->as_utf8())); |
duke@435 | 1394 | read_escape_info(); |
duke@435 | 1395 | } else { |
duke@435 | 1396 | TRACE_BCEA(2, tty->print_cr("[EA] computing results for %s.%s", |
duke@435 | 1397 | method->holder()->name()->as_utf8(), |
duke@435 | 1398 | method->name()->as_utf8())); |
duke@435 | 1399 | |
duke@435 | 1400 | compute_escape_info(); |
duke@435 | 1401 | methodData()->update_escape_info(); |
duke@435 | 1402 | } |
kvn@513 | 1403 | #ifndef PRODUCT |
kvn@513 | 1404 | if (BCEATraceLevel >= 3) { |
kvn@513 | 1405 | // dump escape information |
kvn@513 | 1406 | dump(); |
kvn@513 | 1407 | } |
kvn@513 | 1408 | #endif |
duke@435 | 1409 | } |
duke@435 | 1410 | } |
duke@435 | 1411 | |
duke@435 | 1412 | void BCEscapeAnalyzer::copy_dependencies(Dependencies *deps) { |
duke@435 | 1413 | if(!has_dependencies()) |
duke@435 | 1414 | return; |
duke@435 | 1415 | for (int i = 0; i < _dependencies.length(); i+=2) { |
duke@435 | 1416 | ciKlass *k = _dependencies[i]->as_klass(); |
duke@435 | 1417 | ciMethod *m = _dependencies[i+1]->as_method(); |
duke@435 | 1418 | deps->assert_unique_concrete_method(k, m); |
duke@435 | 1419 | } |
duke@435 | 1420 | } |