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