Wed, 31 Aug 2011 01:40:45 -0700
7078382: JSR 292: don't count method handle adapters against inlining budgets
Reviewed-by: kvn, never
duke@435 | 1 | /* |
never@2486 | 2 | * Copyright (c) 1999, 2011, 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 "c1/c1_CFGPrinter.hpp" |
stefank@2314 | 27 | #include "c1/c1_Canonicalizer.hpp" |
stefank@2314 | 28 | #include "c1/c1_Compilation.hpp" |
stefank@2314 | 29 | #include "c1/c1_GraphBuilder.hpp" |
stefank@2314 | 30 | #include "c1/c1_InstructionPrinter.hpp" |
stefank@2314 | 31 | #include "ci/ciField.hpp" |
stefank@2314 | 32 | #include "ci/ciKlass.hpp" |
twisti@2687 | 33 | #include "compiler/compileBroker.hpp" |
stefank@2314 | 34 | #include "interpreter/bytecode.hpp" |
stefank@2314 | 35 | #include "runtime/sharedRuntime.hpp" |
iveresov@2988 | 36 | #include "runtime/compilationPolicy.hpp" |
stefank@2314 | 37 | #include "utilities/bitMap.inline.hpp" |
duke@435 | 38 | |
duke@435 | 39 | class BlockListBuilder VALUE_OBJ_CLASS_SPEC { |
duke@435 | 40 | private: |
duke@435 | 41 | Compilation* _compilation; |
duke@435 | 42 | IRScope* _scope; |
duke@435 | 43 | |
duke@435 | 44 | BlockList _blocks; // internal list of all blocks |
duke@435 | 45 | BlockList* _bci2block; // mapping from bci to blocks for GraphBuilder |
duke@435 | 46 | |
duke@435 | 47 | // fields used by mark_loops |
duke@435 | 48 | BitMap _active; // for iteration of control flow graph |
duke@435 | 49 | BitMap _visited; // for iteration of control flow graph |
duke@435 | 50 | intArray _loop_map; // caches the information if a block is contained in a loop |
duke@435 | 51 | int _next_loop_index; // next free loop number |
duke@435 | 52 | int _next_block_number; // for reverse postorder numbering of blocks |
duke@435 | 53 | |
duke@435 | 54 | // accessors |
duke@435 | 55 | Compilation* compilation() const { return _compilation; } |
duke@435 | 56 | IRScope* scope() const { return _scope; } |
duke@435 | 57 | ciMethod* method() const { return scope()->method(); } |
duke@435 | 58 | XHandlers* xhandlers() const { return scope()->xhandlers(); } |
duke@435 | 59 | |
duke@435 | 60 | // unified bailout support |
duke@435 | 61 | void bailout(const char* msg) const { compilation()->bailout(msg); } |
duke@435 | 62 | bool bailed_out() const { return compilation()->bailed_out(); } |
duke@435 | 63 | |
duke@435 | 64 | // helper functions |
duke@435 | 65 | BlockBegin* make_block_at(int bci, BlockBegin* predecessor); |
duke@435 | 66 | void handle_exceptions(BlockBegin* current, int cur_bci); |
duke@435 | 67 | void handle_jsr(BlockBegin* current, int sr_bci, int next_bci); |
duke@435 | 68 | void store_one(BlockBegin* current, int local); |
duke@435 | 69 | void store_two(BlockBegin* current, int local); |
duke@435 | 70 | void set_entries(int osr_bci); |
duke@435 | 71 | void set_leaders(); |
duke@435 | 72 | |
duke@435 | 73 | void make_loop_header(BlockBegin* block); |
duke@435 | 74 | void mark_loops(); |
duke@435 | 75 | int mark_loops(BlockBegin* b, bool in_subroutine); |
duke@435 | 76 | |
duke@435 | 77 | // debugging |
duke@435 | 78 | #ifndef PRODUCT |
duke@435 | 79 | void print(); |
duke@435 | 80 | #endif |
duke@435 | 81 | |
duke@435 | 82 | public: |
duke@435 | 83 | // creation |
duke@435 | 84 | BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci); |
duke@435 | 85 | |
duke@435 | 86 | // accessors for GraphBuilder |
duke@435 | 87 | BlockList* bci2block() const { return _bci2block; } |
duke@435 | 88 | }; |
duke@435 | 89 | |
duke@435 | 90 | |
duke@435 | 91 | // Implementation of BlockListBuilder |
duke@435 | 92 | |
duke@435 | 93 | BlockListBuilder::BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci) |
duke@435 | 94 | : _compilation(compilation) |
duke@435 | 95 | , _scope(scope) |
duke@435 | 96 | , _blocks(16) |
duke@435 | 97 | , _bci2block(new BlockList(scope->method()->code_size(), NULL)) |
duke@435 | 98 | , _next_block_number(0) |
duke@435 | 99 | , _active() // size not known yet |
duke@435 | 100 | , _visited() // size not known yet |
duke@435 | 101 | , _next_loop_index(0) |
duke@435 | 102 | , _loop_map() // size not known yet |
duke@435 | 103 | { |
duke@435 | 104 | set_entries(osr_bci); |
duke@435 | 105 | set_leaders(); |
duke@435 | 106 | CHECK_BAILOUT(); |
duke@435 | 107 | |
duke@435 | 108 | mark_loops(); |
duke@435 | 109 | NOT_PRODUCT(if (PrintInitialBlockList) print()); |
duke@435 | 110 | |
duke@435 | 111 | #ifndef PRODUCT |
duke@435 | 112 | if (PrintCFGToFile) { |
duke@435 | 113 | stringStream title; |
duke@435 | 114 | title.print("BlockListBuilder "); |
duke@435 | 115 | scope->method()->print_name(&title); |
duke@435 | 116 | CFGPrinter::print_cfg(_bci2block, title.as_string(), false, false); |
duke@435 | 117 | } |
duke@435 | 118 | #endif |
duke@435 | 119 | } |
duke@435 | 120 | |
duke@435 | 121 | |
duke@435 | 122 | void BlockListBuilder::set_entries(int osr_bci) { |
duke@435 | 123 | // generate start blocks |
duke@435 | 124 | BlockBegin* std_entry = make_block_at(0, NULL); |
duke@435 | 125 | if (scope()->caller() == NULL) { |
duke@435 | 126 | std_entry->set(BlockBegin::std_entry_flag); |
duke@435 | 127 | } |
duke@435 | 128 | if (osr_bci != -1) { |
duke@435 | 129 | BlockBegin* osr_entry = make_block_at(osr_bci, NULL); |
duke@435 | 130 | osr_entry->set(BlockBegin::osr_entry_flag); |
duke@435 | 131 | } |
duke@435 | 132 | |
duke@435 | 133 | // generate exception entry blocks |
duke@435 | 134 | XHandlers* list = xhandlers(); |
duke@435 | 135 | const int n = list->length(); |
duke@435 | 136 | for (int i = 0; i < n; i++) { |
duke@435 | 137 | XHandler* h = list->handler_at(i); |
duke@435 | 138 | BlockBegin* entry = make_block_at(h->handler_bci(), NULL); |
duke@435 | 139 | entry->set(BlockBegin::exception_entry_flag); |
duke@435 | 140 | h->set_entry_block(entry); |
duke@435 | 141 | } |
duke@435 | 142 | } |
duke@435 | 143 | |
duke@435 | 144 | |
duke@435 | 145 | BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) { |
duke@435 | 146 | assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer"); |
duke@435 | 147 | |
duke@435 | 148 | BlockBegin* block = _bci2block->at(cur_bci); |
duke@435 | 149 | if (block == NULL) { |
duke@435 | 150 | block = new BlockBegin(cur_bci); |
duke@435 | 151 | block->init_stores_to_locals(method()->max_locals()); |
duke@435 | 152 | _bci2block->at_put(cur_bci, block); |
duke@435 | 153 | _blocks.append(block); |
duke@435 | 154 | |
duke@435 | 155 | assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist"); |
duke@435 | 156 | } |
duke@435 | 157 | |
duke@435 | 158 | if (predecessor != NULL) { |
duke@435 | 159 | if (block->is_set(BlockBegin::exception_entry_flag)) { |
duke@435 | 160 | BAILOUT_("Exception handler can be reached by both normal and exceptional control flow", block); |
duke@435 | 161 | } |
duke@435 | 162 | |
duke@435 | 163 | predecessor->add_successor(block); |
duke@435 | 164 | block->increment_total_preds(); |
duke@435 | 165 | } |
duke@435 | 166 | |
duke@435 | 167 | return block; |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | |
duke@435 | 171 | inline void BlockListBuilder::store_one(BlockBegin* current, int local) { |
duke@435 | 172 | current->stores_to_locals().set_bit(local); |
duke@435 | 173 | } |
duke@435 | 174 | inline void BlockListBuilder::store_two(BlockBegin* current, int local) { |
duke@435 | 175 | store_one(current, local); |
duke@435 | 176 | store_one(current, local + 1); |
duke@435 | 177 | } |
duke@435 | 178 | |
duke@435 | 179 | |
duke@435 | 180 | void BlockListBuilder::handle_exceptions(BlockBegin* current, int cur_bci) { |
duke@435 | 181 | // Draws edges from a block to its exception handlers |
duke@435 | 182 | XHandlers* list = xhandlers(); |
duke@435 | 183 | const int n = list->length(); |
duke@435 | 184 | |
duke@435 | 185 | for (int i = 0; i < n; i++) { |
duke@435 | 186 | XHandler* h = list->handler_at(i); |
duke@435 | 187 | |
duke@435 | 188 | if (h->covers(cur_bci)) { |
duke@435 | 189 | BlockBegin* entry = h->entry_block(); |
duke@435 | 190 | assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set"); |
duke@435 | 191 | assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set"); |
duke@435 | 192 | |
duke@435 | 193 | // add each exception handler only once |
duke@435 | 194 | if (!current->is_successor(entry)) { |
duke@435 | 195 | current->add_successor(entry); |
duke@435 | 196 | entry->increment_total_preds(); |
duke@435 | 197 | } |
duke@435 | 198 | |
duke@435 | 199 | // stop when reaching catchall |
duke@435 | 200 | if (h->catch_type() == 0) break; |
duke@435 | 201 | } |
duke@435 | 202 | } |
duke@435 | 203 | } |
duke@435 | 204 | |
duke@435 | 205 | void BlockListBuilder::handle_jsr(BlockBegin* current, int sr_bci, int next_bci) { |
duke@435 | 206 | // start a new block after jsr-bytecode and link this block into cfg |
duke@435 | 207 | make_block_at(next_bci, current); |
duke@435 | 208 | |
duke@435 | 209 | // start a new block at the subroutine entry at mark it with special flag |
duke@435 | 210 | BlockBegin* sr_block = make_block_at(sr_bci, current); |
duke@435 | 211 | if (!sr_block->is_set(BlockBegin::subroutine_entry_flag)) { |
duke@435 | 212 | sr_block->set(BlockBegin::subroutine_entry_flag); |
duke@435 | 213 | } |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | |
duke@435 | 217 | void BlockListBuilder::set_leaders() { |
duke@435 | 218 | bool has_xhandlers = xhandlers()->has_handlers(); |
duke@435 | 219 | BlockBegin* current = NULL; |
duke@435 | 220 | |
duke@435 | 221 | // The information which bci starts a new block simplifies the analysis |
duke@435 | 222 | // Without it, backward branches could jump to a bci where no block was created |
duke@435 | 223 | // during bytecode iteration. This would require the creation of a new block at the |
duke@435 | 224 | // branch target and a modification of the successor lists. |
duke@435 | 225 | BitMap bci_block_start = method()->bci_block_start(); |
duke@435 | 226 | |
duke@435 | 227 | ciBytecodeStream s(method()); |
duke@435 | 228 | while (s.next() != ciBytecodeStream::EOBC()) { |
duke@435 | 229 | int cur_bci = s.cur_bci(); |
duke@435 | 230 | |
duke@435 | 231 | if (bci_block_start.at(cur_bci)) { |
duke@435 | 232 | current = make_block_at(cur_bci, current); |
duke@435 | 233 | } |
duke@435 | 234 | assert(current != NULL, "must have current block"); |
duke@435 | 235 | |
duke@435 | 236 | if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) { |
duke@435 | 237 | handle_exceptions(current, cur_bci); |
duke@435 | 238 | } |
duke@435 | 239 | |
duke@435 | 240 | switch (s.cur_bc()) { |
duke@435 | 241 | // track stores to local variables for selective creation of phi functions |
duke@435 | 242 | case Bytecodes::_iinc: store_one(current, s.get_index()); break; |
duke@435 | 243 | case Bytecodes::_istore: store_one(current, s.get_index()); break; |
duke@435 | 244 | case Bytecodes::_lstore: store_two(current, s.get_index()); break; |
duke@435 | 245 | case Bytecodes::_fstore: store_one(current, s.get_index()); break; |
duke@435 | 246 | case Bytecodes::_dstore: store_two(current, s.get_index()); break; |
duke@435 | 247 | case Bytecodes::_astore: store_one(current, s.get_index()); break; |
duke@435 | 248 | case Bytecodes::_istore_0: store_one(current, 0); break; |
duke@435 | 249 | case Bytecodes::_istore_1: store_one(current, 1); break; |
duke@435 | 250 | case Bytecodes::_istore_2: store_one(current, 2); break; |
duke@435 | 251 | case Bytecodes::_istore_3: store_one(current, 3); break; |
duke@435 | 252 | case Bytecodes::_lstore_0: store_two(current, 0); break; |
duke@435 | 253 | case Bytecodes::_lstore_1: store_two(current, 1); break; |
duke@435 | 254 | case Bytecodes::_lstore_2: store_two(current, 2); break; |
duke@435 | 255 | case Bytecodes::_lstore_3: store_two(current, 3); break; |
duke@435 | 256 | case Bytecodes::_fstore_0: store_one(current, 0); break; |
duke@435 | 257 | case Bytecodes::_fstore_1: store_one(current, 1); break; |
duke@435 | 258 | case Bytecodes::_fstore_2: store_one(current, 2); break; |
duke@435 | 259 | case Bytecodes::_fstore_3: store_one(current, 3); break; |
duke@435 | 260 | case Bytecodes::_dstore_0: store_two(current, 0); break; |
duke@435 | 261 | case Bytecodes::_dstore_1: store_two(current, 1); break; |
duke@435 | 262 | case Bytecodes::_dstore_2: store_two(current, 2); break; |
duke@435 | 263 | case Bytecodes::_dstore_3: store_two(current, 3); break; |
duke@435 | 264 | case Bytecodes::_astore_0: store_one(current, 0); break; |
duke@435 | 265 | case Bytecodes::_astore_1: store_one(current, 1); break; |
duke@435 | 266 | case Bytecodes::_astore_2: store_one(current, 2); break; |
duke@435 | 267 | case Bytecodes::_astore_3: store_one(current, 3); break; |
duke@435 | 268 | |
duke@435 | 269 | // track bytecodes that affect the control flow |
duke@435 | 270 | case Bytecodes::_athrow: // fall through |
duke@435 | 271 | case Bytecodes::_ret: // fall through |
duke@435 | 272 | case Bytecodes::_ireturn: // fall through |
duke@435 | 273 | case Bytecodes::_lreturn: // fall through |
duke@435 | 274 | case Bytecodes::_freturn: // fall through |
duke@435 | 275 | case Bytecodes::_dreturn: // fall through |
duke@435 | 276 | case Bytecodes::_areturn: // fall through |
duke@435 | 277 | case Bytecodes::_return: |
duke@435 | 278 | current = NULL; |
duke@435 | 279 | break; |
duke@435 | 280 | |
duke@435 | 281 | case Bytecodes::_ifeq: // fall through |
duke@435 | 282 | case Bytecodes::_ifne: // fall through |
duke@435 | 283 | case Bytecodes::_iflt: // fall through |
duke@435 | 284 | case Bytecodes::_ifge: // fall through |
duke@435 | 285 | case Bytecodes::_ifgt: // fall through |
duke@435 | 286 | case Bytecodes::_ifle: // fall through |
duke@435 | 287 | case Bytecodes::_if_icmpeq: // fall through |
duke@435 | 288 | case Bytecodes::_if_icmpne: // fall through |
duke@435 | 289 | case Bytecodes::_if_icmplt: // fall through |
duke@435 | 290 | case Bytecodes::_if_icmpge: // fall through |
duke@435 | 291 | case Bytecodes::_if_icmpgt: // fall through |
duke@435 | 292 | case Bytecodes::_if_icmple: // fall through |
duke@435 | 293 | case Bytecodes::_if_acmpeq: // fall through |
duke@435 | 294 | case Bytecodes::_if_acmpne: // fall through |
duke@435 | 295 | case Bytecodes::_ifnull: // fall through |
duke@435 | 296 | case Bytecodes::_ifnonnull: |
duke@435 | 297 | make_block_at(s.next_bci(), current); |
duke@435 | 298 | make_block_at(s.get_dest(), current); |
duke@435 | 299 | current = NULL; |
duke@435 | 300 | break; |
duke@435 | 301 | |
duke@435 | 302 | case Bytecodes::_goto: |
duke@435 | 303 | make_block_at(s.get_dest(), current); |
duke@435 | 304 | current = NULL; |
duke@435 | 305 | break; |
duke@435 | 306 | |
duke@435 | 307 | case Bytecodes::_goto_w: |
duke@435 | 308 | make_block_at(s.get_far_dest(), current); |
duke@435 | 309 | current = NULL; |
duke@435 | 310 | break; |
duke@435 | 311 | |
duke@435 | 312 | case Bytecodes::_jsr: |
duke@435 | 313 | handle_jsr(current, s.get_dest(), s.next_bci()); |
duke@435 | 314 | current = NULL; |
duke@435 | 315 | break; |
duke@435 | 316 | |
duke@435 | 317 | case Bytecodes::_jsr_w: |
duke@435 | 318 | handle_jsr(current, s.get_far_dest(), s.next_bci()); |
duke@435 | 319 | current = NULL; |
duke@435 | 320 | break; |
duke@435 | 321 | |
duke@435 | 322 | case Bytecodes::_tableswitch: { |
duke@435 | 323 | // set block for each case |
never@2462 | 324 | Bytecode_tableswitch sw(&s); |
never@2462 | 325 | int l = sw.length(); |
duke@435 | 326 | for (int i = 0; i < l; i++) { |
never@2462 | 327 | make_block_at(cur_bci + sw.dest_offset_at(i), current); |
duke@435 | 328 | } |
never@2462 | 329 | make_block_at(cur_bci + sw.default_offset(), current); |
duke@435 | 330 | current = NULL; |
duke@435 | 331 | break; |
duke@435 | 332 | } |
duke@435 | 333 | |
duke@435 | 334 | case Bytecodes::_lookupswitch: { |
duke@435 | 335 | // set block for each case |
never@2462 | 336 | Bytecode_lookupswitch sw(&s); |
never@2462 | 337 | int l = sw.number_of_pairs(); |
duke@435 | 338 | for (int i = 0; i < l; i++) { |
never@2462 | 339 | make_block_at(cur_bci + sw.pair_at(i).offset(), current); |
duke@435 | 340 | } |
never@2462 | 341 | make_block_at(cur_bci + sw.default_offset(), current); |
duke@435 | 342 | current = NULL; |
duke@435 | 343 | break; |
duke@435 | 344 | } |
duke@435 | 345 | } |
duke@435 | 346 | } |
duke@435 | 347 | } |
duke@435 | 348 | |
duke@435 | 349 | |
duke@435 | 350 | void BlockListBuilder::mark_loops() { |
duke@435 | 351 | ResourceMark rm; |
duke@435 | 352 | |
duke@435 | 353 | _active = BitMap(BlockBegin::number_of_blocks()); _active.clear(); |
duke@435 | 354 | _visited = BitMap(BlockBegin::number_of_blocks()); _visited.clear(); |
duke@435 | 355 | _loop_map = intArray(BlockBegin::number_of_blocks(), 0); |
duke@435 | 356 | _next_loop_index = 0; |
duke@435 | 357 | _next_block_number = _blocks.length(); |
duke@435 | 358 | |
duke@435 | 359 | // recursively iterate the control flow graph |
duke@435 | 360 | mark_loops(_bci2block->at(0), false); |
duke@435 | 361 | assert(_next_block_number >= 0, "invalid block numbers"); |
duke@435 | 362 | } |
duke@435 | 363 | |
duke@435 | 364 | void BlockListBuilder::make_loop_header(BlockBegin* block) { |
duke@435 | 365 | if (block->is_set(BlockBegin::exception_entry_flag)) { |
duke@435 | 366 | // exception edges may look like loops but don't mark them as such |
duke@435 | 367 | // since it screws up block ordering. |
duke@435 | 368 | return; |
duke@435 | 369 | } |
duke@435 | 370 | if (!block->is_set(BlockBegin::parser_loop_header_flag)) { |
duke@435 | 371 | block->set(BlockBegin::parser_loop_header_flag); |
duke@435 | 372 | |
duke@435 | 373 | assert(_loop_map.at(block->block_id()) == 0, "must not be set yet"); |
duke@435 | 374 | assert(0 <= _next_loop_index && _next_loop_index < BitsPerInt, "_next_loop_index is used as a bit-index in integer"); |
duke@435 | 375 | _loop_map.at_put(block->block_id(), 1 << _next_loop_index); |
duke@435 | 376 | if (_next_loop_index < 31) _next_loop_index++; |
duke@435 | 377 | } else { |
duke@435 | 378 | // block already marked as loop header |
roland@1495 | 379 | assert(is_power_of_2((unsigned int)_loop_map.at(block->block_id())), "exactly one bit must be set"); |
duke@435 | 380 | } |
duke@435 | 381 | } |
duke@435 | 382 | |
duke@435 | 383 | int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) { |
duke@435 | 384 | int block_id = block->block_id(); |
duke@435 | 385 | |
duke@435 | 386 | if (_visited.at(block_id)) { |
duke@435 | 387 | if (_active.at(block_id)) { |
duke@435 | 388 | // reached block via backward branch |
duke@435 | 389 | make_loop_header(block); |
duke@435 | 390 | } |
duke@435 | 391 | // return cached loop information for this block |
duke@435 | 392 | return _loop_map.at(block_id); |
duke@435 | 393 | } |
duke@435 | 394 | |
duke@435 | 395 | if (block->is_set(BlockBegin::subroutine_entry_flag)) { |
duke@435 | 396 | in_subroutine = true; |
duke@435 | 397 | } |
duke@435 | 398 | |
duke@435 | 399 | // set active and visited bits before successors are processed |
duke@435 | 400 | _visited.set_bit(block_id); |
duke@435 | 401 | _active.set_bit(block_id); |
duke@435 | 402 | |
duke@435 | 403 | intptr_t loop_state = 0; |
duke@435 | 404 | for (int i = block->number_of_sux() - 1; i >= 0; i--) { |
duke@435 | 405 | // recursively process all successors |
duke@435 | 406 | loop_state |= mark_loops(block->sux_at(i), in_subroutine); |
duke@435 | 407 | } |
duke@435 | 408 | |
duke@435 | 409 | // clear active-bit after all successors are processed |
duke@435 | 410 | _active.clear_bit(block_id); |
duke@435 | 411 | |
duke@435 | 412 | // reverse-post-order numbering of all blocks |
duke@435 | 413 | block->set_depth_first_number(_next_block_number); |
duke@435 | 414 | _next_block_number--; |
duke@435 | 415 | |
duke@435 | 416 | if (loop_state != 0 || in_subroutine ) { |
duke@435 | 417 | // block is contained at least in one loop, so phi functions are necessary |
duke@435 | 418 | // phi functions are also necessary for all locals stored in a subroutine |
duke@435 | 419 | scope()->requires_phi_function().set_union(block->stores_to_locals()); |
duke@435 | 420 | } |
duke@435 | 421 | |
duke@435 | 422 | if (block->is_set(BlockBegin::parser_loop_header_flag)) { |
duke@435 | 423 | int header_loop_state = _loop_map.at(block_id); |
duke@435 | 424 | assert(is_power_of_2((unsigned)header_loop_state), "exactly one bit must be set"); |
duke@435 | 425 | |
duke@435 | 426 | // If the highest bit is set (i.e. when integer value is negative), the method |
duke@435 | 427 | // has 32 or more loops. This bit is never cleared because it is used for multiple loops |
duke@435 | 428 | if (header_loop_state >= 0) { |
duke@435 | 429 | clear_bits(loop_state, header_loop_state); |
duke@435 | 430 | } |
duke@435 | 431 | } |
duke@435 | 432 | |
duke@435 | 433 | // cache and return loop information for this block |
duke@435 | 434 | _loop_map.at_put(block_id, loop_state); |
duke@435 | 435 | return loop_state; |
duke@435 | 436 | } |
duke@435 | 437 | |
duke@435 | 438 | |
duke@435 | 439 | #ifndef PRODUCT |
duke@435 | 440 | |
duke@435 | 441 | int compare_depth_first(BlockBegin** a, BlockBegin** b) { |
duke@435 | 442 | return (*a)->depth_first_number() - (*b)->depth_first_number(); |
duke@435 | 443 | } |
duke@435 | 444 | |
duke@435 | 445 | void BlockListBuilder::print() { |
duke@435 | 446 | tty->print("----- initial block list of BlockListBuilder for method "); |
duke@435 | 447 | method()->print_short_name(); |
duke@435 | 448 | tty->cr(); |
duke@435 | 449 | |
duke@435 | 450 | // better readability if blocks are sorted in processing order |
duke@435 | 451 | _blocks.sort(compare_depth_first); |
duke@435 | 452 | |
duke@435 | 453 | for (int i = 0; i < _blocks.length(); i++) { |
duke@435 | 454 | BlockBegin* cur = _blocks.at(i); |
duke@435 | 455 | tty->print("%4d: B%-4d bci: %-4d preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds()); |
duke@435 | 456 | |
duke@435 | 457 | tty->print(cur->is_set(BlockBegin::std_entry_flag) ? " std" : " "); |
duke@435 | 458 | tty->print(cur->is_set(BlockBegin::osr_entry_flag) ? " osr" : " "); |
duke@435 | 459 | tty->print(cur->is_set(BlockBegin::exception_entry_flag) ? " ex" : " "); |
duke@435 | 460 | tty->print(cur->is_set(BlockBegin::subroutine_entry_flag) ? " sr" : " "); |
duke@435 | 461 | tty->print(cur->is_set(BlockBegin::parser_loop_header_flag) ? " lh" : " "); |
duke@435 | 462 | |
duke@435 | 463 | if (cur->number_of_sux() > 0) { |
duke@435 | 464 | tty->print(" sux: "); |
duke@435 | 465 | for (int j = 0; j < cur->number_of_sux(); j++) { |
duke@435 | 466 | BlockBegin* sux = cur->sux_at(j); |
duke@435 | 467 | tty->print("B%d ", sux->block_id()); |
duke@435 | 468 | } |
duke@435 | 469 | } |
duke@435 | 470 | tty->cr(); |
duke@435 | 471 | } |
duke@435 | 472 | } |
duke@435 | 473 | |
duke@435 | 474 | #endif |
duke@435 | 475 | |
duke@435 | 476 | |
duke@435 | 477 | // A simple growable array of Values indexed by ciFields |
duke@435 | 478 | class FieldBuffer: public CompilationResourceObj { |
duke@435 | 479 | private: |
duke@435 | 480 | GrowableArray<Value> _values; |
duke@435 | 481 | |
duke@435 | 482 | public: |
duke@435 | 483 | FieldBuffer() {} |
duke@435 | 484 | |
duke@435 | 485 | void kill() { |
duke@435 | 486 | _values.trunc_to(0); |
duke@435 | 487 | } |
duke@435 | 488 | |
duke@435 | 489 | Value at(ciField* field) { |
duke@435 | 490 | assert(field->holder()->is_loaded(), "must be a loaded field"); |
duke@435 | 491 | int offset = field->offset(); |
duke@435 | 492 | if (offset < _values.length()) { |
duke@435 | 493 | return _values.at(offset); |
duke@435 | 494 | } else { |
duke@435 | 495 | return NULL; |
duke@435 | 496 | } |
duke@435 | 497 | } |
duke@435 | 498 | |
duke@435 | 499 | void at_put(ciField* field, Value value) { |
duke@435 | 500 | assert(field->holder()->is_loaded(), "must be a loaded field"); |
duke@435 | 501 | int offset = field->offset(); |
duke@435 | 502 | _values.at_put_grow(offset, value, NULL); |
duke@435 | 503 | } |
duke@435 | 504 | |
duke@435 | 505 | }; |
duke@435 | 506 | |
duke@435 | 507 | |
duke@435 | 508 | // MemoryBuffer is fairly simple model of the current state of memory. |
duke@435 | 509 | // It partitions memory into several pieces. The first piece is |
duke@435 | 510 | // generic memory where little is known about the owner of the memory. |
duke@435 | 511 | // This is conceptually represented by the tuple <O, F, V> which says |
duke@435 | 512 | // that the field F of object O has value V. This is flattened so |
duke@435 | 513 | // that F is represented by the offset of the field and the parallel |
duke@435 | 514 | // arrays _objects and _values are used for O and V. Loads of O.F can |
duke@435 | 515 | // simply use V. Newly allocated objects are kept in a separate list |
duke@435 | 516 | // along with a parallel array for each object which represents the |
duke@435 | 517 | // current value of its fields. Stores of the default value to fields |
duke@435 | 518 | // which have never been stored to before are eliminated since they |
duke@435 | 519 | // are redundant. Once newly allocated objects are stored into |
duke@435 | 520 | // another object or they are passed out of the current compile they |
duke@435 | 521 | // are treated like generic memory. |
duke@435 | 522 | |
duke@435 | 523 | class MemoryBuffer: public CompilationResourceObj { |
duke@435 | 524 | private: |
duke@435 | 525 | FieldBuffer _values; |
duke@435 | 526 | GrowableArray<Value> _objects; |
duke@435 | 527 | GrowableArray<Value> _newobjects; |
duke@435 | 528 | GrowableArray<FieldBuffer*> _fields; |
duke@435 | 529 | |
duke@435 | 530 | public: |
duke@435 | 531 | MemoryBuffer() {} |
duke@435 | 532 | |
duke@435 | 533 | StoreField* store(StoreField* st) { |
duke@435 | 534 | if (!EliminateFieldAccess) { |
duke@435 | 535 | return st; |
duke@435 | 536 | } |
duke@435 | 537 | |
duke@435 | 538 | Value object = st->obj(); |
duke@435 | 539 | Value value = st->value(); |
duke@435 | 540 | ciField* field = st->field(); |
duke@435 | 541 | if (field->holder()->is_loaded()) { |
duke@435 | 542 | int offset = field->offset(); |
duke@435 | 543 | int index = _newobjects.find(object); |
duke@435 | 544 | if (index != -1) { |
duke@435 | 545 | // newly allocated object with no other stores performed on this field |
duke@435 | 546 | FieldBuffer* buf = _fields.at(index); |
duke@435 | 547 | if (buf->at(field) == NULL && is_default_value(value)) { |
duke@435 | 548 | #ifndef PRODUCT |
duke@435 | 549 | if (PrintIRDuringConstruction && Verbose) { |
duke@435 | 550 | tty->print_cr("Eliminated store for object %d:", index); |
duke@435 | 551 | st->print_line(); |
duke@435 | 552 | } |
duke@435 | 553 | #endif |
duke@435 | 554 | return NULL; |
duke@435 | 555 | } else { |
duke@435 | 556 | buf->at_put(field, value); |
duke@435 | 557 | } |
duke@435 | 558 | } else { |
duke@435 | 559 | _objects.at_put_grow(offset, object, NULL); |
duke@435 | 560 | _values.at_put(field, value); |
duke@435 | 561 | } |
duke@435 | 562 | |
duke@435 | 563 | store_value(value); |
duke@435 | 564 | } else { |
duke@435 | 565 | // if we held onto field names we could alias based on names but |
duke@435 | 566 | // we don't know what's being stored to so kill it all. |
duke@435 | 567 | kill(); |
duke@435 | 568 | } |
duke@435 | 569 | return st; |
duke@435 | 570 | } |
duke@435 | 571 | |
duke@435 | 572 | |
duke@435 | 573 | // return true if this value correspond to the default value of a field. |
duke@435 | 574 | bool is_default_value(Value value) { |
duke@435 | 575 | Constant* con = value->as_Constant(); |
duke@435 | 576 | if (con) { |
duke@435 | 577 | switch (con->type()->tag()) { |
duke@435 | 578 | case intTag: return con->type()->as_IntConstant()->value() == 0; |
duke@435 | 579 | case longTag: return con->type()->as_LongConstant()->value() == 0; |
duke@435 | 580 | case floatTag: return jint_cast(con->type()->as_FloatConstant()->value()) == 0; |
duke@435 | 581 | case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0); |
duke@435 | 582 | case objectTag: return con->type() == objectNull; |
duke@435 | 583 | default: ShouldNotReachHere(); |
duke@435 | 584 | } |
duke@435 | 585 | } |
duke@435 | 586 | return false; |
duke@435 | 587 | } |
duke@435 | 588 | |
duke@435 | 589 | |
duke@435 | 590 | // return either the actual value of a load or the load itself |
duke@435 | 591 | Value load(LoadField* load) { |
duke@435 | 592 | if (!EliminateFieldAccess) { |
duke@435 | 593 | return load; |
duke@435 | 594 | } |
duke@435 | 595 | |
duke@435 | 596 | if (RoundFPResults && UseSSE < 2 && load->type()->is_float_kind()) { |
duke@435 | 597 | // can't skip load since value might get rounded as a side effect |
duke@435 | 598 | return load; |
duke@435 | 599 | } |
duke@435 | 600 | |
duke@435 | 601 | ciField* field = load->field(); |
duke@435 | 602 | Value object = load->obj(); |
duke@435 | 603 | if (field->holder()->is_loaded() && !field->is_volatile()) { |
duke@435 | 604 | int offset = field->offset(); |
duke@435 | 605 | Value result = NULL; |
duke@435 | 606 | int index = _newobjects.find(object); |
duke@435 | 607 | if (index != -1) { |
duke@435 | 608 | result = _fields.at(index)->at(field); |
duke@435 | 609 | } else if (_objects.at_grow(offset, NULL) == object) { |
duke@435 | 610 | result = _values.at(field); |
duke@435 | 611 | } |
duke@435 | 612 | if (result != NULL) { |
duke@435 | 613 | #ifndef PRODUCT |
duke@435 | 614 | if (PrintIRDuringConstruction && Verbose) { |
duke@435 | 615 | tty->print_cr("Eliminated load: "); |
duke@435 | 616 | load->print_line(); |
duke@435 | 617 | } |
duke@435 | 618 | #endif |
duke@435 | 619 | assert(result->type()->tag() == load->type()->tag(), "wrong types"); |
duke@435 | 620 | return result; |
duke@435 | 621 | } |
duke@435 | 622 | } |
duke@435 | 623 | return load; |
duke@435 | 624 | } |
duke@435 | 625 | |
duke@435 | 626 | // Record this newly allocated object |
duke@435 | 627 | void new_instance(NewInstance* object) { |
duke@435 | 628 | int index = _newobjects.length(); |
duke@435 | 629 | _newobjects.append(object); |
duke@435 | 630 | if (_fields.at_grow(index, NULL) == NULL) { |
duke@435 | 631 | _fields.at_put(index, new FieldBuffer()); |
duke@435 | 632 | } else { |
duke@435 | 633 | _fields.at(index)->kill(); |
duke@435 | 634 | } |
duke@435 | 635 | } |
duke@435 | 636 | |
duke@435 | 637 | void store_value(Value value) { |
duke@435 | 638 | int index = _newobjects.find(value); |
duke@435 | 639 | if (index != -1) { |
duke@435 | 640 | // stored a newly allocated object into another object. |
duke@435 | 641 | // Assume we've lost track of it as separate slice of memory. |
duke@435 | 642 | // We could do better by keeping track of whether individual |
duke@435 | 643 | // fields could alias each other. |
duke@435 | 644 | _newobjects.remove_at(index); |
duke@435 | 645 | // pull out the field info and store it at the end up the list |
duke@435 | 646 | // of field info list to be reused later. |
duke@435 | 647 | _fields.append(_fields.at(index)); |
duke@435 | 648 | _fields.remove_at(index); |
duke@435 | 649 | } |
duke@435 | 650 | } |
duke@435 | 651 | |
duke@435 | 652 | void kill() { |
duke@435 | 653 | _newobjects.trunc_to(0); |
duke@435 | 654 | _objects.trunc_to(0); |
duke@435 | 655 | _values.kill(); |
duke@435 | 656 | } |
duke@435 | 657 | }; |
duke@435 | 658 | |
duke@435 | 659 | |
duke@435 | 660 | // Implementation of GraphBuilder's ScopeData |
duke@435 | 661 | |
duke@435 | 662 | GraphBuilder::ScopeData::ScopeData(ScopeData* parent) |
duke@435 | 663 | : _parent(parent) |
duke@435 | 664 | , _bci2block(NULL) |
duke@435 | 665 | , _scope(NULL) |
duke@435 | 666 | , _has_handler(false) |
duke@435 | 667 | , _stream(NULL) |
duke@435 | 668 | , _work_list(NULL) |
duke@435 | 669 | , _parsing_jsr(false) |
duke@435 | 670 | , _jsr_xhandlers(NULL) |
duke@435 | 671 | , _caller_stack_size(-1) |
duke@435 | 672 | , _continuation(NULL) |
duke@435 | 673 | , _num_returns(0) |
duke@435 | 674 | , _cleanup_block(NULL) |
duke@435 | 675 | , _cleanup_return_prev(NULL) |
duke@435 | 676 | , _cleanup_state(NULL) |
duke@435 | 677 | { |
duke@435 | 678 | if (parent != NULL) { |
duke@435 | 679 | _max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f); |
duke@435 | 680 | } else { |
duke@435 | 681 | _max_inline_size = MaxInlineSize; |
duke@435 | 682 | } |
duke@435 | 683 | if (_max_inline_size < MaxTrivialSize) { |
duke@435 | 684 | _max_inline_size = MaxTrivialSize; |
duke@435 | 685 | } |
duke@435 | 686 | } |
duke@435 | 687 | |
duke@435 | 688 | |
duke@435 | 689 | void GraphBuilder::kill_all() { |
duke@435 | 690 | if (UseLocalValueNumbering) { |
duke@435 | 691 | vmap()->kill_all(); |
duke@435 | 692 | } |
duke@435 | 693 | _memory->kill(); |
duke@435 | 694 | } |
duke@435 | 695 | |
duke@435 | 696 | |
duke@435 | 697 | BlockBegin* GraphBuilder::ScopeData::block_at(int bci) { |
duke@435 | 698 | if (parsing_jsr()) { |
duke@435 | 699 | // It is necessary to clone all blocks associated with a |
duke@435 | 700 | // subroutine, including those for exception handlers in the scope |
duke@435 | 701 | // of the method containing the jsr (because those exception |
duke@435 | 702 | // handlers may contain ret instructions in some cases). |
duke@435 | 703 | BlockBegin* block = bci2block()->at(bci); |
duke@435 | 704 | if (block != NULL && block == parent()->bci2block()->at(bci)) { |
duke@435 | 705 | BlockBegin* new_block = new BlockBegin(block->bci()); |
duke@435 | 706 | #ifndef PRODUCT |
duke@435 | 707 | if (PrintInitialBlockList) { |
duke@435 | 708 | tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr", |
duke@435 | 709 | block->block_id(), block->bci(), new_block->block_id()); |
duke@435 | 710 | } |
duke@435 | 711 | #endif |
duke@435 | 712 | // copy data from cloned blocked |
duke@435 | 713 | new_block->set_depth_first_number(block->depth_first_number()); |
duke@435 | 714 | if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag); |
duke@435 | 715 | // Preserve certain flags for assertion checking |
duke@435 | 716 | if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag); |
duke@435 | 717 | if (block->is_set(BlockBegin::exception_entry_flag)) new_block->set(BlockBegin::exception_entry_flag); |
duke@435 | 718 | |
duke@435 | 719 | // copy was_visited_flag to allow early detection of bailouts |
duke@435 | 720 | // if a block that is used in a jsr has already been visited before, |
duke@435 | 721 | // it is shared between the normal control flow and a subroutine |
duke@435 | 722 | // BlockBegin::try_merge returns false when the flag is set, this leads |
duke@435 | 723 | // to a compilation bailout |
duke@435 | 724 | if (block->is_set(BlockBegin::was_visited_flag)) new_block->set(BlockBegin::was_visited_flag); |
duke@435 | 725 | |
duke@435 | 726 | bci2block()->at_put(bci, new_block); |
duke@435 | 727 | block = new_block; |
duke@435 | 728 | } |
duke@435 | 729 | return block; |
duke@435 | 730 | } else { |
duke@435 | 731 | return bci2block()->at(bci); |
duke@435 | 732 | } |
duke@435 | 733 | } |
duke@435 | 734 | |
duke@435 | 735 | |
duke@435 | 736 | XHandlers* GraphBuilder::ScopeData::xhandlers() const { |
duke@435 | 737 | if (_jsr_xhandlers == NULL) { |
duke@435 | 738 | assert(!parsing_jsr(), ""); |
duke@435 | 739 | return scope()->xhandlers(); |
duke@435 | 740 | } |
duke@435 | 741 | assert(parsing_jsr(), ""); |
duke@435 | 742 | return _jsr_xhandlers; |
duke@435 | 743 | } |
duke@435 | 744 | |
duke@435 | 745 | |
duke@435 | 746 | void GraphBuilder::ScopeData::set_scope(IRScope* scope) { |
duke@435 | 747 | _scope = scope; |
duke@435 | 748 | bool parent_has_handler = false; |
duke@435 | 749 | if (parent() != NULL) { |
duke@435 | 750 | parent_has_handler = parent()->has_handler(); |
duke@435 | 751 | } |
duke@435 | 752 | _has_handler = parent_has_handler || scope->xhandlers()->has_handlers(); |
duke@435 | 753 | } |
duke@435 | 754 | |
duke@435 | 755 | |
duke@435 | 756 | void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block, |
duke@435 | 757 | Instruction* return_prev, |
duke@435 | 758 | ValueStack* return_state) { |
duke@435 | 759 | _cleanup_block = block; |
duke@435 | 760 | _cleanup_return_prev = return_prev; |
duke@435 | 761 | _cleanup_state = return_state; |
duke@435 | 762 | } |
duke@435 | 763 | |
duke@435 | 764 | |
duke@435 | 765 | void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) { |
duke@435 | 766 | if (_work_list == NULL) { |
duke@435 | 767 | _work_list = new BlockList(); |
duke@435 | 768 | } |
duke@435 | 769 | |
duke@435 | 770 | if (!block->is_set(BlockBegin::is_on_work_list_flag)) { |
duke@435 | 771 | // Do not start parsing the continuation block while in a |
duke@435 | 772 | // sub-scope |
duke@435 | 773 | if (parsing_jsr()) { |
duke@435 | 774 | if (block == jsr_continuation()) { |
duke@435 | 775 | return; |
duke@435 | 776 | } |
duke@435 | 777 | } else { |
duke@435 | 778 | if (block == continuation()) { |
duke@435 | 779 | return; |
duke@435 | 780 | } |
duke@435 | 781 | } |
duke@435 | 782 | block->set(BlockBegin::is_on_work_list_flag); |
duke@435 | 783 | _work_list->push(block); |
duke@435 | 784 | |
duke@435 | 785 | sort_top_into_worklist(_work_list, block); |
duke@435 | 786 | } |
duke@435 | 787 | } |
duke@435 | 788 | |
duke@435 | 789 | |
duke@435 | 790 | void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) { |
duke@435 | 791 | assert(worklist->top() == top, ""); |
duke@435 | 792 | // sort block descending into work list |
duke@435 | 793 | const int dfn = top->depth_first_number(); |
duke@435 | 794 | assert(dfn != -1, "unknown depth first number"); |
duke@435 | 795 | int i = worklist->length()-2; |
duke@435 | 796 | while (i >= 0) { |
duke@435 | 797 | BlockBegin* b = worklist->at(i); |
duke@435 | 798 | if (b->depth_first_number() < dfn) { |
duke@435 | 799 | worklist->at_put(i+1, b); |
duke@435 | 800 | } else { |
duke@435 | 801 | break; |
duke@435 | 802 | } |
duke@435 | 803 | i --; |
duke@435 | 804 | } |
duke@435 | 805 | if (i >= -1) worklist->at_put(i + 1, top); |
duke@435 | 806 | } |
duke@435 | 807 | |
duke@435 | 808 | |
duke@435 | 809 | BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() { |
duke@435 | 810 | if (is_work_list_empty()) { |
duke@435 | 811 | return NULL; |
duke@435 | 812 | } |
duke@435 | 813 | return _work_list->pop(); |
duke@435 | 814 | } |
duke@435 | 815 | |
duke@435 | 816 | |
duke@435 | 817 | bool GraphBuilder::ScopeData::is_work_list_empty() const { |
duke@435 | 818 | return (_work_list == NULL || _work_list->length() == 0); |
duke@435 | 819 | } |
duke@435 | 820 | |
duke@435 | 821 | |
duke@435 | 822 | void GraphBuilder::ScopeData::setup_jsr_xhandlers() { |
duke@435 | 823 | assert(parsing_jsr(), ""); |
duke@435 | 824 | // clone all the exception handlers from the scope |
duke@435 | 825 | XHandlers* handlers = new XHandlers(scope()->xhandlers()); |
duke@435 | 826 | const int n = handlers->length(); |
duke@435 | 827 | for (int i = 0; i < n; i++) { |
duke@435 | 828 | // The XHandlers need to be adjusted to dispatch to the cloned |
duke@435 | 829 | // handler block instead of the default one but the synthetic |
duke@435 | 830 | // unlocker needs to be handled specially. The synthetic unlocker |
duke@435 | 831 | // should be left alone since there can be only one and all code |
duke@435 | 832 | // should dispatch to the same one. |
duke@435 | 833 | XHandler* h = handlers->handler_at(i); |
never@1813 | 834 | assert(h->handler_bci() != SynchronizationEntryBCI, "must be real"); |
never@1813 | 835 | h->set_entry_block(block_at(h->handler_bci())); |
duke@435 | 836 | } |
duke@435 | 837 | _jsr_xhandlers = handlers; |
duke@435 | 838 | } |
duke@435 | 839 | |
duke@435 | 840 | |
duke@435 | 841 | int GraphBuilder::ScopeData::num_returns() { |
duke@435 | 842 | if (parsing_jsr()) { |
duke@435 | 843 | return parent()->num_returns(); |
duke@435 | 844 | } |
duke@435 | 845 | return _num_returns; |
duke@435 | 846 | } |
duke@435 | 847 | |
duke@435 | 848 | |
duke@435 | 849 | void GraphBuilder::ScopeData::incr_num_returns() { |
duke@435 | 850 | if (parsing_jsr()) { |
duke@435 | 851 | parent()->incr_num_returns(); |
duke@435 | 852 | } else { |
duke@435 | 853 | ++_num_returns; |
duke@435 | 854 | } |
duke@435 | 855 | } |
duke@435 | 856 | |
duke@435 | 857 | |
duke@435 | 858 | // Implementation of GraphBuilder |
duke@435 | 859 | |
duke@435 | 860 | #define INLINE_BAILOUT(msg) { inline_bailout(msg); return false; } |
duke@435 | 861 | |
duke@435 | 862 | |
duke@435 | 863 | void GraphBuilder::load_constant() { |
duke@435 | 864 | ciConstant con = stream()->get_constant(); |
duke@435 | 865 | if (con.basic_type() == T_ILLEGAL) { |
duke@435 | 866 | BAILOUT("could not resolve a constant"); |
duke@435 | 867 | } else { |
duke@435 | 868 | ValueType* t = illegalType; |
duke@435 | 869 | ValueStack* patch_state = NULL; |
duke@435 | 870 | switch (con.basic_type()) { |
duke@435 | 871 | case T_BOOLEAN: t = new IntConstant (con.as_boolean()); break; |
duke@435 | 872 | case T_BYTE : t = new IntConstant (con.as_byte ()); break; |
duke@435 | 873 | case T_CHAR : t = new IntConstant (con.as_char ()); break; |
duke@435 | 874 | case T_SHORT : t = new IntConstant (con.as_short ()); break; |
duke@435 | 875 | case T_INT : t = new IntConstant (con.as_int ()); break; |
duke@435 | 876 | case T_LONG : t = new LongConstant (con.as_long ()); break; |
duke@435 | 877 | case T_FLOAT : t = new FloatConstant (con.as_float ()); break; |
duke@435 | 878 | case T_DOUBLE : t = new DoubleConstant (con.as_double ()); break; |
duke@435 | 879 | case T_ARRAY : t = new ArrayConstant (con.as_object ()->as_array ()); break; |
duke@435 | 880 | case T_OBJECT : |
duke@435 | 881 | { |
duke@435 | 882 | ciObject* obj = con.as_object(); |
jrose@1957 | 883 | if (!obj->is_loaded() |
jrose@1957 | 884 | || (PatchALot && obj->klass() != ciEnv::current()->String_klass())) { |
roland@2174 | 885 | patch_state = copy_state_before(); |
jrose@1957 | 886 | t = new ObjectConstant(obj); |
duke@435 | 887 | } else { |
jrose@1957 | 888 | assert(!obj->is_klass(), "must be java_mirror of klass"); |
duke@435 | 889 | t = new InstanceConstant(obj->as_instance()); |
duke@435 | 890 | } |
duke@435 | 891 | break; |
duke@435 | 892 | } |
duke@435 | 893 | default : ShouldNotReachHere(); |
duke@435 | 894 | } |
duke@435 | 895 | Value x; |
duke@435 | 896 | if (patch_state != NULL) { |
duke@435 | 897 | x = new Constant(t, patch_state); |
duke@435 | 898 | } else { |
duke@435 | 899 | x = new Constant(t); |
duke@435 | 900 | } |
duke@435 | 901 | push(t, append(x)); |
duke@435 | 902 | } |
duke@435 | 903 | } |
duke@435 | 904 | |
duke@435 | 905 | |
duke@435 | 906 | void GraphBuilder::load_local(ValueType* type, int index) { |
roland@2174 | 907 | Value x = state()->local_at(index); |
roland@2174 | 908 | assert(x != NULL && !x->type()->is_illegal(), "access of illegal local variable"); |
duke@435 | 909 | push(type, x); |
duke@435 | 910 | } |
duke@435 | 911 | |
duke@435 | 912 | |
duke@435 | 913 | void GraphBuilder::store_local(ValueType* type, int index) { |
duke@435 | 914 | Value x = pop(type); |
duke@435 | 915 | store_local(state(), x, type, index); |
duke@435 | 916 | } |
duke@435 | 917 | |
duke@435 | 918 | |
duke@435 | 919 | void GraphBuilder::store_local(ValueStack* state, Value x, ValueType* type, int index) { |
duke@435 | 920 | if (parsing_jsr()) { |
duke@435 | 921 | // We need to do additional tracking of the location of the return |
duke@435 | 922 | // address for jsrs since we don't handle arbitrary jsr/ret |
duke@435 | 923 | // constructs. Here we are figuring out in which circumstances we |
duke@435 | 924 | // need to bail out. |
duke@435 | 925 | if (x->type()->is_address()) { |
duke@435 | 926 | scope_data()->set_jsr_return_address_local(index); |
duke@435 | 927 | |
duke@435 | 928 | // Also check parent jsrs (if any) at this time to see whether |
duke@435 | 929 | // they are using this local. We don't handle skipping over a |
duke@435 | 930 | // ret. |
duke@435 | 931 | for (ScopeData* cur_scope_data = scope_data()->parent(); |
duke@435 | 932 | cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope(); |
duke@435 | 933 | cur_scope_data = cur_scope_data->parent()) { |
duke@435 | 934 | if (cur_scope_data->jsr_return_address_local() == index) { |
duke@435 | 935 | BAILOUT("subroutine overwrites return address from previous subroutine"); |
duke@435 | 936 | } |
duke@435 | 937 | } |
duke@435 | 938 | } else if (index == scope_data()->jsr_return_address_local()) { |
duke@435 | 939 | scope_data()->set_jsr_return_address_local(-1); |
duke@435 | 940 | } |
duke@435 | 941 | } |
duke@435 | 942 | |
duke@435 | 943 | state->store_local(index, round_fp(x)); |
duke@435 | 944 | } |
duke@435 | 945 | |
duke@435 | 946 | |
duke@435 | 947 | void GraphBuilder::load_indexed(BasicType type) { |
roland@2174 | 948 | ValueStack* state_before = copy_state_for_exception(); |
duke@435 | 949 | Value index = ipop(); |
duke@435 | 950 | Value array = apop(); |
duke@435 | 951 | Value length = NULL; |
duke@435 | 952 | if (CSEArrayLength || |
duke@435 | 953 | (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) || |
duke@435 | 954 | (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) { |
roland@2174 | 955 | length = append(new ArrayLength(array, state_before)); |
duke@435 | 956 | } |
roland@2174 | 957 | push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before))); |
duke@435 | 958 | } |
duke@435 | 959 | |
duke@435 | 960 | |
duke@435 | 961 | void GraphBuilder::store_indexed(BasicType type) { |
roland@2174 | 962 | ValueStack* state_before = copy_state_for_exception(); |
duke@435 | 963 | Value value = pop(as_ValueType(type)); |
duke@435 | 964 | Value index = ipop(); |
duke@435 | 965 | Value array = apop(); |
duke@435 | 966 | Value length = NULL; |
duke@435 | 967 | if (CSEArrayLength || |
duke@435 | 968 | (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) || |
duke@435 | 969 | (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) { |
roland@2174 | 970 | length = append(new ArrayLength(array, state_before)); |
duke@435 | 971 | } |
roland@2174 | 972 | StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before); |
duke@435 | 973 | append(result); |
never@894 | 974 | _memory->store_value(value); |
iveresov@2146 | 975 | |
iveresov@2146 | 976 | if (type == T_OBJECT && is_profiling()) { |
iveresov@2146 | 977 | // Note that we'd collect profile data in this method if we wanted it. |
iveresov@2146 | 978 | compilation()->set_would_profile(true); |
iveresov@2146 | 979 | |
iveresov@2146 | 980 | if (profile_checkcasts()) { |
iveresov@2146 | 981 | result->set_profiled_method(method()); |
iveresov@2146 | 982 | result->set_profiled_bci(bci()); |
iveresov@2146 | 983 | result->set_should_profile(true); |
iveresov@2146 | 984 | } |
iveresov@2146 | 985 | } |
duke@435 | 986 | } |
duke@435 | 987 | |
duke@435 | 988 | |
duke@435 | 989 | void GraphBuilder::stack_op(Bytecodes::Code code) { |
duke@435 | 990 | switch (code) { |
duke@435 | 991 | case Bytecodes::_pop: |
duke@435 | 992 | { state()->raw_pop(); |
duke@435 | 993 | } |
duke@435 | 994 | break; |
duke@435 | 995 | case Bytecodes::_pop2: |
duke@435 | 996 | { state()->raw_pop(); |
duke@435 | 997 | state()->raw_pop(); |
duke@435 | 998 | } |
duke@435 | 999 | break; |
duke@435 | 1000 | case Bytecodes::_dup: |
duke@435 | 1001 | { Value w = state()->raw_pop(); |
duke@435 | 1002 | state()->raw_push(w); |
duke@435 | 1003 | state()->raw_push(w); |
duke@435 | 1004 | } |
duke@435 | 1005 | break; |
duke@435 | 1006 | case Bytecodes::_dup_x1: |
duke@435 | 1007 | { Value w1 = state()->raw_pop(); |
duke@435 | 1008 | Value w2 = state()->raw_pop(); |
duke@435 | 1009 | state()->raw_push(w1); |
duke@435 | 1010 | state()->raw_push(w2); |
duke@435 | 1011 | state()->raw_push(w1); |
duke@435 | 1012 | } |
duke@435 | 1013 | break; |
duke@435 | 1014 | case Bytecodes::_dup_x2: |
duke@435 | 1015 | { Value w1 = state()->raw_pop(); |
duke@435 | 1016 | Value w2 = state()->raw_pop(); |
duke@435 | 1017 | Value w3 = state()->raw_pop(); |
duke@435 | 1018 | state()->raw_push(w1); |
duke@435 | 1019 | state()->raw_push(w3); |
duke@435 | 1020 | state()->raw_push(w2); |
duke@435 | 1021 | state()->raw_push(w1); |
duke@435 | 1022 | } |
duke@435 | 1023 | break; |
duke@435 | 1024 | case Bytecodes::_dup2: |
duke@435 | 1025 | { Value w1 = state()->raw_pop(); |
duke@435 | 1026 | Value w2 = state()->raw_pop(); |
duke@435 | 1027 | state()->raw_push(w2); |
duke@435 | 1028 | state()->raw_push(w1); |
duke@435 | 1029 | state()->raw_push(w2); |
duke@435 | 1030 | state()->raw_push(w1); |
duke@435 | 1031 | } |
duke@435 | 1032 | break; |
duke@435 | 1033 | case Bytecodes::_dup2_x1: |
duke@435 | 1034 | { Value w1 = state()->raw_pop(); |
duke@435 | 1035 | Value w2 = state()->raw_pop(); |
duke@435 | 1036 | Value w3 = state()->raw_pop(); |
duke@435 | 1037 | state()->raw_push(w2); |
duke@435 | 1038 | state()->raw_push(w1); |
duke@435 | 1039 | state()->raw_push(w3); |
duke@435 | 1040 | state()->raw_push(w2); |
duke@435 | 1041 | state()->raw_push(w1); |
duke@435 | 1042 | } |
duke@435 | 1043 | break; |
duke@435 | 1044 | case Bytecodes::_dup2_x2: |
duke@435 | 1045 | { Value w1 = state()->raw_pop(); |
duke@435 | 1046 | Value w2 = state()->raw_pop(); |
duke@435 | 1047 | Value w3 = state()->raw_pop(); |
duke@435 | 1048 | Value w4 = state()->raw_pop(); |
duke@435 | 1049 | state()->raw_push(w2); |
duke@435 | 1050 | state()->raw_push(w1); |
duke@435 | 1051 | state()->raw_push(w4); |
duke@435 | 1052 | state()->raw_push(w3); |
duke@435 | 1053 | state()->raw_push(w2); |
duke@435 | 1054 | state()->raw_push(w1); |
duke@435 | 1055 | } |
duke@435 | 1056 | break; |
duke@435 | 1057 | case Bytecodes::_swap: |
duke@435 | 1058 | { Value w1 = state()->raw_pop(); |
duke@435 | 1059 | Value w2 = state()->raw_pop(); |
duke@435 | 1060 | state()->raw_push(w1); |
duke@435 | 1061 | state()->raw_push(w2); |
duke@435 | 1062 | } |
duke@435 | 1063 | break; |
duke@435 | 1064 | default: |
duke@435 | 1065 | ShouldNotReachHere(); |
duke@435 | 1066 | break; |
duke@435 | 1067 | } |
duke@435 | 1068 | } |
duke@435 | 1069 | |
duke@435 | 1070 | |
roland@2174 | 1071 | void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) { |
duke@435 | 1072 | Value y = pop(type); |
duke@435 | 1073 | Value x = pop(type); |
duke@435 | 1074 | // NOTE: strictfp can be queried from current method since we don't |
duke@435 | 1075 | // inline methods with differing strictfp bits |
roland@2174 | 1076 | Value res = new ArithmeticOp(code, x, y, method()->is_strict(), state_before); |
duke@435 | 1077 | // Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level |
duke@435 | 1078 | res = append(res); |
duke@435 | 1079 | if (method()->is_strict()) { |
duke@435 | 1080 | res = round_fp(res); |
duke@435 | 1081 | } |
duke@435 | 1082 | push(type, res); |
duke@435 | 1083 | } |
duke@435 | 1084 | |
duke@435 | 1085 | |
duke@435 | 1086 | void GraphBuilder::negate_op(ValueType* type) { |
duke@435 | 1087 | push(type, append(new NegateOp(pop(type)))); |
duke@435 | 1088 | } |
duke@435 | 1089 | |
duke@435 | 1090 | |
duke@435 | 1091 | void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) { |
duke@435 | 1092 | Value s = ipop(); |
duke@435 | 1093 | Value x = pop(type); |
duke@435 | 1094 | // try to simplify |
duke@435 | 1095 | // Note: This code should go into the canonicalizer as soon as it can |
duke@435 | 1096 | // can handle canonicalized forms that contain more than one node. |
duke@435 | 1097 | if (CanonicalizeNodes && code == Bytecodes::_iushr) { |
duke@435 | 1098 | // pattern: x >>> s |
duke@435 | 1099 | IntConstant* s1 = s->type()->as_IntConstant(); |
duke@435 | 1100 | if (s1 != NULL) { |
duke@435 | 1101 | // pattern: x >>> s1, with s1 constant |
duke@435 | 1102 | ShiftOp* l = x->as_ShiftOp(); |
duke@435 | 1103 | if (l != NULL && l->op() == Bytecodes::_ishl) { |
duke@435 | 1104 | // pattern: (a << b) >>> s1 |
duke@435 | 1105 | IntConstant* s0 = l->y()->type()->as_IntConstant(); |
duke@435 | 1106 | if (s0 != NULL) { |
duke@435 | 1107 | // pattern: (a << s0) >>> s1 |
duke@435 | 1108 | const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts |
duke@435 | 1109 | const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts |
duke@435 | 1110 | if (s0c == s1c) { |
duke@435 | 1111 | if (s0c == 0) { |
duke@435 | 1112 | // pattern: (a << 0) >>> 0 => simplify to: a |
duke@435 | 1113 | ipush(l->x()); |
duke@435 | 1114 | } else { |
duke@435 | 1115 | // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant |
duke@435 | 1116 | assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases"); |
duke@435 | 1117 | const int m = (1 << (BitsPerInt - s0c)) - 1; |
duke@435 | 1118 | Value s = append(new Constant(new IntConstant(m))); |
duke@435 | 1119 | ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s))); |
duke@435 | 1120 | } |
duke@435 | 1121 | return; |
duke@435 | 1122 | } |
duke@435 | 1123 | } |
duke@435 | 1124 | } |
duke@435 | 1125 | } |
duke@435 | 1126 | } |
duke@435 | 1127 | // could not simplify |
duke@435 | 1128 | push(type, append(new ShiftOp(code, x, s))); |
duke@435 | 1129 | } |
duke@435 | 1130 | |
duke@435 | 1131 | |
duke@435 | 1132 | void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) { |
duke@435 | 1133 | Value y = pop(type); |
duke@435 | 1134 | Value x = pop(type); |
duke@435 | 1135 | push(type, append(new LogicOp(code, x, y))); |
duke@435 | 1136 | } |
duke@435 | 1137 | |
duke@435 | 1138 | |
duke@435 | 1139 | void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) { |
roland@2174 | 1140 | ValueStack* state_before = copy_state_before(); |
duke@435 | 1141 | Value y = pop(type); |
duke@435 | 1142 | Value x = pop(type); |
duke@435 | 1143 | ipush(append(new CompareOp(code, x, y, state_before))); |
duke@435 | 1144 | } |
duke@435 | 1145 | |
duke@435 | 1146 | |
duke@435 | 1147 | void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) { |
duke@435 | 1148 | push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to)))); |
duke@435 | 1149 | } |
duke@435 | 1150 | |
duke@435 | 1151 | |
duke@435 | 1152 | void GraphBuilder::increment() { |
duke@435 | 1153 | int index = stream()->get_index(); |
duke@435 | 1154 | int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]); |
duke@435 | 1155 | load_local(intType, index); |
duke@435 | 1156 | ipush(append(new Constant(new IntConstant(delta)))); |
duke@435 | 1157 | arithmetic_op(intType, Bytecodes::_iadd); |
duke@435 | 1158 | store_local(intType, index); |
duke@435 | 1159 | } |
duke@435 | 1160 | |
duke@435 | 1161 | |
duke@435 | 1162 | void GraphBuilder::_goto(int from_bci, int to_bci) { |
iveresov@2138 | 1163 | Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci); |
iveresov@2138 | 1164 | if (is_profiling()) { |
iveresov@2138 | 1165 | compilation()->set_would_profile(true); |
iveresov@2138 | 1166 | } |
iveresov@2138 | 1167 | if (profile_branches()) { |
iveresov@2138 | 1168 | x->set_profiled_method(method()); |
iveresov@2138 | 1169 | x->set_profiled_bci(bci()); |
iveresov@2138 | 1170 | x->set_should_profile(true); |
iveresov@2138 | 1171 | } |
iveresov@2138 | 1172 | append(x); |
duke@435 | 1173 | } |
duke@435 | 1174 | |
duke@435 | 1175 | |
duke@435 | 1176 | void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) { |
duke@435 | 1177 | BlockBegin* tsux = block_at(stream()->get_dest()); |
duke@435 | 1178 | BlockBegin* fsux = block_at(stream()->next_bci()); |
duke@435 | 1179 | bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci(); |
iveresov@2138 | 1180 | Instruction *i = append(new If(x, cond, false, y, tsux, fsux, is_bb ? state_before : NULL, is_bb)); |
iveresov@2138 | 1181 | |
iveresov@2138 | 1182 | if (is_profiling()) { |
iveresov@2138 | 1183 | If* if_node = i->as_If(); |
iveresov@2138 | 1184 | if (if_node != NULL) { |
iveresov@2138 | 1185 | // Note that we'd collect profile data in this method if we wanted it. |
iveresov@2138 | 1186 | compilation()->set_would_profile(true); |
iveresov@2138 | 1187 | // At level 2 we need the proper bci to count backedges |
iveresov@2138 | 1188 | if_node->set_profiled_bci(bci()); |
iveresov@2138 | 1189 | if (profile_branches()) { |
iveresov@2138 | 1190 | // Successors can be rotated by the canonicalizer, check for this case. |
iveresov@2138 | 1191 | if_node->set_profiled_method(method()); |
iveresov@2138 | 1192 | if_node->set_should_profile(true); |
iveresov@2138 | 1193 | if (if_node->tsux() == fsux) { |
iveresov@2138 | 1194 | if_node->set_swapped(true); |
iveresov@2138 | 1195 | } |
iveresov@2138 | 1196 | } |
iveresov@2138 | 1197 | return; |
iveresov@2138 | 1198 | } |
iveresov@2138 | 1199 | |
iveresov@2138 | 1200 | // Check if this If was reduced to Goto. |
iveresov@2138 | 1201 | Goto *goto_node = i->as_Goto(); |
iveresov@2138 | 1202 | if (goto_node != NULL) { |
iveresov@2138 | 1203 | compilation()->set_would_profile(true); |
iveresov@2138 | 1204 | if (profile_branches()) { |
iveresov@2138 | 1205 | goto_node->set_profiled_method(method()); |
iveresov@2138 | 1206 | goto_node->set_profiled_bci(bci()); |
iveresov@2138 | 1207 | goto_node->set_should_profile(true); |
iveresov@2138 | 1208 | // Find out which successor is used. |
iveresov@2138 | 1209 | if (goto_node->default_sux() == tsux) { |
iveresov@2138 | 1210 | goto_node->set_direction(Goto::taken); |
iveresov@2138 | 1211 | } else if (goto_node->default_sux() == fsux) { |
iveresov@2138 | 1212 | goto_node->set_direction(Goto::not_taken); |
iveresov@2138 | 1213 | } else { |
iveresov@2138 | 1214 | ShouldNotReachHere(); |
iveresov@2138 | 1215 | } |
iveresov@2138 | 1216 | } |
iveresov@2138 | 1217 | return; |
iveresov@2138 | 1218 | } |
duke@435 | 1219 | } |
duke@435 | 1220 | } |
duke@435 | 1221 | |
duke@435 | 1222 | |
duke@435 | 1223 | void GraphBuilder::if_zero(ValueType* type, If::Condition cond) { |
duke@435 | 1224 | Value y = append(new Constant(intZero)); |
roland@2174 | 1225 | ValueStack* state_before = copy_state_before(); |
duke@435 | 1226 | Value x = ipop(); |
duke@435 | 1227 | if_node(x, cond, y, state_before); |
duke@435 | 1228 | } |
duke@435 | 1229 | |
duke@435 | 1230 | |
duke@435 | 1231 | void GraphBuilder::if_null(ValueType* type, If::Condition cond) { |
duke@435 | 1232 | Value y = append(new Constant(objectNull)); |
roland@2174 | 1233 | ValueStack* state_before = copy_state_before(); |
duke@435 | 1234 | Value x = apop(); |
duke@435 | 1235 | if_node(x, cond, y, state_before); |
duke@435 | 1236 | } |
duke@435 | 1237 | |
duke@435 | 1238 | |
duke@435 | 1239 | void GraphBuilder::if_same(ValueType* type, If::Condition cond) { |
roland@2174 | 1240 | ValueStack* state_before = copy_state_before(); |
duke@435 | 1241 | Value y = pop(type); |
duke@435 | 1242 | Value x = pop(type); |
duke@435 | 1243 | if_node(x, cond, y, state_before); |
duke@435 | 1244 | } |
duke@435 | 1245 | |
duke@435 | 1246 | |
duke@435 | 1247 | void GraphBuilder::jsr(int dest) { |
duke@435 | 1248 | // We only handle well-formed jsrs (those which are "block-structured"). |
duke@435 | 1249 | // If the bytecodes are strange (jumping out of a jsr block) then we |
duke@435 | 1250 | // might end up trying to re-parse a block containing a jsr which |
duke@435 | 1251 | // has already been activated. Watch for this case and bail out. |
duke@435 | 1252 | for (ScopeData* cur_scope_data = scope_data(); |
duke@435 | 1253 | cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope(); |
duke@435 | 1254 | cur_scope_data = cur_scope_data->parent()) { |
duke@435 | 1255 | if (cur_scope_data->jsr_entry_bci() == dest) { |
duke@435 | 1256 | BAILOUT("too-complicated jsr/ret structure"); |
duke@435 | 1257 | } |
duke@435 | 1258 | } |
duke@435 | 1259 | |
duke@435 | 1260 | push(addressType, append(new Constant(new AddressConstant(next_bci())))); |
duke@435 | 1261 | if (!try_inline_jsr(dest)) { |
duke@435 | 1262 | return; // bailed out while parsing and inlining subroutine |
duke@435 | 1263 | } |
duke@435 | 1264 | } |
duke@435 | 1265 | |
duke@435 | 1266 | |
duke@435 | 1267 | void GraphBuilder::ret(int local_index) { |
duke@435 | 1268 | if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine"); |
duke@435 | 1269 | |
duke@435 | 1270 | if (local_index != scope_data()->jsr_return_address_local()) { |
duke@435 | 1271 | BAILOUT("can not handle complicated jsr/ret constructs"); |
duke@435 | 1272 | } |
duke@435 | 1273 | |
duke@435 | 1274 | // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation |
duke@435 | 1275 | append(new Goto(scope_data()->jsr_continuation(), false)); |
duke@435 | 1276 | } |
duke@435 | 1277 | |
duke@435 | 1278 | |
duke@435 | 1279 | void GraphBuilder::table_switch() { |
never@2462 | 1280 | Bytecode_tableswitch sw(stream()); |
never@2462 | 1281 | const int l = sw.length(); |
duke@435 | 1282 | if (CanonicalizeNodes && l == 1) { |
duke@435 | 1283 | // total of 2 successors => use If instead of switch |
duke@435 | 1284 | // Note: This code should go into the canonicalizer as soon as it can |
duke@435 | 1285 | // can handle canonicalized forms that contain more than one node. |
never@2462 | 1286 | Value key = append(new Constant(new IntConstant(sw.low_key()))); |
never@2462 | 1287 | BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0)); |
never@2462 | 1288 | BlockBegin* fsux = block_at(bci() + sw.default_offset()); |
duke@435 | 1289 | bool is_bb = tsux->bci() < bci() || fsux->bci() < bci(); |
roland@2174 | 1290 | ValueStack* state_before = is_bb ? copy_state_before() : NULL; |
duke@435 | 1291 | append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb)); |
duke@435 | 1292 | } else { |
duke@435 | 1293 | // collect successors |
duke@435 | 1294 | BlockList* sux = new BlockList(l + 1, NULL); |
duke@435 | 1295 | int i; |
duke@435 | 1296 | bool has_bb = false; |
duke@435 | 1297 | for (i = 0; i < l; i++) { |
never@2462 | 1298 | sux->at_put(i, block_at(bci() + sw.dest_offset_at(i))); |
never@2462 | 1299 | if (sw.dest_offset_at(i) < 0) has_bb = true; |
duke@435 | 1300 | } |
duke@435 | 1301 | // add default successor |
never@2462 | 1302 | sux->at_put(i, block_at(bci() + sw.default_offset())); |
roland@2174 | 1303 | ValueStack* state_before = has_bb ? copy_state_before() : NULL; |
never@2462 | 1304 | append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb)); |
duke@435 | 1305 | } |
duke@435 | 1306 | } |
duke@435 | 1307 | |
duke@435 | 1308 | |
duke@435 | 1309 | void GraphBuilder::lookup_switch() { |
never@2462 | 1310 | Bytecode_lookupswitch sw(stream()); |
never@2462 | 1311 | const int l = sw.number_of_pairs(); |
duke@435 | 1312 | if (CanonicalizeNodes && l == 1) { |
duke@435 | 1313 | // total of 2 successors => use If instead of switch |
duke@435 | 1314 | // Note: This code should go into the canonicalizer as soon as it can |
duke@435 | 1315 | // can handle canonicalized forms that contain more than one node. |
duke@435 | 1316 | // simplify to If |
never@2462 | 1317 | LookupswitchPair pair = sw.pair_at(0); |
never@2462 | 1318 | Value key = append(new Constant(new IntConstant(pair.match()))); |
never@2462 | 1319 | BlockBegin* tsux = block_at(bci() + pair.offset()); |
never@2462 | 1320 | BlockBegin* fsux = block_at(bci() + sw.default_offset()); |
duke@435 | 1321 | bool is_bb = tsux->bci() < bci() || fsux->bci() < bci(); |
roland@2174 | 1322 | ValueStack* state_before = is_bb ? copy_state_before() : NULL; |
duke@435 | 1323 | append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb)); |
duke@435 | 1324 | } else { |
duke@435 | 1325 | // collect successors & keys |
duke@435 | 1326 | BlockList* sux = new BlockList(l + 1, NULL); |
duke@435 | 1327 | intArray* keys = new intArray(l, 0); |
duke@435 | 1328 | int i; |
duke@435 | 1329 | bool has_bb = false; |
duke@435 | 1330 | for (i = 0; i < l; i++) { |
never@2462 | 1331 | LookupswitchPair pair = sw.pair_at(i); |
never@2462 | 1332 | if (pair.offset() < 0) has_bb = true; |
never@2462 | 1333 | sux->at_put(i, block_at(bci() + pair.offset())); |
never@2462 | 1334 | keys->at_put(i, pair.match()); |
duke@435 | 1335 | } |
duke@435 | 1336 | // add default successor |
never@2462 | 1337 | sux->at_put(i, block_at(bci() + sw.default_offset())); |
roland@2174 | 1338 | ValueStack* state_before = has_bb ? copy_state_before() : NULL; |
duke@435 | 1339 | append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb)); |
duke@435 | 1340 | } |
duke@435 | 1341 | } |
duke@435 | 1342 | |
duke@435 | 1343 | void GraphBuilder::call_register_finalizer() { |
duke@435 | 1344 | // If the receiver requires finalization then emit code to perform |
duke@435 | 1345 | // the registration on return. |
duke@435 | 1346 | |
duke@435 | 1347 | // Gather some type information about the receiver |
roland@2174 | 1348 | Value receiver = state()->local_at(0); |
duke@435 | 1349 | assert(receiver != NULL, "must have a receiver"); |
duke@435 | 1350 | ciType* declared_type = receiver->declared_type(); |
duke@435 | 1351 | ciType* exact_type = receiver->exact_type(); |
duke@435 | 1352 | if (exact_type == NULL && |
duke@435 | 1353 | receiver->as_Local() && |
duke@435 | 1354 | receiver->as_Local()->java_index() == 0) { |
duke@435 | 1355 | ciInstanceKlass* ik = compilation()->method()->holder(); |
duke@435 | 1356 | if (ik->is_final()) { |
duke@435 | 1357 | exact_type = ik; |
duke@435 | 1358 | } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) { |
duke@435 | 1359 | // test class is leaf class |
duke@435 | 1360 | compilation()->dependency_recorder()->assert_leaf_type(ik); |
duke@435 | 1361 | exact_type = ik; |
duke@435 | 1362 | } else { |
duke@435 | 1363 | declared_type = ik; |
duke@435 | 1364 | } |
duke@435 | 1365 | } |
duke@435 | 1366 | |
duke@435 | 1367 | // see if we know statically that registration isn't required |
duke@435 | 1368 | bool needs_check = true; |
duke@435 | 1369 | if (exact_type != NULL) { |
duke@435 | 1370 | needs_check = exact_type->as_instance_klass()->has_finalizer(); |
duke@435 | 1371 | } else if (declared_type != NULL) { |
duke@435 | 1372 | ciInstanceKlass* ik = declared_type->as_instance_klass(); |
duke@435 | 1373 | if (!Dependencies::has_finalizable_subclass(ik)) { |
duke@435 | 1374 | compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik); |
duke@435 | 1375 | needs_check = false; |
duke@435 | 1376 | } |
duke@435 | 1377 | } |
duke@435 | 1378 | |
duke@435 | 1379 | if (needs_check) { |
duke@435 | 1380 | // Perform the registration of finalizable objects. |
roland@2174 | 1381 | ValueStack* state_before = copy_state_for_exception(); |
duke@435 | 1382 | load_local(objectType, 0); |
duke@435 | 1383 | append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init, |
duke@435 | 1384 | state()->pop_arguments(1), |
roland@2174 | 1385 | true, state_before, true)); |
duke@435 | 1386 | } |
duke@435 | 1387 | } |
duke@435 | 1388 | |
duke@435 | 1389 | |
duke@435 | 1390 | void GraphBuilder::method_return(Value x) { |
duke@435 | 1391 | if (RegisterFinalizersAtInit && |
duke@435 | 1392 | method()->intrinsic_id() == vmIntrinsics::_Object_init) { |
duke@435 | 1393 | call_register_finalizer(); |
duke@435 | 1394 | } |
duke@435 | 1395 | |
duke@435 | 1396 | // Check to see whether we are inlining. If so, Return |
duke@435 | 1397 | // instructions become Gotos to the continuation point. |
duke@435 | 1398 | if (continuation() != NULL) { |
duke@435 | 1399 | assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet"); |
duke@435 | 1400 | |
never@2486 | 1401 | if (compilation()->env()->dtrace_method_probes()) { |
never@2486 | 1402 | // Report exit from inline methods |
never@2486 | 1403 | Values* args = new Values(1); |
never@2486 | 1404 | args->push(append(new Constant(new ObjectConstant(method())))); |
never@2486 | 1405 | append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args)); |
never@2486 | 1406 | } |
never@2486 | 1407 | |
duke@435 | 1408 | // If the inlined method is synchronized, the monitor must be |
duke@435 | 1409 | // released before we jump to the continuation block. |
duke@435 | 1410 | if (method()->is_synchronized()) { |
roland@2174 | 1411 | assert(state()->locks_size() == 1, "receiver must be locked here"); |
roland@2174 | 1412 | monitorexit(state()->lock_at(0), SynchronizationEntryBCI); |
duke@435 | 1413 | } |
duke@435 | 1414 | |
roland@2174 | 1415 | // State at end of inlined method is the state of the caller |
roland@2174 | 1416 | // without the method parameters on stack, including the |
roland@2174 | 1417 | // return value, if any, of the inlined method on operand stack. |
roland@2174 | 1418 | set_state(state()->caller_state()->copy_for_parsing()); |
duke@435 | 1419 | if (x != NULL) { |
duke@435 | 1420 | state()->push(x->type(), x); |
duke@435 | 1421 | } |
duke@435 | 1422 | Goto* goto_callee = new Goto(continuation(), false); |
duke@435 | 1423 | |
duke@435 | 1424 | // See whether this is the first return; if so, store off some |
duke@435 | 1425 | // of the state for later examination |
duke@435 | 1426 | if (num_returns() == 0) { |
duke@435 | 1427 | set_inline_cleanup_info(_block, _last, state()); |
duke@435 | 1428 | } |
duke@435 | 1429 | |
duke@435 | 1430 | // The current bci() is in the wrong scope, so use the bci() of |
duke@435 | 1431 | // the continuation point. |
duke@435 | 1432 | append_with_bci(goto_callee, scope_data()->continuation()->bci()); |
duke@435 | 1433 | incr_num_returns(); |
duke@435 | 1434 | |
duke@435 | 1435 | return; |
duke@435 | 1436 | } |
duke@435 | 1437 | |
duke@435 | 1438 | state()->truncate_stack(0); |
duke@435 | 1439 | if (method()->is_synchronized()) { |
duke@435 | 1440 | // perform the unlocking before exiting the method |
duke@435 | 1441 | Value receiver; |
duke@435 | 1442 | if (!method()->is_static()) { |
duke@435 | 1443 | receiver = _initial_state->local_at(0); |
duke@435 | 1444 | } else { |
duke@435 | 1445 | receiver = append(new Constant(new ClassConstant(method()->holder()))); |
duke@435 | 1446 | } |
duke@435 | 1447 | append_split(new MonitorExit(receiver, state()->unlock())); |
duke@435 | 1448 | } |
duke@435 | 1449 | |
duke@435 | 1450 | append(new Return(x)); |
duke@435 | 1451 | } |
duke@435 | 1452 | |
duke@435 | 1453 | |
duke@435 | 1454 | void GraphBuilder::access_field(Bytecodes::Code code) { |
duke@435 | 1455 | bool will_link; |
duke@435 | 1456 | ciField* field = stream()->get_field(will_link); |
duke@435 | 1457 | ciInstanceKlass* holder = field->holder(); |
duke@435 | 1458 | BasicType field_type = field->type()->basic_type(); |
duke@435 | 1459 | ValueType* type = as_ValueType(field_type); |
duke@435 | 1460 | // call will_link again to determine if the field is valid. |
never@2634 | 1461 | const bool needs_patching = !holder->is_loaded() || |
never@2634 | 1462 | !field->will_link(method()->holder(), code) || |
never@2634 | 1463 | PatchALot; |
duke@435 | 1464 | |
roland@2174 | 1465 | ValueStack* state_before = NULL; |
never@2634 | 1466 | if (!holder->is_initialized() || needs_patching) { |
duke@435 | 1467 | // save state before instruction for debug info when |
duke@435 | 1468 | // deoptimization happens during patching |
roland@2174 | 1469 | state_before = copy_state_before(); |
duke@435 | 1470 | } |
duke@435 | 1471 | |
duke@435 | 1472 | Value obj = NULL; |
duke@435 | 1473 | if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) { |
roland@2174 | 1474 | if (state_before != NULL) { |
duke@435 | 1475 | // build a patching constant |
never@2658 | 1476 | obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before); |
duke@435 | 1477 | } else { |
never@2658 | 1478 | obj = new Constant(new InstanceConstant(holder->java_mirror())); |
duke@435 | 1479 | } |
duke@435 | 1480 | } |
duke@435 | 1481 | |
duke@435 | 1482 | |
never@2634 | 1483 | const int offset = !needs_patching ? field->offset() : -1; |
duke@435 | 1484 | switch (code) { |
duke@435 | 1485 | case Bytecodes::_getstatic: { |
duke@435 | 1486 | // check for compile-time constants, i.e., initialized static final fields |
duke@435 | 1487 | Instruction* constant = NULL; |
duke@435 | 1488 | if (field->is_constant() && !PatchALot) { |
duke@435 | 1489 | ciConstant field_val = field->constant_value(); |
duke@435 | 1490 | BasicType field_type = field_val.basic_type(); |
duke@435 | 1491 | switch (field_type) { |
duke@435 | 1492 | case T_ARRAY: |
duke@435 | 1493 | case T_OBJECT: |
jrose@1424 | 1494 | if (field_val.as_object()->should_be_constant()) { |
duke@435 | 1495 | constant = new Constant(as_ValueType(field_val)); |
duke@435 | 1496 | } |
duke@435 | 1497 | break; |
duke@435 | 1498 | |
duke@435 | 1499 | default: |
duke@435 | 1500 | constant = new Constant(as_ValueType(field_val)); |
duke@435 | 1501 | } |
duke@435 | 1502 | } |
duke@435 | 1503 | if (constant != NULL) { |
duke@435 | 1504 | push(type, append(constant)); |
duke@435 | 1505 | } else { |
roland@2174 | 1506 | if (state_before == NULL) { |
roland@2174 | 1507 | state_before = copy_state_for_exception(); |
roland@2174 | 1508 | } |
duke@435 | 1509 | push(type, append(new LoadField(append(obj), offset, field, true, |
never@2634 | 1510 | state_before, needs_patching))); |
duke@435 | 1511 | } |
duke@435 | 1512 | break; |
duke@435 | 1513 | } |
duke@435 | 1514 | case Bytecodes::_putstatic: |
duke@435 | 1515 | { Value val = pop(type); |
roland@2174 | 1516 | if (state_before == NULL) { |
roland@2174 | 1517 | state_before = copy_state_for_exception(); |
roland@2174 | 1518 | } |
never@2634 | 1519 | append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching)); |
duke@435 | 1520 | } |
duke@435 | 1521 | break; |
duke@435 | 1522 | case Bytecodes::_getfield : |
duke@435 | 1523 | { |
roland@2174 | 1524 | if (state_before == NULL) { |
roland@2174 | 1525 | state_before = copy_state_for_exception(); |
roland@2174 | 1526 | } |
never@2634 | 1527 | LoadField* load = new LoadField(apop(), offset, field, false, state_before, needs_patching); |
never@2634 | 1528 | Value replacement = !needs_patching ? _memory->load(load) : load; |
duke@435 | 1529 | if (replacement != load) { |
roland@2174 | 1530 | assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked"); |
duke@435 | 1531 | push(type, replacement); |
duke@435 | 1532 | } else { |
duke@435 | 1533 | push(type, append(load)); |
duke@435 | 1534 | } |
duke@435 | 1535 | break; |
duke@435 | 1536 | } |
duke@435 | 1537 | |
duke@435 | 1538 | case Bytecodes::_putfield : |
duke@435 | 1539 | { Value val = pop(type); |
roland@2174 | 1540 | if (state_before == NULL) { |
roland@2174 | 1541 | state_before = copy_state_for_exception(); |
roland@2174 | 1542 | } |
never@2634 | 1543 | StoreField* store = new StoreField(apop(), offset, field, val, false, state_before, needs_patching); |
never@2634 | 1544 | if (!needs_patching) store = _memory->store(store); |
duke@435 | 1545 | if (store != NULL) { |
duke@435 | 1546 | append(store); |
duke@435 | 1547 | } |
duke@435 | 1548 | } |
duke@435 | 1549 | break; |
duke@435 | 1550 | default : |
duke@435 | 1551 | ShouldNotReachHere(); |
duke@435 | 1552 | break; |
duke@435 | 1553 | } |
duke@435 | 1554 | } |
duke@435 | 1555 | |
duke@435 | 1556 | |
duke@435 | 1557 | Dependencies* GraphBuilder::dependency_recorder() const { |
duke@435 | 1558 | assert(DeoptC1, "need debug information"); |
duke@435 | 1559 | return compilation()->dependency_recorder(); |
duke@435 | 1560 | } |
duke@435 | 1561 | |
duke@435 | 1562 | |
duke@435 | 1563 | void GraphBuilder::invoke(Bytecodes::Code code) { |
duke@435 | 1564 | bool will_link; |
duke@435 | 1565 | ciMethod* target = stream()->get_method(will_link); |
duke@435 | 1566 | // we have to make sure the argument size (incl. the receiver) |
duke@435 | 1567 | // is correct for compilation (the call would fail later during |
duke@435 | 1568 | // linkage anyway) - was bug (gri 7/28/99) |
duke@435 | 1569 | if (target->is_loaded() && target->is_static() != (code == Bytecodes::_invokestatic)) BAILOUT("will cause link error"); |
duke@435 | 1570 | ciInstanceKlass* klass = target->holder(); |
duke@435 | 1571 | |
duke@435 | 1572 | // check if CHA possible: if so, change the code to invoke_special |
duke@435 | 1573 | ciInstanceKlass* calling_klass = method()->holder(); |
duke@435 | 1574 | ciKlass* holder = stream()->get_declared_method_holder(); |
duke@435 | 1575 | ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder); |
duke@435 | 1576 | ciInstanceKlass* actual_recv = callee_holder; |
duke@435 | 1577 | |
duke@435 | 1578 | // some methods are obviously bindable without any type checks so |
duke@435 | 1579 | // convert them directly to an invokespecial. |
duke@435 | 1580 | if (target->is_loaded() && !target->is_abstract() && |
duke@435 | 1581 | target->can_be_statically_bound() && code == Bytecodes::_invokevirtual) { |
duke@435 | 1582 | code = Bytecodes::_invokespecial; |
duke@435 | 1583 | } |
duke@435 | 1584 | |
duke@435 | 1585 | // NEEDS_CLEANUP |
duke@435 | 1586 | // I've added the target-is_loaded() test below but I don't really understand |
duke@435 | 1587 | // how klass->is_loaded() can be true and yet target->is_loaded() is false. |
duke@435 | 1588 | // this happened while running the JCK invokevirtual tests under doit. TKR |
duke@435 | 1589 | ciMethod* cha_monomorphic_target = NULL; |
duke@435 | 1590 | ciMethod* exact_target = NULL; |
twisti@1730 | 1591 | if (UseCHA && DeoptC1 && klass->is_loaded() && target->is_loaded() && |
twisti@1730 | 1592 | !target->is_method_handle_invoke()) { |
duke@435 | 1593 | Value receiver = NULL; |
duke@435 | 1594 | ciInstanceKlass* receiver_klass = NULL; |
duke@435 | 1595 | bool type_is_exact = false; |
duke@435 | 1596 | // try to find a precise receiver type |
duke@435 | 1597 | if (will_link && !target->is_static()) { |
duke@435 | 1598 | int index = state()->stack_size() - (target->arg_size_no_receiver() + 1); |
duke@435 | 1599 | receiver = state()->stack_at(index); |
duke@435 | 1600 | ciType* type = receiver->exact_type(); |
duke@435 | 1601 | if (type != NULL && type->is_loaded() && |
duke@435 | 1602 | type->is_instance_klass() && !type->as_instance_klass()->is_interface()) { |
duke@435 | 1603 | receiver_klass = (ciInstanceKlass*) type; |
duke@435 | 1604 | type_is_exact = true; |
duke@435 | 1605 | } |
duke@435 | 1606 | if (type == NULL) { |
duke@435 | 1607 | type = receiver->declared_type(); |
duke@435 | 1608 | if (type != NULL && type->is_loaded() && |
duke@435 | 1609 | type->is_instance_klass() && !type->as_instance_klass()->is_interface()) { |
duke@435 | 1610 | receiver_klass = (ciInstanceKlass*) type; |
duke@435 | 1611 | if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) { |
duke@435 | 1612 | // Insert a dependency on this type since |
duke@435 | 1613 | // find_monomorphic_target may assume it's already done. |
duke@435 | 1614 | dependency_recorder()->assert_leaf_type(receiver_klass); |
duke@435 | 1615 | type_is_exact = true; |
duke@435 | 1616 | } |
duke@435 | 1617 | } |
duke@435 | 1618 | } |
duke@435 | 1619 | } |
duke@435 | 1620 | if (receiver_klass != NULL && type_is_exact && |
duke@435 | 1621 | receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) { |
duke@435 | 1622 | // If we have the exact receiver type we can bind directly to |
duke@435 | 1623 | // the method to call. |
duke@435 | 1624 | exact_target = target->resolve_invoke(calling_klass, receiver_klass); |
duke@435 | 1625 | if (exact_target != NULL) { |
duke@435 | 1626 | target = exact_target; |
duke@435 | 1627 | code = Bytecodes::_invokespecial; |
duke@435 | 1628 | } |
duke@435 | 1629 | } |
duke@435 | 1630 | if (receiver_klass != NULL && |
duke@435 | 1631 | receiver_klass->is_subtype_of(actual_recv) && |
duke@435 | 1632 | actual_recv->is_initialized()) { |
duke@435 | 1633 | actual_recv = receiver_klass; |
duke@435 | 1634 | } |
duke@435 | 1635 | |
duke@435 | 1636 | if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) || |
duke@435 | 1637 | (code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) { |
duke@435 | 1638 | // Use CHA on the receiver to select a more precise method. |
duke@435 | 1639 | cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv); |
duke@435 | 1640 | } else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != NULL) { |
duke@435 | 1641 | // if there is only one implementor of this interface then we |
duke@435 | 1642 | // may be able bind this invoke directly to the implementing |
duke@435 | 1643 | // klass but we need both a dependence on the single interface |
duke@435 | 1644 | // and on the method we bind to. Additionally since all we know |
duke@435 | 1645 | // about the receiver type is the it's supposed to implement the |
duke@435 | 1646 | // interface we have to insert a check that it's the class we |
duke@435 | 1647 | // expect. Interface types are not checked by the verifier so |
duke@435 | 1648 | // they are roughly equivalent to Object. |
duke@435 | 1649 | ciInstanceKlass* singleton = NULL; |
duke@435 | 1650 | if (target->holder()->nof_implementors() == 1) { |
duke@435 | 1651 | singleton = target->holder()->implementor(0); |
duke@435 | 1652 | } |
duke@435 | 1653 | if (singleton) { |
duke@435 | 1654 | cha_monomorphic_target = target->find_monomorphic_target(calling_klass, target->holder(), singleton); |
duke@435 | 1655 | if (cha_monomorphic_target != NULL) { |
duke@435 | 1656 | // If CHA is able to bind this invoke then update the class |
duke@435 | 1657 | // to match that class, otherwise klass will refer to the |
duke@435 | 1658 | // interface. |
duke@435 | 1659 | klass = cha_monomorphic_target->holder(); |
duke@435 | 1660 | actual_recv = target->holder(); |
duke@435 | 1661 | |
duke@435 | 1662 | // insert a check it's really the expected class. |
roland@2174 | 1663 | CheckCast* c = new CheckCast(klass, receiver, copy_state_for_exception()); |
duke@435 | 1664 | c->set_incompatible_class_change_check(); |
duke@435 | 1665 | c->set_direct_compare(klass->is_final()); |
duke@435 | 1666 | append_split(c); |
duke@435 | 1667 | } |
duke@435 | 1668 | } |
duke@435 | 1669 | } |
duke@435 | 1670 | } |
duke@435 | 1671 | |
duke@435 | 1672 | if (cha_monomorphic_target != NULL) { |
duke@435 | 1673 | if (cha_monomorphic_target->is_abstract()) { |
duke@435 | 1674 | // Do not optimize for abstract methods |
duke@435 | 1675 | cha_monomorphic_target = NULL; |
duke@435 | 1676 | } |
duke@435 | 1677 | } |
duke@435 | 1678 | |
duke@435 | 1679 | if (cha_monomorphic_target != NULL) { |
duke@435 | 1680 | if (!(target->is_final_method())) { |
duke@435 | 1681 | // If we inlined because CHA revealed only a single target method, |
duke@435 | 1682 | // then we are dependent on that target method not getting overridden |
duke@435 | 1683 | // by dynamic class loading. Be sure to test the "static" receiver |
duke@435 | 1684 | // dest_method here, as opposed to the actual receiver, which may |
duke@435 | 1685 | // falsely lead us to believe that the receiver is final or private. |
duke@435 | 1686 | dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target); |
duke@435 | 1687 | } |
duke@435 | 1688 | code = Bytecodes::_invokespecial; |
duke@435 | 1689 | } |
duke@435 | 1690 | // check if we could do inlining |
duke@435 | 1691 | if (!PatchALot && Inline && klass->is_loaded() && |
duke@435 | 1692 | (klass->is_initialized() || klass->is_interface() && target->holder()->is_initialized()) |
duke@435 | 1693 | && target->will_link(klass, callee_holder, code)) { |
duke@435 | 1694 | // callee is known => check if we have static binding |
duke@435 | 1695 | assert(target->is_loaded(), "callee must be known"); |
duke@435 | 1696 | if (code == Bytecodes::_invokestatic |
duke@435 | 1697 | || code == Bytecodes::_invokespecial |
duke@435 | 1698 | || code == Bytecodes::_invokevirtual && target->is_final_method() |
duke@435 | 1699 | ) { |
duke@435 | 1700 | // static binding => check if callee is ok |
duke@435 | 1701 | ciMethod* inline_target = (cha_monomorphic_target != NULL) |
duke@435 | 1702 | ? cha_monomorphic_target |
duke@435 | 1703 | : target; |
duke@435 | 1704 | bool res = try_inline(inline_target, (cha_monomorphic_target != NULL) || (exact_target != NULL)); |
duke@435 | 1705 | CHECK_BAILOUT(); |
duke@435 | 1706 | |
duke@435 | 1707 | #ifndef PRODUCT |
duke@435 | 1708 | // printing |
duke@435 | 1709 | if (PrintInlining && !res) { |
duke@435 | 1710 | // if it was successfully inlined, then it was already printed. |
duke@435 | 1711 | print_inline_result(inline_target, res); |
duke@435 | 1712 | } |
duke@435 | 1713 | #endif |
duke@435 | 1714 | clear_inline_bailout(); |
duke@435 | 1715 | if (res) { |
duke@435 | 1716 | // Register dependence if JVMTI has either breakpoint |
duke@435 | 1717 | // setting or hotswapping of methods capabilities since they may |
duke@435 | 1718 | // cause deoptimization. |
kvn@1215 | 1719 | if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) { |
duke@435 | 1720 | dependency_recorder()->assert_evol_method(inline_target); |
duke@435 | 1721 | } |
duke@435 | 1722 | return; |
duke@435 | 1723 | } |
duke@435 | 1724 | } |
duke@435 | 1725 | } |
duke@435 | 1726 | // If we attempted an inline which did not succeed because of a |
duke@435 | 1727 | // bailout during construction of the callee graph, the entire |
duke@435 | 1728 | // compilation has to be aborted. This is fairly rare and currently |
duke@435 | 1729 | // seems to only occur for jasm-generated classes which contain |
duke@435 | 1730 | // jsr/ret pairs which are not associated with finally clauses and |
duke@435 | 1731 | // do not have exception handlers in the containing method, and are |
duke@435 | 1732 | // therefore not caught early enough to abort the inlining without |
duke@435 | 1733 | // corrupting the graph. (We currently bail out with a non-empty |
duke@435 | 1734 | // stack at a ret in these situations.) |
duke@435 | 1735 | CHECK_BAILOUT(); |
duke@435 | 1736 | |
duke@435 | 1737 | // inlining not successful => standard invoke |
twisti@1730 | 1738 | bool is_loaded = target->is_loaded(); |
twisti@1730 | 1739 | bool has_receiver = |
twisti@1730 | 1740 | code == Bytecodes::_invokespecial || |
twisti@1730 | 1741 | code == Bytecodes::_invokevirtual || |
twisti@1730 | 1742 | code == Bytecodes::_invokeinterface; |
twisti@1730 | 1743 | bool is_invokedynamic = code == Bytecodes::_invokedynamic; |
duke@435 | 1744 | ValueType* result_type = as_ValueType(target->return_type()); |
twisti@1730 | 1745 | |
twisti@1730 | 1746 | // We require the debug info to be the "state before" because |
twisti@1730 | 1747 | // invokedynamics may deoptimize. |
roland@2174 | 1748 | ValueStack* state_before = is_invokedynamic ? copy_state_before() : copy_state_exhandling(); |
twisti@1730 | 1749 | |
duke@435 | 1750 | Values* args = state()->pop_arguments(target->arg_size_no_receiver()); |
twisti@1730 | 1751 | Value recv = has_receiver ? apop() : NULL; |
duke@435 | 1752 | int vtable_index = methodOopDesc::invalid_vtable_index; |
duke@435 | 1753 | |
duke@435 | 1754 | #ifdef SPARC |
duke@435 | 1755 | // Currently only supported on Sparc. |
duke@435 | 1756 | // The UseInlineCaches only controls dispatch to invokevirtuals for |
duke@435 | 1757 | // loaded classes which we weren't able to statically bind. |
duke@435 | 1758 | if (!UseInlineCaches && is_loaded && code == Bytecodes::_invokevirtual |
duke@435 | 1759 | && !target->can_be_statically_bound()) { |
duke@435 | 1760 | // Find a vtable index if one is available |
duke@435 | 1761 | vtable_index = target->resolve_vtable_index(calling_klass, callee_holder); |
duke@435 | 1762 | } |
duke@435 | 1763 | #endif |
duke@435 | 1764 | |
duke@435 | 1765 | if (recv != NULL && |
duke@435 | 1766 | (code == Bytecodes::_invokespecial || |
iveresov@2138 | 1767 | !is_loaded || target->is_final())) { |
duke@435 | 1768 | // invokespecial always needs a NULL check. invokevirtual where |
duke@435 | 1769 | // the target is final or where it's not known that whether the |
duke@435 | 1770 | // target is final requires a NULL check. Otherwise normal |
duke@435 | 1771 | // invokevirtual will perform the null check during the lookup |
duke@435 | 1772 | // logic or the unverified entry point. Profiling of calls |
duke@435 | 1773 | // requires that the null check is performed in all cases. |
duke@435 | 1774 | null_check(recv); |
duke@435 | 1775 | } |
duke@435 | 1776 | |
iveresov@2138 | 1777 | if (is_profiling()) { |
iveresov@2138 | 1778 | if (recv != NULL && profile_calls()) { |
iveresov@2138 | 1779 | null_check(recv); |
duke@435 | 1780 | } |
iveresov@2138 | 1781 | // Note that we'd collect profile data in this method if we wanted it. |
iveresov@2138 | 1782 | compilation()->set_would_profile(true); |
iveresov@2138 | 1783 | |
iveresov@2138 | 1784 | if (profile_calls()) { |
iveresov@2138 | 1785 | assert(cha_monomorphic_target == NULL || exact_target == NULL, "both can not be set"); |
iveresov@2138 | 1786 | ciKlass* target_klass = NULL; |
iveresov@2138 | 1787 | if (cha_monomorphic_target != NULL) { |
iveresov@2138 | 1788 | target_klass = cha_monomorphic_target->holder(); |
iveresov@2138 | 1789 | } else if (exact_target != NULL) { |
iveresov@2138 | 1790 | target_klass = exact_target->holder(); |
iveresov@2138 | 1791 | } |
iveresov@2138 | 1792 | profile_call(recv, target_klass); |
iveresov@2138 | 1793 | } |
duke@435 | 1794 | } |
duke@435 | 1795 | |
twisti@1730 | 1796 | Invoke* result = new Invoke(code, result_type, recv, args, vtable_index, target, state_before); |
duke@435 | 1797 | // push result |
duke@435 | 1798 | append_split(result); |
duke@435 | 1799 | |
duke@435 | 1800 | if (result_type != voidType) { |
duke@435 | 1801 | if (method()->is_strict()) { |
duke@435 | 1802 | push(result_type, round_fp(result)); |
duke@435 | 1803 | } else { |
duke@435 | 1804 | push(result_type, result); |
duke@435 | 1805 | } |
duke@435 | 1806 | } |
duke@435 | 1807 | } |
duke@435 | 1808 | |
duke@435 | 1809 | |
duke@435 | 1810 | void GraphBuilder::new_instance(int klass_index) { |
roland@2174 | 1811 | ValueStack* state_before = copy_state_exhandling(); |
duke@435 | 1812 | bool will_link; |
duke@435 | 1813 | ciKlass* klass = stream()->get_klass(will_link); |
duke@435 | 1814 | assert(klass->is_instance_klass(), "must be an instance klass"); |
roland@2174 | 1815 | NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before); |
duke@435 | 1816 | _memory->new_instance(new_instance); |
duke@435 | 1817 | apush(append_split(new_instance)); |
duke@435 | 1818 | } |
duke@435 | 1819 | |
duke@435 | 1820 | |
duke@435 | 1821 | void GraphBuilder::new_type_array() { |
roland@2174 | 1822 | ValueStack* state_before = copy_state_exhandling(); |
roland@2174 | 1823 | apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before))); |
duke@435 | 1824 | } |
duke@435 | 1825 | |
duke@435 | 1826 | |
duke@435 | 1827 | void GraphBuilder::new_object_array() { |
duke@435 | 1828 | bool will_link; |
duke@435 | 1829 | ciKlass* klass = stream()->get_klass(will_link); |
roland@2174 | 1830 | ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling(); |
duke@435 | 1831 | NewArray* n = new NewObjectArray(klass, ipop(), state_before); |
duke@435 | 1832 | apush(append_split(n)); |
duke@435 | 1833 | } |
duke@435 | 1834 | |
duke@435 | 1835 | |
duke@435 | 1836 | bool GraphBuilder::direct_compare(ciKlass* k) { |
duke@435 | 1837 | if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) { |
duke@435 | 1838 | ciInstanceKlass* ik = k->as_instance_klass(); |
duke@435 | 1839 | if (ik->is_final()) { |
duke@435 | 1840 | return true; |
duke@435 | 1841 | } else { |
duke@435 | 1842 | if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) { |
duke@435 | 1843 | // test class is leaf class |
duke@435 | 1844 | dependency_recorder()->assert_leaf_type(ik); |
duke@435 | 1845 | return true; |
duke@435 | 1846 | } |
duke@435 | 1847 | } |
duke@435 | 1848 | } |
duke@435 | 1849 | return false; |
duke@435 | 1850 | } |
duke@435 | 1851 | |
duke@435 | 1852 | |
duke@435 | 1853 | void GraphBuilder::check_cast(int klass_index) { |
duke@435 | 1854 | bool will_link; |
duke@435 | 1855 | ciKlass* klass = stream()->get_klass(will_link); |
roland@2174 | 1856 | ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception(); |
duke@435 | 1857 | CheckCast* c = new CheckCast(klass, apop(), state_before); |
duke@435 | 1858 | apush(append_split(c)); |
duke@435 | 1859 | c->set_direct_compare(direct_compare(klass)); |
iveresov@2138 | 1860 | |
iveresov@2138 | 1861 | if (is_profiling()) { |
iveresov@2138 | 1862 | // Note that we'd collect profile data in this method if we wanted it. |
iveresov@2138 | 1863 | compilation()->set_would_profile(true); |
iveresov@2138 | 1864 | |
iveresov@2138 | 1865 | if (profile_checkcasts()) { |
iveresov@2138 | 1866 | c->set_profiled_method(method()); |
iveresov@2138 | 1867 | c->set_profiled_bci(bci()); |
iveresov@2138 | 1868 | c->set_should_profile(true); |
iveresov@2138 | 1869 | } |
duke@435 | 1870 | } |
duke@435 | 1871 | } |
duke@435 | 1872 | |
duke@435 | 1873 | |
duke@435 | 1874 | void GraphBuilder::instance_of(int klass_index) { |
duke@435 | 1875 | bool will_link; |
duke@435 | 1876 | ciKlass* klass = stream()->get_klass(will_link); |
roland@2174 | 1877 | ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling(); |
duke@435 | 1878 | InstanceOf* i = new InstanceOf(klass, apop(), state_before); |
duke@435 | 1879 | ipush(append_split(i)); |
duke@435 | 1880 | i->set_direct_compare(direct_compare(klass)); |
iveresov@2146 | 1881 | |
iveresov@2146 | 1882 | if (is_profiling()) { |
iveresov@2146 | 1883 | // Note that we'd collect profile data in this method if we wanted it. |
iveresov@2146 | 1884 | compilation()->set_would_profile(true); |
iveresov@2146 | 1885 | |
iveresov@2146 | 1886 | if (profile_checkcasts()) { |
iveresov@2146 | 1887 | i->set_profiled_method(method()); |
iveresov@2146 | 1888 | i->set_profiled_bci(bci()); |
iveresov@2146 | 1889 | i->set_should_profile(true); |
iveresov@2146 | 1890 | } |
iveresov@2146 | 1891 | } |
duke@435 | 1892 | } |
duke@435 | 1893 | |
duke@435 | 1894 | |
duke@435 | 1895 | void GraphBuilder::monitorenter(Value x, int bci) { |
duke@435 | 1896 | // save state before locking in case of deoptimization after a NullPointerException |
roland@2174 | 1897 | ValueStack* state_before = copy_state_for_exception_with_bci(bci); |
roland@2174 | 1898 | append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci); |
duke@435 | 1899 | kill_all(); |
duke@435 | 1900 | } |
duke@435 | 1901 | |
duke@435 | 1902 | |
duke@435 | 1903 | void GraphBuilder::monitorexit(Value x, int bci) { |
duke@435 | 1904 | append_with_bci(new MonitorExit(x, state()->unlock()), bci); |
duke@435 | 1905 | kill_all(); |
duke@435 | 1906 | } |
duke@435 | 1907 | |
duke@435 | 1908 | |
duke@435 | 1909 | void GraphBuilder::new_multi_array(int dimensions) { |
duke@435 | 1910 | bool will_link; |
duke@435 | 1911 | ciKlass* klass = stream()->get_klass(will_link); |
roland@2174 | 1912 | ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling(); |
duke@435 | 1913 | |
duke@435 | 1914 | Values* dims = new Values(dimensions, NULL); |
duke@435 | 1915 | // fill in all dimensions |
duke@435 | 1916 | int i = dimensions; |
duke@435 | 1917 | while (i-- > 0) dims->at_put(i, ipop()); |
duke@435 | 1918 | // create array |
duke@435 | 1919 | NewArray* n = new NewMultiArray(klass, dims, state_before); |
duke@435 | 1920 | apush(append_split(n)); |
duke@435 | 1921 | } |
duke@435 | 1922 | |
duke@435 | 1923 | |
duke@435 | 1924 | void GraphBuilder::throw_op(int bci) { |
duke@435 | 1925 | // We require that the debug info for a Throw be the "state before" |
duke@435 | 1926 | // the Throw (i.e., exception oop is still on TOS) |
roland@2174 | 1927 | ValueStack* state_before = copy_state_before_with_bci(bci); |
duke@435 | 1928 | Throw* t = new Throw(apop(), state_before); |
roland@2174 | 1929 | // operand stack not needed after a throw |
roland@2174 | 1930 | state()->truncate_stack(0); |
duke@435 | 1931 | append_with_bci(t, bci); |
duke@435 | 1932 | } |
duke@435 | 1933 | |
duke@435 | 1934 | |
duke@435 | 1935 | Value GraphBuilder::round_fp(Value fp_value) { |
duke@435 | 1936 | // no rounding needed if SSE2 is used |
duke@435 | 1937 | if (RoundFPResults && UseSSE < 2) { |
duke@435 | 1938 | // Must currently insert rounding node for doubleword values that |
duke@435 | 1939 | // are results of expressions (i.e., not loads from memory or |
duke@435 | 1940 | // constants) |
duke@435 | 1941 | if (fp_value->type()->tag() == doubleTag && |
duke@435 | 1942 | fp_value->as_Constant() == NULL && |
duke@435 | 1943 | fp_value->as_Local() == NULL && // method parameters need no rounding |
duke@435 | 1944 | fp_value->as_RoundFP() == NULL) { |
duke@435 | 1945 | return append(new RoundFP(fp_value)); |
duke@435 | 1946 | } |
duke@435 | 1947 | } |
duke@435 | 1948 | return fp_value; |
duke@435 | 1949 | } |
duke@435 | 1950 | |
duke@435 | 1951 | |
duke@435 | 1952 | Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) { |
iveresov@2138 | 1953 | Canonicalizer canon(compilation(), instr, bci); |
duke@435 | 1954 | Instruction* i1 = canon.canonical(); |
roland@2174 | 1955 | if (i1->is_linked() || !i1->can_be_linked()) { |
duke@435 | 1956 | // Canonicalizer returned an instruction which was already |
duke@435 | 1957 | // appended so simply return it. |
duke@435 | 1958 | return i1; |
roland@2174 | 1959 | } |
roland@2174 | 1960 | |
roland@2174 | 1961 | if (UseLocalValueNumbering) { |
duke@435 | 1962 | // Lookup the instruction in the ValueMap and add it to the map if |
duke@435 | 1963 | // it's not found. |
duke@435 | 1964 | Instruction* i2 = vmap()->find_insert(i1); |
duke@435 | 1965 | if (i2 != i1) { |
duke@435 | 1966 | // found an entry in the value map, so just return it. |
roland@2174 | 1967 | assert(i2->is_linked(), "should already be linked"); |
duke@435 | 1968 | return i2; |
duke@435 | 1969 | } |
never@894 | 1970 | ValueNumberingEffects vne(vmap()); |
never@894 | 1971 | i1->visit(&vne); |
duke@435 | 1972 | } |
duke@435 | 1973 | |
roland@2174 | 1974 | // i1 was not eliminated => append it |
roland@2174 | 1975 | assert(i1->next() == NULL, "shouldn't already be linked"); |
roland@2174 | 1976 | _last = _last->set_next(i1, canon.bci()); |
roland@2174 | 1977 | |
roland@2174 | 1978 | if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) { |
roland@2174 | 1979 | // set the bailout state but complete normal processing. We |
roland@2174 | 1980 | // might do a little more work before noticing the bailout so we |
roland@2174 | 1981 | // want processing to continue normally until it's noticed. |
roland@2174 | 1982 | bailout("Method and/or inlining is too large"); |
roland@2174 | 1983 | } |
roland@2174 | 1984 | |
roland@2174 | 1985 | #ifndef PRODUCT |
roland@2174 | 1986 | if (PrintIRDuringConstruction) { |
roland@2174 | 1987 | InstructionPrinter ip; |
roland@2174 | 1988 | ip.print_line(i1); |
roland@2174 | 1989 | if (Verbose) { |
roland@2174 | 1990 | state()->print(); |
duke@435 | 1991 | } |
roland@2174 | 1992 | } |
roland@2174 | 1993 | #endif |
roland@2174 | 1994 | |
roland@2174 | 1995 | // save state after modification of operand stack for StateSplit instructions |
roland@2174 | 1996 | StateSplit* s = i1->as_StateSplit(); |
roland@2174 | 1997 | if (s != NULL) { |
roland@2174 | 1998 | if (EliminateFieldAccess) { |
roland@2174 | 1999 | Intrinsic* intrinsic = s->as_Intrinsic(); |
roland@2174 | 2000 | if (s->as_Invoke() != NULL || (intrinsic && !intrinsic->preserves_state())) { |
roland@2174 | 2001 | _memory->kill(); |
duke@435 | 2002 | } |
duke@435 | 2003 | } |
roland@2174 | 2004 | s->set_state(state()->copy(ValueStack::StateAfter, canon.bci())); |
roland@2174 | 2005 | } |
roland@2174 | 2006 | |
roland@2174 | 2007 | // set up exception handlers for this instruction if necessary |
roland@2174 | 2008 | if (i1->can_trap()) { |
roland@2174 | 2009 | i1->set_exception_handlers(handle_exception(i1)); |
roland@2174 | 2010 | assert(i1->exception_state() != NULL || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state"); |
duke@435 | 2011 | } |
duke@435 | 2012 | return i1; |
duke@435 | 2013 | } |
duke@435 | 2014 | |
duke@435 | 2015 | |
duke@435 | 2016 | Instruction* GraphBuilder::append(Instruction* instr) { |
duke@435 | 2017 | assert(instr->as_StateSplit() == NULL || instr->as_BlockEnd() != NULL, "wrong append used"); |
duke@435 | 2018 | return append_with_bci(instr, bci()); |
duke@435 | 2019 | } |
duke@435 | 2020 | |
duke@435 | 2021 | |
duke@435 | 2022 | Instruction* GraphBuilder::append_split(StateSplit* instr) { |
duke@435 | 2023 | return append_with_bci(instr, bci()); |
duke@435 | 2024 | } |
duke@435 | 2025 | |
duke@435 | 2026 | |
duke@435 | 2027 | void GraphBuilder::null_check(Value value) { |
duke@435 | 2028 | if (value->as_NewArray() != NULL || value->as_NewInstance() != NULL) { |
duke@435 | 2029 | return; |
duke@435 | 2030 | } else { |
duke@435 | 2031 | Constant* con = value->as_Constant(); |
duke@435 | 2032 | if (con) { |
duke@435 | 2033 | ObjectType* c = con->type()->as_ObjectType(); |
duke@435 | 2034 | if (c && c->is_loaded()) { |
duke@435 | 2035 | ObjectConstant* oc = c->as_ObjectConstant(); |
duke@435 | 2036 | if (!oc || !oc->value()->is_null_object()) { |
duke@435 | 2037 | return; |
duke@435 | 2038 | } |
duke@435 | 2039 | } |
duke@435 | 2040 | } |
duke@435 | 2041 | } |
roland@2174 | 2042 | append(new NullCheck(value, copy_state_for_exception())); |
duke@435 | 2043 | } |
duke@435 | 2044 | |
duke@435 | 2045 | |
duke@435 | 2046 | |
roland@2174 | 2047 | XHandlers* GraphBuilder::handle_exception(Instruction* instruction) { |
roland@2174 | 2048 | if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != NULL)) { |
roland@2174 | 2049 | assert(instruction->exception_state() == NULL |
roland@2174 | 2050 | || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState |
roland@2174 | 2051 | || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->jvmti_can_access_local_variables()), |
roland@2174 | 2052 | "exception_state should be of exception kind"); |
duke@435 | 2053 | return new XHandlers(); |
duke@435 | 2054 | } |
duke@435 | 2055 | |
duke@435 | 2056 | XHandlers* exception_handlers = new XHandlers(); |
duke@435 | 2057 | ScopeData* cur_scope_data = scope_data(); |
roland@2174 | 2058 | ValueStack* cur_state = instruction->state_before(); |
roland@2174 | 2059 | ValueStack* prev_state = NULL; |
duke@435 | 2060 | int scope_count = 0; |
duke@435 | 2061 | |
roland@2174 | 2062 | assert(cur_state != NULL, "state_before must be set"); |
duke@435 | 2063 | do { |
roland@2174 | 2064 | int cur_bci = cur_state->bci(); |
roland@2174 | 2065 | assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match"); |
duke@435 | 2066 | assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci"); |
duke@435 | 2067 | |
duke@435 | 2068 | // join with all potential exception handlers |
duke@435 | 2069 | XHandlers* list = cur_scope_data->xhandlers(); |
duke@435 | 2070 | const int n = list->length(); |
duke@435 | 2071 | for (int i = 0; i < n; i++) { |
duke@435 | 2072 | XHandler* h = list->handler_at(i); |
duke@435 | 2073 | if (h->covers(cur_bci)) { |
duke@435 | 2074 | // h is a potential exception handler => join it |
duke@435 | 2075 | compilation()->set_has_exception_handlers(true); |
duke@435 | 2076 | |
duke@435 | 2077 | BlockBegin* entry = h->entry_block(); |
duke@435 | 2078 | if (entry == block()) { |
duke@435 | 2079 | // It's acceptable for an exception handler to cover itself |
duke@435 | 2080 | // but we don't handle that in the parser currently. It's |
duke@435 | 2081 | // very rare so we bailout instead of trying to handle it. |
duke@435 | 2082 | BAILOUT_("exception handler covers itself", exception_handlers); |
duke@435 | 2083 | } |
duke@435 | 2084 | assert(entry->bci() == h->handler_bci(), "must match"); |
duke@435 | 2085 | assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond"); |
duke@435 | 2086 | |
duke@435 | 2087 | // previously this was a BAILOUT, but this is not necessary |
duke@435 | 2088 | // now because asynchronous exceptions are not handled this way. |
roland@2174 | 2089 | assert(entry->state() == NULL || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match"); |
duke@435 | 2090 | |
duke@435 | 2091 | // xhandler start with an empty expression stack |
roland@2174 | 2092 | if (cur_state->stack_size() != 0) { |
roland@2174 | 2093 | cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci()); |
roland@2174 | 2094 | } |
roland@2174 | 2095 | if (instruction->exception_state() == NULL) { |
roland@2174 | 2096 | instruction->set_exception_state(cur_state); |
roland@2174 | 2097 | } |
duke@435 | 2098 | |
duke@435 | 2099 | // Note: Usually this join must work. However, very |
duke@435 | 2100 | // complicated jsr-ret structures where we don't ret from |
duke@435 | 2101 | // the subroutine can cause the objects on the monitor |
duke@435 | 2102 | // stacks to not match because blocks can be parsed twice. |
duke@435 | 2103 | // The only test case we've seen so far which exhibits this |
duke@435 | 2104 | // problem is caught by the infinite recursion test in |
duke@435 | 2105 | // GraphBuilder::jsr() if the join doesn't work. |
roland@2174 | 2106 | if (!entry->try_merge(cur_state)) { |
duke@435 | 2107 | BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers); |
duke@435 | 2108 | } |
duke@435 | 2109 | |
duke@435 | 2110 | // add current state for correct handling of phi functions at begin of xhandler |
roland@2174 | 2111 | int phi_operand = entry->add_exception_state(cur_state); |
duke@435 | 2112 | |
duke@435 | 2113 | // add entry to the list of xhandlers of this block |
duke@435 | 2114 | _block->add_exception_handler(entry); |
duke@435 | 2115 | |
duke@435 | 2116 | // add back-edge from xhandler entry to this block |
duke@435 | 2117 | if (!entry->is_predecessor(_block)) { |
duke@435 | 2118 | entry->add_predecessor(_block); |
duke@435 | 2119 | } |
duke@435 | 2120 | |
duke@435 | 2121 | // clone XHandler because phi_operand and scope_count can not be shared |
duke@435 | 2122 | XHandler* new_xhandler = new XHandler(h); |
duke@435 | 2123 | new_xhandler->set_phi_operand(phi_operand); |
duke@435 | 2124 | new_xhandler->set_scope_count(scope_count); |
duke@435 | 2125 | exception_handlers->append(new_xhandler); |
duke@435 | 2126 | |
duke@435 | 2127 | // fill in exception handler subgraph lazily |
duke@435 | 2128 | assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet"); |
duke@435 | 2129 | cur_scope_data->add_to_work_list(entry); |
duke@435 | 2130 | |
duke@435 | 2131 | // stop when reaching catchall |
duke@435 | 2132 | if (h->catch_type() == 0) { |
duke@435 | 2133 | return exception_handlers; |
duke@435 | 2134 | } |
duke@435 | 2135 | } |
duke@435 | 2136 | } |
duke@435 | 2137 | |
roland@2174 | 2138 | if (exception_handlers->length() == 0) { |
roland@2174 | 2139 | // This scope and all callees do not handle exceptions, so the local |
roland@2174 | 2140 | // variables of this scope are not needed. However, the scope itself is |
roland@2174 | 2141 | // required for a correct exception stack trace -> clear out the locals. |
roland@2174 | 2142 | if (_compilation->env()->jvmti_can_access_local_variables()) { |
roland@2174 | 2143 | cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci()); |
roland@2174 | 2144 | } else { |
roland@2174 | 2145 | cur_state = cur_state->copy(ValueStack::EmptyExceptionState, cur_state->bci()); |
roland@2174 | 2146 | } |
roland@2174 | 2147 | if (prev_state != NULL) { |
roland@2174 | 2148 | prev_state->set_caller_state(cur_state); |
roland@2174 | 2149 | } |
roland@2174 | 2150 | if (instruction->exception_state() == NULL) { |
roland@2174 | 2151 | instruction->set_exception_state(cur_state); |
roland@2174 | 2152 | } |
roland@2174 | 2153 | } |
roland@2174 | 2154 | |
duke@435 | 2155 | // Set up iteration for next time. |
duke@435 | 2156 | // If parsing a jsr, do not grab exception handlers from the |
duke@435 | 2157 | // parent scopes for this method (already got them, and they |
duke@435 | 2158 | // needed to be cloned) |
roland@2174 | 2159 | |
roland@2174 | 2160 | while (cur_scope_data->parsing_jsr()) { |
roland@2174 | 2161 | cur_scope_data = cur_scope_data->parent(); |
duke@435 | 2162 | } |
roland@2174 | 2163 | |
roland@2174 | 2164 | assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match"); |
roland@2174 | 2165 | assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler"); |
roland@2174 | 2166 | |
roland@2174 | 2167 | prev_state = cur_state; |
roland@2174 | 2168 | cur_state = cur_state->caller_state(); |
roland@2174 | 2169 | cur_scope_data = cur_scope_data->parent(); |
roland@2174 | 2170 | scope_count++; |
duke@435 | 2171 | } while (cur_scope_data != NULL); |
duke@435 | 2172 | |
duke@435 | 2173 | return exception_handlers; |
duke@435 | 2174 | } |
duke@435 | 2175 | |
duke@435 | 2176 | |
duke@435 | 2177 | // Helper class for simplifying Phis. |
duke@435 | 2178 | class PhiSimplifier : public BlockClosure { |
duke@435 | 2179 | private: |
duke@435 | 2180 | bool _has_substitutions; |
duke@435 | 2181 | Value simplify(Value v); |
duke@435 | 2182 | |
duke@435 | 2183 | public: |
duke@435 | 2184 | PhiSimplifier(BlockBegin* start) : _has_substitutions(false) { |
duke@435 | 2185 | start->iterate_preorder(this); |
duke@435 | 2186 | if (_has_substitutions) { |
duke@435 | 2187 | SubstitutionResolver sr(start); |
duke@435 | 2188 | } |
duke@435 | 2189 | } |
duke@435 | 2190 | void block_do(BlockBegin* b); |
duke@435 | 2191 | bool has_substitutions() const { return _has_substitutions; } |
duke@435 | 2192 | }; |
duke@435 | 2193 | |
duke@435 | 2194 | |
duke@435 | 2195 | Value PhiSimplifier::simplify(Value v) { |
duke@435 | 2196 | Phi* phi = v->as_Phi(); |
duke@435 | 2197 | |
duke@435 | 2198 | if (phi == NULL) { |
duke@435 | 2199 | // no phi function |
duke@435 | 2200 | return v; |
duke@435 | 2201 | } else if (v->has_subst()) { |
duke@435 | 2202 | // already substituted; subst can be phi itself -> simplify |
duke@435 | 2203 | return simplify(v->subst()); |
duke@435 | 2204 | } else if (phi->is_set(Phi::cannot_simplify)) { |
duke@435 | 2205 | // already tried to simplify phi before |
duke@435 | 2206 | return phi; |
duke@435 | 2207 | } else if (phi->is_set(Phi::visited)) { |
duke@435 | 2208 | // break cycles in phi functions |
duke@435 | 2209 | return phi; |
duke@435 | 2210 | } else if (phi->type()->is_illegal()) { |
duke@435 | 2211 | // illegal phi functions are ignored anyway |
duke@435 | 2212 | return phi; |
duke@435 | 2213 | |
duke@435 | 2214 | } else { |
duke@435 | 2215 | // mark phi function as processed to break cycles in phi functions |
duke@435 | 2216 | phi->set(Phi::visited); |
duke@435 | 2217 | |
duke@435 | 2218 | // simplify x = [y, x] and x = [y, y] to y |
duke@435 | 2219 | Value subst = NULL; |
duke@435 | 2220 | int opd_count = phi->operand_count(); |
duke@435 | 2221 | for (int i = 0; i < opd_count; i++) { |
duke@435 | 2222 | Value opd = phi->operand_at(i); |
duke@435 | 2223 | assert(opd != NULL, "Operand must exist!"); |
duke@435 | 2224 | |
duke@435 | 2225 | if (opd->type()->is_illegal()) { |
duke@435 | 2226 | // if one operand is illegal, the entire phi function is illegal |
duke@435 | 2227 | phi->make_illegal(); |
duke@435 | 2228 | phi->clear(Phi::visited); |
duke@435 | 2229 | return phi; |
duke@435 | 2230 | } |
duke@435 | 2231 | |
duke@435 | 2232 | Value new_opd = simplify(opd); |
duke@435 | 2233 | assert(new_opd != NULL, "Simplified operand must exist!"); |
duke@435 | 2234 | |
duke@435 | 2235 | if (new_opd != phi && new_opd != subst) { |
duke@435 | 2236 | if (subst == NULL) { |
duke@435 | 2237 | subst = new_opd; |
duke@435 | 2238 | } else { |
duke@435 | 2239 | // no simplification possible |
duke@435 | 2240 | phi->set(Phi::cannot_simplify); |
duke@435 | 2241 | phi->clear(Phi::visited); |
duke@435 | 2242 | return phi; |
duke@435 | 2243 | } |
duke@435 | 2244 | } |
duke@435 | 2245 | } |
duke@435 | 2246 | |
duke@435 | 2247 | // sucessfully simplified phi function |
duke@435 | 2248 | assert(subst != NULL, "illegal phi function"); |
duke@435 | 2249 | _has_substitutions = true; |
duke@435 | 2250 | phi->clear(Phi::visited); |
duke@435 | 2251 | phi->set_subst(subst); |
duke@435 | 2252 | |
duke@435 | 2253 | #ifndef PRODUCT |
duke@435 | 2254 | if (PrintPhiFunctions) { |
duke@435 | 2255 | tty->print_cr("simplified phi function %c%d to %c%d (Block B%d)", phi->type()->tchar(), phi->id(), subst->type()->tchar(), subst->id(), phi->block()->block_id()); |
duke@435 | 2256 | } |
duke@435 | 2257 | #endif |
duke@435 | 2258 | |
duke@435 | 2259 | return subst; |
duke@435 | 2260 | } |
duke@435 | 2261 | } |
duke@435 | 2262 | |
duke@435 | 2263 | |
duke@435 | 2264 | void PhiSimplifier::block_do(BlockBegin* b) { |
duke@435 | 2265 | for_each_phi_fun(b, phi, |
duke@435 | 2266 | simplify(phi); |
duke@435 | 2267 | ); |
duke@435 | 2268 | |
duke@435 | 2269 | #ifdef ASSERT |
duke@435 | 2270 | for_each_phi_fun(b, phi, |
duke@435 | 2271 | assert(phi->operand_count() != 1 || phi->subst() != phi, "missed trivial simplification"); |
duke@435 | 2272 | ); |
duke@435 | 2273 | |
duke@435 | 2274 | ValueStack* state = b->state()->caller_state(); |
roland@2174 | 2275 | for_each_state_value(state, value, |
roland@2174 | 2276 | Phi* phi = value->as_Phi(); |
roland@2174 | 2277 | assert(phi == NULL || phi->block() != b, "must not have phi function to simplify in caller state"); |
roland@2174 | 2278 | ); |
duke@435 | 2279 | #endif |
duke@435 | 2280 | } |
duke@435 | 2281 | |
duke@435 | 2282 | // This method is called after all blocks are filled with HIR instructions |
duke@435 | 2283 | // It eliminates all Phi functions of the form x = [y, y] and x = [y, x] |
duke@435 | 2284 | void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) { |
duke@435 | 2285 | PhiSimplifier simplifier(start); |
duke@435 | 2286 | } |
duke@435 | 2287 | |
duke@435 | 2288 | |
duke@435 | 2289 | void GraphBuilder::connect_to_end(BlockBegin* beg) { |
duke@435 | 2290 | // setup iteration |
duke@435 | 2291 | kill_all(); |
duke@435 | 2292 | _block = beg; |
roland@2174 | 2293 | _state = beg->state()->copy_for_parsing(); |
duke@435 | 2294 | _last = beg; |
duke@435 | 2295 | iterate_bytecodes_for_block(beg->bci()); |
duke@435 | 2296 | } |
duke@435 | 2297 | |
duke@435 | 2298 | |
duke@435 | 2299 | BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) { |
duke@435 | 2300 | #ifndef PRODUCT |
duke@435 | 2301 | if (PrintIRDuringConstruction) { |
duke@435 | 2302 | tty->cr(); |
duke@435 | 2303 | InstructionPrinter ip; |
duke@435 | 2304 | ip.print_instr(_block); tty->cr(); |
duke@435 | 2305 | ip.print_stack(_block->state()); tty->cr(); |
duke@435 | 2306 | ip.print_inline_level(_block); |
duke@435 | 2307 | ip.print_head(); |
duke@435 | 2308 | tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size()); |
duke@435 | 2309 | } |
duke@435 | 2310 | #endif |
duke@435 | 2311 | _skip_block = false; |
duke@435 | 2312 | assert(state() != NULL, "ValueStack missing!"); |
duke@435 | 2313 | ciBytecodeStream s(method()); |
duke@435 | 2314 | s.reset_to_bci(bci); |
duke@435 | 2315 | int prev_bci = bci; |
duke@435 | 2316 | scope_data()->set_stream(&s); |
duke@435 | 2317 | // iterate |
duke@435 | 2318 | Bytecodes::Code code = Bytecodes::_illegal; |
duke@435 | 2319 | bool push_exception = false; |
duke@435 | 2320 | |
duke@435 | 2321 | if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == NULL) { |
duke@435 | 2322 | // first thing in the exception entry block should be the exception object. |
duke@435 | 2323 | push_exception = true; |
duke@435 | 2324 | } |
duke@435 | 2325 | |
duke@435 | 2326 | while (!bailed_out() && last()->as_BlockEnd() == NULL && |
duke@435 | 2327 | (code = stream()->next()) != ciBytecodeStream::EOBC() && |
duke@435 | 2328 | (block_at(s.cur_bci()) == NULL || block_at(s.cur_bci()) == block())) { |
roland@2174 | 2329 | assert(state()->kind() == ValueStack::Parsing, "invalid state kind"); |
duke@435 | 2330 | |
duke@435 | 2331 | // Check for active jsr during OSR compilation |
duke@435 | 2332 | if (compilation()->is_osr_compile() |
duke@435 | 2333 | && scope()->is_top_scope() |
duke@435 | 2334 | && parsing_jsr() |
duke@435 | 2335 | && s.cur_bci() == compilation()->osr_bci()) { |
duke@435 | 2336 | bailout("OSR not supported while a jsr is active"); |
duke@435 | 2337 | } |
duke@435 | 2338 | |
duke@435 | 2339 | if (push_exception) { |
duke@435 | 2340 | apush(append(new ExceptionObject())); |
duke@435 | 2341 | push_exception = false; |
duke@435 | 2342 | } |
duke@435 | 2343 | |
duke@435 | 2344 | // handle bytecode |
duke@435 | 2345 | switch (code) { |
duke@435 | 2346 | case Bytecodes::_nop : /* nothing to do */ break; |
duke@435 | 2347 | case Bytecodes::_aconst_null : apush(append(new Constant(objectNull ))); break; |
duke@435 | 2348 | case Bytecodes::_iconst_m1 : ipush(append(new Constant(new IntConstant (-1)))); break; |
duke@435 | 2349 | case Bytecodes::_iconst_0 : ipush(append(new Constant(intZero ))); break; |
duke@435 | 2350 | case Bytecodes::_iconst_1 : ipush(append(new Constant(intOne ))); break; |
duke@435 | 2351 | case Bytecodes::_iconst_2 : ipush(append(new Constant(new IntConstant ( 2)))); break; |
duke@435 | 2352 | case Bytecodes::_iconst_3 : ipush(append(new Constant(new IntConstant ( 3)))); break; |
duke@435 | 2353 | case Bytecodes::_iconst_4 : ipush(append(new Constant(new IntConstant ( 4)))); break; |
duke@435 | 2354 | case Bytecodes::_iconst_5 : ipush(append(new Constant(new IntConstant ( 5)))); break; |
duke@435 | 2355 | case Bytecodes::_lconst_0 : lpush(append(new Constant(new LongConstant ( 0)))); break; |
duke@435 | 2356 | case Bytecodes::_lconst_1 : lpush(append(new Constant(new LongConstant ( 1)))); break; |
duke@435 | 2357 | case Bytecodes::_fconst_0 : fpush(append(new Constant(new FloatConstant ( 0)))); break; |
duke@435 | 2358 | case Bytecodes::_fconst_1 : fpush(append(new Constant(new FloatConstant ( 1)))); break; |
duke@435 | 2359 | case Bytecodes::_fconst_2 : fpush(append(new Constant(new FloatConstant ( 2)))); break; |
duke@435 | 2360 | case Bytecodes::_dconst_0 : dpush(append(new Constant(new DoubleConstant( 0)))); break; |
duke@435 | 2361 | case Bytecodes::_dconst_1 : dpush(append(new Constant(new DoubleConstant( 1)))); break; |
duke@435 | 2362 | case Bytecodes::_bipush : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break; |
duke@435 | 2363 | case Bytecodes::_sipush : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break; |
duke@435 | 2364 | case Bytecodes::_ldc : // fall through |
duke@435 | 2365 | case Bytecodes::_ldc_w : // fall through |
duke@435 | 2366 | case Bytecodes::_ldc2_w : load_constant(); break; |
duke@435 | 2367 | case Bytecodes::_iload : load_local(intType , s.get_index()); break; |
duke@435 | 2368 | case Bytecodes::_lload : load_local(longType , s.get_index()); break; |
duke@435 | 2369 | case Bytecodes::_fload : load_local(floatType , s.get_index()); break; |
duke@435 | 2370 | case Bytecodes::_dload : load_local(doubleType , s.get_index()); break; |
duke@435 | 2371 | case Bytecodes::_aload : load_local(instanceType, s.get_index()); break; |
duke@435 | 2372 | case Bytecodes::_iload_0 : load_local(intType , 0); break; |
duke@435 | 2373 | case Bytecodes::_iload_1 : load_local(intType , 1); break; |
duke@435 | 2374 | case Bytecodes::_iload_2 : load_local(intType , 2); break; |
duke@435 | 2375 | case Bytecodes::_iload_3 : load_local(intType , 3); break; |
duke@435 | 2376 | case Bytecodes::_lload_0 : load_local(longType , 0); break; |
duke@435 | 2377 | case Bytecodes::_lload_1 : load_local(longType , 1); break; |
duke@435 | 2378 | case Bytecodes::_lload_2 : load_local(longType , 2); break; |
duke@435 | 2379 | case Bytecodes::_lload_3 : load_local(longType , 3); break; |
duke@435 | 2380 | case Bytecodes::_fload_0 : load_local(floatType , 0); break; |
duke@435 | 2381 | case Bytecodes::_fload_1 : load_local(floatType , 1); break; |
duke@435 | 2382 | case Bytecodes::_fload_2 : load_local(floatType , 2); break; |
duke@435 | 2383 | case Bytecodes::_fload_3 : load_local(floatType , 3); break; |
duke@435 | 2384 | case Bytecodes::_dload_0 : load_local(doubleType, 0); break; |
duke@435 | 2385 | case Bytecodes::_dload_1 : load_local(doubleType, 1); break; |
duke@435 | 2386 | case Bytecodes::_dload_2 : load_local(doubleType, 2); break; |
duke@435 | 2387 | case Bytecodes::_dload_3 : load_local(doubleType, 3); break; |
duke@435 | 2388 | case Bytecodes::_aload_0 : load_local(objectType, 0); break; |
duke@435 | 2389 | case Bytecodes::_aload_1 : load_local(objectType, 1); break; |
duke@435 | 2390 | case Bytecodes::_aload_2 : load_local(objectType, 2); break; |
duke@435 | 2391 | case Bytecodes::_aload_3 : load_local(objectType, 3); break; |
duke@435 | 2392 | case Bytecodes::_iaload : load_indexed(T_INT ); break; |
duke@435 | 2393 | case Bytecodes::_laload : load_indexed(T_LONG ); break; |
duke@435 | 2394 | case Bytecodes::_faload : load_indexed(T_FLOAT ); break; |
duke@435 | 2395 | case Bytecodes::_daload : load_indexed(T_DOUBLE); break; |
duke@435 | 2396 | case Bytecodes::_aaload : load_indexed(T_OBJECT); break; |
duke@435 | 2397 | case Bytecodes::_baload : load_indexed(T_BYTE ); break; |
duke@435 | 2398 | case Bytecodes::_caload : load_indexed(T_CHAR ); break; |
duke@435 | 2399 | case Bytecodes::_saload : load_indexed(T_SHORT ); break; |
duke@435 | 2400 | case Bytecodes::_istore : store_local(intType , s.get_index()); break; |
duke@435 | 2401 | case Bytecodes::_lstore : store_local(longType , s.get_index()); break; |
duke@435 | 2402 | case Bytecodes::_fstore : store_local(floatType , s.get_index()); break; |
duke@435 | 2403 | case Bytecodes::_dstore : store_local(doubleType, s.get_index()); break; |
duke@435 | 2404 | case Bytecodes::_astore : store_local(objectType, s.get_index()); break; |
duke@435 | 2405 | case Bytecodes::_istore_0 : store_local(intType , 0); break; |
duke@435 | 2406 | case Bytecodes::_istore_1 : store_local(intType , 1); break; |
duke@435 | 2407 | case Bytecodes::_istore_2 : store_local(intType , 2); break; |
duke@435 | 2408 | case Bytecodes::_istore_3 : store_local(intType , 3); break; |
duke@435 | 2409 | case Bytecodes::_lstore_0 : store_local(longType , 0); break; |
duke@435 | 2410 | case Bytecodes::_lstore_1 : store_local(longType , 1); break; |
duke@435 | 2411 | case Bytecodes::_lstore_2 : store_local(longType , 2); break; |
duke@435 | 2412 | case Bytecodes::_lstore_3 : store_local(longType , 3); break; |
duke@435 | 2413 | case Bytecodes::_fstore_0 : store_local(floatType , 0); break; |
duke@435 | 2414 | case Bytecodes::_fstore_1 : store_local(floatType , 1); break; |
duke@435 | 2415 | case Bytecodes::_fstore_2 : store_local(floatType , 2); break; |
duke@435 | 2416 | case Bytecodes::_fstore_3 : store_local(floatType , 3); break; |
duke@435 | 2417 | case Bytecodes::_dstore_0 : store_local(doubleType, 0); break; |
duke@435 | 2418 | case Bytecodes::_dstore_1 : store_local(doubleType, 1); break; |
duke@435 | 2419 | case Bytecodes::_dstore_2 : store_local(doubleType, 2); break; |
duke@435 | 2420 | case Bytecodes::_dstore_3 : store_local(doubleType, 3); break; |
duke@435 | 2421 | case Bytecodes::_astore_0 : store_local(objectType, 0); break; |
duke@435 | 2422 | case Bytecodes::_astore_1 : store_local(objectType, 1); break; |
duke@435 | 2423 | case Bytecodes::_astore_2 : store_local(objectType, 2); break; |
duke@435 | 2424 | case Bytecodes::_astore_3 : store_local(objectType, 3); break; |
duke@435 | 2425 | case Bytecodes::_iastore : store_indexed(T_INT ); break; |
duke@435 | 2426 | case Bytecodes::_lastore : store_indexed(T_LONG ); break; |
duke@435 | 2427 | case Bytecodes::_fastore : store_indexed(T_FLOAT ); break; |
duke@435 | 2428 | case Bytecodes::_dastore : store_indexed(T_DOUBLE); break; |
duke@435 | 2429 | case Bytecodes::_aastore : store_indexed(T_OBJECT); break; |
duke@435 | 2430 | case Bytecodes::_bastore : store_indexed(T_BYTE ); break; |
duke@435 | 2431 | case Bytecodes::_castore : store_indexed(T_CHAR ); break; |
duke@435 | 2432 | case Bytecodes::_sastore : store_indexed(T_SHORT ); break; |
duke@435 | 2433 | case Bytecodes::_pop : // fall through |
duke@435 | 2434 | case Bytecodes::_pop2 : // fall through |
duke@435 | 2435 | case Bytecodes::_dup : // fall through |
duke@435 | 2436 | case Bytecodes::_dup_x1 : // fall through |
duke@435 | 2437 | case Bytecodes::_dup_x2 : // fall through |
duke@435 | 2438 | case Bytecodes::_dup2 : // fall through |
duke@435 | 2439 | case Bytecodes::_dup2_x1 : // fall through |
duke@435 | 2440 | case Bytecodes::_dup2_x2 : // fall through |
duke@435 | 2441 | case Bytecodes::_swap : stack_op(code); break; |
duke@435 | 2442 | case Bytecodes::_iadd : arithmetic_op(intType , code); break; |
duke@435 | 2443 | case Bytecodes::_ladd : arithmetic_op(longType , code); break; |
duke@435 | 2444 | case Bytecodes::_fadd : arithmetic_op(floatType , code); break; |
duke@435 | 2445 | case Bytecodes::_dadd : arithmetic_op(doubleType, code); break; |
duke@435 | 2446 | case Bytecodes::_isub : arithmetic_op(intType , code); break; |
duke@435 | 2447 | case Bytecodes::_lsub : arithmetic_op(longType , code); break; |
duke@435 | 2448 | case Bytecodes::_fsub : arithmetic_op(floatType , code); break; |
duke@435 | 2449 | case Bytecodes::_dsub : arithmetic_op(doubleType, code); break; |
duke@435 | 2450 | case Bytecodes::_imul : arithmetic_op(intType , code); break; |
duke@435 | 2451 | case Bytecodes::_lmul : arithmetic_op(longType , code); break; |
duke@435 | 2452 | case Bytecodes::_fmul : arithmetic_op(floatType , code); break; |
duke@435 | 2453 | case Bytecodes::_dmul : arithmetic_op(doubleType, code); break; |
roland@2174 | 2454 | case Bytecodes::_idiv : arithmetic_op(intType , code, copy_state_for_exception()); break; |
roland@2174 | 2455 | case Bytecodes::_ldiv : arithmetic_op(longType , code, copy_state_for_exception()); break; |
duke@435 | 2456 | case Bytecodes::_fdiv : arithmetic_op(floatType , code); break; |
duke@435 | 2457 | case Bytecodes::_ddiv : arithmetic_op(doubleType, code); break; |
roland@2174 | 2458 | case Bytecodes::_irem : arithmetic_op(intType , code, copy_state_for_exception()); break; |
roland@2174 | 2459 | case Bytecodes::_lrem : arithmetic_op(longType , code, copy_state_for_exception()); break; |
duke@435 | 2460 | case Bytecodes::_frem : arithmetic_op(floatType , code); break; |
duke@435 | 2461 | case Bytecodes::_drem : arithmetic_op(doubleType, code); break; |
duke@435 | 2462 | case Bytecodes::_ineg : negate_op(intType ); break; |
duke@435 | 2463 | case Bytecodes::_lneg : negate_op(longType ); break; |
duke@435 | 2464 | case Bytecodes::_fneg : negate_op(floatType ); break; |
duke@435 | 2465 | case Bytecodes::_dneg : negate_op(doubleType); break; |
duke@435 | 2466 | case Bytecodes::_ishl : shift_op(intType , code); break; |
duke@435 | 2467 | case Bytecodes::_lshl : shift_op(longType, code); break; |
duke@435 | 2468 | case Bytecodes::_ishr : shift_op(intType , code); break; |
duke@435 | 2469 | case Bytecodes::_lshr : shift_op(longType, code); break; |
duke@435 | 2470 | case Bytecodes::_iushr : shift_op(intType , code); break; |
duke@435 | 2471 | case Bytecodes::_lushr : shift_op(longType, code); break; |
duke@435 | 2472 | case Bytecodes::_iand : logic_op(intType , code); break; |
duke@435 | 2473 | case Bytecodes::_land : logic_op(longType, code); break; |
duke@435 | 2474 | case Bytecodes::_ior : logic_op(intType , code); break; |
duke@435 | 2475 | case Bytecodes::_lor : logic_op(longType, code); break; |
duke@435 | 2476 | case Bytecodes::_ixor : logic_op(intType , code); break; |
duke@435 | 2477 | case Bytecodes::_lxor : logic_op(longType, code); break; |
duke@435 | 2478 | case Bytecodes::_iinc : increment(); break; |
duke@435 | 2479 | case Bytecodes::_i2l : convert(code, T_INT , T_LONG ); break; |
duke@435 | 2480 | case Bytecodes::_i2f : convert(code, T_INT , T_FLOAT ); break; |
duke@435 | 2481 | case Bytecodes::_i2d : convert(code, T_INT , T_DOUBLE); break; |
duke@435 | 2482 | case Bytecodes::_l2i : convert(code, T_LONG , T_INT ); break; |
duke@435 | 2483 | case Bytecodes::_l2f : convert(code, T_LONG , T_FLOAT ); break; |
duke@435 | 2484 | case Bytecodes::_l2d : convert(code, T_LONG , T_DOUBLE); break; |
duke@435 | 2485 | case Bytecodes::_f2i : convert(code, T_FLOAT , T_INT ); break; |
duke@435 | 2486 | case Bytecodes::_f2l : convert(code, T_FLOAT , T_LONG ); break; |
duke@435 | 2487 | case Bytecodes::_f2d : convert(code, T_FLOAT , T_DOUBLE); break; |
duke@435 | 2488 | case Bytecodes::_d2i : convert(code, T_DOUBLE, T_INT ); break; |
duke@435 | 2489 | case Bytecodes::_d2l : convert(code, T_DOUBLE, T_LONG ); break; |
duke@435 | 2490 | case Bytecodes::_d2f : convert(code, T_DOUBLE, T_FLOAT ); break; |
duke@435 | 2491 | case Bytecodes::_i2b : convert(code, T_INT , T_BYTE ); break; |
duke@435 | 2492 | case Bytecodes::_i2c : convert(code, T_INT , T_CHAR ); break; |
duke@435 | 2493 | case Bytecodes::_i2s : convert(code, T_INT , T_SHORT ); break; |
duke@435 | 2494 | case Bytecodes::_lcmp : compare_op(longType , code); break; |
duke@435 | 2495 | case Bytecodes::_fcmpl : compare_op(floatType , code); break; |
duke@435 | 2496 | case Bytecodes::_fcmpg : compare_op(floatType , code); break; |
duke@435 | 2497 | case Bytecodes::_dcmpl : compare_op(doubleType, code); break; |
duke@435 | 2498 | case Bytecodes::_dcmpg : compare_op(doubleType, code); break; |
duke@435 | 2499 | case Bytecodes::_ifeq : if_zero(intType , If::eql); break; |
duke@435 | 2500 | case Bytecodes::_ifne : if_zero(intType , If::neq); break; |
duke@435 | 2501 | case Bytecodes::_iflt : if_zero(intType , If::lss); break; |
duke@435 | 2502 | case Bytecodes::_ifge : if_zero(intType , If::geq); break; |
duke@435 | 2503 | case Bytecodes::_ifgt : if_zero(intType , If::gtr); break; |
duke@435 | 2504 | case Bytecodes::_ifle : if_zero(intType , If::leq); break; |
duke@435 | 2505 | case Bytecodes::_if_icmpeq : if_same(intType , If::eql); break; |
duke@435 | 2506 | case Bytecodes::_if_icmpne : if_same(intType , If::neq); break; |
duke@435 | 2507 | case Bytecodes::_if_icmplt : if_same(intType , If::lss); break; |
duke@435 | 2508 | case Bytecodes::_if_icmpge : if_same(intType , If::geq); break; |
duke@435 | 2509 | case Bytecodes::_if_icmpgt : if_same(intType , If::gtr); break; |
duke@435 | 2510 | case Bytecodes::_if_icmple : if_same(intType , If::leq); break; |
duke@435 | 2511 | case Bytecodes::_if_acmpeq : if_same(objectType, If::eql); break; |
duke@435 | 2512 | case Bytecodes::_if_acmpne : if_same(objectType, If::neq); break; |
duke@435 | 2513 | case Bytecodes::_goto : _goto(s.cur_bci(), s.get_dest()); break; |
duke@435 | 2514 | case Bytecodes::_jsr : jsr(s.get_dest()); break; |
duke@435 | 2515 | case Bytecodes::_ret : ret(s.get_index()); break; |
duke@435 | 2516 | case Bytecodes::_tableswitch : table_switch(); break; |
duke@435 | 2517 | case Bytecodes::_lookupswitch : lookup_switch(); break; |
duke@435 | 2518 | case Bytecodes::_ireturn : method_return(ipop()); break; |
duke@435 | 2519 | case Bytecodes::_lreturn : method_return(lpop()); break; |
duke@435 | 2520 | case Bytecodes::_freturn : method_return(fpop()); break; |
duke@435 | 2521 | case Bytecodes::_dreturn : method_return(dpop()); break; |
duke@435 | 2522 | case Bytecodes::_areturn : method_return(apop()); break; |
duke@435 | 2523 | case Bytecodes::_return : method_return(NULL ); break; |
duke@435 | 2524 | case Bytecodes::_getstatic : // fall through |
duke@435 | 2525 | case Bytecodes::_putstatic : // fall through |
duke@435 | 2526 | case Bytecodes::_getfield : // fall through |
duke@435 | 2527 | case Bytecodes::_putfield : access_field(code); break; |
duke@435 | 2528 | case Bytecodes::_invokevirtual : // fall through |
duke@435 | 2529 | case Bytecodes::_invokespecial : // fall through |
duke@435 | 2530 | case Bytecodes::_invokestatic : // fall through |
jrose@1161 | 2531 | case Bytecodes::_invokedynamic : // fall through |
duke@435 | 2532 | case Bytecodes::_invokeinterface: invoke(code); break; |
jrose@1920 | 2533 | case Bytecodes::_new : new_instance(s.get_index_u2()); break; |
duke@435 | 2534 | case Bytecodes::_newarray : new_type_array(); break; |
duke@435 | 2535 | case Bytecodes::_anewarray : new_object_array(); break; |
roland@2174 | 2536 | case Bytecodes::_arraylength : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; } |
duke@435 | 2537 | case Bytecodes::_athrow : throw_op(s.cur_bci()); break; |
jrose@1920 | 2538 | case Bytecodes::_checkcast : check_cast(s.get_index_u2()); break; |
jrose@1920 | 2539 | case Bytecodes::_instanceof : instance_of(s.get_index_u2()); break; |
duke@435 | 2540 | case Bytecodes::_monitorenter : monitorenter(apop(), s.cur_bci()); break; |
duke@435 | 2541 | case Bytecodes::_monitorexit : monitorexit (apop(), s.cur_bci()); break; |
duke@435 | 2542 | case Bytecodes::_wide : ShouldNotReachHere(); break; |
duke@435 | 2543 | case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break; |
duke@435 | 2544 | case Bytecodes::_ifnull : if_null(objectType, If::eql); break; |
duke@435 | 2545 | case Bytecodes::_ifnonnull : if_null(objectType, If::neq); break; |
duke@435 | 2546 | case Bytecodes::_goto_w : _goto(s.cur_bci(), s.get_far_dest()); break; |
duke@435 | 2547 | case Bytecodes::_jsr_w : jsr(s.get_far_dest()); break; |
duke@435 | 2548 | case Bytecodes::_breakpoint : BAILOUT_("concurrent setting of breakpoint", NULL); |
duke@435 | 2549 | default : ShouldNotReachHere(); break; |
duke@435 | 2550 | } |
duke@435 | 2551 | // save current bci to setup Goto at the end |
duke@435 | 2552 | prev_bci = s.cur_bci(); |
duke@435 | 2553 | } |
duke@435 | 2554 | CHECK_BAILOUT_(NULL); |
duke@435 | 2555 | // stop processing of this block (see try_inline_full) |
duke@435 | 2556 | if (_skip_block) { |
duke@435 | 2557 | _skip_block = false; |
duke@435 | 2558 | assert(_last && _last->as_BlockEnd(), ""); |
duke@435 | 2559 | return _last->as_BlockEnd(); |
duke@435 | 2560 | } |
duke@435 | 2561 | // if there are any, check if last instruction is a BlockEnd instruction |
duke@435 | 2562 | BlockEnd* end = last()->as_BlockEnd(); |
duke@435 | 2563 | if (end == NULL) { |
duke@435 | 2564 | // all blocks must end with a BlockEnd instruction => add a Goto |
duke@435 | 2565 | end = new Goto(block_at(s.cur_bci()), false); |
roland@2174 | 2566 | append(end); |
duke@435 | 2567 | } |
duke@435 | 2568 | assert(end == last()->as_BlockEnd(), "inconsistency"); |
duke@435 | 2569 | |
roland@2174 | 2570 | assert(end->state() != NULL, "state must already be present"); |
roland@2174 | 2571 | assert(end->as_Return() == NULL || end->as_Throw() == NULL || end->state()->stack_size() == 0, "stack not needed for return and throw"); |
duke@435 | 2572 | |
duke@435 | 2573 | // connect to begin & set state |
duke@435 | 2574 | // NOTE that inlining may have changed the block we are parsing |
duke@435 | 2575 | block()->set_end(end); |
duke@435 | 2576 | // propagate state |
duke@435 | 2577 | for (int i = end->number_of_sux() - 1; i >= 0; i--) { |
duke@435 | 2578 | BlockBegin* sux = end->sux_at(i); |
duke@435 | 2579 | assert(sux->is_predecessor(block()), "predecessor missing"); |
duke@435 | 2580 | // be careful, bailout if bytecodes are strange |
roland@2174 | 2581 | if (!sux->try_merge(end->state())) BAILOUT_("block join failed", NULL); |
duke@435 | 2582 | scope_data()->add_to_work_list(end->sux_at(i)); |
duke@435 | 2583 | } |
duke@435 | 2584 | |
duke@435 | 2585 | scope_data()->set_stream(NULL); |
duke@435 | 2586 | |
duke@435 | 2587 | // done |
duke@435 | 2588 | return end; |
duke@435 | 2589 | } |
duke@435 | 2590 | |
duke@435 | 2591 | |
duke@435 | 2592 | void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) { |
duke@435 | 2593 | do { |
duke@435 | 2594 | if (start_in_current_block_for_inlining && !bailed_out()) { |
duke@435 | 2595 | iterate_bytecodes_for_block(0); |
duke@435 | 2596 | start_in_current_block_for_inlining = false; |
duke@435 | 2597 | } else { |
duke@435 | 2598 | BlockBegin* b; |
duke@435 | 2599 | while ((b = scope_data()->remove_from_work_list()) != NULL) { |
duke@435 | 2600 | if (!b->is_set(BlockBegin::was_visited_flag)) { |
duke@435 | 2601 | if (b->is_set(BlockBegin::osr_entry_flag)) { |
duke@435 | 2602 | // we're about to parse the osr entry block, so make sure |
duke@435 | 2603 | // we setup the OSR edge leading into this block so that |
duke@435 | 2604 | // Phis get setup correctly. |
duke@435 | 2605 | setup_osr_entry_block(); |
duke@435 | 2606 | // this is no longer the osr entry block, so clear it. |
duke@435 | 2607 | b->clear(BlockBegin::osr_entry_flag); |
duke@435 | 2608 | } |
duke@435 | 2609 | b->set(BlockBegin::was_visited_flag); |
duke@435 | 2610 | connect_to_end(b); |
duke@435 | 2611 | } |
duke@435 | 2612 | } |
duke@435 | 2613 | } |
duke@435 | 2614 | } while (!bailed_out() && !scope_data()->is_work_list_empty()); |
duke@435 | 2615 | } |
duke@435 | 2616 | |
duke@435 | 2617 | |
duke@435 | 2618 | bool GraphBuilder::_can_trap [Bytecodes::number_of_java_codes]; |
duke@435 | 2619 | |
duke@435 | 2620 | void GraphBuilder::initialize() { |
duke@435 | 2621 | // the following bytecodes are assumed to potentially |
duke@435 | 2622 | // throw exceptions in compiled code - note that e.g. |
duke@435 | 2623 | // monitorexit & the return bytecodes do not throw |
duke@435 | 2624 | // exceptions since monitor pairing proved that they |
duke@435 | 2625 | // succeed (if monitor pairing succeeded) |
duke@435 | 2626 | Bytecodes::Code can_trap_list[] = |
duke@435 | 2627 | { Bytecodes::_ldc |
duke@435 | 2628 | , Bytecodes::_ldc_w |
duke@435 | 2629 | , Bytecodes::_ldc2_w |
duke@435 | 2630 | , Bytecodes::_iaload |
duke@435 | 2631 | , Bytecodes::_laload |
duke@435 | 2632 | , Bytecodes::_faload |
duke@435 | 2633 | , Bytecodes::_daload |
duke@435 | 2634 | , Bytecodes::_aaload |
duke@435 | 2635 | , Bytecodes::_baload |
duke@435 | 2636 | , Bytecodes::_caload |
duke@435 | 2637 | , Bytecodes::_saload |
duke@435 | 2638 | , Bytecodes::_iastore |
duke@435 | 2639 | , Bytecodes::_lastore |
duke@435 | 2640 | , Bytecodes::_fastore |
duke@435 | 2641 | , Bytecodes::_dastore |
duke@435 | 2642 | , Bytecodes::_aastore |
duke@435 | 2643 | , Bytecodes::_bastore |
duke@435 | 2644 | , Bytecodes::_castore |
duke@435 | 2645 | , Bytecodes::_sastore |
duke@435 | 2646 | , Bytecodes::_idiv |
duke@435 | 2647 | , Bytecodes::_ldiv |
duke@435 | 2648 | , Bytecodes::_irem |
duke@435 | 2649 | , Bytecodes::_lrem |
duke@435 | 2650 | , Bytecodes::_getstatic |
duke@435 | 2651 | , Bytecodes::_putstatic |
duke@435 | 2652 | , Bytecodes::_getfield |
duke@435 | 2653 | , Bytecodes::_putfield |
duke@435 | 2654 | , Bytecodes::_invokevirtual |
duke@435 | 2655 | , Bytecodes::_invokespecial |
duke@435 | 2656 | , Bytecodes::_invokestatic |
jrose@1161 | 2657 | , Bytecodes::_invokedynamic |
duke@435 | 2658 | , Bytecodes::_invokeinterface |
duke@435 | 2659 | , Bytecodes::_new |
duke@435 | 2660 | , Bytecodes::_newarray |
duke@435 | 2661 | , Bytecodes::_anewarray |
duke@435 | 2662 | , Bytecodes::_arraylength |
duke@435 | 2663 | , Bytecodes::_athrow |
duke@435 | 2664 | , Bytecodes::_checkcast |
duke@435 | 2665 | , Bytecodes::_instanceof |
duke@435 | 2666 | , Bytecodes::_monitorenter |
duke@435 | 2667 | , Bytecodes::_multianewarray |
duke@435 | 2668 | }; |
duke@435 | 2669 | |
duke@435 | 2670 | // inititialize trap tables |
duke@435 | 2671 | for (int i = 0; i < Bytecodes::number_of_java_codes; i++) { |
duke@435 | 2672 | _can_trap[i] = false; |
duke@435 | 2673 | } |
duke@435 | 2674 | // set standard trap info |
duke@435 | 2675 | for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) { |
duke@435 | 2676 | _can_trap[can_trap_list[j]] = true; |
duke@435 | 2677 | } |
duke@435 | 2678 | } |
duke@435 | 2679 | |
duke@435 | 2680 | |
duke@435 | 2681 | BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) { |
duke@435 | 2682 | assert(entry->is_set(f), "entry/flag mismatch"); |
duke@435 | 2683 | // create header block |
duke@435 | 2684 | BlockBegin* h = new BlockBegin(entry->bci()); |
duke@435 | 2685 | h->set_depth_first_number(0); |
duke@435 | 2686 | |
duke@435 | 2687 | Value l = h; |
duke@435 | 2688 | BlockEnd* g = new Goto(entry, false); |
duke@435 | 2689 | l->set_next(g, entry->bci()); |
duke@435 | 2690 | h->set_end(g); |
duke@435 | 2691 | h->set(f); |
duke@435 | 2692 | // setup header block end state |
roland@2174 | 2693 | ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis) |
duke@435 | 2694 | assert(s->stack_is_empty(), "must have empty stack at entry point"); |
duke@435 | 2695 | g->set_state(s); |
duke@435 | 2696 | return h; |
duke@435 | 2697 | } |
duke@435 | 2698 | |
duke@435 | 2699 | |
duke@435 | 2700 | |
duke@435 | 2701 | BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) { |
duke@435 | 2702 | BlockBegin* start = new BlockBegin(0); |
duke@435 | 2703 | |
duke@435 | 2704 | // This code eliminates the empty start block at the beginning of |
duke@435 | 2705 | // each method. Previously, each method started with the |
duke@435 | 2706 | // start-block created below, and this block was followed by the |
duke@435 | 2707 | // header block that was always empty. This header block is only |
duke@435 | 2708 | // necesary if std_entry is also a backward branch target because |
duke@435 | 2709 | // then phi functions may be necessary in the header block. It's |
duke@435 | 2710 | // also necessary when profiling so that there's a single block that |
duke@435 | 2711 | // can increment the interpreter_invocation_count. |
duke@435 | 2712 | BlockBegin* new_header_block; |
iveresov@2138 | 2713 | if (std_entry->number_of_preds() > 0 || count_invocations() || count_backedges()) { |
iveresov@2138 | 2714 | new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state); |
iveresov@2138 | 2715 | } else { |
duke@435 | 2716 | new_header_block = std_entry; |
duke@435 | 2717 | } |
duke@435 | 2718 | |
duke@435 | 2719 | // setup start block (root for the IR graph) |
duke@435 | 2720 | Base* base = |
duke@435 | 2721 | new Base( |
duke@435 | 2722 | new_header_block, |
duke@435 | 2723 | osr_entry |
duke@435 | 2724 | ); |
duke@435 | 2725 | start->set_next(base, 0); |
duke@435 | 2726 | start->set_end(base); |
duke@435 | 2727 | // create & setup state for start block |
roland@2174 | 2728 | start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci())); |
roland@2174 | 2729 | base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci())); |
duke@435 | 2730 | |
duke@435 | 2731 | if (base->std_entry()->state() == NULL) { |
duke@435 | 2732 | // setup states for header blocks |
duke@435 | 2733 | base->std_entry()->merge(state); |
duke@435 | 2734 | } |
duke@435 | 2735 | |
duke@435 | 2736 | assert(base->std_entry()->state() != NULL, ""); |
duke@435 | 2737 | return start; |
duke@435 | 2738 | } |
duke@435 | 2739 | |
duke@435 | 2740 | |
duke@435 | 2741 | void GraphBuilder::setup_osr_entry_block() { |
duke@435 | 2742 | assert(compilation()->is_osr_compile(), "only for osrs"); |
duke@435 | 2743 | |
duke@435 | 2744 | int osr_bci = compilation()->osr_bci(); |
duke@435 | 2745 | ciBytecodeStream s(method()); |
duke@435 | 2746 | s.reset_to_bci(osr_bci); |
duke@435 | 2747 | s.next(); |
duke@435 | 2748 | scope_data()->set_stream(&s); |
duke@435 | 2749 | |
duke@435 | 2750 | // create a new block to be the osr setup code |
duke@435 | 2751 | _osr_entry = new BlockBegin(osr_bci); |
duke@435 | 2752 | _osr_entry->set(BlockBegin::osr_entry_flag); |
duke@435 | 2753 | _osr_entry->set_depth_first_number(0); |
duke@435 | 2754 | BlockBegin* target = bci2block()->at(osr_bci); |
duke@435 | 2755 | assert(target != NULL && target->is_set(BlockBegin::osr_entry_flag), "must be there"); |
duke@435 | 2756 | // the osr entry has no values for locals |
duke@435 | 2757 | ValueStack* state = target->state()->copy(); |
duke@435 | 2758 | _osr_entry->set_state(state); |
duke@435 | 2759 | |
duke@435 | 2760 | kill_all(); |
duke@435 | 2761 | _block = _osr_entry; |
duke@435 | 2762 | _state = _osr_entry->state()->copy(); |
roland@2174 | 2763 | assert(_state->bci() == osr_bci, "mismatch"); |
duke@435 | 2764 | _last = _osr_entry; |
duke@435 | 2765 | Value e = append(new OsrEntry()); |
duke@435 | 2766 | e->set_needs_null_check(false); |
duke@435 | 2767 | |
duke@435 | 2768 | // OSR buffer is |
duke@435 | 2769 | // |
duke@435 | 2770 | // locals[nlocals-1..0] |
duke@435 | 2771 | // monitors[number_of_locks-1..0] |
duke@435 | 2772 | // |
duke@435 | 2773 | // locals is a direct copy of the interpreter frame so in the osr buffer |
duke@435 | 2774 | // so first slot in the local array is the last local from the interpreter |
duke@435 | 2775 | // and last slot is local[0] (receiver) from the interpreter |
duke@435 | 2776 | // |
duke@435 | 2777 | // Similarly with locks. The first lock slot in the osr buffer is the nth lock |
duke@435 | 2778 | // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock |
duke@435 | 2779 | // in the interpreter frame (the method lock if a sync method) |
duke@435 | 2780 | |
duke@435 | 2781 | // Initialize monitors in the compiled activation. |
duke@435 | 2782 | |
duke@435 | 2783 | int index; |
duke@435 | 2784 | Value local; |
duke@435 | 2785 | |
duke@435 | 2786 | // find all the locals that the interpreter thinks contain live oops |
duke@435 | 2787 | const BitMap live_oops = method()->live_local_oops_at_bci(osr_bci); |
duke@435 | 2788 | |
duke@435 | 2789 | // compute the offset into the locals so that we can treat the buffer |
duke@435 | 2790 | // as if the locals were still in the interpreter frame |
duke@435 | 2791 | int locals_offset = BytesPerWord * (method()->max_locals() - 1); |
duke@435 | 2792 | for_each_local_value(state, index, local) { |
duke@435 | 2793 | int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord; |
duke@435 | 2794 | Value get; |
duke@435 | 2795 | if (local->type()->is_object_kind() && !live_oops.at(index)) { |
duke@435 | 2796 | // The interpreter thinks this local is dead but the compiler |
duke@435 | 2797 | // doesn't so pretend that the interpreter passed in null. |
duke@435 | 2798 | get = append(new Constant(objectNull)); |
duke@435 | 2799 | } else { |
duke@435 | 2800 | get = append(new UnsafeGetRaw(as_BasicType(local->type()), e, |
duke@435 | 2801 | append(new Constant(new IntConstant(offset))), |
duke@435 | 2802 | 0, |
iveresov@2344 | 2803 | true /*unaligned*/, true /*wide*/)); |
duke@435 | 2804 | } |
duke@435 | 2805 | _state->store_local(index, get); |
duke@435 | 2806 | } |
duke@435 | 2807 | |
duke@435 | 2808 | // the storage for the OSR buffer is freed manually in the LIRGenerator. |
duke@435 | 2809 | |
duke@435 | 2810 | assert(state->caller_state() == NULL, "should be top scope"); |
duke@435 | 2811 | state->clear_locals(); |
duke@435 | 2812 | Goto* g = new Goto(target, false); |
duke@435 | 2813 | append(g); |
duke@435 | 2814 | _osr_entry->set_end(g); |
duke@435 | 2815 | target->merge(_osr_entry->end()->state()); |
duke@435 | 2816 | |
duke@435 | 2817 | scope_data()->set_stream(NULL); |
duke@435 | 2818 | } |
duke@435 | 2819 | |
duke@435 | 2820 | |
duke@435 | 2821 | ValueStack* GraphBuilder::state_at_entry() { |
roland@2174 | 2822 | ValueStack* state = new ValueStack(scope(), NULL); |
duke@435 | 2823 | |
duke@435 | 2824 | // Set up locals for receiver |
duke@435 | 2825 | int idx = 0; |
duke@435 | 2826 | if (!method()->is_static()) { |
duke@435 | 2827 | // we should always see the receiver |
roland@2728 | 2828 | state->store_local(idx, new Local(method()->holder(), objectType, idx)); |
duke@435 | 2829 | idx = 1; |
duke@435 | 2830 | } |
duke@435 | 2831 | |
duke@435 | 2832 | // Set up locals for incoming arguments |
duke@435 | 2833 | ciSignature* sig = method()->signature(); |
duke@435 | 2834 | for (int i = 0; i < sig->count(); i++) { |
duke@435 | 2835 | ciType* type = sig->type_at(i); |
duke@435 | 2836 | BasicType basic_type = type->basic_type(); |
duke@435 | 2837 | // don't allow T_ARRAY to propagate into locals types |
duke@435 | 2838 | if (basic_type == T_ARRAY) basic_type = T_OBJECT; |
duke@435 | 2839 | ValueType* vt = as_ValueType(basic_type); |
roland@2728 | 2840 | state->store_local(idx, new Local(type, vt, idx)); |
duke@435 | 2841 | idx += type->size(); |
duke@435 | 2842 | } |
duke@435 | 2843 | |
duke@435 | 2844 | // lock synchronized method |
duke@435 | 2845 | if (method()->is_synchronized()) { |
roland@2174 | 2846 | state->lock(NULL); |
duke@435 | 2847 | } |
duke@435 | 2848 | |
duke@435 | 2849 | return state; |
duke@435 | 2850 | } |
duke@435 | 2851 | |
duke@435 | 2852 | |
duke@435 | 2853 | GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope) |
duke@435 | 2854 | : _scope_data(NULL) |
duke@435 | 2855 | , _instruction_count(0) |
duke@435 | 2856 | , _osr_entry(NULL) |
duke@435 | 2857 | , _memory(new MemoryBuffer()) |
duke@435 | 2858 | , _compilation(compilation) |
duke@435 | 2859 | , _inline_bailout_msg(NULL) |
duke@435 | 2860 | { |
duke@435 | 2861 | int osr_bci = compilation->osr_bci(); |
duke@435 | 2862 | |
duke@435 | 2863 | // determine entry points and bci2block mapping |
duke@435 | 2864 | BlockListBuilder blm(compilation, scope, osr_bci); |
duke@435 | 2865 | CHECK_BAILOUT(); |
duke@435 | 2866 | |
duke@435 | 2867 | BlockList* bci2block = blm.bci2block(); |
duke@435 | 2868 | BlockBegin* start_block = bci2block->at(0); |
duke@435 | 2869 | |
duke@435 | 2870 | push_root_scope(scope, bci2block, start_block); |
duke@435 | 2871 | |
duke@435 | 2872 | // setup state for std entry |
duke@435 | 2873 | _initial_state = state_at_entry(); |
duke@435 | 2874 | start_block->merge(_initial_state); |
duke@435 | 2875 | |
duke@435 | 2876 | // complete graph |
duke@435 | 2877 | _vmap = new ValueMap(); |
duke@435 | 2878 | switch (scope->method()->intrinsic_id()) { |
duke@435 | 2879 | case vmIntrinsics::_dabs : // fall through |
duke@435 | 2880 | case vmIntrinsics::_dsqrt : // fall through |
duke@435 | 2881 | case vmIntrinsics::_dsin : // fall through |
duke@435 | 2882 | case vmIntrinsics::_dcos : // fall through |
duke@435 | 2883 | case vmIntrinsics::_dtan : // fall through |
duke@435 | 2884 | case vmIntrinsics::_dlog : // fall through |
duke@435 | 2885 | case vmIntrinsics::_dlog10 : // fall through |
duke@435 | 2886 | { |
duke@435 | 2887 | // Compiles where the root method is an intrinsic need a special |
duke@435 | 2888 | // compilation environment because the bytecodes for the method |
duke@435 | 2889 | // shouldn't be parsed during the compilation, only the special |
duke@435 | 2890 | // Intrinsic node should be emitted. If this isn't done the the |
duke@435 | 2891 | // code for the inlined version will be different than the root |
duke@435 | 2892 | // compiled version which could lead to monotonicity problems on |
duke@435 | 2893 | // intel. |
duke@435 | 2894 | |
duke@435 | 2895 | // Set up a stream so that appending instructions works properly. |
duke@435 | 2896 | ciBytecodeStream s(scope->method()); |
duke@435 | 2897 | s.reset_to_bci(0); |
duke@435 | 2898 | scope_data()->set_stream(&s); |
duke@435 | 2899 | s.next(); |
duke@435 | 2900 | |
duke@435 | 2901 | // setup the initial block state |
duke@435 | 2902 | _block = start_block; |
roland@2174 | 2903 | _state = start_block->state()->copy_for_parsing(); |
duke@435 | 2904 | _last = start_block; |
duke@435 | 2905 | load_local(doubleType, 0); |
duke@435 | 2906 | |
duke@435 | 2907 | // Emit the intrinsic node. |
duke@435 | 2908 | bool result = try_inline_intrinsics(scope->method()); |
duke@435 | 2909 | if (!result) BAILOUT("failed to inline intrinsic"); |
duke@435 | 2910 | method_return(dpop()); |
duke@435 | 2911 | |
duke@435 | 2912 | // connect the begin and end blocks and we're all done. |
duke@435 | 2913 | BlockEnd* end = last()->as_BlockEnd(); |
duke@435 | 2914 | block()->set_end(end); |
duke@435 | 2915 | break; |
duke@435 | 2916 | } |
johnc@2781 | 2917 | |
johnc@2781 | 2918 | case vmIntrinsics::_Reference_get: |
johnc@2781 | 2919 | { |
johnc@2781 | 2920 | if (UseG1GC) { |
johnc@2781 | 2921 | // With java.lang.ref.reference.get() we must go through the |
johnc@2781 | 2922 | // intrinsic - when G1 is enabled - even when get() is the root |
johnc@2781 | 2923 | // method of the compile so that, if necessary, the value in |
johnc@2781 | 2924 | // the referent field of the reference object gets recorded by |
johnc@2781 | 2925 | // the pre-barrier code. |
johnc@2781 | 2926 | // Specifically, if G1 is enabled, the value in the referent |
johnc@2781 | 2927 | // field is recorded by the G1 SATB pre barrier. This will |
johnc@2781 | 2928 | // result in the referent being marked live and the reference |
johnc@2781 | 2929 | // object removed from the list of discovered references during |
johnc@2781 | 2930 | // reference processing. |
johnc@2781 | 2931 | |
johnc@2781 | 2932 | // Set up a stream so that appending instructions works properly. |
johnc@2781 | 2933 | ciBytecodeStream s(scope->method()); |
johnc@2781 | 2934 | s.reset_to_bci(0); |
johnc@2781 | 2935 | scope_data()->set_stream(&s); |
johnc@2781 | 2936 | s.next(); |
johnc@2781 | 2937 | |
johnc@2781 | 2938 | // setup the initial block state |
johnc@2781 | 2939 | _block = start_block; |
johnc@2781 | 2940 | _state = start_block->state()->copy_for_parsing(); |
johnc@2781 | 2941 | _last = start_block; |
johnc@2781 | 2942 | load_local(objectType, 0); |
johnc@2781 | 2943 | |
johnc@2781 | 2944 | // Emit the intrinsic node. |
johnc@2781 | 2945 | bool result = try_inline_intrinsics(scope->method()); |
johnc@2781 | 2946 | if (!result) BAILOUT("failed to inline intrinsic"); |
johnc@2781 | 2947 | method_return(apop()); |
johnc@2781 | 2948 | |
johnc@2781 | 2949 | // connect the begin and end blocks and we're all done. |
johnc@2781 | 2950 | BlockEnd* end = last()->as_BlockEnd(); |
johnc@2781 | 2951 | block()->set_end(end); |
johnc@2781 | 2952 | break; |
johnc@2781 | 2953 | } |
johnc@2781 | 2954 | // Otherwise, fall thru |
johnc@2781 | 2955 | } |
johnc@2781 | 2956 | |
duke@435 | 2957 | default: |
duke@435 | 2958 | scope_data()->add_to_work_list(start_block); |
duke@435 | 2959 | iterate_all_blocks(); |
duke@435 | 2960 | break; |
duke@435 | 2961 | } |
duke@435 | 2962 | CHECK_BAILOUT(); |
duke@435 | 2963 | |
duke@435 | 2964 | _start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state); |
duke@435 | 2965 | |
duke@435 | 2966 | eliminate_redundant_phis(_start); |
duke@435 | 2967 | |
duke@435 | 2968 | NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats()); |
duke@435 | 2969 | // for osr compile, bailout if some requirements are not fulfilled |
duke@435 | 2970 | if (osr_bci != -1) { |
duke@435 | 2971 | BlockBegin* osr_block = blm.bci2block()->at(osr_bci); |
duke@435 | 2972 | assert(osr_block->is_set(BlockBegin::was_visited_flag),"osr entry must have been visited for osr compile"); |
duke@435 | 2973 | |
duke@435 | 2974 | // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points |
duke@435 | 2975 | if (!osr_block->state()->stack_is_empty()) { |
duke@435 | 2976 | BAILOUT("stack not empty at OSR entry point"); |
duke@435 | 2977 | } |
duke@435 | 2978 | } |
duke@435 | 2979 | #ifndef PRODUCT |
duke@435 | 2980 | if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count); |
duke@435 | 2981 | #endif |
duke@435 | 2982 | } |
duke@435 | 2983 | |
duke@435 | 2984 | |
roland@2174 | 2985 | ValueStack* GraphBuilder::copy_state_before() { |
roland@2174 | 2986 | return copy_state_before_with_bci(bci()); |
duke@435 | 2987 | } |
duke@435 | 2988 | |
roland@2174 | 2989 | ValueStack* GraphBuilder::copy_state_exhandling() { |
roland@2174 | 2990 | return copy_state_exhandling_with_bci(bci()); |
roland@2174 | 2991 | } |
roland@2174 | 2992 | |
roland@2174 | 2993 | ValueStack* GraphBuilder::copy_state_for_exception() { |
roland@2174 | 2994 | return copy_state_for_exception_with_bci(bci()); |
roland@2174 | 2995 | } |
roland@2174 | 2996 | |
roland@2174 | 2997 | ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) { |
roland@2174 | 2998 | return state()->copy(ValueStack::StateBefore, bci); |
roland@2174 | 2999 | } |
roland@2174 | 3000 | |
roland@2174 | 3001 | ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) { |
roland@2174 | 3002 | if (!has_handler()) return NULL; |
roland@2174 | 3003 | return state()->copy(ValueStack::StateBefore, bci); |
roland@2174 | 3004 | } |
roland@2174 | 3005 | |
roland@2174 | 3006 | ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) { |
roland@2174 | 3007 | ValueStack* s = copy_state_exhandling_with_bci(bci); |
roland@2174 | 3008 | if (s == NULL) { |
roland@2174 | 3009 | if (_compilation->env()->jvmti_can_access_local_variables()) { |
roland@2174 | 3010 | s = state()->copy(ValueStack::ExceptionState, bci); |
roland@2174 | 3011 | } else { |
roland@2174 | 3012 | s = state()->copy(ValueStack::EmptyExceptionState, bci); |
roland@2174 | 3013 | } |
roland@2174 | 3014 | } |
roland@2174 | 3015 | return s; |
roland@2174 | 3016 | } |
duke@435 | 3017 | |
duke@435 | 3018 | int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const { |
duke@435 | 3019 | int recur_level = 0; |
duke@435 | 3020 | for (IRScope* s = scope(); s != NULL; s = s->caller()) { |
duke@435 | 3021 | if (s->method() == cur_callee) { |
duke@435 | 3022 | ++recur_level; |
duke@435 | 3023 | } |
duke@435 | 3024 | } |
duke@435 | 3025 | return recur_level; |
duke@435 | 3026 | } |
duke@435 | 3027 | |
duke@435 | 3028 | |
duke@435 | 3029 | bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known) { |
duke@435 | 3030 | // Clear out any existing inline bailout condition |
duke@435 | 3031 | clear_inline_bailout(); |
duke@435 | 3032 | |
duke@435 | 3033 | if (callee->should_exclude()) { |
duke@435 | 3034 | // callee is excluded |
duke@435 | 3035 | INLINE_BAILOUT("excluded by CompilerOracle") |
never@3042 | 3036 | } else if (callee->should_not_inline()) { |
never@3042 | 3037 | // callee is excluded |
never@3042 | 3038 | INLINE_BAILOUT("disallowed by CompilerOracle") |
duke@435 | 3039 | } else if (!callee->can_be_compiled()) { |
duke@435 | 3040 | // callee is not compilable (prob. has breakpoints) |
duke@435 | 3041 | INLINE_BAILOUT("not compilable") |
duke@435 | 3042 | } else if (callee->intrinsic_id() != vmIntrinsics::_none && try_inline_intrinsics(callee)) { |
duke@435 | 3043 | // intrinsics can be native or not |
duke@435 | 3044 | return true; |
duke@435 | 3045 | } else if (callee->is_native()) { |
duke@435 | 3046 | // non-intrinsic natives cannot be inlined |
duke@435 | 3047 | INLINE_BAILOUT("non-intrinsic native") |
duke@435 | 3048 | } else if (callee->is_abstract()) { |
duke@435 | 3049 | INLINE_BAILOUT("abstract") |
duke@435 | 3050 | } else { |
duke@435 | 3051 | return try_inline_full(callee, holder_known); |
duke@435 | 3052 | } |
duke@435 | 3053 | } |
duke@435 | 3054 | |
duke@435 | 3055 | |
duke@435 | 3056 | bool GraphBuilder::try_inline_intrinsics(ciMethod* callee) { |
duke@435 | 3057 | if (!InlineNatives ) INLINE_BAILOUT("intrinsic method inlining disabled"); |
never@1895 | 3058 | if (callee->is_synchronized()) { |
never@1895 | 3059 | // We don't currently support any synchronized intrinsics |
never@1895 | 3060 | return false; |
never@1895 | 3061 | } |
never@1895 | 3062 | |
duke@435 | 3063 | // callee seems like a good candidate |
duke@435 | 3064 | // determine id |
duke@435 | 3065 | bool preserves_state = false; |
duke@435 | 3066 | bool cantrap = true; |
duke@435 | 3067 | vmIntrinsics::ID id = callee->intrinsic_id(); |
duke@435 | 3068 | switch (id) { |
duke@435 | 3069 | case vmIntrinsics::_arraycopy : |
duke@435 | 3070 | if (!InlineArrayCopy) return false; |
duke@435 | 3071 | break; |
duke@435 | 3072 | |
duke@435 | 3073 | case vmIntrinsics::_currentTimeMillis: |
duke@435 | 3074 | case vmIntrinsics::_nanoTime: |
duke@435 | 3075 | preserves_state = true; |
duke@435 | 3076 | cantrap = false; |
duke@435 | 3077 | break; |
duke@435 | 3078 | |
duke@435 | 3079 | case vmIntrinsics::_floatToRawIntBits : |
duke@435 | 3080 | case vmIntrinsics::_intBitsToFloat : |
duke@435 | 3081 | case vmIntrinsics::_doubleToRawLongBits : |
duke@435 | 3082 | case vmIntrinsics::_longBitsToDouble : |
duke@435 | 3083 | if (!InlineMathNatives) return false; |
duke@435 | 3084 | preserves_state = true; |
duke@435 | 3085 | cantrap = false; |
duke@435 | 3086 | break; |
duke@435 | 3087 | |
duke@435 | 3088 | case vmIntrinsics::_getClass : |
duke@435 | 3089 | if (!InlineClassNatives) return false; |
duke@435 | 3090 | preserves_state = true; |
duke@435 | 3091 | break; |
duke@435 | 3092 | |
duke@435 | 3093 | case vmIntrinsics::_currentThread : |
duke@435 | 3094 | if (!InlineThreadNatives) return false; |
duke@435 | 3095 | preserves_state = true; |
duke@435 | 3096 | cantrap = false; |
duke@435 | 3097 | break; |
duke@435 | 3098 | |
duke@435 | 3099 | case vmIntrinsics::_dabs : // fall through |
duke@435 | 3100 | case vmIntrinsics::_dsqrt : // fall through |
duke@435 | 3101 | case vmIntrinsics::_dsin : // fall through |
duke@435 | 3102 | case vmIntrinsics::_dcos : // fall through |
duke@435 | 3103 | case vmIntrinsics::_dtan : // fall through |
duke@435 | 3104 | case vmIntrinsics::_dlog : // fall through |
duke@435 | 3105 | case vmIntrinsics::_dlog10 : // fall through |
duke@435 | 3106 | if (!InlineMathNatives) return false; |
duke@435 | 3107 | cantrap = false; |
duke@435 | 3108 | preserves_state = true; |
duke@435 | 3109 | break; |
duke@435 | 3110 | |
duke@435 | 3111 | // sun/misc/AtomicLong.attemptUpdate |
duke@435 | 3112 | case vmIntrinsics::_attemptUpdate : |
duke@435 | 3113 | if (!VM_Version::supports_cx8()) return false; |
duke@435 | 3114 | if (!InlineAtomicLong) return false; |
duke@435 | 3115 | preserves_state = true; |
duke@435 | 3116 | break; |
duke@435 | 3117 | |
duke@435 | 3118 | // Use special nodes for Unsafe instructions so we can more easily |
duke@435 | 3119 | // perform an address-mode optimization on the raw variants |
duke@435 | 3120 | case vmIntrinsics::_getObject : return append_unsafe_get_obj(callee, T_OBJECT, false); |
duke@435 | 3121 | case vmIntrinsics::_getBoolean: return append_unsafe_get_obj(callee, T_BOOLEAN, false); |
duke@435 | 3122 | case vmIntrinsics::_getByte : return append_unsafe_get_obj(callee, T_BYTE, false); |
duke@435 | 3123 | case vmIntrinsics::_getShort : return append_unsafe_get_obj(callee, T_SHORT, false); |
duke@435 | 3124 | case vmIntrinsics::_getChar : return append_unsafe_get_obj(callee, T_CHAR, false); |
duke@435 | 3125 | case vmIntrinsics::_getInt : return append_unsafe_get_obj(callee, T_INT, false); |
duke@435 | 3126 | case vmIntrinsics::_getLong : return append_unsafe_get_obj(callee, T_LONG, false); |
duke@435 | 3127 | case vmIntrinsics::_getFloat : return append_unsafe_get_obj(callee, T_FLOAT, false); |
duke@435 | 3128 | case vmIntrinsics::_getDouble : return append_unsafe_get_obj(callee, T_DOUBLE, false); |
duke@435 | 3129 | |
duke@435 | 3130 | case vmIntrinsics::_putObject : return append_unsafe_put_obj(callee, T_OBJECT, false); |
duke@435 | 3131 | case vmIntrinsics::_putBoolean: return append_unsafe_put_obj(callee, T_BOOLEAN, false); |
duke@435 | 3132 | case vmIntrinsics::_putByte : return append_unsafe_put_obj(callee, T_BYTE, false); |
duke@435 | 3133 | case vmIntrinsics::_putShort : return append_unsafe_put_obj(callee, T_SHORT, false); |
duke@435 | 3134 | case vmIntrinsics::_putChar : return append_unsafe_put_obj(callee, T_CHAR, false); |
duke@435 | 3135 | case vmIntrinsics::_putInt : return append_unsafe_put_obj(callee, T_INT, false); |
duke@435 | 3136 | case vmIntrinsics::_putLong : return append_unsafe_put_obj(callee, T_LONG, false); |
duke@435 | 3137 | case vmIntrinsics::_putFloat : return append_unsafe_put_obj(callee, T_FLOAT, false); |
duke@435 | 3138 | case vmIntrinsics::_putDouble : return append_unsafe_put_obj(callee, T_DOUBLE, false); |
duke@435 | 3139 | |
duke@435 | 3140 | case vmIntrinsics::_getObjectVolatile : return append_unsafe_get_obj(callee, T_OBJECT, true); |
duke@435 | 3141 | case vmIntrinsics::_getBooleanVolatile: return append_unsafe_get_obj(callee, T_BOOLEAN, true); |
duke@435 | 3142 | case vmIntrinsics::_getByteVolatile : return append_unsafe_get_obj(callee, T_BYTE, true); |
duke@435 | 3143 | case vmIntrinsics::_getShortVolatile : return append_unsafe_get_obj(callee, T_SHORT, true); |
duke@435 | 3144 | case vmIntrinsics::_getCharVolatile : return append_unsafe_get_obj(callee, T_CHAR, true); |
duke@435 | 3145 | case vmIntrinsics::_getIntVolatile : return append_unsafe_get_obj(callee, T_INT, true); |
duke@435 | 3146 | case vmIntrinsics::_getLongVolatile : return append_unsafe_get_obj(callee, T_LONG, true); |
duke@435 | 3147 | case vmIntrinsics::_getFloatVolatile : return append_unsafe_get_obj(callee, T_FLOAT, true); |
duke@435 | 3148 | case vmIntrinsics::_getDoubleVolatile : return append_unsafe_get_obj(callee, T_DOUBLE, true); |
duke@435 | 3149 | |
duke@435 | 3150 | case vmIntrinsics::_putObjectVolatile : return append_unsafe_put_obj(callee, T_OBJECT, true); |
duke@435 | 3151 | case vmIntrinsics::_putBooleanVolatile: return append_unsafe_put_obj(callee, T_BOOLEAN, true); |
duke@435 | 3152 | case vmIntrinsics::_putByteVolatile : return append_unsafe_put_obj(callee, T_BYTE, true); |
duke@435 | 3153 | case vmIntrinsics::_putShortVolatile : return append_unsafe_put_obj(callee, T_SHORT, true); |
duke@435 | 3154 | case vmIntrinsics::_putCharVolatile : return append_unsafe_put_obj(callee, T_CHAR, true); |
duke@435 | 3155 | case vmIntrinsics::_putIntVolatile : return append_unsafe_put_obj(callee, T_INT, true); |
duke@435 | 3156 | case vmIntrinsics::_putLongVolatile : return append_unsafe_put_obj(callee, T_LONG, true); |
duke@435 | 3157 | case vmIntrinsics::_putFloatVolatile : return append_unsafe_put_obj(callee, T_FLOAT, true); |
duke@435 | 3158 | case vmIntrinsics::_putDoubleVolatile : return append_unsafe_put_obj(callee, T_DOUBLE, true); |
duke@435 | 3159 | |
duke@435 | 3160 | case vmIntrinsics::_getByte_raw : return append_unsafe_get_raw(callee, T_BYTE); |
duke@435 | 3161 | case vmIntrinsics::_getShort_raw : return append_unsafe_get_raw(callee, T_SHORT); |
duke@435 | 3162 | case vmIntrinsics::_getChar_raw : return append_unsafe_get_raw(callee, T_CHAR); |
duke@435 | 3163 | case vmIntrinsics::_getInt_raw : return append_unsafe_get_raw(callee, T_INT); |
duke@435 | 3164 | case vmIntrinsics::_getLong_raw : return append_unsafe_get_raw(callee, T_LONG); |
duke@435 | 3165 | case vmIntrinsics::_getFloat_raw : return append_unsafe_get_raw(callee, T_FLOAT); |
duke@435 | 3166 | case vmIntrinsics::_getDouble_raw : return append_unsafe_get_raw(callee, T_DOUBLE); |
duke@435 | 3167 | |
duke@435 | 3168 | case vmIntrinsics::_putByte_raw : return append_unsafe_put_raw(callee, T_BYTE); |
duke@435 | 3169 | case vmIntrinsics::_putShort_raw : return append_unsafe_put_raw(callee, T_SHORT); |
duke@435 | 3170 | case vmIntrinsics::_putChar_raw : return append_unsafe_put_raw(callee, T_CHAR); |
duke@435 | 3171 | case vmIntrinsics::_putInt_raw : return append_unsafe_put_raw(callee, T_INT); |
duke@435 | 3172 | case vmIntrinsics::_putLong_raw : return append_unsafe_put_raw(callee, T_LONG); |
duke@435 | 3173 | case vmIntrinsics::_putFloat_raw : return append_unsafe_put_raw(callee, T_FLOAT); |
duke@435 | 3174 | case vmIntrinsics::_putDouble_raw : return append_unsafe_put_raw(callee, T_DOUBLE); |
duke@435 | 3175 | |
duke@435 | 3176 | case vmIntrinsics::_prefetchRead : return append_unsafe_prefetch(callee, false, false); |
duke@435 | 3177 | case vmIntrinsics::_prefetchWrite : return append_unsafe_prefetch(callee, false, true); |
duke@435 | 3178 | case vmIntrinsics::_prefetchReadStatic : return append_unsafe_prefetch(callee, true, false); |
duke@435 | 3179 | case vmIntrinsics::_prefetchWriteStatic : return append_unsafe_prefetch(callee, true, true); |
duke@435 | 3180 | |
duke@435 | 3181 | case vmIntrinsics::_checkIndex : |
duke@435 | 3182 | if (!InlineNIOCheckIndex) return false; |
duke@435 | 3183 | preserves_state = true; |
duke@435 | 3184 | break; |
duke@435 | 3185 | case vmIntrinsics::_putOrderedObject : return append_unsafe_put_obj(callee, T_OBJECT, true); |
duke@435 | 3186 | case vmIntrinsics::_putOrderedInt : return append_unsafe_put_obj(callee, T_INT, true); |
duke@435 | 3187 | case vmIntrinsics::_putOrderedLong : return append_unsafe_put_obj(callee, T_LONG, true); |
duke@435 | 3188 | |
duke@435 | 3189 | case vmIntrinsics::_compareAndSwapLong: |
duke@435 | 3190 | if (!VM_Version::supports_cx8()) return false; |
duke@435 | 3191 | // fall through |
duke@435 | 3192 | case vmIntrinsics::_compareAndSwapInt: |
duke@435 | 3193 | case vmIntrinsics::_compareAndSwapObject: |
duke@435 | 3194 | append_unsafe_CAS(callee); |
duke@435 | 3195 | return true; |
duke@435 | 3196 | |
johnc@2781 | 3197 | case vmIntrinsics::_Reference_get: |
johnc@2781 | 3198 | // It is only when G1 is enabled that we absolutely |
johnc@2781 | 3199 | // need to use the intrinsic version of Reference.get() |
johnc@2781 | 3200 | // so that the value in the referent field, if necessary, |
johnc@2781 | 3201 | // can be registered by the pre-barrier code. |
johnc@2781 | 3202 | if (!UseG1GC) return false; |
johnc@2781 | 3203 | preserves_state = true; |
johnc@2781 | 3204 | break; |
johnc@2781 | 3205 | |
duke@435 | 3206 | default : return false; // do not inline |
duke@435 | 3207 | } |
duke@435 | 3208 | // create intrinsic node |
duke@435 | 3209 | const bool has_receiver = !callee->is_static(); |
duke@435 | 3210 | ValueType* result_type = as_ValueType(callee->return_type()); |
roland@2174 | 3211 | ValueStack* state_before = copy_state_for_exception(); |
duke@435 | 3212 | |
duke@435 | 3213 | Values* args = state()->pop_arguments(callee->arg_size()); |
iveresov@2138 | 3214 | |
iveresov@2138 | 3215 | if (is_profiling()) { |
duke@435 | 3216 | // Don't profile in the special case where the root method |
duke@435 | 3217 | // is the intrinsic |
duke@435 | 3218 | if (callee != method()) { |
iveresov@2138 | 3219 | // Note that we'd collect profile data in this method if we wanted it. |
iveresov@2138 | 3220 | compilation()->set_would_profile(true); |
iveresov@2138 | 3221 | if (profile_calls()) { |
iveresov@2138 | 3222 | Value recv = NULL; |
iveresov@2138 | 3223 | if (has_receiver) { |
iveresov@2138 | 3224 | recv = args->at(0); |
iveresov@2138 | 3225 | null_check(recv); |
iveresov@2138 | 3226 | } |
iveresov@2138 | 3227 | profile_call(recv, NULL); |
duke@435 | 3228 | } |
duke@435 | 3229 | } |
duke@435 | 3230 | } |
duke@435 | 3231 | |
roland@2174 | 3232 | Intrinsic* result = new Intrinsic(result_type, id, args, has_receiver, state_before, |
duke@435 | 3233 | preserves_state, cantrap); |
duke@435 | 3234 | // append instruction & push result |
duke@435 | 3235 | Value value = append_split(result); |
duke@435 | 3236 | if (result_type != voidType) push(result_type, value); |
duke@435 | 3237 | |
duke@435 | 3238 | #ifndef PRODUCT |
duke@435 | 3239 | // printing |
duke@435 | 3240 | if (PrintInlining) { |
duke@435 | 3241 | print_inline_result(callee, true); |
duke@435 | 3242 | } |
duke@435 | 3243 | #endif |
duke@435 | 3244 | |
duke@435 | 3245 | // done |
duke@435 | 3246 | return true; |
duke@435 | 3247 | } |
duke@435 | 3248 | |
duke@435 | 3249 | |
duke@435 | 3250 | bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) { |
duke@435 | 3251 | // Introduce a new callee continuation point - all Ret instructions |
duke@435 | 3252 | // will be replaced with Gotos to this point. |
duke@435 | 3253 | BlockBegin* cont = block_at(next_bci()); |
duke@435 | 3254 | assert(cont != NULL, "continuation must exist (BlockListBuilder starts a new block after a jsr"); |
duke@435 | 3255 | |
duke@435 | 3256 | // Note: can not assign state to continuation yet, as we have to |
duke@435 | 3257 | // pick up the state from the Ret instructions. |
duke@435 | 3258 | |
duke@435 | 3259 | // Push callee scope |
duke@435 | 3260 | push_scope_for_jsr(cont, jsr_dest_bci); |
duke@435 | 3261 | |
duke@435 | 3262 | // Temporarily set up bytecode stream so we can append instructions |
duke@435 | 3263 | // (only using the bci of this stream) |
duke@435 | 3264 | scope_data()->set_stream(scope_data()->parent()->stream()); |
duke@435 | 3265 | |
duke@435 | 3266 | BlockBegin* jsr_start_block = block_at(jsr_dest_bci); |
duke@435 | 3267 | assert(jsr_start_block != NULL, "jsr start block must exist"); |
duke@435 | 3268 | assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet"); |
duke@435 | 3269 | Goto* goto_sub = new Goto(jsr_start_block, false); |
duke@435 | 3270 | // Must copy state to avoid wrong sharing when parsing bytecodes |
duke@435 | 3271 | assert(jsr_start_block->state() == NULL, "should have fresh jsr starting block"); |
roland@2174 | 3272 | jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci)); |
duke@435 | 3273 | append(goto_sub); |
duke@435 | 3274 | _block->set_end(goto_sub); |
duke@435 | 3275 | _last = _block = jsr_start_block; |
duke@435 | 3276 | |
duke@435 | 3277 | // Clear out bytecode stream |
duke@435 | 3278 | scope_data()->set_stream(NULL); |
duke@435 | 3279 | |
duke@435 | 3280 | scope_data()->add_to_work_list(jsr_start_block); |
duke@435 | 3281 | |
duke@435 | 3282 | // Ready to resume parsing in subroutine |
duke@435 | 3283 | iterate_all_blocks(); |
duke@435 | 3284 | |
duke@435 | 3285 | // If we bailed out during parsing, return immediately (this is bad news) |
duke@435 | 3286 | CHECK_BAILOUT_(false); |
duke@435 | 3287 | |
duke@435 | 3288 | // Detect whether the continuation can actually be reached. If not, |
duke@435 | 3289 | // it has not had state set by the join() operations in |
duke@435 | 3290 | // iterate_bytecodes_for_block()/ret() and we should not touch the |
duke@435 | 3291 | // iteration state. The calling activation of |
duke@435 | 3292 | // iterate_bytecodes_for_block will then complete normally. |
duke@435 | 3293 | if (cont->state() != NULL) { |
duke@435 | 3294 | if (!cont->is_set(BlockBegin::was_visited_flag)) { |
duke@435 | 3295 | // add continuation to work list instead of parsing it immediately |
duke@435 | 3296 | scope_data()->parent()->add_to_work_list(cont); |
duke@435 | 3297 | } |
duke@435 | 3298 | } |
duke@435 | 3299 | |
duke@435 | 3300 | assert(jsr_continuation() == cont, "continuation must not have changed"); |
duke@435 | 3301 | assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) || |
duke@435 | 3302 | jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag), |
duke@435 | 3303 | "continuation can only be visited in case of backward branches"); |
duke@435 | 3304 | assert(_last && _last->as_BlockEnd(), "block must have end"); |
duke@435 | 3305 | |
duke@435 | 3306 | // continuation is in work list, so end iteration of current block |
duke@435 | 3307 | _skip_block = true; |
duke@435 | 3308 | pop_scope_for_jsr(); |
duke@435 | 3309 | |
duke@435 | 3310 | return true; |
duke@435 | 3311 | } |
duke@435 | 3312 | |
duke@435 | 3313 | |
duke@435 | 3314 | // Inline the entry of a synchronized method as a monitor enter and |
duke@435 | 3315 | // register the exception handler which releases the monitor if an |
duke@435 | 3316 | // exception is thrown within the callee. Note that the monitor enter |
duke@435 | 3317 | // cannot throw an exception itself, because the receiver is |
duke@435 | 3318 | // guaranteed to be non-null by the explicit null check at the |
duke@435 | 3319 | // beginning of inlining. |
duke@435 | 3320 | void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) { |
duke@435 | 3321 | assert(lock != NULL && sync_handler != NULL, "lock or handler missing"); |
duke@435 | 3322 | |
duke@435 | 3323 | monitorenter(lock, SynchronizationEntryBCI); |
duke@435 | 3324 | assert(_last->as_MonitorEnter() != NULL, "monitor enter expected"); |
duke@435 | 3325 | _last->set_needs_null_check(false); |
duke@435 | 3326 | |
duke@435 | 3327 | sync_handler->set(BlockBegin::exception_entry_flag); |
duke@435 | 3328 | sync_handler->set(BlockBegin::is_on_work_list_flag); |
duke@435 | 3329 | |
duke@435 | 3330 | ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0); |
duke@435 | 3331 | XHandler* h = new XHandler(desc); |
duke@435 | 3332 | h->set_entry_block(sync_handler); |
duke@435 | 3333 | scope_data()->xhandlers()->append(h); |
duke@435 | 3334 | scope_data()->set_has_handler(); |
duke@435 | 3335 | } |
duke@435 | 3336 | |
duke@435 | 3337 | |
duke@435 | 3338 | // If an exception is thrown and not handled within an inlined |
duke@435 | 3339 | // synchronized method, the monitor must be released before the |
duke@435 | 3340 | // exception is rethrown in the outer scope. Generate the appropriate |
duke@435 | 3341 | // instructions here. |
duke@435 | 3342 | void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) { |
duke@435 | 3343 | BlockBegin* orig_block = _block; |
duke@435 | 3344 | ValueStack* orig_state = _state; |
duke@435 | 3345 | Instruction* orig_last = _last; |
duke@435 | 3346 | _last = _block = sync_handler; |
duke@435 | 3347 | _state = sync_handler->state()->copy(); |
duke@435 | 3348 | |
duke@435 | 3349 | assert(sync_handler != NULL, "handler missing"); |
duke@435 | 3350 | assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here"); |
duke@435 | 3351 | |
duke@435 | 3352 | assert(lock != NULL || default_handler, "lock or handler missing"); |
duke@435 | 3353 | |
duke@435 | 3354 | XHandler* h = scope_data()->xhandlers()->remove_last(); |
duke@435 | 3355 | assert(h->entry_block() == sync_handler, "corrupt list of handlers"); |
duke@435 | 3356 | |
duke@435 | 3357 | block()->set(BlockBegin::was_visited_flag); |
duke@435 | 3358 | Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI); |
duke@435 | 3359 | assert(exception->is_pinned(), "must be"); |
duke@435 | 3360 | |
never@2600 | 3361 | int bci = SynchronizationEntryBCI; |
never@2486 | 3362 | if (compilation()->env()->dtrace_method_probes()) { |
never@2600 | 3363 | // Report exit from inline methods. We don't have a stream here |
never@2600 | 3364 | // so pass an explicit bci of SynchronizationEntryBCI. |
never@2486 | 3365 | Values* args = new Values(1); |
never@2600 | 3366 | args->push(append_with_bci(new Constant(new ObjectConstant(method())), bci)); |
never@2600 | 3367 | append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci); |
never@2486 | 3368 | } |
never@2486 | 3369 | |
duke@435 | 3370 | if (lock) { |
duke@435 | 3371 | assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing"); |
roland@2174 | 3372 | if (!lock->is_linked()) { |
never@2600 | 3373 | lock = append_with_bci(lock, bci); |
duke@435 | 3374 | } |
duke@435 | 3375 | |
duke@435 | 3376 | // exit the monitor in the context of the synchronized method |
never@2600 | 3377 | monitorexit(lock, bci); |
duke@435 | 3378 | |
duke@435 | 3379 | // exit the context of the synchronized method |
duke@435 | 3380 | if (!default_handler) { |
duke@435 | 3381 | pop_scope(); |
roland@2174 | 3382 | bci = _state->caller_state()->bci(); |
roland@2174 | 3383 | _state = _state->caller_state()->copy_for_parsing(); |
duke@435 | 3384 | } |
duke@435 | 3385 | } |
duke@435 | 3386 | |
duke@435 | 3387 | // perform the throw as if at the the call site |
duke@435 | 3388 | apush(exception); |
duke@435 | 3389 | throw_op(bci); |
duke@435 | 3390 | |
duke@435 | 3391 | BlockEnd* end = last()->as_BlockEnd(); |
duke@435 | 3392 | block()->set_end(end); |
duke@435 | 3393 | |
duke@435 | 3394 | _block = orig_block; |
duke@435 | 3395 | _state = orig_state; |
duke@435 | 3396 | _last = orig_last; |
duke@435 | 3397 | } |
duke@435 | 3398 | |
duke@435 | 3399 | |
duke@435 | 3400 | bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known) { |
duke@435 | 3401 | assert(!callee->is_native(), "callee must not be native"); |
iveresov@2988 | 3402 | if (CompilationPolicy::policy()->should_not_inline(compilation()->env(), callee)) { |
iveresov@2988 | 3403 | INLINE_BAILOUT("inlining prohibited by policy"); |
iveresov@2138 | 3404 | } |
duke@435 | 3405 | // first perform tests of things it's not possible to inline |
duke@435 | 3406 | if (callee->has_exception_handlers() && |
duke@435 | 3407 | !InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers"); |
duke@435 | 3408 | if (callee->is_synchronized() && |
duke@435 | 3409 | !InlineSynchronizedMethods ) INLINE_BAILOUT("callee is synchronized"); |
duke@435 | 3410 | if (!callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet"); |
duke@435 | 3411 | if (!callee->has_balanced_monitors()) INLINE_BAILOUT("callee's monitors do not match"); |
duke@435 | 3412 | |
duke@435 | 3413 | // Proper inlining of methods with jsrs requires a little more work. |
duke@435 | 3414 | if (callee->has_jsrs() ) INLINE_BAILOUT("jsrs not handled properly by inliner yet"); |
duke@435 | 3415 | |
duke@435 | 3416 | // When SSE2 is used on intel, then no special handling is needed |
duke@435 | 3417 | // for strictfp because the enum-constant is fixed at compile time, |
duke@435 | 3418 | // the check for UseSSE2 is needed here |
duke@435 | 3419 | if (strict_fp_requires_explicit_rounding && UseSSE < 2 && method()->is_strict() != callee->is_strict()) { |
duke@435 | 3420 | INLINE_BAILOUT("caller and callee have different strict fp requirements"); |
duke@435 | 3421 | } |
duke@435 | 3422 | |
iveresov@2349 | 3423 | if (is_profiling() && !callee->ensure_method_data()) { |
iveresov@2349 | 3424 | INLINE_BAILOUT("mdo allocation failed"); |
iveresov@2349 | 3425 | } |
never@3042 | 3426 | |
never@3042 | 3427 | // now perform tests that are based on flag settings |
never@3042 | 3428 | if (callee->should_inline()) { |
never@3042 | 3429 | // ignore heuristic controls on inlining |
never@3042 | 3430 | } else { |
never@3042 | 3431 | if (inline_level() > MaxInlineLevel ) INLINE_BAILOUT("too-deep inlining"); |
never@3042 | 3432 | if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("too-deep recursive inlining"); |
twisti@3097 | 3433 | if (callee->code_size_for_inlining() > max_inline_size() ) INLINE_BAILOUT("callee is too large"); |
never@3042 | 3434 | |
never@3042 | 3435 | // don't inline throwable methods unless the inlining tree is rooted in a throwable class |
never@3042 | 3436 | if (callee->name() == ciSymbol::object_initializer_name() && |
never@3042 | 3437 | callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) { |
never@3042 | 3438 | // Throwable constructor call |
never@3042 | 3439 | IRScope* top = scope(); |
never@3042 | 3440 | while (top->caller() != NULL) { |
never@3042 | 3441 | top = top->caller(); |
never@3042 | 3442 | } |
never@3042 | 3443 | if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) { |
never@3042 | 3444 | INLINE_BAILOUT("don't inline Throwable constructors"); |
never@3042 | 3445 | } |
never@3042 | 3446 | } |
never@3042 | 3447 | |
never@3042 | 3448 | if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) { |
never@3042 | 3449 | INLINE_BAILOUT("total inlining greater than DesiredMethodLimit"); |
never@3042 | 3450 | } |
never@3042 | 3451 | } |
never@3042 | 3452 | |
duke@435 | 3453 | #ifndef PRODUCT |
duke@435 | 3454 | // printing |
duke@435 | 3455 | if (PrintInlining) { |
duke@435 | 3456 | print_inline_result(callee, true); |
duke@435 | 3457 | } |
duke@435 | 3458 | #endif |
duke@435 | 3459 | |
duke@435 | 3460 | // NOTE: Bailouts from this point on, which occur at the |
duke@435 | 3461 | // GraphBuilder level, do not cause bailout just of the inlining but |
duke@435 | 3462 | // in fact of the entire compilation. |
duke@435 | 3463 | |
duke@435 | 3464 | BlockBegin* orig_block = block(); |
duke@435 | 3465 | |
duke@435 | 3466 | const int args_base = state()->stack_size() - callee->arg_size(); |
duke@435 | 3467 | assert(args_base >= 0, "stack underflow during inlining"); |
duke@435 | 3468 | |
duke@435 | 3469 | // Insert null check if necessary |
duke@435 | 3470 | Value recv = NULL; |
duke@435 | 3471 | if (code() != Bytecodes::_invokestatic) { |
duke@435 | 3472 | // note: null check must happen even if first instruction of callee does |
duke@435 | 3473 | // an implicit null check since the callee is in a different scope |
duke@435 | 3474 | // and we must make sure exception handling does the right thing |
duke@435 | 3475 | assert(!callee->is_static(), "callee must not be static"); |
duke@435 | 3476 | assert(callee->arg_size() > 0, "must have at least a receiver"); |
duke@435 | 3477 | recv = state()->stack_at(args_base); |
duke@435 | 3478 | null_check(recv); |
duke@435 | 3479 | } |
duke@435 | 3480 | |
iveresov@2138 | 3481 | if (is_profiling()) { |
iveresov@2138 | 3482 | // Note that we'd collect profile data in this method if we wanted it. |
iveresov@2138 | 3483 | // this may be redundant here... |
iveresov@2138 | 3484 | compilation()->set_would_profile(true); |
iveresov@2138 | 3485 | |
iveresov@2138 | 3486 | if (profile_calls()) { |
iveresov@2138 | 3487 | profile_call(recv, holder_known ? callee->holder() : NULL); |
iveresov@2138 | 3488 | } |
iveresov@2138 | 3489 | if (profile_inlined_calls()) { |
iveresov@2180 | 3490 | profile_invocation(callee, copy_state_before()); |
iveresov@2138 | 3491 | } |
duke@435 | 3492 | } |
duke@435 | 3493 | |
duke@435 | 3494 | // Introduce a new callee continuation point - if the callee has |
duke@435 | 3495 | // more than one return instruction or the return does not allow |
duke@435 | 3496 | // fall-through of control flow, all return instructions of the |
duke@435 | 3497 | // callee will need to be replaced by Goto's pointing to this |
duke@435 | 3498 | // continuation point. |
duke@435 | 3499 | BlockBegin* cont = block_at(next_bci()); |
duke@435 | 3500 | bool continuation_existed = true; |
duke@435 | 3501 | if (cont == NULL) { |
duke@435 | 3502 | cont = new BlockBegin(next_bci()); |
duke@435 | 3503 | // low number so that continuation gets parsed as early as possible |
duke@435 | 3504 | cont->set_depth_first_number(0); |
duke@435 | 3505 | #ifndef PRODUCT |
duke@435 | 3506 | if (PrintInitialBlockList) { |
duke@435 | 3507 | tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d", |
duke@435 | 3508 | cont->block_id(), cont->bci(), bci()); |
duke@435 | 3509 | } |
duke@435 | 3510 | #endif |
duke@435 | 3511 | continuation_existed = false; |
duke@435 | 3512 | } |
duke@435 | 3513 | // Record number of predecessors of continuation block before |
duke@435 | 3514 | // inlining, to detect if inlined method has edges to its |
duke@435 | 3515 | // continuation after inlining. |
duke@435 | 3516 | int continuation_preds = cont->number_of_preds(); |
duke@435 | 3517 | |
duke@435 | 3518 | // Push callee scope |
duke@435 | 3519 | push_scope(callee, cont); |
duke@435 | 3520 | |
duke@435 | 3521 | // the BlockListBuilder for the callee could have bailed out |
duke@435 | 3522 | CHECK_BAILOUT_(false); |
duke@435 | 3523 | |
duke@435 | 3524 | // Temporarily set up bytecode stream so we can append instructions |
duke@435 | 3525 | // (only using the bci of this stream) |
duke@435 | 3526 | scope_data()->set_stream(scope_data()->parent()->stream()); |
duke@435 | 3527 | |
duke@435 | 3528 | // Pass parameters into callee state: add assignments |
duke@435 | 3529 | // note: this will also ensure that all arguments are computed before being passed |
duke@435 | 3530 | ValueStack* callee_state = state(); |
roland@2174 | 3531 | ValueStack* caller_state = state()->caller_state(); |
duke@435 | 3532 | { int i = args_base; |
duke@435 | 3533 | while (i < caller_state->stack_size()) { |
duke@435 | 3534 | const int par_no = i - args_base; |
duke@435 | 3535 | Value arg = caller_state->stack_at_inc(i); |
duke@435 | 3536 | // NOTE: take base() of arg->type() to avoid problems storing |
duke@435 | 3537 | // constants |
duke@435 | 3538 | store_local(callee_state, arg, arg->type()->base(), par_no); |
duke@435 | 3539 | } |
duke@435 | 3540 | } |
duke@435 | 3541 | |
duke@435 | 3542 | // Remove args from stack. |
duke@435 | 3543 | // Note that we preserve locals state in case we can use it later |
duke@435 | 3544 | // (see use of pop_scope() below) |
duke@435 | 3545 | caller_state->truncate_stack(args_base); |
roland@2174 | 3546 | assert(callee_state->stack_size() == 0, "callee stack must be empty"); |
duke@435 | 3547 | |
duke@435 | 3548 | Value lock; |
duke@435 | 3549 | BlockBegin* sync_handler; |
duke@435 | 3550 | |
duke@435 | 3551 | // Inline the locking of the receiver if the callee is synchronized |
duke@435 | 3552 | if (callee->is_synchronized()) { |
duke@435 | 3553 | lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror()))) |
duke@435 | 3554 | : state()->local_at(0); |
roland@2174 | 3555 | sync_handler = new BlockBegin(SynchronizationEntryBCI); |
duke@435 | 3556 | inline_sync_entry(lock, sync_handler); |
duke@435 | 3557 | } |
duke@435 | 3558 | |
never@2486 | 3559 | if (compilation()->env()->dtrace_method_probes()) { |
never@2486 | 3560 | Values* args = new Values(1); |
never@2486 | 3561 | args->push(append(new Constant(new ObjectConstant(method())))); |
never@2486 | 3562 | append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args)); |
never@2486 | 3563 | } |
duke@435 | 3564 | |
duke@435 | 3565 | BlockBegin* callee_start_block = block_at(0); |
duke@435 | 3566 | if (callee_start_block != NULL) { |
duke@435 | 3567 | assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header"); |
duke@435 | 3568 | Goto* goto_callee = new Goto(callee_start_block, false); |
duke@435 | 3569 | // The state for this goto is in the scope of the callee, so use |
duke@435 | 3570 | // the entry bci for the callee instead of the call site bci. |
duke@435 | 3571 | append_with_bci(goto_callee, 0); |
duke@435 | 3572 | _block->set_end(goto_callee); |
duke@435 | 3573 | callee_start_block->merge(callee_state); |
duke@435 | 3574 | |
duke@435 | 3575 | _last = _block = callee_start_block; |
duke@435 | 3576 | |
duke@435 | 3577 | scope_data()->add_to_work_list(callee_start_block); |
duke@435 | 3578 | } |
duke@435 | 3579 | |
duke@435 | 3580 | // Clear out bytecode stream |
duke@435 | 3581 | scope_data()->set_stream(NULL); |
duke@435 | 3582 | |
duke@435 | 3583 | // Ready to resume parsing in callee (either in the same block we |
duke@435 | 3584 | // were in before or in the callee's start block) |
duke@435 | 3585 | iterate_all_blocks(callee_start_block == NULL); |
duke@435 | 3586 | |
duke@435 | 3587 | // If we bailed out during parsing, return immediately (this is bad news) |
duke@435 | 3588 | if (bailed_out()) return false; |
duke@435 | 3589 | |
duke@435 | 3590 | // iterate_all_blocks theoretically traverses in random order; in |
duke@435 | 3591 | // practice, we have only traversed the continuation if we are |
duke@435 | 3592 | // inlining into a subroutine |
duke@435 | 3593 | assert(continuation_existed || |
duke@435 | 3594 | !continuation()->is_set(BlockBegin::was_visited_flag), |
duke@435 | 3595 | "continuation should not have been parsed yet if we created it"); |
duke@435 | 3596 | |
duke@435 | 3597 | // If we bailed out during parsing, return immediately (this is bad news) |
duke@435 | 3598 | CHECK_BAILOUT_(false); |
duke@435 | 3599 | |
duke@435 | 3600 | // At this point we are almost ready to return and resume parsing of |
duke@435 | 3601 | // the caller back in the GraphBuilder. The only thing we want to do |
duke@435 | 3602 | // first is an optimization: during parsing of the callee we |
duke@435 | 3603 | // generated at least one Goto to the continuation block. If we |
duke@435 | 3604 | // generated exactly one, and if the inlined method spanned exactly |
duke@435 | 3605 | // one block (and we didn't have to Goto its entry), then we snip |
duke@435 | 3606 | // off the Goto to the continuation, allowing control to fall |
duke@435 | 3607 | // through back into the caller block and effectively performing |
duke@435 | 3608 | // block merging. This allows load elimination and CSE to take place |
duke@435 | 3609 | // across multiple callee scopes if they are relatively simple, and |
duke@435 | 3610 | // is currently essential to making inlining profitable. |
duke@435 | 3611 | if ( num_returns() == 1 |
duke@435 | 3612 | && block() == orig_block |
duke@435 | 3613 | && block() == inline_cleanup_block()) { |
duke@435 | 3614 | _last = inline_cleanup_return_prev(); |
roland@2174 | 3615 | _state = inline_cleanup_state(); |
duke@435 | 3616 | } else if (continuation_preds == cont->number_of_preds()) { |
duke@435 | 3617 | // Inlining caused that the instructions after the invoke in the |
duke@435 | 3618 | // caller are not reachable any more. So skip filling this block |
duke@435 | 3619 | // with instructions! |
duke@435 | 3620 | assert (cont == continuation(), ""); |
duke@435 | 3621 | assert(_last && _last->as_BlockEnd(), ""); |
duke@435 | 3622 | _skip_block = true; |
duke@435 | 3623 | } else { |
duke@435 | 3624 | // Resume parsing in continuation block unless it was already parsed. |
duke@435 | 3625 | // Note that if we don't change _last here, iteration in |
duke@435 | 3626 | // iterate_bytecodes_for_block will stop when we return. |
duke@435 | 3627 | if (!continuation()->is_set(BlockBegin::was_visited_flag)) { |
duke@435 | 3628 | // add continuation to work list instead of parsing it immediately |
duke@435 | 3629 | assert(_last && _last->as_BlockEnd(), ""); |
duke@435 | 3630 | scope_data()->parent()->add_to_work_list(continuation()); |
duke@435 | 3631 | _skip_block = true; |
duke@435 | 3632 | } |
duke@435 | 3633 | } |
duke@435 | 3634 | |
duke@435 | 3635 | // Fill the exception handler for synchronized methods with instructions |
duke@435 | 3636 | if (callee->is_synchronized() && sync_handler->state() != NULL) { |
duke@435 | 3637 | fill_sync_handler(lock, sync_handler); |
duke@435 | 3638 | } else { |
duke@435 | 3639 | pop_scope(); |
duke@435 | 3640 | } |
duke@435 | 3641 | |
duke@435 | 3642 | compilation()->notice_inlined_method(callee); |
duke@435 | 3643 | |
duke@435 | 3644 | return true; |
duke@435 | 3645 | } |
duke@435 | 3646 | |
duke@435 | 3647 | |
duke@435 | 3648 | void GraphBuilder::inline_bailout(const char* msg) { |
duke@435 | 3649 | assert(msg != NULL, "inline bailout msg must exist"); |
duke@435 | 3650 | _inline_bailout_msg = msg; |
duke@435 | 3651 | } |
duke@435 | 3652 | |
duke@435 | 3653 | |
duke@435 | 3654 | void GraphBuilder::clear_inline_bailout() { |
duke@435 | 3655 | _inline_bailout_msg = NULL; |
duke@435 | 3656 | } |
duke@435 | 3657 | |
duke@435 | 3658 | |
duke@435 | 3659 | void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) { |
duke@435 | 3660 | ScopeData* data = new ScopeData(NULL); |
duke@435 | 3661 | data->set_scope(scope); |
duke@435 | 3662 | data->set_bci2block(bci2block); |
duke@435 | 3663 | _scope_data = data; |
duke@435 | 3664 | _block = start; |
duke@435 | 3665 | } |
duke@435 | 3666 | |
duke@435 | 3667 | |
duke@435 | 3668 | void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) { |
duke@435 | 3669 | IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false); |
duke@435 | 3670 | scope()->add_callee(callee_scope); |
duke@435 | 3671 | |
duke@435 | 3672 | BlockListBuilder blb(compilation(), callee_scope, -1); |
duke@435 | 3673 | CHECK_BAILOUT(); |
duke@435 | 3674 | |
duke@435 | 3675 | if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) { |
duke@435 | 3676 | // this scope can be inlined directly into the caller so remove |
duke@435 | 3677 | // the block at bci 0. |
duke@435 | 3678 | blb.bci2block()->at_put(0, NULL); |
duke@435 | 3679 | } |
duke@435 | 3680 | |
roland@2174 | 3681 | set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci()))); |
duke@435 | 3682 | |
duke@435 | 3683 | ScopeData* data = new ScopeData(scope_data()); |
duke@435 | 3684 | data->set_scope(callee_scope); |
duke@435 | 3685 | data->set_bci2block(blb.bci2block()); |
duke@435 | 3686 | data->set_continuation(continuation); |
duke@435 | 3687 | _scope_data = data; |
duke@435 | 3688 | } |
duke@435 | 3689 | |
duke@435 | 3690 | |
duke@435 | 3691 | void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) { |
duke@435 | 3692 | ScopeData* data = new ScopeData(scope_data()); |
duke@435 | 3693 | data->set_parsing_jsr(); |
duke@435 | 3694 | data->set_jsr_entry_bci(jsr_dest_bci); |
duke@435 | 3695 | data->set_jsr_return_address_local(-1); |
duke@435 | 3696 | // Must clone bci2block list as we will be mutating it in order to |
duke@435 | 3697 | // properly clone all blocks in jsr region as well as exception |
duke@435 | 3698 | // handlers containing rets |
duke@435 | 3699 | BlockList* new_bci2block = new BlockList(bci2block()->length()); |
duke@435 | 3700 | new_bci2block->push_all(bci2block()); |
duke@435 | 3701 | data->set_bci2block(new_bci2block); |
duke@435 | 3702 | data->set_scope(scope()); |
duke@435 | 3703 | data->setup_jsr_xhandlers(); |
duke@435 | 3704 | data->set_continuation(continuation()); |
duke@435 | 3705 | data->set_jsr_continuation(jsr_continuation); |
duke@435 | 3706 | _scope_data = data; |
duke@435 | 3707 | } |
duke@435 | 3708 | |
duke@435 | 3709 | |
duke@435 | 3710 | void GraphBuilder::pop_scope() { |
duke@435 | 3711 | int number_of_locks = scope()->number_of_locks(); |
duke@435 | 3712 | _scope_data = scope_data()->parent(); |
duke@435 | 3713 | // accumulate minimum number of monitor slots to be reserved |
duke@435 | 3714 | scope()->set_min_number_of_locks(number_of_locks); |
duke@435 | 3715 | } |
duke@435 | 3716 | |
duke@435 | 3717 | |
duke@435 | 3718 | void GraphBuilder::pop_scope_for_jsr() { |
duke@435 | 3719 | _scope_data = scope_data()->parent(); |
duke@435 | 3720 | } |
duke@435 | 3721 | |
duke@435 | 3722 | bool GraphBuilder::append_unsafe_get_obj(ciMethod* callee, BasicType t, bool is_volatile) { |
duke@435 | 3723 | if (InlineUnsafeOps) { |
duke@435 | 3724 | Values* args = state()->pop_arguments(callee->arg_size()); |
duke@435 | 3725 | null_check(args->at(0)); |
duke@435 | 3726 | Instruction* offset = args->at(2); |
duke@435 | 3727 | #ifndef _LP64 |
duke@435 | 3728 | offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); |
duke@435 | 3729 | #endif |
duke@435 | 3730 | Instruction* op = append(new UnsafeGetObject(t, args->at(1), offset, is_volatile)); |
duke@435 | 3731 | push(op->type(), op); |
duke@435 | 3732 | compilation()->set_has_unsafe_access(true); |
duke@435 | 3733 | } |
duke@435 | 3734 | return InlineUnsafeOps; |
duke@435 | 3735 | } |
duke@435 | 3736 | |
duke@435 | 3737 | |
duke@435 | 3738 | bool GraphBuilder::append_unsafe_put_obj(ciMethod* callee, BasicType t, bool is_volatile) { |
duke@435 | 3739 | if (InlineUnsafeOps) { |
duke@435 | 3740 | Values* args = state()->pop_arguments(callee->arg_size()); |
duke@435 | 3741 | null_check(args->at(0)); |
duke@435 | 3742 | Instruction* offset = args->at(2); |
duke@435 | 3743 | #ifndef _LP64 |
duke@435 | 3744 | offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); |
duke@435 | 3745 | #endif |
duke@435 | 3746 | Instruction* op = append(new UnsafePutObject(t, args->at(1), offset, args->at(3), is_volatile)); |
duke@435 | 3747 | compilation()->set_has_unsafe_access(true); |
duke@435 | 3748 | kill_all(); |
duke@435 | 3749 | } |
duke@435 | 3750 | return InlineUnsafeOps; |
duke@435 | 3751 | } |
duke@435 | 3752 | |
duke@435 | 3753 | |
duke@435 | 3754 | bool GraphBuilder::append_unsafe_get_raw(ciMethod* callee, BasicType t) { |
duke@435 | 3755 | if (InlineUnsafeOps) { |
duke@435 | 3756 | Values* args = state()->pop_arguments(callee->arg_size()); |
duke@435 | 3757 | null_check(args->at(0)); |
duke@435 | 3758 | Instruction* op = append(new UnsafeGetRaw(t, args->at(1), false)); |
duke@435 | 3759 | push(op->type(), op); |
duke@435 | 3760 | compilation()->set_has_unsafe_access(true); |
duke@435 | 3761 | } |
duke@435 | 3762 | return InlineUnsafeOps; |
duke@435 | 3763 | } |
duke@435 | 3764 | |
duke@435 | 3765 | |
duke@435 | 3766 | bool GraphBuilder::append_unsafe_put_raw(ciMethod* callee, BasicType t) { |
duke@435 | 3767 | if (InlineUnsafeOps) { |
duke@435 | 3768 | Values* args = state()->pop_arguments(callee->arg_size()); |
duke@435 | 3769 | null_check(args->at(0)); |
duke@435 | 3770 | Instruction* op = append(new UnsafePutRaw(t, args->at(1), args->at(2))); |
duke@435 | 3771 | compilation()->set_has_unsafe_access(true); |
duke@435 | 3772 | } |
duke@435 | 3773 | return InlineUnsafeOps; |
duke@435 | 3774 | } |
duke@435 | 3775 | |
duke@435 | 3776 | |
duke@435 | 3777 | bool GraphBuilder::append_unsafe_prefetch(ciMethod* callee, bool is_static, bool is_store) { |
duke@435 | 3778 | if (InlineUnsafeOps) { |
duke@435 | 3779 | Values* args = state()->pop_arguments(callee->arg_size()); |
duke@435 | 3780 | int obj_arg_index = 1; // Assume non-static case |
duke@435 | 3781 | if (is_static) { |
duke@435 | 3782 | obj_arg_index = 0; |
duke@435 | 3783 | } else { |
duke@435 | 3784 | null_check(args->at(0)); |
duke@435 | 3785 | } |
duke@435 | 3786 | Instruction* offset = args->at(obj_arg_index + 1); |
duke@435 | 3787 | #ifndef _LP64 |
duke@435 | 3788 | offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); |
duke@435 | 3789 | #endif |
duke@435 | 3790 | Instruction* op = is_store ? append(new UnsafePrefetchWrite(args->at(obj_arg_index), offset)) |
duke@435 | 3791 | : append(new UnsafePrefetchRead (args->at(obj_arg_index), offset)); |
duke@435 | 3792 | compilation()->set_has_unsafe_access(true); |
duke@435 | 3793 | } |
duke@435 | 3794 | return InlineUnsafeOps; |
duke@435 | 3795 | } |
duke@435 | 3796 | |
duke@435 | 3797 | |
duke@435 | 3798 | void GraphBuilder::append_unsafe_CAS(ciMethod* callee) { |
roland@2174 | 3799 | ValueStack* state_before = copy_state_for_exception(); |
duke@435 | 3800 | ValueType* result_type = as_ValueType(callee->return_type()); |
duke@435 | 3801 | assert(result_type->is_int(), "int result"); |
duke@435 | 3802 | Values* args = state()->pop_arguments(callee->arg_size()); |
duke@435 | 3803 | |
duke@435 | 3804 | // Pop off some args to speically handle, then push back |
duke@435 | 3805 | Value newval = args->pop(); |
duke@435 | 3806 | Value cmpval = args->pop(); |
duke@435 | 3807 | Value offset = args->pop(); |
duke@435 | 3808 | Value src = args->pop(); |
duke@435 | 3809 | Value unsafe_obj = args->pop(); |
duke@435 | 3810 | |
duke@435 | 3811 | // Separately handle the unsafe arg. It is not needed for code |
duke@435 | 3812 | // generation, but must be null checked |
duke@435 | 3813 | null_check(unsafe_obj); |
duke@435 | 3814 | |
duke@435 | 3815 | #ifndef _LP64 |
duke@435 | 3816 | offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); |
duke@435 | 3817 | #endif |
duke@435 | 3818 | |
duke@435 | 3819 | args->push(src); |
duke@435 | 3820 | args->push(offset); |
duke@435 | 3821 | args->push(cmpval); |
duke@435 | 3822 | args->push(newval); |
duke@435 | 3823 | |
duke@435 | 3824 | // An unsafe CAS can alias with other field accesses, but we don't |
duke@435 | 3825 | // know which ones so mark the state as no preserved. This will |
duke@435 | 3826 | // cause CSE to invalidate memory across it. |
duke@435 | 3827 | bool preserves_state = false; |
roland@2174 | 3828 | Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state); |
duke@435 | 3829 | append_split(result); |
duke@435 | 3830 | push(result_type, result); |
duke@435 | 3831 | compilation()->set_has_unsafe_access(true); |
duke@435 | 3832 | } |
duke@435 | 3833 | |
duke@435 | 3834 | |
duke@435 | 3835 | #ifndef PRODUCT |
duke@435 | 3836 | void GraphBuilder::print_inline_result(ciMethod* callee, bool res) { |
twisti@2687 | 3837 | CompileTask::print_inlining(callee, scope()->level(), bci(), _inline_bailout_msg); |
duke@435 | 3838 | if (res && CIPrintMethodCodes) { |
duke@435 | 3839 | callee->print_codes(); |
duke@435 | 3840 | } |
duke@435 | 3841 | } |
duke@435 | 3842 | |
duke@435 | 3843 | |
duke@435 | 3844 | void GraphBuilder::print_stats() { |
duke@435 | 3845 | vmap()->print(); |
duke@435 | 3846 | } |
duke@435 | 3847 | #endif // PRODUCT |
duke@435 | 3848 | |
duke@435 | 3849 | void GraphBuilder::profile_call(Value recv, ciKlass* known_holder) { |
duke@435 | 3850 | append(new ProfileCall(method(), bci(), recv, known_holder)); |
duke@435 | 3851 | } |
duke@435 | 3852 | |
iveresov@2180 | 3853 | void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) { |
iveresov@2180 | 3854 | append(new ProfileInvoke(callee, state)); |
duke@435 | 3855 | } |