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