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