Fri, 06 Mar 2015 16:47:46 +0100
8074561: Wrong volatile qualifier for field ClassLoaderDataGraphKlassIteratorAtomic::_next_klass
Reviewed-by: mgerdin, stefank
duke@435 | 1 | /* |
hseigel@6824 | 2 | * Copyright (c) 2003, 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 "classfile/stackMapFrame.hpp" |
stefank@2314 | 27 | #include "classfile/verifier.hpp" |
stefank@2314 | 28 | #include "memory/resourceArea.hpp" |
stefank@2314 | 29 | #include "oops/oop.inline.hpp" |
coleenp@2497 | 30 | #include "oops/symbol.hpp" |
stefank@2314 | 31 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 32 | #include "utilities/globalDefinitions.hpp" |
duke@435 | 33 | |
duke@435 | 34 | StackMapFrame::StackMapFrame(u2 max_locals, u2 max_stack, ClassVerifier* v) : |
kamg@3992 | 35 | _offset(0), _locals_size(0), _stack_size(0), |
kamg@3992 | 36 | _stack_mark(0), _flags(0), _max_locals(max_locals), |
kamg@3992 | 37 | _max_stack(max_stack), _verifier(v) { |
duke@435 | 38 | Thread* thr = v->thread(); |
duke@435 | 39 | _locals = NEW_RESOURCE_ARRAY_IN_THREAD(thr, VerificationType, max_locals); |
duke@435 | 40 | _stack = NEW_RESOURCE_ARRAY_IN_THREAD(thr, VerificationType, max_stack); |
duke@435 | 41 | int32_t i; |
duke@435 | 42 | for(i = 0; i < max_locals; i++) { |
duke@435 | 43 | _locals[i] = VerificationType::bogus_type(); |
duke@435 | 44 | } |
duke@435 | 45 | for(i = 0; i < max_stack; i++) { |
duke@435 | 46 | _stack[i] = VerificationType::bogus_type(); |
duke@435 | 47 | } |
duke@435 | 48 | } |
duke@435 | 49 | |
duke@435 | 50 | StackMapFrame* StackMapFrame::frame_in_exception_handler(u1 flags) { |
duke@435 | 51 | Thread* thr = _verifier->thread(); |
duke@435 | 52 | VerificationType* stack = NEW_RESOURCE_ARRAY_IN_THREAD(thr, VerificationType, 1); |
duke@435 | 53 | StackMapFrame* frame = new StackMapFrame(_offset, flags, _locals_size, 0, _max_locals, _max_stack, _locals, stack, _verifier); |
duke@435 | 54 | return frame; |
duke@435 | 55 | } |
duke@435 | 56 | |
duke@435 | 57 | void StackMapFrame::initialize_object( |
duke@435 | 58 | VerificationType old_object, VerificationType new_object) { |
duke@435 | 59 | int32_t i; |
duke@435 | 60 | for (i = 0; i < _max_locals; i++) { |
duke@435 | 61 | if (_locals[i].equals(old_object)) { |
duke@435 | 62 | _locals[i] = new_object; |
duke@435 | 63 | } |
duke@435 | 64 | } |
duke@435 | 65 | for (i = 0; i < _stack_size; i++) { |
duke@435 | 66 | if (_stack[i].equals(old_object)) { |
duke@435 | 67 | _stack[i] = new_object; |
duke@435 | 68 | } |
duke@435 | 69 | } |
duke@435 | 70 | if (old_object == VerificationType::uninitialized_this_type()) { |
duke@435 | 71 | // "this" has been initialized - reset flags |
duke@435 | 72 | _flags = 0; |
duke@435 | 73 | } |
duke@435 | 74 | } |
duke@435 | 75 | |
duke@435 | 76 | VerificationType StackMapFrame::set_locals_from_arg( |
duke@435 | 77 | const methodHandle m, VerificationType thisKlass, TRAPS) { |
coleenp@2497 | 78 | SignatureStream ss(m->signature()); |
duke@435 | 79 | int init_local_num = 0; |
duke@435 | 80 | if (!m->is_static()) { |
duke@435 | 81 | init_local_num++; |
duke@435 | 82 | // add one extra argument for instance method |
duke@435 | 83 | if (m->name() == vmSymbols::object_initializer_name() && |
duke@435 | 84 | thisKlass.name() != vmSymbols::java_lang_Object()) { |
duke@435 | 85 | _locals[0] = VerificationType::uninitialized_this_type(); |
duke@435 | 86 | _flags |= FLAG_THIS_UNINIT; |
duke@435 | 87 | } else { |
duke@435 | 88 | _locals[0] = thisKlass; |
duke@435 | 89 | } |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | // local num may be greater than size of parameters because long/double occupies two slots |
duke@435 | 93 | while(!ss.at_return_type()) { |
duke@435 | 94 | init_local_num += _verifier->change_sig_to_verificationType( |
duke@435 | 95 | &ss, &_locals[init_local_num], |
duke@435 | 96 | CHECK_VERIFY_(verifier(), VerificationType::bogus_type())); |
duke@435 | 97 | ss.next(); |
duke@435 | 98 | } |
duke@435 | 99 | _locals_size = init_local_num; |
duke@435 | 100 | |
duke@435 | 101 | switch (ss.type()) { |
duke@435 | 102 | case T_OBJECT: |
duke@435 | 103 | case T_ARRAY: |
duke@435 | 104 | { |
coleenp@2497 | 105 | Symbol* sig = ss.as_symbol(CHECK_(VerificationType::bogus_type())); |
coleenp@2497 | 106 | // Create another symbol to save as signature stream unreferences |
coleenp@2497 | 107 | // this symbol. |
coleenp@2497 | 108 | Symbol* sig_copy = |
coleenp@2497 | 109 | verifier()->create_temporary_symbol(sig, 0, sig->utf8_length(), |
coleenp@2497 | 110 | CHECK_(VerificationType::bogus_type())); |
coleenp@2497 | 111 | assert(sig_copy == sig, "symbols don't match"); |
coleenp@2497 | 112 | return VerificationType::reference_type(sig_copy); |
duke@435 | 113 | } |
duke@435 | 114 | case T_INT: return VerificationType::integer_type(); |
duke@435 | 115 | case T_BYTE: return VerificationType::byte_type(); |
duke@435 | 116 | case T_CHAR: return VerificationType::char_type(); |
duke@435 | 117 | case T_SHORT: return VerificationType::short_type(); |
duke@435 | 118 | case T_BOOLEAN: return VerificationType::boolean_type(); |
duke@435 | 119 | case T_FLOAT: return VerificationType::float_type(); |
duke@435 | 120 | case T_DOUBLE: return VerificationType::double_type(); |
duke@435 | 121 | case T_LONG: return VerificationType::long_type(); |
duke@435 | 122 | case T_VOID: return VerificationType::bogus_type(); |
duke@435 | 123 | default: |
duke@435 | 124 | ShouldNotReachHere(); |
duke@435 | 125 | } |
duke@435 | 126 | return VerificationType::bogus_type(); |
duke@435 | 127 | } |
duke@435 | 128 | |
duke@435 | 129 | void StackMapFrame::copy_locals(const StackMapFrame* src) { |
duke@435 | 130 | int32_t len = src->locals_size() < _locals_size ? |
duke@435 | 131 | src->locals_size() : _locals_size; |
duke@435 | 132 | for (int32_t i = 0; i < len; i++) { |
duke@435 | 133 | _locals[i] = src->locals()[i]; |
duke@435 | 134 | } |
duke@435 | 135 | } |
duke@435 | 136 | |
duke@435 | 137 | void StackMapFrame::copy_stack(const StackMapFrame* src) { |
duke@435 | 138 | int32_t len = src->stack_size() < _stack_size ? |
duke@435 | 139 | src->stack_size() : _stack_size; |
duke@435 | 140 | for (int32_t i = 0; i < len; i++) { |
duke@435 | 141 | _stack[i] = src->stack()[i]; |
duke@435 | 142 | } |
duke@435 | 143 | } |
duke@435 | 144 | |
kamg@3992 | 145 | // Returns the location of the first mismatch, or 'len' if there are no |
kamg@3992 | 146 | // mismatches |
kamg@3992 | 147 | int StackMapFrame::is_assignable_to( |
duke@435 | 148 | VerificationType* from, VerificationType* to, int32_t len, TRAPS) const { |
kamg@3992 | 149 | int32_t i = 0; |
kamg@3992 | 150 | for (i = 0; i < len; i++) { |
hseigel@6824 | 151 | if (!to[i].is_assignable_from(from[i], verifier(), false, THREAD)) { |
kamg@3992 | 152 | break; |
duke@435 | 153 | } |
duke@435 | 154 | } |
kamg@3992 | 155 | return i; |
duke@435 | 156 | } |
duke@435 | 157 | |
kamg@2585 | 158 | bool StackMapFrame::has_flag_match_exception( |
kamg@2585 | 159 | const StackMapFrame* target) const { |
kamg@2585 | 160 | // We allow flags of {UninitThis} to assign to {} if-and-only-if the |
kamg@2585 | 161 | // target frame does not depend upon the current type. |
kamg@2585 | 162 | // This is slightly too strict, as we need only enforce that the |
kamg@2585 | 163 | // slots that were initialized by the <init> (the things that were |
kamg@2585 | 164 | // UninitializedThis before initialize_object() converted them) are unused. |
kamg@2585 | 165 | // However we didn't save that information so we'll enforce this upon |
kamg@2585 | 166 | // anything that might have been initialized. This is a rare situation |
kamg@2585 | 167 | // and javac never generates code that would end up here, but some profilers |
kamg@2585 | 168 | // (such as NetBeans) might, when adding exception handlers in <init> |
kamg@2585 | 169 | // methods to cover the invokespecial instruction. See 7020118. |
kamg@2585 | 170 | |
kamg@2585 | 171 | assert(max_locals() == target->max_locals() && |
kamg@2585 | 172 | stack_size() == target->stack_size(), "StackMap sizes must match"); |
kamg@2585 | 173 | |
kamg@2585 | 174 | VerificationType top = VerificationType::top_type(); |
kamg@2585 | 175 | VerificationType this_type = verifier()->current_type(); |
kamg@2585 | 176 | |
kamg@2585 | 177 | if (!flag_this_uninit() || target->flags() != 0) { |
kamg@2585 | 178 | return false; |
kamg@2585 | 179 | } |
kamg@2585 | 180 | |
kamg@2585 | 181 | for (int i = 0; i < target->locals_size(); ++i) { |
kamg@2585 | 182 | if (locals()[i] == this_type && target->locals()[i] != top) { |
kamg@2585 | 183 | return false; |
kamg@2585 | 184 | } |
kamg@2585 | 185 | } |
kamg@2585 | 186 | |
kamg@2585 | 187 | for (int i = 0; i < target->stack_size(); ++i) { |
kamg@2585 | 188 | if (stack()[i] == this_type && target->stack()[i] != top) { |
kamg@2585 | 189 | return false; |
kamg@2585 | 190 | } |
kamg@2585 | 191 | } |
kamg@2585 | 192 | |
kamg@2585 | 193 | return true; |
kamg@2585 | 194 | } |
kamg@2585 | 195 | |
kamg@2754 | 196 | bool StackMapFrame::is_assignable_to( |
kamg@3992 | 197 | const StackMapFrame* target, bool is_exception_handler, |
kamg@3992 | 198 | ErrorContext* ctx, TRAPS) const { |
kamg@3992 | 199 | if (_max_locals != target->max_locals()) { |
kamg@3992 | 200 | *ctx = ErrorContext::locals_size_mismatch( |
kamg@3992 | 201 | _offset, (StackMapFrame*)this, (StackMapFrame*)target); |
kamg@3992 | 202 | return false; |
kamg@3992 | 203 | } |
kamg@3992 | 204 | if (_stack_size != target->stack_size()) { |
kamg@3992 | 205 | *ctx = ErrorContext::stack_size_mismatch( |
kamg@3992 | 206 | _offset, (StackMapFrame*)this, (StackMapFrame*)target); |
duke@435 | 207 | return false; |
duke@435 | 208 | } |
duke@435 | 209 | // Only need to compare type elements up to target->locals() or target->stack(). |
duke@435 | 210 | // The remaining type elements in this state can be ignored because they are |
duke@435 | 211 | // assignable to bogus type. |
kamg@3992 | 212 | int mismatch_loc; |
kamg@3992 | 213 | mismatch_loc = is_assignable_to( |
kamg@3992 | 214 | _locals, target->locals(), target->locals_size(), THREAD); |
kamg@3992 | 215 | if (mismatch_loc != target->locals_size()) { |
kamg@3992 | 216 | *ctx = ErrorContext::bad_type(target->offset(), |
kamg@3992 | 217 | TypeOrigin::local(mismatch_loc, (StackMapFrame*)this), |
kamg@3992 | 218 | TypeOrigin::sm_local(mismatch_loc, (StackMapFrame*)target)); |
kamg@3992 | 219 | return false; |
kamg@3992 | 220 | } |
kamg@3992 | 221 | mismatch_loc = is_assignable_to(_stack, target->stack(), _stack_size, THREAD); |
kamg@3992 | 222 | if (mismatch_loc != _stack_size) { |
kamg@3992 | 223 | *ctx = ErrorContext::bad_type(target->offset(), |
kamg@3992 | 224 | TypeOrigin::stack(mismatch_loc, (StackMapFrame*)this), |
kamg@3992 | 225 | TypeOrigin::sm_stack(mismatch_loc, (StackMapFrame*)target)); |
kamg@3992 | 226 | return false; |
kamg@3992 | 227 | } |
kamg@3992 | 228 | |
duke@435 | 229 | bool match_flags = (_flags | target->flags()) == target->flags(); |
kamg@3992 | 230 | if (match_flags || is_exception_handler && has_flag_match_exception(target)) { |
kamg@3992 | 231 | return true; |
kamg@3992 | 232 | } else { |
kamg@3992 | 233 | *ctx = ErrorContext::bad_flags(target->offset(), |
kamg@3992 | 234 | (StackMapFrame*)this, (StackMapFrame*)target); |
kamg@3992 | 235 | return false; |
kamg@3992 | 236 | } |
duke@435 | 237 | } |
duke@435 | 238 | |
duke@435 | 239 | VerificationType StackMapFrame::pop_stack_ex(VerificationType type, TRAPS) { |
duke@435 | 240 | if (_stack_size <= 0) { |
kamg@3992 | 241 | verifier()->verify_error( |
kamg@3992 | 242 | ErrorContext::stack_underflow(_offset, this), |
kamg@3992 | 243 | "Operand stack underflow"); |
duke@435 | 244 | return VerificationType::bogus_type(); |
duke@435 | 245 | } |
duke@435 | 246 | VerificationType top = _stack[--_stack_size]; |
duke@435 | 247 | bool subtype = type.is_assignable_from( |
hseigel@6824 | 248 | top, verifier(), false, CHECK_(VerificationType::bogus_type())); |
duke@435 | 249 | if (!subtype) { |
kamg@3992 | 250 | verifier()->verify_error( |
kamg@3992 | 251 | ErrorContext::bad_type(_offset, stack_top_ctx(), |
kamg@3992 | 252 | TypeOrigin::implicit(type)), |
kamg@3992 | 253 | "Bad type on operand stack"); |
duke@435 | 254 | return VerificationType::bogus_type(); |
duke@435 | 255 | } |
duke@435 | 256 | return top; |
duke@435 | 257 | } |
duke@435 | 258 | |
duke@435 | 259 | VerificationType StackMapFrame::get_local( |
duke@435 | 260 | int32_t index, VerificationType type, TRAPS) { |
duke@435 | 261 | if (index >= _max_locals) { |
kamg@3992 | 262 | verifier()->verify_error( |
kamg@3992 | 263 | ErrorContext::bad_local_index(_offset, index), |
kamg@3992 | 264 | "Local variable table overflow"); |
duke@435 | 265 | return VerificationType::bogus_type(); |
duke@435 | 266 | } |
duke@435 | 267 | bool subtype = type.is_assignable_from(_locals[index], |
hseigel@6824 | 268 | verifier(), false, CHECK_(VerificationType::bogus_type())); |
duke@435 | 269 | if (!subtype) { |
kamg@3992 | 270 | verifier()->verify_error( |
kamg@3992 | 271 | ErrorContext::bad_type(_offset, |
kamg@3992 | 272 | TypeOrigin::local(index, this), |
kamg@3992 | 273 | TypeOrigin::implicit(type)), |
kamg@3992 | 274 | "Bad local variable type"); |
duke@435 | 275 | return VerificationType::bogus_type(); |
duke@435 | 276 | } |
duke@435 | 277 | if(index >= _locals_size) { _locals_size = index + 1; } |
duke@435 | 278 | return _locals[index]; |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | void StackMapFrame::get_local_2( |
duke@435 | 282 | int32_t index, VerificationType type1, VerificationType type2, TRAPS) { |
duke@435 | 283 | assert(type1.is_long() || type1.is_double(), "must be long/double"); |
duke@435 | 284 | assert(type2.is_long2() || type2.is_double2(), "must be long/double_2"); |
duke@435 | 285 | if (index >= _locals_size - 1) { |
kamg@3992 | 286 | verifier()->verify_error( |
kamg@3992 | 287 | ErrorContext::bad_local_index(_offset, index), |
kamg@3992 | 288 | "get long/double overflows locals"); |
duke@435 | 289 | return; |
duke@435 | 290 | } |
hseigel@6824 | 291 | bool subtype = type1.is_assignable_from(_locals[index], verifier(), false, CHECK); |
kamg@3992 | 292 | if (!subtype) { |
kamg@3992 | 293 | verifier()->verify_error( |
kamg@3992 | 294 | ErrorContext::bad_type(_offset, |
kamg@3992 | 295 | TypeOrigin::local(index, this), TypeOrigin::implicit(type1)), |
kamg@3992 | 296 | "Bad local variable type"); |
kamg@3992 | 297 | } else { |
hseigel@6824 | 298 | subtype = type2.is_assignable_from(_locals[index + 1], verifier(), false, CHECK); |
kamg@3992 | 299 | if (!subtype) { |
kamg@3992 | 300 | /* Unreachable? All local store routines convert a split long or double |
kamg@3992 | 301 | * into a TOP during the store. So we should never end up seeing an |
kamg@3992 | 302 | * orphaned half. */ |
kamg@3992 | 303 | verifier()->verify_error( |
kamg@3992 | 304 | ErrorContext::bad_type(_offset, |
kamg@3992 | 305 | TypeOrigin::local(index + 1, this), TypeOrigin::implicit(type2)), |
kamg@3992 | 306 | "Bad local variable type"); |
kamg@3992 | 307 | } |
duke@435 | 308 | } |
duke@435 | 309 | } |
duke@435 | 310 | |
duke@435 | 311 | void StackMapFrame::set_local(int32_t index, VerificationType type, TRAPS) { |
duke@435 | 312 | assert(!type.is_check(), "Must be a real type"); |
duke@435 | 313 | if (index >= _max_locals) { |
kamg@3992 | 314 | verifier()->verify_error( |
kamg@3992 | 315 | ErrorContext::bad_local_index(_offset, index), |
kamg@3992 | 316 | "Local variable table overflow"); |
duke@435 | 317 | return; |
duke@435 | 318 | } |
duke@435 | 319 | // If type at index is double or long, set the next location to be unusable |
duke@435 | 320 | if (_locals[index].is_double() || _locals[index].is_long()) { |
duke@435 | 321 | assert((index + 1) < _locals_size, "Local variable table overflow"); |
duke@435 | 322 | _locals[index + 1] = VerificationType::bogus_type(); |
duke@435 | 323 | } |
duke@435 | 324 | // If type at index is double_2 or long_2, set the previous location to be unusable |
duke@435 | 325 | if (_locals[index].is_double2() || _locals[index].is_long2()) { |
duke@435 | 326 | assert(index >= 1, "Local variable table underflow"); |
duke@435 | 327 | _locals[index - 1] = VerificationType::bogus_type(); |
duke@435 | 328 | } |
duke@435 | 329 | _locals[index] = type; |
duke@435 | 330 | if (index >= _locals_size) { |
duke@435 | 331 | #ifdef ASSERT |
duke@435 | 332 | for (int i=_locals_size; i<index; i++) { |
duke@435 | 333 | assert(_locals[i] == VerificationType::bogus_type(), |
duke@435 | 334 | "holes must be bogus type"); |
duke@435 | 335 | } |
duke@435 | 336 | #endif |
duke@435 | 337 | _locals_size = index + 1; |
duke@435 | 338 | } |
duke@435 | 339 | } |
duke@435 | 340 | |
duke@435 | 341 | void StackMapFrame::set_local_2( |
duke@435 | 342 | int32_t index, VerificationType type1, VerificationType type2, TRAPS) { |
duke@435 | 343 | assert(type1.is_long() || type1.is_double(), "must be long/double"); |
duke@435 | 344 | assert(type2.is_long2() || type2.is_double2(), "must be long/double_2"); |
duke@435 | 345 | if (index >= _max_locals - 1) { |
kamg@3992 | 346 | verifier()->verify_error( |
kamg@3992 | 347 | ErrorContext::bad_local_index(_offset, index), |
kamg@3992 | 348 | "Local variable table overflow"); |
duke@435 | 349 | return; |
duke@435 | 350 | } |
duke@435 | 351 | // If type at index+1 is double or long, set the next location to be unusable |
duke@435 | 352 | if (_locals[index+1].is_double() || _locals[index+1].is_long()) { |
duke@435 | 353 | assert((index + 2) < _locals_size, "Local variable table overflow"); |
duke@435 | 354 | _locals[index + 2] = VerificationType::bogus_type(); |
duke@435 | 355 | } |
duke@435 | 356 | // If type at index is double_2 or long_2, set the previous location to be unusable |
duke@435 | 357 | if (_locals[index].is_double2() || _locals[index].is_long2()) { |
duke@435 | 358 | assert(index >= 1, "Local variable table underflow"); |
duke@435 | 359 | _locals[index - 1] = VerificationType::bogus_type(); |
duke@435 | 360 | } |
duke@435 | 361 | _locals[index] = type1; |
duke@435 | 362 | _locals[index+1] = type2; |
duke@435 | 363 | if (index >= _locals_size - 1) { |
duke@435 | 364 | #ifdef ASSERT |
duke@435 | 365 | for (int i=_locals_size; i<index; i++) { |
duke@435 | 366 | assert(_locals[i] == VerificationType::bogus_type(), |
duke@435 | 367 | "holes must be bogus type"); |
duke@435 | 368 | } |
duke@435 | 369 | #endif |
duke@435 | 370 | _locals_size = index + 2; |
duke@435 | 371 | } |
duke@435 | 372 | } |
duke@435 | 373 | |
kamg@3992 | 374 | TypeOrigin StackMapFrame::stack_top_ctx() { |
kamg@3992 | 375 | return TypeOrigin::stack(_stack_size, this); |
duke@435 | 376 | } |
duke@435 | 377 | |
kamg@3992 | 378 | void StackMapFrame::print_on(outputStream* str) const { |
kamg@3992 | 379 | str->indent().print_cr("bci: @%d", _offset); |
kamg@3992 | 380 | str->indent().print_cr("flags: {%s }", |
kamg@3992 | 381 | flag_this_uninit() ? " flagThisUninit" : ""); |
kamg@3992 | 382 | str->indent().print("locals: {"); |
kamg@3992 | 383 | for (int32_t i = 0; i < _locals_size; ++i) { |
kamg@3992 | 384 | str->print(" "); |
kamg@3992 | 385 | _locals[i].print_on(str); |
kamg@3992 | 386 | if (i != _locals_size - 1) { |
kamg@3992 | 387 | str->print(","); |
kamg@3992 | 388 | } |
kamg@3992 | 389 | } |
kamg@3992 | 390 | str->print_cr(" }"); |
kamg@3992 | 391 | str->indent().print("stack: {"); |
kamg@3992 | 392 | for (int32_t j = 0; j < _stack_size; ++j) { |
kamg@3992 | 393 | str->print(" "); |
kamg@3992 | 394 | _stack[j].print_on(str); |
kamg@3992 | 395 | if (j != _stack_size - 1) { |
kamg@3992 | 396 | str->print(","); |
kamg@3992 | 397 | } |
kamg@3992 | 398 | } |
kamg@3992 | 399 | str->print_cr(" }"); |
kamg@3992 | 400 | } |