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