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