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