Tue, 28 Jul 2009 12:12:40 -0700
6862919: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 07/09
Reviewed-by: tbell, ohair
duke@435 | 1 | /* |
xdono@1279 | 2 | * Copyright 2006-2009 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 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_ciMethodBlocks.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | // ciMethodBlocks |
duke@435 | 29 | |
duke@435 | 30 | |
duke@435 | 31 | |
duke@435 | 32 | ciBlock *ciMethodBlocks::block_containing(int bci) { |
duke@435 | 33 | ciBlock *blk = _bci_to_block[bci]; |
duke@435 | 34 | return blk; |
duke@435 | 35 | } |
duke@435 | 36 | |
duke@435 | 37 | bool ciMethodBlocks::is_block_start(int bci) { |
duke@435 | 38 | assert(bci >=0 && bci < _code_size, "valid bytecode range"); |
duke@435 | 39 | ciBlock *b = _bci_to_block[bci]; |
duke@435 | 40 | assert(b != NULL, "must have block for bytecode"); |
duke@435 | 41 | return b->start_bci() == bci; |
duke@435 | 42 | } |
duke@435 | 43 | |
duke@435 | 44 | // ------------------------------------------------------------------ |
duke@435 | 45 | // ciMethodBlocks::split_block_at |
duke@435 | 46 | // |
duke@435 | 47 | // Split the block spanning bci into two separate ranges. The former |
duke@435 | 48 | // block becomes the second half and a new range is created for the |
duke@435 | 49 | // first half. Returns the range beginning at bci. |
duke@435 | 50 | ciBlock *ciMethodBlocks::split_block_at(int bci) { |
duke@435 | 51 | ciBlock *former_block = block_containing(bci); |
never@802 | 52 | ciBlock *new_block = new(_arena) ciBlock(_method, _num_blocks++, former_block->start_bci()); |
duke@435 | 53 | _blocks->append(new_block); |
duke@435 | 54 | assert(former_block != NULL, "must not be NULL"); |
duke@435 | 55 | new_block->set_limit_bci(bci); |
duke@435 | 56 | former_block->set_start_bci(bci); |
duke@435 | 57 | for (int pos=bci-1; pos >= 0; pos--) { |
duke@435 | 58 | ciBlock *current_block = block_containing(pos); |
duke@435 | 59 | if (current_block == former_block) { |
duke@435 | 60 | // Replace it. |
duke@435 | 61 | _bci_to_block[pos] = new_block; |
duke@435 | 62 | } else if (current_block == NULL) { |
duke@435 | 63 | // Non-bytecode start. Skip. |
duke@435 | 64 | continue; |
duke@435 | 65 | } else { |
duke@435 | 66 | // We are done with our backwards walk |
duke@435 | 67 | break; |
duke@435 | 68 | } |
duke@435 | 69 | } |
kvn@461 | 70 | // Move an exception handler information if needed. |
kvn@461 | 71 | if (former_block->is_handler()) { |
kvn@461 | 72 | int ex_start = former_block->ex_start_bci(); |
kvn@461 | 73 | int ex_end = former_block->ex_limit_bci(); |
kvn@461 | 74 | new_block->set_exception_range(ex_start, ex_end); |
kvn@461 | 75 | // Clear information in former_block. |
kvn@461 | 76 | former_block->clear_exception_handler(); |
kvn@461 | 77 | } |
duke@435 | 78 | return former_block; |
duke@435 | 79 | } |
duke@435 | 80 | |
duke@435 | 81 | ciBlock *ciMethodBlocks::make_block_at(int bci) { |
duke@435 | 82 | ciBlock *cb = block_containing(bci); |
duke@435 | 83 | if (cb == NULL ) { |
duke@435 | 84 | // This is our first time visiting this bytecode. Create |
duke@435 | 85 | // a fresh block and assign it this starting point. |
never@802 | 86 | ciBlock *nb = new(_arena) ciBlock(_method, _num_blocks++, bci); |
duke@435 | 87 | _blocks->append(nb); |
duke@435 | 88 | _bci_to_block[bci] = nb; |
duke@435 | 89 | return nb; |
duke@435 | 90 | } else if (cb->start_bci() == bci) { |
duke@435 | 91 | // The block begins at bci. Simply return it. |
duke@435 | 92 | return cb; |
duke@435 | 93 | } else { |
duke@435 | 94 | // We have already created a block containing bci but |
duke@435 | 95 | // not starting at bci. This existing block needs to |
duke@435 | 96 | // be split into two. |
duke@435 | 97 | return split_block_at(bci); |
duke@435 | 98 | } |
duke@435 | 99 | } |
duke@435 | 100 | |
never@802 | 101 | ciBlock *ciMethodBlocks::make_dummy_block() { |
never@802 | 102 | ciBlock *dum = new(_arena) ciBlock(_method, -1, 0); |
never@802 | 103 | return dum; |
never@802 | 104 | } |
never@802 | 105 | |
duke@435 | 106 | void ciMethodBlocks::do_analysis() { |
duke@435 | 107 | ciBytecodeStream s(_method); |
duke@435 | 108 | ciBlock *cur_block = block_containing(0); |
duke@435 | 109 | int limit_bci = _method->code_size(); |
duke@435 | 110 | |
duke@435 | 111 | while (s.next() != ciBytecodeStream::EOBC()) { |
duke@435 | 112 | int bci = s.cur_bci(); |
duke@435 | 113 | // Determine if a new block has been made at the current bci. If |
duke@435 | 114 | // this block differs from our current range, switch to the new |
duke@435 | 115 | // one and end the old one. |
duke@435 | 116 | assert(cur_block != NULL, "must always have a current block"); |
duke@435 | 117 | ciBlock *new_block = block_containing(bci); |
kvn@461 | 118 | if (new_block == NULL || new_block == cur_block) { |
duke@435 | 119 | // We have not marked this bci as the start of a new block. |
duke@435 | 120 | // Keep interpreting the current_range. |
duke@435 | 121 | _bci_to_block[bci] = cur_block; |
duke@435 | 122 | } else { |
duke@435 | 123 | cur_block->set_limit_bci(bci); |
duke@435 | 124 | cur_block = new_block; |
duke@435 | 125 | } |
duke@435 | 126 | |
duke@435 | 127 | switch (s.cur_bc()) { |
duke@435 | 128 | case Bytecodes::_ifeq : |
duke@435 | 129 | case Bytecodes::_ifne : |
duke@435 | 130 | case Bytecodes::_iflt : |
duke@435 | 131 | case Bytecodes::_ifge : |
duke@435 | 132 | case Bytecodes::_ifgt : |
duke@435 | 133 | case Bytecodes::_ifle : |
duke@435 | 134 | case Bytecodes::_if_icmpeq : |
duke@435 | 135 | case Bytecodes::_if_icmpne : |
duke@435 | 136 | case Bytecodes::_if_icmplt : |
duke@435 | 137 | case Bytecodes::_if_icmpge : |
duke@435 | 138 | case Bytecodes::_if_icmpgt : |
duke@435 | 139 | case Bytecodes::_if_icmple : |
duke@435 | 140 | case Bytecodes::_if_acmpeq : |
duke@435 | 141 | case Bytecodes::_if_acmpne : |
duke@435 | 142 | case Bytecodes::_ifnull : |
duke@435 | 143 | case Bytecodes::_ifnonnull : |
duke@435 | 144 | { |
duke@435 | 145 | cur_block->set_control_bci(bci); |
duke@435 | 146 | ciBlock *fall_through = make_block_at(s.next_bci()); |
duke@435 | 147 | int dest_bci = s.get_dest(); |
duke@435 | 148 | ciBlock *dest = make_block_at(dest_bci); |
duke@435 | 149 | break; |
duke@435 | 150 | } |
duke@435 | 151 | |
duke@435 | 152 | case Bytecodes::_goto : |
duke@435 | 153 | { |
duke@435 | 154 | cur_block->set_control_bci(bci); |
duke@435 | 155 | if (s.next_bci() < limit_bci) { |
duke@435 | 156 | (void) make_block_at(s.next_bci()); |
duke@435 | 157 | } |
duke@435 | 158 | int dest_bci = s.get_dest(); |
duke@435 | 159 | ciBlock *dest = make_block_at(dest_bci); |
duke@435 | 160 | break; |
duke@435 | 161 | } |
duke@435 | 162 | |
duke@435 | 163 | case Bytecodes::_jsr : |
duke@435 | 164 | { |
duke@435 | 165 | cur_block->set_control_bci(bci); |
duke@435 | 166 | ciBlock *ret = make_block_at(s.next_bci()); |
duke@435 | 167 | int dest_bci = s.get_dest(); |
duke@435 | 168 | ciBlock *dest = make_block_at(dest_bci); |
duke@435 | 169 | break; |
duke@435 | 170 | } |
duke@435 | 171 | |
duke@435 | 172 | case Bytecodes::_tableswitch : |
duke@435 | 173 | { |
duke@435 | 174 | cur_block->set_control_bci(bci); |
duke@435 | 175 | Bytecode_tableswitch* switch_ = Bytecode_tableswitch_at(s.cur_bcp()); |
duke@435 | 176 | int len = switch_->length(); |
duke@435 | 177 | ciBlock *dest; |
duke@435 | 178 | int dest_bci; |
duke@435 | 179 | for (int i = 0; i < len; i++) { |
duke@435 | 180 | dest_bci = s.cur_bci() + switch_->dest_offset_at(i); |
duke@435 | 181 | dest = make_block_at(dest_bci); |
duke@435 | 182 | } |
duke@435 | 183 | dest_bci = s.cur_bci() + switch_->default_offset(); |
duke@435 | 184 | make_block_at(dest_bci); |
duke@435 | 185 | if (s.next_bci() < limit_bci) { |
duke@435 | 186 | dest = make_block_at(s.next_bci()); |
duke@435 | 187 | } |
duke@435 | 188 | } |
duke@435 | 189 | break; |
duke@435 | 190 | |
duke@435 | 191 | case Bytecodes::_lookupswitch: |
duke@435 | 192 | { |
duke@435 | 193 | cur_block->set_control_bci(bci); |
duke@435 | 194 | Bytecode_lookupswitch* switch_ = Bytecode_lookupswitch_at(s.cur_bcp()); |
duke@435 | 195 | int len = switch_->number_of_pairs(); |
duke@435 | 196 | ciBlock *dest; |
duke@435 | 197 | int dest_bci; |
duke@435 | 198 | for (int i = 0; i < len; i++) { |
duke@435 | 199 | dest_bci = s.cur_bci() + switch_->pair_at(i)->offset(); |
duke@435 | 200 | dest = make_block_at(dest_bci); |
duke@435 | 201 | } |
duke@435 | 202 | dest_bci = s.cur_bci() + switch_->default_offset(); |
duke@435 | 203 | dest = make_block_at(dest_bci); |
duke@435 | 204 | if (s.next_bci() < limit_bci) { |
duke@435 | 205 | dest = make_block_at(s.next_bci()); |
duke@435 | 206 | } |
duke@435 | 207 | } |
duke@435 | 208 | break; |
duke@435 | 209 | |
duke@435 | 210 | case Bytecodes::_goto_w : |
duke@435 | 211 | { |
duke@435 | 212 | cur_block->set_control_bci(bci); |
duke@435 | 213 | if (s.next_bci() < limit_bci) { |
duke@435 | 214 | (void) make_block_at(s.next_bci()); |
duke@435 | 215 | } |
duke@435 | 216 | int dest_bci = s.get_far_dest(); |
duke@435 | 217 | ciBlock *dest = make_block_at(dest_bci); |
duke@435 | 218 | break; |
duke@435 | 219 | } |
duke@435 | 220 | |
duke@435 | 221 | case Bytecodes::_jsr_w : |
duke@435 | 222 | { |
duke@435 | 223 | cur_block->set_control_bci(bci); |
duke@435 | 224 | ciBlock *ret = make_block_at(s.next_bci()); |
duke@435 | 225 | int dest_bci = s.get_far_dest(); |
duke@435 | 226 | ciBlock *dest = make_block_at(dest_bci); |
duke@435 | 227 | break; |
duke@435 | 228 | } |
duke@435 | 229 | |
duke@435 | 230 | case Bytecodes::_athrow : |
duke@435 | 231 | cur_block->set_may_throw(); |
duke@435 | 232 | // fall-through |
duke@435 | 233 | case Bytecodes::_ret : |
duke@435 | 234 | case Bytecodes::_ireturn : |
duke@435 | 235 | case Bytecodes::_lreturn : |
duke@435 | 236 | case Bytecodes::_freturn : |
duke@435 | 237 | case Bytecodes::_dreturn : |
duke@435 | 238 | case Bytecodes::_areturn : |
duke@435 | 239 | case Bytecodes::_return : |
duke@435 | 240 | cur_block->set_control_bci(bci); |
duke@435 | 241 | if (s.next_bci() < limit_bci) { |
duke@435 | 242 | (void) make_block_at(s.next_bci()); |
duke@435 | 243 | } |
duke@435 | 244 | break; |
duke@435 | 245 | } |
duke@435 | 246 | } |
duke@435 | 247 | // End the last block |
duke@435 | 248 | cur_block->set_limit_bci(limit_bci); |
duke@435 | 249 | } |
duke@435 | 250 | |
duke@435 | 251 | ciMethodBlocks::ciMethodBlocks(Arena *arena, ciMethod *meth): _method(meth), |
duke@435 | 252 | _arena(arena), _num_blocks(0), _code_size(meth->code_size()) { |
duke@435 | 253 | int block_estimate = _code_size / 8; |
duke@435 | 254 | |
duke@435 | 255 | _blocks = new(_arena) GrowableArray<ciBlock *>(block_estimate); |
duke@435 | 256 | int b2bsize = _code_size * sizeof(ciBlock **); |
duke@435 | 257 | _bci_to_block = (ciBlock **) arena->Amalloc(b2bsize); |
duke@435 | 258 | Copy::zero_to_words((HeapWord*) _bci_to_block, b2bsize / sizeof(HeapWord)); |
duke@435 | 259 | |
duke@435 | 260 | // create initial block covering the entire method |
never@802 | 261 | ciBlock *b = new(arena) ciBlock(_method, _num_blocks++, 0); |
duke@435 | 262 | _blocks->append(b); |
duke@435 | 263 | _bci_to_block[0] = b; |
duke@435 | 264 | |
duke@435 | 265 | // create blocks for exception handlers |
duke@435 | 266 | if (meth->has_exception_handlers()) { |
duke@435 | 267 | for(ciExceptionHandlerStream str(meth); !str.is_done(); str.next()) { |
duke@435 | 268 | ciExceptionHandler* handler = str.handler(); |
duke@435 | 269 | ciBlock *eb = make_block_at(handler->handler_bci()); |
kvn@461 | 270 | // |
kvn@461 | 271 | // Several exception handlers can have the same handler_bci: |
kvn@461 | 272 | // |
kvn@461 | 273 | // try { |
kvn@461 | 274 | // if (a.foo(b) < 0) { |
kvn@461 | 275 | // return a.error(); |
kvn@461 | 276 | // } |
kvn@461 | 277 | // return CoderResult.UNDERFLOW; |
kvn@461 | 278 | // } finally { |
kvn@461 | 279 | // a.position(b); |
kvn@461 | 280 | // } |
kvn@461 | 281 | // |
kvn@461 | 282 | // The try block above is divided into 2 exception blocks |
kvn@461 | 283 | // separated by 'areturn' bci. |
kvn@461 | 284 | // |
duke@435 | 285 | int ex_start = handler->start(); |
duke@435 | 286 | int ex_end = handler->limit(); |
kvn@1081 | 287 | // ensure a block at the start of exception range and start of following code |
kvn@1081 | 288 | (void) make_block_at(ex_start); |
kvn@1081 | 289 | if (ex_end < _code_size) |
kvn@1081 | 290 | (void) make_block_at(ex_end); |
kvn@1081 | 291 | |
kvn@461 | 292 | if (eb->is_handler()) { |
kvn@461 | 293 | // Extend old handler exception range to cover additional range. |
kvn@461 | 294 | int old_ex_start = eb->ex_start_bci(); |
kvn@461 | 295 | int old_ex_end = eb->ex_limit_bci(); |
kvn@461 | 296 | if (ex_start > old_ex_start) |
kvn@461 | 297 | ex_start = old_ex_start; |
kvn@461 | 298 | if (ex_end < old_ex_end) |
kvn@461 | 299 | ex_end = old_ex_end; |
kvn@461 | 300 | eb->clear_exception_handler(); // Reset exception information |
kvn@461 | 301 | } |
duke@435 | 302 | eb->set_exception_range(ex_start, ex_end); |
duke@435 | 303 | } |
duke@435 | 304 | } |
duke@435 | 305 | |
duke@435 | 306 | // scan the bytecodes and identify blocks |
duke@435 | 307 | do_analysis(); |
duke@435 | 308 | |
duke@435 | 309 | // mark blocks that have exception handlers |
duke@435 | 310 | if (meth->has_exception_handlers()) { |
duke@435 | 311 | for(ciExceptionHandlerStream str(meth); !str.is_done(); str.next()) { |
duke@435 | 312 | ciExceptionHandler* handler = str.handler(); |
duke@435 | 313 | int ex_start = handler->start(); |
duke@435 | 314 | int ex_end = handler->limit(); |
duke@435 | 315 | |
duke@435 | 316 | int bci = ex_start; |
duke@435 | 317 | while (bci < ex_end) { |
duke@435 | 318 | ciBlock *b = block_containing(bci); |
duke@435 | 319 | b->set_has_handler(); |
duke@435 | 320 | bci = b->limit_bci(); |
duke@435 | 321 | } |
duke@435 | 322 | } |
duke@435 | 323 | } |
duke@435 | 324 | } |
duke@435 | 325 | |
duke@435 | 326 | void ciMethodBlocks::clear_processed() { |
duke@435 | 327 | for (int i = 0; i < _blocks->length(); i++) |
duke@435 | 328 | _blocks->at(i)->clear_processed(); |
duke@435 | 329 | } |
duke@435 | 330 | |
duke@435 | 331 | #ifndef PRODUCT |
duke@435 | 332 | void ciMethodBlocks::dump() { |
duke@435 | 333 | tty->print("---- blocks for method: "); |
duke@435 | 334 | _method->print(); |
duke@435 | 335 | tty->cr(); |
duke@435 | 336 | for (int i = 0; i < _blocks->length(); i++) { |
duke@435 | 337 | tty->print(" B%d: ", i); _blocks->at(i)->dump(); |
duke@435 | 338 | } |
duke@435 | 339 | } |
duke@435 | 340 | #endif |
duke@435 | 341 | |
duke@435 | 342 | |
never@802 | 343 | ciBlock::ciBlock(ciMethod *method, int index, int start_bci) : |
duke@435 | 344 | #ifndef PRODUCT |
duke@435 | 345 | _method(method), |
duke@435 | 346 | #endif |
duke@435 | 347 | _idx(index), _flags(0), _start_bci(start_bci), _limit_bci(-1), _control_bci(fall_through_bci), |
duke@435 | 348 | _ex_start_bci(-1), _ex_limit_bci(-1) { |
duke@435 | 349 | } |
duke@435 | 350 | |
duke@435 | 351 | void ciBlock::set_exception_range(int start_bci, int limit_bci) { |
duke@435 | 352 | assert(limit_bci >= start_bci, "valid range"); |
kvn@461 | 353 | assert(!is_handler() && _ex_start_bci == -1 && _ex_limit_bci == -1, "must not be handler"); |
duke@435 | 354 | _ex_start_bci = start_bci; |
duke@435 | 355 | _ex_limit_bci = limit_bci; |
kvn@461 | 356 | set_handler(); |
duke@435 | 357 | } |
duke@435 | 358 | |
duke@435 | 359 | #ifndef PRODUCT |
never@685 | 360 | static const char *flagnames[] = { |
duke@435 | 361 | "Processed", |
duke@435 | 362 | "Handler", |
duke@435 | 363 | "MayThrow", |
duke@435 | 364 | "Jsr", |
duke@435 | 365 | "Ret", |
duke@435 | 366 | "RetTarget", |
duke@435 | 367 | "HasHandler", |
duke@435 | 368 | }; |
duke@435 | 369 | |
duke@435 | 370 | void ciBlock::dump() { |
duke@435 | 371 | tty->print(" [%d .. %d), {", _start_bci, _limit_bci); |
duke@435 | 372 | for (int i = 0; i < 8; i++) { |
duke@435 | 373 | if ((_flags & (1 << i)) != 0) { |
duke@435 | 374 | tty->print(" %s", flagnames[i]); |
duke@435 | 375 | } |
duke@435 | 376 | } |
duke@435 | 377 | tty->print(" ]"); |
duke@435 | 378 | if (is_handler()) |
duke@435 | 379 | tty->print(" handles(%d..%d)", _ex_start_bci, _ex_limit_bci); |
duke@435 | 380 | tty->cr(); |
duke@435 | 381 | } |
duke@435 | 382 | |
duke@435 | 383 | // ------------------------------------------------------------------ |
duke@435 | 384 | // ciBlock::print_on |
duke@435 | 385 | void ciBlock::print_on(outputStream* st) const { |
duke@435 | 386 | st->print_cr("--------------------------------------------------------"); |
duke@435 | 387 | st->print ("ciBlock [%d - %d) control : ", start_bci(), limit_bci()); |
duke@435 | 388 | if (control_bci() == fall_through_bci) { |
duke@435 | 389 | st->print_cr("%d:fall through", limit_bci()); |
duke@435 | 390 | } else { |
duke@435 | 391 | st->print_cr("%d:%s", control_bci(), |
duke@435 | 392 | Bytecodes::name(method()->java_code_at_bci(control_bci()))); |
duke@435 | 393 | } |
duke@435 | 394 | |
duke@435 | 395 | if (Verbose || WizardMode) { |
duke@435 | 396 | method()->print_codes_on(start_bci(), limit_bci(), st); |
duke@435 | 397 | } |
duke@435 | 398 | } |
duke@435 | 399 | #endif |