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