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