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