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