Wed, 01 Feb 2012 10:36:58 +0100
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
Summary: too optimistic inlining decision confuses local value numbering.
Reviewed-by: never
1 /*
2 * Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #include "precompiled.hpp"
26 #include "c1/c1_CFGPrinter.hpp"
27 #include "c1/c1_Canonicalizer.hpp"
28 #include "c1/c1_Compilation.hpp"
29 #include "c1/c1_GraphBuilder.hpp"
30 #include "c1/c1_InstructionPrinter.hpp"
31 #include "ci/ciCallSite.hpp"
32 #include "ci/ciField.hpp"
33 #include "ci/ciKlass.hpp"
34 #include "ci/ciMethodHandle.hpp"
35 #include "compiler/compileBroker.hpp"
36 #include "interpreter/bytecode.hpp"
37 #include "runtime/sharedRuntime.hpp"
38 #include "runtime/compilationPolicy.hpp"
39 #include "utilities/bitMap.inline.hpp"
41 class BlockListBuilder VALUE_OBJ_CLASS_SPEC {
42 private:
43 Compilation* _compilation;
44 IRScope* _scope;
46 BlockList _blocks; // internal list of all blocks
47 BlockList* _bci2block; // mapping from bci to blocks for GraphBuilder
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
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(); }
62 // unified bailout support
63 void bailout(const char* msg) const { compilation()->bailout(msg); }
64 bool bailed_out() const { return compilation()->bailed_out(); }
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();
75 void make_loop_header(BlockBegin* block);
76 void mark_loops();
77 int mark_loops(BlockBegin* b, bool in_subroutine);
79 // debugging
80 #ifndef PRODUCT
81 void print();
82 #endif
84 public:
85 // creation
86 BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci);
88 // accessors for GraphBuilder
89 BlockList* bci2block() const { return _bci2block; }
90 };
93 // Implementation of BlockListBuilder
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();
110 mark_loops();
111 NOT_PRODUCT(if (PrintInitialBlockList) print());
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 }
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 }
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 }
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");
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);
157 assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist");
158 }
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 }
165 predecessor->add_successor(block);
166 block->increment_total_preds();
167 }
169 return block;
170 }
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 }
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();
187 for (int i = 0; i < n; i++) {
188 XHandler* h = list->handler_at(i);
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");
195 // add each exception handler only once
196 if (!current->is_successor(entry)) {
197 current->add_successor(entry);
198 entry->increment_total_preds();
199 }
201 // stop when reaching catchall
202 if (h->catch_type() == 0) break;
203 }
204 }
205 }
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);
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 }
219 void BlockListBuilder::set_leaders() {
220 bool has_xhandlers = xhandlers()->has_handlers();
221 BlockBegin* current = NULL;
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();
229 ciBytecodeStream s(method());
230 while (s.next() != ciBytecodeStream::EOBC()) {
231 int cur_bci = s.cur_bci();
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");
238 if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) {
239 handle_exceptions(current, cur_bci);
240 }
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;
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;
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;
304 case Bytecodes::_goto:
305 make_block_at(s.get_dest(), current);
306 current = NULL;
307 break;
309 case Bytecodes::_goto_w:
310 make_block_at(s.get_far_dest(), current);
311 current = NULL;
312 break;
314 case Bytecodes::_jsr:
315 handle_jsr(current, s.get_dest(), s.next_bci());
316 current = NULL;
317 break;
319 case Bytecodes::_jsr_w:
320 handle_jsr(current, s.get_far_dest(), s.next_bci());
321 current = NULL;
322 break;
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 }
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 }
352 void BlockListBuilder::mark_loops() {
353 ResourceMark rm;
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();
361 // recursively iterate the control flow graph
362 mark_loops(_bci2block->at(0), false);
363 assert(_next_block_number >= 0, "invalid block numbers");
364 }
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);
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 }
385 int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) {
386 int block_id = block->block_id();
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 }
397 if (block->is_set(BlockBegin::subroutine_entry_flag)) {
398 in_subroutine = true;
399 }
401 // set active and visited bits before successors are processed
402 _visited.set_bit(block_id);
403 _active.set_bit(block_id);
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 }
411 // clear active-bit after all successors are processed
412 _active.clear_bit(block_id);
414 // reverse-post-order numbering of all blocks
415 block->set_depth_first_number(_next_block_number);
416 _next_block_number--;
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 }
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");
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 }
435 // cache and return loop information for this block
436 _loop_map.at_put(block_id, loop_state);
437 return loop_state;
438 }
441 #ifndef PRODUCT
443 int compare_depth_first(BlockBegin** a, BlockBegin** b) {
444 return (*a)->depth_first_number() - (*b)->depth_first_number();
445 }
447 void BlockListBuilder::print() {
448 tty->print("----- initial block list of BlockListBuilder for method ");
449 method()->print_short_name();
450 tty->cr();
452 // better readability if blocks are sorted in processing order
453 _blocks.sort(compare_depth_first);
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());
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" : " ");
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 }
476 #endif
479 // A simple growable array of Values indexed by ciFields
480 class FieldBuffer: public CompilationResourceObj {
481 private:
482 GrowableArray<Value> _values;
484 public:
485 FieldBuffer() {}
487 void kill() {
488 _values.trunc_to(0);
489 }
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 }
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 }
507 };
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.
525 class MemoryBuffer: public CompilationResourceObj {
526 private:
527 FieldBuffer _values;
528 GrowableArray<Value> _objects;
529 GrowableArray<Value> _newobjects;
530 GrowableArray<FieldBuffer*> _fields;
532 public:
533 MemoryBuffer() {}
535 StoreField* store(StoreField* st) {
536 if (!EliminateFieldAccess) {
537 return st;
538 }
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 }
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 }
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 }
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 }
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 }
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 }
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 }
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 }
654 void kill() {
655 _newobjects.trunc_to(0);
656 _objects.trunc_to(0);
657 _values.kill();
658 }
659 };
662 // Implementation of GraphBuilder's ScopeData
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 }
691 void GraphBuilder::kill_all() {
692 if (UseLocalValueNumbering) {
693 vmap()->kill_all();
694 }
695 _memory->kill();
696 }
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);
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);
728 bci2block()->at_put(bci, new_block);
729 block = new_block;
730 }
731 return block;
732 } else {
733 return bci2block()->at(bci);
734 }
735 }
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 }
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 }
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 }
767 void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) {
768 if (_work_list == NULL) {
769 _work_list = new BlockList();
770 }
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);
787 sort_top_into_worklist(_work_list, block);
788 }
789 }
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 }
811 BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() {
812 if (is_work_list_empty()) {
813 return NULL;
814 }
815 return _work_list->pop();
816 }
819 bool GraphBuilder::ScopeData::is_work_list_empty() const {
820 return (_work_list == NULL || _work_list->length() == 0);
821 }
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 }
843 int GraphBuilder::ScopeData::num_returns() {
844 if (parsing_jsr()) {
845 return parent()->num_returns();
846 }
847 return _num_returns;
848 }
851 void GraphBuilder::ScopeData::incr_num_returns() {
852 if (parsing_jsr()) {
853 parent()->incr_num_returns();
854 } else {
855 ++_num_returns;
856 }
857 }
860 // Implementation of GraphBuilder
862 #define INLINE_BAILOUT(msg) { inline_bailout(msg); return false; }
865 void GraphBuilder::load_constant() {
866 ciConstant con = stream()->get_constant();
867 if (con.basic_type() == T_ILLEGAL) {
868 BAILOUT("could not resolve a constant");
869 } else {
870 ValueType* t = illegalType;
871 ValueStack* patch_state = NULL;
872 switch (con.basic_type()) {
873 case T_BOOLEAN: t = new IntConstant (con.as_boolean()); break;
874 case T_BYTE : t = new IntConstant (con.as_byte ()); break;
875 case T_CHAR : t = new IntConstant (con.as_char ()); break;
876 case T_SHORT : t = new IntConstant (con.as_short ()); break;
877 case T_INT : t = new IntConstant (con.as_int ()); break;
878 case T_LONG : t = new LongConstant (con.as_long ()); break;
879 case T_FLOAT : t = new FloatConstant (con.as_float ()); break;
880 case T_DOUBLE : t = new DoubleConstant (con.as_double ()); break;
881 case T_ARRAY : t = new ArrayConstant (con.as_object ()->as_array ()); break;
882 case T_OBJECT :
883 {
884 ciObject* obj = con.as_object();
885 if (!obj->is_loaded()
886 || (PatchALot && obj->klass() != ciEnv::current()->String_klass())) {
887 patch_state = copy_state_before();
888 t = new ObjectConstant(obj);
889 } else {
890 assert(!obj->is_klass(), "must be java_mirror of klass");
891 t = new InstanceConstant(obj->as_instance());
892 }
893 break;
894 }
895 default : ShouldNotReachHere();
896 }
897 Value x;
898 if (patch_state != NULL) {
899 x = new Constant(t, patch_state);
900 } else {
901 x = new Constant(t);
902 }
903 push(t, append(x));
904 }
905 }
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 }
915 void GraphBuilder::store_local(ValueType* type, int index) {
916 Value x = pop(type);
917 store_local(state(), x, type, index);
918 }
921 void GraphBuilder::store_local(ValueStack* state, Value x, ValueType* type, int index) {
922 if (parsing_jsr()) {
923 // We need to do additional tracking of the location of the return
924 // address for jsrs since we don't handle arbitrary jsr/ret
925 // constructs. Here we are figuring out in which circumstances we
926 // need to bail out.
927 if (x->type()->is_address()) {
928 scope_data()->set_jsr_return_address_local(index);
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 }
945 state->store_local(index, round_fp(x));
946 }
949 void GraphBuilder::load_indexed(BasicType type) {
950 ValueStack* state_before = copy_state_for_exception();
951 Value index = ipop();
952 Value array = apop();
953 Value length = NULL;
954 if (CSEArrayLength ||
955 (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
956 (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
957 length = append(new ArrayLength(array, state_before));
958 }
959 push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before)));
960 }
963 void GraphBuilder::store_indexed(BasicType type) {
964 ValueStack* state_before = copy_state_for_exception();
965 Value value = pop(as_ValueType(type));
966 Value index = ipop();
967 Value array = apop();
968 Value length = NULL;
969 if (CSEArrayLength ||
970 (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
971 (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) {
972 length = append(new ArrayLength(array, state_before));
973 }
974 StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before);
975 append(result);
976 _memory->store_value(value);
978 if (type == T_OBJECT && is_profiling()) {
979 // Note that we'd collect profile data in this method if we wanted it.
980 compilation()->set_would_profile(true);
982 if (profile_checkcasts()) {
983 result->set_profiled_method(method());
984 result->set_profiled_bci(bci());
985 result->set_should_profile(true);
986 }
987 }
988 }
991 void GraphBuilder::stack_op(Bytecodes::Code code) {
992 switch (code) {
993 case Bytecodes::_pop:
994 { state()->raw_pop();
995 }
996 break;
997 case Bytecodes::_pop2:
998 { state()->raw_pop();
999 state()->raw_pop();
1000 }
1001 break;
1002 case Bytecodes::_dup:
1003 { Value w = state()->raw_pop();
1004 state()->raw_push(w);
1005 state()->raw_push(w);
1006 }
1007 break;
1008 case Bytecodes::_dup_x1:
1009 { Value w1 = state()->raw_pop();
1010 Value w2 = state()->raw_pop();
1011 state()->raw_push(w1);
1012 state()->raw_push(w2);
1013 state()->raw_push(w1);
1014 }
1015 break;
1016 case Bytecodes::_dup_x2:
1017 { Value w1 = state()->raw_pop();
1018 Value w2 = state()->raw_pop();
1019 Value w3 = state()->raw_pop();
1020 state()->raw_push(w1);
1021 state()->raw_push(w3);
1022 state()->raw_push(w2);
1023 state()->raw_push(w1);
1024 }
1025 break;
1026 case Bytecodes::_dup2:
1027 { Value w1 = state()->raw_pop();
1028 Value w2 = state()->raw_pop();
1029 state()->raw_push(w2);
1030 state()->raw_push(w1);
1031 state()->raw_push(w2);
1032 state()->raw_push(w1);
1033 }
1034 break;
1035 case Bytecodes::_dup2_x1:
1036 { Value w1 = state()->raw_pop();
1037 Value w2 = state()->raw_pop();
1038 Value w3 = state()->raw_pop();
1039 state()->raw_push(w2);
1040 state()->raw_push(w1);
1041 state()->raw_push(w3);
1042 state()->raw_push(w2);
1043 state()->raw_push(w1);
1044 }
1045 break;
1046 case Bytecodes::_dup2_x2:
1047 { Value w1 = state()->raw_pop();
1048 Value w2 = state()->raw_pop();
1049 Value w3 = state()->raw_pop();
1050 Value w4 = state()->raw_pop();
1051 state()->raw_push(w2);
1052 state()->raw_push(w1);
1053 state()->raw_push(w4);
1054 state()->raw_push(w3);
1055 state()->raw_push(w2);
1056 state()->raw_push(w1);
1057 }
1058 break;
1059 case Bytecodes::_swap:
1060 { Value w1 = state()->raw_pop();
1061 Value w2 = state()->raw_pop();
1062 state()->raw_push(w1);
1063 state()->raw_push(w2);
1064 }
1065 break;
1066 default:
1067 ShouldNotReachHere();
1068 break;
1069 }
1070 }
1073 void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) {
1074 Value y = pop(type);
1075 Value x = pop(type);
1076 // NOTE: strictfp can be queried from current method since we don't
1077 // inline methods with differing strictfp bits
1078 Value res = new ArithmeticOp(code, x, y, method()->is_strict(), state_before);
1079 // Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level
1080 res = append(res);
1081 if (method()->is_strict()) {
1082 res = round_fp(res);
1083 }
1084 push(type, res);
1085 }
1088 void GraphBuilder::negate_op(ValueType* type) {
1089 push(type, append(new NegateOp(pop(type))));
1090 }
1093 void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {
1094 Value s = ipop();
1095 Value x = pop(type);
1096 // try to simplify
1097 // Note: This code should go into the canonicalizer as soon as it can
1098 // can handle canonicalized forms that contain more than one node.
1099 if (CanonicalizeNodes && code == Bytecodes::_iushr) {
1100 // pattern: x >>> s
1101 IntConstant* s1 = s->type()->as_IntConstant();
1102 if (s1 != NULL) {
1103 // pattern: x >>> s1, with s1 constant
1104 ShiftOp* l = x->as_ShiftOp();
1105 if (l != NULL && l->op() == Bytecodes::_ishl) {
1106 // pattern: (a << b) >>> s1
1107 IntConstant* s0 = l->y()->type()->as_IntConstant();
1108 if (s0 != NULL) {
1109 // pattern: (a << s0) >>> s1
1110 const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
1111 const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
1112 if (s0c == s1c) {
1113 if (s0c == 0) {
1114 // pattern: (a << 0) >>> 0 => simplify to: a
1115 ipush(l->x());
1116 } else {
1117 // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
1118 assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
1119 const int m = (1 << (BitsPerInt - s0c)) - 1;
1120 Value s = append(new Constant(new IntConstant(m)));
1121 ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
1122 }
1123 return;
1124 }
1125 }
1126 }
1127 }
1128 }
1129 // could not simplify
1130 push(type, append(new ShiftOp(code, x, s)));
1131 }
1134 void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {
1135 Value y = pop(type);
1136 Value x = pop(type);
1137 push(type, append(new LogicOp(code, x, y)));
1138 }
1141 void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {
1142 ValueStack* state_before = copy_state_before();
1143 Value y = pop(type);
1144 Value x = pop(type);
1145 ipush(append(new CompareOp(code, x, y, state_before)));
1146 }
1149 void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {
1150 push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
1151 }
1154 void GraphBuilder::increment() {
1155 int index = stream()->get_index();
1156 int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
1157 load_local(intType, index);
1158 ipush(append(new Constant(new IntConstant(delta))));
1159 arithmetic_op(intType, Bytecodes::_iadd);
1160 store_local(intType, index);
1161 }
1164 void GraphBuilder::_goto(int from_bci, int to_bci) {
1165 Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1166 if (is_profiling()) {
1167 compilation()->set_would_profile(true);
1168 x->set_profiled_bci(bci());
1169 if (profile_branches()) {
1170 x->set_profiled_method(method());
1171 x->set_should_profile(true);
1172 }
1173 }
1174 append(x);
1175 }
1178 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1179 BlockBegin* tsux = block_at(stream()->get_dest());
1180 BlockBegin* fsux = block_at(stream()->next_bci());
1181 bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1182 Instruction *i = append(new If(x, cond, false, y, tsux, fsux, is_bb ? state_before : NULL, is_bb));
1184 if (is_profiling()) {
1185 If* if_node = i->as_If();
1186 if (if_node != NULL) {
1187 // Note that we'd collect profile data in this method if we wanted it.
1188 compilation()->set_would_profile(true);
1189 // At level 2 we need the proper bci to count backedges
1190 if_node->set_profiled_bci(bci());
1191 if (profile_branches()) {
1192 // Successors can be rotated by the canonicalizer, check for this case.
1193 if_node->set_profiled_method(method());
1194 if_node->set_should_profile(true);
1195 if (if_node->tsux() == fsux) {
1196 if_node->set_swapped(true);
1197 }
1198 }
1199 return;
1200 }
1202 // Check if this If was reduced to Goto.
1203 Goto *goto_node = i->as_Goto();
1204 if (goto_node != NULL) {
1205 compilation()->set_would_profile(true);
1206 goto_node->set_profiled_bci(bci());
1207 if (profile_branches()) {
1208 goto_node->set_profiled_method(method());
1209 goto_node->set_should_profile(true);
1210 // Find out which successor is used.
1211 if (goto_node->default_sux() == tsux) {
1212 goto_node->set_direction(Goto::taken);
1213 } else if (goto_node->default_sux() == fsux) {
1214 goto_node->set_direction(Goto::not_taken);
1215 } else {
1216 ShouldNotReachHere();
1217 }
1218 }
1219 return;
1220 }
1221 }
1222 }
1225 void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {
1226 Value y = append(new Constant(intZero));
1227 ValueStack* state_before = copy_state_before();
1228 Value x = ipop();
1229 if_node(x, cond, y, state_before);
1230 }
1233 void GraphBuilder::if_null(ValueType* type, If::Condition cond) {
1234 Value y = append(new Constant(objectNull));
1235 ValueStack* state_before = copy_state_before();
1236 Value x = apop();
1237 if_node(x, cond, y, state_before);
1238 }
1241 void GraphBuilder::if_same(ValueType* type, If::Condition cond) {
1242 ValueStack* state_before = copy_state_before();
1243 Value y = pop(type);
1244 Value x = pop(type);
1245 if_node(x, cond, y, state_before);
1246 }
1249 void GraphBuilder::jsr(int dest) {
1250 // We only handle well-formed jsrs (those which are "block-structured").
1251 // If the bytecodes are strange (jumping out of a jsr block) then we
1252 // might end up trying to re-parse a block containing a jsr which
1253 // has already been activated. Watch for this case and bail out.
1254 for (ScopeData* cur_scope_data = scope_data();
1255 cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1256 cur_scope_data = cur_scope_data->parent()) {
1257 if (cur_scope_data->jsr_entry_bci() == dest) {
1258 BAILOUT("too-complicated jsr/ret structure");
1259 }
1260 }
1262 push(addressType, append(new Constant(new AddressConstant(next_bci()))));
1263 if (!try_inline_jsr(dest)) {
1264 return; // bailed out while parsing and inlining subroutine
1265 }
1266 }
1269 void GraphBuilder::ret(int local_index) {
1270 if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");
1272 if (local_index != scope_data()->jsr_return_address_local()) {
1273 BAILOUT("can not handle complicated jsr/ret constructs");
1274 }
1276 // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
1277 append(new Goto(scope_data()->jsr_continuation(), false));
1278 }
1281 void GraphBuilder::table_switch() {
1282 Bytecode_tableswitch sw(stream());
1283 const int l = sw.length();
1284 if (CanonicalizeNodes && l == 1) {
1285 // total of 2 successors => use If instead of switch
1286 // Note: This code should go into the canonicalizer as soon as it can
1287 // can handle canonicalized forms that contain more than one node.
1288 Value key = append(new Constant(new IntConstant(sw.low_key())));
1289 BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0));
1290 BlockBegin* fsux = block_at(bci() + sw.default_offset());
1291 bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1292 ValueStack* state_before = is_bb ? copy_state_before() : NULL;
1293 append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1294 } else {
1295 // collect successors
1296 BlockList* sux = new BlockList(l + 1, NULL);
1297 int i;
1298 bool has_bb = false;
1299 for (i = 0; i < l; i++) {
1300 sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1301 if (sw.dest_offset_at(i) < 0) has_bb = true;
1302 }
1303 // add default successor
1304 sux->at_put(i, block_at(bci() + sw.default_offset()));
1305 ValueStack* state_before = has_bb ? copy_state_before() : NULL;
1306 append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1307 }
1308 }
1311 void GraphBuilder::lookup_switch() {
1312 Bytecode_lookupswitch sw(stream());
1313 const int l = sw.number_of_pairs();
1314 if (CanonicalizeNodes && l == 1) {
1315 // total of 2 successors => use If instead of switch
1316 // Note: This code should go into the canonicalizer as soon as it can
1317 // can handle canonicalized forms that contain more than one node.
1318 // simplify to If
1319 LookupswitchPair pair = sw.pair_at(0);
1320 Value key = append(new Constant(new IntConstant(pair.match())));
1321 BlockBegin* tsux = block_at(bci() + pair.offset());
1322 BlockBegin* fsux = block_at(bci() + sw.default_offset());
1323 bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1324 ValueStack* state_before = is_bb ? copy_state_before() : NULL;
1325 append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1326 } else {
1327 // collect successors & keys
1328 BlockList* sux = new BlockList(l + 1, NULL);
1329 intArray* keys = new intArray(l, 0);
1330 int i;
1331 bool has_bb = false;
1332 for (i = 0; i < l; i++) {
1333 LookupswitchPair pair = sw.pair_at(i);
1334 if (pair.offset() < 0) has_bb = true;
1335 sux->at_put(i, block_at(bci() + pair.offset()));
1336 keys->at_put(i, pair.match());
1337 }
1338 // add default successor
1339 sux->at_put(i, block_at(bci() + sw.default_offset()));
1340 ValueStack* state_before = has_bb ? copy_state_before() : NULL;
1341 append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
1342 }
1343 }
1345 void GraphBuilder::call_register_finalizer() {
1346 // If the receiver requires finalization then emit code to perform
1347 // the registration on return.
1349 // Gather some type information about the receiver
1350 Value receiver = state()->local_at(0);
1351 assert(receiver != NULL, "must have a receiver");
1352 ciType* declared_type = receiver->declared_type();
1353 ciType* exact_type = receiver->exact_type();
1354 if (exact_type == NULL &&
1355 receiver->as_Local() &&
1356 receiver->as_Local()->java_index() == 0) {
1357 ciInstanceKlass* ik = compilation()->method()->holder();
1358 if (ik->is_final()) {
1359 exact_type = ik;
1360 } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {
1361 // test class is leaf class
1362 compilation()->dependency_recorder()->assert_leaf_type(ik);
1363 exact_type = ik;
1364 } else {
1365 declared_type = ik;
1366 }
1367 }
1369 // see if we know statically that registration isn't required
1370 bool needs_check = true;
1371 if (exact_type != NULL) {
1372 needs_check = exact_type->as_instance_klass()->has_finalizer();
1373 } else if (declared_type != NULL) {
1374 ciInstanceKlass* ik = declared_type->as_instance_klass();
1375 if (!Dependencies::has_finalizable_subclass(ik)) {
1376 compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
1377 needs_check = false;
1378 }
1379 }
1381 if (needs_check) {
1382 // Perform the registration of finalizable objects.
1383 ValueStack* state_before = copy_state_for_exception();
1384 load_local(objectType, 0);
1385 append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1386 state()->pop_arguments(1),
1387 true, state_before, true));
1388 }
1389 }
1392 void GraphBuilder::method_return(Value x) {
1393 if (RegisterFinalizersAtInit &&
1394 method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1395 call_register_finalizer();
1396 }
1398 // Check to see whether we are inlining. If so, Return
1399 // instructions become Gotos to the continuation point.
1400 if (continuation() != NULL) {
1401 assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
1403 if (compilation()->env()->dtrace_method_probes()) {
1404 // Report exit from inline methods
1405 Values* args = new Values(1);
1406 args->push(append(new Constant(new ObjectConstant(method()))));
1407 append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args));
1408 }
1410 // If the inlined method is synchronized, the monitor must be
1411 // released before we jump to the continuation block.
1412 if (method()->is_synchronized()) {
1413 assert(state()->locks_size() == 1, "receiver must be locked here");
1414 monitorexit(state()->lock_at(0), SynchronizationEntryBCI);
1415 }
1417 // State at end of inlined method is the state of the caller
1418 // without the method parameters on stack, including the
1419 // return value, if any, of the inlined method on operand stack.
1420 set_state(state()->caller_state()->copy_for_parsing());
1421 if (x != NULL) {
1422 state()->push(x->type(), x);
1423 }
1424 Goto* goto_callee = new Goto(continuation(), false);
1426 // See whether this is the first return; if so, store off some
1427 // of the state for later examination
1428 if (num_returns() == 0) {
1429 set_inline_cleanup_info();
1430 }
1432 // The current bci() is in the wrong scope, so use the bci() of
1433 // the continuation point.
1434 append_with_bci(goto_callee, scope_data()->continuation()->bci());
1435 incr_num_returns();
1437 return;
1438 }
1440 state()->truncate_stack(0);
1441 if (method()->is_synchronized()) {
1442 // perform the unlocking before exiting the method
1443 Value receiver;
1444 if (!method()->is_static()) {
1445 receiver = _initial_state->local_at(0);
1446 } else {
1447 receiver = append(new Constant(new ClassConstant(method()->holder())));
1448 }
1449 append_split(new MonitorExit(receiver, state()->unlock()));
1450 }
1452 append(new Return(x));
1453 }
1456 void GraphBuilder::access_field(Bytecodes::Code code) {
1457 bool will_link;
1458 ciField* field = stream()->get_field(will_link);
1459 ciInstanceKlass* holder = field->holder();
1460 BasicType field_type = field->type()->basic_type();
1461 ValueType* type = as_ValueType(field_type);
1462 // call will_link again to determine if the field is valid.
1463 const bool needs_patching = !holder->is_loaded() ||
1464 !field->will_link(method()->holder(), code) ||
1465 PatchALot;
1467 ValueStack* state_before = NULL;
1468 if (!holder->is_initialized() || needs_patching) {
1469 // save state before instruction for debug info when
1470 // deoptimization happens during patching
1471 state_before = copy_state_before();
1472 }
1474 Value obj = NULL;
1475 if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1476 if (state_before != NULL) {
1477 // build a patching constant
1478 obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1479 } else {
1480 obj = new Constant(new InstanceConstant(holder->java_mirror()));
1481 }
1482 }
1485 const int offset = !needs_patching ? field->offset() : -1;
1486 switch (code) {
1487 case Bytecodes::_getstatic: {
1488 // check for compile-time constants, i.e., initialized static final fields
1489 Instruction* constant = NULL;
1490 if (field->is_constant() && !PatchALot) {
1491 ciConstant field_val = field->constant_value();
1492 BasicType field_type = field_val.basic_type();
1493 switch (field_type) {
1494 case T_ARRAY:
1495 case T_OBJECT:
1496 if (field_val.as_object()->should_be_constant()) {
1497 constant = new Constant(as_ValueType(field_val));
1498 }
1499 break;
1501 default:
1502 constant = new Constant(as_ValueType(field_val));
1503 }
1504 }
1505 if (constant != NULL) {
1506 push(type, append(constant));
1507 } else {
1508 if (state_before == NULL) {
1509 state_before = copy_state_for_exception();
1510 }
1511 push(type, append(new LoadField(append(obj), offset, field, true,
1512 state_before, needs_patching)));
1513 }
1514 break;
1515 }
1516 case Bytecodes::_putstatic:
1517 { Value val = pop(type);
1518 if (state_before == NULL) {
1519 state_before = copy_state_for_exception();
1520 }
1521 append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1522 }
1523 break;
1524 case Bytecodes::_getfield :
1525 {
1526 if (state_before == NULL) {
1527 state_before = copy_state_for_exception();
1528 }
1529 LoadField* load = new LoadField(apop(), offset, field, false, state_before, needs_patching);
1530 Value replacement = !needs_patching ? _memory->load(load) : load;
1531 if (replacement != load) {
1532 assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1533 push(type, replacement);
1534 } else {
1535 push(type, append(load));
1536 }
1537 break;
1538 }
1540 case Bytecodes::_putfield :
1541 { Value val = pop(type);
1542 if (state_before == NULL) {
1543 state_before = copy_state_for_exception();
1544 }
1545 StoreField* store = new StoreField(apop(), offset, field, val, false, state_before, needs_patching);
1546 if (!needs_patching) store = _memory->store(store);
1547 if (store != NULL) {
1548 append(store);
1549 }
1550 }
1551 break;
1552 default :
1553 ShouldNotReachHere();
1554 break;
1555 }
1556 }
1559 Dependencies* GraphBuilder::dependency_recorder() const {
1560 assert(DeoptC1, "need debug information");
1561 return compilation()->dependency_recorder();
1562 }
1565 void GraphBuilder::invoke(Bytecodes::Code code) {
1566 bool will_link;
1567 ciMethod* target = stream()->get_method(will_link);
1568 // we have to make sure the argument size (incl. the receiver)
1569 // is correct for compilation (the call would fail later during
1570 // linkage anyway) - was bug (gri 7/28/99)
1571 if (target->is_loaded() && target->is_static() != (code == Bytecodes::_invokestatic)) BAILOUT("will cause link error");
1572 ciInstanceKlass* klass = target->holder();
1574 // check if CHA possible: if so, change the code to invoke_special
1575 ciInstanceKlass* calling_klass = method()->holder();
1576 ciKlass* holder = stream()->get_declared_method_holder();
1577 ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
1578 ciInstanceKlass* actual_recv = callee_holder;
1580 // some methods are obviously bindable without any type checks so
1581 // convert them directly to an invokespecial.
1582 if (target->is_loaded() && !target->is_abstract() &&
1583 target->can_be_statically_bound() && code == Bytecodes::_invokevirtual) {
1584 code = Bytecodes::_invokespecial;
1585 }
1587 bool is_invokedynamic = code == Bytecodes::_invokedynamic;
1589 // NEEDS_CLEANUP
1590 // I've added the target-is_loaded() test below but I don't really understand
1591 // how klass->is_loaded() can be true and yet target->is_loaded() is false.
1592 // this happened while running the JCK invokevirtual tests under doit. TKR
1593 ciMethod* cha_monomorphic_target = NULL;
1594 ciMethod* exact_target = NULL;
1595 Value better_receiver = NULL;
1596 if (UseCHA && DeoptC1 && klass->is_loaded() && target->is_loaded() &&
1597 !target->is_method_handle_invoke()) {
1598 Value receiver = NULL;
1599 ciInstanceKlass* receiver_klass = NULL;
1600 bool type_is_exact = false;
1601 // try to find a precise receiver type
1602 if (will_link && !target->is_static()) {
1603 int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1604 receiver = state()->stack_at(index);
1605 ciType* type = receiver->exact_type();
1606 if (type != NULL && type->is_loaded() &&
1607 type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1608 receiver_klass = (ciInstanceKlass*) type;
1609 type_is_exact = true;
1610 }
1611 if (type == NULL) {
1612 type = receiver->declared_type();
1613 if (type != NULL && type->is_loaded() &&
1614 type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {
1615 receiver_klass = (ciInstanceKlass*) type;
1616 if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) {
1617 // Insert a dependency on this type since
1618 // find_monomorphic_target may assume it's already done.
1619 dependency_recorder()->assert_leaf_type(receiver_klass);
1620 type_is_exact = true;
1621 }
1622 }
1623 }
1624 }
1625 if (receiver_klass != NULL && type_is_exact &&
1626 receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) {
1627 // If we have the exact receiver type we can bind directly to
1628 // the method to call.
1629 exact_target = target->resolve_invoke(calling_klass, receiver_klass);
1630 if (exact_target != NULL) {
1631 target = exact_target;
1632 code = Bytecodes::_invokespecial;
1633 }
1634 }
1635 if (receiver_klass != NULL &&
1636 receiver_klass->is_subtype_of(actual_recv) &&
1637 actual_recv->is_initialized()) {
1638 actual_recv = receiver_klass;
1639 }
1641 if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) ||
1642 (code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) {
1643 // Use CHA on the receiver to select a more precise method.
1644 cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
1645 } else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != NULL) {
1646 // if there is only one implementor of this interface then we
1647 // may be able bind this invoke directly to the implementing
1648 // klass but we need both a dependence on the single interface
1649 // and on the method we bind to. Additionally since all we know
1650 // about the receiver type is the it's supposed to implement the
1651 // interface we have to insert a check that it's the class we
1652 // expect. Interface types are not checked by the verifier so
1653 // they are roughly equivalent to Object.
1654 ciInstanceKlass* singleton = NULL;
1655 if (target->holder()->nof_implementors() == 1) {
1656 singleton = target->holder()->implementor(0);
1658 assert(holder->is_interface(), "invokeinterface to non interface?");
1659 ciInstanceKlass* decl_interface = (ciInstanceKlass*)holder;
1660 // the number of implementors for decl_interface is less or
1661 // equal to the number of implementors for target->holder() so
1662 // if number of implementors of target->holder() == 1 then
1663 // number of implementors for decl_interface is 0 or 1. If
1664 // it's 0 then no class implements decl_interface and there's
1665 // no point in inlining.
1666 if (!holder->is_loaded() || decl_interface->nof_implementors() != 1) {
1667 singleton = NULL;
1668 }
1669 }
1670 if (singleton) {
1671 cha_monomorphic_target = target->find_monomorphic_target(calling_klass, target->holder(), singleton);
1672 if (cha_monomorphic_target != NULL) {
1673 // If CHA is able to bind this invoke then update the class
1674 // to match that class, otherwise klass will refer to the
1675 // interface.
1676 klass = cha_monomorphic_target->holder();
1677 actual_recv = target->holder();
1679 // insert a check it's really the expected class.
1680 CheckCast* c = new CheckCast(klass, receiver, copy_state_for_exception());
1681 c->set_incompatible_class_change_check();
1682 c->set_direct_compare(klass->is_final());
1683 // pass the result of the checkcast so that the compiler has
1684 // more accurate type info in the inlinee
1685 better_receiver = append_split(c);
1686 }
1687 }
1688 }
1689 }
1691 if (cha_monomorphic_target != NULL) {
1692 if (cha_monomorphic_target->is_abstract()) {
1693 // Do not optimize for abstract methods
1694 cha_monomorphic_target = NULL;
1695 }
1696 }
1698 if (cha_monomorphic_target != NULL) {
1699 if (!(target->is_final_method())) {
1700 // If we inlined because CHA revealed only a single target method,
1701 // then we are dependent on that target method not getting overridden
1702 // by dynamic class loading. Be sure to test the "static" receiver
1703 // dest_method here, as opposed to the actual receiver, which may
1704 // falsely lead us to believe that the receiver is final or private.
1705 dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target);
1706 }
1707 code = Bytecodes::_invokespecial;
1708 }
1709 // check if we could do inlining
1710 if (!PatchALot && Inline && klass->is_loaded() &&
1711 (klass->is_initialized() || klass->is_interface() && target->holder()->is_initialized())
1712 && target->will_link(klass, callee_holder, code)) {
1713 // callee is known => check if we have static binding
1714 assert(target->is_loaded(), "callee must be known");
1715 if (code == Bytecodes::_invokestatic ||
1716 code == Bytecodes::_invokespecial ||
1717 code == Bytecodes::_invokevirtual && target->is_final_method() ||
1718 code == Bytecodes::_invokedynamic) {
1719 ciMethod* inline_target = (cha_monomorphic_target != NULL) ? cha_monomorphic_target : target;
1720 bool success = false;
1721 if (target->is_method_handle_invoke()) {
1722 // method handle invokes
1723 success = !is_invokedynamic ? for_method_handle_inline(target) : for_invokedynamic_inline(target);
1724 }
1725 if (!success) {
1726 // static binding => check if callee is ok
1727 success = try_inline(inline_target, (cha_monomorphic_target != NULL) || (exact_target != NULL), better_receiver);
1728 }
1729 CHECK_BAILOUT();
1731 #ifndef PRODUCT
1732 // printing
1733 if (PrintInlining && !success) {
1734 // if it was successfully inlined, then it was already printed.
1735 print_inline_result(inline_target, success);
1736 }
1737 #endif
1738 clear_inline_bailout();
1739 if (success) {
1740 // Register dependence if JVMTI has either breakpoint
1741 // setting or hotswapping of methods capabilities since they may
1742 // cause deoptimization.
1743 if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) {
1744 dependency_recorder()->assert_evol_method(inline_target);
1745 }
1746 return;
1747 }
1748 }
1749 }
1750 // If we attempted an inline which did not succeed because of a
1751 // bailout during construction of the callee graph, the entire
1752 // compilation has to be aborted. This is fairly rare and currently
1753 // seems to only occur for jasm-generated classes which contain
1754 // jsr/ret pairs which are not associated with finally clauses and
1755 // do not have exception handlers in the containing method, and are
1756 // therefore not caught early enough to abort the inlining without
1757 // corrupting the graph. (We currently bail out with a non-empty
1758 // stack at a ret in these situations.)
1759 CHECK_BAILOUT();
1761 // inlining not successful => standard invoke
1762 bool is_loaded = target->is_loaded();
1763 bool has_receiver =
1764 code == Bytecodes::_invokespecial ||
1765 code == Bytecodes::_invokevirtual ||
1766 code == Bytecodes::_invokeinterface;
1767 ValueType* result_type = as_ValueType(target->return_type());
1769 // We require the debug info to be the "state before" because
1770 // invokedynamics may deoptimize.
1771 ValueStack* state_before = is_invokedynamic ? copy_state_before() : copy_state_exhandling();
1773 Values* args = state()->pop_arguments(target->arg_size_no_receiver());
1774 Value recv = has_receiver ? apop() : NULL;
1775 int vtable_index = methodOopDesc::invalid_vtable_index;
1777 #ifdef SPARC
1778 // Currently only supported on Sparc.
1779 // The UseInlineCaches only controls dispatch to invokevirtuals for
1780 // loaded classes which we weren't able to statically bind.
1781 if (!UseInlineCaches && is_loaded && code == Bytecodes::_invokevirtual
1782 && !target->can_be_statically_bound()) {
1783 // Find a vtable index if one is available
1784 vtable_index = target->resolve_vtable_index(calling_klass, callee_holder);
1785 }
1786 #endif
1788 if (recv != NULL &&
1789 (code == Bytecodes::_invokespecial ||
1790 !is_loaded || target->is_final())) {
1791 // invokespecial always needs a NULL check. invokevirtual where
1792 // the target is final or where it's not known that whether the
1793 // target is final requires a NULL check. Otherwise normal
1794 // invokevirtual will perform the null check during the lookup
1795 // logic or the unverified entry point. Profiling of calls
1796 // requires that the null check is performed in all cases.
1797 null_check(recv);
1798 }
1800 if (is_profiling()) {
1801 if (recv != NULL && profile_calls()) {
1802 null_check(recv);
1803 }
1804 // Note that we'd collect profile data in this method if we wanted it.
1805 compilation()->set_would_profile(true);
1807 if (profile_calls()) {
1808 assert(cha_monomorphic_target == NULL || exact_target == NULL, "both can not be set");
1809 ciKlass* target_klass = NULL;
1810 if (cha_monomorphic_target != NULL) {
1811 target_klass = cha_monomorphic_target->holder();
1812 } else if (exact_target != NULL) {
1813 target_klass = exact_target->holder();
1814 }
1815 profile_call(recv, target_klass);
1816 }
1817 }
1819 Invoke* result = new Invoke(code, result_type, recv, args, vtable_index, target, state_before);
1820 // push result
1821 append_split(result);
1823 if (result_type != voidType) {
1824 if (method()->is_strict()) {
1825 push(result_type, round_fp(result));
1826 } else {
1827 push(result_type, result);
1828 }
1829 }
1830 }
1833 void GraphBuilder::new_instance(int klass_index) {
1834 ValueStack* state_before = copy_state_exhandling();
1835 bool will_link;
1836 ciKlass* klass = stream()->get_klass(will_link);
1837 assert(klass->is_instance_klass(), "must be an instance klass");
1838 NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before);
1839 _memory->new_instance(new_instance);
1840 apush(append_split(new_instance));
1841 }
1844 void GraphBuilder::new_type_array() {
1845 ValueStack* state_before = copy_state_exhandling();
1846 apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before)));
1847 }
1850 void GraphBuilder::new_object_array() {
1851 bool will_link;
1852 ciKlass* klass = stream()->get_klass(will_link);
1853 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
1854 NewArray* n = new NewObjectArray(klass, ipop(), state_before);
1855 apush(append_split(n));
1856 }
1859 bool GraphBuilder::direct_compare(ciKlass* k) {
1860 if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
1861 ciInstanceKlass* ik = k->as_instance_klass();
1862 if (ik->is_final()) {
1863 return true;
1864 } else {
1865 if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {
1866 // test class is leaf class
1867 dependency_recorder()->assert_leaf_type(ik);
1868 return true;
1869 }
1870 }
1871 }
1872 return false;
1873 }
1876 void GraphBuilder::check_cast(int klass_index) {
1877 bool will_link;
1878 ciKlass* klass = stream()->get_klass(will_link);
1879 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception();
1880 CheckCast* c = new CheckCast(klass, apop(), state_before);
1881 apush(append_split(c));
1882 c->set_direct_compare(direct_compare(klass));
1884 if (is_profiling()) {
1885 // Note that we'd collect profile data in this method if we wanted it.
1886 compilation()->set_would_profile(true);
1888 if (profile_checkcasts()) {
1889 c->set_profiled_method(method());
1890 c->set_profiled_bci(bci());
1891 c->set_should_profile(true);
1892 }
1893 }
1894 }
1897 void GraphBuilder::instance_of(int klass_index) {
1898 bool will_link;
1899 ciKlass* klass = stream()->get_klass(will_link);
1900 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
1901 InstanceOf* i = new InstanceOf(klass, apop(), state_before);
1902 ipush(append_split(i));
1903 i->set_direct_compare(direct_compare(klass));
1905 if (is_profiling()) {
1906 // Note that we'd collect profile data in this method if we wanted it.
1907 compilation()->set_would_profile(true);
1909 if (profile_checkcasts()) {
1910 i->set_profiled_method(method());
1911 i->set_profiled_bci(bci());
1912 i->set_should_profile(true);
1913 }
1914 }
1915 }
1918 void GraphBuilder::monitorenter(Value x, int bci) {
1919 // save state before locking in case of deoptimization after a NullPointerException
1920 ValueStack* state_before = copy_state_for_exception_with_bci(bci);
1921 append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci);
1922 kill_all();
1923 }
1926 void GraphBuilder::monitorexit(Value x, int bci) {
1927 append_with_bci(new MonitorExit(x, state()->unlock()), bci);
1928 kill_all();
1929 }
1932 void GraphBuilder::new_multi_array(int dimensions) {
1933 bool will_link;
1934 ciKlass* klass = stream()->get_klass(will_link);
1935 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
1937 Values* dims = new Values(dimensions, NULL);
1938 // fill in all dimensions
1939 int i = dimensions;
1940 while (i-- > 0) dims->at_put(i, ipop());
1941 // create array
1942 NewArray* n = new NewMultiArray(klass, dims, state_before);
1943 apush(append_split(n));
1944 }
1947 void GraphBuilder::throw_op(int bci) {
1948 // We require that the debug info for a Throw be the "state before"
1949 // the Throw (i.e., exception oop is still on TOS)
1950 ValueStack* state_before = copy_state_before_with_bci(bci);
1951 Throw* t = new Throw(apop(), state_before);
1952 // operand stack not needed after a throw
1953 state()->truncate_stack(0);
1954 append_with_bci(t, bci);
1955 }
1958 Value GraphBuilder::round_fp(Value fp_value) {
1959 // no rounding needed if SSE2 is used
1960 if (RoundFPResults && UseSSE < 2) {
1961 // Must currently insert rounding node for doubleword values that
1962 // are results of expressions (i.e., not loads from memory or
1963 // constants)
1964 if (fp_value->type()->tag() == doubleTag &&
1965 fp_value->as_Constant() == NULL &&
1966 fp_value->as_Local() == NULL && // method parameters need no rounding
1967 fp_value->as_RoundFP() == NULL) {
1968 return append(new RoundFP(fp_value));
1969 }
1970 }
1971 return fp_value;
1972 }
1975 Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) {
1976 Canonicalizer canon(compilation(), instr, bci);
1977 Instruction* i1 = canon.canonical();
1978 if (i1->is_linked() || !i1->can_be_linked()) {
1979 // Canonicalizer returned an instruction which was already
1980 // appended so simply return it.
1981 return i1;
1982 }
1984 if (UseLocalValueNumbering) {
1985 // Lookup the instruction in the ValueMap and add it to the map if
1986 // it's not found.
1987 Instruction* i2 = vmap()->find_insert(i1);
1988 if (i2 != i1) {
1989 // found an entry in the value map, so just return it.
1990 assert(i2->is_linked(), "should already be linked");
1991 return i2;
1992 }
1993 ValueNumberingEffects vne(vmap());
1994 i1->visit(&vne);
1995 }
1997 // i1 was not eliminated => append it
1998 assert(i1->next() == NULL, "shouldn't already be linked");
1999 _last = _last->set_next(i1, canon.bci());
2001 if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) {
2002 // set the bailout state but complete normal processing. We
2003 // might do a little more work before noticing the bailout so we
2004 // want processing to continue normally until it's noticed.
2005 bailout("Method and/or inlining is too large");
2006 }
2008 #ifndef PRODUCT
2009 if (PrintIRDuringConstruction) {
2010 InstructionPrinter ip;
2011 ip.print_line(i1);
2012 if (Verbose) {
2013 state()->print();
2014 }
2015 }
2016 #endif
2018 // save state after modification of operand stack for StateSplit instructions
2019 StateSplit* s = i1->as_StateSplit();
2020 if (s != NULL) {
2021 if (EliminateFieldAccess) {
2022 Intrinsic* intrinsic = s->as_Intrinsic();
2023 if (s->as_Invoke() != NULL || (intrinsic && !intrinsic->preserves_state())) {
2024 _memory->kill();
2025 }
2026 }
2027 s->set_state(state()->copy(ValueStack::StateAfter, canon.bci()));
2028 }
2030 // set up exception handlers for this instruction if necessary
2031 if (i1->can_trap()) {
2032 i1->set_exception_handlers(handle_exception(i1));
2033 assert(i1->exception_state() != NULL || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state");
2034 }
2035 return i1;
2036 }
2039 Instruction* GraphBuilder::append(Instruction* instr) {
2040 assert(instr->as_StateSplit() == NULL || instr->as_BlockEnd() != NULL, "wrong append used");
2041 return append_with_bci(instr, bci());
2042 }
2045 Instruction* GraphBuilder::append_split(StateSplit* instr) {
2046 return append_with_bci(instr, bci());
2047 }
2050 void GraphBuilder::null_check(Value value) {
2051 if (value->as_NewArray() != NULL || value->as_NewInstance() != NULL) {
2052 return;
2053 } else {
2054 Constant* con = value->as_Constant();
2055 if (con) {
2056 ObjectType* c = con->type()->as_ObjectType();
2057 if (c && c->is_loaded()) {
2058 ObjectConstant* oc = c->as_ObjectConstant();
2059 if (!oc || !oc->value()->is_null_object()) {
2060 return;
2061 }
2062 }
2063 }
2064 }
2065 append(new NullCheck(value, copy_state_for_exception()));
2066 }
2070 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {
2071 if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != NULL)) {
2072 assert(instruction->exception_state() == NULL
2073 || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2074 || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->jvmti_can_access_local_variables()),
2075 "exception_state should be of exception kind");
2076 return new XHandlers();
2077 }
2079 XHandlers* exception_handlers = new XHandlers();
2080 ScopeData* cur_scope_data = scope_data();
2081 ValueStack* cur_state = instruction->state_before();
2082 ValueStack* prev_state = NULL;
2083 int scope_count = 0;
2085 assert(cur_state != NULL, "state_before must be set");
2086 do {
2087 int cur_bci = cur_state->bci();
2088 assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2089 assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci");
2091 // join with all potential exception handlers
2092 XHandlers* list = cur_scope_data->xhandlers();
2093 const int n = list->length();
2094 for (int i = 0; i < n; i++) {
2095 XHandler* h = list->handler_at(i);
2096 if (h->covers(cur_bci)) {
2097 // h is a potential exception handler => join it
2098 compilation()->set_has_exception_handlers(true);
2100 BlockBegin* entry = h->entry_block();
2101 if (entry == block()) {
2102 // It's acceptable for an exception handler to cover itself
2103 // but we don't handle that in the parser currently. It's
2104 // very rare so we bailout instead of trying to handle it.
2105 BAILOUT_("exception handler covers itself", exception_handlers);
2106 }
2107 assert(entry->bci() == h->handler_bci(), "must match");
2108 assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2110 // previously this was a BAILOUT, but this is not necessary
2111 // now because asynchronous exceptions are not handled this way.
2112 assert(entry->state() == NULL || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match");
2114 // xhandler start with an empty expression stack
2115 if (cur_state->stack_size() != 0) {
2116 cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2117 }
2118 if (instruction->exception_state() == NULL) {
2119 instruction->set_exception_state(cur_state);
2120 }
2122 // Note: Usually this join must work. However, very
2123 // complicated jsr-ret structures where we don't ret from
2124 // the subroutine can cause the objects on the monitor
2125 // stacks to not match because blocks can be parsed twice.
2126 // The only test case we've seen so far which exhibits this
2127 // problem is caught by the infinite recursion test in
2128 // GraphBuilder::jsr() if the join doesn't work.
2129 if (!entry->try_merge(cur_state)) {
2130 BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers);
2131 }
2133 // add current state for correct handling of phi functions at begin of xhandler
2134 int phi_operand = entry->add_exception_state(cur_state);
2136 // add entry to the list of xhandlers of this block
2137 _block->add_exception_handler(entry);
2139 // add back-edge from xhandler entry to this block
2140 if (!entry->is_predecessor(_block)) {
2141 entry->add_predecessor(_block);
2142 }
2144 // clone XHandler because phi_operand and scope_count can not be shared
2145 XHandler* new_xhandler = new XHandler(h);
2146 new_xhandler->set_phi_operand(phi_operand);
2147 new_xhandler->set_scope_count(scope_count);
2148 exception_handlers->append(new_xhandler);
2150 // fill in exception handler subgraph lazily
2151 assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
2152 cur_scope_data->add_to_work_list(entry);
2154 // stop when reaching catchall
2155 if (h->catch_type() == 0) {
2156 return exception_handlers;
2157 }
2158 }
2159 }
2161 if (exception_handlers->length() == 0) {
2162 // This scope and all callees do not handle exceptions, so the local
2163 // variables of this scope are not needed. However, the scope itself is
2164 // required for a correct exception stack trace -> clear out the locals.
2165 if (_compilation->env()->jvmti_can_access_local_variables()) {
2166 cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2167 } else {
2168 cur_state = cur_state->copy(ValueStack::EmptyExceptionState, cur_state->bci());
2169 }
2170 if (prev_state != NULL) {
2171 prev_state->set_caller_state(cur_state);
2172 }
2173 if (instruction->exception_state() == NULL) {
2174 instruction->set_exception_state(cur_state);
2175 }
2176 }
2178 // Set up iteration for next time.
2179 // If parsing a jsr, do not grab exception handlers from the
2180 // parent scopes for this method (already got them, and they
2181 // needed to be cloned)
2183 while (cur_scope_data->parsing_jsr()) {
2184 cur_scope_data = cur_scope_data->parent();
2185 }
2187 assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2188 assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler");
2190 prev_state = cur_state;
2191 cur_state = cur_state->caller_state();
2192 cur_scope_data = cur_scope_data->parent();
2193 scope_count++;
2194 } while (cur_scope_data != NULL);
2196 return exception_handlers;
2197 }
2200 // Helper class for simplifying Phis.
2201 class PhiSimplifier : public BlockClosure {
2202 private:
2203 bool _has_substitutions;
2204 Value simplify(Value v);
2206 public:
2207 PhiSimplifier(BlockBegin* start) : _has_substitutions(false) {
2208 start->iterate_preorder(this);
2209 if (_has_substitutions) {
2210 SubstitutionResolver sr(start);
2211 }
2212 }
2213 void block_do(BlockBegin* b);
2214 bool has_substitutions() const { return _has_substitutions; }
2215 };
2218 Value PhiSimplifier::simplify(Value v) {
2219 Phi* phi = v->as_Phi();
2221 if (phi == NULL) {
2222 // no phi function
2223 return v;
2224 } else if (v->has_subst()) {
2225 // already substituted; subst can be phi itself -> simplify
2226 return simplify(v->subst());
2227 } else if (phi->is_set(Phi::cannot_simplify)) {
2228 // already tried to simplify phi before
2229 return phi;
2230 } else if (phi->is_set(Phi::visited)) {
2231 // break cycles in phi functions
2232 return phi;
2233 } else if (phi->type()->is_illegal()) {
2234 // illegal phi functions are ignored anyway
2235 return phi;
2237 } else {
2238 // mark phi function as processed to break cycles in phi functions
2239 phi->set(Phi::visited);
2241 // simplify x = [y, x] and x = [y, y] to y
2242 Value subst = NULL;
2243 int opd_count = phi->operand_count();
2244 for (int i = 0; i < opd_count; i++) {
2245 Value opd = phi->operand_at(i);
2246 assert(opd != NULL, "Operand must exist!");
2248 if (opd->type()->is_illegal()) {
2249 // if one operand is illegal, the entire phi function is illegal
2250 phi->make_illegal();
2251 phi->clear(Phi::visited);
2252 return phi;
2253 }
2255 Value new_opd = simplify(opd);
2256 assert(new_opd != NULL, "Simplified operand must exist!");
2258 if (new_opd != phi && new_opd != subst) {
2259 if (subst == NULL) {
2260 subst = new_opd;
2261 } else {
2262 // no simplification possible
2263 phi->set(Phi::cannot_simplify);
2264 phi->clear(Phi::visited);
2265 return phi;
2266 }
2267 }
2268 }
2270 // sucessfully simplified phi function
2271 assert(subst != NULL, "illegal phi function");
2272 _has_substitutions = true;
2273 phi->clear(Phi::visited);
2274 phi->set_subst(subst);
2276 #ifndef PRODUCT
2277 if (PrintPhiFunctions) {
2278 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());
2279 }
2280 #endif
2282 return subst;
2283 }
2284 }
2287 void PhiSimplifier::block_do(BlockBegin* b) {
2288 for_each_phi_fun(b, phi,
2289 simplify(phi);
2290 );
2292 #ifdef ASSERT
2293 for_each_phi_fun(b, phi,
2294 assert(phi->operand_count() != 1 || phi->subst() != phi, "missed trivial simplification");
2295 );
2297 ValueStack* state = b->state()->caller_state();
2298 for_each_state_value(state, value,
2299 Phi* phi = value->as_Phi();
2300 assert(phi == NULL || phi->block() != b, "must not have phi function to simplify in caller state");
2301 );
2302 #endif
2303 }
2305 // This method is called after all blocks are filled with HIR instructions
2306 // It eliminates all Phi functions of the form x = [y, y] and x = [y, x]
2307 void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) {
2308 PhiSimplifier simplifier(start);
2309 }
2312 void GraphBuilder::connect_to_end(BlockBegin* beg) {
2313 // setup iteration
2314 kill_all();
2315 _block = beg;
2316 _state = beg->state()->copy_for_parsing();
2317 _last = beg;
2318 iterate_bytecodes_for_block(beg->bci());
2319 }
2322 BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) {
2323 #ifndef PRODUCT
2324 if (PrintIRDuringConstruction) {
2325 tty->cr();
2326 InstructionPrinter ip;
2327 ip.print_instr(_block); tty->cr();
2328 ip.print_stack(_block->state()); tty->cr();
2329 ip.print_inline_level(_block);
2330 ip.print_head();
2331 tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size());
2332 }
2333 #endif
2334 _skip_block = false;
2335 assert(state() != NULL, "ValueStack missing!");
2336 ciBytecodeStream s(method());
2337 s.reset_to_bci(bci);
2338 int prev_bci = bci;
2339 scope_data()->set_stream(&s);
2340 // iterate
2341 Bytecodes::Code code = Bytecodes::_illegal;
2342 bool push_exception = false;
2344 if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == NULL) {
2345 // first thing in the exception entry block should be the exception object.
2346 push_exception = true;
2347 }
2349 while (!bailed_out() && last()->as_BlockEnd() == NULL &&
2350 (code = stream()->next()) != ciBytecodeStream::EOBC() &&
2351 (block_at(s.cur_bci()) == NULL || block_at(s.cur_bci()) == block())) {
2352 assert(state()->kind() == ValueStack::Parsing, "invalid state kind");
2354 // Check for active jsr during OSR compilation
2355 if (compilation()->is_osr_compile()
2356 && scope()->is_top_scope()
2357 && parsing_jsr()
2358 && s.cur_bci() == compilation()->osr_bci()) {
2359 bailout("OSR not supported while a jsr is active");
2360 }
2362 if (push_exception) {
2363 apush(append(new ExceptionObject()));
2364 push_exception = false;
2365 }
2367 // handle bytecode
2368 switch (code) {
2369 case Bytecodes::_nop : /* nothing to do */ break;
2370 case Bytecodes::_aconst_null : apush(append(new Constant(objectNull ))); break;
2371 case Bytecodes::_iconst_m1 : ipush(append(new Constant(new IntConstant (-1)))); break;
2372 case Bytecodes::_iconst_0 : ipush(append(new Constant(intZero ))); break;
2373 case Bytecodes::_iconst_1 : ipush(append(new Constant(intOne ))); break;
2374 case Bytecodes::_iconst_2 : ipush(append(new Constant(new IntConstant ( 2)))); break;
2375 case Bytecodes::_iconst_3 : ipush(append(new Constant(new IntConstant ( 3)))); break;
2376 case Bytecodes::_iconst_4 : ipush(append(new Constant(new IntConstant ( 4)))); break;
2377 case Bytecodes::_iconst_5 : ipush(append(new Constant(new IntConstant ( 5)))); break;
2378 case Bytecodes::_lconst_0 : lpush(append(new Constant(new LongConstant ( 0)))); break;
2379 case Bytecodes::_lconst_1 : lpush(append(new Constant(new LongConstant ( 1)))); break;
2380 case Bytecodes::_fconst_0 : fpush(append(new Constant(new FloatConstant ( 0)))); break;
2381 case Bytecodes::_fconst_1 : fpush(append(new Constant(new FloatConstant ( 1)))); break;
2382 case Bytecodes::_fconst_2 : fpush(append(new Constant(new FloatConstant ( 2)))); break;
2383 case Bytecodes::_dconst_0 : dpush(append(new Constant(new DoubleConstant( 0)))); break;
2384 case Bytecodes::_dconst_1 : dpush(append(new Constant(new DoubleConstant( 1)))); break;
2385 case Bytecodes::_bipush : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break;
2386 case Bytecodes::_sipush : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break;
2387 case Bytecodes::_ldc : // fall through
2388 case Bytecodes::_ldc_w : // fall through
2389 case Bytecodes::_ldc2_w : load_constant(); break;
2390 case Bytecodes::_iload : load_local(intType , s.get_index()); break;
2391 case Bytecodes::_lload : load_local(longType , s.get_index()); break;
2392 case Bytecodes::_fload : load_local(floatType , s.get_index()); break;
2393 case Bytecodes::_dload : load_local(doubleType , s.get_index()); break;
2394 case Bytecodes::_aload : load_local(instanceType, s.get_index()); break;
2395 case Bytecodes::_iload_0 : load_local(intType , 0); break;
2396 case Bytecodes::_iload_1 : load_local(intType , 1); break;
2397 case Bytecodes::_iload_2 : load_local(intType , 2); break;
2398 case Bytecodes::_iload_3 : load_local(intType , 3); break;
2399 case Bytecodes::_lload_0 : load_local(longType , 0); break;
2400 case Bytecodes::_lload_1 : load_local(longType , 1); break;
2401 case Bytecodes::_lload_2 : load_local(longType , 2); break;
2402 case Bytecodes::_lload_3 : load_local(longType , 3); break;
2403 case Bytecodes::_fload_0 : load_local(floatType , 0); break;
2404 case Bytecodes::_fload_1 : load_local(floatType , 1); break;
2405 case Bytecodes::_fload_2 : load_local(floatType , 2); break;
2406 case Bytecodes::_fload_3 : load_local(floatType , 3); break;
2407 case Bytecodes::_dload_0 : load_local(doubleType, 0); break;
2408 case Bytecodes::_dload_1 : load_local(doubleType, 1); break;
2409 case Bytecodes::_dload_2 : load_local(doubleType, 2); break;
2410 case Bytecodes::_dload_3 : load_local(doubleType, 3); break;
2411 case Bytecodes::_aload_0 : load_local(objectType, 0); break;
2412 case Bytecodes::_aload_1 : load_local(objectType, 1); break;
2413 case Bytecodes::_aload_2 : load_local(objectType, 2); break;
2414 case Bytecodes::_aload_3 : load_local(objectType, 3); break;
2415 case Bytecodes::_iaload : load_indexed(T_INT ); break;
2416 case Bytecodes::_laload : load_indexed(T_LONG ); break;
2417 case Bytecodes::_faload : load_indexed(T_FLOAT ); break;
2418 case Bytecodes::_daload : load_indexed(T_DOUBLE); break;
2419 case Bytecodes::_aaload : load_indexed(T_OBJECT); break;
2420 case Bytecodes::_baload : load_indexed(T_BYTE ); break;
2421 case Bytecodes::_caload : load_indexed(T_CHAR ); break;
2422 case Bytecodes::_saload : load_indexed(T_SHORT ); break;
2423 case Bytecodes::_istore : store_local(intType , s.get_index()); break;
2424 case Bytecodes::_lstore : store_local(longType , s.get_index()); break;
2425 case Bytecodes::_fstore : store_local(floatType , s.get_index()); break;
2426 case Bytecodes::_dstore : store_local(doubleType, s.get_index()); break;
2427 case Bytecodes::_astore : store_local(objectType, s.get_index()); break;
2428 case Bytecodes::_istore_0 : store_local(intType , 0); break;
2429 case Bytecodes::_istore_1 : store_local(intType , 1); break;
2430 case Bytecodes::_istore_2 : store_local(intType , 2); break;
2431 case Bytecodes::_istore_3 : store_local(intType , 3); break;
2432 case Bytecodes::_lstore_0 : store_local(longType , 0); break;
2433 case Bytecodes::_lstore_1 : store_local(longType , 1); break;
2434 case Bytecodes::_lstore_2 : store_local(longType , 2); break;
2435 case Bytecodes::_lstore_3 : store_local(longType , 3); break;
2436 case Bytecodes::_fstore_0 : store_local(floatType , 0); break;
2437 case Bytecodes::_fstore_1 : store_local(floatType , 1); break;
2438 case Bytecodes::_fstore_2 : store_local(floatType , 2); break;
2439 case Bytecodes::_fstore_3 : store_local(floatType , 3); break;
2440 case Bytecodes::_dstore_0 : store_local(doubleType, 0); break;
2441 case Bytecodes::_dstore_1 : store_local(doubleType, 1); break;
2442 case Bytecodes::_dstore_2 : store_local(doubleType, 2); break;
2443 case Bytecodes::_dstore_3 : store_local(doubleType, 3); break;
2444 case Bytecodes::_astore_0 : store_local(objectType, 0); break;
2445 case Bytecodes::_astore_1 : store_local(objectType, 1); break;
2446 case Bytecodes::_astore_2 : store_local(objectType, 2); break;
2447 case Bytecodes::_astore_3 : store_local(objectType, 3); break;
2448 case Bytecodes::_iastore : store_indexed(T_INT ); break;
2449 case Bytecodes::_lastore : store_indexed(T_LONG ); break;
2450 case Bytecodes::_fastore : store_indexed(T_FLOAT ); break;
2451 case Bytecodes::_dastore : store_indexed(T_DOUBLE); break;
2452 case Bytecodes::_aastore : store_indexed(T_OBJECT); break;
2453 case Bytecodes::_bastore : store_indexed(T_BYTE ); break;
2454 case Bytecodes::_castore : store_indexed(T_CHAR ); break;
2455 case Bytecodes::_sastore : store_indexed(T_SHORT ); break;
2456 case Bytecodes::_pop : // fall through
2457 case Bytecodes::_pop2 : // fall through
2458 case Bytecodes::_dup : // fall through
2459 case Bytecodes::_dup_x1 : // fall through
2460 case Bytecodes::_dup_x2 : // fall through
2461 case Bytecodes::_dup2 : // fall through
2462 case Bytecodes::_dup2_x1 : // fall through
2463 case Bytecodes::_dup2_x2 : // fall through
2464 case Bytecodes::_swap : stack_op(code); break;
2465 case Bytecodes::_iadd : arithmetic_op(intType , code); break;
2466 case Bytecodes::_ladd : arithmetic_op(longType , code); break;
2467 case Bytecodes::_fadd : arithmetic_op(floatType , code); break;
2468 case Bytecodes::_dadd : arithmetic_op(doubleType, code); break;
2469 case Bytecodes::_isub : arithmetic_op(intType , code); break;
2470 case Bytecodes::_lsub : arithmetic_op(longType , code); break;
2471 case Bytecodes::_fsub : arithmetic_op(floatType , code); break;
2472 case Bytecodes::_dsub : arithmetic_op(doubleType, code); break;
2473 case Bytecodes::_imul : arithmetic_op(intType , code); break;
2474 case Bytecodes::_lmul : arithmetic_op(longType , code); break;
2475 case Bytecodes::_fmul : arithmetic_op(floatType , code); break;
2476 case Bytecodes::_dmul : arithmetic_op(doubleType, code); break;
2477 case Bytecodes::_idiv : arithmetic_op(intType , code, copy_state_for_exception()); break;
2478 case Bytecodes::_ldiv : arithmetic_op(longType , code, copy_state_for_exception()); break;
2479 case Bytecodes::_fdiv : arithmetic_op(floatType , code); break;
2480 case Bytecodes::_ddiv : arithmetic_op(doubleType, code); break;
2481 case Bytecodes::_irem : arithmetic_op(intType , code, copy_state_for_exception()); break;
2482 case Bytecodes::_lrem : arithmetic_op(longType , code, copy_state_for_exception()); break;
2483 case Bytecodes::_frem : arithmetic_op(floatType , code); break;
2484 case Bytecodes::_drem : arithmetic_op(doubleType, code); break;
2485 case Bytecodes::_ineg : negate_op(intType ); break;
2486 case Bytecodes::_lneg : negate_op(longType ); break;
2487 case Bytecodes::_fneg : negate_op(floatType ); break;
2488 case Bytecodes::_dneg : negate_op(doubleType); break;
2489 case Bytecodes::_ishl : shift_op(intType , code); break;
2490 case Bytecodes::_lshl : shift_op(longType, code); break;
2491 case Bytecodes::_ishr : shift_op(intType , code); break;
2492 case Bytecodes::_lshr : shift_op(longType, code); break;
2493 case Bytecodes::_iushr : shift_op(intType , code); break;
2494 case Bytecodes::_lushr : shift_op(longType, code); break;
2495 case Bytecodes::_iand : logic_op(intType , code); break;
2496 case Bytecodes::_land : logic_op(longType, code); break;
2497 case Bytecodes::_ior : logic_op(intType , code); break;
2498 case Bytecodes::_lor : logic_op(longType, code); break;
2499 case Bytecodes::_ixor : logic_op(intType , code); break;
2500 case Bytecodes::_lxor : logic_op(longType, code); break;
2501 case Bytecodes::_iinc : increment(); break;
2502 case Bytecodes::_i2l : convert(code, T_INT , T_LONG ); break;
2503 case Bytecodes::_i2f : convert(code, T_INT , T_FLOAT ); break;
2504 case Bytecodes::_i2d : convert(code, T_INT , T_DOUBLE); break;
2505 case Bytecodes::_l2i : convert(code, T_LONG , T_INT ); break;
2506 case Bytecodes::_l2f : convert(code, T_LONG , T_FLOAT ); break;
2507 case Bytecodes::_l2d : convert(code, T_LONG , T_DOUBLE); break;
2508 case Bytecodes::_f2i : convert(code, T_FLOAT , T_INT ); break;
2509 case Bytecodes::_f2l : convert(code, T_FLOAT , T_LONG ); break;
2510 case Bytecodes::_f2d : convert(code, T_FLOAT , T_DOUBLE); break;
2511 case Bytecodes::_d2i : convert(code, T_DOUBLE, T_INT ); break;
2512 case Bytecodes::_d2l : convert(code, T_DOUBLE, T_LONG ); break;
2513 case Bytecodes::_d2f : convert(code, T_DOUBLE, T_FLOAT ); break;
2514 case Bytecodes::_i2b : convert(code, T_INT , T_BYTE ); break;
2515 case Bytecodes::_i2c : convert(code, T_INT , T_CHAR ); break;
2516 case Bytecodes::_i2s : convert(code, T_INT , T_SHORT ); break;
2517 case Bytecodes::_lcmp : compare_op(longType , code); break;
2518 case Bytecodes::_fcmpl : compare_op(floatType , code); break;
2519 case Bytecodes::_fcmpg : compare_op(floatType , code); break;
2520 case Bytecodes::_dcmpl : compare_op(doubleType, code); break;
2521 case Bytecodes::_dcmpg : compare_op(doubleType, code); break;
2522 case Bytecodes::_ifeq : if_zero(intType , If::eql); break;
2523 case Bytecodes::_ifne : if_zero(intType , If::neq); break;
2524 case Bytecodes::_iflt : if_zero(intType , If::lss); break;
2525 case Bytecodes::_ifge : if_zero(intType , If::geq); break;
2526 case Bytecodes::_ifgt : if_zero(intType , If::gtr); break;
2527 case Bytecodes::_ifle : if_zero(intType , If::leq); break;
2528 case Bytecodes::_if_icmpeq : if_same(intType , If::eql); break;
2529 case Bytecodes::_if_icmpne : if_same(intType , If::neq); break;
2530 case Bytecodes::_if_icmplt : if_same(intType , If::lss); break;
2531 case Bytecodes::_if_icmpge : if_same(intType , If::geq); break;
2532 case Bytecodes::_if_icmpgt : if_same(intType , If::gtr); break;
2533 case Bytecodes::_if_icmple : if_same(intType , If::leq); break;
2534 case Bytecodes::_if_acmpeq : if_same(objectType, If::eql); break;
2535 case Bytecodes::_if_acmpne : if_same(objectType, If::neq); break;
2536 case Bytecodes::_goto : _goto(s.cur_bci(), s.get_dest()); break;
2537 case Bytecodes::_jsr : jsr(s.get_dest()); break;
2538 case Bytecodes::_ret : ret(s.get_index()); break;
2539 case Bytecodes::_tableswitch : table_switch(); break;
2540 case Bytecodes::_lookupswitch : lookup_switch(); break;
2541 case Bytecodes::_ireturn : method_return(ipop()); break;
2542 case Bytecodes::_lreturn : method_return(lpop()); break;
2543 case Bytecodes::_freturn : method_return(fpop()); break;
2544 case Bytecodes::_dreturn : method_return(dpop()); break;
2545 case Bytecodes::_areturn : method_return(apop()); break;
2546 case Bytecodes::_return : method_return(NULL ); break;
2547 case Bytecodes::_getstatic : // fall through
2548 case Bytecodes::_putstatic : // fall through
2549 case Bytecodes::_getfield : // fall through
2550 case Bytecodes::_putfield : access_field(code); break;
2551 case Bytecodes::_invokevirtual : // fall through
2552 case Bytecodes::_invokespecial : // fall through
2553 case Bytecodes::_invokestatic : // fall through
2554 case Bytecodes::_invokedynamic : // fall through
2555 case Bytecodes::_invokeinterface: invoke(code); break;
2556 case Bytecodes::_new : new_instance(s.get_index_u2()); break;
2557 case Bytecodes::_newarray : new_type_array(); break;
2558 case Bytecodes::_anewarray : new_object_array(); break;
2559 case Bytecodes::_arraylength : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; }
2560 case Bytecodes::_athrow : throw_op(s.cur_bci()); break;
2561 case Bytecodes::_checkcast : check_cast(s.get_index_u2()); break;
2562 case Bytecodes::_instanceof : instance_of(s.get_index_u2()); break;
2563 case Bytecodes::_monitorenter : monitorenter(apop(), s.cur_bci()); break;
2564 case Bytecodes::_monitorexit : monitorexit (apop(), s.cur_bci()); break;
2565 case Bytecodes::_wide : ShouldNotReachHere(); break;
2566 case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break;
2567 case Bytecodes::_ifnull : if_null(objectType, If::eql); break;
2568 case Bytecodes::_ifnonnull : if_null(objectType, If::neq); break;
2569 case Bytecodes::_goto_w : _goto(s.cur_bci(), s.get_far_dest()); break;
2570 case Bytecodes::_jsr_w : jsr(s.get_far_dest()); break;
2571 case Bytecodes::_breakpoint : BAILOUT_("concurrent setting of breakpoint", NULL);
2572 default : ShouldNotReachHere(); break;
2573 }
2574 // save current bci to setup Goto at the end
2575 prev_bci = s.cur_bci();
2576 }
2577 CHECK_BAILOUT_(NULL);
2578 // stop processing of this block (see try_inline_full)
2579 if (_skip_block) {
2580 _skip_block = false;
2581 assert(_last && _last->as_BlockEnd(), "");
2582 return _last->as_BlockEnd();
2583 }
2584 // if there are any, check if last instruction is a BlockEnd instruction
2585 BlockEnd* end = last()->as_BlockEnd();
2586 if (end == NULL) {
2587 // all blocks must end with a BlockEnd instruction => add a Goto
2588 end = new Goto(block_at(s.cur_bci()), false);
2589 append(end);
2590 }
2591 assert(end == last()->as_BlockEnd(), "inconsistency");
2593 assert(end->state() != NULL, "state must already be present");
2594 assert(end->as_Return() == NULL || end->as_Throw() == NULL || end->state()->stack_size() == 0, "stack not needed for return and throw");
2596 // connect to begin & set state
2597 // NOTE that inlining may have changed the block we are parsing
2598 block()->set_end(end);
2599 // propagate state
2600 for (int i = end->number_of_sux() - 1; i >= 0; i--) {
2601 BlockBegin* sux = end->sux_at(i);
2602 assert(sux->is_predecessor(block()), "predecessor missing");
2603 // be careful, bailout if bytecodes are strange
2604 if (!sux->try_merge(end->state())) BAILOUT_("block join failed", NULL);
2605 scope_data()->add_to_work_list(end->sux_at(i));
2606 }
2608 scope_data()->set_stream(NULL);
2610 // done
2611 return end;
2612 }
2615 void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) {
2616 do {
2617 if (start_in_current_block_for_inlining && !bailed_out()) {
2618 iterate_bytecodes_for_block(0);
2619 start_in_current_block_for_inlining = false;
2620 } else {
2621 BlockBegin* b;
2622 while ((b = scope_data()->remove_from_work_list()) != NULL) {
2623 if (!b->is_set(BlockBegin::was_visited_flag)) {
2624 if (b->is_set(BlockBegin::osr_entry_flag)) {
2625 // we're about to parse the osr entry block, so make sure
2626 // we setup the OSR edge leading into this block so that
2627 // Phis get setup correctly.
2628 setup_osr_entry_block();
2629 // this is no longer the osr entry block, so clear it.
2630 b->clear(BlockBegin::osr_entry_flag);
2631 }
2632 b->set(BlockBegin::was_visited_flag);
2633 connect_to_end(b);
2634 }
2635 }
2636 }
2637 } while (!bailed_out() && !scope_data()->is_work_list_empty());
2638 }
2641 bool GraphBuilder::_can_trap [Bytecodes::number_of_java_codes];
2643 void GraphBuilder::initialize() {
2644 // the following bytecodes are assumed to potentially
2645 // throw exceptions in compiled code - note that e.g.
2646 // monitorexit & the return bytecodes do not throw
2647 // exceptions since monitor pairing proved that they
2648 // succeed (if monitor pairing succeeded)
2649 Bytecodes::Code can_trap_list[] =
2650 { Bytecodes::_ldc
2651 , Bytecodes::_ldc_w
2652 , Bytecodes::_ldc2_w
2653 , Bytecodes::_iaload
2654 , Bytecodes::_laload
2655 , Bytecodes::_faload
2656 , Bytecodes::_daload
2657 , Bytecodes::_aaload
2658 , Bytecodes::_baload
2659 , Bytecodes::_caload
2660 , Bytecodes::_saload
2661 , Bytecodes::_iastore
2662 , Bytecodes::_lastore
2663 , Bytecodes::_fastore
2664 , Bytecodes::_dastore
2665 , Bytecodes::_aastore
2666 , Bytecodes::_bastore
2667 , Bytecodes::_castore
2668 , Bytecodes::_sastore
2669 , Bytecodes::_idiv
2670 , Bytecodes::_ldiv
2671 , Bytecodes::_irem
2672 , Bytecodes::_lrem
2673 , Bytecodes::_getstatic
2674 , Bytecodes::_putstatic
2675 , Bytecodes::_getfield
2676 , Bytecodes::_putfield
2677 , Bytecodes::_invokevirtual
2678 , Bytecodes::_invokespecial
2679 , Bytecodes::_invokestatic
2680 , Bytecodes::_invokedynamic
2681 , Bytecodes::_invokeinterface
2682 , Bytecodes::_new
2683 , Bytecodes::_newarray
2684 , Bytecodes::_anewarray
2685 , Bytecodes::_arraylength
2686 , Bytecodes::_athrow
2687 , Bytecodes::_checkcast
2688 , Bytecodes::_instanceof
2689 , Bytecodes::_monitorenter
2690 , Bytecodes::_multianewarray
2691 };
2693 // inititialize trap tables
2694 for (int i = 0; i < Bytecodes::number_of_java_codes; i++) {
2695 _can_trap[i] = false;
2696 }
2697 // set standard trap info
2698 for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) {
2699 _can_trap[can_trap_list[j]] = true;
2700 }
2701 }
2704 BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {
2705 assert(entry->is_set(f), "entry/flag mismatch");
2706 // create header block
2707 BlockBegin* h = new BlockBegin(entry->bci());
2708 h->set_depth_first_number(0);
2710 Value l = h;
2711 BlockEnd* g = new Goto(entry, false);
2712 l->set_next(g, entry->bci());
2713 h->set_end(g);
2714 h->set(f);
2715 // setup header block end state
2716 ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis)
2717 assert(s->stack_is_empty(), "must have empty stack at entry point");
2718 g->set_state(s);
2719 return h;
2720 }
2724 BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) {
2725 BlockBegin* start = new BlockBegin(0);
2727 // This code eliminates the empty start block at the beginning of
2728 // each method. Previously, each method started with the
2729 // start-block created below, and this block was followed by the
2730 // header block that was always empty. This header block is only
2731 // necesary if std_entry is also a backward branch target because
2732 // then phi functions may be necessary in the header block. It's
2733 // also necessary when profiling so that there's a single block that
2734 // can increment the interpreter_invocation_count.
2735 BlockBegin* new_header_block;
2736 if (std_entry->number_of_preds() > 0 || count_invocations() || count_backedges()) {
2737 new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state);
2738 } else {
2739 new_header_block = std_entry;
2740 }
2742 // setup start block (root for the IR graph)
2743 Base* base =
2744 new Base(
2745 new_header_block,
2746 osr_entry
2747 );
2748 start->set_next(base, 0);
2749 start->set_end(base);
2750 // create & setup state for start block
2751 start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
2752 base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
2754 if (base->std_entry()->state() == NULL) {
2755 // setup states for header blocks
2756 base->std_entry()->merge(state);
2757 }
2759 assert(base->std_entry()->state() != NULL, "");
2760 return start;
2761 }
2764 void GraphBuilder::setup_osr_entry_block() {
2765 assert(compilation()->is_osr_compile(), "only for osrs");
2767 int osr_bci = compilation()->osr_bci();
2768 ciBytecodeStream s(method());
2769 s.reset_to_bci(osr_bci);
2770 s.next();
2771 scope_data()->set_stream(&s);
2773 // create a new block to be the osr setup code
2774 _osr_entry = new BlockBegin(osr_bci);
2775 _osr_entry->set(BlockBegin::osr_entry_flag);
2776 _osr_entry->set_depth_first_number(0);
2777 BlockBegin* target = bci2block()->at(osr_bci);
2778 assert(target != NULL && target->is_set(BlockBegin::osr_entry_flag), "must be there");
2779 // the osr entry has no values for locals
2780 ValueStack* state = target->state()->copy();
2781 _osr_entry->set_state(state);
2783 kill_all();
2784 _block = _osr_entry;
2785 _state = _osr_entry->state()->copy();
2786 assert(_state->bci() == osr_bci, "mismatch");
2787 _last = _osr_entry;
2788 Value e = append(new OsrEntry());
2789 e->set_needs_null_check(false);
2791 // OSR buffer is
2792 //
2793 // locals[nlocals-1..0]
2794 // monitors[number_of_locks-1..0]
2795 //
2796 // locals is a direct copy of the interpreter frame so in the osr buffer
2797 // so first slot in the local array is the last local from the interpreter
2798 // and last slot is local[0] (receiver) from the interpreter
2799 //
2800 // Similarly with locks. The first lock slot in the osr buffer is the nth lock
2801 // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
2802 // in the interpreter frame (the method lock if a sync method)
2804 // Initialize monitors in the compiled activation.
2806 int index;
2807 Value local;
2809 // find all the locals that the interpreter thinks contain live oops
2810 const BitMap live_oops = method()->live_local_oops_at_bci(osr_bci);
2812 // compute the offset into the locals so that we can treat the buffer
2813 // as if the locals were still in the interpreter frame
2814 int locals_offset = BytesPerWord * (method()->max_locals() - 1);
2815 for_each_local_value(state, index, local) {
2816 int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord;
2817 Value get;
2818 if (local->type()->is_object_kind() && !live_oops.at(index)) {
2819 // The interpreter thinks this local is dead but the compiler
2820 // doesn't so pretend that the interpreter passed in null.
2821 get = append(new Constant(objectNull));
2822 } else {
2823 get = append(new UnsafeGetRaw(as_BasicType(local->type()), e,
2824 append(new Constant(new IntConstant(offset))),
2825 0,
2826 true /*unaligned*/, true /*wide*/));
2827 }
2828 _state->store_local(index, get);
2829 }
2831 // the storage for the OSR buffer is freed manually in the LIRGenerator.
2833 assert(state->caller_state() == NULL, "should be top scope");
2834 state->clear_locals();
2835 Goto* g = new Goto(target, false);
2836 append(g);
2837 _osr_entry->set_end(g);
2838 target->merge(_osr_entry->end()->state());
2840 scope_data()->set_stream(NULL);
2841 }
2844 ValueStack* GraphBuilder::state_at_entry() {
2845 ValueStack* state = new ValueStack(scope(), NULL);
2847 // Set up locals for receiver
2848 int idx = 0;
2849 if (!method()->is_static()) {
2850 // we should always see the receiver
2851 state->store_local(idx, new Local(method()->holder(), objectType, idx));
2852 idx = 1;
2853 }
2855 // Set up locals for incoming arguments
2856 ciSignature* sig = method()->signature();
2857 for (int i = 0; i < sig->count(); i++) {
2858 ciType* type = sig->type_at(i);
2859 BasicType basic_type = type->basic_type();
2860 // don't allow T_ARRAY to propagate into locals types
2861 if (basic_type == T_ARRAY) basic_type = T_OBJECT;
2862 ValueType* vt = as_ValueType(basic_type);
2863 state->store_local(idx, new Local(type, vt, idx));
2864 idx += type->size();
2865 }
2867 // lock synchronized method
2868 if (method()->is_synchronized()) {
2869 state->lock(NULL);
2870 }
2872 return state;
2873 }
2876 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
2877 : _scope_data(NULL)
2878 , _instruction_count(0)
2879 , _osr_entry(NULL)
2880 , _memory(new MemoryBuffer())
2881 , _compilation(compilation)
2882 , _inline_bailout_msg(NULL)
2883 {
2884 int osr_bci = compilation->osr_bci();
2886 // determine entry points and bci2block mapping
2887 BlockListBuilder blm(compilation, scope, osr_bci);
2888 CHECK_BAILOUT();
2890 BlockList* bci2block = blm.bci2block();
2891 BlockBegin* start_block = bci2block->at(0);
2893 push_root_scope(scope, bci2block, start_block);
2895 // setup state for std entry
2896 _initial_state = state_at_entry();
2897 start_block->merge(_initial_state);
2899 // complete graph
2900 _vmap = new ValueMap();
2901 switch (scope->method()->intrinsic_id()) {
2902 case vmIntrinsics::_dabs : // fall through
2903 case vmIntrinsics::_dsqrt : // fall through
2904 case vmIntrinsics::_dsin : // fall through
2905 case vmIntrinsics::_dcos : // fall through
2906 case vmIntrinsics::_dtan : // fall through
2907 case vmIntrinsics::_dlog : // fall through
2908 case vmIntrinsics::_dlog10 : // fall through
2909 {
2910 // Compiles where the root method is an intrinsic need a special
2911 // compilation environment because the bytecodes for the method
2912 // shouldn't be parsed during the compilation, only the special
2913 // Intrinsic node should be emitted. If this isn't done the the
2914 // code for the inlined version will be different than the root
2915 // compiled version which could lead to monotonicity problems on
2916 // intel.
2918 // Set up a stream so that appending instructions works properly.
2919 ciBytecodeStream s(scope->method());
2920 s.reset_to_bci(0);
2921 scope_data()->set_stream(&s);
2922 s.next();
2924 // setup the initial block state
2925 _block = start_block;
2926 _state = start_block->state()->copy_for_parsing();
2927 _last = start_block;
2928 load_local(doubleType, 0);
2930 // Emit the intrinsic node.
2931 bool result = try_inline_intrinsics(scope->method());
2932 if (!result) BAILOUT("failed to inline intrinsic");
2933 method_return(dpop());
2935 // connect the begin and end blocks and we're all done.
2936 BlockEnd* end = last()->as_BlockEnd();
2937 block()->set_end(end);
2938 break;
2939 }
2941 case vmIntrinsics::_Reference_get:
2942 {
2943 if (UseG1GC) {
2944 // With java.lang.ref.reference.get() we must go through the
2945 // intrinsic - when G1 is enabled - even when get() is the root
2946 // method of the compile so that, if necessary, the value in
2947 // the referent field of the reference object gets recorded by
2948 // the pre-barrier code.
2949 // Specifically, if G1 is enabled, the value in the referent
2950 // field is recorded by the G1 SATB pre barrier. This will
2951 // result in the referent being marked live and the reference
2952 // object removed from the list of discovered references during
2953 // reference processing.
2955 // Set up a stream so that appending instructions works properly.
2956 ciBytecodeStream s(scope->method());
2957 s.reset_to_bci(0);
2958 scope_data()->set_stream(&s);
2959 s.next();
2961 // setup the initial block state
2962 _block = start_block;
2963 _state = start_block->state()->copy_for_parsing();
2964 _last = start_block;
2965 load_local(objectType, 0);
2967 // Emit the intrinsic node.
2968 bool result = try_inline_intrinsics(scope->method());
2969 if (!result) BAILOUT("failed to inline intrinsic");
2970 method_return(apop());
2972 // connect the begin and end blocks and we're all done.
2973 BlockEnd* end = last()->as_BlockEnd();
2974 block()->set_end(end);
2975 break;
2976 }
2977 // Otherwise, fall thru
2978 }
2980 default:
2981 scope_data()->add_to_work_list(start_block);
2982 iterate_all_blocks();
2983 break;
2984 }
2985 CHECK_BAILOUT();
2987 _start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state);
2989 eliminate_redundant_phis(_start);
2991 NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats());
2992 // for osr compile, bailout if some requirements are not fulfilled
2993 if (osr_bci != -1) {
2994 BlockBegin* osr_block = blm.bci2block()->at(osr_bci);
2995 assert(osr_block->is_set(BlockBegin::was_visited_flag),"osr entry must have been visited for osr compile");
2997 // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
2998 if (!osr_block->state()->stack_is_empty()) {
2999 BAILOUT("stack not empty at OSR entry point");
3000 }
3001 }
3002 #ifndef PRODUCT
3003 if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count);
3004 #endif
3005 }
3008 ValueStack* GraphBuilder::copy_state_before() {
3009 return copy_state_before_with_bci(bci());
3010 }
3012 ValueStack* GraphBuilder::copy_state_exhandling() {
3013 return copy_state_exhandling_with_bci(bci());
3014 }
3016 ValueStack* GraphBuilder::copy_state_for_exception() {
3017 return copy_state_for_exception_with_bci(bci());
3018 }
3020 ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) {
3021 return state()->copy(ValueStack::StateBefore, bci);
3022 }
3024 ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) {
3025 if (!has_handler()) return NULL;
3026 return state()->copy(ValueStack::StateBefore, bci);
3027 }
3029 ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) {
3030 ValueStack* s = copy_state_exhandling_with_bci(bci);
3031 if (s == NULL) {
3032 if (_compilation->env()->jvmti_can_access_local_variables()) {
3033 s = state()->copy(ValueStack::ExceptionState, bci);
3034 } else {
3035 s = state()->copy(ValueStack::EmptyExceptionState, bci);
3036 }
3037 }
3038 return s;
3039 }
3041 int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const {
3042 int recur_level = 0;
3043 for (IRScope* s = scope(); s != NULL; s = s->caller()) {
3044 if (s->method() == cur_callee) {
3045 ++recur_level;
3046 }
3047 }
3048 return recur_level;
3049 }
3052 bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known, Value receiver) {
3053 // Clear out any existing inline bailout condition
3054 clear_inline_bailout();
3056 if (callee->should_exclude()) {
3057 // callee is excluded
3058 INLINE_BAILOUT("excluded by CompilerOracle")
3059 } else if (callee->should_not_inline()) {
3060 // callee is excluded
3061 INLINE_BAILOUT("disallowed by CompilerOracle")
3062 } else if (!callee->can_be_compiled()) {
3063 // callee is not compilable (prob. has breakpoints)
3064 INLINE_BAILOUT("not compilable (disabled)")
3065 } else if (callee->intrinsic_id() != vmIntrinsics::_none && try_inline_intrinsics(callee)) {
3066 // intrinsics can be native or not
3067 return true;
3068 } else if (callee->is_native()) {
3069 // non-intrinsic natives cannot be inlined
3070 INLINE_BAILOUT("non-intrinsic native")
3071 } else if (callee->is_abstract()) {
3072 INLINE_BAILOUT("abstract")
3073 } else {
3074 return try_inline_full(callee, holder_known, NULL, receiver);
3075 }
3076 }
3079 bool GraphBuilder::try_inline_intrinsics(ciMethod* callee) {
3080 if (!InlineNatives ) INLINE_BAILOUT("intrinsic method inlining disabled");
3081 if (callee->is_synchronized()) {
3082 // We don't currently support any synchronized intrinsics
3083 return false;
3084 }
3086 // callee seems like a good candidate
3087 // determine id
3088 bool preserves_state = false;
3089 bool cantrap = true;
3090 vmIntrinsics::ID id = callee->intrinsic_id();
3091 switch (id) {
3092 case vmIntrinsics::_arraycopy :
3093 if (!InlineArrayCopy) return false;
3094 break;
3096 case vmIntrinsics::_currentTimeMillis:
3097 case vmIntrinsics::_nanoTime:
3098 preserves_state = true;
3099 cantrap = false;
3100 break;
3102 case vmIntrinsics::_floatToRawIntBits :
3103 case vmIntrinsics::_intBitsToFloat :
3104 case vmIntrinsics::_doubleToRawLongBits :
3105 case vmIntrinsics::_longBitsToDouble :
3106 if (!InlineMathNatives) return false;
3107 preserves_state = true;
3108 cantrap = false;
3109 break;
3111 case vmIntrinsics::_getClass :
3112 if (!InlineClassNatives) return false;
3113 preserves_state = true;
3114 break;
3116 case vmIntrinsics::_currentThread :
3117 if (!InlineThreadNatives) return false;
3118 preserves_state = true;
3119 cantrap = false;
3120 break;
3122 case vmIntrinsics::_dabs : // fall through
3123 case vmIntrinsics::_dsqrt : // fall through
3124 case vmIntrinsics::_dsin : // fall through
3125 case vmIntrinsics::_dcos : // fall through
3126 case vmIntrinsics::_dtan : // fall through
3127 case vmIntrinsics::_dlog : // fall through
3128 case vmIntrinsics::_dlog10 : // fall through
3129 if (!InlineMathNatives) return false;
3130 cantrap = false;
3131 preserves_state = true;
3132 break;
3134 // sun/misc/AtomicLong.attemptUpdate
3135 case vmIntrinsics::_attemptUpdate :
3136 if (!VM_Version::supports_cx8()) return false;
3137 if (!InlineAtomicLong) return false;
3138 preserves_state = true;
3139 break;
3141 // Use special nodes for Unsafe instructions so we can more easily
3142 // perform an address-mode optimization on the raw variants
3143 case vmIntrinsics::_getObject : return append_unsafe_get_obj(callee, T_OBJECT, false);
3144 case vmIntrinsics::_getBoolean: return append_unsafe_get_obj(callee, T_BOOLEAN, false);
3145 case vmIntrinsics::_getByte : return append_unsafe_get_obj(callee, T_BYTE, false);
3146 case vmIntrinsics::_getShort : return append_unsafe_get_obj(callee, T_SHORT, false);
3147 case vmIntrinsics::_getChar : return append_unsafe_get_obj(callee, T_CHAR, false);
3148 case vmIntrinsics::_getInt : return append_unsafe_get_obj(callee, T_INT, false);
3149 case vmIntrinsics::_getLong : return append_unsafe_get_obj(callee, T_LONG, false);
3150 case vmIntrinsics::_getFloat : return append_unsafe_get_obj(callee, T_FLOAT, false);
3151 case vmIntrinsics::_getDouble : return append_unsafe_get_obj(callee, T_DOUBLE, false);
3153 case vmIntrinsics::_putObject : return append_unsafe_put_obj(callee, T_OBJECT, false);
3154 case vmIntrinsics::_putBoolean: return append_unsafe_put_obj(callee, T_BOOLEAN, false);
3155 case vmIntrinsics::_putByte : return append_unsafe_put_obj(callee, T_BYTE, false);
3156 case vmIntrinsics::_putShort : return append_unsafe_put_obj(callee, T_SHORT, false);
3157 case vmIntrinsics::_putChar : return append_unsafe_put_obj(callee, T_CHAR, false);
3158 case vmIntrinsics::_putInt : return append_unsafe_put_obj(callee, T_INT, false);
3159 case vmIntrinsics::_putLong : return append_unsafe_put_obj(callee, T_LONG, false);
3160 case vmIntrinsics::_putFloat : return append_unsafe_put_obj(callee, T_FLOAT, false);
3161 case vmIntrinsics::_putDouble : return append_unsafe_put_obj(callee, T_DOUBLE, false);
3163 case vmIntrinsics::_getObjectVolatile : return append_unsafe_get_obj(callee, T_OBJECT, true);
3164 case vmIntrinsics::_getBooleanVolatile: return append_unsafe_get_obj(callee, T_BOOLEAN, true);
3165 case vmIntrinsics::_getByteVolatile : return append_unsafe_get_obj(callee, T_BYTE, true);
3166 case vmIntrinsics::_getShortVolatile : return append_unsafe_get_obj(callee, T_SHORT, true);
3167 case vmIntrinsics::_getCharVolatile : return append_unsafe_get_obj(callee, T_CHAR, true);
3168 case vmIntrinsics::_getIntVolatile : return append_unsafe_get_obj(callee, T_INT, true);
3169 case vmIntrinsics::_getLongVolatile : return append_unsafe_get_obj(callee, T_LONG, true);
3170 case vmIntrinsics::_getFloatVolatile : return append_unsafe_get_obj(callee, T_FLOAT, true);
3171 case vmIntrinsics::_getDoubleVolatile : return append_unsafe_get_obj(callee, T_DOUBLE, true);
3173 case vmIntrinsics::_putObjectVolatile : return append_unsafe_put_obj(callee, T_OBJECT, true);
3174 case vmIntrinsics::_putBooleanVolatile: return append_unsafe_put_obj(callee, T_BOOLEAN, true);
3175 case vmIntrinsics::_putByteVolatile : return append_unsafe_put_obj(callee, T_BYTE, true);
3176 case vmIntrinsics::_putShortVolatile : return append_unsafe_put_obj(callee, T_SHORT, true);
3177 case vmIntrinsics::_putCharVolatile : return append_unsafe_put_obj(callee, T_CHAR, true);
3178 case vmIntrinsics::_putIntVolatile : return append_unsafe_put_obj(callee, T_INT, true);
3179 case vmIntrinsics::_putLongVolatile : return append_unsafe_put_obj(callee, T_LONG, true);
3180 case vmIntrinsics::_putFloatVolatile : return append_unsafe_put_obj(callee, T_FLOAT, true);
3181 case vmIntrinsics::_putDoubleVolatile : return append_unsafe_put_obj(callee, T_DOUBLE, true);
3183 case vmIntrinsics::_getByte_raw : return append_unsafe_get_raw(callee, T_BYTE);
3184 case vmIntrinsics::_getShort_raw : return append_unsafe_get_raw(callee, T_SHORT);
3185 case vmIntrinsics::_getChar_raw : return append_unsafe_get_raw(callee, T_CHAR);
3186 case vmIntrinsics::_getInt_raw : return append_unsafe_get_raw(callee, T_INT);
3187 case vmIntrinsics::_getLong_raw : return append_unsafe_get_raw(callee, T_LONG);
3188 case vmIntrinsics::_getFloat_raw : return append_unsafe_get_raw(callee, T_FLOAT);
3189 case vmIntrinsics::_getDouble_raw : return append_unsafe_get_raw(callee, T_DOUBLE);
3191 case vmIntrinsics::_putByte_raw : return append_unsafe_put_raw(callee, T_BYTE);
3192 case vmIntrinsics::_putShort_raw : return append_unsafe_put_raw(callee, T_SHORT);
3193 case vmIntrinsics::_putChar_raw : return append_unsafe_put_raw(callee, T_CHAR);
3194 case vmIntrinsics::_putInt_raw : return append_unsafe_put_raw(callee, T_INT);
3195 case vmIntrinsics::_putLong_raw : return append_unsafe_put_raw(callee, T_LONG);
3196 case vmIntrinsics::_putFloat_raw : return append_unsafe_put_raw(callee, T_FLOAT);
3197 case vmIntrinsics::_putDouble_raw : return append_unsafe_put_raw(callee, T_DOUBLE);
3199 case vmIntrinsics::_prefetchRead : return append_unsafe_prefetch(callee, false, false);
3200 case vmIntrinsics::_prefetchWrite : return append_unsafe_prefetch(callee, false, true);
3201 case vmIntrinsics::_prefetchReadStatic : return append_unsafe_prefetch(callee, true, false);
3202 case vmIntrinsics::_prefetchWriteStatic : return append_unsafe_prefetch(callee, true, true);
3204 case vmIntrinsics::_checkIndex :
3205 if (!InlineNIOCheckIndex) return false;
3206 preserves_state = true;
3207 break;
3208 case vmIntrinsics::_putOrderedObject : return append_unsafe_put_obj(callee, T_OBJECT, true);
3209 case vmIntrinsics::_putOrderedInt : return append_unsafe_put_obj(callee, T_INT, true);
3210 case vmIntrinsics::_putOrderedLong : return append_unsafe_put_obj(callee, T_LONG, true);
3212 case vmIntrinsics::_compareAndSwapLong:
3213 if (!VM_Version::supports_cx8()) return false;
3214 // fall through
3215 case vmIntrinsics::_compareAndSwapInt:
3216 case vmIntrinsics::_compareAndSwapObject:
3217 append_unsafe_CAS(callee);
3218 return true;
3220 case vmIntrinsics::_Reference_get:
3221 // It is only when G1 is enabled that we absolutely
3222 // need to use the intrinsic version of Reference.get()
3223 // so that the value in the referent field, if necessary,
3224 // can be registered by the pre-barrier code.
3225 if (!UseG1GC) return false;
3226 preserves_state = true;
3227 break;
3229 default : return false; // do not inline
3230 }
3231 // create intrinsic node
3232 const bool has_receiver = !callee->is_static();
3233 ValueType* result_type = as_ValueType(callee->return_type());
3234 ValueStack* state_before = copy_state_for_exception();
3236 Values* args = state()->pop_arguments(callee->arg_size());
3238 if (is_profiling()) {
3239 // Don't profile in the special case where the root method
3240 // is the intrinsic
3241 if (callee != method()) {
3242 // Note that we'd collect profile data in this method if we wanted it.
3243 compilation()->set_would_profile(true);
3244 if (profile_calls()) {
3245 Value recv = NULL;
3246 if (has_receiver) {
3247 recv = args->at(0);
3248 null_check(recv);
3249 }
3250 profile_call(recv, NULL);
3251 }
3252 }
3253 }
3255 Intrinsic* result = new Intrinsic(result_type, id, args, has_receiver, state_before,
3256 preserves_state, cantrap);
3257 // append instruction & push result
3258 Value value = append_split(result);
3259 if (result_type != voidType) push(result_type, value);
3261 #ifndef PRODUCT
3262 // printing
3263 if (PrintInlining) {
3264 print_inline_result(callee, true);
3265 }
3266 #endif
3268 // done
3269 return true;
3270 }
3273 bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) {
3274 // Introduce a new callee continuation point - all Ret instructions
3275 // will be replaced with Gotos to this point.
3276 BlockBegin* cont = block_at(next_bci());
3277 assert(cont != NULL, "continuation must exist (BlockListBuilder starts a new block after a jsr");
3279 // Note: can not assign state to continuation yet, as we have to
3280 // pick up the state from the Ret instructions.
3282 // Push callee scope
3283 push_scope_for_jsr(cont, jsr_dest_bci);
3285 // Temporarily set up bytecode stream so we can append instructions
3286 // (only using the bci of this stream)
3287 scope_data()->set_stream(scope_data()->parent()->stream());
3289 BlockBegin* jsr_start_block = block_at(jsr_dest_bci);
3290 assert(jsr_start_block != NULL, "jsr start block must exist");
3291 assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet");
3292 Goto* goto_sub = new Goto(jsr_start_block, false);
3293 // Must copy state to avoid wrong sharing when parsing bytecodes
3294 assert(jsr_start_block->state() == NULL, "should have fresh jsr starting block");
3295 jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci));
3296 append(goto_sub);
3297 _block->set_end(goto_sub);
3298 _last = _block = jsr_start_block;
3300 // Clear out bytecode stream
3301 scope_data()->set_stream(NULL);
3303 scope_data()->add_to_work_list(jsr_start_block);
3305 // Ready to resume parsing in subroutine
3306 iterate_all_blocks();
3308 // If we bailed out during parsing, return immediately (this is bad news)
3309 CHECK_BAILOUT_(false);
3311 // Detect whether the continuation can actually be reached. If not,
3312 // it has not had state set by the join() operations in
3313 // iterate_bytecodes_for_block()/ret() and we should not touch the
3314 // iteration state. The calling activation of
3315 // iterate_bytecodes_for_block will then complete normally.
3316 if (cont->state() != NULL) {
3317 if (!cont->is_set(BlockBegin::was_visited_flag)) {
3318 // add continuation to work list instead of parsing it immediately
3319 scope_data()->parent()->add_to_work_list(cont);
3320 }
3321 }
3323 assert(jsr_continuation() == cont, "continuation must not have changed");
3324 assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) ||
3325 jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag),
3326 "continuation can only be visited in case of backward branches");
3327 assert(_last && _last->as_BlockEnd(), "block must have end");
3329 // continuation is in work list, so end iteration of current block
3330 _skip_block = true;
3331 pop_scope_for_jsr();
3333 return true;
3334 }
3337 // Inline the entry of a synchronized method as a monitor enter and
3338 // register the exception handler which releases the monitor if an
3339 // exception is thrown within the callee. Note that the monitor enter
3340 // cannot throw an exception itself, because the receiver is
3341 // guaranteed to be non-null by the explicit null check at the
3342 // beginning of inlining.
3343 void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) {
3344 assert(lock != NULL && sync_handler != NULL, "lock or handler missing");
3346 monitorenter(lock, SynchronizationEntryBCI);
3347 assert(_last->as_MonitorEnter() != NULL, "monitor enter expected");
3348 _last->set_needs_null_check(false);
3350 sync_handler->set(BlockBegin::exception_entry_flag);
3351 sync_handler->set(BlockBegin::is_on_work_list_flag);
3353 ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0);
3354 XHandler* h = new XHandler(desc);
3355 h->set_entry_block(sync_handler);
3356 scope_data()->xhandlers()->append(h);
3357 scope_data()->set_has_handler();
3358 }
3361 // If an exception is thrown and not handled within an inlined
3362 // synchronized method, the monitor must be released before the
3363 // exception is rethrown in the outer scope. Generate the appropriate
3364 // instructions here.
3365 void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) {
3366 BlockBegin* orig_block = _block;
3367 ValueStack* orig_state = _state;
3368 Instruction* orig_last = _last;
3369 _last = _block = sync_handler;
3370 _state = sync_handler->state()->copy();
3372 assert(sync_handler != NULL, "handler missing");
3373 assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here");
3375 assert(lock != NULL || default_handler, "lock or handler missing");
3377 XHandler* h = scope_data()->xhandlers()->remove_last();
3378 assert(h->entry_block() == sync_handler, "corrupt list of handlers");
3380 block()->set(BlockBegin::was_visited_flag);
3381 Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI);
3382 assert(exception->is_pinned(), "must be");
3384 int bci = SynchronizationEntryBCI;
3385 if (compilation()->env()->dtrace_method_probes()) {
3386 // Report exit from inline methods. We don't have a stream here
3387 // so pass an explicit bci of SynchronizationEntryBCI.
3388 Values* args = new Values(1);
3389 args->push(append_with_bci(new Constant(new ObjectConstant(method())), bci));
3390 append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci);
3391 }
3393 if (lock) {
3394 assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing");
3395 if (!lock->is_linked()) {
3396 lock = append_with_bci(lock, bci);
3397 }
3399 // exit the monitor in the context of the synchronized method
3400 monitorexit(lock, bci);
3402 // exit the context of the synchronized method
3403 if (!default_handler) {
3404 pop_scope();
3405 bci = _state->caller_state()->bci();
3406 _state = _state->caller_state()->copy_for_parsing();
3407 }
3408 }
3410 // perform the throw as if at the the call site
3411 apush(exception);
3412 throw_op(bci);
3414 BlockEnd* end = last()->as_BlockEnd();
3415 block()->set_end(end);
3417 _block = orig_block;
3418 _state = orig_state;
3419 _last = orig_last;
3420 }
3423 bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known, BlockBegin* cont_block, Value receiver) {
3424 assert(!callee->is_native(), "callee must not be native");
3425 if (CompilationPolicy::policy()->should_not_inline(compilation()->env(), callee)) {
3426 INLINE_BAILOUT("inlining prohibited by policy");
3427 }
3428 // first perform tests of things it's not possible to inline
3429 if (callee->has_exception_handlers() &&
3430 !InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers");
3431 if (callee->is_synchronized() &&
3432 !InlineSynchronizedMethods ) INLINE_BAILOUT("callee is synchronized");
3433 if (!callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet");
3434 if (!callee->has_balanced_monitors()) INLINE_BAILOUT("callee's monitors do not match");
3436 // Proper inlining of methods with jsrs requires a little more work.
3437 if (callee->has_jsrs() ) INLINE_BAILOUT("jsrs not handled properly by inliner yet");
3439 // When SSE2 is used on intel, then no special handling is needed
3440 // for strictfp because the enum-constant is fixed at compile time,
3441 // the check for UseSSE2 is needed here
3442 if (strict_fp_requires_explicit_rounding && UseSSE < 2 && method()->is_strict() != callee->is_strict()) {
3443 INLINE_BAILOUT("caller and callee have different strict fp requirements");
3444 }
3446 if (is_profiling() && !callee->ensure_method_data()) {
3447 INLINE_BAILOUT("mdo allocation failed");
3448 }
3450 // now perform tests that are based on flag settings
3451 if (callee->should_inline()) {
3452 // ignore heuristic controls on inlining
3453 } else {
3454 if (inline_level() > MaxInlineLevel ) INLINE_BAILOUT("too-deep inlining");
3455 if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("too-deep recursive inlining");
3456 if (callee->code_size_for_inlining() > max_inline_size() ) INLINE_BAILOUT("callee is too large");
3458 // don't inline throwable methods unless the inlining tree is rooted in a throwable class
3459 if (callee->name() == ciSymbol::object_initializer_name() &&
3460 callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3461 // Throwable constructor call
3462 IRScope* top = scope();
3463 while (top->caller() != NULL) {
3464 top = top->caller();
3465 }
3466 if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {
3467 INLINE_BAILOUT("don't inline Throwable constructors");
3468 }
3469 }
3471 if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) {
3472 INLINE_BAILOUT("total inlining greater than DesiredMethodLimit");
3473 }
3474 }
3476 #ifndef PRODUCT
3477 // printing
3478 if (PrintInlining) {
3479 print_inline_result(callee, true);
3480 }
3481 #endif
3483 // NOTE: Bailouts from this point on, which occur at the
3484 // GraphBuilder level, do not cause bailout just of the inlining but
3485 // in fact of the entire compilation.
3487 BlockBegin* orig_block = block();
3489 const int args_base = state()->stack_size() - callee->arg_size();
3490 assert(args_base >= 0, "stack underflow during inlining");
3492 // Insert null check if necessary
3493 Value recv = NULL;
3494 if (code() != Bytecodes::_invokestatic &&
3495 code() != Bytecodes::_invokedynamic) {
3496 // note: null check must happen even if first instruction of callee does
3497 // an implicit null check since the callee is in a different scope
3498 // and we must make sure exception handling does the right thing
3499 assert(!callee->is_static(), "callee must not be static");
3500 assert(callee->arg_size() > 0, "must have at least a receiver");
3501 recv = state()->stack_at(args_base);
3502 null_check(recv);
3503 }
3505 if (is_profiling()) {
3506 // Note that we'd collect profile data in this method if we wanted it.
3507 // this may be redundant here...
3508 compilation()->set_would_profile(true);
3510 if (profile_calls()) {
3511 profile_call(recv, holder_known ? callee->holder() : NULL);
3512 }
3513 }
3515 // Introduce a new callee continuation point - if the callee has
3516 // more than one return instruction or the return does not allow
3517 // fall-through of control flow, all return instructions of the
3518 // callee will need to be replaced by Goto's pointing to this
3519 // continuation point.
3520 BlockBegin* cont = cont_block != NULL ? cont_block : block_at(next_bci());
3521 bool continuation_existed = true;
3522 if (cont == NULL) {
3523 cont = new BlockBegin(next_bci());
3524 // low number so that continuation gets parsed as early as possible
3525 cont->set_depth_first_number(0);
3526 #ifndef PRODUCT
3527 if (PrintInitialBlockList) {
3528 tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d",
3529 cont->block_id(), cont->bci(), bci());
3530 }
3531 #endif
3532 continuation_existed = false;
3533 }
3534 // Record number of predecessors of continuation block before
3535 // inlining, to detect if inlined method has edges to its
3536 // continuation after inlining.
3537 int continuation_preds = cont->number_of_preds();
3539 // Push callee scope
3540 push_scope(callee, cont);
3542 // the BlockListBuilder for the callee could have bailed out
3543 CHECK_BAILOUT_(false);
3545 // Temporarily set up bytecode stream so we can append instructions
3546 // (only using the bci of this stream)
3547 scope_data()->set_stream(scope_data()->parent()->stream());
3549 // Pass parameters into callee state: add assignments
3550 // note: this will also ensure that all arguments are computed before being passed
3551 ValueStack* callee_state = state();
3552 ValueStack* caller_state = state()->caller_state();
3553 { int i = args_base;
3554 while (i < caller_state->stack_size()) {
3555 const int par_no = i - args_base;
3556 Value arg = caller_state->stack_at_inc(i);
3557 // NOTE: take base() of arg->type() to avoid problems storing
3558 // constants
3559 if (receiver != NULL && par_no == 0) {
3560 arg = receiver;
3561 }
3562 store_local(callee_state, arg, arg->type()->base(), par_no);
3563 }
3564 }
3566 // Remove args from stack.
3567 // Note that we preserve locals state in case we can use it later
3568 // (see use of pop_scope() below)
3569 caller_state->truncate_stack(args_base);
3570 assert(callee_state->stack_size() == 0, "callee stack must be empty");
3572 Value lock;
3573 BlockBegin* sync_handler;
3575 // Inline the locking of the receiver if the callee is synchronized
3576 if (callee->is_synchronized()) {
3577 lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror())))
3578 : state()->local_at(0);
3579 sync_handler = new BlockBegin(SynchronizationEntryBCI);
3580 inline_sync_entry(lock, sync_handler);
3581 }
3583 if (compilation()->env()->dtrace_method_probes()) {
3584 Values* args = new Values(1);
3585 args->push(append(new Constant(new ObjectConstant(method()))));
3586 append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args));
3587 }
3589 if (profile_inlined_calls()) {
3590 profile_invocation(callee, copy_state_before_with_bci(SynchronizationEntryBCI));
3591 }
3593 BlockBegin* callee_start_block = block_at(0);
3594 if (callee_start_block != NULL) {
3595 assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header");
3596 Goto* goto_callee = new Goto(callee_start_block, false);
3597 // The state for this goto is in the scope of the callee, so use
3598 // the entry bci for the callee instead of the call site bci.
3599 append_with_bci(goto_callee, 0);
3600 _block->set_end(goto_callee);
3601 callee_start_block->merge(callee_state);
3603 _last = _block = callee_start_block;
3605 scope_data()->add_to_work_list(callee_start_block);
3606 }
3608 // Clear out bytecode stream
3609 scope_data()->set_stream(NULL);
3611 // Ready to resume parsing in callee (either in the same block we
3612 // were in before or in the callee's start block)
3613 iterate_all_blocks(callee_start_block == NULL);
3615 // If we bailed out during parsing, return immediately (this is bad news)
3616 if (bailed_out()) return false;
3618 // iterate_all_blocks theoretically traverses in random order; in
3619 // practice, we have only traversed the continuation if we are
3620 // inlining into a subroutine
3621 assert(continuation_existed ||
3622 !continuation()->is_set(BlockBegin::was_visited_flag),
3623 "continuation should not have been parsed yet if we created it");
3625 // If we bailed out during parsing, return immediately (this is bad news)
3626 CHECK_BAILOUT_(false);
3628 // At this point we are almost ready to return and resume parsing of
3629 // the caller back in the GraphBuilder. The only thing we want to do
3630 // first is an optimization: during parsing of the callee we
3631 // generated at least one Goto to the continuation block. If we
3632 // generated exactly one, and if the inlined method spanned exactly
3633 // one block (and we didn't have to Goto its entry), then we snip
3634 // off the Goto to the continuation, allowing control to fall
3635 // through back into the caller block and effectively performing
3636 // block merging. This allows load elimination and CSE to take place
3637 // across multiple callee scopes if they are relatively simple, and
3638 // is currently essential to making inlining profitable.
3639 if (cont_block == NULL) {
3640 if (num_returns() == 1
3641 && block() == orig_block
3642 && block() == inline_cleanup_block()) {
3643 _last = inline_cleanup_return_prev();
3644 _state = inline_cleanup_state();
3645 } else if (continuation_preds == cont->number_of_preds()) {
3646 // Inlining caused that the instructions after the invoke in the
3647 // caller are not reachable any more. So skip filling this block
3648 // with instructions!
3649 assert(cont == continuation(), "");
3650 assert(_last && _last->as_BlockEnd(), "");
3651 _skip_block = true;
3652 } else {
3653 // Resume parsing in continuation block unless it was already parsed.
3654 // Note that if we don't change _last here, iteration in
3655 // iterate_bytecodes_for_block will stop when we return.
3656 if (!continuation()->is_set(BlockBegin::was_visited_flag)) {
3657 // add continuation to work list instead of parsing it immediately
3658 assert(_last && _last->as_BlockEnd(), "");
3659 scope_data()->parent()->add_to_work_list(continuation());
3660 _skip_block = true;
3661 }
3662 }
3663 }
3665 // Fill the exception handler for synchronized methods with instructions
3666 if (callee->is_synchronized() && sync_handler->state() != NULL) {
3667 fill_sync_handler(lock, sync_handler);
3668 } else {
3669 pop_scope();
3670 }
3672 compilation()->notice_inlined_method(callee);
3674 return true;
3675 }
3678 bool GraphBuilder::for_method_handle_inline(ciMethod* callee) {
3679 assert(!callee->is_static(), "change next line");
3680 int index = state()->stack_size() - (callee->arg_size_no_receiver() + 1);
3681 Value receiver = state()->stack_at(index);
3683 if (receiver->type()->is_constant()) {
3684 ciMethodHandle* method_handle = receiver->type()->as_ObjectType()->constant_value()->as_method_handle();
3686 // Set the callee to have access to the class and signature in
3687 // the MethodHandleCompiler.
3688 method_handle->set_callee(callee);
3689 method_handle->set_caller(method());
3691 // Get an adapter for the MethodHandle.
3692 ciMethod* method_handle_adapter = method_handle->get_method_handle_adapter();
3693 if (method_handle_adapter != NULL) {
3694 return try_inline(method_handle_adapter, /*holder_known=*/ true);
3695 }
3696 } else if (receiver->as_CheckCast()) {
3697 // Match MethodHandle.selectAlternative idiom
3698 Phi* phi = receiver->as_CheckCast()->obj()->as_Phi();
3700 if (phi != NULL && phi->operand_count() == 2) {
3701 // Get the two MethodHandle inputs from the Phi.
3702 Value op1 = phi->operand_at(0);
3703 Value op2 = phi->operand_at(1);
3704 ObjectType* op1type = op1->type()->as_ObjectType();
3705 ObjectType* op2type = op2->type()->as_ObjectType();
3707 if (op1type->is_constant() && op2type->is_constant()) {
3708 ciMethodHandle* mh1 = op1type->constant_value()->as_method_handle();
3709 ciMethodHandle* mh2 = op2type->constant_value()->as_method_handle();
3711 // Set the callee to have access to the class and signature in
3712 // the MethodHandleCompiler.
3713 mh1->set_callee(callee);
3714 mh1->set_caller(method());
3715 mh2->set_callee(callee);
3716 mh2->set_caller(method());
3718 // Get adapters for the MethodHandles.
3719 ciMethod* mh1_adapter = mh1->get_method_handle_adapter();
3720 ciMethod* mh2_adapter = mh2->get_method_handle_adapter();
3722 if (mh1_adapter != NULL && mh2_adapter != NULL) {
3723 set_inline_cleanup_info();
3725 // Build the If guard
3726 BlockBegin* one = new BlockBegin(next_bci());
3727 BlockBegin* two = new BlockBegin(next_bci());
3728 BlockBegin* end = new BlockBegin(next_bci());
3729 Instruction* iff = append(new If(phi, If::eql, false, op1, one, two, NULL, false));
3730 block()->set_end(iff->as_BlockEnd());
3732 // Connect up the states
3733 one->merge(block()->end()->state());
3734 two->merge(block()->end()->state());
3736 // Save the state for the second inlinee
3737 ValueStack* state_before = copy_state_before();
3739 // Parse first adapter
3740 _last = _block = one;
3741 if (!try_inline_full(mh1_adapter, /*holder_known=*/ true, end, NULL)) {
3742 restore_inline_cleanup_info();
3743 block()->clear_end(); // remove appended iff
3744 return false;
3745 }
3747 // Parse second adapter
3748 _last = _block = two;
3749 _state = state_before;
3750 if (!try_inline_full(mh2_adapter, /*holder_known=*/ true, end, NULL)) {
3751 restore_inline_cleanup_info();
3752 block()->clear_end(); // remove appended iff
3753 return false;
3754 }
3756 connect_to_end(end);
3757 return true;
3758 }
3759 }
3760 }
3761 }
3762 return false;
3763 }
3766 bool GraphBuilder::for_invokedynamic_inline(ciMethod* callee) {
3767 // Get the MethodHandle from the CallSite.
3768 ciCallSite* call_site = stream()->get_call_site();
3769 ciMethodHandle* method_handle = call_site->get_target();
3771 // Set the callee to have access to the class and signature in the
3772 // MethodHandleCompiler.
3773 method_handle->set_callee(callee);
3774 method_handle->set_caller(method());
3776 // Get an adapter for the MethodHandle.
3777 ciMethod* method_handle_adapter = method_handle->get_invokedynamic_adapter();
3778 if (method_handle_adapter != NULL) {
3779 if (try_inline(method_handle_adapter, /*holder_known=*/ true)) {
3780 // Add a dependence for invalidation of the optimization.
3781 if (!call_site->is_constant_call_site()) {
3782 dependency_recorder()->assert_call_site_target_value(call_site, method_handle);
3783 }
3784 return true;
3785 }
3786 }
3787 return false;
3788 }
3791 void GraphBuilder::inline_bailout(const char* msg) {
3792 assert(msg != NULL, "inline bailout msg must exist");
3793 _inline_bailout_msg = msg;
3794 }
3797 void GraphBuilder::clear_inline_bailout() {
3798 _inline_bailout_msg = NULL;
3799 }
3802 void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) {
3803 ScopeData* data = new ScopeData(NULL);
3804 data->set_scope(scope);
3805 data->set_bci2block(bci2block);
3806 _scope_data = data;
3807 _block = start;
3808 }
3811 void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) {
3812 IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false);
3813 scope()->add_callee(callee_scope);
3815 BlockListBuilder blb(compilation(), callee_scope, -1);
3816 CHECK_BAILOUT();
3818 if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) {
3819 // this scope can be inlined directly into the caller so remove
3820 // the block at bci 0.
3821 blb.bci2block()->at_put(0, NULL);
3822 }
3824 set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci())));
3826 ScopeData* data = new ScopeData(scope_data());
3827 data->set_scope(callee_scope);
3828 data->set_bci2block(blb.bci2block());
3829 data->set_continuation(continuation);
3830 _scope_data = data;
3831 }
3834 void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) {
3835 ScopeData* data = new ScopeData(scope_data());
3836 data->set_parsing_jsr();
3837 data->set_jsr_entry_bci(jsr_dest_bci);
3838 data->set_jsr_return_address_local(-1);
3839 // Must clone bci2block list as we will be mutating it in order to
3840 // properly clone all blocks in jsr region as well as exception
3841 // handlers containing rets
3842 BlockList* new_bci2block = new BlockList(bci2block()->length());
3843 new_bci2block->push_all(bci2block());
3844 data->set_bci2block(new_bci2block);
3845 data->set_scope(scope());
3846 data->setup_jsr_xhandlers();
3847 data->set_continuation(continuation());
3848 data->set_jsr_continuation(jsr_continuation);
3849 _scope_data = data;
3850 }
3853 void GraphBuilder::pop_scope() {
3854 int number_of_locks = scope()->number_of_locks();
3855 _scope_data = scope_data()->parent();
3856 // accumulate minimum number of monitor slots to be reserved
3857 scope()->set_min_number_of_locks(number_of_locks);
3858 }
3861 void GraphBuilder::pop_scope_for_jsr() {
3862 _scope_data = scope_data()->parent();
3863 }
3865 bool GraphBuilder::append_unsafe_get_obj(ciMethod* callee, BasicType t, bool is_volatile) {
3866 if (InlineUnsafeOps) {
3867 Values* args = state()->pop_arguments(callee->arg_size());
3868 null_check(args->at(0));
3869 Instruction* offset = args->at(2);
3870 #ifndef _LP64
3871 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
3872 #endif
3873 Instruction* op = append(new UnsafeGetObject(t, args->at(1), offset, is_volatile));
3874 push(op->type(), op);
3875 compilation()->set_has_unsafe_access(true);
3876 }
3877 return InlineUnsafeOps;
3878 }
3881 bool GraphBuilder::append_unsafe_put_obj(ciMethod* callee, BasicType t, bool is_volatile) {
3882 if (InlineUnsafeOps) {
3883 Values* args = state()->pop_arguments(callee->arg_size());
3884 null_check(args->at(0));
3885 Instruction* offset = args->at(2);
3886 #ifndef _LP64
3887 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
3888 #endif
3889 Instruction* op = append(new UnsafePutObject(t, args->at(1), offset, args->at(3), is_volatile));
3890 compilation()->set_has_unsafe_access(true);
3891 kill_all();
3892 }
3893 return InlineUnsafeOps;
3894 }
3897 bool GraphBuilder::append_unsafe_get_raw(ciMethod* callee, BasicType t) {
3898 if (InlineUnsafeOps) {
3899 Values* args = state()->pop_arguments(callee->arg_size());
3900 null_check(args->at(0));
3901 Instruction* op = append(new UnsafeGetRaw(t, args->at(1), false));
3902 push(op->type(), op);
3903 compilation()->set_has_unsafe_access(true);
3904 }
3905 return InlineUnsafeOps;
3906 }
3909 bool GraphBuilder::append_unsafe_put_raw(ciMethod* callee, BasicType t) {
3910 if (InlineUnsafeOps) {
3911 Values* args = state()->pop_arguments(callee->arg_size());
3912 null_check(args->at(0));
3913 Instruction* op = append(new UnsafePutRaw(t, args->at(1), args->at(2)));
3914 compilation()->set_has_unsafe_access(true);
3915 }
3916 return InlineUnsafeOps;
3917 }
3920 bool GraphBuilder::append_unsafe_prefetch(ciMethod* callee, bool is_static, bool is_store) {
3921 if (InlineUnsafeOps) {
3922 Values* args = state()->pop_arguments(callee->arg_size());
3923 int obj_arg_index = 1; // Assume non-static case
3924 if (is_static) {
3925 obj_arg_index = 0;
3926 } else {
3927 null_check(args->at(0));
3928 }
3929 Instruction* offset = args->at(obj_arg_index + 1);
3930 #ifndef _LP64
3931 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
3932 #endif
3933 Instruction* op = is_store ? append(new UnsafePrefetchWrite(args->at(obj_arg_index), offset))
3934 : append(new UnsafePrefetchRead (args->at(obj_arg_index), offset));
3935 compilation()->set_has_unsafe_access(true);
3936 }
3937 return InlineUnsafeOps;
3938 }
3941 void GraphBuilder::append_unsafe_CAS(ciMethod* callee) {
3942 ValueStack* state_before = copy_state_for_exception();
3943 ValueType* result_type = as_ValueType(callee->return_type());
3944 assert(result_type->is_int(), "int result");
3945 Values* args = state()->pop_arguments(callee->arg_size());
3947 // Pop off some args to speically handle, then push back
3948 Value newval = args->pop();
3949 Value cmpval = args->pop();
3950 Value offset = args->pop();
3951 Value src = args->pop();
3952 Value unsafe_obj = args->pop();
3954 // Separately handle the unsafe arg. It is not needed for code
3955 // generation, but must be null checked
3956 null_check(unsafe_obj);
3958 #ifndef _LP64
3959 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
3960 #endif
3962 args->push(src);
3963 args->push(offset);
3964 args->push(cmpval);
3965 args->push(newval);
3967 // An unsafe CAS can alias with other field accesses, but we don't
3968 // know which ones so mark the state as no preserved. This will
3969 // cause CSE to invalidate memory across it.
3970 bool preserves_state = false;
3971 Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state);
3972 append_split(result);
3973 push(result_type, result);
3974 compilation()->set_has_unsafe_access(true);
3975 }
3978 #ifndef PRODUCT
3979 void GraphBuilder::print_inline_result(ciMethod* callee, bool res) {
3980 CompileTask::print_inlining(callee, scope()->level(), bci(), _inline_bailout_msg);
3981 if (res && CIPrintMethodCodes) {
3982 callee->print_codes();
3983 }
3984 }
3987 void GraphBuilder::print_stats() {
3988 vmap()->print();
3989 }
3990 #endif // PRODUCT
3992 void GraphBuilder::profile_call(Value recv, ciKlass* known_holder) {
3993 append(new ProfileCall(method(), bci(), recv, known_holder));
3994 }
3996 void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) {
3997 append(new ProfileInvoke(callee, state));
3998 }