2
* Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
3
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
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.
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).
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.
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
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 "ci/ciSymbols.hpp"
36
#include "ci/ciUtilities.inline.hpp"
37
#include "classfile/javaClasses.hpp"
38
#include "compiler/compilationPolicy.hpp"
39
#include "compiler/compileBroker.hpp"
40
#include "compiler/compilerEvent.hpp"
41
#include "interpreter/bytecode.hpp"
42
#include "jfr/jfrEvents.hpp"
43
#include "memory/resourceArea.hpp"
44
#include "oops/oop.inline.hpp"
45
#include "runtime/sharedRuntime.hpp"
46
#include "runtime/vm_version.hpp"
47
#include "utilities/bitMap.inline.hpp"
48
#include "utilities/checkedCast.hpp"
49
#include "utilities/powerOfTwo.hpp"
50
#include "utilities/macros.hpp"
55
class BlockListBuilder {57
Compilation* _compilation;
60
BlockList _blocks; // internal list of all blocks
61
BlockList* _bci2block; // mapping from bci to blocks for GraphBuilder
62
GrowableArray<BlockList> _bci2block_successors; // Mapping bcis to their blocks successors while we dont have a blockend
64
// fields used by mark_loops
65
ResourceBitMap _active; // for iteration of control flow graph
66
ResourceBitMap _visited; // for iteration of control flow graph
67
GrowableArray<ResourceBitMap> _loop_map; // caches the information if a block is contained in a loop
68
int _next_loop_index; // next free loop number
69
int _next_block_number; // for reverse postorder numbering of blocks
72
int bit_number(int block_id) const { return block_id - _block_id_start; }74
Compilation* compilation() const { return _compilation; }75
IRScope* scope() const { return _scope; }76
ciMethod* method() const { return scope()->method(); }77
XHandlers* xhandlers() const { return scope()->xhandlers(); }79
// unified bailout support
80
void bailout(const char* msg) const { compilation()->bailout(msg); }81
bool bailed_out() const { return compilation()->bailed_out(); }84
BlockBegin* make_block_at(int bci, BlockBegin* predecessor);
85
void handle_exceptions(BlockBegin* current, int cur_bci);
86
void handle_jsr(BlockBegin* current, int sr_bci, int next_bci);
87
void store_one(BlockBegin* current, int local);
88
void store_two(BlockBegin* current, int local);
89
void set_entries(int osr_bci);
92
void make_loop_header(BlockBegin* block);
94
BitMap& mark_loops(BlockBegin* b, bool in_subroutine);
101
int number_of_successors(BlockBegin* block);
102
BlockBegin* successor_at(BlockBegin* block, int i);
103
void add_successor(BlockBegin* block, BlockBegin* sux);
104
bool is_successor(BlockBegin* block, BlockBegin* sux);
108
BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci);
110
// accessors for GraphBuilder
111
BlockList* bci2block() const { return _bci2block; }115
// Implementation of BlockListBuilder
117
BlockListBuilder::BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci)
118
: _compilation(compilation)
121
, _bci2block(new BlockList(scope->method()->code_size(), nullptr))
122
, _bci2block_successors(scope->method()->code_size())
123
, _active() // size not known yet
124
, _visited() // size not known yet
125
, _loop_map() // size not known yet
126
, _next_loop_index(0)
127
, _next_block_number(0)
130
set_entries(osr_bci);
135
NOT_PRODUCT(if (PrintInitialBlockList) print());
137
// _bci2block still contains blocks with _end == null and > 0 sux in _bci2block_successors.
140
if (PrintCFGToFile) {142
title.print("BlockListBuilder ");143
scope->method()->print_name(&title);
144
CFGPrinter::print_cfg(_bci2block, title.freeze(), false, false);
150
void BlockListBuilder::set_entries(int osr_bci) {151
// generate start blocks
152
BlockBegin* std_entry = make_block_at(0, nullptr);
153
if (scope()->caller() == nullptr) {154
std_entry->set(BlockBegin::std_entry_flag);
157
BlockBegin* osr_entry = make_block_at(osr_bci, nullptr);
158
osr_entry->set(BlockBegin::osr_entry_flag);
161
// generate exception entry blocks
162
XHandlers* list = xhandlers();
163
const int n = list->length();
164
for (int i = 0; i < n; i++) {165
XHandler* h = list->handler_at(i);
166
BlockBegin* entry = make_block_at(h->handler_bci(), nullptr);
167
entry->set(BlockBegin::exception_entry_flag);
168
h->set_entry_block(entry);
173
BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) {174
assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer");
176
BlockBegin* block = _bci2block->at(cur_bci);
177
if (block == nullptr) {178
block = new BlockBegin(cur_bci);
179
block->init_stores_to_locals(method()->max_locals());
180
_bci2block->at_put(cur_bci, block);
181
_bci2block_successors.at_put_grow(cur_bci, BlockList());
182
_blocks.append(block);
184
assert(predecessor == nullptr || predecessor->bci() < cur_bci, "targets for backward branches must already exist");
187
if (predecessor != nullptr) {188
if (block->is_set(BlockBegin::exception_entry_flag)) {189
BAILOUT_("Exception handler can be reached by both normal and exceptional control flow", block);192
add_successor(predecessor, block);
193
block->increment_total_preds();
200
inline void BlockListBuilder::store_one(BlockBegin* current, int local) {201
current->stores_to_locals().set_bit(local);
203
inline void BlockListBuilder::store_two(BlockBegin* current, int local) {204
store_one(current, local);
205
store_one(current, local + 1);
209
void BlockListBuilder::handle_exceptions(BlockBegin* current, int cur_bci) {210
// Draws edges from a block to its exception handlers
211
XHandlers* list = xhandlers();
212
const int n = list->length();
214
for (int i = 0; i < n; i++) {215
XHandler* h = list->handler_at(i);
217
if (h->covers(cur_bci)) {218
BlockBegin* entry = h->entry_block();
219
assert(entry != nullptr && entry == _bci2block->at(h->handler_bci()), "entry must be set");
220
assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set");
222
// add each exception handler only once
223
if(!is_successor(current, entry)) {224
add_successor(current, entry);
225
entry->increment_total_preds();
228
// stop when reaching catchall
229
if (h->catch_type() == 0) break;
234
void BlockListBuilder::handle_jsr(BlockBegin* current, int sr_bci, int next_bci) {235
if (next_bci < method()->code_size()) {236
// start a new block after jsr-bytecode and link this block into cfg
237
make_block_at(next_bci, current);
240
// start a new block at the subroutine entry at mark it with special flag
241
BlockBegin* sr_block = make_block_at(sr_bci, current);
242
if (!sr_block->is_set(BlockBegin::subroutine_entry_flag)) {243
sr_block->set(BlockBegin::subroutine_entry_flag);
248
void BlockListBuilder::set_leaders() {249
bool has_xhandlers = xhandlers()->has_handlers();
250
BlockBegin* current = nullptr;
252
// The information which bci starts a new block simplifies the analysis
253
// Without it, backward branches could jump to a bci where no block was created
254
// during bytecode iteration. This would require the creation of a new block at the
255
// branch target and a modification of the successor lists.
256
const BitMap& bci_block_start = method()->bci_block_start();
258
int end_bci = method()->code_size();
260
ciBytecodeStream s(method());
261
while (s.next() != ciBytecodeStream::EOBC()) {262
int cur_bci = s.cur_bci();
264
if (bci_block_start.at(cur_bci)) {265
current = make_block_at(cur_bci, current);
267
assert(current != nullptr, "must have current block");
269
if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) {270
handle_exceptions(current, cur_bci);
273
switch (s.cur_bc()) {274
// track stores to local variables for selective creation of phi functions
275
case Bytecodes::_iinc: store_one(current, s.get_index()); break;
276
case Bytecodes::_istore: store_one(current, s.get_index()); break;
277
case Bytecodes::_lstore: store_two(current, s.get_index()); break;
278
case Bytecodes::_fstore: store_one(current, s.get_index()); break;
279
case Bytecodes::_dstore: store_two(current, s.get_index()); break;
280
case Bytecodes::_astore: store_one(current, s.get_index()); break;
281
case Bytecodes::_istore_0: store_one(current, 0); break;
282
case Bytecodes::_istore_1: store_one(current, 1); break;
283
case Bytecodes::_istore_2: store_one(current, 2); break;
284
case Bytecodes::_istore_3: store_one(current, 3); break;
285
case Bytecodes::_lstore_0: store_two(current, 0); break;
286
case Bytecodes::_lstore_1: store_two(current, 1); break;
287
case Bytecodes::_lstore_2: store_two(current, 2); break;
288
case Bytecodes::_lstore_3: store_two(current, 3); break;
289
case Bytecodes::_fstore_0: store_one(current, 0); break;
290
case Bytecodes::_fstore_1: store_one(current, 1); break;
291
case Bytecodes::_fstore_2: store_one(current, 2); break;
292
case Bytecodes::_fstore_3: store_one(current, 3); break;
293
case Bytecodes::_dstore_0: store_two(current, 0); break;
294
case Bytecodes::_dstore_1: store_two(current, 1); break;
295
case Bytecodes::_dstore_2: store_two(current, 2); break;
296
case Bytecodes::_dstore_3: store_two(current, 3); break;
297
case Bytecodes::_astore_0: store_one(current, 0); break;
298
case Bytecodes::_astore_1: store_one(current, 1); break;
299
case Bytecodes::_astore_2: store_one(current, 2); break;
300
case Bytecodes::_astore_3: store_one(current, 3); break;
302
// track bytecodes that affect the control flow
303
case Bytecodes::_athrow: // fall through
304
case Bytecodes::_ret: // fall through
305
case Bytecodes::_ireturn: // fall through
306
case Bytecodes::_lreturn: // fall through
307
case Bytecodes::_freturn: // fall through
308
case Bytecodes::_dreturn: // fall through
309
case Bytecodes::_areturn: // fall through
310
case Bytecodes::_return:
314
case Bytecodes::_ifeq: // fall through
315
case Bytecodes::_ifne: // fall through
316
case Bytecodes::_iflt: // fall through
317
case Bytecodes::_ifge: // fall through
318
case Bytecodes::_ifgt: // fall through
319
case Bytecodes::_ifle: // fall through
320
case Bytecodes::_if_icmpeq: // fall through
321
case Bytecodes::_if_icmpne: // fall through
322
case Bytecodes::_if_icmplt: // fall through
323
case Bytecodes::_if_icmpge: // fall through
324
case Bytecodes::_if_icmpgt: // fall through
325
case Bytecodes::_if_icmple: // fall through
326
case Bytecodes::_if_acmpeq: // fall through
327
case Bytecodes::_if_acmpne: // fall through
328
case Bytecodes::_ifnull: // fall through
329
case Bytecodes::_ifnonnull:
330
if (s.next_bci() < end_bci) {331
make_block_at(s.next_bci(), current);
333
make_block_at(s.get_dest(), current);
337
case Bytecodes::_goto:
338
make_block_at(s.get_dest(), current);
342
case Bytecodes::_goto_w:
343
make_block_at(s.get_far_dest(), current);
347
case Bytecodes::_jsr:
348
handle_jsr(current, s.get_dest(), s.next_bci());
352
case Bytecodes::_jsr_w:
353
handle_jsr(current, s.get_far_dest(), s.next_bci());
357
case Bytecodes::_tableswitch: {358
// set block for each case
359
Bytecode_tableswitch sw(&s);
361
for (int i = 0; i < l; i++) {362
make_block_at(cur_bci + sw.dest_offset_at(i), current);
364
make_block_at(cur_bci + sw.default_offset(), current);
369
case Bytecodes::_lookupswitch: {370
// set block for each case
371
Bytecode_lookupswitch sw(&s);
372
int l = sw.number_of_pairs();
373
for (int i = 0; i < l; i++) {374
make_block_at(cur_bci + sw.pair_at(i).offset(), current);
376
make_block_at(cur_bci + sw.default_offset(), current);
388
void BlockListBuilder::mark_loops() {391
const int number_of_blocks = _blocks.length();
392
_active.initialize(number_of_blocks);
393
_visited.initialize(number_of_blocks);
394
_loop_map = GrowableArray<ResourceBitMap>(number_of_blocks, number_of_blocks, ResourceBitMap());
395
for (int i = 0; i < number_of_blocks; i++) {396
_loop_map.at(i).initialize(number_of_blocks);
398
_next_loop_index = 0;
399
_next_block_number = _blocks.length();
401
// The loop detection algorithm works as follows:
402
// - We maintain the _loop_map, where for each block we have a bitmap indicating which loops contain this block.
403
// - The CFG is recursively traversed (depth-first) and if we detect a loop, we assign the loop a unique number that is stored
404
// in the bitmap associated with the loop header block. Until we return back through that loop header the bitmap contains
405
// only a single bit corresponding to the loop number.
406
// - The bit is then propagated for all the blocks in the loop after we exit them (post-order). There could be multiple bits
407
// of course in case of nested loops.
408
// - When we exit the loop header we remove that single bit and assign the real loop state for it.
409
// - Now, the tricky part here is how we detect irreducible loops. In the algorithm above the loop state bits
410
// are propagated to the predecessors. If we encounter an irreducible loop (a loop with multiple heads) we would see
411
// a node with some loop bit set that would then propagate back and be never cleared because we would
412
// never go back through the original loop header. Therefore if there are any irreducible loops the bits in the states
413
// for these loops are going to propagate back to the root.
414
BlockBegin* start = _bci2block->at(0);
415
_block_id_start = start->block_id();
416
BitMap& loop_state = mark_loops(start, false);
417
if (!loop_state.is_empty()) {418
compilation()->set_has_irreducible_loops(true);
420
assert(_next_block_number >= 0, "invalid block numbers");
422
// Remove dangling Resource pointers before the ResourceMark goes out-of-scope.
428
void BlockListBuilder::make_loop_header(BlockBegin* block) {429
int block_id = block->block_id();
430
int block_bit = bit_number(block_id);
431
if (block->is_set(BlockBegin::exception_entry_flag)) {432
// exception edges may look like loops but don't mark them as such
433
// since it screws up block ordering.
436
if (!block->is_set(BlockBegin::parser_loop_header_flag)) {437
block->set(BlockBegin::parser_loop_header_flag);
439
assert(_loop_map.at(block_bit).is_empty(), "must not be set yet");
440
assert(0 <= _next_loop_index && _next_loop_index < _loop_map.length(), "_next_loop_index is too large");
441
_loop_map.at(block_bit).set_bit(_next_loop_index++);
443
// block already marked as loop header
444
assert(_loop_map.at(block_bit).count_one_bits() == 1, "exactly one bit must be set");
448
BitMap& BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) {449
int block_id = block->block_id();
450
int block_bit = bit_number(block_id);
451
if (_visited.at(block_bit)) {452
if (_active.at(block_bit)) {453
// reached block via backward branch
454
make_loop_header(block);
456
// return cached loop information for this block
457
return _loop_map.at(block_bit);
460
if (block->is_set(BlockBegin::subroutine_entry_flag)) {461
in_subroutine = true;
464
// set active and visited bits before successors are processed
465
_visited.set_bit(block_bit);
466
_active.set_bit(block_bit);
469
ResourceBitMap loop_state(_loop_map.length());
470
for (int i = number_of_successors(block) - 1; i >= 0; i--) {471
BlockBegin* sux = successor_at(block, i);
472
// recursively process all successors
473
loop_state.set_union(mark_loops(sux, in_subroutine));
476
// clear active-bit after all successors are processed
477
_active.clear_bit(block_bit);
479
// reverse-post-order numbering of all blocks
480
block->set_depth_first_number(_next_block_number);
481
_next_block_number--;
483
if (!loop_state.is_empty() || in_subroutine ) {484
// block is contained at least in one loop, so phi functions are necessary
485
// phi functions are also necessary for all locals stored in a subroutine
486
scope()->requires_phi_function().set_union(block->stores_to_locals());
489
if (block->is_set(BlockBegin::parser_loop_header_flag)) {490
BitMap& header_loop_state = _loop_map.at(block_bit);
491
assert(header_loop_state.count_one_bits() == 1, "exactly one bit must be set");
492
// remove the bit with the loop number for the state (header is outside of the loop)
493
loop_state.set_difference(header_loop_state);
496
// cache and return loop information for this block
497
_loop_map.at(block_bit).set_from(loop_state);
498
return _loop_map.at(block_bit);
501
inline int BlockListBuilder::number_of_successors(BlockBegin* block)
503
assert(_bci2block_successors.length() > block->bci(), "sux must exist");
504
return _bci2block_successors.at(block->bci()).length();
507
inline BlockBegin* BlockListBuilder::successor_at(BlockBegin* block, int i)
509
assert(_bci2block_successors.length() > block->bci(), "sux must exist");
510
return _bci2block_successors.at(block->bci()).at(i);
513
inline void BlockListBuilder::add_successor(BlockBegin* block, BlockBegin* sux)
515
assert(_bci2block_successors.length() > block->bci(), "sux must exist");
516
_bci2block_successors.at(block->bci()).append(sux);
519
inline bool BlockListBuilder::is_successor(BlockBegin* block, BlockBegin* sux) {520
assert(_bci2block_successors.length() > block->bci(), "sux must exist");
521
return _bci2block_successors.at(block->bci()).contains(sux);
526
static int compare_depth_first(BlockBegin** a, BlockBegin** b) {527
return (*a)->depth_first_number() - (*b)->depth_first_number();
530
void BlockListBuilder::print() {531
tty->print("----- initial block list of BlockListBuilder for method ");532
method()->print_short_name();
535
// better readability if blocks are sorted in processing order
536
_blocks.sort(compare_depth_first);
538
for (int i = 0; i < _blocks.length(); i++) {539
BlockBegin* cur = _blocks.at(i);
540
tty->print("%4d: B%-4d bci: %-4d preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds());542
tty->print(cur->is_set(BlockBegin::std_entry_flag) ? " std" : " ");
543
tty->print(cur->is_set(BlockBegin::osr_entry_flag) ? " osr" : " ");
544
tty->print(cur->is_set(BlockBegin::exception_entry_flag) ? " ex" : " ");
545
tty->print(cur->is_set(BlockBegin::subroutine_entry_flag) ? " sr" : " ");
546
tty->print(cur->is_set(BlockBegin::parser_loop_header_flag) ? " lh" : " ");
548
if (number_of_successors(cur) > 0) {549
tty->print(" sux: ");550
for (int j = 0; j < number_of_successors(cur); j++) {551
BlockBegin* sux = successor_at(cur, j);
552
tty->print("B%d ", sux->block_id());562
// A simple growable array of Values indexed by ciFields
563
class FieldBuffer: public CompilationResourceObj {565
GrowableArray<Value> _values;
574
Value at(ciField* field) {575
assert(field->holder()->is_loaded(), "must be a loaded field");
576
int offset = field->offset_in_bytes();
577
if (offset < _values.length()) {578
return _values.at(offset);
584
void at_put(ciField* field, Value value) {585
assert(field->holder()->is_loaded(), "must be a loaded field");
586
int offset = field->offset_in_bytes();
587
_values.at_put_grow(offset, value, nullptr);
593
// MemoryBuffer is fairly simple model of the current state of memory.
594
// It partitions memory into several pieces. The first piece is
595
// generic memory where little is known about the owner of the memory.
596
// This is conceptually represented by the tuple <O, F, V> which says
597
// that the field F of object O has value V. This is flattened so
598
// that F is represented by the offset of the field and the parallel
599
// arrays _objects and _values are used for O and V. Loads of O.F can
600
// simply use V. Newly allocated objects are kept in a separate list
601
// along with a parallel array for each object which represents the
602
// current value of its fields. Stores of the default value to fields
603
// which have never been stored to before are eliminated since they
604
// are redundant. Once newly allocated objects are stored into
605
// another object or they are passed out of the current compile they
606
// are treated like generic memory.
608
class MemoryBuffer: public CompilationResourceObj {611
GrowableArray<Value> _objects;
612
GrowableArray<Value> _newobjects;
613
GrowableArray<FieldBuffer*> _fields;
618
StoreField* store(StoreField* st) {619
if (!EliminateFieldAccess) {623
Value object = st->obj();
624
Value value = st->value();
625
ciField* field = st->field();
626
if (field->holder()->is_loaded()) {627
int offset = field->offset_in_bytes();
628
int index = _newobjects.find(object);
630
// newly allocated object with no other stores performed on this field
631
FieldBuffer* buf = _fields.at(index);
632
if (buf->at(field) == nullptr && is_default_value(value)) {634
if (PrintIRDuringConstruction && Verbose) {635
tty->print_cr("Eliminated store for object %d:", index);641
buf->at_put(field, value);
644
_objects.at_put_grow(offset, object, nullptr);
645
_values.at_put(field, value);
650
// if we held onto field names we could alias based on names but
651
// we don't know what's being stored to so kill it all.
658
// return true if this value correspond to the default value of a field.
659
bool is_default_value(Value value) {660
Constant* con = value->as_Constant();
662
switch (con->type()->tag()) {663
case intTag: return con->type()->as_IntConstant()->value() == 0;
664
case longTag: return con->type()->as_LongConstant()->value() == 0;
665
case floatTag: return jint_cast(con->type()->as_FloatConstant()->value()) == 0;
666
case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0);
667
case objectTag: return con->type() == objectNull;
668
default: ShouldNotReachHere();
675
// return either the actual value of a load or the load itself
676
Value load(LoadField* load) {677
if (!EliminateFieldAccess) {681
if (strict_fp_requires_explicit_rounding && load->type()->is_float_kind()) {684
// can't skip load since value might get rounded as a side effect
692
ciField* field = load->field();
693
Value object = load->obj();
694
if (field->holder()->is_loaded() && !field->is_volatile()) {695
int offset = field->offset_in_bytes();
696
Value result = nullptr;
697
int index = _newobjects.find(object);
699
result = _fields.at(index)->at(field);
700
} else if (_objects.at_grow(offset, nullptr) == object) {701
result = _values.at(field);
703
if (result != nullptr) {705
if (PrintIRDuringConstruction && Verbose) {706
tty->print_cr("Eliminated load: ");710
assert(result->type()->tag() == load->type()->tag(), "wrong types");
717
// Record this newly allocated object
718
void new_instance(NewInstance* object) {719
int index = _newobjects.length();
720
_newobjects.append(object);
721
if (_fields.at_grow(index, nullptr) == nullptr) {722
_fields.at_put(index, new FieldBuffer());
724
_fields.at(index)->kill();
728
void store_value(Value value) {729
int index = _newobjects.find(value);
731
// stored a newly allocated object into another object.
732
// Assume we've lost track of it as separate slice of memory.
733
// We could do better by keeping track of whether individual
734
// fields could alias each other.
735
_newobjects.remove_at(index);
736
// pull out the field info and store it at the end up the list
737
// of field info list to be reused later.
738
_fields.append(_fields.at(index));
739
_fields.remove_at(index);
744
_newobjects.trunc_to(0);
745
_objects.trunc_to(0);
751
// Implementation of GraphBuilder's ScopeData
753
GraphBuilder::ScopeData::ScopeData(ScopeData* parent)
755
, _bci2block(nullptr)
757
, _has_handler(false)
759
, _work_list(nullptr)
760
, _caller_stack_size(-1)
761
, _continuation(nullptr)
762
, _parsing_jsr(false)
763
, _jsr_xhandlers(nullptr)
765
, _cleanup_block(nullptr)
766
, _cleanup_return_prev(nullptr)
767
, _cleanup_state(nullptr)
768
, _ignore_return(false)
770
if (parent != nullptr) {771
_max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f);
773
_max_inline_size = C1MaxInlineSize;
775
if (_max_inline_size < C1MaxTrivialSize) {776
_max_inline_size = C1MaxTrivialSize;
781
void GraphBuilder::kill_all() {782
if (UseLocalValueNumbering) {789
BlockBegin* GraphBuilder::ScopeData::block_at(int bci) {791
// It is necessary to clone all blocks associated with a
792
// subroutine, including those for exception handlers in the scope
793
// of the method containing the jsr (because those exception
794
// handlers may contain ret instructions in some cases).
795
BlockBegin* block = bci2block()->at(bci);
796
if (block != nullptr && block == parent()->bci2block()->at(bci)) {797
BlockBegin* new_block = new BlockBegin(block->bci());
798
if (PrintInitialBlockList) {799
tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr",800
block->block_id(), block->bci(), new_block->block_id());
802
// copy data from cloned blocked
803
new_block->set_depth_first_number(block->depth_first_number());
804
if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag);
805
// Preserve certain flags for assertion checking
806
if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag);
807
if (block->is_set(BlockBegin::exception_entry_flag)) new_block->set(BlockBegin::exception_entry_flag);
809
// copy was_visited_flag to allow early detection of bailouts
810
// if a block that is used in a jsr has already been visited before,
811
// it is shared between the normal control flow and a subroutine
812
// BlockBegin::try_merge returns false when the flag is set, this leads
813
// to a compilation bailout
814
if (block->is_set(BlockBegin::was_visited_flag)) new_block->set(BlockBegin::was_visited_flag);
816
bci2block()->at_put(bci, new_block);
821
return bci2block()->at(bci);
826
XHandlers* GraphBuilder::ScopeData::xhandlers() const {827
if (_jsr_xhandlers == nullptr) {828
assert(!parsing_jsr(), "");
829
return scope()->xhandlers();
831
assert(parsing_jsr(), "");
832
return _jsr_xhandlers;
836
void GraphBuilder::ScopeData::set_scope(IRScope* scope) {838
bool parent_has_handler = false;
839
if (parent() != nullptr) {840
parent_has_handler = parent()->has_handler();
842
_has_handler = parent_has_handler || scope->xhandlers()->has_handlers();
846
void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block,
847
Instruction* return_prev,
848
ValueStack* return_state) {849
_cleanup_block = block;
850
_cleanup_return_prev = return_prev;
851
_cleanup_state = return_state;
855
void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) {856
if (_work_list == nullptr) {857
_work_list = new BlockList();
860
if (!block->is_set(BlockBegin::is_on_work_list_flag)) {861
// Do not start parsing the continuation block while in a
864
if (block == jsr_continuation()) {868
if (block == continuation()) {872
block->set(BlockBegin::is_on_work_list_flag);
873
_work_list->push(block);
875
sort_top_into_worklist(_work_list, block);
880
void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) {881
assert(worklist->top() == top, "");
882
// sort block descending into work list
883
const int dfn = top->depth_first_number();
884
assert(dfn != -1, "unknown depth first number");
885
int i = worklist->length()-2;
887
BlockBegin* b = worklist->at(i);
888
if (b->depth_first_number() < dfn) {889
worklist->at_put(i+1, b);
895
if (i >= -1) worklist->at_put(i + 1, top);
899
BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() {900
if (is_work_list_empty()) {903
return _work_list->pop();
907
bool GraphBuilder::ScopeData::is_work_list_empty() const {908
return (_work_list == nullptr || _work_list->length() == 0);
912
void GraphBuilder::ScopeData::setup_jsr_xhandlers() {913
assert(parsing_jsr(), "");
914
// clone all the exception handlers from the scope
915
XHandlers* handlers = new XHandlers(scope()->xhandlers());
916
const int n = handlers->length();
917
for (int i = 0; i < n; i++) {918
// The XHandlers need to be adjusted to dispatch to the cloned
919
// handler block instead of the default one but the synthetic
920
// unlocker needs to be handled specially. The synthetic unlocker
921
// should be left alone since there can be only one and all code
922
// should dispatch to the same one.
923
XHandler* h = handlers->handler_at(i);
924
assert(h->handler_bci() != SynchronizationEntryBCI, "must be real");
925
h->set_entry_block(block_at(h->handler_bci()));
927
_jsr_xhandlers = handlers;
931
int GraphBuilder::ScopeData::num_returns() {933
return parent()->num_returns();
939
void GraphBuilder::ScopeData::incr_num_returns() {941
parent()->incr_num_returns();
948
// Implementation of GraphBuilder
950
#define INLINE_BAILOUT(msg) { inline_bailout(msg); return false; }953
void GraphBuilder::load_constant() {954
ciConstant con = stream()->get_constant();
955
if (con.is_valid()) {956
ValueType* t = illegalType;
957
ValueStack* patch_state = nullptr;
958
switch (con.basic_type()) {959
case T_BOOLEAN: t = new IntConstant (con.as_boolean()); break;
960
case T_BYTE : t = new IntConstant (con.as_byte ()); break;
961
case T_CHAR : t = new IntConstant (con.as_char ()); break;
962
case T_SHORT : t = new IntConstant (con.as_short ()); break;
963
case T_INT : t = new IntConstant (con.as_int ()); break;
964
case T_LONG : t = new LongConstant (con.as_long ()); break;
965
case T_FLOAT : t = new FloatConstant (con.as_float ()); break;
966
case T_DOUBLE : t = new DoubleConstant(con.as_double ()); break;
967
case T_ARRAY : // fall-through
969
ciObject* obj = con.as_object();
970
if (!obj->is_loaded() || (PatchALot && !stream()->is_string_constant())) {971
// A Class, MethodType, MethodHandle, Dynamic, or String.
972
patch_state = copy_state_before();
973
t = new ObjectConstant(obj);
975
// Might be a Class, MethodType, MethodHandle, or Dynamic constant
976
// result, which might turn out to be an array.
977
if (obj->is_null_object()) {979
} else if (obj->is_array()) {980
t = new ArrayConstant(obj->as_array());
982
t = new InstanceConstant(obj->as_instance());
987
default: ShouldNotReachHere();
990
if (patch_state != nullptr) {991
// Arbitrary memory effects from running BSM or class loading (using custom loader) during linkage.
992
bool kills_memory = stream()->is_dynamic_constant() ||
993
(!stream()->is_string_constant() && !method()->holder()->has_trusted_loader());
994
x = new Constant(t, patch_state, kills_memory);
999
// Unbox the value at runtime, if needed.
1000
// ConstantDynamic entry can be of a primitive type, but it is cached in boxed form.
1001
if (patch_state != nullptr) {1002
int cp_index = stream()->get_constant_pool_index();
1003
BasicType type = stream()->get_basic_type_for_constant_at(cp_index);
1004
if (is_java_primitive(type)) {1005
ciInstanceKlass* box_klass = ciEnv::current()->get_box_klass_for_primitive_type(type);
1006
assert(box_klass->is_loaded(), "sanity");
1007
int offset = java_lang_boxing_object::value_offset(type);
1008
ciField* value_field = box_klass->get_field_by_offset(offset, false /*is_static*/);
1009
x = new LoadField(append(x), offset, value_field, false /*is_static*/, patch_state, false /*needs_patching*/);
1010
t = as_ValueType(type);
1012
assert(is_reference_type(type), "not a reference: %s", type2name(type));
1018
BAILOUT("could not resolve a constant");1023
void GraphBuilder::load_local(ValueType* type, int index) {1024
Value x = state()->local_at(index);
1025
assert(x != nullptr && !x->type()->is_illegal(), "access of illegal local variable");
1030
void GraphBuilder::store_local(ValueType* type, int index) {1031
Value x = pop(type);
1032
store_local(state(), x, index);
1036
void GraphBuilder::store_local(ValueStack* state, Value x, int index) {1037
if (parsing_jsr()) {1038
// We need to do additional tracking of the location of the return
1039
// address for jsrs since we don't handle arbitrary jsr/ret
1040
// constructs. Here we are figuring out in which circumstances we
1041
// need to bail out.
1042
if (x->type()->is_address()) {1043
scope_data()->set_jsr_return_address_local(index);
1045
// Also check parent jsrs (if any) at this time to see whether
1046
// they are using this local. We don't handle skipping over a
1048
for (ScopeData* cur_scope_data = scope_data()->parent();
1049
cur_scope_data != nullptr && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1050
cur_scope_data = cur_scope_data->parent()) {1051
if (cur_scope_data->jsr_return_address_local() == index) {1052
BAILOUT("subroutine overwrites return address from previous subroutine");1055
} else if (index == scope_data()->jsr_return_address_local()) {1056
scope_data()->set_jsr_return_address_local(-1);
1060
state->store_local(index, round_fp(x));
1064
void GraphBuilder::load_indexed(BasicType type) {1065
// In case of in block code motion in range check elimination
1066
ValueStack* state_before = copy_state_indexed_access();
1067
compilation()->set_has_access_indexed(true);
1068
Value index = ipop();
1069
Value array = apop();
1070
Value length = nullptr;
1071
if (CSEArrayLength ||
1072
(array->as_Constant() != nullptr) ||
1073
(array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1074
(array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1075
(array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {1076
length = append(new ArrayLength(array, state_before));
1078
push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before)));
1082
void GraphBuilder::store_indexed(BasicType type) {1083
// In case of in block code motion in range check elimination
1084
ValueStack* state_before = copy_state_indexed_access();
1085
compilation()->set_has_access_indexed(true);
1086
Value value = pop(as_ValueType(type));
1087
Value index = ipop();
1088
Value array = apop();
1089
Value length = nullptr;
1090
if (CSEArrayLength ||
1091
(array->as_Constant() != nullptr) ||
1092
(array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1093
(array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1094
(array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {1095
length = append(new ArrayLength(array, state_before));
1097
ciType* array_type = array->declared_type();
1098
bool check_boolean = false;
1099
if (array_type != nullptr) {1100
if (array_type->is_loaded() &&
1101
array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {1102
assert(type == T_BYTE, "boolean store uses bastore");
1103
Value mask = append(new Constant(new IntConstant(1)));
1104
value = append(new LogicOp(Bytecodes::_iand, value, mask));
1106
} else if (type == T_BYTE) {1107
check_boolean = true;
1109
StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
1111
_memory->store_value(value);
1113
if (type == T_OBJECT && is_profiling()) {1114
// Note that we'd collect profile data in this method if we wanted it.
1115
compilation()->set_would_profile(true);
1117
if (profile_checkcasts()) {1118
result->set_profiled_method(method());
1119
result->set_profiled_bci(bci());
1120
result->set_should_profile(true);
1126
void GraphBuilder::stack_op(Bytecodes::Code code) {1128
case Bytecodes::_pop:
1129
{ state()->raw_pop();1132
case Bytecodes::_pop2:
1133
{ state()->raw_pop();1137
case Bytecodes::_dup:
1138
{ Value w = state()->raw_pop();1139
state()->raw_push(w);
1140
state()->raw_push(w);
1143
case Bytecodes::_dup_x1:
1144
{ Value w1 = state()->raw_pop();1145
Value w2 = state()->raw_pop();
1146
state()->raw_push(w1);
1147
state()->raw_push(w2);
1148
state()->raw_push(w1);
1151
case Bytecodes::_dup_x2:
1152
{ Value w1 = state()->raw_pop();1153
Value w2 = state()->raw_pop();
1154
Value w3 = state()->raw_pop();
1155
state()->raw_push(w1);
1156
state()->raw_push(w3);
1157
state()->raw_push(w2);
1158
state()->raw_push(w1);
1161
case Bytecodes::_dup2:
1162
{ Value w1 = state()->raw_pop();1163
Value w2 = state()->raw_pop();
1164
state()->raw_push(w2);
1165
state()->raw_push(w1);
1166
state()->raw_push(w2);
1167
state()->raw_push(w1);
1170
case Bytecodes::_dup2_x1:
1171
{ Value w1 = state()->raw_pop();1172
Value w2 = state()->raw_pop();
1173
Value w3 = state()->raw_pop();
1174
state()->raw_push(w2);
1175
state()->raw_push(w1);
1176
state()->raw_push(w3);
1177
state()->raw_push(w2);
1178
state()->raw_push(w1);
1181
case Bytecodes::_dup2_x2:
1182
{ Value w1 = state()->raw_pop();1183
Value w2 = state()->raw_pop();
1184
Value w3 = state()->raw_pop();
1185
Value w4 = state()->raw_pop();
1186
state()->raw_push(w2);
1187
state()->raw_push(w1);
1188
state()->raw_push(w4);
1189
state()->raw_push(w3);
1190
state()->raw_push(w2);
1191
state()->raw_push(w1);
1194
case Bytecodes::_swap:
1195
{ Value w1 = state()->raw_pop();1196
Value w2 = state()->raw_pop();
1197
state()->raw_push(w1);
1198
state()->raw_push(w2);
1202
ShouldNotReachHere();
1208
void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) {1209
Value y = pop(type);
1210
Value x = pop(type);
1211
Value res = new ArithmeticOp(code, x, y, state_before);
1212
// Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level
1214
res = round_fp(res);
1219
void GraphBuilder::negate_op(ValueType* type) {1220
push(type, append(new NegateOp(pop(type))));
1224
void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) {1226
Value x = pop(type);
1228
// Note: This code should go into the canonicalizer as soon as it can
1229
// can handle canonicalized forms that contain more than one node.
1230
if (CanonicalizeNodes && code == Bytecodes::_iushr) {1232
IntConstant* s1 = s->type()->as_IntConstant();
1233
if (s1 != nullptr) {1234
// pattern: x >>> s1, with s1 constant
1235
ShiftOp* l = x->as_ShiftOp();
1236
if (l != nullptr && l->op() == Bytecodes::_ishl) {1237
// pattern: (a << b) >>> s1
1238
IntConstant* s0 = l->y()->type()->as_IntConstant();
1239
if (s0 != nullptr) {1240
// pattern: (a << s0) >>> s1
1241
const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts
1242
const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts
1245
// pattern: (a << 0) >>> 0 => simplify to: a
1248
// pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant
1249
assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases");
1250
const int m = checked_cast<int>(right_n_bits(BitsPerInt - s0c));
1251
Value s = append(new Constant(new IntConstant(m)));
1252
ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s)));
1260
// could not simplify
1261
push(type, append(new ShiftOp(code, x, s)));
1265
void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) {1266
Value y = pop(type);
1267
Value x = pop(type);
1268
push(type, append(new LogicOp(code, x, y)));
1272
void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) {1273
ValueStack* state_before = copy_state_before();
1274
Value y = pop(type);
1275
Value x = pop(type);
1276
ipush(append(new CompareOp(code, x, y, state_before)));
1280
void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) {1281
push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to))));
1285
void GraphBuilder::increment() {1286
int index = stream()->get_index();
1287
int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]);
1288
load_local(intType, index);
1289
ipush(append(new Constant(new IntConstant(delta))));
1290
arithmetic_op(intType, Bytecodes::_iadd);
1291
store_local(intType, index);
1295
void GraphBuilder::_goto(int from_bci, int to_bci) {1296
Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1297
if (is_profiling()) {1298
compilation()->set_would_profile(true);
1299
x->set_profiled_bci(bci());
1300
if (profile_branches()) {1301
x->set_profiled_method(method());
1302
x->set_should_profile(true);
1309
void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {1310
BlockBegin* tsux = block_at(stream()->get_dest());
1311
BlockBegin* fsux = block_at(stream()->next_bci());
1312
bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1313
// In case of loop invariant code motion or predicate insertion
1314
// before the body of a loop the state is needed
1315
Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic()) ? state_before : nullptr, is_bb));
1317
assert(i->as_Goto() == nullptr ||
1318
(i->as_Goto()->sux_at(0) == tsux && i->as_Goto()->is_safepoint() == (tsux->bci() < stream()->cur_bci())) ||
1319
(i->as_Goto()->sux_at(0) == fsux && i->as_Goto()->is_safepoint() == (fsux->bci() < stream()->cur_bci())),
1320
"safepoint state of Goto returned by canonicalizer incorrect");
1322
if (is_profiling()) {1323
If* if_node = i->as_If();
1324
if (if_node != nullptr) {1325
// Note that we'd collect profile data in this method if we wanted it.
1326
compilation()->set_would_profile(true);
1327
// At level 2 we need the proper bci to count backedges
1328
if_node->set_profiled_bci(bci());
1329
if (profile_branches()) {1330
// Successors can be rotated by the canonicalizer, check for this case.
1331
if_node->set_profiled_method(method());
1332
if_node->set_should_profile(true);
1333
if (if_node->tsux() == fsux) {1334
if_node->set_swapped(true);
1340
// Check if this If was reduced to Goto.
1341
Goto *goto_node = i->as_Goto();
1342
if (goto_node != nullptr) {1343
compilation()->set_would_profile(true);
1344
goto_node->set_profiled_bci(bci());
1345
if (profile_branches()) {1346
goto_node->set_profiled_method(method());
1347
goto_node->set_should_profile(true);
1348
// Find out which successor is used.
1349
if (goto_node->default_sux() == tsux) {1350
goto_node->set_direction(Goto::taken);
1351
} else if (goto_node->default_sux() == fsux) {1352
goto_node->set_direction(Goto::not_taken);
1354
ShouldNotReachHere();
1363
void GraphBuilder::if_zero(ValueType* type, If::Condition cond) {1364
Value y = append(new Constant(intZero));
1365
ValueStack* state_before = copy_state_before();
1367
if_node(x, cond, y, state_before);
1371
void GraphBuilder::if_null(ValueType* type, If::Condition cond) {1372
Value y = append(new Constant(objectNull));
1373
ValueStack* state_before = copy_state_before();
1375
if_node(x, cond, y, state_before);
1379
void GraphBuilder::if_same(ValueType* type, If::Condition cond) {1380
ValueStack* state_before = copy_state_before();
1381
Value y = pop(type);
1382
Value x = pop(type);
1383
if_node(x, cond, y, state_before);
1387
void GraphBuilder::jsr(int dest) {1388
// We only handle well-formed jsrs (those which are "block-structured").
1389
// If the bytecodes are strange (jumping out of a jsr block) then we
1390
// might end up trying to re-parse a block containing a jsr which
1391
// has already been activated. Watch for this case and bail out.
1392
for (ScopeData* cur_scope_data = scope_data();
1393
cur_scope_data != nullptr && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1394
cur_scope_data = cur_scope_data->parent()) {1395
if (cur_scope_data->jsr_entry_bci() == dest) {1396
BAILOUT("too-complicated jsr/ret structure");1400
push(addressType, append(new Constant(new AddressConstant(next_bci()))));
1401
if (!try_inline_jsr(dest)) {1402
return; // bailed out while parsing and inlining subroutine
1407
void GraphBuilder::ret(int local_index) {1408
if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine");1410
if (local_index != scope_data()->jsr_return_address_local()) {1411
BAILOUT("can not handle complicated jsr/ret constructs");1414
// Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation
1415
append(new Goto(scope_data()->jsr_continuation(), false));
1419
void GraphBuilder::table_switch() {1420
Bytecode_tableswitch sw(stream());
1421
const int l = sw.length();
1422
if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {1423
// total of 2 successors => use If instead of switch
1424
// Note: This code should go into the canonicalizer as soon as it can
1425
// can handle canonicalized forms that contain more than one node.
1426
Value key = append(new Constant(new IntConstant(sw.low_key())));
1427
BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0));
1428
BlockBegin* fsux = block_at(bci() + sw.default_offset());
1429
bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1430
// In case of loop invariant code motion or predicate insertion
1431
// before the body of a loop the state is needed
1432
ValueStack* state_before = copy_state_if_bb(is_bb);
1433
append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1435
// collect successors
1436
BlockList* sux = new BlockList(l + 1, nullptr);
1438
bool has_bb = false;
1439
for (i = 0; i < l; i++) {1440
sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1441
if (sw.dest_offset_at(i) < 0) has_bb = true;
1443
// add default successor
1444
if (sw.default_offset() < 0) has_bb = true;
1445
sux->at_put(i, block_at(bci() + sw.default_offset()));
1446
// In case of loop invariant code motion or predicate insertion
1447
// before the body of a loop the state is needed
1448
ValueStack* state_before = copy_state_if_bb(has_bb);
1449
Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1451
if (res->as_Goto()) {1452
for (i = 0; i < l; i++) {1453
if (sux->at(i) == res->as_Goto()->sux_at(0)) {1454
assert(res->as_Goto()->is_safepoint() == (sw.dest_offset_at(i) < 0), "safepoint state of Goto returned by canonicalizer incorrect");
1463
void GraphBuilder::lookup_switch() {1464
Bytecode_lookupswitch sw(stream());
1465
const int l = sw.number_of_pairs();
1466
if (CanonicalizeNodes && l == 1 && compilation()->env()->comp_level() != CompLevel_full_profile) {1467
// total of 2 successors => use If instead of switch
1468
// Note: This code should go into the canonicalizer as soon as it can
1469
// can handle canonicalized forms that contain more than one node.
1471
LookupswitchPair pair = sw.pair_at(0);
1472
Value key = append(new Constant(new IntConstant(pair.match())));
1473
BlockBegin* tsux = block_at(bci() + pair.offset());
1474
BlockBegin* fsux = block_at(bci() + sw.default_offset());
1475
bool is_bb = tsux->bci() < bci() || fsux->bci() < bci();
1476
// In case of loop invariant code motion or predicate insertion
1477
// before the body of a loop the state is needed
1478
ValueStack* state_before = copy_state_if_bb(is_bb);;
1479
append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb));
1481
// collect successors & keys
1482
BlockList* sux = new BlockList(l + 1, nullptr);
1483
intArray* keys = new intArray(l, l, 0);
1485
bool has_bb = false;
1486
for (i = 0; i < l; i++) {1487
LookupswitchPair pair = sw.pair_at(i);
1488
if (pair.offset() < 0) has_bb = true;
1489
sux->at_put(i, block_at(bci() + pair.offset()));
1490
keys->at_put(i, pair.match());
1492
// add default successor
1493
if (sw.default_offset() < 0) has_bb = true;
1494
sux->at_put(i, block_at(bci() + sw.default_offset()));
1495
// In case of loop invariant code motion or predicate insertion
1496
// before the body of a loop the state is needed
1497
ValueStack* state_before = copy_state_if_bb(has_bb);
1498
Instruction* res = append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb));
1500
if (res->as_Goto()) {1501
for (i = 0; i < l; i++) {1502
if (sux->at(i) == res->as_Goto()->sux_at(0)) {1503
assert(res->as_Goto()->is_safepoint() == (sw.pair_at(i).offset() < 0), "safepoint state of Goto returned by canonicalizer incorrect");
1511
void GraphBuilder::call_register_finalizer() {1512
// If the receiver requires finalization then emit code to perform
1513
// the registration on return.
1515
// Gather some type information about the receiver
1516
Value receiver = state()->local_at(0);
1517
assert(receiver != nullptr, "must have a receiver");
1518
ciType* declared_type = receiver->declared_type();
1519
ciType* exact_type = receiver->exact_type();
1520
if (exact_type == nullptr &&
1521
receiver->as_Local() &&
1522
receiver->as_Local()->java_index() == 0) {1523
ciInstanceKlass* ik = compilation()->method()->holder();
1524
if (ik->is_final()) {1526
} else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) {1527
// test class is leaf class
1528
compilation()->dependency_recorder()->assert_leaf_type(ik);
1535
// see if we know statically that registration isn't required
1536
bool needs_check = true;
1537
if (exact_type != nullptr) {1538
needs_check = exact_type->as_instance_klass()->has_finalizer();
1539
} else if (declared_type != nullptr) {1540
ciInstanceKlass* ik = declared_type->as_instance_klass();
1541
if (!Dependencies::has_finalizable_subclass(ik)) {1542
compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik);
1543
needs_check = false;
1548
// Perform the registration of finalizable objects.
1549
ValueStack* state_before = copy_state_for_exception();
1550
load_local(objectType, 0);
1551
append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1552
state()->pop_arguments(1),
1553
true, state_before, true));
1558
void GraphBuilder::method_return(Value x, bool ignore_return) {1559
if (method()->intrinsic_id() == vmIntrinsics::_Object_init) {1560
call_register_finalizer();
1563
// The conditions for a memory barrier are described in Parse::do_exits().
1564
bool need_mem_bar = false;
1565
if (method()->name() == ciSymbols::object_initializer_name() &&
1566
(scope()->wrote_final() ||
1567
(AlwaysSafeConstructors && scope()->wrote_fields()) ||
1568
(support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile()))) {1569
need_mem_bar = true;
1572
BasicType bt = method()->return_type()->basic_type();
1576
Value shift = append(new Constant(new IntConstant(24)));
1577
x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1578
x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1583
Value shift = append(new Constant(new IntConstant(16)));
1584
x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1585
x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1590
Value mask = append(new Constant(new IntConstant(0xFFFF)));
1591
x = append(new LogicOp(Bytecodes::_iand, x, mask));
1596
Value mask = append(new Constant(new IntConstant(1)));
1597
x = append(new LogicOp(Bytecodes::_iand, x, mask));
1604
// Check to see whether we are inlining. If so, Return
1605
// instructions become Gotos to the continuation point.
1606
if (continuation() != nullptr) {1608
int invoke_bci = state()->caller_state()->bci();
1610
if (x != nullptr && !ignore_return) {1611
ciMethod* caller = state()->scope()->caller()->method();
1612
Bytecodes::Code invoke_raw_bc = caller->raw_code_at_bci(invoke_bci);
1613
if (invoke_raw_bc == Bytecodes::_invokehandle || invoke_raw_bc == Bytecodes::_invokedynamic) {1614
ciType* declared_ret_type = caller->get_declared_signature_at_bci(invoke_bci)->return_type();
1615
if (declared_ret_type->is_klass() && x->exact_type() == nullptr &&
1616
x->declared_type() != declared_ret_type && declared_ret_type != compilation()->env()->Object_klass()) {1617
x = append(new TypeCast(declared_ret_type->as_klass(), x, copy_state_before()));
1622
assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet");
1624
if (compilation()->env()->dtrace_method_probes()) {1625
// Report exit from inline methods
1626
Values* args = new Values(1);
1627
args->push(append(new Constant(new MethodConstant(method()))));
1628
append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args));
1631
// If the inlined method is synchronized, the monitor must be
1632
// released before we jump to the continuation block.
1633
if (method()->is_synchronized()) {1634
assert(state()->locks_size() == 1, "receiver must be locked here");
1635
monitorexit(state()->lock_at(0), SynchronizationEntryBCI);
1639
append(new MemBar(lir_membar_storestore));
1642
// State at end of inlined method is the state of the caller
1643
// without the method parameters on stack, including the
1644
// return value, if any, of the inlined method on operand stack.
1645
set_state(state()->caller_state()->copy_for_parsing());
1647
if (!ignore_return) {1648
state()->push(x->type(), x);
1650
if (profile_return() && x->type()->is_object_kind()) {1651
ciMethod* caller = state()->scope()->method();
1652
profile_return_type(x, method(), caller, invoke_bci);
1655
Goto* goto_callee = new Goto(continuation(), false);
1657
// See whether this is the first return; if so, store off some
1658
// of the state for later examination
1659
if (num_returns() == 0) {1660
set_inline_cleanup_info();
1663
// The current bci() is in the wrong scope, so use the bci() of
1664
// the continuation point.
1665
append_with_bci(goto_callee, scope_data()->continuation()->bci());
1670
state()->truncate_stack(0);
1671
if (method()->is_synchronized()) {1672
// perform the unlocking before exiting the method
1674
if (!method()->is_static()) {1675
receiver = _initial_state->local_at(0);
1677
receiver = append(new Constant(new ClassConstant(method()->holder())));
1679
append_split(new MonitorExit(receiver, state()->unlock()));
1683
append(new MemBar(lir_membar_storestore));
1686
assert(!ignore_return, "Ignoring return value works only for inlining");
1687
append(new Return(x));
1690
Value GraphBuilder::make_constant(ciConstant field_value, ciField* field) {1691
if (!field_value.is_valid()) return nullptr;
1693
BasicType field_type = field_value.basic_type();
1694
ValueType* value = as_ValueType(field_value);
1696
// Attach dimension info to stable arrays.
1697
if (FoldStableValues &&
1698
field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {1699
ciArray* array = field_value.as_object()->as_array();
1700
jint dimension = field->type()->as_array_klass()->dimension();
1701
value = new StableArrayConstant(array, dimension);
1704
switch (field_type) {1707
if (field_value.as_object()->should_be_constant()) {1708
return new Constant(value);
1710
return nullptr; // Not a constant.
1712
return new Constant(value);
1716
void GraphBuilder::access_field(Bytecodes::Code code) {1718
ciField* field = stream()->get_field(will_link);
1719
ciInstanceKlass* holder = field->holder();
1720
BasicType field_type = field->type()->basic_type();
1721
ValueType* type = as_ValueType(field_type);
1722
// call will_link again to determine if the field is valid.
1723
const bool needs_patching = !holder->is_loaded() ||
1724
!field->will_link(method(), code) ||
1727
ValueStack* state_before = nullptr;
1728
if (!holder->is_initialized() || needs_patching) {1729
// save state before instruction for debug info when
1730
// deoptimization happens during patching
1731
state_before = copy_state_before();
1734
Value obj = nullptr;
1735
if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {1736
if (state_before != nullptr) {1737
// build a patching constant
1738
obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1740
obj = new Constant(new InstanceConstant(holder->java_mirror()));
1744
if (field->is_final() && (code == Bytecodes::_putfield)) {1745
scope()->set_wrote_final();
1748
if (code == Bytecodes::_putfield) {1749
scope()->set_wrote_fields();
1750
if (field->is_volatile()) {1751
scope()->set_wrote_volatile();
1755
const int offset = !needs_patching ? field->offset_in_bytes() : -1;
1757
case Bytecodes::_getstatic: {1758
// check for compile-time constants, i.e., initialized static final fields
1759
Value constant = nullptr;
1760
if (field->is_static_constant() && !PatchALot) {1761
ciConstant field_value = field->constant_value();
1762
assert(!field->is_stable() || !field_value.is_null_or_zero(),
1763
"stable static w/ default value shouldn't be a constant");
1764
constant = make_constant(field_value, field);
1766
if (constant != nullptr) {1767
push(type, append(constant));
1769
if (state_before == nullptr) {1770
state_before = copy_state_for_exception();
1772
push(type, append(new LoadField(append(obj), offset, field, true,
1773
state_before, needs_patching)));
1777
case Bytecodes::_putstatic: {1778
Value val = pop(type);
1779
if (state_before == nullptr) {1780
state_before = copy_state_for_exception();
1782
if (field->type()->basic_type() == T_BOOLEAN) {1783
Value mask = append(new Constant(new IntConstant(1)));
1784
val = append(new LogicOp(Bytecodes::_iand, val, mask));
1786
append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1789
case Bytecodes::_getfield: {1790
// Check for compile-time constants, i.e., trusted final non-static fields.
1791
Value constant = nullptr;
1793
ObjectType* obj_type = obj->type()->as_ObjectType();
1794
if (field->is_constant() && obj_type->is_constant() && !PatchALot) {1795
ciObject* const_oop = obj_type->constant_value();
1796
if (!const_oop->is_null_object() && const_oop->is_loaded()) {1797
ciConstant field_value = field->constant_value_of(const_oop);
1798
if (field_value.is_valid()) {1799
constant = make_constant(field_value, field);
1800
// For CallSite objects add a dependency for invalidation of the optimization.
1801
if (field->is_call_site_target()) {1802
ciCallSite* call_site = const_oop->as_call_site();
1803
if (!call_site->is_fully_initialized_constant_call_site()) {1804
ciMethodHandle* target = field_value.as_object()->as_method_handle();
1805
dependency_recorder()->assert_call_site_target_value(call_site, target);
1811
if (constant != nullptr) {1812
push(type, append(constant));
1814
if (state_before == nullptr) {1815
state_before = copy_state_for_exception();
1817
LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1818
Value replacement = !needs_patching ? _memory->load(load) : load;
1819
if (replacement != load) {1820
assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1821
// Writing an (integer) value to a boolean, byte, char or short field includes an implicit narrowing
1822
// conversion. Emit an explicit conversion here to get the correct field value after the write.
1823
BasicType bt = field->type()->basic_type();
1827
replacement = append(new Convert(Bytecodes::_i2b, replacement, as_ValueType(bt)));
1830
replacement = append(new Convert(Bytecodes::_i2c, replacement, as_ValueType(bt)));
1833
replacement = append(new Convert(Bytecodes::_i2s, replacement, as_ValueType(bt)));
1838
push(type, replacement);
1840
push(type, append(load));
1845
case Bytecodes::_putfield: {1846
Value val = pop(type);
1848
if (state_before == nullptr) {1849
state_before = copy_state_for_exception();
1851
if (field->type()->basic_type() == T_BOOLEAN) {1852
Value mask = append(new Constant(new IntConstant(1)));
1853
val = append(new LogicOp(Bytecodes::_iand, val, mask));
1855
StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
1856
if (!needs_patching) store = _memory->store(store);
1857
if (store != nullptr) {1863
ShouldNotReachHere();
1869
Dependencies* GraphBuilder::dependency_recorder() const {1870
assert(DeoptC1, "need debug information");
1871
return compilation()->dependency_recorder();
1874
// How many arguments do we want to profile?
1875
Values* GraphBuilder::args_list_for_profiling(ciMethod* target, int& start, bool may_have_receiver) {1877
bool has_receiver = may_have_receiver && Bytecodes::has_receiver(method()->java_code_at_bci(bci()));
1878
start = has_receiver ? 1 : 0;
1879
if (profile_arguments()) {1880
ciProfileData* data = method()->method_data()->bci_to_data(bci());
1881
if (data != nullptr && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {1882
n = data->is_CallTypeData() ? data->as_CallTypeData()->number_of_arguments() : data->as_VirtualCallTypeData()->number_of_arguments();
1885
// If we are inlining then we need to collect arguments to profile parameters for the target
1886
if (profile_parameters() && target != nullptr) {1887
if (target->method_data() != nullptr && target->method_data()->parameters_type_data() != nullptr) {1888
// The receiver is profiled on method entry so it's included in
1889
// the number of parameters but here we're only interested in
1890
// actual arguments.
1891
n = MAX2(n, target->method_data()->parameters_type_data()->number_of_parameters() - start);
1895
return new Values(n);
1900
void GraphBuilder::check_args_for_profiling(Values* obj_args, int expected) {1902
bool ignored_will_link;
1903
ciSignature* declared_signature = nullptr;
1904
ciMethod* real_target = method()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
1905
assert(expected == obj_args->capacity() || real_target->is_method_handle_intrinsic(), "missed on arg?");
1909
// Collect arguments that we want to profile in a list
1910
Values* GraphBuilder::collect_args_for_profiling(Values* args, ciMethod* target, bool may_have_receiver) {1912
Values* obj_args = args_list_for_profiling(target, start, may_have_receiver);
1913
if (obj_args == nullptr) {1916
int s = obj_args->capacity();
1917
// if called through method handle invoke, some arguments may have been popped
1918
for (int i = start, j = 0; j < s && i < args->length(); i++) {1919
if (args->at(i)->type()->is_object_kind()) {1920
obj_args->push(args->at(i));
1924
check_args_for_profiling(obj_args, s);
1928
void GraphBuilder::invoke(Bytecodes::Code code) {1930
ciSignature* declared_signature = nullptr;
1931
ciMethod* target = stream()->get_method(will_link, &declared_signature);
1932
ciKlass* holder = stream()->get_declared_method_holder();
1933
const Bytecodes::Code bc_raw = stream()->cur_bc_raw();
1934
assert(declared_signature != nullptr, "cannot be null");
1935
assert(will_link == target->is_loaded(), "");
1936
JFR_ONLY(Jfr::on_resolution(this, holder, target); CHECK_BAILOUT();)
1938
ciInstanceKlass* klass = target->holder();
1939
assert(!target->is_loaded() || klass->is_loaded(), "loaded target must imply loaded klass");
1941
// check if CHA possible: if so, change the code to invoke_special
1942
ciInstanceKlass* calling_klass = method()->holder();
1943
ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder);
1944
ciInstanceKlass* actual_recv = callee_holder;
1946
CompileLog* log = compilation()->log();
1948
log->elem("call method='%d' instr='%s'",1949
log->identify(target),
1950
Bytecodes::name(code));
1952
// Some methods are obviously bindable without any type checks so
1953
// convert them directly to an invokespecial or invokestatic.
1954
if (target->is_loaded() && !target->is_abstract() && target->can_be_statically_bound()) {1956
case Bytecodes::_invokeinterface:
1957
// convert to invokespecial if the target is the private interface method.
1958
if (target->is_private()) {1959
assert(holder->is_interface(), "How did we get a non-interface method here!");
1960
code = Bytecodes::_invokespecial;
1963
case Bytecodes::_invokevirtual:
1964
code = Bytecodes::_invokespecial;
1966
case Bytecodes::_invokehandle:
1967
code = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokespecial;
1973
if (bc_raw == Bytecodes::_invokehandle) {1974
assert(!will_link, "should come here only for unlinked call");
1975
code = Bytecodes::_invokespecial;
1979
if (code == Bytecodes::_invokespecial) {1980
// Additional receiver subtype checks for interface calls via invokespecial or invokeinterface.
1981
ciKlass* receiver_constraint = nullptr;
1983
if (bc_raw == Bytecodes::_invokeinterface) {1984
receiver_constraint = holder;
1985
} else if (bc_raw == Bytecodes::_invokespecial && !target->is_object_initializer() && calling_klass->is_interface()) {1986
receiver_constraint = calling_klass;
1989
if (receiver_constraint != nullptr) {1990
int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1991
Value receiver = state()->stack_at(index);
1992
CheckCast* c = new CheckCast(receiver_constraint, receiver, copy_state_before());
1993
// go to uncommon_trap when checkcast fails
1994
c->set_invokespecial_receiver_check();
1995
state()->stack_at_put(index, append_split(c));
1999
// Push appendix argument (MethodType, CallSite, etc.), if one.
2000
bool patch_for_appendix = false;
2001
int patching_appendix_arg = 0;
2002
if (Bytecodes::has_optional_appendix(bc_raw) && (!will_link || PatchALot)) {2003
Value arg = append(new Constant(new ObjectConstant(compilation()->env()->unloaded_ciinstance()), copy_state_before()));
2005
patch_for_appendix = true;
2006
patching_appendix_arg = (will_link && stream()->has_appendix()) ? 0 : 1;
2007
} else if (stream()->has_appendix()) {2008
ciObject* appendix = stream()->get_appendix();
2009
Value arg = append(new Constant(new ObjectConstant(appendix)));
2013
ciMethod* cha_monomorphic_target = nullptr;
2014
ciMethod* exact_target = nullptr;
2015
Value better_receiver = nullptr;
2016
if (UseCHA && DeoptC1 && target->is_loaded() &&
2017
!(// %%% FIXME: Are both of these relevant?
2018
target->is_method_handle_intrinsic() ||
2019
target->is_compiled_lambda_form()) &&
2020
!patch_for_appendix) {2021
Value receiver = nullptr;
2022
ciInstanceKlass* receiver_klass = nullptr;
2023
bool type_is_exact = false;
2024
// try to find a precise receiver type
2025
if (will_link && !target->is_static()) {2026
int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
2027
receiver = state()->stack_at(index);
2028
ciType* type = receiver->exact_type();
2029
if (type != nullptr && type->is_loaded()) {2030
assert(!type->is_instance_klass() || !type->as_instance_klass()->is_interface(), "Must not be an interface");
2031
// Detects non-interface instances, primitive arrays, and some object arrays.
2032
// Array receivers can only call Object methods, so we should be able to allow
2033
// all object arrays here too, even those with unloaded types.
2034
receiver_klass = (ciInstanceKlass*) type;
2035
type_is_exact = true;
2037
if (type == nullptr) {2038
type = receiver->declared_type();
2039
if (type != nullptr && type->is_loaded() &&
2040
type->is_instance_klass() && !type->as_instance_klass()->is_interface()) {2041
receiver_klass = (ciInstanceKlass*) type;
2042
if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) {2043
// Insert a dependency on this type since
2044
// find_monomorphic_target may assume it's already done.
2045
dependency_recorder()->assert_leaf_type(receiver_klass);
2046
type_is_exact = true;
2051
if (receiver_klass != nullptr && type_is_exact &&
2052
receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) {2053
// If we have the exact receiver type we can bind directly to
2054
// the method to call.
2055
exact_target = target->resolve_invoke(calling_klass, receiver_klass);
2056
if (exact_target != nullptr) {2057
target = exact_target;
2058
code = Bytecodes::_invokespecial;
2061
if (receiver_klass != nullptr &&
2062
receiver_klass->is_subtype_of(actual_recv) &&
2063
actual_recv->is_initialized()) {2064
actual_recv = receiver_klass;
2067
if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) ||
2068
(code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) {2069
// Use CHA on the receiver to select a more precise method.
2070
cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv);
2071
} else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != nullptr) {2072
assert(callee_holder->is_interface(), "invokeinterface to non interface?");
2073
// If there is only one implementor of this interface then we
2074
// may be able bind this invoke directly to the implementing
2075
// klass but we need both a dependence on the single interface
2076
// and on the method we bind to. Additionally since all we know
2077
// about the receiver type is the it's supposed to implement the
2078
// interface we have to insert a check that it's the class we
2079
// expect. Interface types are not checked by the verifier so
2080
// they are roughly equivalent to Object.
2081
// The number of implementors for declared_interface is less or
2082
// equal to the number of implementors for target->holder() so
2083
// if number of implementors of target->holder() == 1 then
2084
// number of implementors for decl_interface is 0 or 1. If
2085
// it's 0 then no class implements decl_interface and there's
2086
// no point in inlining.
2087
ciInstanceKlass* declared_interface = callee_holder;
2088
ciInstanceKlass* singleton = declared_interface->unique_implementor();
2089
if (singleton != nullptr) {2090
assert(singleton != declared_interface, "not a unique implementor");
2091
cha_monomorphic_target = target->find_monomorphic_target(calling_klass, declared_interface, singleton);
2092
if (cha_monomorphic_target != nullptr) {2093
ciInstanceKlass* holder = cha_monomorphic_target->holder();
2094
ciInstanceKlass* constraint = (holder->is_subtype_of(singleton) ? holder : singleton); // avoid upcasts
2095
if (holder != compilation()->env()->Object_klass() &&
2096
(!type_is_exact || receiver_klass->is_subtype_of(constraint))) {2097
actual_recv = declared_interface;
2099
// insert a check it's really the expected class.
2100
CheckCast* c = new CheckCast(constraint, receiver, copy_state_for_exception());
2101
c->set_incompatible_class_change_check();
2102
c->set_direct_compare(constraint->is_final());
2103
// pass the result of the checkcast so that the compiler has
2104
// more accurate type info in the inlinee
2105
better_receiver = append_split(c);
2107
dependency_recorder()->assert_unique_implementor(declared_interface, singleton);
2109
cha_monomorphic_target = nullptr;
2116
if (cha_monomorphic_target != nullptr) {2117
assert(!target->can_be_statically_bound() || target == cha_monomorphic_target, "");
2118
assert(!cha_monomorphic_target->is_abstract(), "");
2119
if (!cha_monomorphic_target->can_be_statically_bound(actual_recv)) {2120
// If we inlined because CHA revealed only a single target method,
2121
// then we are dependent on that target method not getting overridden
2122
// by dynamic class loading. Be sure to test the "static" receiver
2123
// dest_method here, as opposed to the actual receiver, which may
2124
// falsely lead us to believe that the receiver is final or private.
2125
dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target, callee_holder, target);
2127
code = Bytecodes::_invokespecial;
2130
// check if we could do inlining
2131
if (!PatchALot && Inline && target->is_loaded() && !patch_for_appendix &&
2132
callee_holder->is_loaded()) { // the effect of symbolic reference resolution2134
// callee is known => check if we have static binding
2135
if ((code == Bytecodes::_invokestatic && klass->is_initialized()) || // invokestatic involves an initialization barrier on declaring class
2136
code == Bytecodes::_invokespecial ||
2137
(code == Bytecodes::_invokevirtual && target->is_final_method()) ||
2138
code == Bytecodes::_invokedynamic) {2139
// static binding => check if callee is ok
2140
ciMethod* inline_target = (cha_monomorphic_target != nullptr) ? cha_monomorphic_target : target;
2141
bool holder_known = (cha_monomorphic_target != nullptr) || (exact_target != nullptr);
2142
bool success = try_inline(inline_target, holder_known, false /* ignore_return */, code, better_receiver);
2145
clear_inline_bailout();
2148
// Register dependence if JVMTI has either breakpoint
2149
// setting or hotswapping of methods capabilities since they may
2150
// cause deoptimization.
2151
if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) {2152
dependency_recorder()->assert_evol_method(inline_target);
2157
print_inlining(target, "no static binding", /*success*/ false);
2160
print_inlining(target, "not inlineable", /*success*/ false);
2163
// If we attempted an inline which did not succeed because of a
2164
// bailout during construction of the callee graph, the entire
2165
// compilation has to be aborted. This is fairly rare and currently
2166
// seems to only occur for jasm-generated classes which contain
2167
// jsr/ret pairs which are not associated with finally clauses and
2168
// do not have exception handlers in the containing method, and are
2169
// therefore not caught early enough to abort the inlining without
2170
// corrupting the graph. (We currently bail out with a non-empty
2171
// stack at a ret in these situations.)
2174
// inlining not successful => standard invoke
2175
ValueType* result_type = as_ValueType(declared_signature->return_type());
2176
ValueStack* state_before = copy_state_exhandling();
2178
// The bytecode (code) might change in this method so we are checking this very late.
2179
const bool has_receiver =
2180
code == Bytecodes::_invokespecial ||
2181
code == Bytecodes::_invokevirtual ||
2182
code == Bytecodes::_invokeinterface;
2183
Values* args = state()->pop_arguments(target->arg_size_no_receiver() + patching_appendix_arg);
2184
Value recv = has_receiver ? apop() : nullptr;
2186
// A null check is required here (when there is a receiver) for any of the following cases
2187
// - invokespecial, always need a null check.
2188
// - invokevirtual, when the target is final and loaded. Calls to final targets will become optimized
2189
// and require null checking. If the target is loaded a null check is emitted here.
2190
// If the target isn't loaded the null check must happen after the call resolution. We achieve that
2191
// by using the target methods unverified entry point (see CompiledIC::compute_monomorphic_entry).
2192
// (The JVM specification requires that LinkageError must be thrown before a NPE. An unloaded target may
2193
// potentially fail, and can't have the null check before the resolution.)
2194
// - A call that will be profiled. (But we can't add a null check when the target is unloaded, by the same
2195
// reason as above, so calls with a receiver to unloaded targets can't be profiled.)
2197
// Normal invokevirtual will perform the null check during lookup
2199
bool need_null_check = (code == Bytecodes::_invokespecial) ||
2200
(target->is_loaded() && (target->is_final_method() || (is_profiling() && profile_calls())));
2202
if (need_null_check) {2203
if (recv != nullptr) {2207
if (is_profiling()) {2208
// Note that we'd collect profile data in this method if we wanted it.
2209
compilation()->set_would_profile(true);
2211
if (profile_calls()) {2212
assert(cha_monomorphic_target == nullptr || exact_target == nullptr, "both can not be set");
2213
ciKlass* target_klass = nullptr;
2214
if (cha_monomorphic_target != nullptr) {2215
target_klass = cha_monomorphic_target->holder();
2216
} else if (exact_target != nullptr) {2217
target_klass = exact_target->holder();
2219
profile_call(target, recv, target_klass, collect_args_for_profiling(args, nullptr, false), false);
2224
Invoke* result = new Invoke(code, result_type, recv, args, target, state_before);
2226
append_split(result);
2228
if (result_type != voidType) {2229
push(result_type, round_fp(result));
2231
if (profile_return() && result_type->is_object_kind()) {2232
profile_return_type(result, target);
2237
void GraphBuilder::new_instance(int klass_index) {2238
ValueStack* state_before = copy_state_exhandling();
2239
ciKlass* klass = stream()->get_klass();
2240
assert(klass->is_instance_klass(), "must be an instance klass");
2241
NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before, stream()->is_unresolved_klass());
2242
_memory->new_instance(new_instance);
2243
apush(append_split(new_instance));
2247
void GraphBuilder::new_type_array() {2248
ValueStack* state_before = copy_state_exhandling();
2249
apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before, true)));
2253
void GraphBuilder::new_object_array() {2254
ciKlass* klass = stream()->get_klass();
2255
ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2256
NewArray* n = new NewObjectArray(klass, ipop(), state_before);
2257
apush(append_split(n));
2261
bool GraphBuilder::direct_compare(ciKlass* k) {2262
if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {2263
ciInstanceKlass* ik = k->as_instance_klass();
2264
if (ik->is_final()) {2267
if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {2268
// test class is leaf class
2269
dependency_recorder()->assert_leaf_type(ik);
2278
void GraphBuilder::check_cast(int klass_index) {2279
ciKlass* klass = stream()->get_klass();
2280
ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception();
2281
CheckCast* c = new CheckCast(klass, apop(), state_before);
2282
apush(append_split(c));
2283
c->set_direct_compare(direct_compare(klass));
2285
if (is_profiling()) {2286
// Note that we'd collect profile data in this method if we wanted it.
2287
compilation()->set_would_profile(true);
2289
if (profile_checkcasts()) {2290
c->set_profiled_method(method());
2291
c->set_profiled_bci(bci());
2292
c->set_should_profile(true);
2298
void GraphBuilder::instance_of(int klass_index) {2299
ciKlass* klass = stream()->get_klass();
2300
ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2301
InstanceOf* i = new InstanceOf(klass, apop(), state_before);
2302
ipush(append_split(i));
2303
i->set_direct_compare(direct_compare(klass));
2305
if (is_profiling()) {2306
// Note that we'd collect profile data in this method if we wanted it.
2307
compilation()->set_would_profile(true);
2309
if (profile_checkcasts()) {2310
i->set_profiled_method(method());
2311
i->set_profiled_bci(bci());
2312
i->set_should_profile(true);
2318
void GraphBuilder::monitorenter(Value x, int bci) {2319
// save state before locking in case of deoptimization after a NullPointerException
2320
ValueStack* state_before = copy_state_for_exception_with_bci(bci);
2321
append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci);
2326
void GraphBuilder::monitorexit(Value x, int bci) {2327
append_with_bci(new MonitorExit(x, state()->unlock()), bci);
2332
void GraphBuilder::new_multi_array(int dimensions) {2333
ciKlass* klass = stream()->get_klass();
2334
ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2336
Values* dims = new Values(dimensions, dimensions, nullptr);
2337
// fill in all dimensions
2339
while (i-- > 0) dims->at_put(i, ipop());
2341
NewArray* n = new NewMultiArray(klass, dims, state_before);
2342
apush(append_split(n));
2346
void GraphBuilder::throw_op(int bci) {2347
// We require that the debug info for a Throw be the "state before"
2348
// the Throw (i.e., exception oop is still on TOS)
2349
ValueStack* state_before = copy_state_before_with_bci(bci);
2350
Throw* t = new Throw(apop(), state_before);
2351
// operand stack not needed after a throw
2352
state()->truncate_stack(0);
2353
append_with_bci(t, bci);
2357
Value GraphBuilder::round_fp(Value fp_value) {2358
if (strict_fp_requires_explicit_rounding) {2360
// no rounding needed if SSE2 is used
2362
// Must currently insert rounding node for doubleword values that
2363
// are results of expressions (i.e., not loads from memory or
2365
if (fp_value->type()->tag() == doubleTag &&
2366
fp_value->as_Constant() == nullptr &&
2367
fp_value->as_Local() == nullptr && // method parameters need no rounding
2368
fp_value->as_RoundFP() == nullptr) {2369
return append(new RoundFP(fp_value));
2380
Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) {2381
Canonicalizer canon(compilation(), instr, bci);
2382
Instruction* i1 = canon.canonical();
2383
if (i1->is_linked() || !i1->can_be_linked()) {2384
// Canonicalizer returned an instruction which was already
2385
// appended so simply return it.
2389
if (UseLocalValueNumbering) {2390
// Lookup the instruction in the ValueMap and add it to the map if
2392
Instruction* i2 = vmap()->find_insert(i1);
2394
// found an entry in the value map, so just return it.
2395
assert(i2->is_linked(), "should already be linked");
2398
ValueNumberingEffects vne(vmap());
2402
// i1 was not eliminated => append it
2403
assert(i1->next() == nullptr, "shouldn't already be linked");
2404
_last = _last->set_next(i1, canon.bci());
2406
if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) {2407
// set the bailout state but complete normal processing. We
2408
// might do a little more work before noticing the bailout so we
2409
// want processing to continue normally until it's noticed.
2410
bailout("Method and/or inlining is too large");2414
if (PrintIRDuringConstruction) {2415
InstructionPrinter ip;
2423
// save state after modification of operand stack for StateSplit instructions
2424
StateSplit* s = i1->as_StateSplit();
2426
if (EliminateFieldAccess) {2427
Intrinsic* intrinsic = s->as_Intrinsic();
2428
if (s->as_Invoke() != nullptr || (intrinsic && !intrinsic->preserves_state())) {2432
s->set_state(state()->copy(ValueStack::StateAfter, canon.bci()));
2435
// set up exception handlers for this instruction if necessary
2436
if (i1->can_trap()) {2437
i1->set_exception_handlers(handle_exception(i1));
2438
assert(i1->exception_state() != nullptr || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state");
2444
Instruction* GraphBuilder::append(Instruction* instr) {2445
assert(instr->as_StateSplit() == nullptr || instr->as_BlockEnd() != nullptr, "wrong append used");
2446
return append_with_bci(instr, bci());
2450
Instruction* GraphBuilder::append_split(StateSplit* instr) {2451
return append_with_bci(instr, bci());
2455
void GraphBuilder::null_check(Value value) {2456
if (value->as_NewArray() != nullptr || value->as_NewInstance() != nullptr) {2459
Constant* con = value->as_Constant();
2461
ObjectType* c = con->type()->as_ObjectType();
2462
if (c && c->is_loaded()) {2463
ObjectConstant* oc = c->as_ObjectConstant();
2464
if (!oc || !oc->value()->is_null_object()) {2470
append(new NullCheck(value, copy_state_for_exception()));
2475
XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {2476
if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != nullptr)) {2477
assert(instruction->exception_state() == nullptr
2478
|| instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2479
|| (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->should_retain_local_variables()),
2480
"exception_state should be of exception kind");
2481
return new XHandlers();
2484
XHandlers* exception_handlers = new XHandlers();
2485
ScopeData* cur_scope_data = scope_data();
2486
ValueStack* cur_state = instruction->state_before();
2487
ValueStack* prev_state = nullptr;
2488
int scope_count = 0;
2490
assert(cur_state != nullptr, "state_before must be set");
2492
int cur_bci = cur_state->bci();
2493
assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2494
assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci");
2496
// join with all potential exception handlers
2497
XHandlers* list = cur_scope_data->xhandlers();
2498
const int n = list->length();
2499
for (int i = 0; i < n; i++) {2500
XHandler* h = list->handler_at(i);
2501
if (h->covers(cur_bci)) {2502
// h is a potential exception handler => join it
2503
compilation()->set_has_exception_handlers(true);
2505
BlockBegin* entry = h->entry_block();
2506
if (entry == block()) {2507
// It's acceptable for an exception handler to cover itself
2508
// but we don't handle that in the parser currently. It's
2509
// very rare so we bailout instead of trying to handle it.
2510
BAILOUT_("exception handler covers itself", exception_handlers);2512
assert(entry->bci() == h->handler_bci(), "must match");
2513
assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2515
// previously this was a BAILOUT, but this is not necessary
2516
// now because asynchronous exceptions are not handled this way.
2517
assert(entry->state() == nullptr || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match");
2519
// xhandler start with an empty expression stack
2520
if (cur_state->stack_size() != 0) {2521
// locals are preserved
2522
// stack will be truncated
2523
cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci());
2525
if (instruction->exception_state() == nullptr) {2526
instruction->set_exception_state(cur_state);
2529
// Note: Usually this join must work. However, very
2530
// complicated jsr-ret structures where we don't ret from
2531
// the subroutine can cause the objects on the monitor
2532
// stacks to not match because blocks can be parsed twice.
2533
// The only test case we've seen so far which exhibits this
2534
// problem is caught by the infinite recursion test in
2535
// GraphBuilder::jsr() if the join doesn't work.
2536
if (!entry->try_merge(cur_state, compilation()->has_irreducible_loops())) {2537
BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers);2540
// add current state for correct handling of phi functions at begin of xhandler
2541
int phi_operand = entry->add_exception_state(cur_state);
2543
// add entry to the list of xhandlers of this block
2544
_block->add_exception_handler(entry);
2546
// add back-edge from xhandler entry to this block
2547
if (!entry->is_predecessor(_block)) {2548
entry->add_predecessor(_block);
2551
// clone XHandler because phi_operand and scope_count can not be shared
2552
XHandler* new_xhandler = new XHandler(h);
2553
new_xhandler->set_phi_operand(phi_operand);
2554
new_xhandler->set_scope_count(scope_count);
2555
exception_handlers->append(new_xhandler);
2557
// fill in exception handler subgraph lazily
2558
assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
2559
cur_scope_data->add_to_work_list(entry);
2561
// stop when reaching catchall
2562
if (h->catch_type() == 0) {2563
return exception_handlers;
2568
if (exception_handlers->length() == 0) {2569
// This scope and all callees do not handle exceptions, so the local
2570
// variables of this scope are not needed. However, the scope itself is
2571
// required for a correct exception stack trace -> clear out the locals.
2572
// Stack and locals are invalidated but not truncated in caller state.
2573
if (prev_state != nullptr) {2574
assert(instruction->exception_state() != nullptr, "missed set?");
2575
ValueStack::Kind exc_kind = ValueStack::empty_exception_kind(true /* caller */);
2576
cur_state = cur_state->copy(exc_kind, cur_state->bci());
2577
// reset caller exception state
2578
prev_state->set_caller_state(cur_state);
2580
assert(instruction->exception_state() == nullptr, "already set");
2581
// set instruction exception state
2583
ValueStack::Kind exc_kind = ValueStack::empty_exception_kind();
2584
cur_state = cur_state->copy(exc_kind, cur_state->bci());
2585
instruction->set_exception_state(cur_state);
2589
// Set up iteration for next time.
2590
// If parsing a jsr, do not grab exception handlers from the
2591
// parent scopes for this method (already got them, and they
2592
// needed to be cloned)
2594
while (cur_scope_data->parsing_jsr()) {2595
cur_scope_data = cur_scope_data->parent();
2598
assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2599
assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler");
2601
prev_state = cur_state;
2602
cur_state = cur_state->caller_state();
2603
cur_scope_data = cur_scope_data->parent();
2605
} while (cur_scope_data != nullptr);
2607
return exception_handlers;
2611
// Helper class for simplifying Phis.
2612
class PhiSimplifier : public BlockClosure {2614
bool _has_substitutions;
2615
Value simplify(Value v);
2618
PhiSimplifier(BlockBegin* start) : _has_substitutions(false) {2619
start->iterate_preorder(this);
2620
if (_has_substitutions) {2621
SubstitutionResolver sr(start);
2624
void block_do(BlockBegin* b);
2625
bool has_substitutions() const { return _has_substitutions; }2629
Value PhiSimplifier::simplify(Value v) {2630
Phi* phi = v->as_Phi();
2632
if (phi == nullptr) {2635
} else if (v->has_subst()) {2636
// already substituted; subst can be phi itself -> simplify
2637
return simplify(v->subst());
2638
} else if (phi->is_set(Phi::cannot_simplify)) {2639
// already tried to simplify phi before
2641
} else if (phi->is_set(Phi::visited)) {2642
// break cycles in phi functions
2644
} else if (phi->type()->is_illegal()) {2645
// illegal phi functions are ignored anyway
2649
// mark phi function as processed to break cycles in phi functions
2650
phi->set(Phi::visited);
2652
// simplify x = [y, x] and x = [y, y] to y
2653
Value subst = nullptr;
2654
int opd_count = phi->operand_count();
2655
for (int i = 0; i < opd_count; i++) {2656
Value opd = phi->operand_at(i);
2657
assert(opd != nullptr, "Operand must exist!");
2659
if (opd->type()->is_illegal()) {2660
// if one operand is illegal, the entire phi function is illegal
2661
phi->make_illegal();
2662
phi->clear(Phi::visited);
2666
Value new_opd = simplify(opd);
2667
assert(new_opd != nullptr, "Simplified operand must exist!");
2669
if (new_opd != phi && new_opd != subst) {2670
if (subst == nullptr) {2673
// no simplification possible
2674
phi->set(Phi::cannot_simplify);
2675
phi->clear(Phi::visited);
2681
// successfully simplified phi function
2682
assert(subst != nullptr, "illegal phi function");
2683
_has_substitutions = true;
2684
phi->clear(Phi::visited);
2685
phi->set_subst(subst);
2688
if (PrintPhiFunctions) {2689
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());2698
void PhiSimplifier::block_do(BlockBegin* b) {2699
for_each_phi_fun(b, phi,
2704
for_each_phi_fun(b, phi,
2705
assert(phi->operand_count() != 1 || phi->subst() != phi || phi->is_illegal(), "missed trivial simplification");
2708
ValueStack* state = b->state()->caller_state();
2709
for_each_state_value(state, value,
2710
Phi* phi = value->as_Phi();
2711
assert(phi == nullptr || phi->block() != b, "must not have phi function to simplify in caller state");
2716
// This method is called after all blocks are filled with HIR instructions
2717
// It eliminates all Phi functions of the form x = [y, y] and x = [y, x]
2718
void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) {2719
PhiSimplifier simplifier(start);
2723
void GraphBuilder::connect_to_end(BlockBegin* beg) {2727
_state = beg->state()->copy_for_parsing();
2729
iterate_bytecodes_for_block(beg->bci());
2733
BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) {2735
if (PrintIRDuringConstruction) {2737
InstructionPrinter ip;
2738
ip.print_instr(_block); tty->cr();
2739
ip.print_stack(_block->state()); tty->cr();
2740
ip.print_inline_level(_block);
2742
tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size());2745
_skip_block = false;
2746
assert(state() != nullptr, "ValueStack missing!");
2747
CompileLog* log = compilation()->log();
2748
ciBytecodeStream s(method());
2749
s.reset_to_bci(bci);
2751
scope_data()->set_stream(&s);
2753
Bytecodes::Code code = Bytecodes::_illegal;
2754
bool push_exception = false;
2756
if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == nullptr) {2757
// first thing in the exception entry block should be the exception object.
2758
push_exception = true;
2761
bool ignore_return = scope_data()->ignore_return();
2763
while (!bailed_out() && last()->as_BlockEnd() == nullptr &&
2764
(code = stream()->next()) != ciBytecodeStream::EOBC() &&
2765
(block_at(s.cur_bci()) == nullptr || block_at(s.cur_bci()) == block())) {2766
assert(state()->kind() == ValueStack::Parsing, "invalid state kind");
2769
log->set_context("bc code='%d' bci='%d'", (int)code, s.cur_bci());2771
// Check for active jsr during OSR compilation
2772
if (compilation()->is_osr_compile()
2773
&& scope()->is_top_scope()
2775
&& s.cur_bci() == compilation()->osr_bci()) {2776
bailout("OSR not supported while a jsr is active");2779
if (push_exception) {2780
apush(append(new ExceptionObject()));
2781
push_exception = false;
2786
case Bytecodes::_nop : /* nothing to do */ break;
2787
case Bytecodes::_aconst_null : apush(append(new Constant(objectNull ))); break;
2788
case Bytecodes::_iconst_m1 : ipush(append(new Constant(new IntConstant (-1)))); break;
2789
case Bytecodes::_iconst_0 : ipush(append(new Constant(intZero ))); break;
2790
case Bytecodes::_iconst_1 : ipush(append(new Constant(intOne ))); break;
2791
case Bytecodes::_iconst_2 : ipush(append(new Constant(new IntConstant ( 2)))); break;
2792
case Bytecodes::_iconst_3 : ipush(append(new Constant(new IntConstant ( 3)))); break;
2793
case Bytecodes::_iconst_4 : ipush(append(new Constant(new IntConstant ( 4)))); break;
2794
case Bytecodes::_iconst_5 : ipush(append(new Constant(new IntConstant ( 5)))); break;
2795
case Bytecodes::_lconst_0 : lpush(append(new Constant(new LongConstant ( 0)))); break;
2796
case Bytecodes::_lconst_1 : lpush(append(new Constant(new LongConstant ( 1)))); break;
2797
case Bytecodes::_fconst_0 : fpush(append(new Constant(new FloatConstant ( 0)))); break;
2798
case Bytecodes::_fconst_1 : fpush(append(new Constant(new FloatConstant ( 1)))); break;
2799
case Bytecodes::_fconst_2 : fpush(append(new Constant(new FloatConstant ( 2)))); break;
2800
case Bytecodes::_dconst_0 : dpush(append(new Constant(new DoubleConstant( 0)))); break;
2801
case Bytecodes::_dconst_1 : dpush(append(new Constant(new DoubleConstant( 1)))); break;
2802
case Bytecodes::_bipush : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break;
2803
case Bytecodes::_sipush : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break;
2804
case Bytecodes::_ldc : // fall through
2805
case Bytecodes::_ldc_w : // fall through
2806
case Bytecodes::_ldc2_w : load_constant(); break;
2807
case Bytecodes::_iload : load_local(intType , s.get_index()); break;
2808
case Bytecodes::_lload : load_local(longType , s.get_index()); break;
2809
case Bytecodes::_fload : load_local(floatType , s.get_index()); break;
2810
case Bytecodes::_dload : load_local(doubleType , s.get_index()); break;
2811
case Bytecodes::_aload : load_local(instanceType, s.get_index()); break;
2812
case Bytecodes::_iload_0 : load_local(intType , 0); break;
2813
case Bytecodes::_iload_1 : load_local(intType , 1); break;
2814
case Bytecodes::_iload_2 : load_local(intType , 2); break;
2815
case Bytecodes::_iload_3 : load_local(intType , 3); break;
2816
case Bytecodes::_lload_0 : load_local(longType , 0); break;
2817
case Bytecodes::_lload_1 : load_local(longType , 1); break;
2818
case Bytecodes::_lload_2 : load_local(longType , 2); break;
2819
case Bytecodes::_lload_3 : load_local(longType , 3); break;
2820
case Bytecodes::_fload_0 : load_local(floatType , 0); break;
2821
case Bytecodes::_fload_1 : load_local(floatType , 1); break;
2822
case Bytecodes::_fload_2 : load_local(floatType , 2); break;
2823
case Bytecodes::_fload_3 : load_local(floatType , 3); break;
2824
case Bytecodes::_dload_0 : load_local(doubleType, 0); break;
2825
case Bytecodes::_dload_1 : load_local(doubleType, 1); break;
2826
case Bytecodes::_dload_2 : load_local(doubleType, 2); break;
2827
case Bytecodes::_dload_3 : load_local(doubleType, 3); break;
2828
case Bytecodes::_aload_0 : load_local(objectType, 0); break;
2829
case Bytecodes::_aload_1 : load_local(objectType, 1); break;
2830
case Bytecodes::_aload_2 : load_local(objectType, 2); break;
2831
case Bytecodes::_aload_3 : load_local(objectType, 3); break;
2832
case Bytecodes::_iaload : load_indexed(T_INT ); break;
2833
case Bytecodes::_laload : load_indexed(T_LONG ); break;
2834
case Bytecodes::_faload : load_indexed(T_FLOAT ); break;
2835
case Bytecodes::_daload : load_indexed(T_DOUBLE); break;
2836
case Bytecodes::_aaload : load_indexed(T_OBJECT); break;
2837
case Bytecodes::_baload : load_indexed(T_BYTE ); break;
2838
case Bytecodes::_caload : load_indexed(T_CHAR ); break;
2839
case Bytecodes::_saload : load_indexed(T_SHORT ); break;
2840
case Bytecodes::_istore : store_local(intType , s.get_index()); break;
2841
case Bytecodes::_lstore : store_local(longType , s.get_index()); break;
2842
case Bytecodes::_fstore : store_local(floatType , s.get_index()); break;
2843
case Bytecodes::_dstore : store_local(doubleType, s.get_index()); break;
2844
case Bytecodes::_astore : store_local(objectType, s.get_index()); break;
2845
case Bytecodes::_istore_0 : store_local(intType , 0); break;
2846
case Bytecodes::_istore_1 : store_local(intType , 1); break;
2847
case Bytecodes::_istore_2 : store_local(intType , 2); break;
2848
case Bytecodes::_istore_3 : store_local(intType , 3); break;
2849
case Bytecodes::_lstore_0 : store_local(longType , 0); break;
2850
case Bytecodes::_lstore_1 : store_local(longType , 1); break;
2851
case Bytecodes::_lstore_2 : store_local(longType , 2); break;
2852
case Bytecodes::_lstore_3 : store_local(longType , 3); break;
2853
case Bytecodes::_fstore_0 : store_local(floatType , 0); break;
2854
case Bytecodes::_fstore_1 : store_local(floatType , 1); break;
2855
case Bytecodes::_fstore_2 : store_local(floatType , 2); break;
2856
case Bytecodes::_fstore_3 : store_local(floatType , 3); break;
2857
case Bytecodes::_dstore_0 : store_local(doubleType, 0); break;
2858
case Bytecodes::_dstore_1 : store_local(doubleType, 1); break;
2859
case Bytecodes::_dstore_2 : store_local(doubleType, 2); break;
2860
case Bytecodes::_dstore_3 : store_local(doubleType, 3); break;
2861
case Bytecodes::_astore_0 : store_local(objectType, 0); break;
2862
case Bytecodes::_astore_1 : store_local(objectType, 1); break;
2863
case Bytecodes::_astore_2 : store_local(objectType, 2); break;
2864
case Bytecodes::_astore_3 : store_local(objectType, 3); break;
2865
case Bytecodes::_iastore : store_indexed(T_INT ); break;
2866
case Bytecodes::_lastore : store_indexed(T_LONG ); break;
2867
case Bytecodes::_fastore : store_indexed(T_FLOAT ); break;
2868
case Bytecodes::_dastore : store_indexed(T_DOUBLE); break;
2869
case Bytecodes::_aastore : store_indexed(T_OBJECT); break;
2870
case Bytecodes::_bastore : store_indexed(T_BYTE ); break;
2871
case Bytecodes::_castore : store_indexed(T_CHAR ); break;
2872
case Bytecodes::_sastore : store_indexed(T_SHORT ); break;
2873
case Bytecodes::_pop : // fall through
2874
case Bytecodes::_pop2 : // fall through
2875
case Bytecodes::_dup : // fall through
2876
case Bytecodes::_dup_x1 : // fall through
2877
case Bytecodes::_dup_x2 : // fall through
2878
case Bytecodes::_dup2 : // fall through
2879
case Bytecodes::_dup2_x1 : // fall through
2880
case Bytecodes::_dup2_x2 : // fall through
2881
case Bytecodes::_swap : stack_op(code); break;
2882
case Bytecodes::_iadd : arithmetic_op(intType , code); break;
2883
case Bytecodes::_ladd : arithmetic_op(longType , code); break;
2884
case Bytecodes::_fadd : arithmetic_op(floatType , code); break;
2885
case Bytecodes::_dadd : arithmetic_op(doubleType, code); break;
2886
case Bytecodes::_isub : arithmetic_op(intType , code); break;
2887
case Bytecodes::_lsub : arithmetic_op(longType , code); break;
2888
case Bytecodes::_fsub : arithmetic_op(floatType , code); break;
2889
case Bytecodes::_dsub : arithmetic_op(doubleType, code); break;
2890
case Bytecodes::_imul : arithmetic_op(intType , code); break;
2891
case Bytecodes::_lmul : arithmetic_op(longType , code); break;
2892
case Bytecodes::_fmul : arithmetic_op(floatType , code); break;
2893
case Bytecodes::_dmul : arithmetic_op(doubleType, code); break;
2894
case Bytecodes::_idiv : arithmetic_op(intType , code, copy_state_for_exception()); break;
2895
case Bytecodes::_ldiv : arithmetic_op(longType , code, copy_state_for_exception()); break;
2896
case Bytecodes::_fdiv : arithmetic_op(floatType , code); break;
2897
case Bytecodes::_ddiv : arithmetic_op(doubleType, code); break;
2898
case Bytecodes::_irem : arithmetic_op(intType , code, copy_state_for_exception()); break;
2899
case Bytecodes::_lrem : arithmetic_op(longType , code, copy_state_for_exception()); break;
2900
case Bytecodes::_frem : arithmetic_op(floatType , code); break;
2901
case Bytecodes::_drem : arithmetic_op(doubleType, code); break;
2902
case Bytecodes::_ineg : negate_op(intType ); break;
2903
case Bytecodes::_lneg : negate_op(longType ); break;
2904
case Bytecodes::_fneg : negate_op(floatType ); break;
2905
case Bytecodes::_dneg : negate_op(doubleType); break;
2906
case Bytecodes::_ishl : shift_op(intType , code); break;
2907
case Bytecodes::_lshl : shift_op(longType, code); break;
2908
case Bytecodes::_ishr : shift_op(intType , code); break;
2909
case Bytecodes::_lshr : shift_op(longType, code); break;
2910
case Bytecodes::_iushr : shift_op(intType , code); break;
2911
case Bytecodes::_lushr : shift_op(longType, code); break;
2912
case Bytecodes::_iand : logic_op(intType , code); break;
2913
case Bytecodes::_land : logic_op(longType, code); break;
2914
case Bytecodes::_ior : logic_op(intType , code); break;
2915
case Bytecodes::_lor : logic_op(longType, code); break;
2916
case Bytecodes::_ixor : logic_op(intType , code); break;
2917
case Bytecodes::_lxor : logic_op(longType, code); break;
2918
case Bytecodes::_iinc : increment(); break;
2919
case Bytecodes::_i2l : convert(code, T_INT , T_LONG ); break;
2920
case Bytecodes::_i2f : convert(code, T_INT , T_FLOAT ); break;
2921
case Bytecodes::_i2d : convert(code, T_INT , T_DOUBLE); break;
2922
case Bytecodes::_l2i : convert(code, T_LONG , T_INT ); break;
2923
case Bytecodes::_l2f : convert(code, T_LONG , T_FLOAT ); break;
2924
case Bytecodes::_l2d : convert(code, T_LONG , T_DOUBLE); break;
2925
case Bytecodes::_f2i : convert(code, T_FLOAT , T_INT ); break;
2926
case Bytecodes::_f2l : convert(code, T_FLOAT , T_LONG ); break;
2927
case Bytecodes::_f2d : convert(code, T_FLOAT , T_DOUBLE); break;
2928
case Bytecodes::_d2i : convert(code, T_DOUBLE, T_INT ); break;
2929
case Bytecodes::_d2l : convert(code, T_DOUBLE, T_LONG ); break;
2930
case Bytecodes::_d2f : convert(code, T_DOUBLE, T_FLOAT ); break;
2931
case Bytecodes::_i2b : convert(code, T_INT , T_BYTE ); break;
2932
case Bytecodes::_i2c : convert(code, T_INT , T_CHAR ); break;
2933
case Bytecodes::_i2s : convert(code, T_INT , T_SHORT ); break;
2934
case Bytecodes::_lcmp : compare_op(longType , code); break;
2935
case Bytecodes::_fcmpl : compare_op(floatType , code); break;
2936
case Bytecodes::_fcmpg : compare_op(floatType , code); break;
2937
case Bytecodes::_dcmpl : compare_op(doubleType, code); break;
2938
case Bytecodes::_dcmpg : compare_op(doubleType, code); break;
2939
case Bytecodes::_ifeq : if_zero(intType , If::eql); break;
2940
case Bytecodes::_ifne : if_zero(intType , If::neq); break;
2941
case Bytecodes::_iflt : if_zero(intType , If::lss); break;
2942
case Bytecodes::_ifge : if_zero(intType , If::geq); break;
2943
case Bytecodes::_ifgt : if_zero(intType , If::gtr); break;
2944
case Bytecodes::_ifle : if_zero(intType , If::leq); break;
2945
case Bytecodes::_if_icmpeq : if_same(intType , If::eql); break;
2946
case Bytecodes::_if_icmpne : if_same(intType , If::neq); break;
2947
case Bytecodes::_if_icmplt : if_same(intType , If::lss); break;
2948
case Bytecodes::_if_icmpge : if_same(intType , If::geq); break;
2949
case Bytecodes::_if_icmpgt : if_same(intType , If::gtr); break;
2950
case Bytecodes::_if_icmple : if_same(intType , If::leq); break;
2951
case Bytecodes::_if_acmpeq : if_same(objectType, If::eql); break;
2952
case Bytecodes::_if_acmpne : if_same(objectType, If::neq); break;
2953
case Bytecodes::_goto : _goto(s.cur_bci(), s.get_dest()); break;
2954
case Bytecodes::_jsr : jsr(s.get_dest()); break;
2955
case Bytecodes::_ret : ret(s.get_index()); break;
2956
case Bytecodes::_tableswitch : table_switch(); break;
2957
case Bytecodes::_lookupswitch : lookup_switch(); break;
2958
case Bytecodes::_ireturn : method_return(ipop(), ignore_return); break;
2959
case Bytecodes::_lreturn : method_return(lpop(), ignore_return); break;
2960
case Bytecodes::_freturn : method_return(fpop(), ignore_return); break;
2961
case Bytecodes::_dreturn : method_return(dpop(), ignore_return); break;
2962
case Bytecodes::_areturn : method_return(apop(), ignore_return); break;
2963
case Bytecodes::_return : method_return(nullptr, ignore_return); break;
2964
case Bytecodes::_getstatic : // fall through
2965
case Bytecodes::_putstatic : // fall through
2966
case Bytecodes::_getfield : // fall through
2967
case Bytecodes::_putfield : access_field(code); break;
2968
case Bytecodes::_invokevirtual : // fall through
2969
case Bytecodes::_invokespecial : // fall through
2970
case Bytecodes::_invokestatic : // fall through
2971
case Bytecodes::_invokedynamic : // fall through
2972
case Bytecodes::_invokeinterface: invoke(code); break;
2973
case Bytecodes::_new : new_instance(s.get_index_u2()); break;
2974
case Bytecodes::_newarray : new_type_array(); break;
2975
case Bytecodes::_anewarray : new_object_array(); break;
2976
case Bytecodes::_arraylength : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; }2977
case Bytecodes::_athrow : throw_op(s.cur_bci()); break;
2978
case Bytecodes::_checkcast : check_cast(s.get_index_u2()); break;
2979
case Bytecodes::_instanceof : instance_of(s.get_index_u2()); break;
2980
case Bytecodes::_monitorenter : monitorenter(apop(), s.cur_bci()); break;
2981
case Bytecodes::_monitorexit : monitorexit (apop(), s.cur_bci()); break;
2982
case Bytecodes::_wide : ShouldNotReachHere(); break;
2983
case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break;
2984
case Bytecodes::_ifnull : if_null(objectType, If::eql); break;
2985
case Bytecodes::_ifnonnull : if_null(objectType, If::neq); break;
2986
case Bytecodes::_goto_w : _goto(s.cur_bci(), s.get_far_dest()); break;
2987
case Bytecodes::_jsr_w : jsr(s.get_far_dest()); break;
2988
case Bytecodes::_breakpoint : BAILOUT_("concurrent setting of breakpoint", nullptr);2989
default : ShouldNotReachHere(); break;
2993
log->clear_context(); // skip marker if nothing was printed
2995
// save current bci to setup Goto at the end
2996
prev_bci = s.cur_bci();
2999
CHECK_BAILOUT_(nullptr);
3000
// stop processing of this block (see try_inline_full)
3002
_skip_block = false;
3003
assert(_last && _last->as_BlockEnd(), "");
3004
return _last->as_BlockEnd();
3006
// if there are any, check if last instruction is a BlockEnd instruction
3007
BlockEnd* end = last()->as_BlockEnd();
3008
if (end == nullptr) {3009
// all blocks must end with a BlockEnd instruction => add a Goto
3010
end = new Goto(block_at(s.cur_bci()), false);
3013
assert(end == last()->as_BlockEnd(), "inconsistency");
3015
assert(end->state() != nullptr, "state must already be present");
3016
assert(end->as_Return() == nullptr || end->as_Throw() == nullptr || end->state()->stack_size() == 0, "stack not needed for return and throw");
3018
// connect to begin & set state
3019
// NOTE that inlining may have changed the block we are parsing
3020
block()->set_end(end);
3022
for (int i = end->number_of_sux() - 1; i >= 0; i--) {3023
BlockBegin* sux = end->sux_at(i);
3024
assert(sux->is_predecessor(block()), "predecessor missing");
3025
// be careful, bailout if bytecodes are strange
3026
if (!sux->try_merge(end->state(), compilation()->has_irreducible_loops())) BAILOUT_("block join failed", nullptr);3027
scope_data()->add_to_work_list(end->sux_at(i));
3030
scope_data()->set_stream(nullptr);
3037
void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) {3039
if (start_in_current_block_for_inlining && !bailed_out()) {3040
iterate_bytecodes_for_block(0);
3041
start_in_current_block_for_inlining = false;
3044
while ((b = scope_data()->remove_from_work_list()) != nullptr) {3045
if (!b->is_set(BlockBegin::was_visited_flag)) {3046
if (b->is_set(BlockBegin::osr_entry_flag)) {3047
// we're about to parse the osr entry block, so make sure
3048
// we setup the OSR edge leading into this block so that
3049
// Phis get setup correctly.
3050
setup_osr_entry_block();
3051
// this is no longer the osr entry block, so clear it.
3052
b->clear(BlockBegin::osr_entry_flag);
3054
b->set(BlockBegin::was_visited_flag);
3059
} while (!bailed_out() && !scope_data()->is_work_list_empty());
3063
bool GraphBuilder::_can_trap [Bytecodes::number_of_java_codes];
3065
void GraphBuilder::initialize() {3066
// the following bytecodes are assumed to potentially
3067
// throw exceptions in compiled code - note that e.g.
3068
// monitorexit & the return bytecodes do not throw
3069
// exceptions since monitor pairing proved that they
3070
// succeed (if monitor pairing succeeded)
3071
Bytecodes::Code can_trap_list[] =
3074
, Bytecodes::_ldc2_w
3075
, Bytecodes::_iaload
3076
, Bytecodes::_laload
3077
, Bytecodes::_faload
3078
, Bytecodes::_daload
3079
, Bytecodes::_aaload
3080
, Bytecodes::_baload
3081
, Bytecodes::_caload
3082
, Bytecodes::_saload
3083
, Bytecodes::_iastore
3084
, Bytecodes::_lastore
3085
, Bytecodes::_fastore
3086
, Bytecodes::_dastore
3087
, Bytecodes::_aastore
3088
, Bytecodes::_bastore
3089
, Bytecodes::_castore
3090
, Bytecodes::_sastore
3095
, Bytecodes::_getstatic
3096
, Bytecodes::_putstatic
3097
, Bytecodes::_getfield
3098
, Bytecodes::_putfield
3099
, Bytecodes::_invokevirtual
3100
, Bytecodes::_invokespecial
3101
, Bytecodes::_invokestatic
3102
, Bytecodes::_invokedynamic
3103
, Bytecodes::_invokeinterface
3105
, Bytecodes::_newarray
3106
, Bytecodes::_anewarray
3107
, Bytecodes::_arraylength
3108
, Bytecodes::_athrow
3109
, Bytecodes::_checkcast
3110
, Bytecodes::_instanceof
3111
, Bytecodes::_monitorenter
3112
, Bytecodes::_multianewarray
3115
// inititialize trap tables
3116
for (int i = 0; i < Bytecodes::number_of_java_codes; i++) {3117
_can_trap[i] = false;
3119
// set standard trap info
3120
for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) {3121
_can_trap[can_trap_list[j]] = true;
3126
BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {3127
assert(entry->is_set(f), "entry/flag mismatch");
3128
// create header block
3129
BlockBegin* h = new BlockBegin(entry->bci());
3130
h->set_depth_first_number(0);
3133
BlockEnd* g = new Goto(entry, false);
3134
l->set_next(g, entry->bci());
3137
// setup header block end state
3138
ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis)
3139
assert(s->stack_is_empty(), "must have empty stack at entry point");
3146
BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) {3147
BlockBegin* start = new BlockBegin(0);
3149
// This code eliminates the empty start block at the beginning of
3150
// each method. Previously, each method started with the
3151
// start-block created below, and this block was followed by the
3152
// header block that was always empty. This header block is only
3153
// necessary if std_entry is also a backward branch target because
3154
// then phi functions may be necessary in the header block. It's
3155
// also necessary when profiling so that there's a single block that
3156
// can increment the counters.
3157
// In addition, with range check elimination, we may need a valid block
3158
// that dominates all the rest to insert range predicates.
3159
BlockBegin* new_header_block;
3160
if (std_entry->number_of_preds() > 0 || is_profiling() || RangeCheckElimination) {3161
new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state);
3163
new_header_block = std_entry;
3166
// setup start block (root for the IR graph)
3172
start->set_next(base, 0);
3173
start->set_end(base);
3174
// create & setup state for start block
3175
start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3176
base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci()));
3178
if (base->std_entry()->state() == nullptr) {3179
// setup states for header blocks
3180
base->std_entry()->merge(state, compilation()->has_irreducible_loops());
3183
assert(base->std_entry()->state() != nullptr, "");
3188
void GraphBuilder::setup_osr_entry_block() {3189
assert(compilation()->is_osr_compile(), "only for osrs");
3191
int osr_bci = compilation()->osr_bci();
3192
ciBytecodeStream s(method());
3193
s.reset_to_bci(osr_bci);
3195
scope_data()->set_stream(&s);
3197
// create a new block to be the osr setup code
3198
_osr_entry = new BlockBegin(osr_bci);
3199
_osr_entry->set(BlockBegin::osr_entry_flag);
3200
_osr_entry->set_depth_first_number(0);
3201
BlockBegin* target = bci2block()->at(osr_bci);
3202
assert(target != nullptr && target->is_set(BlockBegin::osr_entry_flag), "must be there");
3203
// the osr entry has no values for locals
3204
ValueStack* state = target->state()->copy();
3205
_osr_entry->set_state(state);
3208
_block = _osr_entry;
3209
_state = _osr_entry->state()->copy();
3210
assert(_state->bci() == osr_bci, "mismatch");
3212
Value e = append(new OsrEntry());
3213
e->set_needs_null_check(false);
3217
// locals[nlocals-1..0]
3218
// monitors[number_of_locks-1..0]
3220
// locals is a direct copy of the interpreter frame so in the osr buffer
3221
// so first slot in the local array is the last local from the interpreter
3222
// and last slot is local[0] (receiver) from the interpreter
3224
// Similarly with locks. The first lock slot in the osr buffer is the nth lock
3225
// from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
3226
// in the interpreter frame (the method lock if a sync method)
3228
// Initialize monitors in the compiled activation.
3233
// find all the locals that the interpreter thinks contain live oops
3234
const ResourceBitMap live_oops = method()->live_local_oops_at_bci(osr_bci);
3236
// compute the offset into the locals so that we can treat the buffer
3237
// as if the locals were still in the interpreter frame
3238
int locals_offset = BytesPerWord * (method()->max_locals() - 1);
3239
for_each_local_value(state, index, local) {3240
int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord;
3242
if (local->type()->is_object_kind() && !live_oops.at(index)) {3243
// The interpreter thinks this local is dead but the compiler
3244
// doesn't so pretend that the interpreter passed in null.
3245
get = append(new Constant(objectNull));
3247
Value off_val = append(new Constant(new IntConstant(offset)));
3248
get = append(new UnsafeGet(as_BasicType(local->type()), e,
3250
false/*is_volatile*/,
3253
_state->store_local(index, get);
3256
// the storage for the OSR buffer is freed manually in the LIRGenerator.
3258
assert(state->caller_state() == nullptr, "should be top scope");
3259
state->clear_locals();
3260
Goto* g = new Goto(target, false);
3262
_osr_entry->set_end(g);
3263
target->merge(_osr_entry->end()->state(), compilation()->has_irreducible_loops());
3265
scope_data()->set_stream(nullptr);
3269
ValueStack* GraphBuilder::state_at_entry() {3270
ValueStack* state = new ValueStack(scope(), nullptr);
3272
// Set up locals for receiver
3274
if (!method()->is_static()) {3275
// we should always see the receiver
3276
state->store_local(idx, new Local(method()->holder(), objectType, idx, true));
3280
// Set up locals for incoming arguments
3281
ciSignature* sig = method()->signature();
3282
for (int i = 0; i < sig->count(); i++) {3283
ciType* type = sig->type_at(i);
3284
BasicType basic_type = type->basic_type();
3285
// don't allow T_ARRAY to propagate into locals types
3286
if (is_reference_type(basic_type)) basic_type = T_OBJECT;
3287
ValueType* vt = as_ValueType(basic_type);
3288
state->store_local(idx, new Local(type, vt, idx, false));
3289
idx += type->size();
3292
// lock synchronized method
3293
if (method()->is_synchronized()) {3294
state->lock(nullptr);
3301
GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
3302
: _scope_data(nullptr)
3303
, _compilation(compilation)
3304
, _memory(new MemoryBuffer())
3305
, _inline_bailout_msg(nullptr)
3306
, _instruction_count(0)
3307
, _osr_entry(nullptr)
3309
int osr_bci = compilation->osr_bci();
3311
// determine entry points and bci2block mapping
3312
BlockListBuilder blm(compilation, scope, osr_bci);
3315
BlockList* bci2block = blm.bci2block();
3316
BlockBegin* start_block = bci2block->at(0);
3318
push_root_scope(scope, bci2block, start_block);
3320
// setup state for std entry
3321
_initial_state = state_at_entry();
3322
start_block->merge(_initial_state, compilation->has_irreducible_loops());
3324
// End nulls still exist here
3327
_vmap = new ValueMap();
3328
switch (scope->method()->intrinsic_id()) {3329
case vmIntrinsics::_dabs : // fall through
3330
case vmIntrinsics::_dsqrt : // fall through
3331
case vmIntrinsics::_dsqrt_strict : // fall through
3332
case vmIntrinsics::_dsin : // fall through
3333
case vmIntrinsics::_dcos : // fall through
3334
case vmIntrinsics::_dtan : // fall through
3335
case vmIntrinsics::_dlog : // fall through
3336
case vmIntrinsics::_dlog10 : // fall through
3337
case vmIntrinsics::_dexp : // fall through
3338
case vmIntrinsics::_dpow : // fall through
3340
// Compiles where the root method is an intrinsic need a special
3341
// compilation environment because the bytecodes for the method
3342
// shouldn't be parsed during the compilation, only the special
3343
// Intrinsic node should be emitted. If this isn't done the
3344
// code for the inlined version will be different than the root
3345
// compiled version which could lead to monotonicity problems on
3347
if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {3348
BAILOUT("failed to inline intrinsic, method not annotated");3351
// Set up a stream so that appending instructions works properly.
3352
ciBytecodeStream s(scope->method());
3354
scope_data()->set_stream(&s);
3357
// setup the initial block state
3358
_block = start_block;
3359
_state = start_block->state()->copy_for_parsing();
3360
_last = start_block;
3361
load_local(doubleType, 0);
3362
if (scope->method()->intrinsic_id() == vmIntrinsics::_dpow) {3363
load_local(doubleType, 2);
3366
// Emit the intrinsic node.
3367
bool result = try_inline_intrinsics(scope->method());
3368
if (!result) BAILOUT("failed to inline intrinsic");3369
method_return(dpop());
3371
// connect the begin and end blocks and we're all done.
3372
BlockEnd* end = last()->as_BlockEnd();
3373
block()->set_end(end);
3377
case vmIntrinsics::_Reference_get:
3380
// With java.lang.ref.reference.get() we must go through the
3381
// intrinsic - when G1 is enabled - even when get() is the root
3382
// method of the compile so that, if necessary, the value in
3383
// the referent field of the reference object gets recorded by
3384
// the pre-barrier code.
3385
// Specifically, if G1 is enabled, the value in the referent
3386
// field is recorded by the G1 SATB pre barrier. This will
3387
// result in the referent being marked live and the reference
3388
// object removed from the list of discovered references during
3389
// reference processing.
3390
if (CheckIntrinsics && !scope->method()->intrinsic_candidate()) {3391
BAILOUT("failed to inline intrinsic, method not annotated");3394
// Also we need intrinsic to prevent commoning reads from this field
3395
// across safepoint since GC can change its value.
3397
// Set up a stream so that appending instructions works properly.
3398
ciBytecodeStream s(scope->method());
3400
scope_data()->set_stream(&s);
3403
// setup the initial block state
3404
_block = start_block;
3405
_state = start_block->state()->copy_for_parsing();
3406
_last = start_block;
3407
load_local(objectType, 0);
3409
// Emit the intrinsic node.
3410
bool result = try_inline_intrinsics(scope->method());
3411
if (!result) BAILOUT("failed to inline intrinsic");3412
method_return(apop());
3414
// connect the begin and end blocks and we're all done.
3415
BlockEnd* end = last()->as_BlockEnd();
3416
block()->set_end(end);
3419
// Otherwise, fall thru
3423
scope_data()->add_to_work_list(start_block);
3424
iterate_all_blocks();
3430
// For all blocks reachable from start_block: _end must be non-null
3432
BlockList processed;
3434
to_go.append(start_block);
3435
while(to_go.length() > 0) {3436
BlockBegin* current = to_go.pop();
3437
assert(current != nullptr, "Should not happen.");
3438
assert(current->end() != nullptr, "All blocks reachable from start_block should have end() != nullptr.");
3439
processed.append(current);
3440
for(int i = 0; i < current->number_of_sux(); i++) {3441
BlockBegin* s = current->sux_at(i);
3442
if (!processed.contains(s)) {3450
_start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state);
3452
eliminate_redundant_phis(_start);
3454
NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats());
3455
// for osr compile, bailout if some requirements are not fulfilled
3456
if (osr_bci != -1) {3457
BlockBegin* osr_block = blm.bci2block()->at(osr_bci);
3458
if (!osr_block->is_set(BlockBegin::was_visited_flag)) {3459
BAILOUT("osr entry must have been visited for osr compile");3462
// check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
3463
if (!osr_block->state()->stack_is_empty()) {3464
BAILOUT("stack not empty at OSR entry point");3468
if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count);3473
ValueStack* GraphBuilder::copy_state_before() {3474
return copy_state_before_with_bci(bci());
3477
ValueStack* GraphBuilder::copy_state_exhandling() {3478
return copy_state_exhandling_with_bci(bci());
3481
ValueStack* GraphBuilder::copy_state_for_exception() {3482
return copy_state_for_exception_with_bci(bci());
3485
ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) {3486
return state()->copy(ValueStack::StateBefore, bci);
3489
ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) {3490
if (!has_handler()) return nullptr;
3491
return state()->copy(ValueStack::StateBefore, bci);
3494
ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) {3495
ValueStack* s = copy_state_exhandling_with_bci(bci);
3497
// no handler, no need to retain locals
3498
ValueStack::Kind exc_kind = ValueStack::empty_exception_kind();
3499
s = state()->copy(exc_kind, bci);
3504
int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const {3505
int recur_level = 0;
3506
for (IRScope* s = scope(); s != nullptr; s = s->caller()) {3507
if (s->method() == cur_callee) {3514
static void set_flags_for_inlined_callee(Compilation* compilation, ciMethod* callee) {3515
if (callee->has_reserved_stack_access()) {3516
compilation->set_has_reserved_stack_access(true);
3518
if (callee->is_synchronized() || callee->has_monitor_bytecodes()) {3519
compilation->set_has_monitors(true);
3521
if (callee->is_scoped()) {3522
compilation->set_has_scoped_access(true);
3526
bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {3527
const char* msg = nullptr;
3529
// clear out any existing inline bailout condition
3530
clear_inline_bailout();
3532
// exclude methods we don't want to inline
3533
msg = should_not_inline(callee);
3534
if (msg != nullptr) {3535
print_inlining(callee, msg, /*success*/ false);
3539
// method handle invokes
3540
if (callee->is_method_handle_intrinsic()) {3541
if (try_method_handle_inline(callee, ignore_return)) {3542
set_flags_for_inlined_callee(compilation(), callee);
3548
// handle intrinsics
3549
if (callee->intrinsic_id() != vmIntrinsics::_none &&
3550
callee->check_intrinsic_candidate()) {3551
if (try_inline_intrinsics(callee, ignore_return)) {3552
print_inlining(callee, "intrinsic");
3553
set_flags_for_inlined_callee(compilation(), callee);
3556
// try normal inlining
3559
// certain methods cannot be parsed at all
3560
msg = check_can_parse(callee);
3561
if (msg != nullptr) {3562
print_inlining(callee, msg, /*success*/ false);
3566
// If bytecode not set use the current one.
3567
if (bc == Bytecodes::_illegal) {3570
if (try_inline_full(callee, holder_known, ignore_return, bc, receiver)) {3571
set_flags_for_inlined_callee(compilation(), callee);
3575
// Entire compilation could fail during try_inline_full call.
3576
// In that case printing inlining decision info is useless.
3578
print_inlining(callee, _inline_bailout_msg, /*success*/ false);
3584
const char* GraphBuilder::check_can_parse(ciMethod* callee) const {3585
// Certain methods cannot be parsed at all:
3586
if ( callee->is_native()) return "native method";
3587
if ( callee->is_abstract()) return "abstract method";
3588
if (!callee->can_be_parsed()) return "cannot be parsed";
3592
// negative filter: should callee NOT be inlined? returns null, ok to inline, or rejection msg
3593
const char* GraphBuilder::should_not_inline(ciMethod* callee) const {3594
if ( compilation()->directive()->should_not_inline(callee)) return "disallowed by CompileCommand";
3595
if ( callee->dont_inline()) return "don't inline by annotation";
3599
void GraphBuilder::build_graph_for_intrinsic(ciMethod* callee, bool ignore_return) {3600
vmIntrinsics::ID id = callee->intrinsic_id();
3601
assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
3603
// Some intrinsics need special IR nodes.
3605
case vmIntrinsics::_getReference : append_unsafe_get(callee, T_OBJECT, false); return;
3606
case vmIntrinsics::_getBoolean : append_unsafe_get(callee, T_BOOLEAN, false); return;
3607
case vmIntrinsics::_getByte : append_unsafe_get(callee, T_BYTE, false); return;
3608
case vmIntrinsics::_getShort : append_unsafe_get(callee, T_SHORT, false); return;
3609
case vmIntrinsics::_getChar : append_unsafe_get(callee, T_CHAR, false); return;
3610
case vmIntrinsics::_getInt : append_unsafe_get(callee, T_INT, false); return;
3611
case vmIntrinsics::_getLong : append_unsafe_get(callee, T_LONG, false); return;
3612
case vmIntrinsics::_getFloat : append_unsafe_get(callee, T_FLOAT, false); return;
3613
case vmIntrinsics::_getDouble : append_unsafe_get(callee, T_DOUBLE, false); return;
3614
case vmIntrinsics::_putReference : append_unsafe_put(callee, T_OBJECT, false); return;
3615
case vmIntrinsics::_putBoolean : append_unsafe_put(callee, T_BOOLEAN, false); return;
3616
case vmIntrinsics::_putByte : append_unsafe_put(callee, T_BYTE, false); return;
3617
case vmIntrinsics::_putShort : append_unsafe_put(callee, T_SHORT, false); return;
3618
case vmIntrinsics::_putChar : append_unsafe_put(callee, T_CHAR, false); return;
3619
case vmIntrinsics::_putInt : append_unsafe_put(callee, T_INT, false); return;
3620
case vmIntrinsics::_putLong : append_unsafe_put(callee, T_LONG, false); return;
3621
case vmIntrinsics::_putFloat : append_unsafe_put(callee, T_FLOAT, false); return;
3622
case vmIntrinsics::_putDouble : append_unsafe_put(callee, T_DOUBLE, false); return;
3623
case vmIntrinsics::_getShortUnaligned : append_unsafe_get(callee, T_SHORT, false); return;
3624
case vmIntrinsics::_getCharUnaligned : append_unsafe_get(callee, T_CHAR, false); return;
3625
case vmIntrinsics::_getIntUnaligned : append_unsafe_get(callee, T_INT, false); return;
3626
case vmIntrinsics::_getLongUnaligned : append_unsafe_get(callee, T_LONG, false); return;
3627
case vmIntrinsics::_putShortUnaligned : append_unsafe_put(callee, T_SHORT, false); return;
3628
case vmIntrinsics::_putCharUnaligned : append_unsafe_put(callee, T_CHAR, false); return;
3629
case vmIntrinsics::_putIntUnaligned : append_unsafe_put(callee, T_INT, false); return;
3630
case vmIntrinsics::_putLongUnaligned : append_unsafe_put(callee, T_LONG, false); return;
3631
case vmIntrinsics::_getReferenceVolatile : append_unsafe_get(callee, T_OBJECT, true); return;
3632
case vmIntrinsics::_getBooleanVolatile : append_unsafe_get(callee, T_BOOLEAN, true); return;
3633
case vmIntrinsics::_getByteVolatile : append_unsafe_get(callee, T_BYTE, true); return;
3634
case vmIntrinsics::_getShortVolatile : append_unsafe_get(callee, T_SHORT, true); return;
3635
case vmIntrinsics::_getCharVolatile : append_unsafe_get(callee, T_CHAR, true); return;
3636
case vmIntrinsics::_getIntVolatile : append_unsafe_get(callee, T_INT, true); return;
3637
case vmIntrinsics::_getLongVolatile : append_unsafe_get(callee, T_LONG, true); return;
3638
case vmIntrinsics::_getFloatVolatile : append_unsafe_get(callee, T_FLOAT, true); return;
3639
case vmIntrinsics::_getDoubleVolatile : append_unsafe_get(callee, T_DOUBLE, true); return;
3640
case vmIntrinsics::_putReferenceVolatile : append_unsafe_put(callee, T_OBJECT, true); return;
3641
case vmIntrinsics::_putBooleanVolatile : append_unsafe_put(callee, T_BOOLEAN, true); return;
3642
case vmIntrinsics::_putByteVolatile : append_unsafe_put(callee, T_BYTE, true); return;
3643
case vmIntrinsics::_putShortVolatile : append_unsafe_put(callee, T_SHORT, true); return;
3644
case vmIntrinsics::_putCharVolatile : append_unsafe_put(callee, T_CHAR, true); return;
3645
case vmIntrinsics::_putIntVolatile : append_unsafe_put(callee, T_INT, true); return;
3646
case vmIntrinsics::_putLongVolatile : append_unsafe_put(callee, T_LONG, true); return;
3647
case vmIntrinsics::_putFloatVolatile : append_unsafe_put(callee, T_FLOAT, true); return;
3648
case vmIntrinsics::_putDoubleVolatile : append_unsafe_put(callee, T_DOUBLE, true); return;
3649
case vmIntrinsics::_compareAndSetLong:
3650
case vmIntrinsics::_compareAndSetInt:
3651
case vmIntrinsics::_compareAndSetReference : append_unsafe_CAS(callee); return;
3652
case vmIntrinsics::_getAndAddInt:
3653
case vmIntrinsics::_getAndAddLong : append_unsafe_get_and_set(callee, true); return;
3654
case vmIntrinsics::_getAndSetInt :
3655
case vmIntrinsics::_getAndSetLong :
3656
case vmIntrinsics::_getAndSetReference : append_unsafe_get_and_set(callee, false); return;
3657
case vmIntrinsics::_getCharStringU : append_char_access(callee, false); return;
3658
case vmIntrinsics::_putCharStringU : append_char_access(callee, true); return;
3659
case vmIntrinsics::_clone : append_alloc_array_copy(callee); return;
3663
if (_inline_bailout_msg != nullptr) {3667
// create intrinsic node
3668
const bool has_receiver = !callee->is_static();
3669
ValueType* result_type = as_ValueType(callee->return_type());
3670
ValueStack* state_before = copy_state_for_exception();
3672
Values* args = state()->pop_arguments(callee->arg_size());
3674
if (is_profiling()) {3675
// Don't profile in the special case where the root method
3677
if (callee != method()) {3678
// Note that we'd collect profile data in this method if we wanted it.
3679
compilation()->set_would_profile(true);
3680
if (profile_calls()) {3681
Value recv = nullptr;
3686
profile_call(callee, recv, nullptr, collect_args_for_profiling(args, callee, true), true);
3691
Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(),
3692
args, has_receiver, state_before,
3693
vmIntrinsics::preserves_state(id),
3694
vmIntrinsics::can_trap(id));
3695
// append instruction & push result
3696
Value value = append_split(result);
3697
if (result_type != voidType && !ignore_return) {3698
push(result_type, value);
3701
if (callee != method() && profile_return() && result_type->is_object_kind()) {3702
profile_return_type(result, callee);
3706
bool GraphBuilder::try_inline_intrinsics(ciMethod* callee, bool ignore_return) {3707
// For calling is_intrinsic_available we need to transition to
3708
// the '_thread_in_vm' state because is_intrinsic_available()
3709
// accesses critical VM-internal data.
3710
bool is_available = false;
3713
methodHandle mh(THREAD, callee->get_Method());
3714
is_available = _compilation->compiler()->is_intrinsic_available(mh, _compilation->directive());
3717
if (!is_available) {3718
if (!InlineNatives) {3719
// Return false and also set message that the inlining of
3720
// intrinsics has been disabled in general.
3721
INLINE_BAILOUT("intrinsic method inlining disabled");3726
build_graph_for_intrinsic(callee, ignore_return);
3727
if (_inline_bailout_msg != nullptr) {3734
bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) {3735
// Introduce a new callee continuation point - all Ret instructions
3736
// will be replaced with Gotos to this point.
3737
BlockBegin* cont = block_at(next_bci());
3738
assert(cont != nullptr, "continuation must exist (BlockListBuilder starts a new block after a jsr");
3740
// Note: can not assign state to continuation yet, as we have to
3741
// pick up the state from the Ret instructions.
3743
// Push callee scope
3744
push_scope_for_jsr(cont, jsr_dest_bci);
3746
// Temporarily set up bytecode stream so we can append instructions
3747
// (only using the bci of this stream)
3748
scope_data()->set_stream(scope_data()->parent()->stream());
3750
BlockBegin* jsr_start_block = block_at(jsr_dest_bci);
3751
assert(jsr_start_block != nullptr, "jsr start block must exist");
3752
assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet");
3753
Goto* goto_sub = new Goto(jsr_start_block, false);
3754
// Must copy state to avoid wrong sharing when parsing bytecodes
3755
assert(jsr_start_block->state() == nullptr, "should have fresh jsr starting block");
3756
jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci));
3758
_block->set_end(goto_sub);
3759
_last = _block = jsr_start_block;
3761
// Clear out bytecode stream
3762
scope_data()->set_stream(nullptr);
3764
scope_data()->add_to_work_list(jsr_start_block);
3766
// Ready to resume parsing in subroutine
3767
iterate_all_blocks();
3769
// If we bailed out during parsing, return immediately (this is bad news)
3770
CHECK_BAILOUT_(false);
3772
// Detect whether the continuation can actually be reached. If not,
3773
// it has not had state set by the join() operations in
3774
// iterate_bytecodes_for_block()/ret() and we should not touch the
3775
// iteration state. The calling activation of
3776
// iterate_bytecodes_for_block will then complete normally.
3777
if (cont->state() != nullptr) {3778
if (!cont->is_set(BlockBegin::was_visited_flag)) {3779
// add continuation to work list instead of parsing it immediately
3780
scope_data()->parent()->add_to_work_list(cont);
3784
assert(jsr_continuation() == cont, "continuation must not have changed");
3785
assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) ||
3786
jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag),
3787
"continuation can only be visited in case of backward branches");
3788
assert(_last && _last->as_BlockEnd(), "block must have end");
3790
// continuation is in work list, so end iteration of current block
3792
pop_scope_for_jsr();
3798
// Inline the entry of a synchronized method as a monitor enter and
3799
// register the exception handler which releases the monitor if an
3800
// exception is thrown within the callee. Note that the monitor enter
3801
// cannot throw an exception itself, because the receiver is
3802
// guaranteed to be non-null by the explicit null check at the
3803
// beginning of inlining.
3804
void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) {3805
assert(lock != nullptr && sync_handler != nullptr, "lock or handler missing");
3807
monitorenter(lock, SynchronizationEntryBCI);
3808
assert(_last->as_MonitorEnter() != nullptr, "monitor enter expected");
3809
_last->set_needs_null_check(false);
3811
sync_handler->set(BlockBegin::exception_entry_flag);
3812
sync_handler->set(BlockBegin::is_on_work_list_flag);
3814
ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0);
3815
XHandler* h = new XHandler(desc);
3816
h->set_entry_block(sync_handler);
3817
scope_data()->xhandlers()->append(h);
3818
scope_data()->set_has_handler();
3822
// If an exception is thrown and not handled within an inlined
3823
// synchronized method, the monitor must be released before the
3824
// exception is rethrown in the outer scope. Generate the appropriate
3825
// instructions here.
3826
void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) {3827
BlockBegin* orig_block = _block;
3828
ValueStack* orig_state = _state;
3829
Instruction* orig_last = _last;
3830
_last = _block = sync_handler;
3831
_state = sync_handler->state()->copy();
3833
assert(sync_handler != nullptr, "handler missing");
3834
assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here");
3836
assert(lock != nullptr || default_handler, "lock or handler missing");
3838
XHandler* h = scope_data()->xhandlers()->remove_last();
3839
assert(h->entry_block() == sync_handler, "corrupt list of handlers");
3841
block()->set(BlockBegin::was_visited_flag);
3842
Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI);
3843
assert(exception->is_pinned(), "must be");
3845
int bci = SynchronizationEntryBCI;
3846
if (compilation()->env()->dtrace_method_probes()) {3847
// Report exit from inline methods. We don't have a stream here
3848
// so pass an explicit bci of SynchronizationEntryBCI.
3849
Values* args = new Values(1);
3850
args->push(append_with_bci(new Constant(new MethodConstant(method())), bci));
3851
append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci);
3855
assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing");
3856
if (!lock->is_linked()) {3857
lock = append_with_bci(lock, bci);
3860
// exit the monitor in the context of the synchronized method
3861
monitorexit(lock, bci);
3863
// exit the context of the synchronized method
3864
if (!default_handler) {3866
bci = _state->caller_state()->bci();
3867
_state = _state->caller_state()->copy_for_parsing();
3871
// perform the throw as if at the call site
3875
BlockEnd* end = last()->as_BlockEnd();
3876
block()->set_end(end);
3878
_block = orig_block;
3879
_state = orig_state;
3884
bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known, bool ignore_return, Bytecodes::Code bc, Value receiver) {3885
assert(!callee->is_native(), "callee must not be native");
3886
if (CompilationPolicy::should_not_inline(compilation()->env(), callee)) {3887
INLINE_BAILOUT("inlining prohibited by policy");3889
// first perform tests of things it's not possible to inline
3890
if (callee->has_exception_handlers() &&
3891
!InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers");3892
if (callee->is_synchronized() &&
3893
!InlineSynchronizedMethods ) INLINE_BAILOUT("callee is synchronized");3894
if (!callee->holder()->is_linked()) INLINE_BAILOUT("callee's klass not linked yet");3895
if (bc == Bytecodes::_invokestatic &&
3896
!callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet");3897
if (!callee->has_balanced_monitors()) INLINE_BAILOUT("callee's monitors do not match");3899
// Proper inlining of methods with jsrs requires a little more work.
3900
if (callee->has_jsrs() ) INLINE_BAILOUT("jsrs not handled properly by inliner yet");3902
if (is_profiling() && !callee->ensure_method_data()) {3903
INLINE_BAILOUT("mdo allocation failed");3906
const bool is_invokedynamic = (bc == Bytecodes::_invokedynamic);
3907
const bool has_receiver = (bc != Bytecodes::_invokestatic && !is_invokedynamic);
3909
const int args_base = state()->stack_size() - callee->arg_size();
3910
assert(args_base >= 0, "stack underflow during inlining");
3912
Value recv = nullptr;
3914
assert(!callee->is_static(), "callee must not be static");
3915
assert(callee->arg_size() > 0, "must have at least a receiver");
3917
recv = state()->stack_at(args_base);
3918
if (recv->is_null_obj()) {3919
INLINE_BAILOUT("receiver is always null");3923
// now perform tests that are based on flag settings
3924
bool inlinee_by_directive = compilation()->directive()->should_inline(callee);
3925
if (callee->force_inline() || inlinee_by_directive) {3926
if (inline_level() > MaxForceInlineLevel ) INLINE_BAILOUT("MaxForceInlineLevel");3927
if (recursive_inline_level(callee) > C1MaxRecursiveInlineLevel) INLINE_BAILOUT("recursive inlining too deep");3929
const char* msg = "";
3930
if (callee->force_inline()) msg = "force inline by annotation";
3931
if (inlinee_by_directive) msg = "force inline by CompileCommand";
3932
print_inlining(callee, msg);
3934
// use heuristic controls on inlining
3935
if (inline_level() > C1MaxInlineLevel ) INLINE_BAILOUT("inlining too deep");3936
int callee_recursive_level = recursive_inline_level(callee);
3937
if (callee_recursive_level > C1MaxRecursiveInlineLevel ) INLINE_BAILOUT("recursive inlining too deep");3938
if (callee->code_size_for_inlining() > max_inline_size() ) INLINE_BAILOUT("callee is too large");3939
// Additional condition to limit stack usage for non-recursive calls.
3940
if ((callee_recursive_level == 0) &&
3941
(callee->max_stack() + callee->max_locals() - callee->size_of_parameters() > C1InlineStackLimit)) {3942
INLINE_BAILOUT("callee uses too much stack");3945
// don't inline throwable methods unless the inlining tree is rooted in a throwable class
3946
if (callee->name() == ciSymbols::object_initializer_name() &&
3947
callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {3948
// Throwable constructor call
3949
IRScope* top = scope();
3950
while (top->caller() != nullptr) {3951
top = top->caller();
3953
if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) {3954
INLINE_BAILOUT("don't inline Throwable constructors");3958
if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) {3959
INLINE_BAILOUT("total inlining greater than DesiredMethodLimit");3962
print_inlining(callee, "inline", /*success*/ true);
3965
assert(bc != Bytecodes::_invokestatic || callee->holder()->is_initialized(), "required");
3967
// NOTE: Bailouts from this point on, which occur at the
3968
// GraphBuilder level, do not cause bailout just of the inlining but
3969
// in fact of the entire compilation.
3971
BlockBegin* orig_block = block();
3973
// Insert null check if necessary
3975
// note: null check must happen even if first instruction of callee does
3976
// an implicit null check since the callee is in a different scope
3977
// and we must make sure exception handling does the right thing
3981
if (is_profiling()) {3982
// Note that we'd collect profile data in this method if we wanted it.
3983
// this may be redundant here...
3984
compilation()->set_would_profile(true);
3986
if (profile_calls()) {3988
Values* obj_args = args_list_for_profiling(callee, start, has_receiver);
3989
if (obj_args != nullptr) {3990
int s = obj_args->capacity();
3991
// if called through method handle invoke, some arguments may have been popped
3992
for (int i = args_base+start, j = 0; j < obj_args->capacity() && i < state()->stack_size(); ) {3993
Value v = state()->stack_at_inc(i);
3994
if (v->type()->is_object_kind()) {3999
check_args_for_profiling(obj_args, s);
4001
profile_call(callee, recv, holder_known ? callee->holder() : nullptr, obj_args, true);
4005
// Introduce a new callee continuation point - if the callee has
4006
// more than one return instruction or the return does not allow
4007
// fall-through of control flow, all return instructions of the
4008
// callee will need to be replaced by Goto's pointing to this
4009
// continuation point.
4010
BlockBegin* cont = block_at(next_bci());
4011
bool continuation_existed = true;
4012
if (cont == nullptr) {4013
cont = new BlockBegin(next_bci());
4014
// low number so that continuation gets parsed as early as possible
4015
cont->set_depth_first_number(0);
4016
if (PrintInitialBlockList) {4017
tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d",4018
cont->block_id(), cont->bci(), bci());
4020
continuation_existed = false;
4022
// Record number of predecessors of continuation block before
4023
// inlining, to detect if inlined method has edges to its
4024
// continuation after inlining.
4025
int continuation_preds = cont->number_of_preds();
4027
// Push callee scope
4028
push_scope(callee, cont);
4030
// the BlockListBuilder for the callee could have bailed out
4034
// Temporarily set up bytecode stream so we can append instructions
4035
// (only using the bci of this stream)
4036
scope_data()->set_stream(scope_data()->parent()->stream());
4038
// Pass parameters into callee state: add assignments
4039
// note: this will also ensure that all arguments are computed before being passed
4040
ValueStack* callee_state = state();
4041
ValueStack* caller_state = state()->caller_state();
4042
for (int i = args_base; i < caller_state->stack_size(); ) {4043
const int arg_no = i - args_base;
4044
Value arg = caller_state->stack_at_inc(i);
4045
store_local(callee_state, arg, arg_no);
4048
// Remove args from stack.
4049
// Note that we preserve locals state in case we can use it later
4050
// (see use of pop_scope() below)
4051
caller_state->truncate_stack(args_base);
4052
assert(callee_state->stack_size() == 0, "callee stack must be empty");
4054
Value lock = nullptr;
4055
BlockBegin* sync_handler = nullptr;
4057
// Inline the locking of the receiver if the callee is synchronized
4058
if (callee->is_synchronized()) {4059
lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror())))
4060
: state()->local_at(0);
4061
sync_handler = new BlockBegin(SynchronizationEntryBCI);
4062
inline_sync_entry(lock, sync_handler);
4065
if (compilation()->env()->dtrace_method_probes()) {4066
Values* args = new Values(1);
4067
args->push(append(new Constant(new MethodConstant(method()))));
4068
append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args));
4071
if (profile_inlined_calls()) {4072
profile_invocation(callee, copy_state_before_with_bci(SynchronizationEntryBCI));
4075
BlockBegin* callee_start_block = block_at(0);
4076
if (callee_start_block != nullptr) {4077
assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header");
4078
Goto* goto_callee = new Goto(callee_start_block, false);
4079
// The state for this goto is in the scope of the callee, so use
4080
// the entry bci for the callee instead of the call site bci.
4081
append_with_bci(goto_callee, 0);
4082
_block->set_end(goto_callee);
4083
callee_start_block->merge(callee_state, compilation()->has_irreducible_loops());
4085
_last = _block = callee_start_block;
4087
scope_data()->add_to_work_list(callee_start_block);
4090
// Clear out bytecode stream
4091
scope_data()->set_stream(nullptr);
4092
scope_data()->set_ignore_return(ignore_return);
4094
CompileLog* log = compilation()->log();
4095
if (log != nullptr) log->head("parse method='%d'", log->identify(callee));4097
// Ready to resume parsing in callee (either in the same block we
4098
// were in before or in the callee's start block)
4099
iterate_all_blocks(callee_start_block == nullptr);
4101
if (log != nullptr) log->done("parse");4103
// If we bailed out during parsing, return immediately (this is bad news)
4107
// iterate_all_blocks theoretically traverses in random order; in
4108
// practice, we have only traversed the continuation if we are
4109
// inlining into a subroutine
4110
assert(continuation_existed ||
4111
!continuation()->is_set(BlockBegin::was_visited_flag),
4112
"continuation should not have been parsed yet if we created it");
4114
// At this point we are almost ready to return and resume parsing of
4115
// the caller back in the GraphBuilder. The only thing we want to do
4116
// first is an optimization: during parsing of the callee we
4117
// generated at least one Goto to the continuation block. If we
4118
// generated exactly one, and if the inlined method spanned exactly
4119
// one block (and we didn't have to Goto its entry), then we snip
4120
// off the Goto to the continuation, allowing control to fall
4121
// through back into the caller block and effectively performing
4122
// block merging. This allows load elimination and CSE to take place
4123
// across multiple callee scopes if they are relatively simple, and
4124
// is currently essential to making inlining profitable.
4125
if (num_returns() == 1
4126
&& block() == orig_block
4127
&& block() == inline_cleanup_block()) {4128
_last = inline_cleanup_return_prev();
4129
_state = inline_cleanup_state();
4130
} else if (continuation_preds == cont->number_of_preds()) {4131
// Inlining caused that the instructions after the invoke in the
4132
// caller are not reachable any more. So skip filling this block
4133
// with instructions!
4134
assert(cont == continuation(), "");
4135
assert(_last && _last->as_BlockEnd(), "");
4138
// Resume parsing in continuation block unless it was already parsed.
4139
// Note that if we don't change _last here, iteration in
4140
// iterate_bytecodes_for_block will stop when we return.
4141
if (!continuation()->is_set(BlockBegin::was_visited_flag)) {4142
// add continuation to work list instead of parsing it immediately
4143
assert(_last && _last->as_BlockEnd(), "");
4144
scope_data()->parent()->add_to_work_list(continuation());
4149
// Fill the exception handler for synchronized methods with instructions
4150
if (callee->is_synchronized() && sync_handler->state() != nullptr) {4151
fill_sync_handler(lock, sync_handler);
4156
compilation()->notice_inlined_method(callee);
4162
bool GraphBuilder::try_method_handle_inline(ciMethod* callee, bool ignore_return) {4163
ValueStack* state_before = copy_state_before();
4164
vmIntrinsics::ID iid = callee->intrinsic_id();
4166
case vmIntrinsics::_invokeBasic:
4168
// get MethodHandle receiver
4169
const int args_base = state()->stack_size() - callee->arg_size();
4170
ValueType* type = state()->stack_at(args_base)->type();
4171
if (type->is_constant()) {4172
ciObject* mh = type->as_ObjectType()->constant_value();
4173
if (mh->is_method_handle()) {4174
ciMethod* target = mh->as_method_handle()->get_vmtarget();
4176
// We don't do CHA here so only inline static and statically bindable methods.
4177
if (target->is_static() || target->can_be_statically_bound()) {4178
if (ciMethod::is_consistent_info(callee, target)) {4179
Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4180
ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4181
if (try_inline(target, /*holder_known*/ !callee->is_static(), ignore_return, bc)) {4185
print_inlining(target, "signatures mismatch", /*success*/ false);
4188
assert(false, "no inlining through MH::invokeBasic"); // missing optimization opportunity due to suboptimal LF shape
4189
print_inlining(target, "not static or statically bindable", /*success*/ false);
4192
assert(mh->is_null_object(), "not a null");
4193
print_inlining(callee, "receiver is always null", /*success*/ false);
4196
print_inlining(callee, "receiver not constant", /*success*/ false);
4201
case vmIntrinsics::_linkToVirtual:
4202
case vmIntrinsics::_linkToStatic:
4203
case vmIntrinsics::_linkToSpecial:
4204
case vmIntrinsics::_linkToInterface:
4206
// pop MemberName argument
4207
const int args_base = state()->stack_size() - callee->arg_size();
4208
ValueType* type = apop()->type();
4209
if (type->is_constant()) {4210
ciMethod* target = type->as_ObjectType()->constant_value()->as_member_name()->get_vmtarget();
4211
ignore_return = ignore_return || (callee->return_type()->is_void() && !target->return_type()->is_void());
4212
// If the target is another method handle invoke, try to recursively get
4214
if (target->is_method_handle_intrinsic()) {4215
if (try_method_handle_inline(target, ignore_return)) {4218
} else if (!ciMethod::is_consistent_info(callee, target)) {4219
print_inlining(target, "signatures mismatch", /*success*/ false);
4221
ciSignature* signature = target->signature();
4222
const int receiver_skip = target->is_static() ? 0 : 1;
4223
// Cast receiver to its type.
4224
if (!target->is_static()) {4225
ciKlass* tk = signature->accessing_klass();
4226
Value obj = state()->stack_at(args_base);
4227
if (obj->exact_type() == nullptr &&
4228
obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {4229
TypeCast* c = new TypeCast(tk, obj, state_before);
4231
state()->stack_at_put(args_base, c);
4234
// Cast reference arguments to its type.
4235
for (int i = 0, j = 0; i < signature->count(); i++) {4236
ciType* t = signature->type_at(i);
4237
if (t->is_klass()) {4238
ciKlass* tk = t->as_klass();
4239
Value obj = state()->stack_at(args_base + receiver_skip + j);
4240
if (obj->exact_type() == nullptr &&
4241
obj->declared_type() != tk && tk != compilation()->env()->Object_klass()) {4242
TypeCast* c = new TypeCast(t, obj, state_before);
4244
state()->stack_at_put(args_base + receiver_skip + j, c);
4247
j += t->size(); // long and double take two slots
4249
// We don't do CHA here so only inline static and statically bindable methods.
4250
if (target->is_static() || target->can_be_statically_bound()) {4251
Bytecodes::Code bc = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokevirtual;
4252
if (try_inline(target, /*holder_known*/ !callee->is_static(), ignore_return, bc)) {4256
print_inlining(target, "not static or statically bindable", /*success*/ false);
4260
print_inlining(callee, "MemberName not constant", /*success*/ false);
4265
case vmIntrinsics::_linkToNative:
4266
print_inlining(callee, "native call", /*success*/ false);
4270
fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));4273
set_state(state_before->copy_for_parsing());
4278
void GraphBuilder::inline_bailout(const char* msg) {4279
assert(msg != nullptr, "inline bailout msg must exist");
4280
_inline_bailout_msg = msg;
4284
void GraphBuilder::clear_inline_bailout() {4285
_inline_bailout_msg = nullptr;
4289
void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) {4290
ScopeData* data = new ScopeData(nullptr);
4291
data->set_scope(scope);
4292
data->set_bci2block(bci2block);
4298
void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) {4299
IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false);
4300
scope()->add_callee(callee_scope);
4302
BlockListBuilder blb(compilation(), callee_scope, -1);
4305
if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) {4306
// this scope can be inlined directly into the caller so remove
4307
// the block at bci 0.
4308
blb.bci2block()->at_put(0, nullptr);
4311
set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci())));
4313
ScopeData* data = new ScopeData(scope_data());
4314
data->set_scope(callee_scope);
4315
data->set_bci2block(blb.bci2block());
4316
data->set_continuation(continuation);
4321
void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) {4322
ScopeData* data = new ScopeData(scope_data());
4323
data->set_parsing_jsr();
4324
data->set_jsr_entry_bci(jsr_dest_bci);
4325
data->set_jsr_return_address_local(-1);
4326
// Must clone bci2block list as we will be mutating it in order to
4327
// properly clone all blocks in jsr region as well as exception
4328
// handlers containing rets
4329
BlockList* new_bci2block = new BlockList(bci2block()->length());
4330
new_bci2block->appendAll(bci2block());
4331
data->set_bci2block(new_bci2block);
4332
data->set_scope(scope());
4333
data->setup_jsr_xhandlers();
4334
data->set_continuation(continuation());
4335
data->set_jsr_continuation(jsr_continuation);
4340
void GraphBuilder::pop_scope() {4341
int number_of_locks = scope()->number_of_locks();
4342
_scope_data = scope_data()->parent();
4343
// accumulate minimum number of monitor slots to be reserved
4344
scope()->set_min_number_of_locks(number_of_locks);
4348
void GraphBuilder::pop_scope_for_jsr() {4349
_scope_data = scope_data()->parent();
4352
void GraphBuilder::append_unsafe_get(ciMethod* callee, BasicType t, bool is_volatile) {4353
Values* args = state()->pop_arguments(callee->arg_size());
4354
null_check(args->at(0));
4355
Instruction* offset = args->at(2);
4357
offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4359
Instruction* op = append(new UnsafeGet(t, args->at(1), offset, is_volatile));
4360
push(op->type(), op);
4361
compilation()->set_has_unsafe_access(true);
4365
void GraphBuilder::append_unsafe_put(ciMethod* callee, BasicType t, bool is_volatile) {4366
Values* args = state()->pop_arguments(callee->arg_size());
4367
null_check(args->at(0));
4368
Instruction* offset = args->at(2);
4370
offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4372
Value val = args->at(3);
4373
if (t == T_BOOLEAN) {4374
Value mask = append(new Constant(new IntConstant(1)));
4375
val = append(new LogicOp(Bytecodes::_iand, val, mask));
4377
Instruction* op = append(new UnsafePut(t, args->at(1), offset, val, is_volatile));
4378
compilation()->set_has_unsafe_access(true);
4382
void GraphBuilder::append_unsafe_CAS(ciMethod* callee) {4383
ValueStack* state_before = copy_state_for_exception();
4384
ValueType* result_type = as_ValueType(callee->return_type());
4385
assert(result_type->is_int(), "int result");
4386
Values* args = state()->pop_arguments(callee->arg_size());
4388
// Pop off some args to specially handle, then push back
4389
Value newval = args->pop();
4390
Value cmpval = args->pop();
4391
Value offset = args->pop();
4392
Value src = args->pop();
4393
Value unsafe_obj = args->pop();
4395
// Separately handle the unsafe arg. It is not needed for code
4396
// generation, but must be null checked
4397
null_check(unsafe_obj);
4400
offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4408
// An unsafe CAS can alias with other field accesses, but we don't
4409
// know which ones so mark the state as no preserved. This will
4410
// cause CSE to invalidate memory across it.
4411
bool preserves_state = false;
4412
Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state);
4413
append_split(result);
4414
push(result_type, result);
4415
compilation()->set_has_unsafe_access(true);
4418
void GraphBuilder::append_char_access(ciMethod* callee, bool is_store) {4419
// This intrinsic accesses byte[] array as char[] array. Computing the offsets
4420
// correctly requires matched array shapes.
4421
assert (arrayOopDesc::base_offset_in_bytes(T_CHAR) == arrayOopDesc::base_offset_in_bytes(T_BYTE),
4422
"sanity: byte[] and char[] bases agree");
4423
assert (type2aelembytes(T_CHAR) == type2aelembytes(T_BYTE)*2,
4424
"sanity: byte[] and char[] scales agree");
4426
ValueStack* state_before = copy_state_indexed_access();
4427
compilation()->set_has_access_indexed(true);
4428
Values* args = state()->pop_arguments(callee->arg_size());
4429
Value array = args->at(0);
4430
Value index = args->at(1);
4432
Value value = args->at(2);
4433
Instruction* store = append(new StoreIndexed(array, index, nullptr, T_CHAR, value, state_before, false, true));
4434
store->set_flag(Instruction::NeedsRangeCheckFlag, false);
4435
_memory->store_value(value);
4437
Instruction* load = append(new LoadIndexed(array, index, nullptr, T_CHAR, state_before, true));
4438
load->set_flag(Instruction::NeedsRangeCheckFlag, false);
4439
push(load->type(), load);
4443
void GraphBuilder::append_alloc_array_copy(ciMethod* callee) {4444
const int args_base = state()->stack_size() - callee->arg_size();
4445
ciType* receiver_type = state()->stack_at(args_base)->exact_type();
4446
if (receiver_type == nullptr) {4447
inline_bailout("must have a receiver");4450
if (!receiver_type->is_type_array_klass()) {4451
inline_bailout("clone array not primitive");4455
ValueStack* state_before = copy_state_before();
4456
state_before->set_force_reexecute();
4458
BasicType basic_type = src->exact_type()->as_array_klass()->element_type()->basic_type();
4459
Value length = append(new ArrayLength(src, state_before));
4460
Value new_array = append_split(new NewTypeArray(length, basic_type, state_before, false));
4462
ValueType* result_type = as_ValueType(callee->return_type());
4463
vmIntrinsics::ID id = vmIntrinsics::_arraycopy;
4464
Values* args = new Values(5);
4466
args->push(append(new Constant(new IntConstant(0))));
4467
args->push(new_array);
4468
args->push(append(new Constant(new IntConstant(0))));
4470
const bool has_receiver = true;
4471
Intrinsic* array_copy = new Intrinsic(result_type, id,
4472
args, has_receiver, state_before,
4473
vmIntrinsics::preserves_state(id),
4474
vmIntrinsics::can_trap(id));
4475
array_copy->set_flag(Instruction::OmitChecksFlag, true);
4476
append_split(array_copy);
4478
append(new MemBar(lir_membar_storestore));
4481
void GraphBuilder::print_inlining(ciMethod* callee, const char* msg, bool success) {4482
CompileLog* log = compilation()->log();
4483
if (log != nullptr) {4484
assert(msg != nullptr, "inlining msg should not be null!");
4486
log->inline_success(msg);
4488
log->inline_fail(msg);
4491
EventCompilerInlining event;
4492
if (event.should_commit()) {4493
CompilerEvent::InlineEvent::post(event, compilation()->env()->task()->compile_id(), method()->get_Method(), callee, success, msg, bci());
4496
CompileTask::print_inlining_ul(callee, scope()->level(), bci(), inlining_result_of(success), msg);
4498
if (!compilation()->directive()->PrintInliningOption) {4501
CompileTask::print_inlining_tty(callee, scope()->level(), bci(), inlining_result_of(success), msg);
4502
if (success && CIPrintMethodCodes) {4503
callee->print_codes();
4507
void GraphBuilder::append_unsafe_get_and_set(ciMethod* callee, bool is_add) {4508
Values* args = state()->pop_arguments(callee->arg_size());
4509
BasicType t = callee->return_type()->basic_type();
4510
null_check(args->at(0));
4511
Instruction* offset = args->at(2);
4513
offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT)));
4515
Instruction* op = append(new UnsafeGetAndSet(t, args->at(1), offset, args->at(3), is_add));
4516
compilation()->set_has_unsafe_access(true);
4518
push(op->type(), op);
4522
void GraphBuilder::print_stats() {4523
if (UseLocalValueNumbering) {4529
void GraphBuilder::profile_call(ciMethod* callee, Value recv, ciKlass* known_holder, Values* obj_args, bool inlined) {4530
assert(known_holder == nullptr || (known_holder->is_instance_klass() &&
4531
(!known_holder->is_interface() ||
4532
((ciInstanceKlass*)known_holder)->has_nonstatic_concrete_methods())), "should be non-static concrete method");
4533
if (known_holder != nullptr) {4534
if (known_holder->exact_klass() == nullptr) {4535
known_holder = compilation()->cha_exact_type(known_holder);
4539
append(new ProfileCall(method(), bci(), callee, recv, known_holder, obj_args, inlined));
4542
void GraphBuilder::profile_return_type(Value ret, ciMethod* callee, ciMethod* m, int invoke_bci) {4543
assert((m == nullptr) == (invoke_bci < 0), "invalid method and invalid bci together");
4547
if (invoke_bci < 0) {4550
ciMethodData* md = m->method_data_or_null();
4551
ciProfileData* data = md->bci_to_data(invoke_bci);
4552
if (data != nullptr && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {4553
bool has_return = data->is_CallTypeData() ? ((ciCallTypeData*)data)->has_return() : ((ciVirtualCallTypeData*)data)->has_return();
4555
append(new ProfileReturnType(m , invoke_bci, callee, ret));
4560
void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) {4561
append(new ProfileInvoke(callee, state));