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