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/ciFlatArrayKlass.hpp"
33 #include "ci/ciInlineKlass.hpp"
34 #include "ci/ciKlass.hpp"
35 #include "ci/ciMemberName.hpp"
36 #include "ci/ciSymbols.hpp"
37 #include "ci/ciUtilities.inline.hpp"
38 #include "classfile/javaClasses.hpp"
39 #include "compiler/compilationPolicy.hpp"
40 #include "compiler/compileBroker.hpp"
41 #include "compiler/compilerEvent.hpp"
42 #include "interpreter/bytecode.hpp"
43 #include "jfr/jfrEvents.hpp"
44 #include "memory/resourceArea.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 = nullptr;
1053 int array_idx = state()->stack_size() - 2;
1054 if (type == T_OBJECT && state()->stack_at(array_idx)->maybe_flat_array()) {
1055 // Save the entire state and re-execute on deopt when accessing flat arrays
1056 state_before = copy_state_before();
1057 state_before->set_should_reexecute(true);
1058 } else {
1059 state_before = copy_state_indexed_access();
1060 }
1061 compilation()->set_has_access_indexed(true);
1062 Value index = ipop();
1063 Value array = apop();
1064 Value length = nullptr;
1065 if (CSEArrayLength ||
1066 (array->as_Constant() != nullptr) ||
1067 (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1068 (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1069 (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
1070 length = append(new ArrayLength(array, state_before));
1071 }
1072
1073 bool need_membar = false;
1074 LoadIndexed* load_indexed = nullptr;
1075 Instruction* result = nullptr;
1076 if (array->is_loaded_flat_array()) {
1077 // TODO 8350865 This is currently dead code
1078 ciType* array_type = array->declared_type();
1079 ciInlineKlass* elem_klass = array_type->as_flat_array_klass()->element_klass()->as_inline_klass();
1080
1081 bool can_delay_access = false;
1082 ciBytecodeStream s(method());
1083 s.force_bci(bci());
1084 s.next();
1085 if (s.cur_bc() == Bytecodes::_getfield) {
1086 bool will_link;
1087 ciField* next_field = s.get_field(will_link);
1088 bool next_needs_patching = !next_field->holder()->is_initialized() ||
1089 !next_field->will_link(method(), Bytecodes::_getfield) ||
1090 PatchALot;
1091 can_delay_access = C1UseDelayedFlattenedFieldReads && !next_needs_patching;
1092 }
1093 if (can_delay_access) {
1094 // potentially optimizable array access, storing information for delayed decision
1095 LoadIndexed* li = new LoadIndexed(array, index, length, type, state_before);
1096 DelayedLoadIndexed* dli = new DelayedLoadIndexed(li, state_before);
1097 li->set_delayed(dli);
1098 set_pending_load_indexed(dli);
1099 return; // Nothing else to do for now
1100 } else {
1101 NewInstance* new_instance = new NewInstance(elem_klass, state_before, false, true);
1102 _memory->new_instance(new_instance);
1103 apush(append_split(new_instance));
1104 load_indexed = new LoadIndexed(array, index, length, type, state_before);
1105 load_indexed->set_vt(new_instance);
1106 // The LoadIndexed node will initialise this instance by copying from
1107 // the flat field. Ensure these stores are visible before any
1108 // subsequent store that publishes this reference.
1109 need_membar = true;
1110 }
1111 } else {
1112 load_indexed = new LoadIndexed(array, index, length, type, state_before);
1113 if (profile_array_accesses() && is_reference_type(type)) {
1114 compilation()->set_would_profile(true);
1115 load_indexed->set_should_profile(true);
1116 load_indexed->set_profiled_method(method());
1117 load_indexed->set_profiled_bci(bci());
1118 }
1119 }
1120 result = append(load_indexed);
1121 if (need_membar) {
1122 append(new MemBar(lir_membar_storestore));
1123 }
1124 assert(!load_indexed->should_profile() || load_indexed == result, "should not be optimized out");
1125 if (!array->is_loaded_flat_array()) {
1126 push(as_ValueType(type), result);
1127 }
1128 }
1129
1130
1131 void GraphBuilder::store_indexed(BasicType type) {
1132 // In case of in block code motion in range check elimination
1133 ValueStack* state_before = nullptr;
1134 int array_idx = state()->stack_size() - 3;
1135 if (type == T_OBJECT && state()->stack_at(array_idx)->maybe_flat_array()) {
1136 // Save the entire state and re-execute on deopt when accessing flat arrays
1137 state_before = copy_state_before();
1138 state_before->set_should_reexecute(true);
1139 } else {
1140 state_before = copy_state_indexed_access();
1141 }
1142 compilation()->set_has_access_indexed(true);
1143 Value value = pop(as_ValueType(type));
1144 Value index = ipop();
1145 Value array = apop();
1146 Value length = nullptr;
1147 if (CSEArrayLength ||
1148 (array->as_Constant() != nullptr) ||
1149 (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1150 (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1151 (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
1152 length = append(new ArrayLength(array, state_before));
1153 }
1154 ciType* array_type = array->declared_type();
1155 bool check_boolean = false;
1156 if (array_type != nullptr) {
1157 if (array_type->is_loaded() &&
1158 array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {
1159 assert(type == T_BYTE, "boolean store uses bastore");
1160 Value mask = append(new Constant(new IntConstant(1)));
1161 value = append(new LogicOp(Bytecodes::_iand, value, mask));
1162 }
1163 } else if (type == T_BYTE) {
1164 check_boolean = true;
1165 }
1166
1167 StoreIndexed* store_indexed = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
1168 if (profile_array_accesses() && is_reference_type(type) && !array->is_loaded_flat_array()) {
1169 compilation()->set_would_profile(true);
1170 store_indexed->set_should_profile(true);
1171 store_indexed->set_profiled_method(method());
1172 store_indexed->set_profiled_bci(bci());
1173 }
1174 Instruction* result = append(store_indexed);
1175 assert(!store_indexed->should_profile() || store_indexed == result, "should not be optimized out");
1176 _memory->store_value(value);
1177 }
1178
1179 void GraphBuilder::stack_op(Bytecodes::Code code) {
1180 switch (code) {
1181 case Bytecodes::_pop:
1182 { Value w = state()->raw_pop();
1183 }
1184 break;
1185 case Bytecodes::_pop2:
1186 { Value w1 = state()->raw_pop();
1187 Value w2 = state()->raw_pop();
1188 }
1189 break;
1190 case Bytecodes::_dup:
1191 { Value w = state()->raw_pop();
1192 state()->raw_push(w);
1193 state()->raw_push(w);
1194 }
1195 break;
1196 case Bytecodes::_dup_x1:
1197 { Value w1 = state()->raw_pop();
1198 Value w2 = state()->raw_pop();
1199 state()->raw_push(w1);
1200 state()->raw_push(w2);
1201 state()->raw_push(w1);
1202 }
1203 break;
1204 case Bytecodes::_dup_x2:
1205 { Value w1 = state()->raw_pop();
1206 Value w2 = state()->raw_pop();
1207 Value w3 = state()->raw_pop();
1208 state()->raw_push(w1);
1209 state()->raw_push(w3);
1210 state()->raw_push(w2);
1211 state()->raw_push(w1);
1212 }
1213 break;
1214 case Bytecodes::_dup2:
1215 { Value w1 = state()->raw_pop();
1216 Value w2 = state()->raw_pop();
1217 state()->raw_push(w2);
1218 state()->raw_push(w1);
1219 state()->raw_push(w2);
1220 state()->raw_push(w1);
1221 }
1222 break;
1223 case Bytecodes::_dup2_x1:
1224 { Value w1 = state()->raw_pop();
1225 Value w2 = state()->raw_pop();
1226 Value w3 = state()->raw_pop();
1227 state()->raw_push(w2);
1228 state()->raw_push(w1);
1229 state()->raw_push(w3);
1230 state()->raw_push(w2);
1231 state()->raw_push(w1);
1232 }
1233 break;
1234 case Bytecodes::_dup2_x2:
1235 { Value w1 = state()->raw_pop();
1236 Value w2 = state()->raw_pop();
1237 Value w3 = state()->raw_pop();
1238 Value w4 = state()->raw_pop();
1239 state()->raw_push(w2);
1240 state()->raw_push(w1);
1241 state()->raw_push(w4);
1242 state()->raw_push(w3);
1243 state()->raw_push(w2);
1244 state()->raw_push(w1);
1245 }
1246 break;
1247 case Bytecodes::_swap:
1248 { Value w1 = state()->raw_pop();
1249 Value w2 = state()->raw_pop();
1250 state()->raw_push(w1);
1251 state()->raw_push(w2);
1252 }
1253 break;
1254 default:
1255 ShouldNotReachHere();
1256 break;
1257 }
1258 }
1259
1260
1261 void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) {
1262 Value y = pop(type);
1263 Value x = pop(type);
1264 Value res = new ArithmeticOp(code, x, y, state_before);
1265 push(type, append(res));
1266 }
1267
1268
1269 void GraphBuilder::negate_op(ValueType* type) {
1270 push(type, append(new NegateOp(pop(type))));
1271 }
1272
1273
1274 void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {
1275 Value s = ipop();
1276 Value x = pop(type);
1277 // try to simplify
1278 // Note: This code should go into the canonicalizer as soon as it can
1279 // can handle canonicalized forms that contain more than one node.
1280 if (CanonicalizeNodes && code == Bytecodes::_iushr) {
1281 // pattern: x >>> s
1282 IntConstant* s1 = s->type()->as_IntConstant();
1283 if (s1 != nullptr) {
1284 // pattern: x >>> s1, with s1 constant
1285 ShiftOp* l = x->as_ShiftOp();
1286 if (l != nullptr && l->op() == Bytecodes::_ishl) {
1287 // pattern: (a << b) >>> s1
1288 IntConstant* s0 = l->y()->type()->as_IntConstant();
1289 if (s0 != nullptr) {
1290 // pattern: (a << s0) >>> s1
1291 const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
1292 const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
1293 if (s0c == s1c) {
1294 if (s0c == 0) {
1295 // pattern: (a << 0) >>> 0 => simplify to: a
1296 ipush(l->x());
1297 } else {
1298 // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
1299 assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
1300 const int m = checked_cast<int>(right_n_bits(BitsPerInt - s0c));
1301 Value s = append(new Constant(new IntConstant(m)));
1302 ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
1303 }
1304 return;
1305 }
1306 }
1307 }
1308 }
1309 }
1310 // could not simplify
1311 push(type, append(new ShiftOp(code, x, s)));
1312 }
1313
1314
1315 void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {
1316 Value y = pop(type);
1317 Value x = pop(type);
1318 push(type, append(new LogicOp(code, x, y)));
1319 }
1320
1321
1322 void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {
1323 ValueStack* state_before = copy_state_before();
1324 Value y = pop(type);
1325 Value x = pop(type);
1326 ipush(append(new CompareOp(code, x, y, state_before)));
1327 }
1328
1329
1330 void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {
1331 push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
1332 }
1333
1334
1335 void GraphBuilder::increment() {
1336 int index = stream()->get_index();
1337 int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
1338 load_local(intType, index);
1339 ipush(append(new Constant(new IntConstant(delta))));
1340 arithmetic_op(intType, Bytecodes::_iadd);
1341 store_local(intType, index);
1342 }
1343
1344
1345 void GraphBuilder::_goto(int from_bci, int to_bci) {
1346 Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1347 if (is_profiling()) {
1348 compilation()->set_would_profile(true);
1349 x->set_profiled_bci(bci());
1350 if (profile_branches()) {
1351 x->set_profiled_method(method());
1352 x->set_should_profile(true);
1353 }
1354 }
1355 append(x);
1356 }
1357
1358
1359 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1360 BlockBegin* tsux = block_at(stream()->get_dest());
1361 BlockBegin* fsux = block_at(stream()->next_bci());
1362 bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1363
1364 bool subst_check = false;
1365 if (EnableValhalla && (stream()->cur_bc() == Bytecodes::_if_acmpeq || stream()->cur_bc() == Bytecodes::_if_acmpne)) {
1366 ValueType* left_vt = x->type();
1367 ValueType* right_vt = y->type();
1368 if (left_vt->is_object()) {
1369 assert(right_vt->is_object(), "must be");
1370 ciKlass* left_klass = x->as_loaded_klass_or_null();
1371 ciKlass* right_klass = y->as_loaded_klass_or_null();
1372
1373 if (left_klass == nullptr || right_klass == nullptr) {
1374 // The klass is still unloaded, or came from a Phi node. Go slow case;
1375 subst_check = true;
1376 } else if (left_klass->can_be_inline_klass() || right_klass->can_be_inline_klass()) {
1377 // Either operand may be a value object, but we're not sure. Go slow case;
1378 subst_check = true;
1379 } else {
1380 // No need to do substitutability check
1381 }
1382 }
1383 }
1384 if ((stream()->cur_bc() == Bytecodes::_if_acmpeq || stream()->cur_bc() == Bytecodes::_if_acmpne) &&
1385 is_profiling() && profile_branches()) {
1386 compilation()->set_would_profile(true);
1387 append(new ProfileACmpTypes(method(), bci(), x, y));
1388 }
1389
1390 // In case of loop invariant code motion or predicate insertion
1391 // before the body of a loop the state is needed
1392 Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic() || subst_check) ? state_before : nullptr, is_bb, subst_check));
1393
1394 assert(i->as_Goto() == nullptr ||
1395 (i->as_Goto()->sux_at(0) == tsux && i->as_Goto()->is_safepoint() == (tsux->bci() < stream()->cur_bci())) ||
1396 (i->as_Goto()->sux_at(0) == fsux && i->as_Goto()->is_safepoint() == (fsux->bci() < stream()->cur_bci())),
1397 "safepoint state of Goto returned by canonicalizer incorrect");
1398
1399 if (is_profiling()) {
1400 If* if_node = i->as_If();
1401 if (if_node != nullptr) {
1402 // Note that we'd collect profile data in this method if we wanted it.
1403 compilation()->set_would_profile(true);
1404 // At level 2 we need the proper bci to count backedges
1405 if_node->set_profiled_bci(bci());
1406 if (profile_branches()) {
1407 // Successors can be rotated by the canonicalizer, check for this case.
1408 if_node->set_profiled_method(method());
1409 if_node->set_should_profile(true);
1410 if (if_node->tsux() == fsux) {
1411 if_node->set_swapped(true);
1412 }
1413 }
1414 return;
1415 }
1416
1417 // Check if this If was reduced to Goto.
1418 Goto *goto_node = i->as_Goto();
1419 if (goto_node != nullptr) {
1420 compilation()->set_would_profile(true);
1421 goto_node->set_profiled_bci(bci());
1422 if (profile_branches()) {
1423 goto_node->set_profiled_method(method());
1424 goto_node->set_should_profile(true);
1425 // Find out which successor is used.
1426 if (goto_node->default_sux() == tsux) {
1427 goto_node->set_direction(Goto::taken);
1428 } else if (goto_node->default_sux() == fsux) {
1429 goto_node->set_direction(Goto::not_taken);
1430 } else {
1431 ShouldNotReachHere();
1432 }
1433 }
1434 return;
1435 }
1436 }
1437 }
1438
1439
1440 void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {
1441 Value y = append(new Constant(intZero));
1442 ValueStack* state_before = copy_state_before();
1443 Value x = ipop();
1444 if_node(x, cond, y, state_before);
1445 }
1446
1447
1448 void GraphBuilder::if_null(ValueType* type, If::Condition cond) {
1449 Value y = append(new Constant(objectNull));
1450 ValueStack* state_before = copy_state_before();
1451 Value x = apop();
1452 if_node(x, cond, y, state_before);
1453 }
1454
1455
1456 void GraphBuilder::if_same(ValueType* type, If::Condition cond) {
1457 ValueStack* state_before = copy_state_before();
1458 Value y = pop(type);
1459 Value x = pop(type);
1460 if_node(x, cond, y, state_before);
1461 }
1462
1463
1464 void GraphBuilder::jsr(int dest) {
1465 // We only handle well-formed jsrs (those which are "block-structured").
1466 // If the bytecodes are strange (jumping out of a jsr block) then we
1467 // might end up trying to re-parse a block containing a jsr which
1468 // has already been activated. Watch for this case and bail out.
1469 if (next_bci() >= method()->code_size()) {
1470 // This can happen if the subroutine does not terminate with a ret,
1471 // effectively turning the jsr into a goto.
1472 BAILOUT("too-complicated jsr/ret structure");
1473 }
1474 for (ScopeData* cur_scope_data = scope_data();
1475 cur_scope_data != nullptr && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1476 cur_scope_data = cur_scope_data->parent()) {
1477 if (cur_scope_data->jsr_entry_bci() == dest) {
1478 BAILOUT("too-complicated jsr/ret structure");
1479 }
1480 }
1481
1482 push(addressType, append(new Constant(new AddressConstant(next_bci()))));
1483 if (!try_inline_jsr(dest)) {
1484 return; // bailed out while parsing and inlining subroutine
1485 }
1486 }
1487
1488
1489 void GraphBuilder::ret(int local_index) {
1490 if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");
1491
1492 if (local_index != scope_data()->jsr_return_address_local()) {
1493 BAILOUT("can not handle complicated jsr/ret constructs");
1494 }
1495
1496 // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
1497 append(new Goto(scope_data()->jsr_continuation(), false));
1498 }
1499
1500
1501 void GraphBuilder::table_switch() {
1502 Bytecode_tableswitch sw(stream());
1503 const int l = sw.length();
1504 if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {
1505 // total of 2 successors => use If instead of switch
1506 // Note: This code should go into the canonicalizer as soon as it can
1507 // can handle canonicalized forms that contain more than one node.
1508 Value key = append(new Constant(new IntConstant(sw.low_key())));
1509 BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0));
1510 BlockBegin* fsux = block_at(bci() + sw.default_offset());
1511 bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1512 // In case of loop invariant code motion or predicate insertion
1513 // before the body of a loop the state is needed
1514 ValueStack* state_before = copy_state_if_bb(is_bb);
1515 append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1516 } else {
1517 // collect successors
1518 BlockList* sux = new BlockList(l + 1, nullptr);
1519 int i;
1520 bool has_bb = false;
1521 for (i = 0; i < l; i++) {
1522 sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1523 if (sw.dest_offset_at(i) < 0) has_bb = true;
1524 }
1525 // add default successor
1526 if (sw.default_offset() < 0) has_bb = true;
1527 sux->at_put(i, block_at(bci() + sw.default_offset()));
1528 // In case of loop invariant code motion or predicate insertion
1529 // before the body of a loop the state is needed
1530 ValueStack* state_before = copy_state_if_bb(has_bb);
1531 Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1532 #ifdef ASSERT
1533 if (res->as_Goto()) {
1534 for (i = 0; i < l; i++) {
1535 if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1536 assert(res->as_Goto()->is_safepoint() == (sw.dest_offset_at(i) < 0), "safepoint state of Goto returned by canonicalizer incorrect");
1537 }
1538 }
1539 }
1540 #endif
1541 }
1542 }
1543
1544
1545 void GraphBuilder::lookup_switch() {
1546 Bytecode_lookupswitch sw(stream());
1547 const int l = sw.number_of_pairs();
1548 if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {
1549 // total of 2 successors => use If instead of switch
1550 // Note: This code should go into the canonicalizer as soon as it can
1551 // can handle canonicalized forms that contain more than one node.
1552 // simplify to If
1553 LookupswitchPair pair = sw.pair_at(0);
1554 Value key = append(new Constant(new IntConstant(pair.match())));
1555 BlockBegin* tsux = block_at(bci() + pair.offset());
1556 BlockBegin* fsux = block_at(bci() + sw.default_offset());
1557 bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1558 // In case of loop invariant code motion or predicate insertion
1559 // before the body of a loop the state is needed
1560 ValueStack* state_before = copy_state_if_bb(is_bb);;
1561 append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1562 } else {
1563 // collect successors & keys
1564 BlockList* sux = new BlockList(l + 1, nullptr);
1565 intArray* keys = new intArray(l, l, 0);
1566 int i;
1567 bool has_bb = false;
1568 for (i = 0; i < l; i++) {
1569 LookupswitchPair pair = sw.pair_at(i);
1570 if (pair.offset() < 0) has_bb = true;
1571 sux->at_put(i, block_at(bci() + pair.offset()));
1572 keys->at_put(i, pair.match());
1573 }
1574 // add default successor
1575 if (sw.default_offset() < 0) has_bb = true;
1576 sux->at_put(i, block_at(bci() + sw.default_offset()));
1577 // In case of loop invariant code motion or predicate insertion
1578 // before the body of a loop the state is needed
1579 ValueStack* state_before = copy_state_if_bb(has_bb);
1580 Instruction* res = append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
1581 #ifdef ASSERT
1582 if (res->as_Goto()) {
1583 for (i = 0; i < l; i++) {
1584 if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1585 assert(res->as_Goto()->is_safepoint() == (sw.pair_at(i).offset() < 0), "safepoint state of Goto returned by canonicalizer incorrect");
1586 }
1587 }
1588 }
1589 #endif
1590 }
1591 }
1592
1593 void GraphBuilder::call_register_finalizer() {
1594 // If the receiver requires finalization then emit code to perform
1595 // the registration on return.
1596
1597 // Gather some type information about the receiver
1598 Value receiver = state()->local_at(0);
1599 assert(receiver != nullptr, "must have a receiver");
1600 ciType* declared_type = receiver->declared_type();
1601 ciType* exact_type = receiver->exact_type();
1602 if (exact_type == nullptr &&
1603 receiver->as_Local() &&
1604 receiver->as_Local()->java_index() == 0) {
1605 ciInstanceKlass* ik = compilation()->method()->holder();
1606 if (ik->is_final()) {
1607 exact_type = ik;
1608 } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {
1609 // test class is leaf class
1610 compilation()->dependency_recorder()->assert_leaf_type(ik);
1611 exact_type = ik;
1612 } else {
1613 declared_type = ik;
1614 }
1615 }
1616
1617 // see if we know statically that registration isn't required
1618 bool needs_check = true;
1619 if (exact_type != nullptr) {
1620 needs_check = exact_type->as_instance_klass()->has_finalizer();
1621 } else if (declared_type != nullptr) {
1622 ciInstanceKlass* ik = declared_type->as_instance_klass();
1623 if (!Dependencies::has_finalizable_subclass(ik)) {
1624 compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
1625 needs_check = false;
1626 }
1627 }
1628
1629 if (needs_check) {
1630 // Perform the registration of finalizable objects.
1631 ValueStack* state_before = copy_state_for_exception();
1632 load_local(objectType, 0);
1633 append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1634 state()->pop_arguments(1),
1635 true, state_before, true));
1636 }
1637 }
1638
1639
1640 void GraphBuilder::method_return(Value x, bool ignore_return) {
1641 if (method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1642 call_register_finalizer();
1643 }
1644
1645 // The conditions for a memory barrier are described in Parse::do_exits().
1646 bool need_mem_bar = false;
1647 if (method()->is_object_constructor() &&
1648 (scope()->wrote_final() || scope()->wrote_stable() ||
1649 (AlwaysSafeConstructors && scope()->wrote_fields()) ||
1650 (support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile()))) {
1651 need_mem_bar = true;
1652 }
1653
1654 BasicType bt = method()->return_type()->basic_type();
1655 switch (bt) {
1656 case T_BYTE:
1657 {
1658 Value shift = append(new Constant(new IntConstant(24)));
1659 x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1660 x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1661 break;
1662 }
1663 case T_SHORT:
1664 {
1665 Value shift = append(new Constant(new IntConstant(16)));
1666 x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1667 x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1668 break;
1669 }
1670 case T_CHAR:
1671 {
1672 Value mask = append(new Constant(new IntConstant(0xFFFF)));
1673 x = append(new LogicOp(Bytecodes::_iand, x, mask));
1674 break;
1675 }
1676 case T_BOOLEAN:
1677 {
1678 Value mask = append(new Constant(new IntConstant(1)));
1679 x = append(new LogicOp(Bytecodes::_iand, x, mask));
1680 break;
1681 }
1682 default:
1683 break;
1684 }
1685
1686 // Check to see whether we are inlining. If so, Return
1687 // instructions become Gotos to the continuation point.
1688 if (continuation() != nullptr) {
1689
1690 int invoke_bci = state()->caller_state()->bci();
1691
1692 if (x != nullptr && !ignore_return) {
1693 ciMethod* caller = state()->scope()->caller()->method();
1694 Bytecodes::Code invoke_raw_bc = caller->raw_code_at_bci(invoke_bci);
1695 if (invoke_raw_bc == Bytecodes::_invokehandle || invoke_raw_bc == Bytecodes::_invokedynamic) {
1696 ciType* declared_ret_type = caller->get_declared_signature_at_bci(invoke_bci)->return_type();
1697 if (declared_ret_type->is_klass() && x->exact_type() == nullptr &&
1698 x->declared_type() != declared_ret_type && declared_ret_type != compilation()->env()->Object_klass()) {
1699 x = append(new TypeCast(declared_ret_type->as_klass(), x, copy_state_before()));
1700 }
1701 }
1702 }
1703
1704 assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
1705
1706 if (compilation()->env()->dtrace_method_probes()) {
1707 // Report exit from inline methods
1708 Values* args = new Values(1);
1709 args->push(append(new Constant(new MethodConstant(method()))));
1710 append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args));
1711 }
1712
1713 // If the inlined method is synchronized, the monitor must be
1714 // released before we jump to the continuation block.
1715 if (method()->is_synchronized()) {
1716 assert(state()->locks_size() == 1, "receiver must be locked here");
1717 monitorexit(state()->lock_at(0), SynchronizationEntryBCI);
1718 }
1719
1720 if (need_mem_bar) {
1721 append(new MemBar(lir_membar_storestore));
1722 }
1723
1724 // State at end of inlined method is the state of the caller
1725 // without the method parameters on stack, including the
1726 // return value, if any, of the inlined method on operand stack.
1727 set_state(state()->caller_state()->copy_for_parsing());
1728 if (x != nullptr) {
1729 if (!ignore_return) {
1730 state()->push(x->type(), x);
1731 }
1732 if (profile_return() && x->type()->is_object_kind()) {
1733 ciMethod* caller = state()->scope()->method();
1734 profile_return_type(x, method(), caller, invoke_bci);
1735 }
1736 }
1737 Goto* goto_callee = new Goto(continuation(), false);
1738
1739 // See whether this is the first return; if so, store off some
1740 // of the state for later examination
1741 if (num_returns() == 0) {
1742 set_inline_cleanup_info();
1743 }
1744
1745 // The current bci() is in the wrong scope, so use the bci() of
1746 // the continuation point.
1747 append_with_bci(goto_callee, scope_data()->continuation()->bci());
1748 incr_num_returns();
1749 return;
1750 }
1751
1752 state()->truncate_stack(0);
1753 if (method()->is_synchronized()) {
1754 // perform the unlocking before exiting the method
1755 Value receiver;
1756 if (!method()->is_static()) {
1757 receiver = _initial_state->local_at(0);
1758 } else {
1759 receiver = append(new Constant(new ClassConstant(method()->holder())));
1760 }
1761 append_split(new MonitorExit(receiver, state()->unlock()));
1762 }
1763
1764 if (need_mem_bar) {
1765 append(new MemBar(lir_membar_storestore));
1766 }
1767
1768 assert(!ignore_return, "Ignoring return value works only for inlining");
1769 append(new Return(x));
1770 }
1771
1772 Value GraphBuilder::make_constant(ciConstant field_value, ciField* field) {
1773 if (!field_value.is_valid()) return nullptr;
1774
1775 BasicType field_type = field_value.basic_type();
1776 ValueType* value = as_ValueType(field_value);
1777
1778 // Attach dimension info to stable arrays.
1779 if (FoldStableValues &&
1780 field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {
1781 ciArray* array = field_value.as_object()->as_array();
1782 jint dimension = field->type()->as_array_klass()->dimension();
1783 value = new StableArrayConstant(array, dimension);
1784 }
1785
1786 switch (field_type) {
1787 case T_ARRAY:
1788 case T_OBJECT:
1789 if (field_value.as_object()->should_be_constant()) {
1790 return new Constant(value);
1791 }
1792 return nullptr; // Not a constant.
1793 default:
1794 return new Constant(value);
1795 }
1796 }
1797
1798 void GraphBuilder::copy_inline_content(ciInlineKlass* vk, Value src, int src_off, Value dest, int dest_off, ValueStack* state_before, ciField* enclosing_field) {
1799 for (int i = 0; i < vk->nof_declared_nonstatic_fields(); i++) {
1800 ciField* field = vk->declared_nonstatic_field_at(i);
1801 int offset = field->offset_in_bytes() - vk->payload_offset();
1802 if (field->is_flat()) {
1803 bool needs_atomic_access = !field->is_null_free() || field->is_volatile();
1804 assert(!needs_atomic_access, "Atomic access in non-atomic container");
1805 copy_inline_content(field->type()->as_inline_klass(), src, src_off + offset, dest, dest_off + offset, state_before, enclosing_field);
1806 if (!field->is_null_free()) {
1807 // Nullable, copy the null marker using Unsafe because null markers are no real fields
1808 int null_marker_offset = field->null_marker_offset() - vk->payload_offset();
1809 Value offset = append(new Constant(new LongConstant(src_off + null_marker_offset)));
1810 Value nm = append(new UnsafeGet(T_BOOLEAN, src, offset, false));
1811 offset = append(new Constant(new LongConstant(dest_off + null_marker_offset)));
1812 append(new UnsafePut(T_BOOLEAN, dest, offset, nm, false));
1813 }
1814 } else {
1815 Value value = append(new LoadField(src, src_off + offset, field, false, state_before, false));
1816 StoreField* store = new StoreField(dest, dest_off + offset, field, value, false, state_before, false);
1817 store->set_enclosing_field(enclosing_field);
1818 append(store);
1819 }
1820 }
1821 }
1822
1823 void GraphBuilder::access_field(Bytecodes::Code code) {
1824 bool will_link;
1825 ciField* field = stream()->get_field(will_link);
1826 ciInstanceKlass* holder = field->holder();
1827 BasicType field_type = field->type()->basic_type();
1828 ValueType* type = as_ValueType(field_type);
1829
1830 // call will_link again to determine if the field is valid.
1831 const bool needs_patching = !holder->is_loaded() ||
1832 !field->will_link(method(), code) ||
1833 (!field->is_flat() && PatchALot);
1834
1835 ValueStack* state_before = nullptr;
1836 if (!holder->is_initialized() || needs_patching) {
1837 // save state before instruction for debug info when
1838 // deoptimization happens during patching
1839 state_before = copy_state_before();
1840 }
1841
1842 Value obj = nullptr;
1843 if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1844 if (state_before != nullptr) {
1845 // build a patching constant
1846 obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1847 } else {
1848 obj = new Constant(new InstanceConstant(holder->java_mirror()));
1849 }
1850 }
1851
1852 if (code == Bytecodes::_putfield) {
1853 scope()->set_wrote_fields();
1854 if (field->is_volatile()) {
1855 scope()->set_wrote_volatile();
1856 }
1857 if (field->is_final()) {
1858 scope()->set_wrote_final();
1859 }
1860 if (field->is_stable()) {
1861 scope()->set_wrote_stable();
1862 }
1863 }
1864
1865 int offset = !needs_patching ? field->offset_in_bytes() : -1;
1866 switch (code) {
1867 case Bytecodes::_getstatic: {
1868 // check for compile-time constants, i.e., initialized static final fields
1869 Value constant = nullptr;
1870 if (field->is_static_constant() && !PatchALot) {
1871 ciConstant field_value = field->constant_value();
1872 assert(!field->is_stable() || !field_value.is_null_or_zero(),
1873 "stable static w/ default value shouldn't be a constant");
1874 constant = make_constant(field_value, field);
1875 }
1876 if (constant != nullptr) {
1877 push(type, append(constant));
1878 } else {
1879 if (state_before == nullptr) {
1880 state_before = copy_state_for_exception();
1881 }
1882 LoadField* load_field = new LoadField(append(obj), offset, field, true,
1883 state_before, needs_patching);
1884 push(type, append(load_field));
1885 }
1886 break;
1887 }
1888 case Bytecodes::_putstatic: {
1889 Value val = pop(type);
1890 if (state_before == nullptr) {
1891 state_before = copy_state_for_exception();
1892 }
1893 if (field_type == T_BOOLEAN) {
1894 Value mask = append(new Constant(new IntConstant(1)));
1895 val = append(new LogicOp(Bytecodes::_iand, val, mask));
1896 }
1897 if (field->is_null_free()) {
1898 null_check(val);
1899 }
1900 if (field->is_null_free() && field->type()->is_loaded() && field->type()->as_inline_klass()->is_empty() && (!method()->is_class_initializer() || field->is_flat())) {
1901 // Storing to a field of an empty, null-free inline type that is already initialized. Ignore.
1902 break;
1903 }
1904 append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1905 break;
1906 }
1907 case Bytecodes::_getfield: {
1908 // Check for compile-time constants, i.e., trusted final non-static fields.
1909 Value constant = nullptr;
1910 if (state_before == nullptr && field->is_flat()) {
1911 // Save the entire state and re-execute on deopt when accessing flat fields
1912 assert(Interpreter::bytecode_should_reexecute(code), "should reexecute");
1913 state_before = copy_state_before();
1914 }
1915 if (!has_pending_field_access() && !has_pending_load_indexed()) {
1916 obj = apop();
1917 ObjectType* obj_type = obj->type()->as_ObjectType();
1918 if (field->is_constant() && !field->is_flat() && obj_type->is_constant() && !PatchALot) {
1919 ciObject* const_oop = obj_type->constant_value();
1920 if (!const_oop->is_null_object() && const_oop->is_loaded()) {
1921 ciConstant field_value = field->constant_value_of(const_oop);
1922 if (field_value.is_valid()) {
1923 constant = make_constant(field_value, field);
1924 // For CallSite objects add a dependency for invalidation of the optimization.
1925 if (field->is_call_site_target()) {
1926 ciCallSite* call_site = const_oop->as_call_site();
1927 if (!call_site->is_fully_initialized_constant_call_site()) {
1928 ciMethodHandle* target = field_value.as_object()->as_method_handle();
1929 dependency_recorder()->assert_call_site_target_value(call_site, target);
1930 }
1931 }
1932 }
1933 }
1934 }
1935 }
1936 if (constant != nullptr) {
1937 push(type, append(constant));
1938 } else {
1939 if (state_before == nullptr) {
1940 state_before = copy_state_for_exception();
1941 }
1942 if (!field->is_flat()) {
1943 if (has_pending_field_access()) {
1944 assert(!needs_patching, "Can't patch delayed field access");
1945 obj = pending_field_access()->obj();
1946 offset += pending_field_access()->offset() - field->holder()->as_inline_klass()->payload_offset();
1947 field = pending_field_access()->holder()->get_field_by_offset(offset, false);
1948 assert(field != nullptr, "field not found");
1949 set_pending_field_access(nullptr);
1950 } else if (has_pending_load_indexed()) {
1951 assert(!needs_patching, "Can't patch delayed field access");
1952 pending_load_indexed()->update(field, offset - field->holder()->as_inline_klass()->payload_offset());
1953 LoadIndexed* li = pending_load_indexed()->load_instr();
1954 li->set_type(type);
1955 push(type, append(li));
1956 set_pending_load_indexed(nullptr);
1957 break;
1958 }
1959 LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1960 Value replacement = !needs_patching ? _memory->load(load) : load;
1961 if (replacement != load) {
1962 assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1963 // Writing an (integer) value to a boolean, byte, char or short field includes an implicit narrowing
1964 // conversion. Emit an explicit conversion here to get the correct field value after the write.
1965 switch (field_type) {
1966 case T_BOOLEAN:
1967 case T_BYTE:
1968 replacement = append(new Convert(Bytecodes::_i2b, replacement, type));
1969 break;
1970 case T_CHAR:
1971 replacement = append(new Convert(Bytecodes::_i2c, replacement, type));
1972 break;
1973 case T_SHORT:
1974 replacement = append(new Convert(Bytecodes::_i2s, replacement, type));
1975 break;
1976 default:
1977 break;
1978 }
1979 push(type, replacement);
1980 } else {
1981 push(type, append(load));
1982 }
1983 } else {
1984 // Flat field
1985 assert(!needs_patching, "Can't patch flat inline type field access");
1986 ciInlineKlass* inline_klass = field->type()->as_inline_klass();
1987 bool is_naturally_atomic = inline_klass->nof_declared_nonstatic_fields() <= 1;
1988 bool needs_atomic_access = !field->is_null_free() || (field->is_volatile() && !is_naturally_atomic);
1989 if (needs_atomic_access) {
1990 assert(!has_pending_field_access(), "Pending field accesses are not supported");
1991 LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1992 push(type, append(load));
1993 } else {
1994 assert(field->is_null_free(), "must be null-free");
1995 // Look at the next bytecode to check if we can delay the field access
1996 bool can_delay_access = false;
1997 ciBytecodeStream s(method());
1998 s.force_bci(bci());
1999 s.next();
2000 if (s.cur_bc() == Bytecodes::_getfield && !needs_patching) {
2001 ciField* next_field = s.get_field(will_link);
2002 bool next_needs_patching = !next_field->holder()->is_loaded() ||
2003 !next_field->will_link(method(), Bytecodes::_getfield) ||
2004 PatchALot;
2005 // We can't update the offset for atomic accesses
2006 bool next_needs_atomic_access = !next_field->is_null_free() || next_field->is_volatile();
2007 can_delay_access = C1UseDelayedFlattenedFieldReads && !next_needs_patching && !next_needs_atomic_access;
2008 }
2009 if (can_delay_access) {
2010 if (has_pending_load_indexed()) {
2011 pending_load_indexed()->update(field, offset - field->holder()->as_inline_klass()->payload_offset());
2012 } else if (has_pending_field_access()) {
2013 pending_field_access()->inc_offset(offset - field->holder()->as_inline_klass()->payload_offset());
2014 } else {
2015 null_check(obj);
2016 DelayedFieldAccess* dfa = new DelayedFieldAccess(obj, field->holder(), field->offset_in_bytes(), state_before);
2017 set_pending_field_access(dfa);
2018 }
2019 } else {
2020 scope()->set_wrote_final();
2021 scope()->set_wrote_fields();
2022 bool need_membar = false;
2023 if (has_pending_load_indexed()) {
2024 assert(!needs_patching, "Can't patch delayed field access");
2025 pending_load_indexed()->update(field, offset - field->holder()->as_inline_klass()->payload_offset());
2026 NewInstance* vt = new NewInstance(inline_klass, pending_load_indexed()->state_before(), false, true);
2027 _memory->new_instance(vt);
2028 pending_load_indexed()->load_instr()->set_vt(vt);
2029 apush(append_split(vt));
2030 append(pending_load_indexed()->load_instr());
2031 set_pending_load_indexed(nullptr);
2032 need_membar = true;
2033 } else {
2034 if (has_pending_field_access()) {
2035 state_before = pending_field_access()->state_before();
2036 }
2037 NewInstance* new_instance = new NewInstance(inline_klass, state_before, false, true);
2038 _memory->new_instance(new_instance);
2039 apush(append_split(new_instance));
2040 if (has_pending_field_access()) {
2041 copy_inline_content(inline_klass, pending_field_access()->obj(),
2042 pending_field_access()->offset() + field->offset_in_bytes() - field->holder()->as_inline_klass()->payload_offset(),
2043 new_instance, inline_klass->payload_offset(), state_before);
2044 set_pending_field_access(nullptr);
2045 } else {
2046 if (field->type()->as_instance_klass()->is_initialized() && field->type()->as_inline_klass()->is_empty()) {
2047 // Needs an explicit null check because below code does not perform any actual load if there are no fields
2048 null_check(obj);
2049 }
2050 copy_inline_content(inline_klass, obj, field->offset_in_bytes(), new_instance, inline_klass->payload_offset(), state_before);
2051 }
2052 need_membar = true;
2053 }
2054 if (need_membar) {
2055 // If we allocated a new instance ensure the stores to copy the
2056 // field contents are visible before any subsequent store that
2057 // publishes this reference.
2058 append(new MemBar(lir_membar_storestore));
2059 }
2060 }
2061 }
2062 }
2063 }
2064 break;
2065 }
2066 case Bytecodes::_putfield: {
2067 Value val = pop(type);
2068 obj = apop();
2069 if (state_before == nullptr) {
2070 state_before = copy_state_for_exception();
2071 }
2072 if (field_type == T_BOOLEAN) {
2073 Value mask = append(new Constant(new IntConstant(1)));
2074 val = append(new LogicOp(Bytecodes::_iand, val, mask));
2075 }
2076
2077 if (field->is_null_free() && field->type()->is_loaded() && field->type()->as_inline_klass()->is_empty() && (!method()->is_object_constructor() || field->is_flat())) {
2078 // Storing to a field of an empty, null-free inline type that is already initialized. Ignore.
2079 null_check(obj);
2080 null_check(val);
2081 } else if (!field->is_flat()) {
2082 if (field->is_null_free()) {
2083 null_check(val);
2084 }
2085 StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
2086 if (!needs_patching) store = _memory->store(store);
2087 if (store != nullptr) {
2088 append(store);
2089 }
2090 } else {
2091 // Flat field
2092 assert(!needs_patching, "Can't patch flat inline type field access");
2093 ciInlineKlass* inline_klass = field->type()->as_inline_klass();
2094 bool is_naturally_atomic = inline_klass->nof_declared_nonstatic_fields() <= 1;
2095 bool needs_atomic_access = !field->is_null_free() || (field->is_volatile() && !is_naturally_atomic);
2096 if (needs_atomic_access) {
2097 if (field->is_null_free()) {
2098 null_check(val);
2099 }
2100 append(new StoreField(obj, offset, field, val, false, state_before, needs_patching));
2101 } else {
2102 assert(field->is_null_free(), "must be null-free");
2103 copy_inline_content(inline_klass, val, inline_klass->payload_offset(), obj, offset, state_before, field);
2104 }
2105 }
2106 break;
2107 }
2108 default:
2109 ShouldNotReachHere();
2110 break;
2111 }
2112 }
2113
2114 Dependencies* GraphBuilder::dependency_recorder() const {
2115 assert(DeoptC1, "need debug information");
2116 return compilation()->dependency_recorder();
2117 }
2118
2119 // How many arguments do we want to profile?
2120 Values* GraphBuilder::args_list_for_profiling(ciMethod* target, int& start, bool may_have_receiver) {
2121 int n = 0;
2122 bool has_receiver = may_have_receiver && Bytecodes::has_receiver(method()->java_code_at_bci(bci()));
2123 start = has_receiver ? 1 : 0;
2124 if (profile_arguments()) {
2125 ciProfileData* data = method()->method_data()->bci_to_data(bci());
2126 if (data != nullptr && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
2127 n = data->is_CallTypeData() ? data->as_CallTypeData()->number_of_arguments() : data->as_VirtualCallTypeData()->number_of_arguments();
2128 }
2129 }
2130 // If we are inlining then we need to collect arguments to profile parameters for the target
2131 if (profile_parameters() && target != nullptr) {
2132 if (target->method_data() != nullptr && target->method_data()->parameters_type_data() != nullptr) {
2133 // The receiver is profiled on method entry so it's included in
2134 // the number of parameters but here we're only interested in
2135 // actual arguments.
2136 n = MAX2(n, target->method_data()->parameters_type_data()->number_of_parameters() - start);
2137 }
2138 }
2139 if (n > 0) {
2140 return new Values(n);
2141 }
2142 return nullptr;
2143 }
2144
2145 void GraphBuilder::check_args_for_profiling(Values* obj_args, int expected) {
2146 #ifdef ASSERT
2147 bool ignored_will_link;
2148 ciSignature* declared_signature = nullptr;
2149 ciMethod* real_target = method()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
2150 assert(expected == obj_args->capacity() || real_target->is_method_handle_intrinsic(), "missed on arg?");
2151 #endif
2152 }
2153
2154 // Collect arguments that we want to profile in a list
2155 Values* GraphBuilder::collect_args_for_profiling(Values* args, ciMethod* target, bool may_have_receiver) {
2156 int start = 0;
2157 Values* obj_args = args_list_for_profiling(target, start, may_have_receiver);
2158 if (obj_args == nullptr) {
2159 return nullptr;
2160 }
2161 int s = obj_args->capacity();
2162 // if called through method handle invoke, some arguments may have been popped
2163 for (int i = start, j = 0; j < s && i < args->length(); i++) {
2164 if (args->at(i)->type()->is_object_kind()) {
2165 obj_args->push(args->at(i));
2166 j++;
2167 }
2168 }
2169 check_args_for_profiling(obj_args, s);
2170 return obj_args;
2171 }
2172
2173 void GraphBuilder::invoke(Bytecodes::Code code) {
2174 bool will_link;
2175 ciSignature* declared_signature = nullptr;
2176 ciMethod* target = stream()->get_method(will_link, &declared_signature);
2177 ciKlass* holder = stream()->get_declared_method_holder();
2178 const Bytecodes::Code bc_raw = stream()->cur_bc_raw();
2179 assert(declared_signature != nullptr, "cannot be null");
2180 assert(will_link == target->is_loaded(), "");
2181 JFR_ONLY(Jfr::on_resolution(this, holder, target); CHECK_BAILOUT();)
2182
2183 ciInstanceKlass* klass = target->holder();
2184 assert(!target->is_loaded() || klass->is_loaded(), "loaded target must imply loaded klass");
2185
2186 // check if CHA possible: if so, change the code to invoke_special
2187 ciInstanceKlass* calling_klass = method()->holder();
2188 ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
2189 ciInstanceKlass* actual_recv = callee_holder;
2190
2191 CompileLog* log = compilation()->log();
2192 if (log != nullptr)
2193 log->elem("call method='%d' instr='%s'",
2194 log->identify(target),
2195 Bytecodes::name(code));
2196
2197 // Some methods are obviously bindable without any type checks so
2198 // convert them directly to an invokespecial or invokestatic.
2199 if (target->is_loaded() && !target->is_abstract() && target->can_be_statically_bound()) {
2200 switch (bc_raw) {
2201 case Bytecodes::_invokeinterface:
2202 // convert to invokespecial if the target is the private interface method.
2203 if (target->is_private()) {
2204 assert(holder->is_interface(), "How did we get a non-interface method here!");
2205 code = Bytecodes::_invokespecial;
2206 }
2207 break;
2208 case Bytecodes::_invokevirtual:
2209 code = Bytecodes::_invokespecial;
2210 break;
2211 case Bytecodes::_invokehandle:
2212 code = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokespecial;
2213 break;
2214 default:
2215 break;
2216 }
2217 } else {
2218 if (bc_raw == Bytecodes::_invokehandle) {
2219 assert(!will_link, "should come here only for unlinked call");
2220 code = Bytecodes::_invokespecial;
2221 }
2222 }
2223
2224 if (code == Bytecodes::_invokespecial) {
2225 // Additional receiver subtype checks for interface calls via invokespecial or invokeinterface.
2226 ciKlass* receiver_constraint = nullptr;
2227
2228 if (bc_raw == Bytecodes::_invokeinterface) {
2229 receiver_constraint = holder;
2230 } else if (bc_raw == Bytecodes::_invokespecial && !target->is_object_constructor() && calling_klass->is_interface()) {
2231 receiver_constraint = calling_klass;
2232 }
2233
2234 if (receiver_constraint != nullptr) {
2235 int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
2236 Value receiver = state()->stack_at(index);
2237 CheckCast* c = new CheckCast(receiver_constraint, receiver, copy_state_before());
2238 // go to uncommon_trap when checkcast fails
2239 c->set_invokespecial_receiver_check();
2240 state()->stack_at_put(index, append_split(c));
2241 }
2242 }
2243
2244 // Push appendix argument (MethodType, CallSite, etc.), if one.
2245 bool patch_for_appendix = false;
2246 int patching_appendix_arg = 0;
2247 if (Bytecodes::has_optional_appendix(bc_raw) && (!will_link || PatchALot)) {
2248 Value arg = append(new Constant(new ObjectConstant(compilation()->env()->unloaded_ciinstance()), copy_state_before()));
2249 apush(arg);
2250 patch_for_appendix = true;
2251 patching_appendix_arg = (will_link && stream()->has_appendix()) ? 0 : 1;
2252 } else if (stream()->has_appendix()) {
2253 ciObject* appendix = stream()->get_appendix();
2254 Value arg = append(new Constant(new ObjectConstant(appendix)));
2255 apush(arg);
2256 }
2257
2258 ciMethod* cha_monomorphic_target = nullptr;
2259 ciMethod* exact_target = nullptr;
2260 Value better_receiver = nullptr;
2261 if (UseCHA && DeoptC1 && target->is_loaded() &&
2262 !(// %%% FIXME: Are both of these relevant?
2263 target->is_method_handle_intrinsic() ||
2264 target->is_compiled_lambda_form()) &&
2265 !patch_for_appendix) {
2266 Value receiver = nullptr;
2267 ciInstanceKlass* receiver_klass = nullptr;
2268 bool type_is_exact = false;
2269 // try to find a precise receiver type
2270 if (will_link && !target->is_static()) {
2271 int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
2272 receiver = state()->stack_at(index);
2273 ciType* type = receiver->exact_type();
2274 if (type != nullptr && type->is_loaded()) {
2275 assert(!type->is_instance_klass() || !type->as_instance_klass()->is_interface(), "Must not be an interface");
2276 // Detects non-interface instances, primitive arrays, and some object arrays.
2277 // Array receivers can only call Object methods, so we should be able to allow
2278 // all object arrays here too, even those with unloaded types.
2279 receiver_klass = (ciInstanceKlass*) type;
2280 type_is_exact = true;
2281 }
2282 if (type == nullptr) {
2283 type = receiver->declared_type();
2284 if (type != nullptr && type->is_loaded() &&
2285 type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
2286 receiver_klass = (ciInstanceKlass*) type;
2287 if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) {
2288 // Insert a dependency on this type since
2289 // find_monomorphic_target may assume it's already done.
2290 dependency_recorder()->assert_leaf_type(receiver_klass);
2291 type_is_exact = true;
2292 }
2293 }
2294 }
2295 }
2296 if (receiver_klass != nullptr && type_is_exact &&
2297 receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) {
2298 // If we have the exact receiver type we can bind directly to
2299 // the method to call.
2300 exact_target = target->resolve_invoke(calling_klass, receiver_klass);
2301 if (exact_target != nullptr) {
2302 target = exact_target;
2303 code = Bytecodes::_invokespecial;
2304 }
2305 }
2306 if (receiver_klass != nullptr &&
2307 receiver_klass->is_subtype_of(actual_recv) &&
2308 actual_recv->is_initialized()) {
2309 actual_recv = receiver_klass;
2310 }
2311
2312 if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) ||
2313 (code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) {
2314 // Use CHA on the receiver to select a more precise method.
2315 cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
2316 } else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != nullptr) {
2317 assert(callee_holder->is_interface(), "invokeinterface to non interface?");
2318 // If there is only one implementor of this interface then we
2319 // may be able bind this invoke directly to the implementing
2320 // klass but we need both a dependence on the single interface
2321 // and on the method we bind to. Additionally since all we know
2322 // about the receiver type is the it's supposed to implement the
2323 // interface we have to insert a check that it's the class we
2324 // expect. Interface types are not checked by the verifier so
2325 // they are roughly equivalent to Object.
2326 // The number of implementors for declared_interface is less or
2327 // equal to the number of implementors for target->holder() so
2328 // if number of implementors of target->holder() == 1 then
2329 // number of implementors for decl_interface is 0 or 1. If
2330 // it's 0 then no class implements decl_interface and there's
2331 // no point in inlining.
2332 ciInstanceKlass* declared_interface = callee_holder;
2333 ciInstanceKlass* singleton = declared_interface->unique_implementor();
2334 if (singleton != nullptr) {
2335 assert(singleton != declared_interface, "not a unique implementor");
2336 cha_monomorphic_target = target->find_monomorphic_target(calling_klass, declared_interface, singleton);
2337 if (cha_monomorphic_target != nullptr) {
2338 ciInstanceKlass* holder = cha_monomorphic_target->holder();
2339 ciInstanceKlass* constraint = (holder->is_subtype_of(singleton) ? holder : singleton); // avoid upcasts
2340 if (holder != compilation()->env()->Object_klass() &&
2341 (!type_is_exact || receiver_klass->is_subtype_of(constraint))) {
2342 actual_recv = declared_interface;
2343
2344 // insert a check it's really the expected class.
2345 CheckCast* c = new CheckCast(constraint, receiver, copy_state_for_exception());
2346 c->set_incompatible_class_change_check();
2347 c->set_direct_compare(constraint->is_final());
2348 // pass the result of the checkcast so that the compiler has
2349 // more accurate type info in the inlinee
2350 better_receiver = append_split(c);
2351
2352 dependency_recorder()->assert_unique_implementor(declared_interface, singleton);
2353 } else {
2354 cha_monomorphic_target = nullptr;
2355 }
2356 }
2357 }
2358 }
2359 }
2360
2361 if (cha_monomorphic_target != nullptr) {
2362 assert(!target->can_be_statically_bound() || target == cha_monomorphic_target, "");
2363 assert(!cha_monomorphic_target->is_abstract(), "");
2364 if (!cha_monomorphic_target->can_be_statically_bound(actual_recv)) {
2365 // If we inlined because CHA revealed only a single target method,
2366 // then we are dependent on that target method not getting overridden
2367 // by dynamic class loading. Be sure to test the "static" receiver
2368 // dest_method here, as opposed to the actual receiver, which may
2369 // falsely lead us to believe that the receiver is final or private.
2370 dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target, callee_holder, target);
2371 }
2372 code = Bytecodes::_invokespecial;
2373 }
2374
2375 // check if we could do inlining
2376 if (!PatchALot && Inline && target->is_loaded() && !patch_for_appendix &&
2377 callee_holder->is_loaded()) { // the effect of symbolic reference resolution
2378
2379 // callee is known => check if we have static binding
2380 if ((code == Bytecodes::_invokestatic && klass->is_initialized()) || // invokestatic involves an initialization barrier on declaring class
2381 code == Bytecodes::_invokespecial ||
2382 (code == Bytecodes::_invokevirtual && target->is_final_method()) ||
2383 code == Bytecodes::_invokedynamic) {
2384 // static binding => check if callee is ok
2385 ciMethod* inline_target = (cha_monomorphic_target != nullptr) ? cha_monomorphic_target : target;
2386 bool holder_known = (cha_monomorphic_target != nullptr) || (exact_target != nullptr);
2387 bool success = try_inline(inline_target, holder_known, false /* ignore_return */, code, better_receiver);
2388
2389 CHECK_BAILOUT();
2390 clear_inline_bailout();
2391
2392 if (success) {
2393 // Register dependence if JVMTI has either breakpoint
2394 // setting or hotswapping of methods capabilities since they may
2395 // cause deoptimization.
2396 if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) {
2397 dependency_recorder()->assert_evol_method(inline_target);
2398 }
2399 return;
2400 }
2401 } else {
2402 print_inlining(target, "no static binding", /*success*/ false);
2403 }
2404 } else {
2405 print_inlining(target, "not inlineable", /*success*/ false);
2406 }
2407
2408 // If we attempted an inline which did not succeed because of a
2409 // bailout during construction of the callee graph, the entire
2410 // compilation has to be aborted. This is fairly rare and currently
2411 // seems to only occur for jasm-generated classes which contain
2412 // jsr/ret pairs which are not associated with finally clauses and
2413 // do not have exception handlers in the containing method, and are
2414 // therefore not caught early enough to abort the inlining without
2415 // corrupting the graph. (We currently bail out with a non-empty
2416 // stack at a ret in these situations.)
2417 CHECK_BAILOUT();
2418
2419 // inlining not successful => standard invoke
2420 ValueType* result_type = as_ValueType(declared_signature->return_type());
2421 ValueStack* state_before = copy_state_exhandling();
2422
2423 // The bytecode (code) might change in this method so we are checking this very late.
2424 const bool has_receiver =
2425 code == Bytecodes::_invokespecial ||
2426 code == Bytecodes::_invokevirtual ||
2427 code == Bytecodes::_invokeinterface;
2428 Values* args = state()->pop_arguments(target->arg_size_no_receiver() + patching_appendix_arg);
2429 Value recv = has_receiver ? apop() : nullptr;
2430
2431 // A null check is required here (when there is a receiver) for any of the following cases
2432 // - invokespecial, always need a null check.
2433 // - invokevirtual, when the target is final and loaded. Calls to final targets will become optimized
2434 // and require null checking. If the target is loaded a null check is emitted here.
2435 // If the target isn't loaded the null check must happen after the call resolution. We achieve that
2436 // by using the target methods unverified entry point (see CompiledIC::compute_monomorphic_entry).
2437 // (The JVM specification requires that LinkageError must be thrown before a NPE. An unloaded target may
2438 // potentially fail, and can't have the null check before the resolution.)
2439 // - A call that will be profiled. (But we can't add a null check when the target is unloaded, by the same
2440 // reason as above, so calls with a receiver to unloaded targets can't be profiled.)
2441 //
2442 // Normal invokevirtual will perform the null check during lookup
2443
2444 bool need_null_check = (code == Bytecodes::_invokespecial) ||
2445 (target->is_loaded() && (target->is_final_method() || (is_profiling() && profile_calls())));
2446
2447 if (need_null_check) {
2448 if (recv != nullptr) {
2449 null_check(recv);
2450 }
2451
2452 if (is_profiling()) {
2453 // Note that we'd collect profile data in this method if we wanted it.
2454 compilation()->set_would_profile(true);
2455
2456 if (profile_calls()) {
2457 assert(cha_monomorphic_target == nullptr || exact_target == nullptr, "both can not be set");
2458 ciKlass* target_klass = nullptr;
2459 if (cha_monomorphic_target != nullptr) {
2460 target_klass = cha_monomorphic_target->holder();
2461 } else if (exact_target != nullptr) {
2462 target_klass = exact_target->holder();
2463 }
2464 profile_call(target, recv, target_klass, collect_args_for_profiling(args, nullptr, false), false);
2465 }
2466 }
2467 }
2468
2469 Invoke* result = new Invoke(code, result_type, recv, args, target, state_before);
2470 // push result
2471 append_split(result);
2472
2473 if (result_type != voidType) {
2474 push(result_type, result);
2475 }
2476 if (profile_return() && result_type->is_object_kind()) {
2477 profile_return_type(result, target);
2478 }
2479 }
2480
2481
2482 void GraphBuilder::new_instance(int klass_index) {
2483 ValueStack* state_before = copy_state_exhandling();
2484 ciKlass* klass = stream()->get_klass();
2485 assert(klass->is_instance_klass(), "must be an instance klass");
2486 NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before, stream()->is_unresolved_klass(), false);
2487 _memory->new_instance(new_instance);
2488 apush(append_split(new_instance));
2489 }
2490
2491 void GraphBuilder::new_type_array() {
2492 ValueStack* state_before = copy_state_exhandling();
2493 apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before, true)));
2494 }
2495
2496
2497 void GraphBuilder::new_object_array() {
2498 ciKlass* klass = stream()->get_klass();
2499 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2500 NewArray* n = new NewObjectArray(klass, ipop(), state_before);
2501 apush(append_split(n));
2502 }
2503
2504
2505 bool GraphBuilder::direct_compare(ciKlass* k) {
2506 if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
2507 ciInstanceKlass* ik = k->as_instance_klass();
2508 if (ik->is_final()) {
2509 return true;
2510 } else {
2511 if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {
2512 // test class is leaf class
2513 dependency_recorder()->assert_leaf_type(ik);
2514 return true;
2515 }
2516 }
2517 }
2518 return false;
2519 }
2520
2521
2522 void GraphBuilder::check_cast(int klass_index) {
2523 ciKlass* klass = stream()->get_klass();
2524 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception();
2525 CheckCast* c = new CheckCast(klass, apop(), state_before);
2526 apush(append_split(c));
2527 c->set_direct_compare(direct_compare(klass));
2528
2529 if (is_profiling()) {
2530 // Note that we'd collect profile data in this method if we wanted it.
2531 compilation()->set_would_profile(true);
2532
2533 if (profile_checkcasts()) {
2534 c->set_profiled_method(method());
2535 c->set_profiled_bci(bci());
2536 c->set_should_profile(true);
2537 }
2538 }
2539 }
2540
2541
2542 void GraphBuilder::instance_of(int klass_index) {
2543 ciKlass* klass = stream()->get_klass();
2544 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2545 InstanceOf* i = new InstanceOf(klass, apop(), state_before);
2546 ipush(append_split(i));
2547 i->set_direct_compare(direct_compare(klass));
2548
2549 if (is_profiling()) {
2550 // Note that we'd collect profile data in this method if we wanted it.
2551 compilation()->set_would_profile(true);
2552
2553 if (profile_checkcasts()) {
2554 i->set_profiled_method(method());
2555 i->set_profiled_bci(bci());
2556 i->set_should_profile(true);
2557 }
2558 }
2559 }
2560
2561
2562 void GraphBuilder::monitorenter(Value x, int bci) {
2563 bool maybe_inlinetype = false;
2564 if (bci == InvocationEntryBci) {
2565 // Called by GraphBuilder::inline_sync_entry.
2566 #ifdef ASSERT
2567 ciType* obj_type = x->declared_type();
2568 assert(obj_type == nullptr || !obj_type->is_inlinetype(), "inline types cannot have synchronized methods");
2569 #endif
2570 } else {
2571 // We are compiling a monitorenter bytecode
2572 if (EnableValhalla) {
2573 ciType* obj_type = x->declared_type();
2574 if (obj_type == nullptr || obj_type->as_klass()->can_be_inline_klass()) {
2575 // If we're (possibly) locking on an inline type, check for markWord::always_locked_pattern
2576 // and throw IMSE. (obj_type is null for Phi nodes, so let's just be conservative).
2577 maybe_inlinetype = true;
2578 }
2579 }
2580 }
2581
2582 // save state before locking in case of deoptimization after a NullPointerException
2583 ValueStack* state_before = copy_state_for_exception_with_bci(bci);
2584 append_with_bci(new MonitorEnter(x, state()->lock(x), state_before, maybe_inlinetype), bci);
2585 kill_all();
2586 }
2587
2588
2589 void GraphBuilder::monitorexit(Value x, int bci) {
2590 append_with_bci(new MonitorExit(x, state()->unlock()), bci);
2591 kill_all();
2592 }
2593
2594
2595 void GraphBuilder::new_multi_array(int dimensions) {
2596 ciKlass* klass = stream()->get_klass();
2597 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2598
2599 Values* dims = new Values(dimensions, dimensions, nullptr);
2600 // fill in all dimensions
2601 int i = dimensions;
2602 while (i-- > 0) dims->at_put(i, ipop());
2603 // create array
2604 NewArray* n = new NewMultiArray(klass, dims, state_before);
2605 apush(append_split(n));
2606 }
2607
2608
2609 void GraphBuilder::throw_op(int bci) {
2610 // We require that the debug info for a Throw be the "state before"
2611 // the Throw (i.e., exception oop is still on TOS)
2612 ValueStack* state_before = copy_state_before_with_bci(bci);
2613 Throw* t = new Throw(apop(), state_before);
2614 // operand stack not needed after a throw
2615 state()->truncate_stack(0);
2616 append_with_bci(t, bci);
2617 }
2618
2619
2620 Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) {
2621 Canonicalizer canon(compilation(), instr, bci);
2622 Instruction* i1 = canon.canonical();
2623 if (i1->is_linked() || !i1->can_be_linked()) {
2624 // Canonicalizer returned an instruction which was already
2625 // appended so simply return it.
2626 return i1;
2627 }
2628
2629 if (UseLocalValueNumbering) {
2630 // Lookup the instruction in the ValueMap and add it to the map if
2631 // it's not found.
2632 Instruction* i2 = vmap()->find_insert(i1);
2633 if (i2 != i1) {
2634 // found an entry in the value map, so just return it.
2635 assert(i2->is_linked(), "should already be linked");
2636 return i2;
2637 }
2638 ValueNumberingEffects vne(vmap());
2639 i1->visit(&vne);
2640 }
2641
2642 // i1 was not eliminated => append it
2643 assert(i1->next() == nullptr, "shouldn't already be linked");
2644 _last = _last->set_next(i1, canon.bci());
2645
2646 if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) {
2647 // set the bailout state but complete normal processing. We
2648 // might do a little more work before noticing the bailout so we
2649 // want processing to continue normally until it's noticed.
2650 bailout("Method and/or inlining is too large");
2651 }
2652
2653 #ifndef PRODUCT
2654 if (PrintIRDuringConstruction) {
2655 InstructionPrinter ip;
2656 ip.print_line(i1);
2657 if (Verbose) {
2658 state()->print();
2659 }
2660 }
2661 #endif
2662
2663 // save state after modification of operand stack for StateSplit instructions
2664 StateSplit* s = i1->as_StateSplit();
2665 if (s != nullptr) {
2666 if (EliminateFieldAccess) {
2667 Intrinsic* intrinsic = s->as_Intrinsic();
2668 if (s->as_Invoke() != nullptr || (intrinsic && !intrinsic->preserves_state())) {
2669 _memory->kill();
2670 }
2671 }
2672 s->set_state(state()->copy(ValueStack::StateAfter, canon.bci()));
2673 }
2674
2675 // set up exception handlers for this instruction if necessary
2676 if (i1->can_trap()) {
2677 i1->set_exception_handlers(handle_exception(i1));
2678 assert(i1->exception_state() != nullptr || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state");
2679 }
2680 return i1;
2681 }
2682
2683
2684 Instruction* GraphBuilder::append(Instruction* instr) {
2685 assert(instr->as_StateSplit() == nullptr || instr->as_BlockEnd() != nullptr, "wrong append used");
2686 return append_with_bci(instr, bci());
2687 }
2688
2689
2690 Instruction* GraphBuilder::append_split(StateSplit* instr) {
2691 return append_with_bci(instr, bci());
2692 }
2693
2694
2695 void GraphBuilder::null_check(Value value) {
2696 if (value->as_NewArray() != nullptr || value->as_NewInstance() != nullptr) {
2697 return;
2698 } else {
2699 Constant* con = value->as_Constant();
2700 if (con) {
2701 ObjectType* c = con->type()->as_ObjectType();
2702 if (c && c->is_loaded()) {
2703 ObjectConstant* oc = c->as_ObjectConstant();
2704 if (!oc || !oc->value()->is_null_object()) {
2705 return;
2706 }
2707 }
2708 }
2709 if (value->is_null_free()) return;
2710 }
2711 append(new NullCheck(value, copy_state_for_exception()));
2712 }
2713
2714
2715
2716 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {
2717 if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != nullptr)) {
2718 assert(instruction->exception_state() == nullptr
2719 || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2720 || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->should_retain_local_variables()),
2721 "exception_state should be of exception kind");
2722 return new XHandlers();
2723 }
2724
2725 XHandlers* exception_handlers = new XHandlers();
2726 ScopeData* cur_scope_data = scope_data();
2727 ValueStack* cur_state = instruction->state_before();
2728 ValueStack* prev_state = nullptr;
2729 int scope_count = 0;
2730
2731 assert(cur_state != nullptr, "state_before must be set");
2732 do {
2733 int cur_bci = cur_state->bci();
2734 assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2735 assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci()
2736 || has_pending_field_access() || has_pending_load_indexed(), "invalid bci");
2737
2738
2739 // join with all potential exception handlers
2740 XHandlers* list = cur_scope_data->xhandlers();
2741 const int n = list->length();
2742 for (int i = 0; i < n; i++) {
2743 XHandler* h = list->handler_at(i);
2744 if (h->covers(cur_bci)) {
2745 // h is a potential exception handler => join it
2746 compilation()->set_has_exception_handlers(true);
2747
2748 BlockBegin* entry = h->entry_block();
2749 if (entry == block()) {
2750 // It's acceptable for an exception handler to cover itself
2751 // but we don't handle that in the parser currently. It's
2752 // very rare so we bailout instead of trying to handle it.
2753 BAILOUT_("exception handler covers itself", exception_handlers);
2754 }
2755 assert(entry->bci() == h->handler_bci(), "must match");
2756 assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2757
2758 // previously this was a BAILOUT, but this is not necessary
2759 // now because asynchronous exceptions are not handled this way.
2760 assert(entry->state() == nullptr || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match");
2761
2762 // xhandler start with an empty expression stack
2763 if (cur_state->stack_size() != 0) {
2764 // locals are preserved
2765 // stack will be truncated
2766 cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2767 }
2768 if (instruction->exception_state() == nullptr) {
2769 instruction->set_exception_state(cur_state);
2770 }
2771
2772 // Note: Usually this join must work. However, very
2773 // complicated jsr-ret structures where we don't ret from
2774 // the subroutine can cause the objects on the monitor
2775 // stacks to not match because blocks can be parsed twice.
2776 // The only test case we've seen so far which exhibits this
2777 // problem is caught by the infinite recursion test in
2778 // GraphBuilder::jsr() if the join doesn't work.
2779 if (!entry->try_merge(cur_state, compilation()->has_irreducible_loops())) {
2780 BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers);
2781 }
2782
2783 // add current state for correct handling of phi functions at begin of xhandler
2784 int phi_operand = entry->add_exception_state(cur_state);
2785
2786 // add entry to the list of xhandlers of this block
2787 _block->add_exception_handler(entry);
2788
2789 // add back-edge from xhandler entry to this block
2790 if (!entry->is_predecessor(_block)) {
2791 entry->add_predecessor(_block);
2792 }
2793
2794 // clone XHandler because phi_operand and scope_count can not be shared
2795 XHandler* new_xhandler = new XHandler(h);
2796 new_xhandler->set_phi_operand(phi_operand);
2797 new_xhandler->set_scope_count(scope_count);
2798 exception_handlers->append(new_xhandler);
2799
2800 // fill in exception handler subgraph lazily
2801 assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
2802 cur_scope_data->add_to_work_list(entry);
2803
2804 // stop when reaching catchall
2805 if (h->catch_type() == 0) {
2806 return exception_handlers;
2807 }
2808 }
2809 }
2810
2811 if (exception_handlers->length() == 0) {
2812 // This scope and all callees do not handle exceptions, so the local
2813 // variables of this scope are not needed. However, the scope itself is
2814 // required for a correct exception stack trace -> clear out the locals.
2815 // Stack and locals are invalidated but not truncated in caller state.
2816 if (prev_state != nullptr) {
2817 assert(instruction->exception_state() != nullptr, "missed set?");
2818 ValueStack::Kind exc_kind = ValueStack::empty_exception_kind(true /* caller */);
2819 cur_state = cur_state->copy(exc_kind, cur_state->bci());
2820 // reset caller exception state
2821 prev_state->set_caller_state(cur_state);
2822 } else {
2823 assert(instruction->exception_state() == nullptr, "already set");
2824 // set instruction exception state
2825 // truncate stack
2826 ValueStack::Kind exc_kind = ValueStack::empty_exception_kind();
2827 cur_state = cur_state->copy(exc_kind, cur_state->bci());
2828 instruction->set_exception_state(cur_state);
2829 }
2830 }
2831
2832 // Set up iteration for next time.
2833 // If parsing a jsr, do not grab exception handlers from the
2834 // parent scopes for this method (already got them, and they
2835 // needed to be cloned)
2836
2837 while (cur_scope_data->parsing_jsr()) {
2838 cur_scope_data = cur_scope_data->parent();
2839 }
2840
2841 assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2842 assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler");
2843
2844 prev_state = cur_state;
2845 cur_state = cur_state->caller_state();
2846 cur_scope_data = cur_scope_data->parent();
2847 scope_count++;
2848 } while (cur_scope_data != nullptr);
2849
2850 return exception_handlers;
2851 }
2852
2853
2854 // Helper class for simplifying Phis.
2855 class PhiSimplifier : public BlockClosure {
2856 private:
2857 bool _has_substitutions;
2858 Value simplify(Value v);
2859
2860 public:
2861 PhiSimplifier(BlockBegin* start) : _has_substitutions(false) {
2862 start->iterate_preorder(this);
2863 if (_has_substitutions) {
2864 SubstitutionResolver sr(start);
2865 }
2866 }
2867 void block_do(BlockBegin* b);
2868 bool has_substitutions() const { return _has_substitutions; }
2869 };
2870
2871
2872 Value PhiSimplifier::simplify(Value v) {
2873 Phi* phi = v->as_Phi();
2874
2875 if (phi == nullptr) {
2876 // no phi function
2877 return v;
2878 } else if (v->has_subst()) {
2879 // already substituted; subst can be phi itself -> simplify
2880 return simplify(v->subst());
2881 } else if (phi->is_set(Phi::cannot_simplify)) {
2882 // already tried to simplify phi before
2883 return phi;
2884 } else if (phi->is_set(Phi::visited)) {
2885 // break cycles in phi functions
2886 return phi;
2887 } else if (phi->type()->is_illegal()) {
2888 // illegal phi functions are ignored anyway
2889 return phi;
2890
2891 } else {
2892 // mark phi function as processed to break cycles in phi functions
2893 phi->set(Phi::visited);
2894
2895 // simplify x = [y, x] and x = [y, y] to y
2896 Value subst = nullptr;
2897 int opd_count = phi->operand_count();
2898 for (int i = 0; i < opd_count; i++) {
2899 Value opd = phi->operand_at(i);
2900 assert(opd != nullptr, "Operand must exist!");
2901
2902 if (opd->type()->is_illegal()) {
2903 // if one operand is illegal, the entire phi function is illegal
2904 phi->make_illegal();
2905 phi->clear(Phi::visited);
2906 return phi;
2907 }
2908
2909 Value new_opd = simplify(opd);
2910 assert(new_opd != nullptr, "Simplified operand must exist!");
2911
2912 if (new_opd != phi && new_opd != subst) {
2913 if (subst == nullptr) {
2914 subst = new_opd;
2915 } else {
2916 // no simplification possible
2917 phi->set(Phi::cannot_simplify);
2918 phi->clear(Phi::visited);
2919 return phi;
2920 }
2921 }
2922 }
2923
2924 // successfully simplified phi function
2925 assert(subst != nullptr, "illegal phi function");
2926 _has_substitutions = true;
2927 phi->clear(Phi::visited);
2928 phi->set_subst(subst);
2929
2930 #ifndef PRODUCT
2931 if (PrintPhiFunctions) {
2932 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());
2933 }
2934 #endif
2935
2936 return subst;
2937 }
2938 }
2939
2940
2941 void PhiSimplifier::block_do(BlockBegin* b) {
2942 for_each_phi_fun(b, phi,
2943 simplify(phi);
2944 );
2945
2946 #ifdef ASSERT
2947 for_each_phi_fun(b, phi,
2948 assert(phi->operand_count() != 1 || phi->subst() != phi || phi->is_illegal(), "missed trivial simplification");
2949 );
2950
2951 ValueStack* state = b->state()->caller_state();
2952 for_each_state_value(state, value,
2953 Phi* phi = value->as_Phi();
2954 assert(phi == nullptr || phi->block() != b, "must not have phi function to simplify in caller state");
2955 );
2956 #endif
2957 }
2958
2959 // This method is called after all blocks are filled with HIR instructions
2960 // It eliminates all Phi functions of the form x = [y, y] and x = [y, x]
2961 void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) {
2962 PhiSimplifier simplifier(start);
2963 }
2964
2965
2966 void GraphBuilder::connect_to_end(BlockBegin* beg) {
2967 // setup iteration
2968 kill_all();
2969 _block = beg;
2970 _state = beg->state()->copy_for_parsing();
2971 _last = beg;
2972 iterate_bytecodes_for_block(beg->bci());
2973 }
2974
2975
2976 BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) {
2977 #ifndef PRODUCT
2978 if (PrintIRDuringConstruction) {
2979 tty->cr();
2980 InstructionPrinter ip;
2981 ip.print_instr(_block); tty->cr();
2982 ip.print_stack(_block->state()); tty->cr();
2983 ip.print_inline_level(_block);
2984 ip.print_head();
2985 tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size());
2986 }
2987 #endif
2988 _skip_block = false;
2989 assert(state() != nullptr, "ValueStack missing!");
2990 CompileLog* log = compilation()->log();
2991 ciBytecodeStream s(method());
2992 s.reset_to_bci(bci);
2993 int prev_bci = bci;
2994 scope_data()->set_stream(&s);
2995 // iterate
2996 Bytecodes::Code code = Bytecodes::_illegal;
2997 bool push_exception = false;
2998
2999 if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == nullptr) {
3000 // first thing in the exception entry block should be the exception object.
3001 push_exception = true;
3002 }
3003
3004 bool ignore_return = scope_data()->ignore_return();
3005
3006 while (!bailed_out() && last()->as_BlockEnd() == nullptr &&
3007 (code = stream()->next()) != ciBytecodeStream::EOBC() &&
3008 (block_at(s.cur_bci()) == nullptr || block_at(s.cur_bci()) == block())) {
3009 assert(state()->kind() == ValueStack::Parsing, "invalid state kind");
3010
3011 if (log != nullptr)
3012 log->set_context("bc code='%d' bci='%d'", (int)code, s.cur_bci());
3013
3014 // Check for active jsr during OSR compilation
3015 if (compilation()->is_osr_compile()
3016 && scope()->is_top_scope()
3017 && parsing_jsr()
3018 && s.cur_bci() == compilation()->osr_bci()) {
3019 bailout("OSR not supported while a jsr is active");
3020 }
3021
3022 if (push_exception) {
3023 apush(append(new ExceptionObject()));
3024 push_exception = false;
3025 }
3026
3027 // handle bytecode
3028 switch (code) {
3029 case Bytecodes::_nop : /* nothing to do */ break;
3030 case Bytecodes::_aconst_null : apush(append(new Constant(objectNull ))); break;
3031 case Bytecodes::_iconst_m1 : ipush(append(new Constant(new IntConstant (-1)))); break;
3032 case Bytecodes::_iconst_0 : ipush(append(new Constant(intZero ))); break;
3033 case Bytecodes::_iconst_1 : ipush(append(new Constant(intOne ))); break;
3034 case Bytecodes::_iconst_2 : ipush(append(new Constant(new IntConstant ( 2)))); break;
3035 case Bytecodes::_iconst_3 : ipush(append(new Constant(new IntConstant ( 3)))); break;
3036 case Bytecodes::_iconst_4 : ipush(append(new Constant(new IntConstant ( 4)))); break;
3037 case Bytecodes::_iconst_5 : ipush(append(new Constant(new IntConstant ( 5)))); break;
3038 case Bytecodes::_lconst_0 : lpush(append(new Constant(new LongConstant ( 0)))); break;
3039 case Bytecodes::_lconst_1 : lpush(append(new Constant(new LongConstant ( 1)))); break;
3040 case Bytecodes::_fconst_0 : fpush(append(new Constant(new FloatConstant ( 0)))); break;
3041 case Bytecodes::_fconst_1 : fpush(append(new Constant(new FloatConstant ( 1)))); break;
3042 case Bytecodes::_fconst_2 : fpush(append(new Constant(new FloatConstant ( 2)))); break;
3043 case Bytecodes::_dconst_0 : dpush(append(new Constant(new DoubleConstant( 0)))); break;
3044 case Bytecodes::_dconst_1 : dpush(append(new Constant(new DoubleConstant( 1)))); break;
3045 case Bytecodes::_bipush : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break;
3046 case Bytecodes::_sipush : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break;
3047 case Bytecodes::_ldc : // fall through
3048 case Bytecodes::_ldc_w : // fall through
3049 case Bytecodes::_ldc2_w : load_constant(); break;
3050 case Bytecodes::_iload : load_local(intType , s.get_index()); break;
3051 case Bytecodes::_lload : load_local(longType , s.get_index()); break;
3052 case Bytecodes::_fload : load_local(floatType , s.get_index()); break;
3053 case Bytecodes::_dload : load_local(doubleType , s.get_index()); break;
3054 case Bytecodes::_aload : load_local(instanceType, s.get_index()); break;
3055 case Bytecodes::_iload_0 : load_local(intType , 0); break;
3056 case Bytecodes::_iload_1 : load_local(intType , 1); break;
3057 case Bytecodes::_iload_2 : load_local(intType , 2); break;
3058 case Bytecodes::_iload_3 : load_local(intType , 3); break;
3059 case Bytecodes::_lload_0 : load_local(longType , 0); break;
3060 case Bytecodes::_lload_1 : load_local(longType , 1); break;
3061 case Bytecodes::_lload_2 : load_local(longType , 2); break;
3062 case Bytecodes::_lload_3 : load_local(longType , 3); break;
3063 case Bytecodes::_fload_0 : load_local(floatType , 0); break;
3064 case Bytecodes::_fload_1 : load_local(floatType , 1); break;
3065 case Bytecodes::_fload_2 : load_local(floatType , 2); break;
3066 case Bytecodes::_fload_3 : load_local(floatType , 3); break;
3067 case Bytecodes::_dload_0 : load_local(doubleType, 0); break;
3068 case Bytecodes::_dload_1 : load_local(doubleType, 1); break;
3069 case Bytecodes::_dload_2 : load_local(doubleType, 2); break;
3070 case Bytecodes::_dload_3 : load_local(doubleType, 3); break;
3071 case Bytecodes::_aload_0 : load_local(objectType, 0); break;
3072 case Bytecodes::_aload_1 : load_local(objectType, 1); break;
3073 case Bytecodes::_aload_2 : load_local(objectType, 2); break;
3074 case Bytecodes::_aload_3 : load_local(objectType, 3); break;
3075 case Bytecodes::_iaload : load_indexed(T_INT ); break;
3076 case Bytecodes::_laload : load_indexed(T_LONG ); break;
3077 case Bytecodes::_faload : load_indexed(T_FLOAT ); break;
3078 case Bytecodes::_daload : load_indexed(T_DOUBLE); break;
3079 case Bytecodes::_aaload : load_indexed(T_OBJECT); break;
3080 case Bytecodes::_baload : load_indexed(T_BYTE ); break;
3081 case Bytecodes::_caload : load_indexed(T_CHAR ); break;
3082 case Bytecodes::_saload : load_indexed(T_SHORT ); break;
3083 case Bytecodes::_istore : store_local(intType , s.get_index()); break;
3084 case Bytecodes::_lstore : store_local(longType , s.get_index()); break;
3085 case Bytecodes::_fstore : store_local(floatType , s.get_index()); break;
3086 case Bytecodes::_dstore : store_local(doubleType, s.get_index()); break;
3087 case Bytecodes::_astore : store_local(objectType, s.get_index()); break;
3088 case Bytecodes::_istore_0 : store_local(intType , 0); break;
3089 case Bytecodes::_istore_1 : store_local(intType , 1); break;
3090 case Bytecodes::_istore_2 : store_local(intType , 2); break;
3091 case Bytecodes::_istore_3 : store_local(intType , 3); break;
3092 case Bytecodes::_lstore_0 : store_local(longType , 0); break;
3093 case Bytecodes::_lstore_1 : store_local(longType , 1); break;
3094 case Bytecodes::_lstore_2 : store_local(longType , 2); break;
3095 case Bytecodes::_lstore_3 : store_local(longType , 3); break;
3096 case Bytecodes::_fstore_0 : store_local(floatType , 0); break;
3097 case Bytecodes::_fstore_1 : store_local(floatType , 1); break;
3098 case Bytecodes::_fstore_2 : store_local(floatType , 2); break;
3099 case Bytecodes::_fstore_3 : store_local(floatType , 3); break;
3100 case Bytecodes::_dstore_0 : store_local(doubleType, 0); break;
3101 case Bytecodes::_dstore_1 : store_local(doubleType, 1); break;
3102 case Bytecodes::_dstore_2 : store_local(doubleType, 2); break;
3103 case Bytecodes::_dstore_3 : store_local(doubleType, 3); break;
3104 case Bytecodes::_astore_0 : store_local(objectType, 0); break;
3105 case Bytecodes::_astore_1 : store_local(objectType, 1); break;
3106 case Bytecodes::_astore_2 : store_local(objectType, 2); break;
3107 case Bytecodes::_astore_3 : store_local(objectType, 3); break;
3108 case Bytecodes::_iastore : store_indexed(T_INT ); break;
3109 case Bytecodes::_lastore : store_indexed(T_LONG ); break;
3110 case Bytecodes::_fastore : store_indexed(T_FLOAT ); break;
3111 case Bytecodes::_dastore : store_indexed(T_DOUBLE); break;
3112 case Bytecodes::_aastore : store_indexed(T_OBJECT); break;
3113 case Bytecodes::_bastore : store_indexed(T_BYTE ); break;
3114 case Bytecodes::_castore : store_indexed(T_CHAR ); break;
3115 case Bytecodes::_sastore : store_indexed(T_SHORT ); break;
3116 case Bytecodes::_pop : // fall through
3117 case Bytecodes::_pop2 : // fall through
3118 case Bytecodes::_dup : // fall through
3119 case Bytecodes::_dup_x1 : // fall through
3120 case Bytecodes::_dup_x2 : // fall through
3121 case Bytecodes::_dup2 : // fall through
3122 case Bytecodes::_dup2_x1 : // fall through
3123 case Bytecodes::_dup2_x2 : // fall through
3124 case Bytecodes::_swap : stack_op(code); break;
3125 case Bytecodes::_iadd : arithmetic_op(intType , code); break;
3126 case Bytecodes::_ladd : arithmetic_op(longType , code); break;
3127 case Bytecodes::_fadd : arithmetic_op(floatType , code); break;
3128 case Bytecodes::_dadd : arithmetic_op(doubleType, code); break;
3129 case Bytecodes::_isub : arithmetic_op(intType , code); break;
3130 case Bytecodes::_lsub : arithmetic_op(longType , code); break;
3131 case Bytecodes::_fsub : arithmetic_op(floatType , code); break;
3132 case Bytecodes::_dsub : arithmetic_op(doubleType, code); break;
3133 case Bytecodes::_imul : arithmetic_op(intType , code); break;
3134 case Bytecodes::_lmul : arithmetic_op(longType , code); break;
3135 case Bytecodes::_fmul : arithmetic_op(floatType , code); break;
3136 case Bytecodes::_dmul : arithmetic_op(doubleType, code); break;
3137 case Bytecodes::_idiv : arithmetic_op(intType , code, copy_state_for_exception()); break;
3138 case Bytecodes::_ldiv : arithmetic_op(longType , code, copy_state_for_exception()); break;
3139 case Bytecodes::_fdiv : arithmetic_op(floatType , code); break;
3140 case Bytecodes::_ddiv : arithmetic_op(doubleType, code); break;
3141 case Bytecodes::_irem : arithmetic_op(intType , code, copy_state_for_exception()); break;
3142 case Bytecodes::_lrem : arithmetic_op(longType , code, copy_state_for_exception()); break;
3143 case Bytecodes::_frem : arithmetic_op(floatType , code); break;
3144 case Bytecodes::_drem : arithmetic_op(doubleType, code); break;
3145 case Bytecodes::_ineg : negate_op(intType ); break;
3146 case Bytecodes::_lneg : negate_op(longType ); break;
3147 case Bytecodes::_fneg : negate_op(floatType ); break;
3148 case Bytecodes::_dneg : negate_op(doubleType); break;
3149 case Bytecodes::_ishl : shift_op(intType , code); break;
3150 case Bytecodes::_lshl : shift_op(longType, code); break;
3151 case Bytecodes::_ishr : shift_op(intType , code); break;
3152 case Bytecodes::_lshr : shift_op(longType, code); break;
3153 case Bytecodes::_iushr : shift_op(intType , code); break;
3154 case Bytecodes::_lushr : shift_op(longType, code); break;
3155 case Bytecodes::_iand : logic_op(intType , code); break;
3156 case Bytecodes::_land : logic_op(longType, code); break;
3157 case Bytecodes::_ior : logic_op(intType , code); break;
3158 case Bytecodes::_lor : logic_op(longType, code); break;
3159 case Bytecodes::_ixor : logic_op(intType , code); break;
3160 case Bytecodes::_lxor : logic_op(longType, code); break;
3161 case Bytecodes::_iinc : increment(); break;
3162 case Bytecodes::_i2l : convert(code, T_INT , T_LONG ); break;
3163 case Bytecodes::_i2f : convert(code, T_INT , T_FLOAT ); break;
3164 case Bytecodes::_i2d : convert(code, T_INT , T_DOUBLE); break;
3165 case Bytecodes::_l2i : convert(code, T_LONG , T_INT ); break;
3166 case Bytecodes::_l2f : convert(code, T_LONG , T_FLOAT ); break;
3167 case Bytecodes::_l2d : convert(code, T_LONG , T_DOUBLE); break;
3168 case Bytecodes::_f2i : convert(code, T_FLOAT , T_INT ); break;
3169 case Bytecodes::_f2l : convert(code, T_FLOAT , T_LONG ); break;
3170 case Bytecodes::_f2d : convert(code, T_FLOAT , T_DOUBLE); break;
3171 case Bytecodes::_d2i : convert(code, T_DOUBLE, T_INT ); break;
3172 case Bytecodes::_d2l : convert(code, T_DOUBLE, T_LONG ); break;
3173 case Bytecodes::_d2f : convert(code, T_DOUBLE, T_FLOAT ); break;
3174 case Bytecodes::_i2b : convert(code, T_INT , T_BYTE ); break;
3175 case Bytecodes::_i2c : convert(code, T_INT , T_CHAR ); break;
3176 case Bytecodes::_i2s : convert(code, T_INT , T_SHORT ); break;
3177 case Bytecodes::_lcmp : compare_op(longType , code); break;
3178 case Bytecodes::_fcmpl : compare_op(floatType , code); break;
3179 case Bytecodes::_fcmpg : compare_op(floatType , code); break;
3180 case Bytecodes::_dcmpl : compare_op(doubleType, code); break;
3181 case Bytecodes::_dcmpg : compare_op(doubleType, code); break;
3182 case Bytecodes::_ifeq : if_zero(intType , If::eql); break;
3183 case Bytecodes::_ifne : if_zero(intType , If::neq); break;
3184 case Bytecodes::_iflt : if_zero(intType , If::lss); break;
3185 case Bytecodes::_ifge : if_zero(intType , If::geq); break;
3186 case Bytecodes::_ifgt : if_zero(intType , If::gtr); break;
3187 case Bytecodes::_ifle : if_zero(intType , If::leq); break;
3188 case Bytecodes::_if_icmpeq : if_same(intType , If::eql); break;
3189 case Bytecodes::_if_icmpne : if_same(intType , If::neq); break;
3190 case Bytecodes::_if_icmplt : if_same(intType , If::lss); break;
3191 case Bytecodes::_if_icmpge : if_same(intType , If::geq); break;
3192 case Bytecodes::_if_icmpgt : if_same(intType , If::gtr); break;
3193 case Bytecodes::_if_icmple : if_same(intType , If::leq); break;
3194 case Bytecodes::_if_acmpeq : if_same(objectType, If::eql); break;
3195 case Bytecodes::_if_acmpne : if_same(objectType, If::neq); break;
3196 case Bytecodes::_goto : _goto(s.cur_bci(), s.get_dest()); break;
3197 case Bytecodes::_jsr : jsr(s.get_dest()); break;
3198 case Bytecodes::_ret : ret(s.get_index()); break;
3199 case Bytecodes::_tableswitch : table_switch(); break;
3200 case Bytecodes::_lookupswitch : lookup_switch(); break;
3201 case Bytecodes::_ireturn : method_return(ipop(), ignore_return); break;
3202 case Bytecodes::_lreturn : method_return(lpop(), ignore_return); break;
3203 case Bytecodes::_freturn : method_return(fpop(), ignore_return); break;
3204 case Bytecodes::_dreturn : method_return(dpop(), ignore_return); break;
3205 case Bytecodes::_areturn : method_return(apop(), ignore_return); break;
3206 case Bytecodes::_return : method_return(nullptr, ignore_return); break;
3207 case Bytecodes::_getstatic : // fall through
3208 case Bytecodes::_putstatic : // fall through
3209 case Bytecodes::_getfield : // fall through
3210 case Bytecodes::_putfield : access_field(code); break;
3211 case Bytecodes::_invokevirtual : // fall through
3212 case Bytecodes::_invokespecial : // fall through
3213 case Bytecodes::_invokestatic : // fall through
3214 case Bytecodes::_invokedynamic : // fall through
3215 case Bytecodes::_invokeinterface: invoke(code); break;
3216 case Bytecodes::_new : new_instance(s.get_index_u2()); break;
3217 case Bytecodes::_newarray : new_type_array(); break;
3218 case Bytecodes::_anewarray : new_object_array(); break;
3219 case Bytecodes::_arraylength : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; }
3220 case Bytecodes::_athrow : throw_op(s.cur_bci()); break;
3221 case Bytecodes::_checkcast : check_cast(s.get_index_u2()); break;
3222 case Bytecodes::_instanceof : instance_of(s.get_index_u2()); break;
3223 case Bytecodes::_monitorenter : monitorenter(apop(), s.cur_bci()); break;
3224 case Bytecodes::_monitorexit : monitorexit (apop(), s.cur_bci()); break;
3225 case Bytecodes::_wide : ShouldNotReachHere(); break;
3226 case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break;
3227 case Bytecodes::_ifnull : if_null(objectType, If::eql); break;
3228 case Bytecodes::_ifnonnull : if_null(objectType, If::neq); break;
3229 case Bytecodes::_goto_w : _goto(s.cur_bci(), s.get_far_dest()); break;
3230 case Bytecodes::_jsr_w : jsr(s.get_far_dest()); break;
3231 case Bytecodes::_breakpoint : BAILOUT_("concurrent setting of breakpoint", nullptr);
3232 default : ShouldNotReachHere(); break;
3233 }
3234
3235 if (log != nullptr)
3236 log->clear_context(); // skip marker if nothing was printed
3237
3238 // save current bci to setup Goto at the end
3239 prev_bci = s.cur_bci();
3240
3241 }
3242 CHECK_BAILOUT_(nullptr);
3243 // stop processing of this block (see try_inline_full)
3244 if (_skip_block) {
3245 _skip_block = false;
3246 assert(_last && _last->as_BlockEnd(), "");
3247 return _last->as_BlockEnd();
3248 }
3249 // if there are any, check if last instruction is a BlockEnd instruction
3250 BlockEnd* end = last()->as_BlockEnd();
3251 if (end == nullptr) {
3252 // all blocks must end with a BlockEnd instruction => add a Goto
3253 end = new Goto(block_at(s.cur_bci()), false);
3254 append(end);
3255 }
3256 assert(end == last()->as_BlockEnd(), "inconsistency");
3257
3258 assert(end->state() != nullptr, "state must already be present");
3259 assert(end->as_Return() == nullptr || end->as_Throw() == nullptr || end->state()->stack_size() == 0, "stack not needed for return and throw");
3260
3261 // connect to begin & set state
3262 // NOTE that inlining may have changed the block we are parsing
3263 block()->set_end(end);
3264 // propagate state
3265 for (int i = end->number_of_sux() - 1; i >= 0; i--) {
3266 BlockBegin* sux = end->sux_at(i);
3267 assert(sux->is_predecessor(block()), "predecessor missing");
3268 // be careful, bailout if bytecodes are strange
3269 if (!sux->try_merge(end->state(), compilation()->has_irreducible_loops())) BAILOUT_("block join failed", nullptr);
3270 scope_data()->add_to_work_list(end->sux_at(i));
3271 }
3272
3273 scope_data()->set_stream(nullptr);
3274
3275 // done
3276 return end;
3277 }
3278
3279
3280 void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) {
3281 do {
3282 if (start_in_current_block_for_inlining && !bailed_out()) {
3283 iterate_bytecodes_for_block(0);
3284 start_in_current_block_for_inlining = false;
3285 } else {
3286 BlockBegin* b;
3287 while ((b = scope_data()->remove_from_work_list()) != nullptr) {
3288 if (!b->is_set(BlockBegin::was_visited_flag)) {
3289 if (b->is_set(BlockBegin::osr_entry_flag)) {
3290 // we're about to parse the osr entry block, so make sure
3291 // we setup the OSR edge leading into this block so that
3292 // Phis get setup correctly.
3293 setup_osr_entry_block();
3294 // this is no longer the osr entry block, so clear it.
3295 b->clear(BlockBegin::osr_entry_flag);
3296 }
3297 b->set(BlockBegin::was_visited_flag);
3298 connect_to_end(b);
3299 }
3300 }
3301 }
3302 } while (!bailed_out() && !scope_data()->is_work_list_empty());
3303 }
3304
3305
3306 bool GraphBuilder::_can_trap [Bytecodes::number_of_java_codes];
3307
3308 void GraphBuilder::initialize() {
3309 // the following bytecodes are assumed to potentially
3310 // throw exceptions in compiled code - note that e.g.
3311 // monitorexit & the return bytecodes do not throw
3312 // exceptions since monitor pairing proved that they
3313 // succeed (if monitor pairing succeeded)
3314 Bytecodes::Code can_trap_list[] =
3315 { Bytecodes::_ldc
3316 , Bytecodes::_ldc_w
3317 , Bytecodes::_ldc2_w
3318 , Bytecodes::_iaload
3319 , Bytecodes::_laload
3320 , Bytecodes::_faload
3321 , Bytecodes::_daload
3322 , Bytecodes::_aaload
3323 , Bytecodes::_baload
3324 , Bytecodes::_caload
3325 , Bytecodes::_saload
3326 , Bytecodes::_iastore
3327 , Bytecodes::_lastore
3328 , Bytecodes::_fastore
3329 , Bytecodes::_dastore
3330 , Bytecodes::_aastore
3331 , Bytecodes::_bastore
3332 , Bytecodes::_castore
3333 , Bytecodes::_sastore
3334 , Bytecodes::_idiv
3335 , Bytecodes::_ldiv
3336 , Bytecodes::_irem
3337 , Bytecodes::_lrem
3338 , Bytecodes::_getstatic
3339 , Bytecodes::_putstatic
3340 , Bytecodes::_getfield
3341 , Bytecodes::_putfield
3342 , Bytecodes::_invokevirtual
3343 , Bytecodes::_invokespecial
3344 , Bytecodes::_invokestatic
3345 , Bytecodes::_invokedynamic
3346 , Bytecodes::_invokeinterface
3347 , Bytecodes::_new
3348 , Bytecodes::_newarray
3349 , Bytecodes::_anewarray
3350 , Bytecodes::_arraylength
3351 , Bytecodes::_athrow
3352 , Bytecodes::_checkcast
3353 , Bytecodes::_instanceof
3354 , Bytecodes::_monitorenter
3355 , Bytecodes::_multianewarray
3356 };
3357
3358 // inititialize trap tables
3359 for (int i = 0; i < Bytecodes::number_of_java_codes; i++) {
3360 _can_trap[i] = false;
3361 }
3362 // set standard trap info
3363 for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) {
3364 _can_trap[can_trap_list[j]] = true;
3365 }
3366 }
3367
3368
3369 BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {
3370 assert(entry->is_set(f), "entry/flag mismatch");
3371 // create header block
3372 BlockBegin* h = new BlockBegin(entry->bci());
3373 h->set_depth_first_number(0);
3374
3375 Value l = h;
3376 BlockEnd* g = new Goto(entry, false);
3377 l->set_next(g, entry->bci());
3378 h->set_end(g);
3379 h->set(f);
3380 // setup header block end state
3381 ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis)
3382 assert(s->stack_is_empty(), "must have empty stack at entry point");
3383 g->set_state(s);
3384 return h;
3385 }
3386
3387
3388
3389 BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) {
3390 BlockBegin* start = new BlockBegin(0);
3391
3392 // This code eliminates the empty start block at the beginning of
3393 // each method. Previously, each method started with the
3394 // start-block created below, and this block was followed by the
3395 // header block that was always empty. This header block is only
3396 // necessary if std_entry is also a backward branch target because
3397 // then phi functions may be necessary in the header block. It's
3398 // also necessary when profiling so that there's a single block that
3399 // can increment the counters.
3400 // In addition, with range check elimination, we may need a valid block
3401 // that dominates all the rest to insert range predicates.
3402 BlockBegin* new_header_block;
3403 if (std_entry->number_of_preds() > 0 || is_profiling() || RangeCheckElimination) {
3404 new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state);
3405 } else {
3406 new_header_block = std_entry;
3407 }
3408
3409 // setup start block (root for the IR graph)
3410 Base* base =
3411 new Base(
3412 new_header_block,
3413 osr_entry
3414 );
3415 start->set_next(base, 0);
3416 start->set_end(base);
3417 // create & setup state for start block
3418 start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3419 base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3420
3421 if (base->std_entry()->state() == nullptr) {
3422 // setup states for header blocks
3423 base->std_entry()->merge(state, compilation()->has_irreducible_loops());
3424 }
3425
3426 assert(base->std_entry()->state() != nullptr, "");
3427 return start;
3428 }
3429
3430
3431 void GraphBuilder::setup_osr_entry_block() {
3432 assert(compilation()->is_osr_compile(), "only for osrs");
3433
3434 int osr_bci = compilation()->osr_bci();
3435 ciBytecodeStream s(method());
3436 s.reset_to_bci(osr_bci);
3437 s.next();
3438 scope_data()->set_stream(&s);
3439
3440 // create a new block to be the osr setup code
3441 _osr_entry = new BlockBegin(osr_bci);
3442 _osr_entry->set(BlockBegin::osr_entry_flag);
3443 _osr_entry->set_depth_first_number(0);
3444 BlockBegin* target = bci2block()->at(osr_bci);
3445 assert(target != nullptr && target->is_set(BlockBegin::osr_entry_flag), "must be there");
3446 // the osr entry has no values for locals
3447 ValueStack* state = target->state()->copy();
3448 _osr_entry->set_state(state);
3449
3450 kill_all();
3451 _block = _osr_entry;
3452 _state = _osr_entry->state()->copy();
3453 assert(_state->bci() == osr_bci, "mismatch");
3454 _last = _osr_entry;
3455 Value e = append(new OsrEntry());
3456 e->set_needs_null_check(false);
3457
3458 // OSR buffer is
3459 //
3460 // locals[nlocals-1..0]
3461 // monitors[number_of_locks-1..0]
3462 //
3463 // locals is a direct copy of the interpreter frame so in the osr buffer
3464 // so first slot in the local array is the last local from the interpreter
3465 // and last slot is local[0] (receiver) from the interpreter
3466 //
3467 // Similarly with locks. The first lock slot in the osr buffer is the nth lock
3468 // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
3469 // in the interpreter frame (the method lock if a sync method)
3470
3471 // Initialize monitors in the compiled activation.
3472
3473 int index;
3474 Value local;
3475
3476 // find all the locals that the interpreter thinks contain live oops
3477 const ResourceBitMap live_oops = method()->live_local_oops_at_bci(osr_bci);
3478
3479 // compute the offset into the locals so that we can treat the buffer
3480 // as if the locals were still in the interpreter frame
3481 int locals_offset = BytesPerWord * (method()->max_locals() - 1);
3482 for_each_local_value(state, index, local) {
3483 int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord;
3484 Value get;
3485 if (local->type()->is_object_kind() && !live_oops.at(index)) {
3486 // The interpreter thinks this local is dead but the compiler
3487 // doesn't so pretend that the interpreter passed in null.
3488 get = append(new Constant(objectNull));
3489 } else {
3490 Value off_val = append(new Constant(new IntConstant(offset)));
3491 get = append(new UnsafeGet(as_BasicType(local->type()), e,
3492 off_val,
3493 false/*is_volatile*/,
3494 true/*is_raw*/));
3495 }
3496 _state->store_local(index, get);
3497 }
3498
3499 // the storage for the OSR buffer is freed manually in the LIRGenerator.
3500
3501 assert(state->caller_state() == nullptr, "should be top scope");
3502 state->clear_locals();
3503 Goto* g = new Goto(target, false);
3504 append(g);
3505 _osr_entry->set_end(g);
3506 target->merge(_osr_entry->end()->state(), compilation()->has_irreducible_loops());
3507
3508 scope_data()->set_stream(nullptr);
3509 }
3510
3511
3512 ValueStack* GraphBuilder::state_at_entry() {
3513 ValueStack* state = new ValueStack(scope(), nullptr);
3514
3515 // Set up locals for receiver
3516 int idx = 0;
3517 if (!method()->is_static()) {
3518 // we should always see the receiver
3519 state->store_local(idx, new Local(method()->holder(), objectType, idx,
3520 /*receiver*/ true, /*null_free*/ method()->holder()->is_flat_array_klass()));
3521 idx = 1;
3522 }
3523
3524 // Set up locals for incoming arguments
3525 ciSignature* sig = method()->signature();
3526 for (int i = 0; i < sig->count(); i++) {
3527 ciType* type = sig->type_at(i);
3528 BasicType basic_type = type->basic_type();
3529 // don't allow T_ARRAY to propagate into locals types
3530 if (is_reference_type(basic_type)) basic_type = T_OBJECT;
3531 ValueType* vt = as_ValueType(basic_type);
3532 state->store_local(idx, new Local(type, vt, idx, false, false));
3533 idx += type->size();
3534 }
3535
3536 // lock synchronized method
3537 if (method()->is_synchronized()) {
3538 state->lock(nullptr);
3539 }
3540
3541 return state;
3542 }
3543
3544
3545 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
3546 : _scope_data(nullptr)
3547 , _compilation(compilation)
3548 , _memory(new MemoryBuffer())
3549 , _inline_bailout_msg(nullptr)
3550 , _instruction_count(0)
3551 , _osr_entry(nullptr)
3552 , _pending_field_access(nullptr)
3553 , _pending_load_indexed(nullptr)
3554 {
3555 int osr_bci = compilation->osr_bci();
3556
3557 // determine entry points and bci2block mapping
3558 BlockListBuilder blm(compilation, scope, osr_bci);
3559 CHECK_BAILOUT();
3560
3561 BlockList* bci2block = blm.bci2block();
3562 BlockBegin* start_block = bci2block->at(0);
3563
3564 push_root_scope(scope, bci2block, start_block);
3565
3566 // setup state for std entry
3567 _initial_state = state_at_entry();
3568 start_block->merge(_initial_state, compilation->has_irreducible_loops());
3569
3570 // End nulls still exist here
3571
3572 // complete graph
3573 _vmap = new ValueMap();
3574 switch (scope->method()->intrinsic_id()) {
3575 case vmIntrinsics::_dabs : // fall through
3576 case vmIntrinsics::_dsqrt : // fall through
3577 case vmIntrinsics::_dsqrt_strict : // fall through
3578 case vmIntrinsics::_dsin : // fall through
3579 case vmIntrinsics::_dcos : // fall through
3580 case vmIntrinsics::_dtan : // fall through
3581 case vmIntrinsics::_dtanh : // fall through
3582 case vmIntrinsics::_dlog : // fall through
3583 case vmIntrinsics::_dlog10 : // fall through
3584 case vmIntrinsics::_dexp : // fall through
3585 case vmIntrinsics::_dpow : // fall through
3586 {
3587 // Compiles where the root method is an intrinsic need a special
3588 // compilation environment because the bytecodes for the method
3589 // shouldn't be parsed during the compilation, only the special
3590 // Intrinsic node should be emitted. If this isn't done the
3591 // code for the inlined version will be different than the root
3592 // compiled version which could lead to monotonicity problems on
3593 // intel.
3594 if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3595 BAILOUT("failed to inline intrinsic, method not annotated");
3596 }
3597
3598 // Set up a stream so that appending instructions works properly.
3599 ciBytecodeStream s(scope->method());
3600 s.reset_to_bci(0);
3601 scope_data()->set_stream(&s);
3602 s.next();
3603
3604 // setup the initial block state
3605 _block = start_block;
3606 _state = start_block->state()->copy_for_parsing();
3607 _last = start_block;
3608 load_local(doubleType, 0);
3609 if (scope->method()->intrinsic_id() == vmIntrinsics::_dpow) {
3610 load_local(doubleType, 2);
3611 }
3612
3613 // Emit the intrinsic node.
3614 bool result = try_inline_intrinsics(scope->method());
3615 if (!result) BAILOUT("failed to inline intrinsic");
3616 method_return(dpop());
3617
3618 // connect the begin and end blocks and we're all done.
3619 BlockEnd* end = last()->as_BlockEnd();
3620 block()->set_end(end);
3621 break;
3622 }
3623
3624 case vmIntrinsics::_Reference_get:
3625 {
3626 {
3627 // With java.lang.ref.reference.get() we must go through the
3628 // intrinsic - when G1 is enabled - even when get() is the root
3629 // method of the compile so that, if necessary, the value in
3630 // the referent field of the reference object gets recorded by
3631 // the pre-barrier code.
3632 // Specifically, if G1 is enabled, the value in the referent
3633 // field is recorded by the G1 SATB pre barrier. This will
3634 // result in the referent being marked live and the reference
3635 // object removed from the list of discovered references during
3636 // reference processing.
3637 if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {
3638 BAILOUT("failed to inline intrinsic, method not annotated");
3639 }
3640
3641 // Also we need intrinsic to prevent commoning reads from this field
3642 // across safepoint since GC can change its value.
3643
3644 // Set up a stream so that appending instructions works properly.
3645 ciBytecodeStream s(scope->method());
3646 s.reset_to_bci(0);
3647 scope_data()->set_stream(&s);
3648 s.next();
3649
3650 // setup the initial block state
3651 _block = start_block;
3652 _state = start_block->state()->copy_for_parsing();
3653 _last = start_block;
3654 load_local(objectType, 0);
3655
3656 // Emit the intrinsic node.
3657 bool result = try_inline_intrinsics(scope->method());
3658 if (!result) BAILOUT("failed to inline intrinsic");
3659 method_return(apop());
3660
3661 // connect the begin and end blocks and we're all done.
3662 BlockEnd* end = last()->as_BlockEnd();
3663 block()->set_end(end);
3664 break;
3665 }
3666 // Otherwise, fall thru
3667 }
3668
3669 default:
3670 scope_data()->add_to_work_list(start_block);
3671 iterate_all_blocks();
3672 break;
3673 }
3674 CHECK_BAILOUT();
3675
3676 # ifdef ASSERT
3677 // For all blocks reachable from start_block: _end must be non-null
3678 {
3679 BlockList processed;
3680 BlockList to_go;
3681 to_go.append(start_block);
3682 while(to_go.length() > 0) {
3683 BlockBegin* current = to_go.pop();
3684 assert(current != nullptr, "Should not happen.");
3685 assert(current->end() != nullptr, "All blocks reachable from start_block should have end() != nullptr.");
3686 processed.append(current);
3687 for(int i = 0; i < current->number_of_sux(); i++) {
3688 BlockBegin* s = current->sux_at(i);
3689 if (!processed.contains(s)) {
3690 to_go.append(s);
3691 }
3692 }
3693 }
3694 }
3695 #endif // ASSERT
3696
3697 _start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state);
3698
3699 eliminate_redundant_phis(_start);
3700
3701 NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats());
3702 // for osr compile, bailout if some requirements are not fulfilled
3703 if (osr_bci != -1) {
3704 BlockBegin* osr_block = blm.bci2block()->at(osr_bci);
3705 if (!osr_block->is_set(BlockBegin::was_visited_flag)) {
3706 BAILOUT("osr entry must have been visited for osr compile");
3707 }
3708
3709 // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
3710 if (!osr_block->state()->stack_is_empty()) {
3711 BAILOUT("stack not empty at OSR entry point");
3712 }
3713 }
3714 #ifndef PRODUCT
3715 if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count);
3716 #endif
3717 }
3718
3719
3720 ValueStack* GraphBuilder::copy_state_before() {
3721 return copy_state_before_with_bci(bci());
3722 }
3723
3724 ValueStack* GraphBuilder::copy_state_exhandling() {
3725 return copy_state_exhandling_with_bci(bci());
3726 }
3727
3728 ValueStack* GraphBuilder::copy_state_for_exception() {
3729 return copy_state_for_exception_with_bci(bci());
3730 }
3731
3732 ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) {
3733 return state()->copy(ValueStack::StateBefore, bci);
3734 }
3735
3736 ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) {
3737 if (!has_handler()) return nullptr;
3738 return state()->copy(ValueStack::StateBefore, bci);
3739 }
3740
3741 ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) {
3742 ValueStack* s = copy_state_exhandling_with_bci(bci);
3743 if (s == nullptr) {
3744 // no handler, no need to retain locals
3745 ValueStack::Kind exc_kind = ValueStack::empty_exception_kind();
3746 s = state()->copy(exc_kind, bci);
3747 }
3748 return s;
3749 }
3750
3751 int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const {
3752 int recur_level = 0;
3753 for (IRScope* s = scope(); s != nullptr; s = s->caller()) {
3754 if (s->method() == cur_callee) {
3755 ++recur_level;
3756 }
3757 }
3758 return recur_level;
3759 }
3760
3761 static void set_flags_for_inlined_callee(Compilation* compilation, ciMethod* callee) {
3762 if (callee->has_reserved_stack_access()) {
3763 compilation->set_has_reserved_stack_access(true);
3764 }
3765 if (callee->is_synchronized() || callee->has_monitor_bytecodes()) {
3766 compilation->set_has_monitors(true);
3767 }
3768 if (callee->is_scoped()) {
3769 compilation->set_has_scoped_access(true);
3770 }
3771 }
3772
3773 bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
3774 const char* msg = nullptr;
3775
3776 // clear out any existing inline bailout condition
3777 clear_inline_bailout();
3778
3779 // exclude methods we don't want to inline
3780 msg = should_not_inline(callee);
3781 if (msg != nullptr) {
3782 print_inlining(callee, msg, /*success*/ false);
3783 return false;
3784 }
3785
3786 // method handle invokes
3787 if (callee->is_method_handle_intrinsic()) {
3788 if (try_method_handle_inline(callee, ignore_return)) {
3789 set_flags_for_inlined_callee(compilation(), callee);
3790 return true;
3791 }
3792 return false;
3793 }
3794
3795 // handle intrinsics
3796 if (callee->intrinsic_id() != vmIntrinsics::_none &&
3797 callee->check_intrinsic_candidate()) {
3798 if (try_inline_intrinsics(callee, ignore_return)) {
3799 print_inlining(callee, "intrinsic");
3800 set_flags_for_inlined_callee(compilation(), callee);
3801 return true;
3802 }
3803 // try normal inlining
3804 }
3805
3806 // certain methods cannot be parsed at all
3807 msg = check_can_parse(callee);
3808 if (msg != nullptr) {
3809 print_inlining(callee, msg, /*success*/ false);
3810 return false;
3811 }
3812
3813 // If bytecode not set use the current one.
3814 if (bc == Bytecodes::_illegal) {
3815 bc = code();
3816 }
3817 if (try_inline_full(callee, holder_known, ignore_return, bc, receiver)) {
3818 set_flags_for_inlined_callee(compilation(), callee);
3819 return true;
3820 }
3821
3822 // Entire compilation could fail during try_inline_full call.
3823 // In that case printing inlining decision info is useless.
3824 if (!bailed_out())
3825 print_inlining(callee, _inline_bailout_msg, /*success*/ false);
3826
3827 return false;
3828 }
3829
3830
3831 const char* GraphBuilder::check_can_parse(ciMethod* callee) const {
3832 // Certain methods cannot be parsed at all:
3833 if ( callee->is_native()) return "native method";
3834 if ( callee->is_abstract()) return "abstract method";
3835 if (!callee->can_be_parsed()) return "cannot be parsed";
3836 return nullptr;
3837 }
3838
3839 // negative filter: should callee NOT be inlined? returns null, ok to inline, or rejection msg
3840 const char* GraphBuilder::should_not_inline(ciMethod* callee) const {
3841 if ( compilation()->directive()->should_not_inline(callee)) return "disallowed by CompileCommand";
3842 if ( callee->dont_inline()) return "don't inline by annotation";
3843 return nullptr;
3844 }
3845
3846 void GraphBuilder::build_graph_for_intrinsic(ciMethod* callee, bool ignore_return) {
3847 vmIntrinsics::ID id = callee->intrinsic_id();
3848 assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
3849
3850 // Some intrinsics need special IR nodes.
3851 switch(id) {
3852 case vmIntrinsics::_getReference : append_unsafe_get(callee, T_OBJECT, false); return;
3853 case vmIntrinsics::_getBoolean : append_unsafe_get(callee, T_BOOLEAN, false); return;
3854 case vmIntrinsics::_getByte : append_unsafe_get(callee, T_BYTE, false); return;
3855 case vmIntrinsics::_getShort : append_unsafe_get(callee, T_SHORT, false); return;
3856 case vmIntrinsics::_getChar : append_unsafe_get(callee, T_CHAR, false); return;
3857 case vmIntrinsics::_getInt : append_unsafe_get(callee, T_INT, false); return;
3858 case vmIntrinsics::_getLong : append_unsafe_get(callee, T_LONG, false); return;
3859 case vmIntrinsics::_getFloat : append_unsafe_get(callee, T_FLOAT, false); return;
3860 case vmIntrinsics::_getDouble : append_unsafe_get(callee, T_DOUBLE, false); return;
3861 case vmIntrinsics::_putReference : append_unsafe_put(callee, T_OBJECT, false); return;
3862 case vmIntrinsics::_putBoolean : append_unsafe_put(callee, T_BOOLEAN, false); return;
3863 case vmIntrinsics::_putByte : append_unsafe_put(callee, T_BYTE, false); return;
3864 case vmIntrinsics::_putShort : append_unsafe_put(callee, T_SHORT, false); return;
3865 case vmIntrinsics::_putChar : append_unsafe_put(callee, T_CHAR, false); return;
3866 case vmIntrinsics::_putInt : append_unsafe_put(callee, T_INT, false); return;
3867 case vmIntrinsics::_putLong : append_unsafe_put(callee, T_LONG, false); return;
3868 case vmIntrinsics::_putFloat : append_unsafe_put(callee, T_FLOAT, false); return;
3869 case vmIntrinsics::_putDouble : append_unsafe_put(callee, T_DOUBLE, false); return;
3870 case vmIntrinsics::_getShortUnaligned : append_unsafe_get(callee, T_SHORT, false); return;
3871 case vmIntrinsics::_getCharUnaligned : append_unsafe_get(callee, T_CHAR, false); return;
3872 case vmIntrinsics::_getIntUnaligned : append_unsafe_get(callee, T_INT, false); return;
3873 case vmIntrinsics::_getLongUnaligned : append_unsafe_get(callee, T_LONG, false); return;
3874 case vmIntrinsics::_putShortUnaligned : append_unsafe_put(callee, T_SHORT, false); return;
3875 case vmIntrinsics::_putCharUnaligned : append_unsafe_put(callee, T_CHAR, false); return;
3876 case vmIntrinsics::_putIntUnaligned : append_unsafe_put(callee, T_INT, false); return;
3877 case vmIntrinsics::_putLongUnaligned : append_unsafe_put(callee, T_LONG, false); return;
3878 case vmIntrinsics::_getReferenceVolatile : append_unsafe_get(callee, T_OBJECT, true); return;
3879 case vmIntrinsics::_getBooleanVolatile : append_unsafe_get(callee, T_BOOLEAN, true); return;
3880 case vmIntrinsics::_getByteVolatile : append_unsafe_get(callee, T_BYTE, true); return;
3881 case vmIntrinsics::_getShortVolatile : append_unsafe_get(callee, T_SHORT, true); return;
3882 case vmIntrinsics::_getCharVolatile : append_unsafe_get(callee, T_CHAR, true); return;
3883 case vmIntrinsics::_getIntVolatile : append_unsafe_get(callee, T_INT, true); return;
3884 case vmIntrinsics::_getLongVolatile : append_unsafe_get(callee, T_LONG, true); return;
3885 case vmIntrinsics::_getFloatVolatile : append_unsafe_get(callee, T_FLOAT, true); return;
3886 case vmIntrinsics::_getDoubleVolatile : append_unsafe_get(callee, T_DOUBLE, true); return;
3887 case vmIntrinsics::_putReferenceVolatile : append_unsafe_put(callee, T_OBJECT, true); return;
3888 case vmIntrinsics::_putBooleanVolatile : append_unsafe_put(callee, T_BOOLEAN, true); return;
3889 case vmIntrinsics::_putByteVolatile : append_unsafe_put(callee, T_BYTE, true); return;
3890 case vmIntrinsics::_putShortVolatile : append_unsafe_put(callee, T_SHORT, true); return;
3891 case vmIntrinsics::_putCharVolatile : append_unsafe_put(callee, T_CHAR, true); return;
3892 case vmIntrinsics::_putIntVolatile : append_unsafe_put(callee, T_INT, true); return;
3893 case vmIntrinsics::_putLongVolatile : append_unsafe_put(callee, T_LONG, true); return;
3894 case vmIntrinsics::_putFloatVolatile : append_unsafe_put(callee, T_FLOAT, true); return;
3895 case vmIntrinsics::_putDoubleVolatile : append_unsafe_put(callee, T_DOUBLE, true); return;
3896 case vmIntrinsics::_compareAndSetLong:
3897 case vmIntrinsics::_compareAndSetInt:
3898 case vmIntrinsics::_compareAndSetReference : append_unsafe_CAS(callee); return;
3899 case vmIntrinsics::_getAndAddInt:
3900 case vmIntrinsics::_getAndAddLong : append_unsafe_get_and_set(callee, true); return;
3901 case vmIntrinsics::_getAndSetInt :
3902 case vmIntrinsics::_getAndSetLong :
3903 case vmIntrinsics::_getAndSetReference : append_unsafe_get_and_set(callee, false); return;
3904 case vmIntrinsics::_getCharStringU : append_char_access(callee, false); return;
3905 case vmIntrinsics::_putCharStringU : append_char_access(callee, true); return;
3906 case vmIntrinsics::_clone : append_alloc_array_copy(callee); return;
3907 default:
3908 break;
3909 }
3910 if (_inline_bailout_msg != nullptr) {
3911 return;
3912 }
3913
3914 // create intrinsic node
3915 const bool has_receiver = !callee->is_static();
3916 ValueType* result_type = as_ValueType(callee->return_type());
3917 ValueStack* state_before = copy_state_for_exception();
3918
3919 Values* args = state()->pop_arguments(callee->arg_size());
3920
3921 if (is_profiling()) {
3922 // Don't profile in the special case where the root method
3923 // is the intrinsic
3924 if (callee != method()) {
3925 // Note that we'd collect profile data in this method if we wanted it.
3926 compilation()->set_would_profile(true);
3927 if (profile_calls()) {
3928 Value recv = nullptr;
3929 if (has_receiver) {
3930 recv = args->at(0);
3931 null_check(recv);
3932 }
3933 profile_call(callee, recv, nullptr, collect_args_for_profiling(args, callee, true), true);
3934 }
3935 }
3936 }
3937
3938 Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(),
3939 args, has_receiver, state_before,
3940 vmIntrinsics::preserves_state(id),
3941 vmIntrinsics::can_trap(id));
3942 // append instruction & push result
3943 Value value = append_split(result);
3944 if (result_type != voidType && !ignore_return) {
3945 push(result_type, value);
3946 }
3947
3948 if (callee != method() && profile_return() && result_type->is_object_kind()) {
3949 profile_return_type(result, callee);
3950 }
3951 }
3952
3953 bool GraphBuilder::try_inline_intrinsics(ciMethod* callee, bool ignore_return) {
3954 // For calling is_intrinsic_available we need to transition to
3955 // the '_thread_in_vm' state because is_intrinsic_available()
3956 // accesses critical VM-internal data.
3957 bool is_available = false;
3958 {
3959 VM_ENTRY_MARK;
3960 methodHandle mh(THREAD, callee->get_Method());
3961 is_available = _compilation->compiler()->is_intrinsic_available(mh, _compilation->directive());
3962 }
3963
3964 if (!is_available) {
3965 if (!InlineNatives) {
3966 // Return false and also set message that the inlining of
3967 // intrinsics has been disabled in general.
3968 INLINE_BAILOUT("intrinsic method inlining disabled");
3969 } else {
3970 return false;
3971 }
3972 }
3973 build_graph_for_intrinsic(callee, ignore_return);
3974 if (_inline_bailout_msg != nullptr) {
3975 return false;
3976 }
3977 return true;
3978 }
3979
3980
3981 bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) {
3982 // Introduce a new callee continuation point - all Ret instructions
3983 // will be replaced with Gotos to this point.
3984 if (next_bci() >= method()->code_size()) {
3985 return false;
3986 }
3987 BlockBegin* cont = block_at(next_bci());
3988 assert(cont != nullptr, "continuation must exist (BlockListBuilder starts a new block after a jsr");
3989
3990 // Note: can not assign state to continuation yet, as we have to
3991 // pick up the state from the Ret instructions.
3992
3993 // Push callee scope
3994 push_scope_for_jsr(cont, jsr_dest_bci);
3995
3996 // Temporarily set up bytecode stream so we can append instructions
3997 // (only using the bci of this stream)
3998 scope_data()->set_stream(scope_data()->parent()->stream());
3999
4000 BlockBegin* jsr_start_block = block_at(jsr_dest_bci);
4001 assert(jsr_start_block != nullptr, "jsr start block must exist");
4002 assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet");
4003 Goto* goto_sub = new Goto(jsr_start_block, false);
4004 // Must copy state to avoid wrong sharing when parsing bytecodes
4005 assert(jsr_start_block->state() == nullptr, "should have fresh jsr starting block");
4006 jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci));
4007 append(goto_sub);
4008 _block->set_end(goto_sub);
4009 _last = _block = jsr_start_block;
4010
4011 // Clear out bytecode stream
4012 scope_data()->set_stream(nullptr);
4013
4014 scope_data()->add_to_work_list(jsr_start_block);
4015
4016 // Ready to resume parsing in subroutine
4017 iterate_all_blocks();
4018
4019 // If we bailed out during parsing, return immediately (this is bad news)
4020 CHECK_BAILOUT_(false);
4021
4022 // Detect whether the continuation can actually be reached. If not,
4023 // it has not had state set by the join() operations in
4024 // iterate_bytecodes_for_block()/ret() and we should not touch the
4025 // iteration state. The calling activation of
4026 // iterate_bytecodes_for_block will then complete normally.
4027 if (cont->state() != nullptr) {
4028 if (!cont->is_set(BlockBegin::was_visited_flag)) {
4029 // add continuation to work list instead of parsing it immediately
4030 scope_data()->parent()->add_to_work_list(cont);
4031 }
4032 }
4033
4034 assert(jsr_continuation() == cont, "continuation must not have changed");
4035 assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) ||
4036 jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag),
4037 "continuation can only be visited in case of backward branches");
4038 assert(_last && _last->as_BlockEnd(), "block must have end");
4039
4040 // continuation is in work list, so end iteration of current block
4041 _skip_block = true;
4042 pop_scope_for_jsr();
4043
4044 return true;
4045 }
4046
4047
4048 // Inline the entry of a synchronized method as a monitor enter and
4049 // register the exception handler which releases the monitor if an
4050 // exception is thrown within the callee. Note that the monitor enter
4051 // cannot throw an exception itself, because the receiver is
4052 // guaranteed to be non-null by the explicit null check at the
4053 // beginning of inlining.
4054 void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) {
4055 assert(lock != nullptr && sync_handler != nullptr, "lock or handler missing");
4056
4057 monitorenter(lock, SynchronizationEntryBCI);
4058 assert(_last->as_MonitorEnter() != nullptr, "monitor enter expected");
4059 _last->set_needs_null_check(false);
4060
4061 sync_handler->set(BlockBegin::exception_entry_flag);
4062 sync_handler->set(BlockBegin::is_on_work_list_flag);
4063
4064 ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0);
4065 XHandler* h = new XHandler(desc);
4066 h->set_entry_block(sync_handler);
4067 scope_data()->xhandlers()->append(h);
4068 scope_data()->set_has_handler();
4069 }
4070
4071
4072 // If an exception is thrown and not handled within an inlined
4073 // synchronized method, the monitor must be released before the
4074 // exception is rethrown in the outer scope. Generate the appropriate
4075 // instructions here.
4076 void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) {
4077 BlockBegin* orig_block = _block;
4078 ValueStack* orig_state = _state;
4079 Instruction* orig_last = _last;
4080 _last = _block = sync_handler;
4081 _state = sync_handler->state()->copy();
4082
4083 assert(sync_handler != nullptr, "handler missing");
4084 assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here");
4085
4086 assert(lock != nullptr || default_handler, "lock or handler missing");
4087
4088 XHandler* h = scope_data()->xhandlers()->remove_last();
4089 assert(h->entry_block() == sync_handler, "corrupt list of handlers");
4090
4091 block()->set(BlockBegin::was_visited_flag);
4092 Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI);
4093 assert(exception->is_pinned(), "must be");
4094
4095 int bci = SynchronizationEntryBCI;
4096 if (compilation()->env()->dtrace_method_probes()) {
4097 // Report exit from inline methods. We don't have a stream here
4098 // so pass an explicit bci of SynchronizationEntryBCI.
4099 Values* args = new Values(1);
4100 args->push(append_with_bci(new Constant(new MethodConstant(method())), bci));
4101 append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci);
4102 }
4103
4104 if (lock) {
4105 assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing");
4106 if (!lock->is_linked()) {
4107 lock = append_with_bci(lock, bci);
4108 }
4109
4110 // exit the monitor in the context of the synchronized method
4111 monitorexit(lock, bci);
4112
4113 // exit the context of the synchronized method
4114 if (!default_handler) {
4115 pop_scope();
4116 bci = _state->caller_state()->bci();
4117 _state = _state->caller_state()->copy_for_parsing();
4118 }
4119 }
4120
4121 // perform the throw as if at the call site
4122 apush(exception);
4123 throw_op(bci);
4124
4125 BlockEnd* end = last()->as_BlockEnd();
4126 block()->set_end(end);
4127
4128 _block = orig_block;
4129 _state = orig_state;
4130 _last = orig_last;
4131 }
4132
4133
4134 bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {
4135 assert(!callee->is_native(), "callee must not be native");
4136 if (CompilationPolicy::should_not_inline(compilation()->env(), callee)) {
4137 INLINE_BAILOUT("inlining prohibited by policy");
4138 }
4139 // first perform tests of things it's not possible to inline
4140 if (callee->has_exception_handlers() &&
4141 !InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers");
4142 if (callee->is_synchronized() &&
4143 !InlineSynchronizedMethods ) INLINE_BAILOUT("callee is synchronized");
4144 if (!callee->holder()->is_linked()) INLINE_BAILOUT("callee's klass not linked yet");
4145 if (bc == Bytecodes::_invokestatic &&
4146 !callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet");
4147 if (!callee->has_balanced_monitors()) INLINE_BAILOUT("callee's monitors do not match");
4148
4149 // Proper inlining of methods with jsrs requires a little more work.
4150 if (callee->has_jsrs() ) INLINE_BAILOUT("jsrs not handled properly by inliner yet");
4151
4152 if (is_profiling() && !callee->ensure_method_data()) {
4153 INLINE_BAILOUT("mdo allocation failed");
4154 }
4155
4156 const bool is_invokedynamic = (bc == Bytecodes::_invokedynamic);
4157 const bool has_receiver = (bc != Bytecodes::_invokestatic && !is_invokedynamic);
4158
4159 const int args_base = state()->stack_size() - callee->arg_size();
4160 assert(args_base >= 0, "stack underflow during inlining");
4161
4162 Value recv = nullptr;
4163 if (has_receiver) {
4164 assert(!callee->is_static(), "callee must not be static");
4165 assert(callee->arg_size() > 0, "must have at least a receiver");
4166
4167 recv = state()->stack_at(args_base);
4168 if (recv->is_null_obj()) {
4169 INLINE_BAILOUT("receiver is always null");
4170 }
4171 }
4172
4173 // now perform tests that are based on flag settings
4174 bool inlinee_by_directive = compilation()->directive()->should_inline(callee);
4175 if (callee->force_inline() || inlinee_by_directive) {
4176 if (inline_level() > MaxForceInlineLevel ) INLINE_BAILOUT("MaxForceInlineLevel");
4177 if (recursive_inline_level(callee) > C1MaxRecursiveInlineLevel) INLINE_BAILOUT("recursive inlining too deep");
4178
4179 const char* msg = "";
4180 if (callee->force_inline()) msg = "force inline by annotation";
4181 if (inlinee_by_directive) msg = "force inline by CompileCommand";
4182 print_inlining(callee, msg);
4183 } else {
4184 // use heuristic controls on inlining
4185 if (inline_level() > C1MaxInlineLevel ) INLINE_BAILOUT("inlining too deep");
4186 int callee_recursive_level = recursive_inline_level(callee);
4187 if (callee_recursive_level > C1MaxRecursiveInlineLevel ) INLINE_BAILOUT("recursive inlining too deep");
4188 if (callee->code_size_for_inlining() > max_inline_size() ) INLINE_BAILOUT("callee is too large");
4189 // Additional condition to limit stack usage for non-recursive calls.
4190 if ((callee_recursive_level == 0) &&
4191 (callee->max_stack() + callee->max_locals() - callee->size_of_parameters() > C1InlineStackLimit)) {
4192 INLINE_BAILOUT("callee uses too much stack");
4193 }
4194
4195 // don't inline throwable methods unless the inlining tree is rooted in a throwable class
4196 if (callee->name() == ciSymbols::object_initializer_name() &&
4197 callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
4198 // Throwable constructor call
4199 IRScope* top = scope();
4200 while (top->caller() != nullptr) {
4201 top = top->caller();
4202 }
4203 if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
4204 INLINE_BAILOUT("don't inline Throwable constructors");
4205 }
4206 }
4207
4208 if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) {
4209 INLINE_BAILOUT("total inlining greater than DesiredMethodLimit");
4210 }
4211 // printing
4212 print_inlining(callee, "inline", /*success*/ true);
4213 }
4214
4215 assert(bc != Bytecodes::_invokestatic || callee->holder()->is_initialized(), "required");
4216
4217 // NOTE: Bailouts from this point on, which occur at the
4218 // GraphBuilder level, do not cause bailout just of the inlining but
4219 // in fact of the entire compilation.
4220
4221 BlockBegin* orig_block = block();
4222
4223 // Insert null check if necessary
4224 if (has_receiver) {
4225 // note: null check must happen even if first instruction of callee does
4226 // an implicit null check since the callee is in a different scope
4227 // and we must make sure exception handling does the right thing
4228 null_check(recv);
4229 }
4230
4231 if (is_profiling()) {
4232 // Note that we'd collect profile data in this method if we wanted it.
4233 // this may be redundant here...
4234 compilation()->set_would_profile(true);
4235
4236 if (profile_calls()) {
4237 int start = 0;
4238 Values* obj_args = args_list_for_profiling(callee, start, has_receiver);
4239 if (obj_args != nullptr) {
4240 int s = obj_args->capacity();
4241 // if called through method handle invoke, some arguments may have been popped
4242 for (int i = args_base+start, j = 0; j < obj_args->capacity() && i < state()->stack_size(); ) {
4243 Value v = state()->stack_at_inc(i);
4244 if (v->type()->is_object_kind()) {
4245 obj_args->push(v);
4246 j++;
4247 }
4248 }
4249 check_args_for_profiling(obj_args, s);
4250 }
4251 profile_call(callee, recv, holder_known ? callee->holder() : nullptr, obj_args, true);
4252 }
4253 }
4254
4255 // Introduce a new callee continuation point - if the callee has
4256 // more than one return instruction or the return does not allow
4257 // fall-through of control flow, all return instructions of the
4258 // callee will need to be replaced by Goto's pointing to this
4259 // continuation point.
4260 BlockBegin* cont = block_at(next_bci());
4261 bool continuation_existed = true;
4262 if (cont == nullptr) {
4263 cont = new BlockBegin(next_bci());
4264 // low number so that continuation gets parsed as early as possible
4265 cont->set_depth_first_number(0);
4266 if (PrintInitialBlockList) {
4267 tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d",
4268 cont->block_id(), cont->bci(), bci());
4269 }
4270 continuation_existed = false;
4271 }
4272 // Record number of predecessors of continuation block before
4273 // inlining, to detect if inlined method has edges to its
4274 // continuation after inlining.
4275 int continuation_preds = cont->number_of_preds();
4276
4277 // Push callee scope
4278 push_scope(callee, cont);
4279
4280 // the BlockListBuilder for the callee could have bailed out
4281 if (bailed_out())
4282 return false;
4283
4284 // Temporarily set up bytecode stream so we can append instructions
4285 // (only using the bci of this stream)
4286 scope_data()->set_stream(scope_data()->parent()->stream());
4287
4288 // Pass parameters into callee state: add assignments
4289 // note: this will also ensure that all arguments are computed before being passed
4290 ValueStack* callee_state = state();
4291 ValueStack* caller_state = state()->caller_state();
4292 for (int i = args_base; i < caller_state->stack_size(); ) {
4293 const int arg_no = i - args_base;
4294 Value arg = caller_state->stack_at_inc(i);
4295 store_local(callee_state, arg, arg_no);
4296 }
4297
4298 // Remove args from stack.
4299 // Note that we preserve locals state in case we can use it later
4300 // (see use of pop_scope() below)
4301 caller_state->truncate_stack(args_base);
4302 assert(callee_state->stack_size() == 0, "callee stack must be empty");
4303
4304 Value lock = nullptr;
4305 BlockBegin* sync_handler = nullptr;
4306
4307 // Inline the locking of the receiver if the callee is synchronized
4308 if (callee->is_synchronized()) {
4309 lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror())))
4310 : state()->local_at(0);
4311 sync_handler = new BlockBegin(SynchronizationEntryBCI);
4312 inline_sync_entry(lock, sync_handler);
4313 }
4314
4315 if (compilation()->env()->dtrace_method_probes()) {
4316 Values* args = new Values(1);
4317 args->push(append(new Constant(new MethodConstant(method()))));
4318 append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args));
4319 }
4320
4321 if (profile_inlined_calls()) {
4322 profile_invocation(callee, copy_state_before_with_bci(SynchronizationEntryBCI));
4323 }
4324
4325 BlockBegin* callee_start_block = block_at(0);
4326 if (callee_start_block != nullptr) {
4327 assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header");
4328 Goto* goto_callee = new Goto(callee_start_block, false);
4329 // The state for this goto is in the scope of the callee, so use
4330 // the entry bci for the callee instead of the call site bci.
4331 append_with_bci(goto_callee, 0);
4332 _block->set_end(goto_callee);
4333 callee_start_block->merge(callee_state, compilation()->has_irreducible_loops());
4334
4335 _last = _block = callee_start_block;
4336
4337 scope_data()->add_to_work_list(callee_start_block);
4338 }
4339
4340 // Clear out bytecode stream
4341 scope_data()->set_stream(nullptr);
4342 scope_data()->set_ignore_return(ignore_return);
4343
4344 CompileLog* log = compilation()->log();
4345 if (log != nullptr) log->head("parse method='%d'", log->identify(callee));
4346
4347 // Ready to resume parsing in callee (either in the same block we
4348 // were in before or in the callee's start block)
4349 iterate_all_blocks(callee_start_block == nullptr);
4350
4351 if (log != nullptr) log->done("parse");
4352
4353 // If we bailed out during parsing, return immediately (this is bad news)
4354 if (bailed_out())
4355 return false;
4356
4357 // iterate_all_blocks theoretically traverses in random order; in
4358 // practice, we have only traversed the continuation if we are
4359 // inlining into a subroutine
4360 assert(continuation_existed ||
4361 !continuation()->is_set(BlockBegin::was_visited_flag),
4362 "continuation should not have been parsed yet if we created it");
4363
4364 // At this point we are almost ready to return and resume parsing of
4365 // the caller back in the GraphBuilder. The only thing we want to do
4366 // first is an optimization: during parsing of the callee we
4367 // generated at least one Goto to the continuation block. If we
4368 // generated exactly one, and if the inlined method spanned exactly
4369 // one block (and we didn't have to Goto its entry), then we snip
4370 // off the Goto to the continuation, allowing control to fall
4371 // through back into the caller block and effectively performing
4372 // block merging. This allows load elimination and CSE to take place
4373 // across multiple callee scopes if they are relatively simple, and
4374 // is currently essential to making inlining profitable.
4375 if (num_returns() == 1
4376 && block() == orig_block
4377 && block() == inline_cleanup_block()) {
4378 _last = inline_cleanup_return_prev();
4379 _state = inline_cleanup_state();
4380 } else if (continuation_preds == cont->number_of_preds()) {
4381 // Inlining caused that the instructions after the invoke in the
4382 // caller are not reachable any more. So skip filling this block
4383 // with instructions!
4384 assert(cont == continuation(), "");
4385 assert(_last && _last->as_BlockEnd(), "");
4386 _skip_block = true;
4387 } else {
4388 // Resume parsing in continuation block unless it was already parsed.
4389 // Note that if we don't change _last here, iteration in
4390 // iterate_bytecodes_for_block will stop when we return.
4391 if (!continuation()->is_set(BlockBegin::was_visited_flag)) {
4392 // add continuation to work list instead of parsing it immediately
4393 assert(_last && _last->as_BlockEnd(), "");
4394 scope_data()->parent()->add_to_work_list(continuation());
4395 _skip_block = true;
4396 }
4397 }
4398
4399 // Fill the exception handler for synchronized methods with instructions
4400 if (callee->is_synchronized() && sync_handler->state() != nullptr) {
4401 fill_sync_handler(lock, sync_handler);
4402 } else {
4403 pop_scope();
4404 }
4405
4406 compilation()->notice_inlined_method(callee);
4407
4408 return true;
4409 }
4410
4411
4412 bool GraphBuilder::try_method_handle_inline(ciMethod* callee, bool ignore_return) {
4413 ValueStack* state_before = copy_state_before();
4414 vmIntrinsics::ID iid = callee->intrinsic_id();
4415 switch (iid) {
4416 case vmIntrinsics::_invokeBasic:
4417 {
4418 // get MethodHandle receiver
4419 const int args_base = state()->stack_size() - callee->arg_size();
4420 ValueType* type = state()->stack_at(args_base)->type();
4421 if (type->is_constant()) {
4422 ciObject* mh = type->as_ObjectType()->constant_value();
4423 if (mh->is_method_handle()) {
4424 ciMethod* target = mh->as_method_handle()->get_vmtarget();
4425
4426 // We don't do CHA here so only inline static and statically bindable methods.
4427 if (target->is_static() || target->can_be_statically_bound()) {
4428 if (ciMethod::is_consistent_info(callee, target)) {
4429 Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4430 ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4431 if (try_inline(target, /*holder_known*/ !callee->is_static(), ignore_return, bc)) {
4432 return true;
4433 }
4434 } else {
4435 print_inlining(target, "signatures mismatch", /*success*/ false);
4436 }
4437 } else {
4438 assert(false, "no inlining through MH::invokeBasic"); // missing optimization opportunity due to suboptimal LF shape
4439 print_inlining(target, "not static or statically bindable", /*success*/ false);
4440 }
4441 } else {
4442 assert(mh->is_null_object(), "not a null");
4443 print_inlining(callee, "receiver is always null", /*success*/ false);
4444 }
4445 } else {
4446 print_inlining(callee, "receiver not constant", /*success*/ false);
4447 }
4448 }
4449 break;
4450
4451 case vmIntrinsics::_linkToVirtual:
4452 case vmIntrinsics::_linkToStatic:
4453 case vmIntrinsics::_linkToSpecial:
4454 case vmIntrinsics::_linkToInterface:
4455 {
4456 // pop MemberName argument
4457 const int args_base = state()->stack_size() - callee->arg_size();
4458 ValueType* type = apop()->type();
4459 if (type->is_constant()) {
4460 ciMethod* target = type->as_ObjectType()->constant_value()->as_member_name()->get_vmtarget();
4461 ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4462 // If the target is another method handle invoke, try to recursively get
4463 // a better target.
4464 if (target->is_method_handle_intrinsic()) {
4465 if (try_method_handle_inline(target, ignore_return)) {
4466 return true;
4467 }
4468 } else if (!ciMethod::is_consistent_info(callee, target)) {
4469 print_inlining(target, "signatures mismatch", /*success*/ false);
4470 } else {
4471 ciSignature* signature = target->signature();
4472 const int receiver_skip = target->is_static() ? 0 : 1;
4473 // Cast receiver to its type.
4474 if (!target->is_static()) {
4475 ciKlass* tk = signature->accessing_klass();
4476 Value obj = state()->stack_at(args_base);
4477 if (obj->exact_type() == nullptr &&
4478 obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4479 TypeCast* c = new TypeCast(tk, obj, state_before);
4480 append(c);
4481 state()->stack_at_put(args_base, c);
4482 }
4483 }
4484 // Cast reference arguments to its type.
4485 for (int i = 0, j = 0; i < signature->count(); i++) {
4486 ciType* t = signature->type_at(i);
4487 if (t->is_klass()) {
4488 ciKlass* tk = t->as_klass();
4489 Value obj = state()->stack_at(args_base + receiver_skip + j);
4490 if (obj->exact_type() == nullptr &&
4491 obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {
4492 TypeCast* c = new TypeCast(t, obj, state_before);
4493 append(c);
4494 state()->stack_at_put(args_base + receiver_skip + j, c);
4495 }
4496 }
4497 j += t->size(); // long and double take two slots
4498 }
4499 // We don't do CHA here so only inline static and statically bindable methods.
4500 if (target->is_static() || target->can_be_statically_bound()) {
4501 Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4502 if (try_inline(target, /*holder_known*/ !callee->is_static(), ignore_return, bc)) {
4503 return true;
4504 }
4505 } else {
4506 print_inlining(target, "not static or statically bindable", /*success*/ false);
4507 }
4508 }
4509 } else {
4510 print_inlining(callee, "MemberName not constant", /*success*/ false);
4511 }
4512 }
4513 break;
4514
4515 case vmIntrinsics::_linkToNative:
4516 print_inlining(callee, "native call", /*success*/ false);
4517 break;
4518
4519 default:
4520 fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
4521 break;
4522 }
4523 set_state(state_before->copy_for_parsing());
4524 return false;
4525 }
4526
4527
4528 void GraphBuilder::inline_bailout(const char* msg) {
4529 assert(msg != nullptr, "inline bailout msg must exist");
4530 _inline_bailout_msg = msg;
4531 }
4532
4533
4534 void GraphBuilder::clear_inline_bailout() {
4535 _inline_bailout_msg = nullptr;
4536 }
4537
4538
4539 void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) {
4540 ScopeData* data = new ScopeData(nullptr);
4541 data->set_scope(scope);
4542 data->set_bci2block(bci2block);
4543 _scope_data = data;
4544 _block = start;
4545 }
4546
4547
4548 void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) {
4549 IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false);
4550 scope()->add_callee(callee_scope);
4551
4552 BlockListBuilder blb(compilation(), callee_scope, -1);
4553 CHECK_BAILOUT();
4554
4555 if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) {
4556 // this scope can be inlined directly into the caller so remove
4557 // the block at bci 0.
4558 blb.bci2block()->at_put(0, nullptr);
4559 }
4560
4561 set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci())));
4562
4563 ScopeData* data = new ScopeData(scope_data());
4564 data->set_scope(callee_scope);
4565 data->set_bci2block(blb.bci2block());
4566 data->set_continuation(continuation);
4567 _scope_data = data;
4568 }
4569
4570
4571 void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) {
4572 ScopeData* data = new ScopeData(scope_data());
4573 data->set_parsing_jsr();
4574 data->set_jsr_entry_bci(jsr_dest_bci);
4575 data->set_jsr_return_address_local(-1);
4576 // Must clone bci2block list as we will be mutating it in order to
4577 // properly clone all blocks in jsr region as well as exception
4578 // handlers containing rets
4579 BlockList* new_bci2block = new BlockList(bci2block()->length());
4580 new_bci2block->appendAll(bci2block());
4581 data->set_bci2block(new_bci2block);
4582 data->set_scope(scope());
4583 data->setup_jsr_xhandlers();
4584 data->set_continuation(continuation());
4585 data->set_jsr_continuation(jsr_continuation);
4586 _scope_data = data;
4587 }
4588
4589
4590 void GraphBuilder::pop_scope() {
4591 int number_of_locks = scope()->number_of_locks();
4592 _scope_data = scope_data()->parent();
4593 // accumulate minimum number of monitor slots to be reserved
4594 scope()->set_min_number_of_locks(number_of_locks);
4595 }
4596
4597
4598 void GraphBuilder::pop_scope_for_jsr() {
4599 _scope_data = scope_data()->parent();
4600 }
4601
4602 void GraphBuilder::append_unsafe_get(ciMethod* callee, BasicType t, bool is_volatile) {
4603 Values* args = state()->pop_arguments(callee->arg_size());
4604 null_check(args->at(0));
4605 Instruction* offset = args->at(2);
4606 #ifndef _LP64
4607 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4608 #endif
4609 Instruction* op = append(new UnsafeGet(t, args->at(1), offset, is_volatile));
4610 push(op->type(), op);
4611 compilation()->set_has_unsafe_access(true);
4612 }
4613
4614
4615 void GraphBuilder::append_unsafe_put(ciMethod* callee, BasicType t, bool is_volatile) {
4616 Values* args = state()->pop_arguments(callee->arg_size());
4617 null_check(args->at(0));
4618 Instruction* offset = args->at(2);
4619 #ifndef _LP64
4620 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4621 #endif
4622 Value val = args->at(3);
4623 if (t == T_BOOLEAN) {
4624 Value mask = append(new Constant(new IntConstant(1)));
4625 val = append(new LogicOp(Bytecodes::_iand, val, mask));
4626 }
4627 Instruction* op = append(new UnsafePut(t, args->at(1), offset, val, is_volatile));
4628 compilation()->set_has_unsafe_access(true);
4629 kill_all();
4630 }
4631
4632 void GraphBuilder::append_unsafe_CAS(ciMethod* callee) {
4633 ValueStack* state_before = copy_state_for_exception();
4634 ValueType* result_type = as_ValueType(callee->return_type());
4635 assert(result_type->is_int(), "int result");
4636 Values* args = state()->pop_arguments(callee->arg_size());
4637
4638 // Pop off some args to specially handle, then push back
4639 Value newval = args->pop();
4640 Value cmpval = args->pop();
4641 Value offset = args->pop();
4642 Value src = args->pop();
4643 Value unsafe_obj = args->pop();
4644
4645 // Separately handle the unsafe arg. It is not needed for code
4646 // generation, but must be null checked
4647 null_check(unsafe_obj);
4648
4649 #ifndef _LP64
4650 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4651 #endif
4652
4653 args->push(src);
4654 args->push(offset);
4655 args->push(cmpval);
4656 args->push(newval);
4657
4658 // An unsafe CAS can alias with other field accesses, but we don't
4659 // know which ones so mark the state as no preserved. This will
4660 // cause CSE to invalidate memory across it.
4661 bool preserves_state = false;
4662 Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state);
4663 append_split(result);
4664 push(result_type, result);
4665 compilation()->set_has_unsafe_access(true);
4666 }
4667
4668 void GraphBuilder::append_char_access(ciMethod* callee, bool is_store) {
4669 // This intrinsic accesses byte[] array as char[] array. Computing the offsets
4670 // correctly requires matched array shapes.
4671 assert (arrayOopDesc::base_offset_in_bytes(T_CHAR) == arrayOopDesc::base_offset_in_bytes(T_BYTE),
4672 "sanity: byte[] and char[] bases agree");
4673 assert (type2aelembytes(T_CHAR) == type2aelembytes(T_BYTE)*2,
4674 "sanity: byte[] and char[] scales agree");
4675
4676 ValueStack* state_before = copy_state_indexed_access();
4677 compilation()->set_has_access_indexed(true);
4678 Values* args = state()->pop_arguments(callee->arg_size());
4679 Value array = args->at(0);
4680 Value index = args->at(1);
4681 if (is_store) {
4682 Value value = args->at(2);
4683 Instruction* store = append(new StoreIndexed(array, index, nullptr, T_CHAR, value, state_before, false, true));
4684 store->set_flag(Instruction::NeedsRangeCheckFlag, false);
4685 _memory->store_value(value);
4686 } else {
4687 Instruction* load = append(new LoadIndexed(array, index, nullptr, T_CHAR, state_before, true));
4688 load->set_flag(Instruction::NeedsRangeCheckFlag, false);
4689 push(load->type(), load);
4690 }
4691 }
4692
4693 void GraphBuilder::append_alloc_array_copy(ciMethod* callee) {
4694 const int args_base = state()->stack_size() - callee->arg_size();
4695 ciType* receiver_type = state()->stack_at(args_base)->exact_type();
4696 if (receiver_type == nullptr) {
4697 inline_bailout("must have a receiver");
4698 return;
4699 }
4700 if (!receiver_type->is_type_array_klass()) {
4701 inline_bailout("clone array not primitive");
4702 return;
4703 }
4704
4705 ValueStack* state_before = copy_state_before();
4706 state_before->set_force_reexecute();
4707 Value src = apop();
4708 BasicType basic_type = src->exact_type()->as_array_klass()->element_type()->basic_type();
4709 Value length = append(new ArrayLength(src, state_before));
4710 Value new_array = append_split(new NewTypeArray(length, basic_type, state_before, false));
4711
4712 ValueType* result_type = as_ValueType(callee->return_type());
4713 vmIntrinsics::ID id = vmIntrinsics::_arraycopy;
4714 Values* args = new Values(5);
4715 args->push(src);
4716 args->push(append(new Constant(new IntConstant(0))));
4717 args->push(new_array);
4718 args->push(append(new Constant(new IntConstant(0))));
4719 args->push(length);
4720 const bool has_receiver = true;
4721 Intrinsic* array_copy = new Intrinsic(result_type, id,
4722 args, has_receiver, state_before,
4723 vmIntrinsics::preserves_state(id),
4724 vmIntrinsics::can_trap(id));
4725 array_copy->set_flag(Instruction::OmitChecksFlag, true);
4726 append_split(array_copy);
4727 apush(new_array);
4728 append(new MemBar(lir_membar_storestore));
4729 }
4730
4731 void GraphBuilder::print_inlining(ciMethod* callee, const char* msg, bool success) {
4732 CompileLog* log = compilation()->log();
4733 if (log != nullptr) {
4734 assert(msg != nullptr, "inlining msg should not be null!");
4735 if (success) {
4736 log->inline_success(msg);
4737 } else {
4738 log->inline_fail(msg);
4739 }
4740 }
4741 EventCompilerInlining event;
4742 if (event.should_commit()) {
4743 CompilerEvent::InlineEvent::post(event, compilation()->env()->task()->compile_id(), method()->get_Method(), callee, success, msg, bci());
4744 }
4745
4746 CompileTask::print_inlining_ul(callee, scope()->level(), bci(), inlining_result_of(success), msg);
4747
4748 if (!compilation()->directive()->PrintInliningOption) {
4749 return;
4750 }
4751 CompileTask::print_inlining_tty(callee, scope()->level(), bci(), inlining_result_of(success), msg);
4752 if (success && CIPrintMethodCodes) {
4753 callee->print_codes();
4754 }
4755 }
4756
4757 void GraphBuilder::append_unsafe_get_and_set(ciMethod* callee, bool is_add) {
4758 Values* args = state()->pop_arguments(callee->arg_size());
4759 BasicType t = callee->return_type()->basic_type();
4760 null_check(args->at(0));
4761 Instruction* offset = args->at(2);
4762 #ifndef _LP64
4763 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4764 #endif
4765 Instruction* op = append(new UnsafeGetAndSet(t, args->at(1), offset, args->at(3), is_add));
4766 compilation()->set_has_unsafe_access(true);
4767 kill_all();
4768 push(op->type(), op);
4769 }
4770
4771 #ifndef PRODUCT
4772 void GraphBuilder::print_stats() {
4773 if (UseLocalValueNumbering) {
4774 vmap()->print();
4775 }
4776 }
4777 #endif // PRODUCT
4778
4779 void GraphBuilder::profile_call(ciMethod* callee, Value recv, ciKlass* known_holder, Values* obj_args, bool inlined) {
4780 assert(known_holder == nullptr || (known_holder->is_instance_klass() &&
4781 (!known_holder->is_interface() ||
4782 ((ciInstanceKlass*)known_holder)->has_nonstatic_concrete_methods())), "should be non-static concrete method");
4783 if (known_holder != nullptr) {
4784 if (known_holder->exact_klass() == nullptr) {
4785 known_holder = compilation()->cha_exact_type(known_holder);
4786 }
4787 }
4788
4789 append(new ProfileCall(method(), bci(), callee, recv, known_holder, obj_args, inlined));
4790 }
4791
4792 void GraphBuilder::profile_return_type(Value ret, ciMethod* callee, ciMethod* m, int invoke_bci) {
4793 assert((m == nullptr) == (invoke_bci < 0), "invalid method and invalid bci together");
4794 if (m == nullptr) {
4795 m = method();
4796 }
4797 if (invoke_bci < 0) {
4798 invoke_bci = bci();
4799 }
4800 ciMethodData* md = m->method_data_or_null();
4801 ciProfileData* data = md->bci_to_data(invoke_bci);
4802 if (data != nullptr && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
4803 bool has_return = data->is_CallTypeData() ? ((ciCallTypeData*)data)->has_return() : ((ciVirtualCallTypeData*)data)->has_return();
4804 if (has_return) {
4805 append(new ProfileReturnType(m , invoke_bci, callee, ret));
4806 }
4807 }
4808 }
4809
4810 void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) {
4811 append(new ProfileInvoke(callee, state));
4812 }