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