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