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