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