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