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