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