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