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