1 /*
2 * Copyright (c) 2005, 2019, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "c1/c1_Compilation.hpp"
27 #include "c1/c1_Defs.hpp"
28 #include "c1/c1_FrameMap.hpp"
29 #include "c1/c1_Instruction.hpp"
30 #include "c1/c1_LIRAssembler.hpp"
31 #include "c1/c1_LIRGenerator.hpp"
32 #include "c1/c1_ValueStack.hpp"
33 #include "ci/ciArrayKlass.hpp"
34 #include "ci/ciInstance.hpp"
35 #include "ci/ciObjArray.hpp"
36 #include "ci/ciUtilities.hpp"
37 #include "ci/ciValueArrayKlass.hpp"
38 #include "ci/ciValueKlass.hpp"
39 #include "gc/shared/barrierSet.hpp"
40 #include "gc/shared/c1/barrierSetC1.hpp"
41 #include "runtime/arguments.hpp"
42 #include "runtime/sharedRuntime.hpp"
43 #include "runtime/stubRoutines.hpp"
44 #include "runtime/vm_version.hpp"
45 #include "utilities/bitMap.inline.hpp"
46 #include "utilities/macros.hpp"
47
48 #ifdef ASSERT
49 #define __ gen()->lir(__FILE__, __LINE__)->
50 #else
51 #define __ gen()->lir()->
52 #endif
53
54 #ifndef PATCHED_ADDR
55 #define PATCHED_ADDR (max_jint)
56 #endif
57
58 void PhiResolverState::reset(int max_vregs) {
59 // Initialize array sizes
60 _virtual_operands.at_put_grow(max_vregs - 1, NULL, NULL);
61 _virtual_operands.trunc_to(0);
62 _other_operands.at_put_grow(max_vregs - 1, NULL, NULL);
63 _other_operands.trunc_to(0);
64 _vreg_table.at_put_grow(max_vregs - 1, NULL, NULL);
65 _vreg_table.trunc_to(0);
66 }
67
68
69
70 //--------------------------------------------------------------
71 // PhiResolver
72
73 // Resolves cycles:
74 //
75 // r1 := r2 becomes temp := r1
76 // r2 := r1 r1 := r2
77 // r2 := temp
78 // and orders moves:
79 //
80 // r2 := r3 becomes r1 := r2
81 // r1 := r2 r2 := r3
82
83 PhiResolver::PhiResolver(LIRGenerator* gen, int max_vregs)
84 : _gen(gen)
85 , _state(gen->resolver_state())
86 , _temp(LIR_OprFact::illegalOpr)
87 {
88 // reinitialize the shared state arrays
89 _state.reset(max_vregs);
90 }
91
92
93 void PhiResolver::emit_move(LIR_Opr src, LIR_Opr dest) {
94 assert(src->is_valid(), "");
95 assert(dest->is_valid(), "");
96 __ move(src, dest);
97 }
98
99
100 void PhiResolver::move_temp_to(LIR_Opr dest) {
101 assert(_temp->is_valid(), "");
102 emit_move(_temp, dest);
103 NOT_PRODUCT(_temp = LIR_OprFact::illegalOpr);
104 }
105
106
107 void PhiResolver::move_to_temp(LIR_Opr src) {
108 assert(_temp->is_illegal(), "");
109 _temp = _gen->new_register(src->type());
110 emit_move(src, _temp);
111 }
112
113
114 // Traverse assignment graph in depth first order and generate moves in post order
115 // ie. two assignments: b := c, a := b start with node c:
116 // Call graph: move(NULL, c) -> move(c, b) -> move(b, a)
117 // Generates moves in this order: move b to a and move c to b
118 // ie. cycle a := b, b := a start with node a
119 // Call graph: move(NULL, a) -> move(a, b) -> move(b, a)
120 // Generates moves in this order: move b to temp, move a to b, move temp to a
121 void PhiResolver::move(ResolveNode* src, ResolveNode* dest) {
122 if (!dest->visited()) {
123 dest->set_visited();
124 for (int i = dest->no_of_destinations()-1; i >= 0; i --) {
125 move(dest, dest->destination_at(i));
126 }
127 } else if (!dest->start_node()) {
128 // cylce in graph detected
129 assert(_loop == NULL, "only one loop valid!");
130 _loop = dest;
131 move_to_temp(src->operand());
132 return;
133 } // else dest is a start node
134
135 if (!dest->assigned()) {
136 if (_loop == dest) {
137 move_temp_to(dest->operand());
138 dest->set_assigned();
139 } else if (src != NULL) {
140 emit_move(src->operand(), dest->operand());
141 dest->set_assigned();
142 }
143 }
144 }
145
146
147 PhiResolver::~PhiResolver() {
148 int i;
149 // resolve any cycles in moves from and to virtual registers
150 for (i = virtual_operands().length() - 1; i >= 0; i --) {
151 ResolveNode* node = virtual_operands().at(i);
152 if (!node->visited()) {
153 _loop = NULL;
154 move(NULL, node);
155 node->set_start_node();
156 assert(_temp->is_illegal(), "move_temp_to() call missing");
157 }
158 }
159
160 // generate move for move from non virtual register to abitrary destination
161 for (i = other_operands().length() - 1; i >= 0; i --) {
162 ResolveNode* node = other_operands().at(i);
163 for (int j = node->no_of_destinations() - 1; j >= 0; j --) {
164 emit_move(node->operand(), node->destination_at(j)->operand());
165 }
166 }
167 }
168
169
170 ResolveNode* PhiResolver::create_node(LIR_Opr opr, bool source) {
171 ResolveNode* node;
172 if (opr->is_virtual()) {
173 int vreg_num = opr->vreg_number();
174 node = vreg_table().at_grow(vreg_num, NULL);
175 assert(node == NULL || node->operand() == opr, "");
176 if (node == NULL) {
177 node = new ResolveNode(opr);
178 vreg_table().at_put(vreg_num, node);
179 }
180 // Make sure that all virtual operands show up in the list when
181 // they are used as the source of a move.
182 if (source && !virtual_operands().contains(node)) {
183 virtual_operands().append(node);
184 }
185 } else {
186 assert(source, "");
187 node = new ResolveNode(opr);
188 other_operands().append(node);
189 }
190 return node;
191 }
192
193
194 void PhiResolver::move(LIR_Opr src, LIR_Opr dest) {
195 assert(dest->is_virtual(), "");
196 // tty->print("move "); src->print(); tty->print(" to "); dest->print(); tty->cr();
197 assert(src->is_valid(), "");
198 assert(dest->is_valid(), "");
199 ResolveNode* source = source_node(src);
200 source->append(destination_node(dest));
201 }
202
203
204 //--------------------------------------------------------------
205 // LIRItem
206
207 void LIRItem::set_result(LIR_Opr opr) {
208 assert(value()->operand()->is_illegal() || value()->operand()->is_constant(), "operand should never change");
209 value()->set_operand(opr);
210
211 if (opr->is_virtual()) {
212 _gen->_instruction_for_operand.at_put_grow(opr->vreg_number(), value(), NULL);
213 }
214
215 _result = opr;
216 }
217
218 void LIRItem::load_item() {
219 if (result()->is_illegal()) {
220 // update the items result
221 _result = value()->operand();
222 }
223 if (!result()->is_register()) {
224 LIR_Opr reg = _gen->new_register(value()->type());
225 __ move(result(), reg);
226 if (result()->is_constant()) {
227 _result = reg;
228 } else {
229 set_result(reg);
230 }
231 }
232 }
233
234
235 void LIRItem::load_for_store(BasicType type) {
236 if (_gen->can_store_as_constant(value(), type)) {
237 _result = value()->operand();
238 if (!_result->is_constant()) {
239 _result = LIR_OprFact::value_type(value()->type());
240 }
241 } else if (type == T_BYTE || type == T_BOOLEAN) {
242 load_byte_item();
243 } else {
244 load_item();
245 }
246 }
247
248 void LIRItem::load_item_force(LIR_Opr reg) {
249 LIR_Opr r = result();
250 if (r != reg) {
251 #if !defined(ARM) && !defined(E500V2)
252 if (r->type() != reg->type()) {
253 // moves between different types need an intervening spill slot
254 r = _gen->force_to_spill(r, reg->type());
255 }
256 #endif
257 __ move(r, reg);
258 _result = reg;
259 }
260 }
261
262 ciObject* LIRItem::get_jobject_constant() const {
263 ObjectType* oc = type()->as_ObjectType();
264 if (oc) {
265 return oc->constant_value();
266 }
267 return NULL;
268 }
269
270
271 jint LIRItem::get_jint_constant() const {
272 assert(is_constant() && value() != NULL, "");
273 assert(type()->as_IntConstant() != NULL, "type check");
274 return type()->as_IntConstant()->value();
275 }
276
277
278 jint LIRItem::get_address_constant() const {
279 assert(is_constant() && value() != NULL, "");
280 assert(type()->as_AddressConstant() != NULL, "type check");
281 return type()->as_AddressConstant()->value();
282 }
283
284
285 jfloat LIRItem::get_jfloat_constant() const {
286 assert(is_constant() && value() != NULL, "");
287 assert(type()->as_FloatConstant() != NULL, "type check");
288 return type()->as_FloatConstant()->value();
289 }
290
291
292 jdouble LIRItem::get_jdouble_constant() const {
293 assert(is_constant() && value() != NULL, "");
294 assert(type()->as_DoubleConstant() != NULL, "type check");
295 return type()->as_DoubleConstant()->value();
296 }
297
298
299 jlong LIRItem::get_jlong_constant() const {
300 assert(is_constant() && value() != NULL, "");
301 assert(type()->as_LongConstant() != NULL, "type check");
302 return type()->as_LongConstant()->value();
303 }
304
305
306
307 //--------------------------------------------------------------
308
309
310 void LIRGenerator::block_do_prolog(BlockBegin* block) {
311 #ifndef PRODUCT
312 if (PrintIRWithLIR) {
313 block->print();
314 }
315 #endif
316
317 // set up the list of LIR instructions
318 assert(block->lir() == NULL, "LIR list already computed for this block");
319 _lir = new LIR_List(compilation(), block);
320 block->set_lir(_lir);
321
322 __ branch_destination(block->label());
323
324 if (LIRTraceExecution &&
325 Compilation::current()->hir()->start()->block_id() != block->block_id() &&
326 !block->is_set(BlockBegin::exception_entry_flag)) {
327 assert(block->lir()->instructions_list()->length() == 1, "should come right after br_dst");
328 trace_block_entry(block);
329 }
330 }
331
332
333 void LIRGenerator::block_do_epilog(BlockBegin* block) {
334 #ifndef PRODUCT
335 if (PrintIRWithLIR) {
336 tty->cr();
337 }
338 #endif
339
340 // LIR_Opr for unpinned constants shouldn't be referenced by other
341 // blocks so clear them out after processing the block.
342 for (int i = 0; i < _unpinned_constants.length(); i++) {
343 _unpinned_constants.at(i)->clear_operand();
344 }
345 _unpinned_constants.trunc_to(0);
346
347 // clear our any registers for other local constants
348 _constants.trunc_to(0);
349 _reg_for_constants.trunc_to(0);
350 }
351
352
353 void LIRGenerator::block_do(BlockBegin* block) {
354 CHECK_BAILOUT();
355
356 block_do_prolog(block);
357 set_block(block);
358
359 for (Instruction* instr = block; instr != NULL; instr = instr->next()) {
360 if (instr->is_pinned()) do_root(instr);
361 }
362
363 set_block(NULL);
364 block_do_epilog(block);
365 }
366
367
368 //-------------------------LIRGenerator-----------------------------
369
370 // This is where the tree-walk starts; instr must be root;
371 void LIRGenerator::do_root(Value instr) {
372 CHECK_BAILOUT();
373
374 InstructionMark im(compilation(), instr);
375
376 assert(instr->is_pinned(), "use only with roots");
377 assert(instr->subst() == instr, "shouldn't have missed substitution");
378
379 instr->visit(this);
380
381 assert(!instr->has_uses() || instr->operand()->is_valid() ||
382 instr->as_Constant() != NULL || bailed_out(), "invalid item set");
383 }
384
385
386 // This is called for each node in tree; the walk stops if a root is reached
387 void LIRGenerator::walk(Value instr) {
388 InstructionMark im(compilation(), instr);
389 //stop walk when encounter a root
390 if ((instr->is_pinned() && instr->as_Phi() == NULL) || instr->operand()->is_valid()) {
391 assert(instr->operand() != LIR_OprFact::illegalOpr || instr->as_Constant() != NULL, "this root has not yet been visited");
392 } else {
393 assert(instr->subst() == instr, "shouldn't have missed substitution");
394 instr->visit(this);
395 // assert(instr->use_count() > 0 || instr->as_Phi() != NULL, "leaf instruction must have a use");
396 }
397 }
398
399
400 CodeEmitInfo* LIRGenerator::state_for(Instruction* x, ValueStack* state, bool ignore_xhandler) {
401 assert(state != NULL, "state must be defined");
402
403 #ifndef PRODUCT
404 state->verify();
405 #endif
406
407 ValueStack* s = state;
408 for_each_state(s) {
409 if (s->kind() == ValueStack::EmptyExceptionState) {
410 assert(s->stack_size() == 0 && s->locals_size() == 0 && (s->locks_size() == 0 || s->locks_size() == 1), "state must be empty");
411 continue;
412 }
413
414 int index;
415 Value value;
416 for_each_stack_value(s, index, value) {
417 assert(value->subst() == value, "missed substitution");
418 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
419 walk(value);
420 assert(value->operand()->is_valid(), "must be evaluated now");
421 }
422 }
423
424 int bci = s->bci();
425 IRScope* scope = s->scope();
426 ciMethod* method = scope->method();
427
428 MethodLivenessResult liveness = method->liveness_at_bci(bci);
429 if (bci == SynchronizationEntryBCI) {
430 if (x->as_ExceptionObject() || x->as_Throw()) {
431 // all locals are dead on exit from the synthetic unlocker
432 liveness.clear();
433 } else {
434 assert(x->as_MonitorEnter() || x->as_ProfileInvoke(), "only other cases are MonitorEnter and ProfileInvoke");
435 }
436 }
437 if (!liveness.is_valid()) {
438 // Degenerate or breakpointed method.
439 bailout("Degenerate or breakpointed method");
440 } else {
441 assert((int)liveness.size() == s->locals_size(), "error in use of liveness");
442 for_each_local_value(s, index, value) {
443 assert(value->subst() == value, "missed substition");
444 if (liveness.at(index) && !value->type()->is_illegal()) {
445 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
446 walk(value);
447 assert(value->operand()->is_valid(), "must be evaluated now");
448 }
449 } else {
450 // NULL out this local so that linear scan can assume that all non-NULL values are live.
451 s->invalidate_local(index);
452 }
453 }
454 }
455 }
456
457 return new CodeEmitInfo(state, ignore_xhandler ? NULL : x->exception_handlers(), x->check_flag(Instruction::DeoptimizeOnException));
458 }
459
460
461 CodeEmitInfo* LIRGenerator::state_for(Instruction* x) {
462 return state_for(x, x->exception_state());
463 }
464
465
466 void LIRGenerator::klass2reg_with_patching(LIR_Opr r, ciMetadata* obj, CodeEmitInfo* info, bool need_resolve) {
467 /* C2 relies on constant pool entries being resolved (ciTypeFlow), so if TieredCompilation
468 * is active and the class hasn't yet been resolved we need to emit a patch that resolves
469 * the class. */
470 if ((TieredCompilation && need_resolve) || !obj->is_loaded() || PatchALot) {
471 assert(info != NULL, "info must be set if class is not loaded");
472 __ klass2reg_patch(NULL, r, info);
473 } else {
474 // no patching needed
475 __ metadata2reg(obj->constant_encoding(), r);
476 }
477 }
478
479
480 void LIRGenerator::array_range_check(LIR_Opr array, LIR_Opr index,
481 CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info) {
482 CodeStub* stub = new RangeCheckStub(range_check_info, index, array);
483 if (index->is_constant()) {
484 cmp_mem_int(lir_cond_belowEqual, array, arrayOopDesc::length_offset_in_bytes(),
485 index->as_jint(), null_check_info);
486 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
487 } else {
488 cmp_reg_mem(lir_cond_aboveEqual, index, array,
489 arrayOopDesc::length_offset_in_bytes(), T_INT, null_check_info);
490 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
491 }
492 }
493
494
495 void LIRGenerator::nio_range_check(LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info) {
496 CodeStub* stub = new RangeCheckStub(info, index);
497 if (index->is_constant()) {
498 cmp_mem_int(lir_cond_belowEqual, buffer, java_nio_Buffer::limit_offset(), index->as_jint(), info);
499 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
500 } else {
501 cmp_reg_mem(lir_cond_aboveEqual, index, buffer,
502 java_nio_Buffer::limit_offset(), T_INT, info);
503 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
504 }
505 __ move(index, result);
506 }
507
508
509
510 void LIRGenerator::arithmetic_op(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp_op, CodeEmitInfo* info) {
511 LIR_Opr result_op = result;
512 LIR_Opr left_op = left;
513 LIR_Opr right_op = right;
514
515 if (TwoOperandLIRForm && left_op != result_op) {
516 assert(right_op != result_op, "malformed");
517 __ move(left_op, result_op);
518 left_op = result_op;
519 }
520
521 switch(code) {
522 case Bytecodes::_dadd:
523 case Bytecodes::_fadd:
524 case Bytecodes::_ladd:
525 case Bytecodes::_iadd: __ add(left_op, right_op, result_op); break;
526 case Bytecodes::_fmul:
527 case Bytecodes::_lmul: __ mul(left_op, right_op, result_op); break;
528
529 case Bytecodes::_dmul:
530 {
531 if (is_strictfp) {
532 __ mul_strictfp(left_op, right_op, result_op, tmp_op); break;
533 } else {
534 __ mul(left_op, right_op, result_op); break;
535 }
536 }
537 break;
538
539 case Bytecodes::_imul:
540 {
541 bool did_strength_reduce = false;
542
543 if (right->is_constant()) {
544 jint c = right->as_jint();
545 if (c > 0 && is_power_of_2(c)) {
546 // do not need tmp here
547 __ shift_left(left_op, exact_log2(c), result_op);
548 did_strength_reduce = true;
549 } else {
550 did_strength_reduce = strength_reduce_multiply(left_op, c, result_op, tmp_op);
551 }
552 }
553 // we couldn't strength reduce so just emit the multiply
554 if (!did_strength_reduce) {
555 __ mul(left_op, right_op, result_op);
556 }
557 }
558 break;
559
560 case Bytecodes::_dsub:
561 case Bytecodes::_fsub:
562 case Bytecodes::_lsub:
563 case Bytecodes::_isub: __ sub(left_op, right_op, result_op); break;
564
565 case Bytecodes::_fdiv: __ div (left_op, right_op, result_op); break;
566 // ldiv and lrem are implemented with a direct runtime call
567
568 case Bytecodes::_ddiv:
569 {
570 if (is_strictfp) {
571 __ div_strictfp (left_op, right_op, result_op, tmp_op); break;
572 } else {
573 __ div (left_op, right_op, result_op); break;
574 }
575 }
576 break;
577
578 case Bytecodes::_drem:
579 case Bytecodes::_frem: __ rem (left_op, right_op, result_op); break;
580
581 default: ShouldNotReachHere();
582 }
583 }
584
585
586 void LIRGenerator::arithmetic_op_int(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp) {
587 arithmetic_op(code, result, left, right, false, tmp);
588 }
589
590
591 void LIRGenerator::arithmetic_op_long(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info) {
592 arithmetic_op(code, result, left, right, false, LIR_OprFact::illegalOpr, info);
593 }
594
595
596 void LIRGenerator::arithmetic_op_fpu(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp) {
597 arithmetic_op(code, result, left, right, is_strictfp, tmp);
598 }
599
600
601 void LIRGenerator::shift_op(Bytecodes::Code code, LIR_Opr result_op, LIR_Opr value, LIR_Opr count, LIR_Opr tmp) {
602
603 if (TwoOperandLIRForm && value != result_op
604 // Only 32bit right shifts require two operand form on S390.
605 S390_ONLY(&& (code == Bytecodes::_ishr || code == Bytecodes::_iushr))) {
606 assert(count != result_op, "malformed");
607 __ move(value, result_op);
608 value = result_op;
609 }
610
611 assert(count->is_constant() || count->is_register(), "must be");
612 switch(code) {
613 case Bytecodes::_ishl:
614 case Bytecodes::_lshl: __ shift_left(value, count, result_op, tmp); break;
615 case Bytecodes::_ishr:
616 case Bytecodes::_lshr: __ shift_right(value, count, result_op, tmp); break;
617 case Bytecodes::_iushr:
618 case Bytecodes::_lushr: __ unsigned_shift_right(value, count, result_op, tmp); break;
619 default: ShouldNotReachHere();
620 }
621 }
622
623
624 void LIRGenerator::logic_op (Bytecodes::Code code, LIR_Opr result_op, LIR_Opr left_op, LIR_Opr right_op) {
625 if (TwoOperandLIRForm && left_op != result_op) {
626 assert(right_op != result_op, "malformed");
627 __ move(left_op, result_op);
628 left_op = result_op;
629 }
630
631 switch(code) {
632 case Bytecodes::_iand:
633 case Bytecodes::_land: __ logical_and(left_op, right_op, result_op); break;
634
635 case Bytecodes::_ior:
636 case Bytecodes::_lor: __ logical_or(left_op, right_op, result_op); break;
637
638 case Bytecodes::_ixor:
639 case Bytecodes::_lxor: __ logical_xor(left_op, right_op, result_op); break;
640
641 default: ShouldNotReachHere();
642 }
643 }
644
645
646 void LIRGenerator::monitor_enter(LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no,
647 CodeEmitInfo* info_for_exception, CodeEmitInfo* info, CodeStub* throw_imse_stub) {
648 if (!GenerateSynchronizationCode) return;
649 // for slow path, use debug info for state after successful locking
650 CodeStub* slow_path = new MonitorEnterStub(object, lock, info, throw_imse_stub, scratch);
651 __ load_stack_address_monitor(monitor_no, lock);
652 // for handling NullPointerException, use debug info representing just the lock stack before this monitorenter
653 __ lock_object(hdr, object, lock, scratch, slow_path, info_for_exception, throw_imse_stub);
654 }
655
656
657 void LIRGenerator::monitor_exit(LIR_Opr object, LIR_Opr lock, LIR_Opr new_hdr, LIR_Opr scratch, int monitor_no) {
658 if (!GenerateSynchronizationCode) return;
659 // setup registers
660 LIR_Opr hdr = lock;
661 lock = new_hdr;
662 CodeStub* slow_path = new MonitorExitStub(lock, UseFastLocking, monitor_no);
663 __ load_stack_address_monitor(monitor_no, lock);
664 __ unlock_object(hdr, object, lock, scratch, slow_path);
665 }
666
667 #ifndef PRODUCT
668 void LIRGenerator::print_if_not_loaded(const NewInstance* new_instance) {
669 if (PrintNotLoaded && !new_instance->klass()->is_loaded()) {
670 tty->print_cr(" ###class not loaded at new bci %d", new_instance->printable_bci());
671 } else if (PrintNotLoaded && (TieredCompilation && new_instance->is_unresolved())) {
672 tty->print_cr(" ###class not resolved at new bci %d", new_instance->printable_bci());
673 }
674 }
675 #endif
676
677 void LIRGenerator::new_instance(LIR_Opr dst, ciInstanceKlass* klass, bool is_unresolved, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info) {
678 klass2reg_with_patching(klass_reg, klass, info, is_unresolved);
679 // If klass is not loaded we do not know if the klass has finalizers:
680 if (UseFastNewInstance && klass->is_loaded()
681 && !Klass::layout_helper_needs_slow_path(klass->layout_helper())) {
682
683 Runtime1::StubID stub_id = klass->is_initialized() ? Runtime1::fast_new_instance_id : Runtime1::fast_new_instance_init_check_id;
684
685 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, stub_id);
686
687 assert(klass->is_loaded(), "must be loaded");
688 // allocate space for instance
689 assert(klass->size_helper() >= 0, "illegal instance size");
690 const int instance_size = align_object_size(klass->size_helper());
691 __ allocate_object(dst, scratch1, scratch2, scratch3, scratch4,
692 oopDesc::header_size(), instance_size, klass_reg, !klass->is_initialized(), slow_path);
693 } else {
694 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, Runtime1::new_instance_id);
695 __ branch(lir_cond_always, T_ILLEGAL, slow_path);
696 __ branch_destination(slow_path->continuation());
697 }
698 }
699
700
701 static bool is_constant_zero(Instruction* inst) {
702 IntConstant* c = inst->type()->as_IntConstant();
703 if (c) {
704 return (c->value() == 0);
705 }
706 return false;
707 }
708
709
710 static bool positive_constant(Instruction* inst) {
711 IntConstant* c = inst->type()->as_IntConstant();
712 if (c) {
713 return (c->value() >= 0);
714 }
715 return false;
716 }
717
718
719 static ciArrayKlass* as_array_klass(ciType* type) {
720 if (type != NULL && type->is_array_klass() && type->is_loaded()) {
721 return (ciArrayKlass*)type;
722 } else {
723 return NULL;
724 }
725 }
726
727 static ciType* phi_declared_type(Phi* phi) {
728 ciType* t = phi->operand_at(0)->declared_type();
729 if (t == NULL) {
730 return NULL;
731 }
732 for(int i = 1; i < phi->operand_count(); i++) {
733 if (t != phi->operand_at(i)->declared_type()) {
734 return NULL;
735 }
736 }
737 return t;
738 }
739
740 void LIRGenerator::arraycopy_helper(Intrinsic* x, int* flagsp, ciArrayKlass** expected_typep) {
741 Instruction* src = x->argument_at(0);
742 Instruction* src_pos = x->argument_at(1);
743 Instruction* dst = x->argument_at(2);
744 Instruction* dst_pos = x->argument_at(3);
745 Instruction* length = x->argument_at(4);
746
747 // first try to identify the likely type of the arrays involved
748 ciArrayKlass* expected_type = NULL;
749 bool is_exact = false, src_objarray = false, dst_objarray = false;
750 {
751 ciArrayKlass* src_exact_type = as_array_klass(src->exact_type());
752 ciArrayKlass* src_declared_type = as_array_klass(src->declared_type());
753 Phi* phi;
754 if (src_declared_type == NULL && (phi = src->as_Phi()) != NULL) {
755 src_declared_type = as_array_klass(phi_declared_type(phi));
756 }
757 ciArrayKlass* dst_exact_type = as_array_klass(dst->exact_type());
758 ciArrayKlass* dst_declared_type = as_array_klass(dst->declared_type());
759 if (dst_declared_type == NULL && (phi = dst->as_Phi()) != NULL) {
760 dst_declared_type = as_array_klass(phi_declared_type(phi));
761 }
762
763 if (src_exact_type != NULL && src_exact_type == dst_exact_type) {
764 // the types exactly match so the type is fully known
765 is_exact = true;
766 expected_type = src_exact_type;
767 } else if (dst_exact_type != NULL && dst_exact_type->is_obj_array_klass()) {
768 ciArrayKlass* dst_type = (ciArrayKlass*) dst_exact_type;
769 ciArrayKlass* src_type = NULL;
770 if (src_exact_type != NULL && src_exact_type->is_obj_array_klass()) {
771 src_type = (ciArrayKlass*) src_exact_type;
772 } else if (src_declared_type != NULL && src_declared_type->is_obj_array_klass()) {
773 src_type = (ciArrayKlass*) src_declared_type;
774 }
775 if (src_type != NULL) {
776 if (src_type->element_type()->is_subtype_of(dst_type->element_type())) {
777 is_exact = true;
778 expected_type = dst_type;
779 }
780 }
781 }
782 // at least pass along a good guess
783 if (expected_type == NULL) expected_type = dst_exact_type;
784 if (expected_type == NULL) expected_type = src_declared_type;
785 if (expected_type == NULL) expected_type = dst_declared_type;
786
787 src_objarray = (src_exact_type && src_exact_type->is_obj_array_klass()) || (src_declared_type && src_declared_type->is_obj_array_klass());
788 dst_objarray = (dst_exact_type && dst_exact_type->is_obj_array_klass()) || (dst_declared_type && dst_declared_type->is_obj_array_klass());
789 }
790
791 // if a probable array type has been identified, figure out if any
792 // of the required checks for a fast case can be elided.
793 int flags = LIR_OpArrayCopy::all_flags;
794
795 if (!src->is_loaded_flattened_array() && !dst->is_loaded_flattened_array()) {
796 flags &= ~LIR_OpArrayCopy::always_slow_path;
797 }
798 if (!src->maybe_flattened_array()) {
799 flags &= ~LIR_OpArrayCopy::src_flat_check;
800 }
801 if (!dst->maybe_flattened_array()) {
802 flags &= ~LIR_OpArrayCopy::dst_flat_check;
803 }
804
805 if (!src_objarray)
806 flags &= ~LIR_OpArrayCopy::src_objarray;
807 if (!dst_objarray)
808 flags &= ~LIR_OpArrayCopy::dst_objarray;
809
810 if (!x->arg_needs_null_check(0))
811 flags &= ~LIR_OpArrayCopy::src_null_check;
812 if (!x->arg_needs_null_check(2))
813 flags &= ~LIR_OpArrayCopy::dst_null_check;
814
815
816 if (expected_type != NULL) {
817 Value length_limit = NULL;
818
819 IfOp* ifop = length->as_IfOp();
820 if (ifop != NULL) {
821 // look for expressions like min(v, a.length) which ends up as
822 // x > y ? y : x or x >= y ? y : x
823 if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) &&
824 ifop->x() == ifop->fval() &&
825 ifop->y() == ifop->tval()) {
826 length_limit = ifop->y();
827 }
828 }
829
830 // try to skip null checks and range checks
831 NewArray* src_array = src->as_NewArray();
832 if (src_array != NULL) {
833 flags &= ~LIR_OpArrayCopy::src_null_check;
834 if (length_limit != NULL &&
835 src_array->length() == length_limit &&
836 is_constant_zero(src_pos)) {
837 flags &= ~LIR_OpArrayCopy::src_range_check;
838 }
839 }
840
841 NewArray* dst_array = dst->as_NewArray();
842 if (dst_array != NULL) {
843 flags &= ~LIR_OpArrayCopy::dst_null_check;
844 if (length_limit != NULL &&
845 dst_array->length() == length_limit &&
846 is_constant_zero(dst_pos)) {
847 flags &= ~LIR_OpArrayCopy::dst_range_check;
848 }
849 }
850
851 // check from incoming constant values
852 if (positive_constant(src_pos))
853 flags &= ~LIR_OpArrayCopy::src_pos_positive_check;
854 if (positive_constant(dst_pos))
855 flags &= ~LIR_OpArrayCopy::dst_pos_positive_check;
856 if (positive_constant(length))
857 flags &= ~LIR_OpArrayCopy::length_positive_check;
858
859 // see if the range check can be elided, which might also imply
860 // that src or dst is non-null.
861 ArrayLength* al = length->as_ArrayLength();
862 if (al != NULL) {
863 if (al->array() == src) {
864 // it's the length of the source array
865 flags &= ~LIR_OpArrayCopy::length_positive_check;
866 flags &= ~LIR_OpArrayCopy::src_null_check;
867 if (is_constant_zero(src_pos))
868 flags &= ~LIR_OpArrayCopy::src_range_check;
869 }
870 if (al->array() == dst) {
871 // it's the length of the destination array
872 flags &= ~LIR_OpArrayCopy::length_positive_check;
873 flags &= ~LIR_OpArrayCopy::dst_null_check;
874 if (is_constant_zero(dst_pos))
875 flags &= ~LIR_OpArrayCopy::dst_range_check;
876 }
877 }
878 if (is_exact) {
879 flags &= ~LIR_OpArrayCopy::type_check;
880 }
881 }
882
883 IntConstant* src_int = src_pos->type()->as_IntConstant();
884 IntConstant* dst_int = dst_pos->type()->as_IntConstant();
885 if (src_int && dst_int) {
886 int s_offs = src_int->value();
887 int d_offs = dst_int->value();
888 if (src_int->value() >= dst_int->value()) {
889 flags &= ~LIR_OpArrayCopy::overlapping;
890 }
891 if (expected_type != NULL) {
892 BasicType t = expected_type->element_type()->basic_type();
893 int element_size = type2aelembytes(t);
894 if (((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
895 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0)) {
896 flags &= ~LIR_OpArrayCopy::unaligned;
897 }
898 }
899 } else if (src_pos == dst_pos || is_constant_zero(dst_pos)) {
900 // src and dest positions are the same, or dst is zero so assume
901 // nonoverlapping copy.
902 flags &= ~LIR_OpArrayCopy::overlapping;
903 }
904
905 if (src == dst) {
906 // moving within a single array so no type checks are needed
907 if (flags & LIR_OpArrayCopy::type_check) {
908 flags &= ~LIR_OpArrayCopy::type_check;
909 }
910 }
911 *flagsp = flags;
912 *expected_typep = (ciArrayKlass*)expected_type;
913 }
914
915
916 LIR_Opr LIRGenerator::round_item(LIR_Opr opr) {
917 assert(opr->is_register(), "why spill if item is not register?");
918
919 if (RoundFPResults && UseSSE < 1 && opr->is_single_fpu()) {
920 LIR_Opr result = new_register(T_FLOAT);
921 set_vreg_flag(result, must_start_in_memory);
922 assert(opr->is_register(), "only a register can be spilled");
923 assert(opr->value_type()->is_float(), "rounding only for floats available");
924 __ roundfp(opr, LIR_OprFact::illegalOpr, result);
925 return result;
926 }
927 return opr;
928 }
929
930
931 LIR_Opr LIRGenerator::force_to_spill(LIR_Opr value, BasicType t) {
932 assert(type2size[t] == type2size[value->type()],
933 "size mismatch: t=%s, value->type()=%s", type2name(t), type2name(value->type()));
934 if (!value->is_register()) {
935 // force into a register
936 LIR_Opr r = new_register(value->type());
937 __ move(value, r);
938 value = r;
939 }
940
941 // create a spill location
942 LIR_Opr tmp = new_register(t);
943 set_vreg_flag(tmp, LIRGenerator::must_start_in_memory);
944
945 // move from register to spill
946 __ move(value, tmp);
947 return tmp;
948 }
949
950 void LIRGenerator::profile_branch(If* if_instr, If::Condition cond) {
951 if (if_instr->should_profile()) {
952 ciMethod* method = if_instr->profiled_method();
953 assert(method != NULL, "method should be set if branch is profiled");
954 ciMethodData* md = method->method_data_or_null();
955 assert(md != NULL, "Sanity");
956 ciProfileData* data = md->bci_to_data(if_instr->profiled_bci());
957 assert(data != NULL, "must have profiling data");
958 assert(data->is_BranchData(), "need BranchData for two-way branches");
959 int taken_count_offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
960 int not_taken_count_offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
961 if (if_instr->is_swapped()) {
962 int t = taken_count_offset;
963 taken_count_offset = not_taken_count_offset;
964 not_taken_count_offset = t;
965 }
966
967 LIR_Opr md_reg = new_register(T_METADATA);
968 __ metadata2reg(md->constant_encoding(), md_reg);
969
970 LIR_Opr data_offset_reg = new_pointer_register();
971 __ cmove(lir_cond(cond),
972 LIR_OprFact::intptrConst(taken_count_offset),
973 LIR_OprFact::intptrConst(not_taken_count_offset),
974 data_offset_reg, as_BasicType(if_instr->x()->type()));
975
976 // MDO cells are intptr_t, so the data_reg width is arch-dependent.
977 LIR_Opr data_reg = new_pointer_register();
978 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
979 __ move(data_addr, data_reg);
980 // Use leal instead of add to avoid destroying condition codes on x86
981 LIR_Address* fake_incr_value = new LIR_Address(data_reg, DataLayout::counter_increment, T_INT);
982 __ leal(LIR_OprFact::address(fake_incr_value), data_reg);
983 __ move(data_reg, data_addr);
984 }
985 }
986
987 // Phi technique:
988 // This is about passing live values from one basic block to the other.
989 // In code generated with Java it is rather rare that more than one
990 // value is on the stack from one basic block to the other.
991 // We optimize our technique for efficient passing of one value
992 // (of type long, int, double..) but it can be extended.
993 // When entering or leaving a basic block, all registers and all spill
994 // slots are release and empty. We use the released registers
995 // and spill slots to pass the live values from one block
996 // to the other. The topmost value, i.e., the value on TOS of expression
997 // stack is passed in registers. All other values are stored in spilling
998 // area. Every Phi has an index which designates its spill slot
999 // At exit of a basic block, we fill the register(s) and spill slots.
1000 // At entry of a basic block, the block_prolog sets up the content of phi nodes
1001 // and locks necessary registers and spilling slots.
1002
1003
1004 // move current value to referenced phi function
1005 void LIRGenerator::move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val) {
1006 Phi* phi = sux_val->as_Phi();
1007 // cur_val can be null without phi being null in conjunction with inlining
1008 if (phi != NULL && cur_val != NULL && cur_val != phi && !phi->is_illegal()) {
1009 Phi* cur_phi = cur_val->as_Phi();
1010 if (cur_phi != NULL && cur_phi->is_illegal()) {
1011 // Phi and local would need to get invalidated
1012 // (which is unexpected for Linear Scan).
1013 // But this case is very rare so we simply bail out.
1014 bailout("propagation of illegal phi");
1015 return;
1016 }
1017 LIR_Opr operand = cur_val->operand();
1018 if (operand->is_illegal()) {
1019 assert(cur_val->as_Constant() != NULL || cur_val->as_Local() != NULL,
1020 "these can be produced lazily");
1021 operand = operand_for_instruction(cur_val);
1022 }
1023 resolver->move(operand, operand_for_instruction(phi));
1024 }
1025 }
1026
1027
1028 // Moves all stack values into their PHI position
1029 void LIRGenerator::move_to_phi(ValueStack* cur_state) {
1030 BlockBegin* bb = block();
1031 if (bb->number_of_sux() == 1) {
1032 BlockBegin* sux = bb->sux_at(0);
1033 assert(sux->number_of_preds() > 0, "invalid CFG");
1034
1035 // a block with only one predecessor never has phi functions
1036 if (sux->number_of_preds() > 1) {
1037 int max_phis = cur_state->stack_size() + cur_state->locals_size();
1038 PhiResolver resolver(this, _virtual_register_number + max_phis * 2);
1039
1040 ValueStack* sux_state = sux->state();
1041 Value sux_value;
1042 int index;
1043
1044 assert(cur_state->scope() == sux_state->scope(), "not matching");
1045 assert(cur_state->locals_size() == sux_state->locals_size(), "not matching");
1046 assert(cur_state->stack_size() == sux_state->stack_size(), "not matching");
1047
1048 for_each_stack_value(sux_state, index, sux_value) {
1049 move_to_phi(&resolver, cur_state->stack_at(index), sux_value);
1050 }
1051
1052 for_each_local_value(sux_state, index, sux_value) {
1053 move_to_phi(&resolver, cur_state->local_at(index), sux_value);
1054 }
1055
1056 assert(cur_state->caller_state() == sux_state->caller_state(), "caller states must be equal");
1057 }
1058 }
1059 }
1060
1061
1062 LIR_Opr LIRGenerator::new_register(BasicType type) {
1063 int vreg = _virtual_register_number;
1064 // add a little fudge factor for the bailout, since the bailout is
1065 // only checked periodically. This gives a few extra registers to
1066 // hand out before we really run out, which helps us keep from
1067 // tripping over assertions.
1068 if (vreg + 20 >= LIR_OprDesc::vreg_max) {
1069 bailout("out of virtual registers");
1070 if (vreg + 2 >= LIR_OprDesc::vreg_max) {
1071 // wrap it around
1072 _virtual_register_number = LIR_OprDesc::vreg_base;
1073 }
1074 }
1075 _virtual_register_number += 1;
1076 return LIR_OprFact::virtual_register(vreg, type);
1077 }
1078
1079
1080 // Try to lock using register in hint
1081 LIR_Opr LIRGenerator::rlock(Value instr) {
1082 return new_register(instr->type());
1083 }
1084
1085
1086 // does an rlock and sets result
1087 LIR_Opr LIRGenerator::rlock_result(Value x) {
1088 LIR_Opr reg = rlock(x);
1089 set_result(x, reg);
1090 return reg;
1091 }
1092
1093
1094 // does an rlock and sets result
1095 LIR_Opr LIRGenerator::rlock_result(Value x, BasicType type) {
1096 LIR_Opr reg;
1097 switch (type) {
1098 case T_BYTE:
1099 case T_BOOLEAN:
1100 reg = rlock_byte(type);
1101 break;
1102 default:
1103 reg = rlock(x);
1104 break;
1105 }
1106
1107 set_result(x, reg);
1108 return reg;
1109 }
1110
1111
1112 //---------------------------------------------------------------------
1113 ciObject* LIRGenerator::get_jobject_constant(Value value) {
1114 ObjectType* oc = value->type()->as_ObjectType();
1115 if (oc) {
1116 return oc->constant_value();
1117 }
1118 return NULL;
1119 }
1120
1121
1122 void LIRGenerator::do_ExceptionObject(ExceptionObject* x) {
1123 assert(block()->is_set(BlockBegin::exception_entry_flag), "ExceptionObject only allowed in exception handler block");
1124 assert(block()->next() == x, "ExceptionObject must be first instruction of block");
1125
1126 // no moves are created for phi functions at the begin of exception
1127 // handlers, so assign operands manually here
1128 for_each_phi_fun(block(), phi,
1129 if (!phi->is_illegal()) { operand_for_instruction(phi); });
1130
1131 LIR_Opr thread_reg = getThreadPointer();
1132 __ move_wide(new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT),
1133 exceptionOopOpr());
1134 __ move_wide(LIR_OprFact::oopConst(NULL),
1135 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT));
1136 __ move_wide(LIR_OprFact::oopConst(NULL),
1137 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_pc_offset()), T_OBJECT));
1138
1139 LIR_Opr result = new_register(T_OBJECT);
1140 __ move(exceptionOopOpr(), result);
1141 set_result(x, result);
1142 }
1143
1144
1145 //----------------------------------------------------------------------
1146 //----------------------------------------------------------------------
1147 //----------------------------------------------------------------------
1148 //----------------------------------------------------------------------
1149 // visitor functions
1150 //----------------------------------------------------------------------
1151 //----------------------------------------------------------------------
1152 //----------------------------------------------------------------------
1153 //----------------------------------------------------------------------
1154
1155 void LIRGenerator::do_Phi(Phi* x) {
1156 // phi functions are never visited directly
1157 ShouldNotReachHere();
1158 }
1159
1160
1161 // Code for a constant is generated lazily unless the constant is frequently used and can't be inlined.
1162 void LIRGenerator::do_Constant(Constant* x) {
1163 if (x->state_before() != NULL) {
1164 // Any constant with a ValueStack requires patching so emit the patch here
1165 LIR_Opr reg = rlock_result(x);
1166 CodeEmitInfo* info = state_for(x, x->state_before());
1167 __ oop2reg_patch(NULL, reg, info);
1168 } else if (x->use_count() > 1 && !can_inline_as_constant(x)) {
1169 if (!x->is_pinned()) {
1170 // unpinned constants are handled specially so that they can be
1171 // put into registers when they are used multiple times within a
1172 // block. After the block completes their operand will be
1173 // cleared so that other blocks can't refer to that register.
1174 set_result(x, load_constant(x));
1175 } else {
1176 LIR_Opr res = x->operand();
1177 if (!res->is_valid()) {
1178 res = LIR_OprFact::value_type(x->type());
1179 }
1180 if (res->is_constant()) {
1181 LIR_Opr reg = rlock_result(x);
1182 __ move(res, reg);
1183 } else {
1184 set_result(x, res);
1185 }
1186 }
1187 } else {
1188 set_result(x, LIR_OprFact::value_type(x->type()));
1189 }
1190 }
1191
1192
1193 void LIRGenerator::do_Local(Local* x) {
1194 // operand_for_instruction has the side effect of setting the result
1195 // so there's no need to do it here.
1196 operand_for_instruction(x);
1197 }
1198
1199
1200 void LIRGenerator::do_IfInstanceOf(IfInstanceOf* x) {
1201 Unimplemented();
1202 }
1203
1204
1205 void LIRGenerator::do_Return(Return* x) {
1206 if (compilation()->env()->dtrace_method_probes()) {
1207 BasicTypeList signature;
1208 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
1209 signature.append(T_METADATA); // Method*
1210 LIR_OprList* args = new LIR_OprList();
1211 args->append(getThreadPointer());
1212 LIR_Opr meth = new_register(T_METADATA);
1213 __ metadata2reg(method()->constant_encoding(), meth);
1214 args->append(meth);
1215 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), voidType, NULL);
1216 }
1217
1218 if (x->type()->is_void()) {
1219 __ return_op(LIR_OprFact::illegalOpr);
1220 } else {
1221 LIR_Opr reg = result_register_for(x->type(), /*callee=*/true);
1222 LIRItem result(x->result(), this);
1223
1224 result.load_item_force(reg);
1225 __ return_op(result.result());
1226 }
1227 set_no_result(x);
1228 }
1229
1230 // Examble: ref.get()
1231 // Combination of LoadField and g1 pre-write barrier
1232 void LIRGenerator::do_Reference_get(Intrinsic* x) {
1233
1234 const int referent_offset = java_lang_ref_Reference::referent_offset;
1235 guarantee(referent_offset > 0, "referent offset not initialized");
1236
1237 assert(x->number_of_arguments() == 1, "wrong type");
1238
1239 LIRItem reference(x->argument_at(0), this);
1240 reference.load_item();
1241
1242 // need to perform the null check on the reference objecy
1243 CodeEmitInfo* info = NULL;
1244 if (x->needs_null_check()) {
1245 info = state_for(x);
1246 }
1247
1248 LIR_Opr result = rlock_result(x, T_OBJECT);
1249 access_load_at(IN_HEAP | ON_WEAK_OOP_REF, T_OBJECT,
1250 reference, LIR_OprFact::intConst(referent_offset), result);
1251 }
1252
1253 // Example: clazz.isInstance(object)
1254 void LIRGenerator::do_isInstance(Intrinsic* x) {
1255 assert(x->number_of_arguments() == 2, "wrong type");
1256
1257 // TODO could try to substitute this node with an equivalent InstanceOf
1258 // if clazz is known to be a constant Class. This will pick up newly found
1259 // constants after HIR construction. I'll leave this to a future change.
1260
1261 // as a first cut, make a simple leaf call to runtime to stay platform independent.
1262 // could follow the aastore example in a future change.
1263
1264 LIRItem clazz(x->argument_at(0), this);
1265 LIRItem object(x->argument_at(1), this);
1266 clazz.load_item();
1267 object.load_item();
1268 LIR_Opr result = rlock_result(x);
1269
1270 // need to perform null check on clazz
1271 if (x->needs_null_check()) {
1272 CodeEmitInfo* info = state_for(x);
1273 __ null_check(clazz.result(), info);
1274 }
1275
1276 LIR_Opr call_result = call_runtime(clazz.value(), object.value(),
1277 CAST_FROM_FN_PTR(address, Runtime1::is_instance_of),
1278 x->type(),
1279 NULL); // NULL CodeEmitInfo results in a leaf call
1280 __ move(call_result, result);
1281 }
1282
1283 // Example: object.getClass ()
1284 void LIRGenerator::do_getClass(Intrinsic* x) {
1285 assert(x->number_of_arguments() == 1, "wrong type");
1286
1287 LIRItem rcvr(x->argument_at(0), this);
1288 rcvr.load_item();
1289 LIR_Opr temp = new_register(T_METADATA);
1290 LIR_Opr result = rlock_result(x);
1291
1292 // need to perform the null check on the rcvr
1293 CodeEmitInfo* info = NULL;
1294 if (x->needs_null_check()) {
1295 info = state_for(x);
1296 }
1297
1298 // FIXME T_ADDRESS should actually be T_METADATA but it can't because the
1299 // meaning of these two is mixed up (see JDK-8026837).
1300 __ move(new LIR_Address(rcvr.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), temp, info);
1301 __ move_wide(new LIR_Address(temp, in_bytes(Klass::java_mirror_offset()), T_ADDRESS), temp);
1302 // mirror = ((OopHandle)mirror)->resolve();
1303 access_load(IN_NATIVE, T_OBJECT,
1304 LIR_OprFact::address(new LIR_Address(temp, T_OBJECT)), result);
1305 }
1306
1307 // java.lang.Class::isPrimitive()
1308 void LIRGenerator::do_isPrimitive(Intrinsic* x) {
1309 assert(x->number_of_arguments() == 1, "wrong type");
1310
1311 LIRItem rcvr(x->argument_at(0), this);
1312 rcvr.load_item();
1313 LIR_Opr temp = new_register(T_METADATA);
1314 LIR_Opr result = rlock_result(x);
1315
1316 CodeEmitInfo* info = NULL;
1317 if (x->needs_null_check()) {
1318 info = state_for(x);
1319 }
1320
1321 __ move(new LIR_Address(rcvr.result(), java_lang_Class::klass_offset_in_bytes(), T_ADDRESS), temp, info);
1322 __ cmp(lir_cond_notEqual, temp, LIR_OprFact::intConst(0));
1323 __ cmove(lir_cond_notEqual, LIR_OprFact::intConst(0), LIR_OprFact::intConst(1), result, T_BOOLEAN);
1324 }
1325
1326
1327 // Example: Thread.currentThread()
1328 void LIRGenerator::do_currentThread(Intrinsic* x) {
1329 assert(x->number_of_arguments() == 0, "wrong type");
1330 LIR_Opr reg = rlock_result(x);
1331 __ move_wide(new LIR_Address(getThreadPointer(), in_bytes(JavaThread::threadObj_offset()), T_OBJECT), reg);
1332 }
1333
1334
1335 void LIRGenerator::do_RegisterFinalizer(Intrinsic* x) {
1336 assert(x->number_of_arguments() == 1, "wrong type");
1337 LIRItem receiver(x->argument_at(0), this);
1338
1339 receiver.load_item();
1340 BasicTypeList signature;
1341 signature.append(T_OBJECT); // receiver
1342 LIR_OprList* args = new LIR_OprList();
1343 args->append(receiver.result());
1344 CodeEmitInfo* info = state_for(x, x->state());
1345 call_runtime(&signature, args,
1346 CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::register_finalizer_id)),
1347 voidType, info);
1348
1349 set_no_result(x);
1350 }
1351
1352
1353 //------------------------local access--------------------------------------
1354
1355 LIR_Opr LIRGenerator::operand_for_instruction(Instruction* x) {
1356 if (x->operand()->is_illegal()) {
1357 Constant* c = x->as_Constant();
1358 if (c != NULL) {
1359 x->set_operand(LIR_OprFact::value_type(c->type()));
1360 } else {
1361 assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local");
1362 // allocate a virtual register for this local or phi
1363 x->set_operand(rlock(x));
1364 _instruction_for_operand.at_put_grow(x->operand()->vreg_number(), x, NULL);
1365 }
1366 }
1367 return x->operand();
1368 }
1369
1370
1371 Instruction* LIRGenerator::instruction_for_opr(LIR_Opr opr) {
1372 if (opr->is_virtual()) {
1373 return instruction_for_vreg(opr->vreg_number());
1374 }
1375 return NULL;
1376 }
1377
1378
1379 Instruction* LIRGenerator::instruction_for_vreg(int reg_num) {
1380 if (reg_num < _instruction_for_operand.length()) {
1381 return _instruction_for_operand.at(reg_num);
1382 }
1383 return NULL;
1384 }
1385
1386
1387 void LIRGenerator::set_vreg_flag(int vreg_num, VregFlag f) {
1388 if (_vreg_flags.size_in_bits() == 0) {
1389 BitMap2D temp(100, num_vreg_flags);
1390 _vreg_flags = temp;
1391 }
1392 _vreg_flags.at_put_grow(vreg_num, f, true);
1393 }
1394
1395 bool LIRGenerator::is_vreg_flag_set(int vreg_num, VregFlag f) {
1396 if (!_vreg_flags.is_valid_index(vreg_num, f)) {
1397 return false;
1398 }
1399 return _vreg_flags.at(vreg_num, f);
1400 }
1401
1402
1403 // Block local constant handling. This code is useful for keeping
1404 // unpinned constants and constants which aren't exposed in the IR in
1405 // registers. Unpinned Constant instructions have their operands
1406 // cleared when the block is finished so that other blocks can't end
1407 // up referring to their registers.
1408
1409 LIR_Opr LIRGenerator::load_constant(Constant* x) {
1410 assert(!x->is_pinned(), "only for unpinned constants");
1411 _unpinned_constants.append(x);
1412 return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr());
1413 }
1414
1415
1416 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) {
1417 BasicType t = c->type();
1418 for (int i = 0; i < _constants.length(); i++) {
1419 LIR_Const* other = _constants.at(i);
1420 if (t == other->type()) {
1421 switch (t) {
1422 case T_INT:
1423 case T_FLOAT:
1424 if (c->as_jint_bits() != other->as_jint_bits()) continue;
1425 break;
1426 case T_LONG:
1427 case T_DOUBLE:
1428 if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue;
1429 if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue;
1430 break;
1431 case T_OBJECT:
1432 if (c->as_jobject() != other->as_jobject()) continue;
1433 break;
1434 default:
1435 break;
1436 }
1437 return _reg_for_constants.at(i);
1438 }
1439 }
1440
1441 LIR_Opr result = new_register(t);
1442 __ move((LIR_Opr)c, result);
1443 _constants.append(c);
1444 _reg_for_constants.append(result);
1445 return result;
1446 }
1447
1448 //------------------------field access--------------------------------------
1449
1450 void LIRGenerator::do_CompareAndSwap(Intrinsic* x, ValueType* type) {
1451 assert(x->number_of_arguments() == 4, "wrong type");
1452 LIRItem obj (x->argument_at(0), this); // object
1453 LIRItem offset(x->argument_at(1), this); // offset of field
1454 LIRItem cmp (x->argument_at(2), this); // value to compare with field
1455 LIRItem val (x->argument_at(3), this); // replace field with val if matches cmp
1456 assert(obj.type()->tag() == objectTag, "invalid type");
1457
1458 // In 64bit the type can be long, sparc doesn't have this assert
1459 // assert(offset.type()->tag() == intTag, "invalid type");
1460
1461 assert(cmp.type()->tag() == type->tag(), "invalid type");
1462 assert(val.type()->tag() == type->tag(), "invalid type");
1463
1464 LIR_Opr result = access_atomic_cmpxchg_at(IN_HEAP, as_BasicType(type),
1465 obj, offset, cmp, val);
1466 set_result(x, result);
1467 }
1468
1469 // Comment copied form templateTable_i486.cpp
1470 // ----------------------------------------------------------------------------
1471 // Volatile variables demand their effects be made known to all CPU's in
1472 // order. Store buffers on most chips allow reads & writes to reorder; the
1473 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1474 // memory barrier (i.e., it's not sufficient that the interpreter does not
1475 // reorder volatile references, the hardware also must not reorder them).
1476 //
1477 // According to the new Java Memory Model (JMM):
1478 // (1) All volatiles are serialized wrt to each other.
1479 // ALSO reads & writes act as aquire & release, so:
1480 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1481 // the read float up to before the read. It's OK for non-volatile memory refs
1482 // that happen before the volatile read to float down below it.
1483 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1484 // that happen BEFORE the write float down to after the write. It's OK for
1485 // non-volatile memory refs that happen after the volatile write to float up
1486 // before it.
1487 //
1488 // We only put in barriers around volatile refs (they are expensive), not
1489 // _between_ memory refs (that would require us to track the flavor of the
1490 // previous memory refs). Requirements (2) and (3) require some barriers
1491 // before volatile stores and after volatile loads. These nearly cover
1492 // requirement (1) but miss the volatile-store-volatile-load case. This final
1493 // case is placed after volatile-stores although it could just as well go
1494 // before volatile-loads.
1495
1496
1497 void LIRGenerator::do_StoreField(StoreField* x) {
1498 bool needs_patching = x->needs_patching();
1499 bool is_volatile = x->field()->is_volatile();
1500 BasicType field_type = x->field_type();
1501
1502 CodeEmitInfo* info = NULL;
1503 if (needs_patching) {
1504 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1505 info = state_for(x, x->state_before());
1506 } else if (x->needs_null_check()) {
1507 NullCheck* nc = x->explicit_null_check();
1508 if (nc == NULL) {
1509 info = state_for(x);
1510 } else {
1511 info = state_for(nc);
1512 }
1513 }
1514
1515 LIRItem object(x->obj(), this);
1516 LIRItem value(x->value(), this);
1517
1518 object.load_item();
1519
1520 if (is_volatile || needs_patching) {
1521 // load item if field is volatile (fewer special cases for volatiles)
1522 // load item if field not initialized
1523 // load item if field not constant
1524 // because of code patching we cannot inline constants
1525 if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1526 value.load_byte_item();
1527 } else {
1528 value.load_item();
1529 }
1530 } else {
1531 value.load_for_store(field_type);
1532 }
1533
1534 set_no_result(x);
1535
1536 #ifndef PRODUCT
1537 if (PrintNotLoaded && needs_patching) {
1538 tty->print_cr(" ###class not loaded at store_%s bci %d",
1539 x->is_static() ? "static" : "field", x->printable_bci());
1540 }
1541 #endif
1542
1543 if (x->needs_null_check() &&
1544 (needs_patching ||
1545 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1546 if (needs_patching && x->field()->is_flattenable()) {
1547 // We are storing a field of type "QT;" into holder class H, but H is not yet
1548 // loaded. (If H had been loaded, then T must also have already been loaded
1549 // due to the "Q" signature, and needs_patching would be false).
1550 assert(!x->field()->holder()->is_loaded(), "must be");
1551 // We don't know the offset of this field. Let's deopt and recompile.
1552 CodeStub* stub = new DeoptimizeStub(new CodeEmitInfo(info),
1553 Deoptimization::Reason_unloaded,
1554 Deoptimization::Action_make_not_entrant);
1555 __ branch(lir_cond_always, T_ILLEGAL, stub);
1556 } else {
1557 // Emit an explicit null check because the offset is too large.
1558 // If the class is not loaded and the object is NULL, we need to deoptimize to throw a
1559 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1560 __ null_check(object.result(), new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1561 }
1562 }
1563
1564 DecoratorSet decorators = IN_HEAP;
1565 if (is_volatile) {
1566 decorators |= MO_SEQ_CST;
1567 }
1568 if (needs_patching) {
1569 decorators |= C1_NEEDS_PATCHING;
1570 }
1571
1572 access_store_at(decorators, field_type, object, LIR_OprFact::intConst(x->offset()),
1573 value.result(), info != NULL ? new CodeEmitInfo(info) : NULL, info);
1574 }
1575
1576 // FIXME -- I can't find any other way to pass an address to access_load_at().
1577 class TempResolvedAddress: public Instruction {
1578 public:
1579 TempResolvedAddress(ValueType* type, LIR_Opr addr) : Instruction(type) {
1580 set_operand(addr);
1581 }
1582 virtual void input_values_do(ValueVisitor*) {}
1583 virtual void visit(InstructionVisitor* v) {}
1584 virtual const char* name() const { return "TempResolvedAddress"; }
1585 };
1586
1587 void LIRGenerator::access_flattened_array(bool is_load, LIRItem& array, LIRItem& index, LIRItem& obj_item) {
1588 // Find the starting address of the source (inside the array)
1589 ciType* array_type = array.value()->declared_type();
1590 ciValueArrayKlass* value_array_klass = array_type->as_value_array_klass();
1591 assert(value_array_klass->is_loaded(), "must be");
1592
1593 ciValueKlass* elem_klass = value_array_klass->element_klass()->as_value_klass();
1594 int array_header_size = value_array_klass->array_header_in_bytes();
1595 int shift = value_array_klass->log2_element_size();
1596
1597 #ifndef _LP64
1598 LIR_Opr index_op = new_register(T_INT);
1599 // FIXME -- on 32-bit, the shift below can overflow, so we need to check that
1600 // the top (shift+1) bits of index_op must be zero, or
1601 // else throw ArrayIndexOutOfBoundsException
1602 if (index.result()->is_constant()) {
1603 jint const_index = index.result()->as_jint();
1604 __ move(LIR_OprFact::intConst(const_index << shift), index_op);
1605 } else {
1606 __ shift_left(index_op, shift, index.result());
1607 }
1608 #else
1609 LIR_Opr index_op = new_register(T_LONG);
1610 if (index.result()->is_constant()) {
1611 jint const_index = index.result()->as_jint();
1612 __ move(LIR_OprFact::longConst(const_index << shift), index_op);
1613 } else {
1614 __ convert(Bytecodes::_i2l, index.result(), index_op);
1615 // Need to shift manually, as LIR_Address can scale only up to 3.
1616 __ shift_left(index_op, shift, index_op);
1617 }
1618 #endif
1619
1620 LIR_Opr elm_op = new_pointer_register();
1621 LIR_Address* elm_address = new LIR_Address(array.result(), index_op, array_header_size, T_ADDRESS);
1622 __ leal(LIR_OprFact::address(elm_address), elm_op);
1623
1624 for (int i = 0; i < elem_klass->nof_nonstatic_fields(); i++) {
1625 ciField* inner_field = elem_klass->nonstatic_field_at(i);
1626 assert(!inner_field->is_flattened(), "flattened fields must have been expanded");
1627 int obj_offset = inner_field->offset();
1628 int elm_offset = obj_offset - elem_klass->first_field_offset(); // object header is not stored in array.
1629
1630 BasicType field_type = inner_field->type()->basic_type();
1631 switch (field_type) {
1632 case T_BYTE:
1633 case T_BOOLEAN:
1634 case T_SHORT:
1635 case T_CHAR:
1636 field_type = T_INT;
1637 break;
1638 default:
1639 break;
1640 }
1641
1642 LIR_Opr temp = new_register(field_type);
1643 TempResolvedAddress* elm_resolved_addr = new TempResolvedAddress(as_ValueType(field_type), elm_op);
1644 LIRItem elm_item(elm_resolved_addr, this);
1645
1646 DecoratorSet decorators = IN_HEAP;
1647 if (is_load) {
1648 access_load_at(decorators, field_type,
1649 elm_item, LIR_OprFact::intConst(elm_offset), temp,
1650 NULL, NULL);
1651 access_store_at(decorators, field_type,
1652 obj_item, LIR_OprFact::intConst(obj_offset), temp,
1653 NULL, NULL);
1654 } else {
1655 access_load_at(decorators, field_type,
1656 obj_item, LIR_OprFact::intConst(obj_offset), temp,
1657 NULL, NULL);
1658 access_store_at(decorators, field_type,
1659 elm_item, LIR_OprFact::intConst(elm_offset), temp,
1660 NULL, NULL);
1661 }
1662 }
1663 }
1664
1665 void LIRGenerator::check_flattened_array(LIRItem& array, CodeStub* slow_path) {
1666 LIR_Opr array_klass_reg = new_register(T_METADATA);
1667
1668 __ move(new LIR_Address(array.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), array_klass_reg);
1669 LIR_Opr layout = new_register(T_INT);
1670 __ move(new LIR_Address(array_klass_reg, in_bytes(Klass::layout_helper_offset()), T_INT), layout);
1671 __ shift_right(layout, Klass::_lh_array_tag_shift, layout);
1672 __ cmp(lir_cond_equal, layout, LIR_OprFact::intConst(Klass::_lh_array_tag_vt_value));
1673 __ branch(lir_cond_equal, T_ILLEGAL, slow_path);
1674 }
1675
1676 bool LIRGenerator::needs_flattened_array_store_check(StoreIndexed* x) {
1677 if (ValueArrayFlatten && x->elt_type() == T_OBJECT && x->array()->maybe_flattened_array()) {
1678 ciType* type = x->value()->declared_type();
1679 if (type != NULL && type->is_klass()) {
1680 ciKlass* klass = type->as_klass();
1681 if (klass->is_loaded() &&
1682 !(klass->is_valuetype() && klass->as_value_klass()->flatten_array()) &&
1683 !klass->is_java_lang_Object() &&
1684 !klass->is_interface()) {
1685 // This is known to be a non-flattenable object. If the array is flattened,
1686 // it will be caught by the code generated by array_store_check().
1687 return false;
1688 }
1689 }
1690 // We're not 100% sure, so let's do the flattened_array_store_check.
1691 return true;
1692 }
1693 return false;
1694 }
1695
1696 void LIRGenerator::do_StoreIndexed(StoreIndexed* x) {
1697 assert(x->is_pinned(),"");
1698 assert(x->elt_type() != T_ARRAY, "never used");
1699 bool is_loaded_flattened_array = x->array()->is_loaded_flattened_array();
1700 bool needs_range_check = x->compute_needs_range_check();
1701 bool use_length = x->length() != NULL;
1702 bool obj_store = x->elt_type() == T_OBJECT;
1703 bool needs_store_check = obj_store && !is_loaded_flattened_array &&
1704 (x->value()->as_Constant() == NULL ||
1705 !get_jobject_constant(x->value())->is_null_object() ||
1706 x->should_profile());
1707
1708 LIRItem array(x->array(), this);
1709 LIRItem index(x->index(), this);
1710 LIRItem value(x->value(), this);
1711 LIRItem length(this);
1712
1713 array.load_item();
1714 index.load_nonconstant();
1715
1716 if (use_length && needs_range_check) {
1717 length.set_instruction(x->length());
1718 length.load_item();
1719 }
1720
1721 if (needs_store_check || x->check_boolean()
1722 || is_loaded_flattened_array || needs_flattened_array_store_check(x)) {
1723 value.load_item();
1724 } else {
1725 value.load_for_store(x->elt_type());
1726 }
1727
1728 set_no_result(x);
1729
1730 // the CodeEmitInfo must be duplicated for each different
1731 // LIR-instruction because spilling can occur anywhere between two
1732 // instructions and so the debug information must be different
1733 CodeEmitInfo* range_check_info = state_for(x);
1734 CodeEmitInfo* null_check_info = NULL;
1735 if (x->needs_null_check()) {
1736 null_check_info = new CodeEmitInfo(range_check_info);
1737 }
1738
1739 if (GenerateRangeChecks && needs_range_check) {
1740 if (use_length) {
1741 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1742 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result(), array.result()));
1743 } else {
1744 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1745 // range_check also does the null check
1746 null_check_info = NULL;
1747 }
1748 }
1749
1750 if (GenerateArrayStoreCheck && needs_store_check) {
1751 CodeEmitInfo* store_check_info = new CodeEmitInfo(range_check_info);
1752 array_store_check(value.result(), array.result(), store_check_info, x->profiled_method(), x->profiled_bci());
1753 }
1754
1755 if (is_loaded_flattened_array) {
1756 if (!x->is_exact_flattened_array_store()) {
1757 CodeEmitInfo* info = new CodeEmitInfo(range_check_info);
1758 ciKlass* element_klass = x->array()->declared_type()->as_value_array_klass()->element_klass();
1759 flattened_array_store_check(value.result(), element_klass, info);
1760 } else if (!x->value()->is_never_null()) {
1761 __ null_check(value.result(), new CodeEmitInfo(range_check_info));
1762 }
1763 access_flattened_array(false, array, index, value);
1764 } else {
1765 StoreFlattenedArrayStub* slow_path = NULL;
1766
1767 if (needs_flattened_array_store_check(x)) {
1768 // Check if we indeed have a flattened array
1769 index.load_item();
1770 slow_path = new StoreFlattenedArrayStub(array.result(), index.result(), value.result(), state_for(x));
1771 check_flattened_array(array, slow_path);
1772 }
1773
1774 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
1775 if (x->check_boolean()) {
1776 decorators |= C1_MASK_BOOLEAN;
1777 }
1778
1779 access_store_at(decorators, x->elt_type(), array, index.result(), value.result(),
1780 NULL, null_check_info);
1781 if (slow_path != NULL) {
1782 __ branch_destination(slow_path->continuation());
1783 }
1784 }
1785 }
1786
1787 void LIRGenerator::access_load_at(DecoratorSet decorators, BasicType type,
1788 LIRItem& base, LIR_Opr offset, LIR_Opr result,
1789 CodeEmitInfo* patch_info, CodeEmitInfo* load_emit_info) {
1790 decorators |= ACCESS_READ;
1791 LIRAccess access(this, decorators, base, offset, type, patch_info, load_emit_info);
1792 if (access.is_raw()) {
1793 _barrier_set->BarrierSetC1::load_at(access, result);
1794 } else {
1795 _barrier_set->load_at(access, result);
1796 }
1797 }
1798
1799 void LIRGenerator::access_load(DecoratorSet decorators, BasicType type,
1800 LIR_Opr addr, LIR_Opr result) {
1801 decorators |= ACCESS_READ;
1802 LIRAccess access(this, decorators, LIR_OprFact::illegalOpr, LIR_OprFact::illegalOpr, type);
1803 access.set_resolved_addr(addr);
1804 if (access.is_raw()) {
1805 _barrier_set->BarrierSetC1::load(access, result);
1806 } else {
1807 _barrier_set->load(access, result);
1808 }
1809 }
1810
1811 void LIRGenerator::access_store_at(DecoratorSet decorators, BasicType type,
1812 LIRItem& base, LIR_Opr offset, LIR_Opr value,
1813 CodeEmitInfo* patch_info, CodeEmitInfo* store_emit_info) {
1814 decorators |= ACCESS_WRITE;
1815 LIRAccess access(this, decorators, base, offset, type, patch_info, store_emit_info);
1816 if (access.is_raw()) {
1817 _barrier_set->BarrierSetC1::store_at(access, value);
1818 } else {
1819 _barrier_set->store_at(access, value);
1820 }
1821 }
1822
1823 LIR_Opr LIRGenerator::access_atomic_cmpxchg_at(DecoratorSet decorators, BasicType type,
1824 LIRItem& base, LIRItem& offset, LIRItem& cmp_value, LIRItem& new_value) {
1825 decorators |= ACCESS_READ;
1826 decorators |= ACCESS_WRITE;
1827 // Atomic operations are SEQ_CST by default
1828 decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1829 LIRAccess access(this, decorators, base, offset, type);
1830 if (access.is_raw()) {
1831 return _barrier_set->BarrierSetC1::atomic_cmpxchg_at(access, cmp_value, new_value);
1832 } else {
1833 return _barrier_set->atomic_cmpxchg_at(access, cmp_value, new_value);
1834 }
1835 }
1836
1837 LIR_Opr LIRGenerator::access_atomic_xchg_at(DecoratorSet decorators, BasicType type,
1838 LIRItem& base, LIRItem& offset, LIRItem& value) {
1839 decorators |= ACCESS_READ;
1840 decorators |= ACCESS_WRITE;
1841 // Atomic operations are SEQ_CST by default
1842 decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1843 LIRAccess access(this, decorators, base, offset, type);
1844 if (access.is_raw()) {
1845 return _barrier_set->BarrierSetC1::atomic_xchg_at(access, value);
1846 } else {
1847 return _barrier_set->atomic_xchg_at(access, value);
1848 }
1849 }
1850
1851 LIR_Opr LIRGenerator::access_atomic_add_at(DecoratorSet decorators, BasicType type,
1852 LIRItem& base, LIRItem& offset, LIRItem& value) {
1853 decorators |= ACCESS_READ;
1854 decorators |= ACCESS_WRITE;
1855 // Atomic operations are SEQ_CST by default
1856 decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1857 LIRAccess access(this, decorators, base, offset, type);
1858 if (access.is_raw()) {
1859 return _barrier_set->BarrierSetC1::atomic_add_at(access, value);
1860 } else {
1861 return _barrier_set->atomic_add_at(access, value);
1862 }
1863 }
1864
1865 LIR_Opr LIRGenerator::access_resolve(DecoratorSet decorators, LIR_Opr obj) {
1866 // Use stronger ACCESS_WRITE|ACCESS_READ by default.
1867 if ((decorators & (ACCESS_READ | ACCESS_WRITE)) == 0) {
1868 decorators |= ACCESS_READ | ACCESS_WRITE;
1869 }
1870
1871 return _barrier_set->resolve(this, decorators, obj);
1872 }
1873
1874 Value LIRGenerator::flattenable_load_field_prolog(LoadField* x, CodeEmitInfo* info) {
1875 ciField* field = x->field();
1876 ciInstanceKlass* holder = field->holder();
1877 Value default_value = NULL;
1878
1879 // Unloaded "QV;" klasses are represented by a ciInstanceKlass
1880 bool field_type_unloaded = field->type()->is_instance_klass() && !field->type()->as_instance_klass()->is_loaded();
1881
1882 // Check for edge cases (1), (2) and (3) for getstatic and getfield
1883 bool deopt = false;
1884 bool need_default = false;
1885 if (field->is_static()) {
1886 // (1) holder is unloaded -- no problem: it will be loaded by patching, and field offset will be determined.
1887 // No check needed here.
1888
1889 if (field_type_unloaded) {
1890 // (2) field type is unloaded -- problem: we don't know what the default value is. Let's deopt.
1891 // FIXME: consider getting the default value in patching code.
1892 deopt = true;
1893 } else {
1894 need_default = true;
1895 }
1896
1897 // (3) field is not flattened -- we don't care: static fields are never flattened.
1898 // No check needed here.
1899 } else {
1900 if (!holder->is_loaded()) {
1901 // (1) holder is unloaded -- problem: we needed the field offset back in GraphBuilder::access_field()
1902 // FIXME: consider getting field offset in patching code (but only if the field
1903 // type was loaded at compilation time).
1904 deopt = true;
1905 } else if (field_type_unloaded) {
1906 // (2) field type is unloaded -- problem: we don't know whether it's flattened or not. Let's deopt
1907 deopt = true;
1908 } else if (!field->is_flattened()) {
1909 // (3) field is not flattened -- need default value in cases of uninitialized field
1910 need_default = true;
1911 }
1912 }
1913
1914 if (deopt) {
1915 assert(!need_default, "deopt and need_default cannot both be true");
1916 assert(x->needs_patching(), "must be");
1917 assert(info != NULL, "must be");
1918 CodeStub* stub = new DeoptimizeStub(new CodeEmitInfo(info),
1919 Deoptimization::Reason_unloaded,
1920 Deoptimization::Action_make_not_entrant);
1921 __ branch(lir_cond_always, T_ILLEGAL, stub);
1922 } else if (need_default) {
1923 assert(!field_type_unloaded, "must be");
1924 assert(field->type()->is_valuetype(), "must be");
1925 ciValueKlass* value_klass = field->type()->as_value_klass();
1926 assert(value_klass->is_loaded(), "must be");
1927
1928 if (field->is_static() && holder->is_loaded()) {
1929 ciInstance* mirror = field->holder()->java_mirror();
1930 ciObject* val = mirror->field_value(field).as_object();
1931 if (val->is_null_object()) {
1932 // This is a non-nullable static field, but it's not initialized.
1933 // We need to do a null check, and replace it with the default value.
1934 } else {
1935 // No need to perform null check on this static field
1936 need_default = false;
1937 }
1938 }
1939
1940 if (need_default) {
1941 default_value = new Constant(new InstanceConstant(value_klass->default_value_instance()));
1942 }
1943 }
1944
1945 return default_value;
1946 }
1947
1948 void LIRGenerator::do_LoadField(LoadField* x) {
1949 bool needs_patching = x->needs_patching();
1950 bool is_volatile = x->field()->is_volatile();
1951 BasicType field_type = x->field_type();
1952
1953 CodeEmitInfo* info = NULL;
1954 if (needs_patching) {
1955 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1956 info = state_for(x, x->state_before());
1957 } else if (x->needs_null_check()) {
1958 NullCheck* nc = x->explicit_null_check();
1959 if (nc == NULL) {
1960 info = state_for(x);
1961 } else {
1962 info = state_for(nc);
1963 }
1964 }
1965
1966 LIRItem object(x->obj(), this);
1967
1968 object.load_item();
1969
1970 #ifndef PRODUCT
1971 if (PrintNotLoaded && needs_patching) {
1972 tty->print_cr(" ###class not loaded at load_%s bci %d",
1973 x->is_static() ? "static" : "field", x->printable_bci());
1974 }
1975 #endif
1976
1977 Value default_value = NULL;
1978 if (x->field()->is_flattenable()) {
1979 default_value = flattenable_load_field_prolog(x, info);
1980 }
1981
1982 bool stress_deopt = StressLoopInvariantCodeMotion && info && info->deoptimize_on_exception();
1983 if (x->needs_null_check() &&
1984 (needs_patching ||
1985 MacroAssembler::needs_explicit_null_check(x->offset()) ||
1986 stress_deopt)) {
1987 LIR_Opr obj = object.result();
1988 if (stress_deopt) {
1989 obj = new_register(T_OBJECT);
1990 __ move(LIR_OprFact::oopConst(NULL), obj);
1991 }
1992 // Emit an explicit null check because the offset is too large.
1993 // If the class is not loaded and the object is NULL, we need to deoptimize to throw a
1994 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1995 __ null_check(obj, new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1996 }
1997
1998 DecoratorSet decorators = IN_HEAP;
1999 if (is_volatile) {
2000 decorators |= MO_SEQ_CST;
2001 }
2002 if (needs_patching) {
2003 decorators |= C1_NEEDS_PATCHING;
2004 }
2005
2006 LIR_Opr result = rlock_result(x, field_type);
2007 access_load_at(decorators, field_type,
2008 object, LIR_OprFact::intConst(x->offset()), result,
2009 info ? new CodeEmitInfo(info) : NULL, info);
2010
2011 if (default_value != NULL) {
2012 LabelObj* L_end = new LabelObj();
2013 __ cmp(lir_cond_notEqual, result, LIR_OprFact::oopConst(NULL));
2014 __ branch(lir_cond_notEqual, T_OBJECT, L_end->label());
2015
2016 LIRItem dv(default_value, this);
2017 dv.load_item();
2018 __ move(dv.result(), result);
2019
2020 __ branch_destination(L_end->label());
2021 }
2022 }
2023
2024
2025 //------------------------java.nio.Buffer.checkIndex------------------------
2026
2027 // int java.nio.Buffer.checkIndex(int)
2028 void LIRGenerator::do_NIOCheckIndex(Intrinsic* x) {
2029 // NOTE: by the time we are in checkIndex() we are guaranteed that
2030 // the buffer is non-null (because checkIndex is package-private and
2031 // only called from within other methods in the buffer).
2032 assert(x->number_of_arguments() == 2, "wrong type");
2033 LIRItem buf (x->argument_at(0), this);
2034 LIRItem index(x->argument_at(1), this);
2035 buf.load_item();
2036 index.load_item();
2037
2038 LIR_Opr result = rlock_result(x);
2039 if (GenerateRangeChecks) {
2040 CodeEmitInfo* info = state_for(x);
2041 CodeStub* stub = new RangeCheckStub(info, index.result());
2042 LIR_Opr buf_obj = access_resolve(IS_NOT_NULL | ACCESS_READ, buf.result());
2043 if (index.result()->is_constant()) {
2044 cmp_mem_int(lir_cond_belowEqual, buf_obj, java_nio_Buffer::limit_offset(), index.result()->as_jint(), info);
2045 __ branch(lir_cond_belowEqual, T_INT, stub);
2046 } else {
2047 cmp_reg_mem(lir_cond_aboveEqual, index.result(), buf_obj,
2048 java_nio_Buffer::limit_offset(), T_INT, info);
2049 __ branch(lir_cond_aboveEqual, T_INT, stub);
2050 }
2051 __ move(index.result(), result);
2052 } else {
2053 // Just load the index into the result register
2054 __ move(index.result(), result);
2055 }
2056 }
2057
2058
2059 //------------------------array access--------------------------------------
2060
2061
2062 void LIRGenerator::do_ArrayLength(ArrayLength* x) {
2063 LIRItem array(x->array(), this);
2064 array.load_item();
2065 LIR_Opr reg = rlock_result(x);
2066
2067 CodeEmitInfo* info = NULL;
2068 if (x->needs_null_check()) {
2069 NullCheck* nc = x->explicit_null_check();
2070 if (nc == NULL) {
2071 info = state_for(x);
2072 } else {
2073 info = state_for(nc);
2074 }
2075 if (StressLoopInvariantCodeMotion && info->deoptimize_on_exception()) {
2076 LIR_Opr obj = new_register(T_OBJECT);
2077 __ move(LIR_OprFact::oopConst(NULL), obj);
2078 __ null_check(obj, new CodeEmitInfo(info));
2079 }
2080 }
2081 __ load(new LIR_Address(array.result(), arrayOopDesc::length_offset_in_bytes(), T_INT), reg, info, lir_patch_none);
2082 }
2083
2084
2085 void LIRGenerator::do_LoadIndexed(LoadIndexed* x) {
2086 bool use_length = x->length() != NULL;
2087 LIRItem array(x->array(), this);
2088 LIRItem index(x->index(), this);
2089 LIRItem length(this);
2090 bool needs_range_check = x->compute_needs_range_check();
2091
2092 if (use_length && needs_range_check) {
2093 length.set_instruction(x->length());
2094 length.load_item();
2095 }
2096
2097 array.load_item();
2098 if (index.is_constant() && can_inline_as_constant(x->index())) {
2099 // let it be a constant
2100 index.dont_load_item();
2101 } else {
2102 index.load_item();
2103 }
2104
2105 CodeEmitInfo* range_check_info = state_for(x);
2106 CodeEmitInfo* null_check_info = NULL;
2107 if (x->needs_null_check()) {
2108 NullCheck* nc = x->explicit_null_check();
2109 if (nc != NULL) {
2110 null_check_info = state_for(nc);
2111 } else {
2112 null_check_info = range_check_info;
2113 }
2114 if (StressLoopInvariantCodeMotion && null_check_info->deoptimize_on_exception()) {
2115 LIR_Opr obj = new_register(T_OBJECT);
2116 __ move(LIR_OprFact::oopConst(NULL), obj);
2117 __ null_check(obj, new CodeEmitInfo(null_check_info));
2118 }
2119 }
2120
2121 if (GenerateRangeChecks && needs_range_check) {
2122 if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) {
2123 __ branch(lir_cond_always, T_ILLEGAL, new RangeCheckStub(range_check_info, index.result(), array.result()));
2124 } else if (use_length) {
2125 // TODO: use a (modified) version of array_range_check that does not require a
2126 // constant length to be loaded to a register
2127 __ cmp(lir_cond_belowEqual, length.result(), index.result());
2128 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result(), array.result()));
2129 } else {
2130 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
2131 // The range check performs the null check, so clear it out for the load
2132 null_check_info = NULL;
2133 }
2134 }
2135
2136 if (x->array()->is_loaded_flattened_array()) {
2137 // Find the destination address (of the NewValueTypeInstance)
2138 LIR_Opr obj = x->vt()->operand();
2139 LIRItem obj_item(x->vt(), this);
2140
2141 access_flattened_array(true, array, index, obj_item);
2142 set_no_result(x);
2143 } else {
2144 LIR_Opr result = rlock_result(x, x->elt_type());
2145 LoadFlattenedArrayStub* slow_path = NULL;
2146
2147 if (x->elt_type() == T_OBJECT && x->array()->maybe_flattened_array()) {
2148 index.load_item();
2149 // if we are loading from flattened array, load it using a runtime call
2150 slow_path = new LoadFlattenedArrayStub(array.result(), index.result(), result, state_for(x));
2151 check_flattened_array(array, slow_path);
2152 }
2153
2154 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
2155 access_load_at(decorators, x->elt_type(),
2156 array, index.result(), result,
2157 NULL, null_check_info);
2158
2159 if (slow_path != NULL) {
2160 __ branch_destination(slow_path->continuation());
2161 }
2162 }
2163 }
2164
2165
2166 void LIRGenerator::do_NullCheck(NullCheck* x) {
2167 if (x->can_trap()) {
2168 LIRItem value(x->obj(), this);
2169 value.load_item();
2170 CodeEmitInfo* info = state_for(x);
2171 __ null_check(value.result(), info);
2172 }
2173 }
2174
2175
2176 void LIRGenerator::do_TypeCast(TypeCast* x) {
2177 LIRItem value(x->obj(), this);
2178 value.load_item();
2179 // the result is the same as from the node we are casting
2180 set_result(x, value.result());
2181 }
2182
2183
2184 void LIRGenerator::do_Throw(Throw* x) {
2185 LIRItem exception(x->exception(), this);
2186 exception.load_item();
2187 set_no_result(x);
2188 LIR_Opr exception_opr = exception.result();
2189 CodeEmitInfo* info = state_for(x, x->state());
2190
2191 #ifndef PRODUCT
2192 if (PrintC1Statistics) {
2193 increment_counter(Runtime1::throw_count_address(), T_INT);
2194 }
2195 #endif
2196
2197 // check if the instruction has an xhandler in any of the nested scopes
2198 bool unwind = false;
2199 if (info->exception_handlers()->length() == 0) {
2200 // this throw is not inside an xhandler
2201 unwind = true;
2202 } else {
2203 // get some idea of the throw type
2204 bool type_is_exact = true;
2205 ciType* throw_type = x->exception()->exact_type();
2206 if (throw_type == NULL) {
2207 type_is_exact = false;
2208 throw_type = x->exception()->declared_type();
2209 }
2210 if (throw_type != NULL && throw_type->is_instance_klass()) {
2211 ciInstanceKlass* throw_klass = (ciInstanceKlass*)throw_type;
2212 unwind = !x->exception_handlers()->could_catch(throw_klass, type_is_exact);
2213 }
2214 }
2215
2216 // do null check before moving exception oop into fixed register
2217 // to avoid a fixed interval with an oop during the null check.
2218 // Use a copy of the CodeEmitInfo because debug information is
2219 // different for null_check and throw.
2220 if (x->exception()->as_NewInstance() == NULL && x->exception()->as_ExceptionObject() == NULL) {
2221 // if the exception object wasn't created using new then it might be null.
2222 __ null_check(exception_opr, new CodeEmitInfo(info, x->state()->copy(ValueStack::ExceptionState, x->state()->bci())));
2223 }
2224
2225 if (compilation()->env()->jvmti_can_post_on_exceptions()) {
2226 // we need to go through the exception lookup path to get JVMTI
2227 // notification done
2228 unwind = false;
2229 }
2230
2231 // move exception oop into fixed register
2232 __ move(exception_opr, exceptionOopOpr());
2233
2234 if (unwind) {
2235 __ unwind_exception(exceptionOopOpr());
2236 } else {
2237 __ throw_exception(exceptionPcOpr(), exceptionOopOpr(), info);
2238 }
2239 }
2240
2241
2242 void LIRGenerator::do_RoundFP(RoundFP* x) {
2243 LIRItem input(x->input(), this);
2244 input.load_item();
2245 LIR_Opr input_opr = input.result();
2246 assert(input_opr->is_register(), "why round if value is not in a register?");
2247 assert(input_opr->is_single_fpu() || input_opr->is_double_fpu(), "input should be floating-point value");
2248 if (input_opr->is_single_fpu()) {
2249 set_result(x, round_item(input_opr)); // This code path not currently taken
2250 } else {
2251 LIR_Opr result = new_register(T_DOUBLE);
2252 set_vreg_flag(result, must_start_in_memory);
2253 __ roundfp(input_opr, LIR_OprFact::illegalOpr, result);
2254 set_result(x, result);
2255 }
2256 }
2257
2258 // Here UnsafeGetRaw may have x->base() and x->index() be int or long
2259 // on both 64 and 32 bits. Expecting x->base() to be always long on 64bit.
2260 void LIRGenerator::do_UnsafeGetRaw(UnsafeGetRaw* x) {
2261 LIRItem base(x->base(), this);
2262 LIRItem idx(this);
2263
2264 base.load_item();
2265 if (x->has_index()) {
2266 idx.set_instruction(x->index());
2267 idx.load_nonconstant();
2268 }
2269
2270 LIR_Opr reg = rlock_result(x, x->basic_type());
2271
2272 int log2_scale = 0;
2273 if (x->has_index()) {
2274 log2_scale = x->log2_scale();
2275 }
2276
2277 assert(!x->has_index() || idx.value() == x->index(), "should match");
2278
2279 LIR_Opr base_op = base.result();
2280 LIR_Opr index_op = idx.result();
2281 #ifndef _LP64
2282 if (base_op->type() == T_LONG) {
2283 base_op = new_register(T_INT);
2284 __ convert(Bytecodes::_l2i, base.result(), base_op);
2285 }
2286 if (x->has_index()) {
2287 if (index_op->type() == T_LONG) {
2288 LIR_Opr long_index_op = index_op;
2289 if (index_op->is_constant()) {
2290 long_index_op = new_register(T_LONG);
2291 __ move(index_op, long_index_op);
2292 }
2293 index_op = new_register(T_INT);
2294 __ convert(Bytecodes::_l2i, long_index_op, index_op);
2295 } else {
2296 assert(x->index()->type()->tag() == intTag, "must be");
2297 }
2298 }
2299 // At this point base and index should be all ints.
2300 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2301 assert(!x->has_index() || index_op->type() == T_INT, "index should be an int");
2302 #else
2303 if (x->has_index()) {
2304 if (index_op->type() == T_INT) {
2305 if (!index_op->is_constant()) {
2306 index_op = new_register(T_LONG);
2307 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2308 }
2309 } else {
2310 assert(index_op->type() == T_LONG, "must be");
2311 if (index_op->is_constant()) {
2312 index_op = new_register(T_LONG);
2313 __ move(idx.result(), index_op);
2314 }
2315 }
2316 }
2317 // At this point base is a long non-constant
2318 // Index is a long register or a int constant.
2319 // We allow the constant to stay an int because that would allow us a more compact encoding by
2320 // embedding an immediate offset in the address expression. If we have a long constant, we have to
2321 // move it into a register first.
2322 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a long non-constant");
2323 assert(!x->has_index() || (index_op->type() == T_INT && index_op->is_constant()) ||
2324 (index_op->type() == T_LONG && !index_op->is_constant()), "unexpected index type");
2325 #endif
2326
2327 BasicType dst_type = x->basic_type();
2328
2329 LIR_Address* addr;
2330 if (index_op->is_constant()) {
2331 assert(log2_scale == 0, "must not have a scale");
2332 assert(index_op->type() == T_INT, "only int constants supported");
2333 addr = new LIR_Address(base_op, index_op->as_jint(), dst_type);
2334 } else {
2335 #ifdef X86
2336 addr = new LIR_Address(base_op, index_op, LIR_Address::Scale(log2_scale), 0, dst_type);
2337 #elif defined(GENERATE_ADDRESS_IS_PREFERRED)
2338 addr = generate_address(base_op, index_op, log2_scale, 0, dst_type);
2339 #else
2340 if (index_op->is_illegal() || log2_scale == 0) {
2341 addr = new LIR_Address(base_op, index_op, dst_type);
2342 } else {
2343 LIR_Opr tmp = new_pointer_register();
2344 __ shift_left(index_op, log2_scale, tmp);
2345 addr = new LIR_Address(base_op, tmp, dst_type);
2346 }
2347 #endif
2348 }
2349
2350 if (x->may_be_unaligned() && (dst_type == T_LONG || dst_type == T_DOUBLE)) {
2351 __ unaligned_move(addr, reg);
2352 } else {
2353 if (dst_type == T_OBJECT && x->is_wide()) {
2354 __ move_wide(addr, reg);
2355 } else {
2356 __ move(addr, reg);
2357 }
2358 }
2359 }
2360
2361
2362 void LIRGenerator::do_UnsafePutRaw(UnsafePutRaw* x) {
2363 int log2_scale = 0;
2364 BasicType type = x->basic_type();
2365
2366 if (x->has_index()) {
2367 log2_scale = x->log2_scale();
2368 }
2369
2370 LIRItem base(x->base(), this);
2371 LIRItem value(x->value(), this);
2372 LIRItem idx(this);
2373
2374 base.load_item();
2375 if (x->has_index()) {
2376 idx.set_instruction(x->index());
2377 idx.load_item();
2378 }
2379
2380 if (type == T_BYTE || type == T_BOOLEAN) {
2381 value.load_byte_item();
2382 } else {
2383 value.load_item();
2384 }
2385
2386 set_no_result(x);
2387
2388 LIR_Opr base_op = base.result();
2389 LIR_Opr index_op = idx.result();
2390
2391 #ifdef GENERATE_ADDRESS_IS_PREFERRED
2392 LIR_Address* addr = generate_address(base_op, index_op, log2_scale, 0, x->basic_type());
2393 #else
2394 #ifndef _LP64
2395 if (base_op->type() == T_LONG) {
2396 base_op = new_register(T_INT);
2397 __ convert(Bytecodes::_l2i, base.result(), base_op);
2398 }
2399 if (x->has_index()) {
2400 if (index_op->type() == T_LONG) {
2401 index_op = new_register(T_INT);
2402 __ convert(Bytecodes::_l2i, idx.result(), index_op);
2403 }
2404 }
2405 // At this point base and index should be all ints and not constants
2406 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2407 assert(!x->has_index() || (index_op->type() == T_INT && !index_op->is_constant()), "index should be an non-constant int");
2408 #else
2409 if (x->has_index()) {
2410 if (index_op->type() == T_INT) {
2411 index_op = new_register(T_LONG);
2412 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2413 }
2414 }
2415 // At this point base and index are long and non-constant
2416 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a non-constant long");
2417 assert(!x->has_index() || (index_op->type() == T_LONG && !index_op->is_constant()), "index must be a non-constant long");
2418 #endif
2419
2420 if (log2_scale != 0) {
2421 // temporary fix (platform dependent code without shift on Intel would be better)
2422 // TODO: ARM also allows embedded shift in the address
2423 LIR_Opr tmp = new_pointer_register();
2424 if (TwoOperandLIRForm) {
2425 __ move(index_op, tmp);
2426 index_op = tmp;
2427 }
2428 __ shift_left(index_op, log2_scale, tmp);
2429 if (!TwoOperandLIRForm) {
2430 index_op = tmp;
2431 }
2432 }
2433
2434 LIR_Address* addr = new LIR_Address(base_op, index_op, x->basic_type());
2435 #endif // !GENERATE_ADDRESS_IS_PREFERRED
2436 __ move(value.result(), addr);
2437 }
2438
2439
2440 void LIRGenerator::do_UnsafeGetObject(UnsafeGetObject* x) {
2441 BasicType type = x->basic_type();
2442 LIRItem src(x->object(), this);
2443 LIRItem off(x->offset(), this);
2444
2445 off.load_item();
2446 src.load_item();
2447
2448 DecoratorSet decorators = IN_HEAP | C1_UNSAFE_ACCESS;
2449
2450 if (x->is_volatile()) {
2451 decorators |= MO_SEQ_CST;
2452 }
2453 if (type == T_BOOLEAN) {
2454 decorators |= C1_MASK_BOOLEAN;
2455 }
2456 if (type == T_ARRAY || type == T_OBJECT) {
2457 decorators |= ON_UNKNOWN_OOP_REF;
2458 }
2459
2460 LIR_Opr result = rlock_result(x, type);
2461 access_load_at(decorators, type,
2462 src, off.result(), result);
2463 }
2464
2465
2466 void LIRGenerator::do_UnsafePutObject(UnsafePutObject* x) {
2467 BasicType type = x->basic_type();
2468 LIRItem src(x->object(), this);
2469 LIRItem off(x->offset(), this);
2470 LIRItem data(x->value(), this);
2471
2472 src.load_item();
2473 if (type == T_BOOLEAN || type == T_BYTE) {
2474 data.load_byte_item();
2475 } else {
2476 data.load_item();
2477 }
2478 off.load_item();
2479
2480 set_no_result(x);
2481
2482 DecoratorSet decorators = IN_HEAP | C1_UNSAFE_ACCESS;
2483 if (type == T_ARRAY || type == T_OBJECT) {
2484 decorators |= ON_UNKNOWN_OOP_REF;
2485 }
2486 if (x->is_volatile()) {
2487 decorators |= MO_SEQ_CST;
2488 }
2489 access_store_at(decorators, type, src, off.result(), data.result());
2490 }
2491
2492 void LIRGenerator::do_UnsafeGetAndSetObject(UnsafeGetAndSetObject* x) {
2493 BasicType type = x->basic_type();
2494 LIRItem src(x->object(), this);
2495 LIRItem off(x->offset(), this);
2496 LIRItem value(x->value(), this);
2497
2498 DecoratorSet decorators = IN_HEAP | C1_UNSAFE_ACCESS | MO_SEQ_CST;
2499
2500 if (type == T_ARRAY || type == T_OBJECT) {
2501 decorators |= ON_UNKNOWN_OOP_REF;
2502 }
2503
2504 LIR_Opr result;
2505 if (x->is_add()) {
2506 result = access_atomic_add_at(decorators, type, src, off, value);
2507 } else {
2508 result = access_atomic_xchg_at(decorators, type, src, off, value);
2509 }
2510 set_result(x, result);
2511 }
2512
2513 void LIRGenerator::do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux) {
2514 int lng = x->length();
2515
2516 for (int i = 0; i < lng; i++) {
2517 SwitchRange* one_range = x->at(i);
2518 int low_key = one_range->low_key();
2519 int high_key = one_range->high_key();
2520 BlockBegin* dest = one_range->sux();
2521 if (low_key == high_key) {
2522 __ cmp(lir_cond_equal, value, low_key);
2523 __ branch(lir_cond_equal, T_INT, dest);
2524 } else if (high_key - low_key == 1) {
2525 __ cmp(lir_cond_equal, value, low_key);
2526 __ branch(lir_cond_equal, T_INT, dest);
2527 __ cmp(lir_cond_equal, value, high_key);
2528 __ branch(lir_cond_equal, T_INT, dest);
2529 } else {
2530 LabelObj* L = new LabelObj();
2531 __ cmp(lir_cond_less, value, low_key);
2532 __ branch(lir_cond_less, T_INT, L->label());
2533 __ cmp(lir_cond_lessEqual, value, high_key);
2534 __ branch(lir_cond_lessEqual, T_INT, dest);
2535 __ branch_destination(L->label());
2536 }
2537 }
2538 __ jump(default_sux);
2539 }
2540
2541
2542 SwitchRangeArray* LIRGenerator::create_lookup_ranges(TableSwitch* x) {
2543 SwitchRangeList* res = new SwitchRangeList();
2544 int len = x->length();
2545 if (len > 0) {
2546 BlockBegin* sux = x->sux_at(0);
2547 int key = x->lo_key();
2548 BlockBegin* default_sux = x->default_sux();
2549 SwitchRange* range = new SwitchRange(key, sux);
2550 for (int i = 0; i < len; i++, key++) {
2551 BlockBegin* new_sux = x->sux_at(i);
2552 if (sux == new_sux) {
2553 // still in same range
2554 range->set_high_key(key);
2555 } else {
2556 // skip tests which explicitly dispatch to the default
2557 if (sux != default_sux) {
2558 res->append(range);
2559 }
2560 range = new SwitchRange(key, new_sux);
2561 }
2562 sux = new_sux;
2563 }
2564 if (res->length() == 0 || res->last() != range) res->append(range);
2565 }
2566 return res;
2567 }
2568
2569
2570 // we expect the keys to be sorted by increasing value
2571 SwitchRangeArray* LIRGenerator::create_lookup_ranges(LookupSwitch* x) {
2572 SwitchRangeList* res = new SwitchRangeList();
2573 int len = x->length();
2574 if (len > 0) {
2575 BlockBegin* default_sux = x->default_sux();
2576 int key = x->key_at(0);
2577 BlockBegin* sux = x->sux_at(0);
2578 SwitchRange* range = new SwitchRange(key, sux);
2579 for (int i = 1; i < len; i++) {
2580 int new_key = x->key_at(i);
2581 BlockBegin* new_sux = x->sux_at(i);
2582 if (key+1 == new_key && sux == new_sux) {
2583 // still in same range
2584 range->set_high_key(new_key);
2585 } else {
2586 // skip tests which explicitly dispatch to the default
2587 if (range->sux() != default_sux) {
2588 res->append(range);
2589 }
2590 range = new SwitchRange(new_key, new_sux);
2591 }
2592 key = new_key;
2593 sux = new_sux;
2594 }
2595 if (res->length() == 0 || res->last() != range) res->append(range);
2596 }
2597 return res;
2598 }
2599
2600
2601 void LIRGenerator::do_TableSwitch(TableSwitch* x) {
2602 LIRItem tag(x->tag(), this);
2603 tag.load_item();
2604 set_no_result(x);
2605
2606 if (x->is_safepoint()) {
2607 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2608 }
2609
2610 // move values into phi locations
2611 move_to_phi(x->state());
2612
2613 int lo_key = x->lo_key();
2614 int len = x->length();
2615 assert(lo_key <= (lo_key + (len - 1)), "integer overflow");
2616 LIR_Opr value = tag.result();
2617
2618 if (compilation()->env()->comp_level() == CompLevel_full_profile && UseSwitchProfiling) {
2619 ciMethod* method = x->state()->scope()->method();
2620 ciMethodData* md = method->method_data_or_null();
2621 assert(md != NULL, "Sanity");
2622 ciProfileData* data = md->bci_to_data(x->state()->bci());
2623 assert(data != NULL, "must have profiling data");
2624 assert(data->is_MultiBranchData(), "bad profile data?");
2625 int default_count_offset = md->byte_offset_of_slot(data, MultiBranchData::default_count_offset());
2626 LIR_Opr md_reg = new_register(T_METADATA);
2627 __ metadata2reg(md->constant_encoding(), md_reg);
2628 LIR_Opr data_offset_reg = new_pointer_register();
2629 LIR_Opr tmp_reg = new_pointer_register();
2630
2631 __ move(LIR_OprFact::intptrConst(default_count_offset), data_offset_reg);
2632 for (int i = 0; i < len; i++) {
2633 int count_offset = md->byte_offset_of_slot(data, MultiBranchData::case_count_offset(i));
2634 __ cmp(lir_cond_equal, value, i + lo_key);
2635 __ move(data_offset_reg, tmp_reg);
2636 __ cmove(lir_cond_equal,
2637 LIR_OprFact::intptrConst(count_offset),
2638 tmp_reg,
2639 data_offset_reg, T_INT);
2640 }
2641
2642 LIR_Opr data_reg = new_pointer_register();
2643 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
2644 __ move(data_addr, data_reg);
2645 __ add(data_reg, LIR_OprFact::intptrConst(1), data_reg);
2646 __ move(data_reg, data_addr);
2647 }
2648
2649 if (UseTableRanges) {
2650 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2651 } else {
2652 for (int i = 0; i < len; i++) {
2653 __ cmp(lir_cond_equal, value, i + lo_key);
2654 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2655 }
2656 __ jump(x->default_sux());
2657 }
2658 }
2659
2660
2661 void LIRGenerator::do_LookupSwitch(LookupSwitch* x) {
2662 LIRItem tag(x->tag(), this);
2663 tag.load_item();
2664 set_no_result(x);
2665
2666 if (x->is_safepoint()) {
2667 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2668 }
2669
2670 // move values into phi locations
2671 move_to_phi(x->state());
2672
2673 LIR_Opr value = tag.result();
2674 int len = x->length();
2675
2676 if (compilation()->env()->comp_level() == CompLevel_full_profile && UseSwitchProfiling) {
2677 ciMethod* method = x->state()->scope()->method();
2678 ciMethodData* md = method->method_data_or_null();
2679 assert(md != NULL, "Sanity");
2680 ciProfileData* data = md->bci_to_data(x->state()->bci());
2681 assert(data != NULL, "must have profiling data");
2682 assert(data->is_MultiBranchData(), "bad profile data?");
2683 int default_count_offset = md->byte_offset_of_slot(data, MultiBranchData::default_count_offset());
2684 LIR_Opr md_reg = new_register(T_METADATA);
2685 __ metadata2reg(md->constant_encoding(), md_reg);
2686 LIR_Opr data_offset_reg = new_pointer_register();
2687 LIR_Opr tmp_reg = new_pointer_register();
2688
2689 __ move(LIR_OprFact::intptrConst(default_count_offset), data_offset_reg);
2690 for (int i = 0; i < len; i++) {
2691 int count_offset = md->byte_offset_of_slot(data, MultiBranchData::case_count_offset(i));
2692 __ cmp(lir_cond_equal, value, x->key_at(i));
2693 __ move(data_offset_reg, tmp_reg);
2694 __ cmove(lir_cond_equal,
2695 LIR_OprFact::intptrConst(count_offset),
2696 tmp_reg,
2697 data_offset_reg, T_INT);
2698 }
2699
2700 LIR_Opr data_reg = new_pointer_register();
2701 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
2702 __ move(data_addr, data_reg);
2703 __ add(data_reg, LIR_OprFact::intptrConst(1), data_reg);
2704 __ move(data_reg, data_addr);
2705 }
2706
2707 if (UseTableRanges) {
2708 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2709 } else {
2710 int len = x->length();
2711 for (int i = 0; i < len; i++) {
2712 __ cmp(lir_cond_equal, value, x->key_at(i));
2713 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2714 }
2715 __ jump(x->default_sux());
2716 }
2717 }
2718
2719
2720 void LIRGenerator::do_Goto(Goto* x) {
2721 set_no_result(x);
2722
2723 if (block()->next()->as_OsrEntry()) {
2724 // need to free up storage used for OSR entry point
2725 LIR_Opr osrBuffer = block()->next()->operand();
2726 BasicTypeList signature;
2727 signature.append(NOT_LP64(T_INT) LP64_ONLY(T_LONG)); // pass a pointer to osrBuffer
2728 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
2729 __ move(osrBuffer, cc->args()->at(0));
2730 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
2731 getThreadTemp(), LIR_OprFact::illegalOpr, cc->args());
2732 }
2733
2734 if (x->is_safepoint()) {
2735 ValueStack* state = x->state_before() ? x->state_before() : x->state();
2736
2737 // increment backedge counter if needed
2738 CodeEmitInfo* info = state_for(x, state);
2739 increment_backedge_counter(info, x->profiled_bci());
2740 CodeEmitInfo* safepoint_info = state_for(x, state);
2741 __ safepoint(safepoint_poll_register(), safepoint_info);
2742 }
2743
2744 // Gotos can be folded Ifs, handle this case.
2745 if (x->should_profile()) {
2746 ciMethod* method = x->profiled_method();
2747 assert(method != NULL, "method should be set if branch is profiled");
2748 ciMethodData* md = method->method_data_or_null();
2749 assert(md != NULL, "Sanity");
2750 ciProfileData* data = md->bci_to_data(x->profiled_bci());
2751 assert(data != NULL, "must have profiling data");
2752 int offset;
2753 if (x->direction() == Goto::taken) {
2754 assert(data->is_BranchData(), "need BranchData for two-way branches");
2755 offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
2756 } else if (x->direction() == Goto::not_taken) {
2757 assert(data->is_BranchData(), "need BranchData for two-way branches");
2758 offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
2759 } else {
2760 assert(data->is_JumpData(), "need JumpData for branches");
2761 offset = md->byte_offset_of_slot(data, JumpData::taken_offset());
2762 }
2763 LIR_Opr md_reg = new_register(T_METADATA);
2764 __ metadata2reg(md->constant_encoding(), md_reg);
2765
2766 increment_counter(new LIR_Address(md_reg, offset,
2767 NOT_LP64(T_INT) LP64_ONLY(T_LONG)), DataLayout::counter_increment);
2768 }
2769
2770 // emit phi-instruction move after safepoint since this simplifies
2771 // describing the state as the safepoint.
2772 move_to_phi(x->state());
2773
2774 __ jump(x->default_sux());
2775 }
2776
2777 /**
2778 * Emit profiling code if needed for arguments, parameters, return value types
2779 *
2780 * @param md MDO the code will update at runtime
2781 * @param md_base_offset common offset in the MDO for this profile and subsequent ones
2782 * @param md_offset offset in the MDO (on top of md_base_offset) for this profile
2783 * @param profiled_k current profile
2784 * @param obj IR node for the object to be profiled
2785 * @param mdp register to hold the pointer inside the MDO (md + md_base_offset).
2786 * Set once we find an update to make and use for next ones.
2787 * @param not_null true if we know obj cannot be null
2788 * @param signature_at_call_k signature at call for obj
2789 * @param callee_signature_k signature of callee for obj
2790 * at call and callee signatures differ at method handle call
2791 * @return the only klass we know will ever be seen at this profile point
2792 */
2793 ciKlass* LIRGenerator::profile_type(ciMethodData* md, int md_base_offset, int md_offset, intptr_t profiled_k,
2794 Value obj, LIR_Opr& mdp, bool not_null, ciKlass* signature_at_call_k,
2795 ciKlass* callee_signature_k) {
2796 ciKlass* result = NULL;
2797 bool do_null = !not_null && !TypeEntries::was_null_seen(profiled_k);
2798 bool do_update = !TypeEntries::is_type_unknown(profiled_k);
2799 // known not to be null or null bit already set and already set to
2800 // unknown: nothing we can do to improve profiling
2801 if (!do_null && !do_update) {
2802 return result;
2803 }
2804
2805 ciKlass* exact_klass = NULL;
2806 Compilation* comp = Compilation::current();
2807 if (do_update) {
2808 // try to find exact type, using CHA if possible, so that loading
2809 // the klass from the object can be avoided
2810 ciType* type = obj->exact_type();
2811 if (type == NULL) {
2812 type = obj->declared_type();
2813 type = comp->cha_exact_type(type);
2814 }
2815 assert(type == NULL || type->is_klass(), "type should be class");
2816 exact_klass = (type != NULL && type->is_loaded()) ? (ciKlass*)type : NULL;
2817
2818 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2819 }
2820
2821 if (!do_null && !do_update) {
2822 return result;
2823 }
2824
2825 ciKlass* exact_signature_k = NULL;
2826 if (do_update) {
2827 // Is the type from the signature exact (the only one possible)?
2828 exact_signature_k = signature_at_call_k->exact_klass();
2829 if (exact_signature_k == NULL) {
2830 exact_signature_k = comp->cha_exact_type(signature_at_call_k);
2831 } else {
2832 result = exact_signature_k;
2833 // Known statically. No need to emit any code: prevent
2834 // LIR_Assembler::emit_profile_type() from emitting useless code
2835 profiled_k = ciTypeEntries::with_status(result, profiled_k);
2836 }
2837 // exact_klass and exact_signature_k can be both non NULL but
2838 // different if exact_klass is loaded after the ciObject for
2839 // exact_signature_k is created.
2840 if (exact_klass == NULL && exact_signature_k != NULL && exact_klass != exact_signature_k) {
2841 // sometimes the type of the signature is better than the best type
2842 // the compiler has
2843 exact_klass = exact_signature_k;
2844 }
2845 if (callee_signature_k != NULL &&
2846 callee_signature_k != signature_at_call_k) {
2847 ciKlass* improved_klass = callee_signature_k->exact_klass();
2848 if (improved_klass == NULL) {
2849 improved_klass = comp->cha_exact_type(callee_signature_k);
2850 }
2851 if (exact_klass == NULL && improved_klass != NULL && exact_klass != improved_klass) {
2852 exact_klass = exact_signature_k;
2853 }
2854 }
2855 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2856 }
2857
2858 if (!do_null && !do_update) {
2859 return result;
2860 }
2861
2862 if (mdp == LIR_OprFact::illegalOpr) {
2863 mdp = new_register(T_METADATA);
2864 __ metadata2reg(md->constant_encoding(), mdp);
2865 if (md_base_offset != 0) {
2866 LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS);
2867 mdp = new_pointer_register();
2868 __ leal(LIR_OprFact::address(base_type_address), mdp);
2869 }
2870 }
2871 LIRItem value(obj, this);
2872 value.load_item();
2873 __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA),
2874 value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != NULL);
2875 return result;
2876 }
2877
2878 // profile parameters on entry to the root of the compilation
2879 void LIRGenerator::profile_parameters(Base* x) {
2880 if (compilation()->profile_parameters()) {
2881 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2882 ciMethodData* md = scope()->method()->method_data_or_null();
2883 assert(md != NULL, "Sanity");
2884
2885 if (md->parameters_type_data() != NULL) {
2886 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
2887 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
2888 LIR_Opr mdp = LIR_OprFact::illegalOpr;
2889 for (int java_index = 0, i = 0, j = 0; j < parameters_type_data->number_of_parameters(); i++) {
2890 LIR_Opr src = args->at(i);
2891 assert(!src->is_illegal(), "check");
2892 BasicType t = src->type();
2893 if (t == T_OBJECT || t == T_ARRAY) {
2894 intptr_t profiled_k = parameters->type(j);
2895 Local* local = x->state()->local_at(java_index)->as_Local();
2896 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
2897 in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)),
2898 profiled_k, local, mdp, false, local->declared_type()->as_klass(), NULL);
2899 // If the profile is known statically set it once for all and do not emit any code
2900 if (exact != NULL) {
2901 md->set_parameter_type(j, exact);
2902 }
2903 j++;
2904 }
2905 java_index += type2size[t];
2906 }
2907 }
2908 }
2909 }
2910
2911 void LIRGenerator::do_Base(Base* x) {
2912 __ std_entry(LIR_OprFact::illegalOpr);
2913 // Emit moves from physical registers / stack slots to virtual registers
2914 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2915 IRScope* irScope = compilation()->hir()->top_scope();
2916 int java_index = 0;
2917 for (int i = 0; i < args->length(); i++) {
2918 LIR_Opr src = args->at(i);
2919 assert(!src->is_illegal(), "check");
2920 BasicType t = src->type();
2921
2922 // Types which are smaller than int are passed as int, so
2923 // correct the type which passed.
2924 switch (t) {
2925 case T_BYTE:
2926 case T_BOOLEAN:
2927 case T_SHORT:
2928 case T_CHAR:
2929 t = T_INT;
2930 break;
2931 default:
2932 break;
2933 }
2934
2935 LIR_Opr dest = new_register(t);
2936 __ move(src, dest);
2937
2938 // Assign new location to Local instruction for this local
2939 Local* local = x->state()->local_at(java_index)->as_Local();
2940 assert(local != NULL, "Locals for incoming arguments must have been created");
2941 #ifndef __SOFTFP__
2942 // The java calling convention passes double as long and float as int.
2943 assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
2944 #endif // __SOFTFP__
2945 local->set_operand(dest);
2946 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL);
2947 java_index += type2size[t];
2948 }
2949
2950 if (compilation()->env()->dtrace_method_probes()) {
2951 BasicTypeList signature;
2952 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
2953 signature.append(T_METADATA); // Method*
2954 LIR_OprList* args = new LIR_OprList();
2955 args->append(getThreadPointer());
2956 LIR_Opr meth = new_register(T_METADATA);
2957 __ metadata2reg(method()->constant_encoding(), meth);
2958 args->append(meth);
2959 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, NULL);
2960 }
2961
2962 if (method()->is_synchronized()) {
2963 LIR_Opr obj;
2964 if (method()->is_static()) {
2965 obj = new_register(T_OBJECT);
2966 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
2967 } else {
2968 Local* receiver = x->state()->local_at(0)->as_Local();
2969 assert(receiver != NULL, "must already exist");
2970 obj = receiver->operand();
2971 }
2972 assert(obj->is_valid(), "must be valid");
2973
2974 if (method()->is_synchronized() && GenerateSynchronizationCode) {
2975 LIR_Opr lock = syncLockOpr();
2976 __ load_stack_address_monitor(0, lock);
2977
2978 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, x->check_flag(Instruction::DeoptimizeOnException));
2979 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
2980
2981 // receiver is guaranteed non-NULL so don't need CodeEmitInfo
2982 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, NULL);
2983 }
2984 }
2985 if (compilation()->age_code()) {
2986 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, 0), NULL, false);
2987 decrement_age(info);
2988 }
2989 // increment invocation counters if needed
2990 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
2991 profile_parameters(x);
2992 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, false);
2993 increment_invocation_counter(info);
2994 }
2995
2996 // all blocks with a successor must end with an unconditional jump
2997 // to the successor even if they are consecutive
2998 __ jump(x->default_sux());
2999 }
3000
3001
3002 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
3003 // construct our frame and model the production of incoming pointer
3004 // to the OSR buffer.
3005 __ osr_entry(LIR_Assembler::osrBufferPointer());
3006 LIR_Opr result = rlock_result(x);
3007 __ move(LIR_Assembler::osrBufferPointer(), result);
3008 }
3009
3010
3011 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
3012 assert(args->length() == arg_list->length(),
3013 "args=%d, arg_list=%d", args->length(), arg_list->length());
3014 for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) {
3015 LIRItem* param = args->at(i);
3016 LIR_Opr loc = arg_list->at(i);
3017 if (loc->is_register()) {
3018 param->load_item_force(loc);
3019 } else {
3020 LIR_Address* addr = loc->as_address_ptr();
3021 param->load_for_store(addr->type());
3022 assert(addr->type() != T_VALUETYPE, "not supported yet");
3023 if (addr->type() == T_OBJECT) {
3024 __ move_wide(param->result(), addr);
3025 } else
3026 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3027 __ unaligned_move(param->result(), addr);
3028 } else {
3029 __ move(param->result(), addr);
3030 }
3031 }
3032 }
3033
3034 if (x->has_receiver()) {
3035 LIRItem* receiver = args->at(0);
3036 LIR_Opr loc = arg_list->at(0);
3037 if (loc->is_register()) {
3038 receiver->load_item_force(loc);
3039 } else {
3040 assert(loc->is_address(), "just checking");
3041 receiver->load_for_store(T_OBJECT);
3042 __ move_wide(receiver->result(), loc->as_address_ptr());
3043 }
3044 }
3045 }
3046
3047
3048 // Visits all arguments, returns appropriate items without loading them
3049 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
3050 LIRItemList* argument_items = new LIRItemList();
3051 if (x->has_receiver()) {
3052 LIRItem* receiver = new LIRItem(x->receiver(), this);
3053 argument_items->append(receiver);
3054 }
3055 for (int i = 0; i < x->number_of_arguments(); i++) {
3056 LIRItem* param = new LIRItem(x->argument_at(i), this);
3057 argument_items->append(param);
3058 }
3059 return argument_items;
3060 }
3061
3062
3063 // The invoke with receiver has following phases:
3064 // a) traverse and load/lock receiver;
3065 // b) traverse all arguments -> item-array (invoke_visit_argument)
3066 // c) push receiver on stack
3067 // d) load each of the items and push on stack
3068 // e) unlock receiver
3069 // f) move receiver into receiver-register %o0
3070 // g) lock result registers and emit call operation
3071 //
3072 // Before issuing a call, we must spill-save all values on stack
3073 // that are in caller-save register. "spill-save" moves those registers
3074 // either in a free callee-save register or spills them if no free
3075 // callee save register is available.
3076 //
3077 // The problem is where to invoke spill-save.
3078 // - if invoked between e) and f), we may lock callee save
3079 // register in "spill-save" that destroys the receiver register
3080 // before f) is executed
3081 // - if we rearrange f) to be earlier (by loading %o0) it
3082 // may destroy a value on the stack that is currently in %o0
3083 // and is waiting to be spilled
3084 // - if we keep the receiver locked while doing spill-save,
3085 // we cannot spill it as it is spill-locked
3086 //
3087 void LIRGenerator::do_Invoke(Invoke* x) {
3088 CallingConvention* cc = frame_map()->java_calling_convention(x->signature(), true);
3089
3090 LIR_OprList* arg_list = cc->args();
3091 LIRItemList* args = invoke_visit_arguments(x);
3092 LIR_Opr receiver = LIR_OprFact::illegalOpr;
3093
3094 // setup result register
3095 LIR_Opr result_register = LIR_OprFact::illegalOpr;
3096 if (x->type() != voidType) {
3097 result_register = result_register_for(x->type());
3098 }
3099
3100 CodeEmitInfo* info = state_for(x, x->state());
3101
3102 invoke_load_arguments(x, args, arg_list);
3103
3104 if (x->has_receiver()) {
3105 args->at(0)->load_item_force(LIR_Assembler::receiverOpr());
3106 receiver = args->at(0)->result();
3107 }
3108
3109 // emit invoke code
3110 assert(receiver->is_illegal() || receiver->is_equal(LIR_Assembler::receiverOpr()), "must match");
3111
3112 // JSR 292
3113 // Preserve the SP over MethodHandle call sites, if needed.
3114 ciMethod* target = x->target();
3115 bool is_method_handle_invoke = (// %%% FIXME: Are both of these relevant?
3116 target->is_method_handle_intrinsic() ||
3117 target->is_compiled_lambda_form());
3118 if (is_method_handle_invoke) {
3119 info->set_is_method_handle_invoke(true);
3120 if(FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
3121 __ move(FrameMap::stack_pointer(), FrameMap::method_handle_invoke_SP_save_opr());
3122 }
3123 }
3124
3125 switch (x->code()) {
3126 case Bytecodes::_invokestatic:
3127 __ call_static(target, result_register,
3128 SharedRuntime::get_resolve_static_call_stub(),
3129 arg_list, info);
3130 break;
3131 case Bytecodes::_invokespecial:
3132 case Bytecodes::_invokevirtual:
3133 case Bytecodes::_invokeinterface:
3134 // for loaded and final (method or class) target we still produce an inline cache,
3135 // in order to be able to call mixed mode
3136 if (x->code() == Bytecodes::_invokespecial || x->target_is_final()) {
3137 __ call_opt_virtual(target, receiver, result_register,
3138 SharedRuntime::get_resolve_opt_virtual_call_stub(),
3139 arg_list, info);
3140 } else if (x->vtable_index() < 0) {
3141 __ call_icvirtual(target, receiver, result_register,
3142 SharedRuntime::get_resolve_virtual_call_stub(),
3143 arg_list, info);
3144 } else {
3145 int entry_offset = in_bytes(Klass::vtable_start_offset()) + x->vtable_index() * vtableEntry::size_in_bytes();
3146 int vtable_offset = entry_offset + vtableEntry::method_offset_in_bytes();
3147 __ call_virtual(target, receiver, result_register, vtable_offset, arg_list, info);
3148 }
3149 break;
3150 case Bytecodes::_invokedynamic: {
3151 __ call_dynamic(target, receiver, result_register,
3152 SharedRuntime::get_resolve_static_call_stub(),
3153 arg_list, info);
3154 break;
3155 }
3156 default:
3157 fatal("unexpected bytecode: %s", Bytecodes::name(x->code()));
3158 break;
3159 }
3160
3161 // JSR 292
3162 // Restore the SP after MethodHandle call sites, if needed.
3163 if (is_method_handle_invoke
3164 && FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
3165 __ move(FrameMap::method_handle_invoke_SP_save_opr(), FrameMap::stack_pointer());
3166 }
3167
3168 if (x->type()->is_float() || x->type()->is_double()) {
3169 // Force rounding of results from non-strictfp when in strictfp
3170 // scope (or when we don't know the strictness of the callee, to
3171 // be safe.)
3172 if (method()->is_strict()) {
3173 if (!x->target_is_loaded() || !x->target_is_strictfp()) {
3174 result_register = round_item(result_register);
3175 }
3176 }
3177 }
3178
3179 if (result_register->is_valid()) {
3180 LIR_Opr result = rlock_result(x);
3181 __ move(result_register, result);
3182 }
3183 }
3184
3185
3186 void LIRGenerator::do_FPIntrinsics(Intrinsic* x) {
3187 assert(x->number_of_arguments() == 1, "wrong type");
3188 LIRItem value (x->argument_at(0), this);
3189 LIR_Opr reg = rlock_result(x);
3190 value.load_item();
3191 LIR_Opr tmp = force_to_spill(value.result(), as_BasicType(x->type()));
3192 __ move(tmp, reg);
3193 }
3194
3195
3196
3197 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval()
3198 void LIRGenerator::do_IfOp(IfOp* x) {
3199 #ifdef ASSERT
3200 {
3201 ValueTag xtag = x->x()->type()->tag();
3202 ValueTag ttag = x->tval()->type()->tag();
3203 assert(xtag == intTag || xtag == objectTag, "cannot handle others");
3204 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
3205 assert(ttag == x->fval()->type()->tag(), "cannot handle others");
3206 }
3207 #endif
3208
3209 LIRItem left(x->x(), this);
3210 LIRItem right(x->y(), this);
3211 left.load_item();
3212 if (can_inline_as_constant(right.value())) {
3213 right.dont_load_item();
3214 } else {
3215 right.load_item();
3216 }
3217
3218 LIRItem t_val(x->tval(), this);
3219 LIRItem f_val(x->fval(), this);
3220 t_val.dont_load_item();
3221 f_val.dont_load_item();
3222 LIR_Opr reg = rlock_result(x);
3223
3224 __ cmp(lir_cond(x->cond()), left.result(), right.result());
3225 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
3226 }
3227
3228 #ifdef JFR_HAVE_INTRINSICS
3229 void LIRGenerator::do_ClassIDIntrinsic(Intrinsic* x) {
3230 CodeEmitInfo* info = state_for(x);
3231 CodeEmitInfo* info2 = new CodeEmitInfo(info); // Clone for the second null check
3232
3233 assert(info != NULL, "must have info");
3234 LIRItem arg(x->argument_at(0), this);
3235
3236 arg.load_item();
3237 LIR_Opr klass = new_register(T_METADATA);
3238 __ move(new LIR_Address(arg.result(), java_lang_Class::klass_offset_in_bytes(), T_ADDRESS), klass, info);
3239 LIR_Opr id = new_register(T_LONG);
3240 ByteSize offset = KLASS_TRACE_ID_OFFSET;
3241 LIR_Address* trace_id_addr = new LIR_Address(klass, in_bytes(offset), T_LONG);
3242
3243 __ move(trace_id_addr, id);
3244 __ logical_or(id, LIR_OprFact::longConst(0x01l), id);
3245 __ store(id, trace_id_addr);
3246
3247 #ifdef TRACE_ID_META_BITS
3248 __ logical_and(id, LIR_OprFact::longConst(~TRACE_ID_META_BITS), id);
3249 #endif
3250 #ifdef TRACE_ID_SHIFT
3251 __ unsigned_shift_right(id, TRACE_ID_SHIFT, id);
3252 #endif
3253
3254 __ move(id, rlock_result(x));
3255 }
3256
3257 void LIRGenerator::do_getEventWriter(Intrinsic* x) {
3258 LabelObj* L_end = new LabelObj();
3259
3260 LIR_Address* jobj_addr = new LIR_Address(getThreadPointer(),
3261 in_bytes(THREAD_LOCAL_WRITER_OFFSET_JFR),
3262 T_OBJECT);
3263 LIR_Opr result = rlock_result(x);
3264 __ move_wide(jobj_addr, result);
3265 __ cmp(lir_cond_equal, result, LIR_OprFact::oopConst(NULL));
3266 __ branch(lir_cond_equal, T_OBJECT, L_end->label());
3267
3268 LIR_Opr jobj = new_register(T_OBJECT);
3269 __ move(result, jobj);
3270 access_load(IN_NATIVE, T_OBJECT, LIR_OprFact::address(new LIR_Address(jobj, T_OBJECT)), result);
3271
3272 __ branch_destination(L_end->label());
3273 }
3274
3275 #endif
3276
3277
3278 void LIRGenerator::do_RuntimeCall(address routine, Intrinsic* x) {
3279 assert(x->number_of_arguments() == 0, "wrong type");
3280 // Enforce computation of _reserved_argument_area_size which is required on some platforms.
3281 BasicTypeList signature;
3282 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
3283 LIR_Opr reg = result_register_for(x->type());
3284 __ call_runtime_leaf(routine, getThreadTemp(),
3285 reg, new LIR_OprList());
3286 LIR_Opr result = rlock_result(x);
3287 __ move(reg, result);
3288 }
3289
3290
3291
3292 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
3293 switch (x->id()) {
3294 case vmIntrinsics::_intBitsToFloat :
3295 case vmIntrinsics::_doubleToRawLongBits :
3296 case vmIntrinsics::_longBitsToDouble :
3297 case vmIntrinsics::_floatToRawIntBits : {
3298 do_FPIntrinsics(x);
3299 break;
3300 }
3301
3302 #ifdef JFR_HAVE_INTRINSICS
3303 case vmIntrinsics::_getClassId:
3304 do_ClassIDIntrinsic(x);
3305 break;
3306 case vmIntrinsics::_getEventWriter:
3307 do_getEventWriter(x);
3308 break;
3309 case vmIntrinsics::_counterTime:
3310 do_RuntimeCall(CAST_FROM_FN_PTR(address, JFR_TIME_FUNCTION), x);
3311 break;
3312 #endif
3313
3314 case vmIntrinsics::_currentTimeMillis:
3315 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeMillis), x);
3316 break;
3317
3318 case vmIntrinsics::_nanoTime:
3319 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeNanos), x);
3320 break;
3321
3322 case vmIntrinsics::_Object_init: do_RegisterFinalizer(x); break;
3323 case vmIntrinsics::_isInstance: do_isInstance(x); break;
3324 case vmIntrinsics::_isPrimitive: do_isPrimitive(x); break;
3325 case vmIntrinsics::_getClass: do_getClass(x); break;
3326 case vmIntrinsics::_currentThread: do_currentThread(x); break;
3327
3328 case vmIntrinsics::_dlog: // fall through
3329 case vmIntrinsics::_dlog10: // fall through
3330 case vmIntrinsics::_dabs: // fall through
3331 case vmIntrinsics::_dsqrt: // fall through
3332 case vmIntrinsics::_dtan: // fall through
3333 case vmIntrinsics::_dsin : // fall through
3334 case vmIntrinsics::_dcos : // fall through
3335 case vmIntrinsics::_dexp : // fall through
3336 case vmIntrinsics::_dpow : do_MathIntrinsic(x); break;
3337 case vmIntrinsics::_arraycopy: do_ArrayCopy(x); break;
3338
3339 case vmIntrinsics::_fmaD: do_FmaIntrinsic(x); break;
3340 case vmIntrinsics::_fmaF: do_FmaIntrinsic(x); break;
3341
3342 // java.nio.Buffer.checkIndex
3343 case vmIntrinsics::_checkIndex: do_NIOCheckIndex(x); break;
3344
3345 case vmIntrinsics::_compareAndSetReference:
3346 do_CompareAndSwap(x, objectType);
3347 break;
3348 case vmIntrinsics::_compareAndSetInt:
3349 do_CompareAndSwap(x, intType);
3350 break;
3351 case vmIntrinsics::_compareAndSetLong:
3352 do_CompareAndSwap(x, longType);
3353 break;
3354
3355 case vmIntrinsics::_loadFence :
3356 __ membar_acquire();
3357 break;
3358 case vmIntrinsics::_storeFence:
3359 __ membar_release();
3360 break;
3361 case vmIntrinsics::_fullFence :
3362 __ membar();
3363 break;
3364 case vmIntrinsics::_onSpinWait:
3365 __ on_spin_wait();
3366 break;
3367 case vmIntrinsics::_Reference_get:
3368 do_Reference_get(x);
3369 break;
3370
3371 case vmIntrinsics::_updateCRC32:
3372 case vmIntrinsics::_updateBytesCRC32:
3373 case vmIntrinsics::_updateByteBufferCRC32:
3374 do_update_CRC32(x);
3375 break;
3376
3377 case vmIntrinsics::_updateBytesCRC32C:
3378 case vmIntrinsics::_updateDirectByteBufferCRC32C:
3379 do_update_CRC32C(x);
3380 break;
3381
3382 case vmIntrinsics::_vectorizedMismatch:
3383 do_vectorizedMismatch(x);
3384 break;
3385
3386 default: ShouldNotReachHere(); break;
3387 }
3388 }
3389
3390 void LIRGenerator::profile_arguments(ProfileCall* x) {
3391 if (compilation()->profile_arguments()) {
3392 int bci = x->bci_of_invoke();
3393 ciMethodData* md = x->method()->method_data_or_null();
3394 assert(md != NULL, "Sanity");
3395 ciProfileData* data = md->bci_to_data(bci);
3396 if (data != NULL) {
3397 if ((data->is_CallTypeData() && data->as_CallTypeData()->has_arguments()) ||
3398 (data->is_VirtualCallTypeData() && data->as_VirtualCallTypeData()->has_arguments())) {
3399 ByteSize extra = data->is_CallTypeData() ? CallTypeData::args_data_offset() : VirtualCallTypeData::args_data_offset();
3400 int base_offset = md->byte_offset_of_slot(data, extra);
3401 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3402 ciTypeStackSlotEntries* args = data->is_CallTypeData() ? ((ciCallTypeData*)data)->args() : ((ciVirtualCallTypeData*)data)->args();
3403
3404 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3405 int start = 0;
3406 int stop = data->is_CallTypeData() ? ((ciCallTypeData*)data)->number_of_arguments() : ((ciVirtualCallTypeData*)data)->number_of_arguments();
3407 if (x->callee()->is_loaded() && x->callee()->is_static() && Bytecodes::has_receiver(bc)) {
3408 // first argument is not profiled at call (method handle invoke)
3409 assert(x->method()->raw_code_at_bci(bci) == Bytecodes::_invokehandle, "invokehandle expected");
3410 start = 1;
3411 }
3412 ciSignature* callee_signature = x->callee()->signature();
3413 // method handle call to virtual method
3414 bool has_receiver = x->callee()->is_loaded() && !x->callee()->is_static() && !Bytecodes::has_receiver(bc);
3415 ciSignatureStream callee_signature_stream(callee_signature, has_receiver ? x->callee()->holder() : NULL);
3416
3417 bool ignored_will_link;
3418 ciSignature* signature_at_call = NULL;
3419 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3420 ciSignatureStream signature_at_call_stream(signature_at_call);
3421
3422 // if called through method handle invoke, some arguments may have been popped
3423 for (int i = 0; i < stop && i+start < x->nb_profiled_args(); i++) {
3424 int off = in_bytes(TypeEntriesAtCall::argument_type_offset(i)) - in_bytes(TypeEntriesAtCall::args_data_offset());
3425 ciKlass* exact = profile_type(md, base_offset, off,
3426 args->type(i), x->profiled_arg_at(i+start), mdp,
3427 !x->arg_needs_null_check(i+start),
3428 signature_at_call_stream.next_klass(), callee_signature_stream.next_klass());
3429 if (exact != NULL) {
3430 md->set_argument_type(bci, i, exact);
3431 }
3432 }
3433 } else {
3434 #ifdef ASSERT
3435 Bytecodes::Code code = x->method()->raw_code_at_bci(x->bci_of_invoke());
3436 int n = x->nb_profiled_args();
3437 assert(MethodData::profile_parameters() && (MethodData::profile_arguments_jsr292_only() ||
3438 (x->inlined() && ((code == Bytecodes::_invokedynamic && n <= 1) || (code == Bytecodes::_invokehandle && n <= 2)))),
3439 "only at JSR292 bytecodes");
3440 #endif
3441 }
3442 }
3443 }
3444 }
3445
3446 // profile parameters on entry to an inlined method
3447 void LIRGenerator::profile_parameters_at_call(ProfileCall* x) {
3448 if (compilation()->profile_parameters() && x->inlined()) {
3449 ciMethodData* md = x->callee()->method_data_or_null();
3450 if (md != NULL) {
3451 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
3452 if (parameters_type_data != NULL) {
3453 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
3454 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3455 bool has_receiver = !x->callee()->is_static();
3456 ciSignature* sig = x->callee()->signature();
3457 ciSignatureStream sig_stream(sig, has_receiver ? x->callee()->holder() : NULL);
3458 int i = 0; // to iterate on the Instructions
3459 Value arg = x->recv();
3460 bool not_null = false;
3461 int bci = x->bci_of_invoke();
3462 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3463 // The first parameter is the receiver so that's what we start
3464 // with if it exists. One exception is method handle call to
3465 // virtual method: the receiver is in the args list
3466 if (arg == NULL || !Bytecodes::has_receiver(bc)) {
3467 i = 1;
3468 arg = x->profiled_arg_at(0);
3469 not_null = !x->arg_needs_null_check(0);
3470 }
3471 int k = 0; // to iterate on the profile data
3472 for (;;) {
3473 intptr_t profiled_k = parameters->type(k);
3474 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
3475 in_bytes(ParametersTypeData::type_offset(k)) - in_bytes(ParametersTypeData::type_offset(0)),
3476 profiled_k, arg, mdp, not_null, sig_stream.next_klass(), NULL);
3477 // If the profile is known statically set it once for all and do not emit any code
3478 if (exact != NULL) {
3479 md->set_parameter_type(k, exact);
3480 }
3481 k++;
3482 if (k >= parameters_type_data->number_of_parameters()) {
3483 #ifdef ASSERT
3484 int extra = 0;
3485 if (MethodData::profile_arguments() && TypeProfileParmsLimit != -1 &&
3486 x->nb_profiled_args() >= TypeProfileParmsLimit &&
3487 x->recv() != NULL && Bytecodes::has_receiver(bc)) {
3488 extra += 1;
3489 }
3490 assert(i == x->nb_profiled_args() - extra || (TypeProfileParmsLimit != -1 && TypeProfileArgsLimit > TypeProfileParmsLimit), "unused parameters?");
3491 #endif
3492 break;
3493 }
3494 arg = x->profiled_arg_at(i);
3495 not_null = !x->arg_needs_null_check(i);
3496 i++;
3497 }
3498 }
3499 }
3500 }
3501 }
3502
3503 void LIRGenerator::do_ProfileCall(ProfileCall* x) {
3504 // Need recv in a temporary register so it interferes with the other temporaries
3505 LIR_Opr recv = LIR_OprFact::illegalOpr;
3506 LIR_Opr mdo = new_register(T_METADATA);
3507 // tmp is used to hold the counters on SPARC
3508 LIR_Opr tmp = new_pointer_register();
3509
3510 if (x->nb_profiled_args() > 0) {
3511 profile_arguments(x);
3512 }
3513
3514 // profile parameters on inlined method entry including receiver
3515 if (x->recv() != NULL || x->nb_profiled_args() > 0) {
3516 profile_parameters_at_call(x);
3517 }
3518
3519 if (x->recv() != NULL) {
3520 LIRItem value(x->recv(), this);
3521 value.load_item();
3522 recv = new_register(T_OBJECT);
3523 __ move(value.result(), recv);
3524 }
3525 __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder());
3526 }
3527
3528 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) {
3529 int bci = x->bci_of_invoke();
3530 ciMethodData* md = x->method()->method_data_or_null();
3531 assert(md != NULL, "Sanity");
3532 ciProfileData* data = md->bci_to_data(bci);
3533 if (data != NULL) {
3534 assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type");
3535 ciReturnTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret();
3536 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3537
3538 bool ignored_will_link;
3539 ciSignature* signature_at_call = NULL;
3540 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3541
3542 // The offset within the MDO of the entry to update may be too large
3543 // to be used in load/store instructions on some platforms. So have
3544 // profile_type() compute the address of the profile in a register.
3545 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0,
3546 ret->type(), x->ret(), mdp,
3547 !x->needs_null_check(),
3548 signature_at_call->return_type()->as_klass(),
3549 x->callee()->signature()->return_type()->as_klass());
3550 if (exact != NULL) {
3551 md->set_return_type(bci, exact);
3552 }
3553 }
3554 }
3555
3556 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
3557 // We can safely ignore accessors here, since c2 will inline them anyway,
3558 // accessors are also always mature.
3559 if (!x->inlinee()->is_accessor()) {
3560 CodeEmitInfo* info = state_for(x, x->state(), true);
3561 // Notify the runtime very infrequently only to take care of counter overflows
3562 int freq_log = Tier23InlineeNotifyFreqLog;
3563 double scale;
3564 if (_method->has_option_value("CompileThresholdScaling", scale)) {
3565 freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3566 }
3567 increment_event_counter_impl(info, x->inlinee(), LIR_OprFact::intConst(InvocationCounter::count_increment), right_n_bits(freq_log), InvocationEntryBci, false, true);
3568 }
3569 }
3570
3571 void LIRGenerator::increment_backedge_counter_conditionally(LIR_Condition cond, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info, int left_bci, int right_bci, int bci) {
3572 if (compilation()->count_backedges()) {
3573 __ cmp(cond, left, right);
3574 LIR_Opr step = new_register(T_INT);
3575 LIR_Opr plus_one = LIR_OprFact::intConst(InvocationCounter::count_increment);
3576 LIR_Opr zero = LIR_OprFact::intConst(0);
3577 __ cmove(cond,
3578 (left_bci < bci) ? plus_one : zero,
3579 (right_bci < bci) ? plus_one : zero,
3580 step, left->type());
3581 increment_backedge_counter(info, step, bci);
3582 }
3583 }
3584
3585
3586 void LIRGenerator::increment_event_counter(CodeEmitInfo* info, LIR_Opr step, int bci, bool backedge) {
3587 int freq_log = 0;
3588 int level = compilation()->env()->comp_level();
3589 if (level == CompLevel_limited_profile) {
3590 freq_log = (backedge ? Tier2BackedgeNotifyFreqLog : Tier2InvokeNotifyFreqLog);
3591 } else if (level == CompLevel_full_profile) {
3592 freq_log = (backedge ? Tier3BackedgeNotifyFreqLog : Tier3InvokeNotifyFreqLog);
3593 } else {
3594 ShouldNotReachHere();
3595 }
3596 // Increment the appropriate invocation/backedge counter and notify the runtime.
3597 double scale;
3598 if (_method->has_option_value("CompileThresholdScaling", scale)) {
3599 freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3600 }
3601 increment_event_counter_impl(info, info->scope()->method(), step, right_n_bits(freq_log), bci, backedge, true);
3602 }
3603
3604 void LIRGenerator::decrement_age(CodeEmitInfo* info) {
3605 ciMethod* method = info->scope()->method();
3606 MethodCounters* mc_adr = method->ensure_method_counters();
3607 if (mc_adr != NULL) {
3608 LIR_Opr mc = new_pointer_register();
3609 __ move(LIR_OprFact::intptrConst(mc_adr), mc);
3610 int offset = in_bytes(MethodCounters::nmethod_age_offset());
3611 LIR_Address* counter = new LIR_Address(mc, offset, T_INT);
3612 LIR_Opr result = new_register(T_INT);
3613 __ load(counter, result);
3614 __ sub(result, LIR_OprFact::intConst(1), result);
3615 __ store(result, counter);
3616 // DeoptimizeStub will reexecute from the current state in code info.
3617 CodeStub* deopt = new DeoptimizeStub(info, Deoptimization::Reason_tenured,
3618 Deoptimization::Action_make_not_entrant);
3619 __ cmp(lir_cond_lessEqual, result, LIR_OprFact::intConst(0));
3620 __ branch(lir_cond_lessEqual, T_INT, deopt);
3621 }
3622 }
3623
3624
3625 void LIRGenerator::increment_event_counter_impl(CodeEmitInfo* info,
3626 ciMethod *method, LIR_Opr step, int frequency,
3627 int bci, bool backedge, bool notify) {
3628 assert(frequency == 0 || is_power_of_2(frequency + 1), "Frequency must be x^2 - 1 or 0");
3629 int level = _compilation->env()->comp_level();
3630 assert(level > CompLevel_simple, "Shouldn't be here");
3631
3632 int offset = -1;
3633 LIR_Opr counter_holder = NULL;
3634 if (level == CompLevel_limited_profile) {
3635 MethodCounters* counters_adr = method->ensure_method_counters();
3636 if (counters_adr == NULL) {
3637 bailout("method counters allocation failed");
3638 return;
3639 }
3640 counter_holder = new_pointer_register();
3641 __ move(LIR_OprFact::intptrConst(counters_adr), counter_holder);
3642 offset = in_bytes(backedge ? MethodCounters::backedge_counter_offset() :
3643 MethodCounters::invocation_counter_offset());
3644 } else if (level == CompLevel_full_profile) {
3645 counter_holder = new_register(T_METADATA);
3646 offset = in_bytes(backedge ? MethodData::backedge_counter_offset() :
3647 MethodData::invocation_counter_offset());
3648 ciMethodData* md = method->method_data_or_null();
3649 assert(md != NULL, "Sanity");
3650 __ metadata2reg(md->constant_encoding(), counter_holder);
3651 } else {
3652 ShouldNotReachHere();
3653 }
3654 LIR_Address* counter = new LIR_Address(counter_holder, offset, T_INT);
3655 LIR_Opr result = new_register(T_INT);
3656 __ load(counter, result);
3657 __ add(result, step, result);
3658 __ store(result, counter);
3659 if (notify && (!backedge || UseOnStackReplacement)) {
3660 LIR_Opr meth = LIR_OprFact::metadataConst(method->constant_encoding());
3661 // The bci for info can point to cmp for if's we want the if bci
3662 CodeStub* overflow = new CounterOverflowStub(info, bci, meth);
3663 int freq = frequency << InvocationCounter::count_shift;
3664 if (freq == 0) {
3665 if (!step->is_constant()) {
3666 __ cmp(lir_cond_notEqual, step, LIR_OprFact::intConst(0));
3667 __ branch(lir_cond_notEqual, T_ILLEGAL, overflow);
3668 } else {
3669 __ branch(lir_cond_always, T_ILLEGAL, overflow);
3670 }
3671 } else {
3672 LIR_Opr mask = load_immediate(freq, T_INT);
3673 if (!step->is_constant()) {
3674 // If step is 0, make sure the overflow check below always fails
3675 __ cmp(lir_cond_notEqual, step, LIR_OprFact::intConst(0));
3676 __ cmove(lir_cond_notEqual, result, LIR_OprFact::intConst(InvocationCounter::count_increment), result, T_INT);
3677 }
3678 __ logical_and(result, mask, result);
3679 __ cmp(lir_cond_equal, result, LIR_OprFact::intConst(0));
3680 __ branch(lir_cond_equal, T_INT, overflow);
3681 }
3682 __ branch_destination(overflow->continuation());
3683 }
3684 }
3685
3686 void LIRGenerator::do_RuntimeCall(RuntimeCall* x) {
3687 LIR_OprList* args = new LIR_OprList(x->number_of_arguments());
3688 BasicTypeList* signature = new BasicTypeList(x->number_of_arguments());
3689
3690 if (x->pass_thread()) {
3691 signature->append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
3692 args->append(getThreadPointer());
3693 }
3694
3695 for (int i = 0; i < x->number_of_arguments(); i++) {
3696 Value a = x->argument_at(i);
3697 LIRItem* item = new LIRItem(a, this);
3698 item->load_item();
3699 args->append(item->result());
3700 signature->append(as_BasicType(a->type()));
3701 }
3702
3703 LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL);
3704 if (x->type() == voidType) {
3705 set_no_result(x);
3706 } else {
3707 __ move(result, rlock_result(x));
3708 }
3709 }
3710
3711 #ifdef ASSERT
3712 void LIRGenerator::do_Assert(Assert *x) {
3713 ValueTag tag = x->x()->type()->tag();
3714 If::Condition cond = x->cond();
3715
3716 LIRItem xitem(x->x(), this);
3717 LIRItem yitem(x->y(), this);
3718 LIRItem* xin = &xitem;
3719 LIRItem* yin = &yitem;
3720
3721 assert(tag == intTag, "Only integer assertions are valid!");
3722
3723 xin->load_item();
3724 yin->dont_load_item();
3725
3726 set_no_result(x);
3727
3728 LIR_Opr left = xin->result();
3729 LIR_Opr right = yin->result();
3730
3731 __ lir_assert(lir_cond(x->cond()), left, right, x->message(), true);
3732 }
3733 #endif
3734
3735 void LIRGenerator::do_RangeCheckPredicate(RangeCheckPredicate *x) {
3736
3737
3738 Instruction *a = x->x();
3739 Instruction *b = x->y();
3740 if (!a || StressRangeCheckElimination) {
3741 assert(!b || StressRangeCheckElimination, "B must also be null");
3742
3743 CodeEmitInfo *info = state_for(x, x->state());
3744 CodeStub* stub = new PredicateFailedStub(info);
3745
3746 __ jump(stub);
3747 } else if (a->type()->as_IntConstant() && b->type()->as_IntConstant()) {
3748 int a_int = a->type()->as_IntConstant()->value();
3749 int b_int = b->type()->as_IntConstant()->value();
3750
3751 bool ok = false;
3752
3753 switch(x->cond()) {
3754 case Instruction::eql: ok = (a_int == b_int); break;
3755 case Instruction::neq: ok = (a_int != b_int); break;
3756 case Instruction::lss: ok = (a_int < b_int); break;
3757 case Instruction::leq: ok = (a_int <= b_int); break;
3758 case Instruction::gtr: ok = (a_int > b_int); break;
3759 case Instruction::geq: ok = (a_int >= b_int); break;
3760 case Instruction::aeq: ok = ((unsigned int)a_int >= (unsigned int)b_int); break;
3761 case Instruction::beq: ok = ((unsigned int)a_int <= (unsigned int)b_int); break;
3762 default: ShouldNotReachHere();
3763 }
3764
3765 if (ok) {
3766
3767 CodeEmitInfo *info = state_for(x, x->state());
3768 CodeStub* stub = new PredicateFailedStub(info);
3769
3770 __ jump(stub);
3771 }
3772 } else {
3773
3774 ValueTag tag = x->x()->type()->tag();
3775 If::Condition cond = x->cond();
3776 LIRItem xitem(x->x(), this);
3777 LIRItem yitem(x->y(), this);
3778 LIRItem* xin = &xitem;
3779 LIRItem* yin = &yitem;
3780
3781 assert(tag == intTag, "Only integer deoptimizations are valid!");
3782
3783 xin->load_item();
3784 yin->dont_load_item();
3785 set_no_result(x);
3786
3787 LIR_Opr left = xin->result();
3788 LIR_Opr right = yin->result();
3789
3790 CodeEmitInfo *info = state_for(x, x->state());
3791 CodeStub* stub = new PredicateFailedStub(info);
3792
3793 __ cmp(lir_cond(cond), left, right);
3794 __ branch(lir_cond(cond), right->type(), stub);
3795 }
3796 }
3797
3798
3799 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) {
3800 LIRItemList args(1);
3801 LIRItem value(arg1, this);
3802 args.append(&value);
3803 BasicTypeList signature;
3804 signature.append(as_BasicType(arg1->type()));
3805
3806 return call_runtime(&signature, &args, entry, result_type, info);
3807 }
3808
3809
3810 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) {
3811 LIRItemList args(2);
3812 LIRItem value1(arg1, this);
3813 LIRItem value2(arg2, this);
3814 args.append(&value1);
3815 args.append(&value2);
3816 BasicTypeList signature;
3817 signature.append(as_BasicType(arg1->type()));
3818 signature.append(as_BasicType(arg2->type()));
3819
3820 return call_runtime(&signature, &args, entry, result_type, info);
3821 }
3822
3823
3824 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIR_OprList* args,
3825 address entry, ValueType* result_type, CodeEmitInfo* info) {
3826 // get a result register
3827 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3828 LIR_Opr result = LIR_OprFact::illegalOpr;
3829 if (result_type->tag() != voidTag) {
3830 result = new_register(result_type);
3831 phys_reg = result_register_for(result_type);
3832 }
3833
3834 // move the arguments into the correct location
3835 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3836 assert(cc->length() == args->length(), "argument mismatch");
3837 for (int i = 0; i < args->length(); i++) {
3838 LIR_Opr arg = args->at(i);
3839 LIR_Opr loc = cc->at(i);
3840 if (loc->is_register()) {
3841 __ move(arg, loc);
3842 } else {
3843 LIR_Address* addr = loc->as_address_ptr();
3844 // if (!can_store_as_constant(arg)) {
3845 // LIR_Opr tmp = new_register(arg->type());
3846 // __ move(arg, tmp);
3847 // arg = tmp;
3848 // }
3849 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3850 __ unaligned_move(arg, addr);
3851 } else {
3852 __ move(arg, addr);
3853 }
3854 }
3855 }
3856
3857 if (info) {
3858 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3859 } else {
3860 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3861 }
3862 if (result->is_valid()) {
3863 __ move(phys_reg, result);
3864 }
3865 return result;
3866 }
3867
3868
3869 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIRItemList* args,
3870 address entry, ValueType* result_type, CodeEmitInfo* info) {
3871 // get a result register
3872 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3873 LIR_Opr result = LIR_OprFact::illegalOpr;
3874 if (result_type->tag() != voidTag) {
3875 result = new_register(result_type);
3876 phys_reg = result_register_for(result_type);
3877 }
3878
3879 // move the arguments into the correct location
3880 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3881
3882 assert(cc->length() == args->length(), "argument mismatch");
3883 for (int i = 0; i < args->length(); i++) {
3884 LIRItem* arg = args->at(i);
3885 LIR_Opr loc = cc->at(i);
3886 if (loc->is_register()) {
3887 arg->load_item_force(loc);
3888 } else {
3889 LIR_Address* addr = loc->as_address_ptr();
3890 arg->load_for_store(addr->type());
3891 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3892 __ unaligned_move(arg->result(), addr);
3893 } else {
3894 __ move(arg->result(), addr);
3895 }
3896 }
3897 }
3898
3899 if (info) {
3900 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3901 } else {
3902 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3903 }
3904 if (result->is_valid()) {
3905 __ move(phys_reg, result);
3906 }
3907 return result;
3908 }
3909
3910 void LIRGenerator::do_MemBar(MemBar* x) {
3911 LIR_Code code = x->code();
3912 switch(code) {
3913 case lir_membar_acquire : __ membar_acquire(); break;
3914 case lir_membar_release : __ membar_release(); break;
3915 case lir_membar : __ membar(); break;
3916 case lir_membar_loadload : __ membar_loadload(); break;
3917 case lir_membar_storestore: __ membar_storestore(); break;
3918 case lir_membar_loadstore : __ membar_loadstore(); break;
3919 case lir_membar_storeload : __ membar_storeload(); break;
3920 default : ShouldNotReachHere(); break;
3921 }
3922 }
3923
3924 LIR_Opr LIRGenerator::mask_boolean(LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info) {
3925 LIR_Opr value_fixed = rlock_byte(T_BYTE);
3926 if (TwoOperandLIRForm) {
3927 __ move(value, value_fixed);
3928 __ logical_and(value_fixed, LIR_OprFact::intConst(1), value_fixed);
3929 } else {
3930 __ logical_and(value, LIR_OprFact::intConst(1), value_fixed);
3931 }
3932 LIR_Opr klass = new_register(T_METADATA);
3933 __ move(new LIR_Address(array, oopDesc::klass_offset_in_bytes(), T_ADDRESS), klass, null_check_info);
3934 null_check_info = NULL;
3935 LIR_Opr layout = new_register(T_INT);
3936 __ move(new LIR_Address(klass, in_bytes(Klass::layout_helper_offset()), T_INT), layout);
3937 int diffbit = Klass::layout_helper_boolean_diffbit();
3938 __ logical_and(layout, LIR_OprFact::intConst(diffbit), layout);
3939 __ cmp(lir_cond_notEqual, layout, LIR_OprFact::intConst(0));
3940 __ cmove(lir_cond_notEqual, value_fixed, value, value_fixed, T_BYTE);
3941 value = value_fixed;
3942 return value;
3943 }
3944
3945 LIR_Opr LIRGenerator::maybe_mask_boolean(StoreIndexed* x, LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info) {
3946 if (x->check_boolean()) {
3947 value = mask_boolean(array, value, null_check_info);
3948 }
3949 return value;
3950 }