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