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