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