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