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_objarray)
796 flags &= ~LIR_OpArrayCopy::src_objarray;
797 if (!dst_objarray)
798 flags &= ~LIR_OpArrayCopy::dst_objarray;
799
800 if (!x->arg_needs_null_check(0))
801 flags &= ~LIR_OpArrayCopy::src_null_check;
802 if (!x->arg_needs_null_check(2))
803 flags &= ~LIR_OpArrayCopy::dst_null_check;
804
805
806 if (expected_type != NULL) {
807 Value length_limit = NULL;
808
809 IfOp* ifop = length->as_IfOp();
810 if (ifop != NULL) {
811 // look for expressions like min(v, a.length) which ends up as
812 // x > y ? y : x or x >= y ? y : x
813 if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) &&
814 ifop->x() == ifop->fval() &&
815 ifop->y() == ifop->tval()) {
816 length_limit = ifop->y();
817 }
818 }
819
820 // try to skip null checks and range checks
821 NewArray* src_array = src->as_NewArray();
822 if (src_array != NULL) {
823 flags &= ~LIR_OpArrayCopy::src_null_check;
824 if (length_limit != NULL &&
825 src_array->length() == length_limit &&
826 is_constant_zero(src_pos)) {
827 flags &= ~LIR_OpArrayCopy::src_range_check;
828 }
829 }
830
831 NewArray* dst_array = dst->as_NewArray();
832 if (dst_array != NULL) {
833 flags &= ~LIR_OpArrayCopy::dst_null_check;
834 if (length_limit != NULL &&
835 dst_array->length() == length_limit &&
836 is_constant_zero(dst_pos)) {
837 flags &= ~LIR_OpArrayCopy::dst_range_check;
838 }
839 }
840
841 // check from incoming constant values
842 if (positive_constant(src_pos))
843 flags &= ~LIR_OpArrayCopy::src_pos_positive_check;
844 if (positive_constant(dst_pos))
845 flags &= ~LIR_OpArrayCopy::dst_pos_positive_check;
846 if (positive_constant(length))
847 flags &= ~LIR_OpArrayCopy::length_positive_check;
848
849 // see if the range check can be elided, which might also imply
850 // that src or dst is non-null.
851 ArrayLength* al = length->as_ArrayLength();
852 if (al != NULL) {
853 if (al->array() == src) {
854 // it's the length of the source array
855 flags &= ~LIR_OpArrayCopy::length_positive_check;
856 flags &= ~LIR_OpArrayCopy::src_null_check;
857 if (is_constant_zero(src_pos))
858 flags &= ~LIR_OpArrayCopy::src_range_check;
859 }
860 if (al->array() == dst) {
861 // it's the length of the destination array
862 flags &= ~LIR_OpArrayCopy::length_positive_check;
863 flags &= ~LIR_OpArrayCopy::dst_null_check;
864 if (is_constant_zero(dst_pos))
865 flags &= ~LIR_OpArrayCopy::dst_range_check;
866 }
867 }
868 if (is_exact) {
869 flags &= ~LIR_OpArrayCopy::type_check;
870 }
871 }
872
873 IntConstant* src_int = src_pos->type()->as_IntConstant();
874 IntConstant* dst_int = dst_pos->type()->as_IntConstant();
875 if (src_int && dst_int) {
876 int s_offs = src_int->value();
877 int d_offs = dst_int->value();
878 if (src_int->value() >= dst_int->value()) {
879 flags &= ~LIR_OpArrayCopy::overlapping;
880 }
881 if (expected_type != NULL) {
882 BasicType t = expected_type->element_type()->basic_type();
883 int element_size = type2aelembytes(t);
884 if (((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
885 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0)) {
886 flags &= ~LIR_OpArrayCopy::unaligned;
887 }
888 }
889 } else if (src_pos == dst_pos || is_constant_zero(dst_pos)) {
890 // src and dest positions are the same, or dst is zero so assume
891 // nonoverlapping copy.
892 flags &= ~LIR_OpArrayCopy::overlapping;
893 }
894
895 if (src == dst) {
896 // moving within a single array so no type checks are needed
897 if (flags & LIR_OpArrayCopy::type_check) {
898 flags &= ~LIR_OpArrayCopy::type_check;
899 }
900 }
901 *flagsp = flags;
902 *expected_typep = (ciArrayKlass*)expected_type;
903 }
904
905
906 LIR_Opr LIRGenerator::round_item(LIR_Opr opr) {
907 assert(opr->is_register(), "why spill if item is not register?");
908
909 if (RoundFPResults && UseSSE < 1 && opr->is_single_fpu()) {
910 LIR_Opr result = new_register(T_FLOAT);
911 set_vreg_flag(result, must_start_in_memory);
912 assert(opr->is_register(), "only a register can be spilled");
913 assert(opr->value_type()->is_float(), "rounding only for floats available");
914 __ roundfp(opr, LIR_OprFact::illegalOpr, result);
915 return result;
916 }
917 return opr;
918 }
919
920
921 LIR_Opr LIRGenerator::force_to_spill(LIR_Opr value, BasicType t) {
922 assert(type2size[t] == type2size[value->type()],
923 "size mismatch: t=%s, value->type()=%s", type2name(t), type2name(value->type()));
924 if (!value->is_register()) {
925 // force into a register
926 LIR_Opr r = new_register(value->type());
927 __ move(value, r);
928 value = r;
929 }
930
931 // create a spill location
932 LIR_Opr tmp = new_register(t);
933 set_vreg_flag(tmp, LIRGenerator::must_start_in_memory);
934
935 // move from register to spill
936 __ move(value, tmp);
937 return tmp;
938 }
939
940 void LIRGenerator::profile_branch(If* if_instr, If::Condition cond) {
941 if (if_instr->should_profile()) {
942 ciMethod* method = if_instr->profiled_method();
943 assert(method != NULL, "method should be set if branch is profiled");
944 ciMethodData* md = method->method_data_or_null();
945 assert(md != NULL, "Sanity");
946 ciProfileData* data = md->bci_to_data(if_instr->profiled_bci());
947 assert(data != NULL, "must have profiling data");
948 assert(data->is_BranchData(), "need BranchData for two-way branches");
949 int taken_count_offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
950 int not_taken_count_offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
951 if (if_instr->is_swapped()) {
952 int t = taken_count_offset;
953 taken_count_offset = not_taken_count_offset;
954 not_taken_count_offset = t;
955 }
956
957 LIR_Opr md_reg = new_register(T_METADATA);
958 __ metadata2reg(md->constant_encoding(), md_reg);
959
960 LIR_Opr data_offset_reg = new_pointer_register();
961 __ cmove(lir_cond(cond),
962 LIR_OprFact::intptrConst(taken_count_offset),
963 LIR_OprFact::intptrConst(not_taken_count_offset),
964 data_offset_reg, as_BasicType(if_instr->x()->type()));
965
966 // MDO cells are intptr_t, so the data_reg width is arch-dependent.
967 LIR_Opr data_reg = new_pointer_register();
968 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
969 __ move(data_addr, data_reg);
970 // Use leal instead of add to avoid destroying condition codes on x86
971 LIR_Address* fake_incr_value = new LIR_Address(data_reg, DataLayout::counter_increment, T_INT);
972 __ leal(LIR_OprFact::address(fake_incr_value), data_reg);
973 __ move(data_reg, data_addr);
974 }
975 }
976
977 // Phi technique:
978 // This is about passing live values from one basic block to the other.
979 // In code generated with Java it is rather rare that more than one
980 // value is on the stack from one basic block to the other.
981 // We optimize our technique for efficient passing of one value
982 // (of type long, int, double..) but it can be extended.
983 // When entering or leaving a basic block, all registers and all spill
984 // slots are release and empty. We use the released registers
985 // and spill slots to pass the live values from one block
986 // to the other. The topmost value, i.e., the value on TOS of expression
987 // stack is passed in registers. All other values are stored in spilling
988 // area. Every Phi has an index which designates its spill slot
989 // At exit of a basic block, we fill the register(s) and spill slots.
990 // At entry of a basic block, the block_prolog sets up the content of phi nodes
991 // and locks necessary registers and spilling slots.
992
993
994 // move current value to referenced phi function
995 void LIRGenerator::move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val) {
996 Phi* phi = sux_val->as_Phi();
997 // cur_val can be null without phi being null in conjunction with inlining
998 if (phi != NULL && cur_val != NULL && cur_val != phi && !phi->is_illegal()) {
999 Phi* cur_phi = cur_val->as_Phi();
1000 if (cur_phi != NULL && cur_phi->is_illegal()) {
1001 // Phi and local would need to get invalidated
1002 // (which is unexpected for Linear Scan).
1003 // But this case is very rare so we simply bail out.
1004 bailout("propagation of illegal phi");
1005 return;
1006 }
1007 LIR_Opr operand = cur_val->operand();
1008 if (operand->is_illegal()) {
1009 assert(cur_val->as_Constant() != NULL || cur_val->as_Local() != NULL,
1010 "these can be produced lazily");
1011 operand = operand_for_instruction(cur_val);
1012 }
1013 resolver->move(operand, operand_for_instruction(phi));
1014 }
1015 }
1016
1017
1018 // Moves all stack values into their PHI position
1019 void LIRGenerator::move_to_phi(ValueStack* cur_state) {
1020 BlockBegin* bb = block();
1021 if (bb->number_of_sux() == 1) {
1022 BlockBegin* sux = bb->sux_at(0);
1023 assert(sux->number_of_preds() > 0, "invalid CFG");
1024
1025 // a block with only one predecessor never has phi functions
1026 if (sux->number_of_preds() > 1) {
1027 int max_phis = cur_state->stack_size() + cur_state->locals_size();
1028 PhiResolver resolver(this, _virtual_register_number + max_phis * 2);
1029
1030 ValueStack* sux_state = sux->state();
1031 Value sux_value;
1032 int index;
1033
1034 assert(cur_state->scope() == sux_state->scope(), "not matching");
1035 assert(cur_state->locals_size() == sux_state->locals_size(), "not matching");
1036 assert(cur_state->stack_size() == sux_state->stack_size(), "not matching");
1037
1038 for_each_stack_value(sux_state, index, sux_value) {
1039 move_to_phi(&resolver, cur_state->stack_at(index), sux_value);
1040 }
1041
1042 for_each_local_value(sux_state, index, sux_value) {
1043 move_to_phi(&resolver, cur_state->local_at(index), sux_value);
1044 }
1045
1046 assert(cur_state->caller_state() == sux_state->caller_state(), "caller states must be equal");
1047 }
1048 }
1049 }
1050
1051
1052 LIR_Opr LIRGenerator::new_register(BasicType type) {
1053 int vreg = _virtual_register_number;
1054 // add a little fudge factor for the bailout, since the bailout is
1055 // only checked periodically. This gives a few extra registers to
1056 // hand out before we really run out, which helps us keep from
1057 // tripping over assertions.
1058 if (vreg + 20 >= LIR_OprDesc::vreg_max) {
1059 bailout("out of virtual registers");
1060 if (vreg + 2 >= LIR_OprDesc::vreg_max) {
1061 // wrap it around
1062 _virtual_register_number = LIR_OprDesc::vreg_base;
1063 }
1064 }
1065 _virtual_register_number += 1;
1066 return LIR_OprFact::virtual_register(vreg, type);
1067 }
1068
1069
1070 // Try to lock using register in hint
1071 LIR_Opr LIRGenerator::rlock(Value instr) {
1072 return new_register(instr->type());
1073 }
1074
1075
1076 // does an rlock and sets result
1077 LIR_Opr LIRGenerator::rlock_result(Value x) {
1078 LIR_Opr reg = rlock(x);
1079 set_result(x, reg);
1080 return reg;
1081 }
1082
1083
1084 // does an rlock and sets result
1085 LIR_Opr LIRGenerator::rlock_result(Value x, BasicType type) {
1086 LIR_Opr reg;
1087 switch (type) {
1088 case T_BYTE:
1089 case T_BOOLEAN:
1090 reg = rlock_byte(type);
1091 break;
1092 default:
1093 reg = rlock(x);
1094 break;
1095 }
1096
1097 set_result(x, reg);
1098 return reg;
1099 }
1100
1101
1102 //---------------------------------------------------------------------
1103 ciObject* LIRGenerator::get_jobject_constant(Value value) {
1104 ObjectType* oc = value->type()->as_ObjectType();
1105 if (oc) {
1106 return oc->constant_value();
1107 }
1108 return NULL;
1109 }
1110
1111
1112 void LIRGenerator::do_ExceptionObject(ExceptionObject* x) {
1113 assert(block()->is_set(BlockBegin::exception_entry_flag), "ExceptionObject only allowed in exception handler block");
1114 assert(block()->next() == x, "ExceptionObject must be first instruction of block");
1115
1116 // no moves are created for phi functions at the begin of exception
1117 // handlers, so assign operands manually here
1118 for_each_phi_fun(block(), phi,
1119 if (!phi->is_illegal()) { operand_for_instruction(phi); });
1120
1121 LIR_Opr thread_reg = getThreadPointer();
1122 __ move_wide(new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT),
1123 exceptionOopOpr());
1124 __ move_wide(LIR_OprFact::oopConst(NULL),
1125 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT));
1126 __ move_wide(LIR_OprFact::oopConst(NULL),
1127 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_pc_offset()), T_OBJECT));
1128
1129 LIR_Opr result = new_register(T_OBJECT);
1130 __ move(exceptionOopOpr(), result);
1131 set_result(x, result);
1132 }
1133
1134
1135 //----------------------------------------------------------------------
1136 //----------------------------------------------------------------------
1137 //----------------------------------------------------------------------
1138 //----------------------------------------------------------------------
1139 // visitor functions
1140 //----------------------------------------------------------------------
1141 //----------------------------------------------------------------------
1142 //----------------------------------------------------------------------
1143 //----------------------------------------------------------------------
1144
1145 void LIRGenerator::do_Phi(Phi* x) {
1146 // phi functions are never visited directly
1147 ShouldNotReachHere();
1148 }
1149
1150
1151 // Code for a constant is generated lazily unless the constant is frequently used and can't be inlined.
1152 void LIRGenerator::do_Constant(Constant* x) {
1153 if (x->state_before() != NULL) {
1154 // Any constant with a ValueStack requires patching so emit the patch here
1155 LIR_Opr reg = rlock_result(x);
1156 CodeEmitInfo* info = state_for(x, x->state_before());
1157 __ oop2reg_patch(NULL, reg, info);
1158 } else if (x->use_count() > 1 && !can_inline_as_constant(x)) {
1159 if (!x->is_pinned()) {
1160 // unpinned constants are handled specially so that they can be
1161 // put into registers when they are used multiple times within a
1162 // block. After the block completes their operand will be
1163 // cleared so that other blocks can't refer to that register.
1164 set_result(x, load_constant(x));
1165 } else {
1166 LIR_Opr res = x->operand();
1167 if (!res->is_valid()) {
1168 res = LIR_OprFact::value_type(x->type());
1169 }
1170 if (res->is_constant()) {
1171 LIR_Opr reg = rlock_result(x);
1172 __ move(res, reg);
1173 } else {
1174 set_result(x, res);
1175 }
1176 }
1177 } else {
1178 set_result(x, LIR_OprFact::value_type(x->type()));
1179 }
1180 }
1181
1182
1183 void LIRGenerator::do_Local(Local* x) {
1184 // operand_for_instruction has the side effect of setting the result
1185 // so there's no need to do it here.
1186 operand_for_instruction(x);
1187 }
1188
1189
1190 void LIRGenerator::do_IfInstanceOf(IfInstanceOf* x) {
1191 Unimplemented();
1192 }
1193
1194
1195 void LIRGenerator::do_Return(Return* x) {
1196 if (compilation()->env()->dtrace_method_probes()) {
1197 BasicTypeList signature;
1198 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
1199 signature.append(T_METADATA); // Method*
1200 LIR_OprList* args = new LIR_OprList();
1201 args->append(getThreadPointer());
1202 LIR_Opr meth = new_register(T_METADATA);
1203 __ metadata2reg(method()->constant_encoding(), meth);
1204 args->append(meth);
1205 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), voidType, NULL);
1206 }
1207
1208 if (x->type()->is_void()) {
1209 __ return_op(LIR_OprFact::illegalOpr);
1210 } else {
1211 LIR_Opr reg = result_register_for(x->type(), /*callee=*/true);
1212 LIRItem result(x->result(), this);
1213
1214 result.load_item_force(reg);
1215 __ return_op(result.result());
1216 }
1217 set_no_result(x);
1218 }
1219
1220 // Examble: ref.get()
1221 // Combination of LoadField and g1 pre-write barrier
1222 void LIRGenerator::do_Reference_get(Intrinsic* x) {
1223
1224 const int referent_offset = java_lang_ref_Reference::referent_offset;
1225 guarantee(referent_offset > 0, "referent offset not initialized");
1226
1227 assert(x->number_of_arguments() == 1, "wrong type");
1228
1229 LIRItem reference(x->argument_at(0), this);
1230 reference.load_item();
1231
1232 // need to perform the null check on the reference objecy
1233 CodeEmitInfo* info = NULL;
1234 if (x->needs_null_check()) {
1235 info = state_for(x);
1236 }
1237
1238 LIR_Opr result = rlock_result(x, T_OBJECT);
1239 access_load_at(IN_HEAP | ON_WEAK_OOP_REF, T_OBJECT,
1240 reference, LIR_OprFact::intConst(referent_offset), result);
1241 }
1242
1243 // Example: clazz.isInstance(object)
1244 void LIRGenerator::do_isInstance(Intrinsic* x) {
1245 assert(x->number_of_arguments() == 2, "wrong type");
1246
1247 // TODO could try to substitute this node with an equivalent InstanceOf
1248 // if clazz is known to be a constant Class. This will pick up newly found
1249 // constants after HIR construction. I'll leave this to a future change.
1250
1251 // as a first cut, make a simple leaf call to runtime to stay platform independent.
1252 // could follow the aastore example in a future change.
1253
1254 LIRItem clazz(x->argument_at(0), this);
1255 LIRItem object(x->argument_at(1), this);
1256 clazz.load_item();
1257 object.load_item();
1258 LIR_Opr result = rlock_result(x);
1259
1260 // need to perform null check on clazz
1261 if (x->needs_null_check()) {
1262 CodeEmitInfo* info = state_for(x);
1263 __ null_check(clazz.result(), info);
1264 }
1265
1266 LIR_Opr call_result = call_runtime(clazz.value(), object.value(),
1267 CAST_FROM_FN_PTR(address, Runtime1::is_instance_of),
1268 x->type(),
1269 NULL); // NULL CodeEmitInfo results in a leaf call
1270 __ move(call_result, result);
1271 }
1272
1273 // Example: object.getClass ()
1274 void LIRGenerator::do_getClass(Intrinsic* x) {
1275 assert(x->number_of_arguments() == 1, "wrong type");
1276
1277 LIRItem rcvr(x->argument_at(0), this);
1278 rcvr.load_item();
1279 LIR_Opr temp = new_register(T_METADATA);
1280 LIR_Opr result = rlock_result(x);
1281
1282 // need to perform the null check on the rcvr
1283 CodeEmitInfo* info = NULL;
1284 if (x->needs_null_check()) {
1285 info = state_for(x);
1286 }
1287
1288 // FIXME T_ADDRESS should actually be T_METADATA but it can't because the
1289 // meaning of these two is mixed up (see JDK-8026837).
1290 __ move(new LIR_Address(rcvr.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), temp, info);
1291 __ move_wide(new LIR_Address(temp, in_bytes(Klass::java_mirror_offset()), T_ADDRESS), temp);
1292 // mirror = ((OopHandle)mirror)->resolve();
1293 access_load(IN_NATIVE, T_OBJECT,
1294 LIR_OprFact::address(new LIR_Address(temp, T_OBJECT)), result);
1295 }
1296
1297 // java.lang.Class::isPrimitive()
1298 void LIRGenerator::do_isPrimitive(Intrinsic* x) {
1299 assert(x->number_of_arguments() == 1, "wrong type");
1300
1301 LIRItem rcvr(x->argument_at(0), this);
1302 rcvr.load_item();
1303 LIR_Opr temp = new_register(T_METADATA);
1304 LIR_Opr result = rlock_result(x);
1305
1306 CodeEmitInfo* info = NULL;
1307 if (x->needs_null_check()) {
1308 info = state_for(x);
1309 }
1310
1311 __ move(new LIR_Address(rcvr.result(), java_lang_Class::klass_offset_in_bytes(), T_ADDRESS), temp, info);
1312 __ cmp(lir_cond_notEqual, temp, LIR_OprFact::intConst(0));
1313 __ cmove(lir_cond_notEqual, LIR_OprFact::intConst(0), LIR_OprFact::intConst(1), result, T_BOOLEAN);
1314 }
1315
1316
1317 // Example: Thread.currentThread()
1318 void LIRGenerator::do_currentThread(Intrinsic* x) {
1319 assert(x->number_of_arguments() == 0, "wrong type");
1320 LIR_Opr reg = rlock_result(x);
1321 __ move_wide(new LIR_Address(getThreadPointer(), in_bytes(JavaThread::threadObj_offset()), T_OBJECT), reg);
1322 }
1323
1324
1325 void LIRGenerator::do_RegisterFinalizer(Intrinsic* x) {
1326 assert(x->number_of_arguments() == 1, "wrong type");
1327 LIRItem receiver(x->argument_at(0), this);
1328
1329 receiver.load_item();
1330 BasicTypeList signature;
1331 signature.append(T_OBJECT); // receiver
1332 LIR_OprList* args = new LIR_OprList();
1333 args->append(receiver.result());
1334 CodeEmitInfo* info = state_for(x, x->state());
1335 call_runtime(&signature, args,
1336 CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::register_finalizer_id)),
1337 voidType, info);
1338
1339 set_no_result(x);
1340 }
1341
1342
1343 //------------------------local access--------------------------------------
1344
1345 LIR_Opr LIRGenerator::operand_for_instruction(Instruction* x) {
1346 if (x->operand()->is_illegal()) {
1347 Constant* c = x->as_Constant();
1348 if (c != NULL) {
1349 x->set_operand(LIR_OprFact::value_type(c->type()));
1350 } else {
1351 assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local");
1352 // allocate a virtual register for this local or phi
1353 x->set_operand(rlock(x));
1354 _instruction_for_operand.at_put_grow(x->operand()->vreg_number(), x, NULL);
1355 }
1356 }
1357 return x->operand();
1358 }
1359
1360
1361 Instruction* LIRGenerator::instruction_for_opr(LIR_Opr opr) {
1362 if (opr->is_virtual()) {
1363 return instruction_for_vreg(opr->vreg_number());
1364 }
1365 return NULL;
1366 }
1367
1368
1369 Instruction* LIRGenerator::instruction_for_vreg(int reg_num) {
1370 if (reg_num < _instruction_for_operand.length()) {
1371 return _instruction_for_operand.at(reg_num);
1372 }
1373 return NULL;
1374 }
1375
1376
1377 void LIRGenerator::set_vreg_flag(int vreg_num, VregFlag f) {
1378 if (_vreg_flags.size_in_bits() == 0) {
1379 BitMap2D temp(100, num_vreg_flags);
1380 _vreg_flags = temp;
1381 }
1382 _vreg_flags.at_put_grow(vreg_num, f, true);
1383 }
1384
1385 bool LIRGenerator::is_vreg_flag_set(int vreg_num, VregFlag f) {
1386 if (!_vreg_flags.is_valid_index(vreg_num, f)) {
1387 return false;
1388 }
1389 return _vreg_flags.at(vreg_num, f);
1390 }
1391
1392
1393 // Block local constant handling. This code is useful for keeping
1394 // unpinned constants and constants which aren't exposed in the IR in
1395 // registers. Unpinned Constant instructions have their operands
1396 // cleared when the block is finished so that other blocks can't end
1397 // up referring to their registers.
1398
1399 LIR_Opr LIRGenerator::load_constant(Constant* x) {
1400 assert(!x->is_pinned(), "only for unpinned constants");
1401 _unpinned_constants.append(x);
1402 return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr());
1403 }
1404
1405
1406 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) {
1407 BasicType t = c->type();
1408 for (int i = 0; i < _constants.length(); i++) {
1409 LIR_Const* other = _constants.at(i);
1410 if (t == other->type()) {
1411 switch (t) {
1412 case T_INT:
1413 case T_FLOAT:
1414 if (c->as_jint_bits() != other->as_jint_bits()) continue;
1415 break;
1416 case T_LONG:
1417 case T_DOUBLE:
1418 if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue;
1419 if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue;
1420 break;
1421 case T_OBJECT:
1422 if (c->as_jobject() != other->as_jobject()) continue;
1423 break;
1424 default:
1425 break;
1426 }
1427 return _reg_for_constants.at(i);
1428 }
1429 }
1430
1431 LIR_Opr result = new_register(t);
1432 __ move((LIR_Opr)c, result);
1433 _constants.append(c);
1434 _reg_for_constants.append(result);
1435 return result;
1436 }
1437
1438 //------------------------field access--------------------------------------
1439
1440 void LIRGenerator::do_CompareAndSwap(Intrinsic* x, ValueType* type) {
1441 assert(x->number_of_arguments() == 4, "wrong type");
1442 LIRItem obj (x->argument_at(0), this); // object
1443 LIRItem offset(x->argument_at(1), this); // offset of field
1444 LIRItem cmp (x->argument_at(2), this); // value to compare with field
1445 LIRItem val (x->argument_at(3), this); // replace field with val if matches cmp
1446 assert(obj.type()->tag() == objectTag, "invalid type");
1447
1448 // In 64bit the type can be long, sparc doesn't have this assert
1449 // assert(offset.type()->tag() == intTag, "invalid type");
1450
1451 assert(cmp.type()->tag() == type->tag(), "invalid type");
1452 assert(val.type()->tag() == type->tag(), "invalid type");
1453
1454 LIR_Opr result = access_atomic_cmpxchg_at(IN_HEAP, as_BasicType(type),
1455 obj, offset, cmp, val);
1456 set_result(x, result);
1457 }
1458
1459 // Comment copied form templateTable_i486.cpp
1460 // ----------------------------------------------------------------------------
1461 // Volatile variables demand their effects be made known to all CPU's in
1462 // order. Store buffers on most chips allow reads & writes to reorder; the
1463 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1464 // memory barrier (i.e., it's not sufficient that the interpreter does not
1465 // reorder volatile references, the hardware also must not reorder them).
1466 //
1467 // According to the new Java Memory Model (JMM):
1468 // (1) All volatiles are serialized wrt to each other.
1469 // ALSO reads & writes act as aquire & release, so:
1470 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1471 // the read float up to before the read. It's OK for non-volatile memory refs
1472 // that happen before the volatile read to float down below it.
1473 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1474 // that happen BEFORE the write float down to after the write. It's OK for
1475 // non-volatile memory refs that happen after the volatile write to float up
1476 // before it.
1477 //
1478 // We only put in barriers around volatile refs (they are expensive), not
1479 // _between_ memory refs (that would require us to track the flavor of the
1480 // previous memory refs). Requirements (2) and (3) require some barriers
1481 // before volatile stores and after volatile loads. These nearly cover
1482 // requirement (1) but miss the volatile-store-volatile-load case. This final
1483 // case is placed after volatile-stores although it could just as well go
1484 // before volatile-loads.
1485
1486
1487 void LIRGenerator::do_StoreField(StoreField* x) {
1488 bool needs_patching = x->needs_patching();
1489 bool is_volatile = x->field()->is_volatile();
1490 BasicType field_type = x->field_type();
1491
1492 CodeEmitInfo* info = NULL;
1493 if (needs_patching) {
1494 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1495 info = state_for(x, x->state_before());
1496 } else if (x->needs_null_check()) {
1497 NullCheck* nc = x->explicit_null_check();
1498 if (nc == NULL) {
1499 info = state_for(x);
1500 } else {
1501 info = state_for(nc);
1502 }
1503 }
1504
1505 LIRItem object(x->obj(), this);
1506 LIRItem value(x->value(), this);
1507
1508 object.load_item();
1509
1510 if (is_volatile || needs_patching) {
1511 // load item if field is volatile (fewer special cases for volatiles)
1512 // load item if field not initialized
1513 // load item if field not constant
1514 // because of code patching we cannot inline constants
1515 if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1516 value.load_byte_item();
1517 } else {
1518 value.load_item();
1519 }
1520 } else {
1521 value.load_for_store(field_type);
1522 }
1523
1524 set_no_result(x);
1525
1526 #ifndef PRODUCT
1527 if (PrintNotLoaded && needs_patching) {
1528 tty->print_cr(" ###class not loaded at store_%s bci %d",
1529 x->is_static() ? "static" : "field", x->printable_bci());
1530 }
1531 #endif
1532
1533 if (x->needs_null_check() &&
1534 (needs_patching ||
1535 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1536 if (needs_patching && field_type == T_VALUETYPE) {
1537 // We are storing a "Q" field, but the holder class is not yet loaded.
1538 CodeStub* stub = new DeoptimizeStub(new CodeEmitInfo(info),
1539 Deoptimization::Reason_unloaded,
1540 Deoptimization::Action_make_not_entrant);
1541 __ branch(lir_cond_always, T_ILLEGAL, stub);
1542 } else {
1543 // Emit an explicit null check because the offset is too large.
1544 // If the class is not loaded and the object is NULL, we need to deoptimize to throw a
1545 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1546 __ null_check(object.result(), new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1547 }
1548 }
1549
1550 DecoratorSet decorators = IN_HEAP;
1551 if (is_volatile) {
1552 decorators |= MO_SEQ_CST;
1553 }
1554 if (needs_patching) {
1555 decorators |= C1_NEEDS_PATCHING;
1556 }
1557
1558 access_store_at(decorators, field_type, object, LIR_OprFact::intConst(x->offset()),
1559 value.result(), info != NULL ? new CodeEmitInfo(info) : NULL, info);
1560 }
1561
1562 // FIXME -- I can't find any other way to pass an address to access_load_at().
1563 class TempResolvedAddress: public Instruction {
1564 public:
1565 TempResolvedAddress(ValueType* type, LIR_Opr addr) : Instruction(type) {
1566 set_operand(addr);
1567 }
1568 virtual void input_values_do(ValueVisitor*) {}
1569 virtual void visit(InstructionVisitor* v) {}
1570 virtual const char* name() const { return "TempResolvedAddress"; }
1571 };
1572
1573 void LIRGenerator::access_flattened_array(bool is_load, LIRItem& array, LIRItem& index, LIRItem& obj_item) {
1574 // Find the starting address of the source (inside the array)
1575 ciType* array_type = array.value()->declared_type();
1576 ciValueArrayKlass* value_array_klass = array_type->as_value_array_klass();
1577 assert(value_array_klass->is_loaded(), "must be");
1578
1579 ciValueKlass* elem_klass = value_array_klass->element_klass()->as_value_klass();
1580 int array_header_size = value_array_klass->array_header_in_bytes();
1581 int shift = value_array_klass->log2_element_size();
1582
1583 #ifndef _LP64
1584 LIR_Opr index_op = new_register(T_INT);
1585 // FIXME -- on 32-bit, the shift below can overflow, so we need to check that
1586 // the top (shift+1) bits of index_op must be zero, or
1587 // else throw ArrayIndexOutOfBoundsException
1588 if (index.result()->is_constant()) {
1589 jint const_index = index.result()->as_jint();
1590 __ move(LIR_OprFact::intConst(const_index << shift), index_op);
1591 } else {
1592 __ shift_left(index_op, shift, index.result());
1593 }
1594 #else
1595 LIR_Opr index_op = new_register(T_LONG);
1596 if (index.result()->is_constant()) {
1597 jint const_index = index.result()->as_jint();
1598 __ move(LIR_OprFact::longConst(const_index << shift), index_op);
1599 } else {
1600 __ convert(Bytecodes::_i2l, index.result(), index_op);
1601 // Need to shift manually, as LIR_Address can scale only up to 3.
1602 __ shift_left(index_op, shift, index_op);
1603 }
1604 #endif
1605
1606 LIR_Opr elm_op = new_pointer_register();
1607 LIR_Address* elm_address = new LIR_Address(array.result(), index_op, array_header_size, T_ADDRESS);
1608 __ leal(LIR_OprFact::address(elm_address), elm_op);
1609
1610 for (int i = 0; i < elem_klass->nof_nonstatic_fields(); i++) {
1611 ciField* inner_field = elem_klass->nonstatic_field_at(i);
1612 assert(!inner_field->is_flattened(), "flattened fields must have been expanded");
1613 int obj_offset = inner_field->offset();
1614 int elm_offset = obj_offset - elem_klass->first_field_offset(); // object header is not stored in array.
1615
1616 BasicType field_type = inner_field->type()->basic_type();
1617 switch (field_type) {
1618 case T_BYTE:
1619 case T_BOOLEAN:
1620 case T_SHORT:
1621 case T_CHAR:
1622 field_type = T_INT;
1623 break;
1624 default:
1625 break;
1626 }
1627
1628 LIR_Opr temp = new_register(field_type);
1629 TempResolvedAddress* elm_resolved_addr = new TempResolvedAddress(as_ValueType(field_type), elm_op);
1630 LIRItem elm_item(elm_resolved_addr, this);
1631
1632 DecoratorSet decorators = IN_HEAP;
1633 if (is_load) {
1634 access_load_at(decorators, field_type,
1635 elm_item, LIR_OprFact::intConst(elm_offset), temp,
1636 NULL, NULL);
1637 access_store_at(decorators, field_type,
1638 obj_item, LIR_OprFact::intConst(obj_offset), temp,
1639 NULL, NULL);
1640 } else {
1641 access_load_at(decorators, field_type,
1642 obj_item, LIR_OprFact::intConst(obj_offset), temp,
1643 NULL, NULL);
1644 access_store_at(decorators, field_type,
1645 elm_item, LIR_OprFact::intConst(elm_offset), temp,
1646 NULL, NULL);
1647 }
1648 }
1649 }
1650
1651 bool LIRGenerator::needs_flattened_array_check(Value array, Value value) {
1652 if (array->maybe_flattened_array()) {
1653 return true;
1654 }
1655 if (array->as_Phi() != NULL && value->type()->is_object()) {
1656 // Type info gets lost during Phi merging, but we might be storing into a
1657 // flattened array, so we'd better check.
1658 return true;
1659 }
1660 return false;
1661 }
1662
1663 void LIRGenerator::check_flattened_array(LIRItem& array, CodeStub* slow_path) {
1664 LIR_Opr array_klass_reg = new_register(T_METADATA);
1665
1666 __ move(new LIR_Address(array.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), array_klass_reg);
1667 LIR_Opr layout = new_register(T_INT);
1668 __ move(new LIR_Address(array_klass_reg, in_bytes(Klass::layout_helper_offset()), T_INT), layout);
1669 __ shift_right(layout, Klass::_lh_array_tag_shift, layout);
1670 __ cmp(lir_cond_equal, layout, LIR_OprFact::intConst(Klass::_lh_array_tag_vt_value));
1671 __ branch(lir_cond_equal, T_ILLEGAL, slow_path);
1672 }
1673
1674 void LIRGenerator::do_StoreIndexed(StoreIndexed* x) {
1675 assert(x->is_pinned(),"");
1676 bool is_loaded_flattened_array = x->array()->is_loaded_flattened_array();
1677 bool needs_range_check = x->compute_needs_range_check();
1678 bool use_length = x->length() != NULL;
1679 bool obj_store = x->elt_type() == T_ARRAY || x->elt_type() == T_OBJECT;
1680 bool needs_store_check = obj_store && !is_loaded_flattened_array &&
1681 (x->value()->as_Constant() == NULL ||
1682 !get_jobject_constant(x->value())->is_null_object() ||
1683 x->should_profile());
1684
1685 LIRItem array(x->array(), this);
1686 LIRItem index(x->index(), this);
1687 LIRItem value(x->value(), this);
1688 LIRItem length(this);
1689
1690 array.load_item();
1691 index.load_nonconstant();
1692
1693 if (use_length && needs_range_check) {
1694 length.set_instruction(x->length());
1695 length.load_item();
1696 }
1697
1698 if (needs_store_check || x->check_boolean()
1699 || is_loaded_flattened_array || needs_flattened_array_check(x->array(), x->value())) {
1700 value.load_item();
1701 } else {
1702 value.load_for_store(x->elt_type());
1703 }
1704
1705 set_no_result(x);
1706
1707 // the CodeEmitInfo must be duplicated for each different
1708 // LIR-instruction because spilling can occur anywhere between two
1709 // instructions and so the debug information must be different
1710 CodeEmitInfo* range_check_info = state_for(x);
1711 CodeEmitInfo* null_check_info = NULL;
1712 if (x->needs_null_check()) {
1713 null_check_info = new CodeEmitInfo(range_check_info);
1714 }
1715
1716 if (GenerateRangeChecks && needs_range_check) {
1717 if (use_length) {
1718 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1719 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result(), array.result()));
1720 } else {
1721 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1722 // range_check also does the null check
1723 null_check_info = NULL;
1724 }
1725 }
1726
1727 if (GenerateArrayStoreCheck && needs_store_check) {
1728 CodeEmitInfo* store_check_info = new CodeEmitInfo(range_check_info);
1729 array_store_check(value.result(), array.result(), store_check_info, x->profiled_method(), x->profiled_bci());
1730 }
1731
1732 if (is_loaded_flattened_array) {
1733 if (!x->is_exact_flattened_array_store()) {
1734 CodeEmitInfo* info = new CodeEmitInfo(range_check_info);
1735 ciKlass* element_klass = x->array()->declared_type()->as_value_array_klass()->element_klass();
1736 flattened_array_store_check(value.result(), element_klass, info);
1737 } else if (!x->value()->is_never_null()) {
1738 __ null_check(value.result(), new CodeEmitInfo(range_check_info));
1739 }
1740 access_flattened_array(false, array, index, value);
1741 } else {
1742 StoreFlattenedArrayStub* slow_path = NULL;
1743
1744 if (needs_flattened_array_check(x->array(), x->value())) {
1745 // Check if we indeed have a flattened array
1746 index.load_item();
1747 slow_path = new StoreFlattenedArrayStub(array.result(), index.result(), value.result(), state_for(x));
1748 check_flattened_array(array, slow_path);
1749 }
1750
1751 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
1752 if (x->check_boolean()) {
1753 decorators |= C1_MASK_BOOLEAN;
1754 }
1755
1756 access_store_at(decorators, x->elt_type(), array, index.result(), value.result(),
1757 NULL, null_check_info);
1758 if (slow_path != NULL) {
1759 __ branch_destination(slow_path->continuation());
1760 }
1761 }
1762 }
1763
1764 void LIRGenerator::access_load_at(DecoratorSet decorators, BasicType type,
1765 LIRItem& base, LIR_Opr offset, LIR_Opr result,
1766 CodeEmitInfo* patch_info, CodeEmitInfo* load_emit_info) {
1767 decorators |= ACCESS_READ;
1768 LIRAccess access(this, decorators, base, offset, type, patch_info, load_emit_info);
1769 if (access.is_raw()) {
1770 _barrier_set->BarrierSetC1::load_at(access, result);
1771 } else {
1772 _barrier_set->load_at(access, result);
1773 }
1774 }
1775
1776 void LIRGenerator::access_load(DecoratorSet decorators, BasicType type,
1777 LIR_Opr addr, LIR_Opr result) {
1778 decorators |= ACCESS_READ;
1779 LIRAccess access(this, decorators, LIR_OprFact::illegalOpr, LIR_OprFact::illegalOpr, type);
1780 access.set_resolved_addr(addr);
1781 if (access.is_raw()) {
1782 _barrier_set->BarrierSetC1::load(access, result);
1783 } else {
1784 _barrier_set->load(access, result);
1785 }
1786 }
1787
1788 void LIRGenerator::access_store_at(DecoratorSet decorators, BasicType type,
1789 LIRItem& base, LIR_Opr offset, LIR_Opr value,
1790 CodeEmitInfo* patch_info, CodeEmitInfo* store_emit_info) {
1791 decorators |= ACCESS_WRITE;
1792 LIRAccess access(this, decorators, base, offset, type, patch_info, store_emit_info);
1793 if (access.is_raw()) {
1794 _barrier_set->BarrierSetC1::store_at(access, value);
1795 } else {
1796 _barrier_set->store_at(access, value);
1797 }
1798 }
1799
1800 LIR_Opr LIRGenerator::access_atomic_cmpxchg_at(DecoratorSet decorators, BasicType type,
1801 LIRItem& base, LIRItem& offset, LIRItem& cmp_value, LIRItem& new_value) {
1802 decorators |= ACCESS_READ;
1803 decorators |= ACCESS_WRITE;
1804 // Atomic operations are SEQ_CST by default
1805 decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1806 LIRAccess access(this, decorators, base, offset, type);
1807 if (access.is_raw()) {
1808 return _barrier_set->BarrierSetC1::atomic_cmpxchg_at(access, cmp_value, new_value);
1809 } else {
1810 return _barrier_set->atomic_cmpxchg_at(access, cmp_value, new_value);
1811 }
1812 }
1813
1814 LIR_Opr LIRGenerator::access_atomic_xchg_at(DecoratorSet decorators, BasicType type,
1815 LIRItem& base, LIRItem& offset, LIRItem& value) {
1816 decorators |= ACCESS_READ;
1817 decorators |= ACCESS_WRITE;
1818 // Atomic operations are SEQ_CST by default
1819 decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1820 LIRAccess access(this, decorators, base, offset, type);
1821 if (access.is_raw()) {
1822 return _barrier_set->BarrierSetC1::atomic_xchg_at(access, value);
1823 } else {
1824 return _barrier_set->atomic_xchg_at(access, value);
1825 }
1826 }
1827
1828 LIR_Opr LIRGenerator::access_atomic_add_at(DecoratorSet decorators, BasicType type,
1829 LIRItem& base, LIRItem& offset, LIRItem& value) {
1830 decorators |= ACCESS_READ;
1831 decorators |= ACCESS_WRITE;
1832 // Atomic operations are SEQ_CST by default
1833 decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1834 LIRAccess access(this, decorators, base, offset, type);
1835 if (access.is_raw()) {
1836 return _barrier_set->BarrierSetC1::atomic_add_at(access, value);
1837 } else {
1838 return _barrier_set->atomic_add_at(access, value);
1839 }
1840 }
1841
1842 LIR_Opr LIRGenerator::access_resolve(DecoratorSet decorators, LIR_Opr obj) {
1843 // Use stronger ACCESS_WRITE|ACCESS_READ by default.
1844 if ((decorators & (ACCESS_READ | ACCESS_WRITE)) == 0) {
1845 decorators |= ACCESS_READ | ACCESS_WRITE;
1846 }
1847
1848 return _barrier_set->resolve(this, decorators, obj);
1849 }
1850
1851 void LIRGenerator::do_LoadField(LoadField* x) {
1852 bool needs_patching = x->needs_patching();
1853 bool is_volatile = x->field()->is_volatile();
1854 BasicType field_type = x->field_type();
1855
1856 CodeEmitInfo* info = NULL;
1857 if (needs_patching) {
1858 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1859 info = state_for(x, x->state_before());
1860 } else if (x->needs_null_check()) {
1861 NullCheck* nc = x->explicit_null_check();
1862 if (nc == NULL) {
1863 info = state_for(x);
1864 } else {
1865 info = state_for(nc);
1866 }
1867 }
1868
1869 LIRItem object(x->obj(), this);
1870
1871 object.load_item();
1872
1873 #ifndef PRODUCT
1874 if (PrintNotLoaded && needs_patching) {
1875 tty->print_cr(" ###class not loaded at load_%s bci %d",
1876 x->is_static() ? "static" : "field", x->printable_bci());
1877 }
1878 #endif
1879
1880 bool stress_deopt = StressLoopInvariantCodeMotion && info && info->deoptimize_on_exception();
1881 if (x->needs_null_check() &&
1882 (needs_patching ||
1883 MacroAssembler::needs_explicit_null_check(x->offset()) ||
1884 stress_deopt)) {
1885 if (needs_patching && field_type == T_VALUETYPE) {
1886 // We are loading a "Q" field, but the holder class is not yet loaded.
1887 CodeStub* stub = new DeoptimizeStub(new CodeEmitInfo(info),
1888 Deoptimization::Reason_unloaded,
1889 Deoptimization::Action_make_not_entrant);
1890 __ branch(lir_cond_always, T_ILLEGAL, stub);
1891 } else {
1892 LIR_Opr obj = object.result();
1893 if (stress_deopt) {
1894 obj = new_register(T_OBJECT);
1895 __ move(LIR_OprFact::oopConst(NULL), obj);
1896 }
1897 // Emit an explicit null check because the offset is too large.
1898 // If the class is not loaded and the object is NULL, we need to deoptimize to throw a
1899 // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1900 __ null_check(obj, new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1901 }
1902 } else if (x->value_klass() != NULL && x->default_value() == NULL) {
1903 assert(x->is_static() && !x->value_klass()->is_loaded(), "must be");
1904 assert(needs_patching, "must be");
1905 // The value klass was not loaded so we don't know what its default value should be
1906 CodeStub* stub = new DeoptimizeStub(new CodeEmitInfo(info),
1907 Deoptimization::Reason_unloaded,
1908 Deoptimization::Action_make_not_entrant);
1909 __ branch(lir_cond_always, T_ILLEGAL, stub);
1910 }
1911
1912 DecoratorSet decorators = IN_HEAP;
1913 if (is_volatile) {
1914 decorators |= MO_SEQ_CST;
1915 }
1916 if (needs_patching) {
1917 decorators |= C1_NEEDS_PATCHING;
1918 }
1919
1920 LIR_Opr result = rlock_result(x, field_type);
1921 access_load_at(decorators, field_type,
1922 object, LIR_OprFact::intConst(x->offset()), result,
1923 info ? new CodeEmitInfo(info) : NULL, info);
1924
1925 if (x->value_klass() != NULL && x->default_value() != NULL) {
1926 LabelObj* L_end = new LabelObj();
1927 __ cmp(lir_cond_notEqual, result, LIR_OprFact::oopConst(NULL));
1928 __ branch(lir_cond_notEqual, T_OBJECT, L_end->label());
1929
1930 LIRItem default_value(x->default_value(), this);
1931 default_value.load_item();
1932 __ move(default_value.result(), result);
1933
1934 __ branch_destination(L_end->label());
1935 }
1936 }
1937
1938
1939 //------------------------java.nio.Buffer.checkIndex------------------------
1940
1941 // int java.nio.Buffer.checkIndex(int)
1942 void LIRGenerator::do_NIOCheckIndex(Intrinsic* x) {
1943 // NOTE: by the time we are in checkIndex() we are guaranteed that
1944 // the buffer is non-null (because checkIndex is package-private and
1945 // only called from within other methods in the buffer).
1946 assert(x->number_of_arguments() == 2, "wrong type");
1947 LIRItem buf (x->argument_at(0), this);
1948 LIRItem index(x->argument_at(1), this);
1949 buf.load_item();
1950 index.load_item();
1951
1952 LIR_Opr result = rlock_result(x);
1953 if (GenerateRangeChecks) {
1954 CodeEmitInfo* info = state_for(x);
1955 CodeStub* stub = new RangeCheckStub(info, index.result());
1956 LIR_Opr buf_obj = access_resolve(IS_NOT_NULL | ACCESS_READ, buf.result());
1957 if (index.result()->is_constant()) {
1958 cmp_mem_int(lir_cond_belowEqual, buf_obj, java_nio_Buffer::limit_offset(), index.result()->as_jint(), info);
1959 __ branch(lir_cond_belowEqual, T_INT, stub);
1960 } else {
1961 cmp_reg_mem(lir_cond_aboveEqual, index.result(), buf_obj,
1962 java_nio_Buffer::limit_offset(), T_INT, info);
1963 __ branch(lir_cond_aboveEqual, T_INT, stub);
1964 }
1965 __ move(index.result(), result);
1966 } else {
1967 // Just load the index into the result register
1968 __ move(index.result(), result);
1969 }
1970 }
1971
1972
1973 //------------------------array access--------------------------------------
1974
1975
1976 void LIRGenerator::do_ArrayLength(ArrayLength* x) {
1977 LIRItem array(x->array(), this);
1978 array.load_item();
1979 LIR_Opr reg = rlock_result(x);
1980
1981 CodeEmitInfo* info = NULL;
1982 if (x->needs_null_check()) {
1983 NullCheck* nc = x->explicit_null_check();
1984 if (nc == NULL) {
1985 info = state_for(x);
1986 } else {
1987 info = state_for(nc);
1988 }
1989 if (StressLoopInvariantCodeMotion && info->deoptimize_on_exception()) {
1990 LIR_Opr obj = new_register(T_OBJECT);
1991 __ move(LIR_OprFact::oopConst(NULL), obj);
1992 __ null_check(obj, new CodeEmitInfo(info));
1993 }
1994 }
1995 __ load(new LIR_Address(array.result(), arrayOopDesc::length_offset_in_bytes(), T_INT), reg, info, lir_patch_none);
1996 }
1997
1998
1999 void LIRGenerator::do_LoadIndexed(LoadIndexed* x) {
2000 bool use_length = x->length() != NULL;
2001 LIRItem array(x->array(), this);
2002 LIRItem index(x->index(), this);
2003 LIRItem length(this);
2004 bool needs_range_check = x->compute_needs_range_check();
2005
2006 if (use_length && needs_range_check) {
2007 length.set_instruction(x->length());
2008 length.load_item();
2009 }
2010
2011 array.load_item();
2012 if (index.is_constant() && can_inline_as_constant(x->index())) {
2013 // let it be a constant
2014 index.dont_load_item();
2015 } else {
2016 index.load_item();
2017 }
2018
2019 CodeEmitInfo* range_check_info = state_for(x);
2020 CodeEmitInfo* null_check_info = NULL;
2021 if (x->needs_null_check()) {
2022 NullCheck* nc = x->explicit_null_check();
2023 if (nc != NULL) {
2024 null_check_info = state_for(nc);
2025 } else {
2026 null_check_info = range_check_info;
2027 }
2028 if (StressLoopInvariantCodeMotion && null_check_info->deoptimize_on_exception()) {
2029 LIR_Opr obj = new_register(T_OBJECT);
2030 __ move(LIR_OprFact::oopConst(NULL), obj);
2031 __ null_check(obj, new CodeEmitInfo(null_check_info));
2032 }
2033 }
2034
2035 if (GenerateRangeChecks && needs_range_check) {
2036 if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) {
2037 __ branch(lir_cond_always, T_ILLEGAL, new RangeCheckStub(range_check_info, index.result(), array.result()));
2038 } else if (use_length) {
2039 // TODO: use a (modified) version of array_range_check that does not require a
2040 // constant length to be loaded to a register
2041 __ cmp(lir_cond_belowEqual, length.result(), index.result());
2042 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result(), array.result()));
2043 } else {
2044 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
2045 // The range check performs the null check, so clear it out for the load
2046 null_check_info = NULL;
2047 }
2048 }
2049
2050 if (x->array()->is_loaded_flattened_array()) {
2051 // Find the destination address (of the NewValueTypeInstance)
2052 LIR_Opr obj = x->vt()->operand();
2053 LIRItem obj_item(x->vt(), this);
2054
2055 access_flattened_array(true, array, index, obj_item);
2056 set_no_result(x);
2057 } else {
2058 LIR_Opr result = rlock_result(x, x->elt_type());
2059 LoadFlattenedArrayStub* slow_path = NULL;
2060
2061 if (needs_flattened_array_check(x->array(), x)) {
2062 index.load_item();
2063 // Check if we indeed have a flattened array
2064 slow_path = new LoadFlattenedArrayStub(array.result(), index.result(), result, state_for(x));
2065 check_flattened_array(array, slow_path);
2066 }
2067
2068 DecoratorSet decorators = IN_HEAP | IS_ARRAY;
2069 access_load_at(decorators, x->elt_type(),
2070 array, index.result(), result,
2071 NULL, null_check_info);
2072
2073 if (slow_path != NULL) {
2074 __ branch_destination(slow_path->continuation());
2075 }
2076 }
2077 }
2078
2079
2080 void LIRGenerator::do_NullCheck(NullCheck* x) {
2081 if (x->can_trap()) {
2082 LIRItem value(x->obj(), this);
2083 value.load_item();
2084 CodeEmitInfo* info = state_for(x);
2085 __ null_check(value.result(), info);
2086 }
2087 }
2088
2089
2090 void LIRGenerator::do_TypeCast(TypeCast* x) {
2091 LIRItem value(x->obj(), this);
2092 value.load_item();
2093 // the result is the same as from the node we are casting
2094 set_result(x, value.result());
2095 }
2096
2097
2098 void LIRGenerator::do_Throw(Throw* x) {
2099 LIRItem exception(x->exception(), this);
2100 exception.load_item();
2101 set_no_result(x);
2102 LIR_Opr exception_opr = exception.result();
2103 CodeEmitInfo* info = state_for(x, x->state());
2104
2105 #ifndef PRODUCT
2106 if (PrintC1Statistics) {
2107 increment_counter(Runtime1::throw_count_address(), T_INT);
2108 }
2109 #endif
2110
2111 // check if the instruction has an xhandler in any of the nested scopes
2112 bool unwind = false;
2113 if (info->exception_handlers()->length() == 0) {
2114 // this throw is not inside an xhandler
2115 unwind = true;
2116 } else {
2117 // get some idea of the throw type
2118 bool type_is_exact = true;
2119 ciType* throw_type = x->exception()->exact_type();
2120 if (throw_type == NULL) {
2121 type_is_exact = false;
2122 throw_type = x->exception()->declared_type();
2123 }
2124 if (throw_type != NULL && throw_type->is_instance_klass()) {
2125 ciInstanceKlass* throw_klass = (ciInstanceKlass*)throw_type;
2126 unwind = !x->exception_handlers()->could_catch(throw_klass, type_is_exact);
2127 }
2128 }
2129
2130 // do null check before moving exception oop into fixed register
2131 // to avoid a fixed interval with an oop during the null check.
2132 // Use a copy of the CodeEmitInfo because debug information is
2133 // different for null_check and throw.
2134 if (x->exception()->as_NewInstance() == NULL && x->exception()->as_ExceptionObject() == NULL) {
2135 // if the exception object wasn't created using new then it might be null.
2136 __ null_check(exception_opr, new CodeEmitInfo(info, x->state()->copy(ValueStack::ExceptionState, x->state()->bci())));
2137 }
2138
2139 if (compilation()->env()->jvmti_can_post_on_exceptions()) {
2140 // we need to go through the exception lookup path to get JVMTI
2141 // notification done
2142 unwind = false;
2143 }
2144
2145 // move exception oop into fixed register
2146 __ move(exception_opr, exceptionOopOpr());
2147
2148 if (unwind) {
2149 __ unwind_exception(exceptionOopOpr());
2150 } else {
2151 __ throw_exception(exceptionPcOpr(), exceptionOopOpr(), info);
2152 }
2153 }
2154
2155
2156 void LIRGenerator::do_RoundFP(RoundFP* x) {
2157 LIRItem input(x->input(), this);
2158 input.load_item();
2159 LIR_Opr input_opr = input.result();
2160 assert(input_opr->is_register(), "why round if value is not in a register?");
2161 assert(input_opr->is_single_fpu() || input_opr->is_double_fpu(), "input should be floating-point value");
2162 if (input_opr->is_single_fpu()) {
2163 set_result(x, round_item(input_opr)); // This code path not currently taken
2164 } else {
2165 LIR_Opr result = new_register(T_DOUBLE);
2166 set_vreg_flag(result, must_start_in_memory);
2167 __ roundfp(input_opr, LIR_OprFact::illegalOpr, result);
2168 set_result(x, result);
2169 }
2170 }
2171
2172 // Here UnsafeGetRaw may have x->base() and x->index() be int or long
2173 // on both 64 and 32 bits. Expecting x->base() to be always long on 64bit.
2174 void LIRGenerator::do_UnsafeGetRaw(UnsafeGetRaw* x) {
2175 LIRItem base(x->base(), this);
2176 LIRItem idx(this);
2177
2178 base.load_item();
2179 if (x->has_index()) {
2180 idx.set_instruction(x->index());
2181 idx.load_nonconstant();
2182 }
2183
2184 LIR_Opr reg = rlock_result(x, x->basic_type());
2185
2186 int log2_scale = 0;
2187 if (x->has_index()) {
2188 log2_scale = x->log2_scale();
2189 }
2190
2191 assert(!x->has_index() || idx.value() == x->index(), "should match");
2192
2193 LIR_Opr base_op = base.result();
2194 LIR_Opr index_op = idx.result();
2195 #ifndef _LP64
2196 if (base_op->type() == T_LONG) {
2197 base_op = new_register(T_INT);
2198 __ convert(Bytecodes::_l2i, base.result(), base_op);
2199 }
2200 if (x->has_index()) {
2201 if (index_op->type() == T_LONG) {
2202 LIR_Opr long_index_op = index_op;
2203 if (index_op->is_constant()) {
2204 long_index_op = new_register(T_LONG);
2205 __ move(index_op, long_index_op);
2206 }
2207 index_op = new_register(T_INT);
2208 __ convert(Bytecodes::_l2i, long_index_op, index_op);
2209 } else {
2210 assert(x->index()->type()->tag() == intTag, "must be");
2211 }
2212 }
2213 // At this point base and index should be all ints.
2214 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2215 assert(!x->has_index() || index_op->type() == T_INT, "index should be an int");
2216 #else
2217 if (x->has_index()) {
2218 if (index_op->type() == T_INT) {
2219 if (!index_op->is_constant()) {
2220 index_op = new_register(T_LONG);
2221 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2222 }
2223 } else {
2224 assert(index_op->type() == T_LONG, "must be");
2225 if (index_op->is_constant()) {
2226 index_op = new_register(T_LONG);
2227 __ move(idx.result(), index_op);
2228 }
2229 }
2230 }
2231 // At this point base is a long non-constant
2232 // Index is a long register or a int constant.
2233 // We allow the constant to stay an int because that would allow us a more compact encoding by
2234 // embedding an immediate offset in the address expression. If we have a long constant, we have to
2235 // move it into a register first.
2236 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a long non-constant");
2237 assert(!x->has_index() || (index_op->type() == T_INT && index_op->is_constant()) ||
2238 (index_op->type() == T_LONG && !index_op->is_constant()), "unexpected index type");
2239 #endif
2240
2241 BasicType dst_type = x->basic_type();
2242
2243 LIR_Address* addr;
2244 if (index_op->is_constant()) {
2245 assert(log2_scale == 0, "must not have a scale");
2246 assert(index_op->type() == T_INT, "only int constants supported");
2247 addr = new LIR_Address(base_op, index_op->as_jint(), dst_type);
2248 } else {
2249 #ifdef X86
2250 addr = new LIR_Address(base_op, index_op, LIR_Address::Scale(log2_scale), 0, dst_type);
2251 #elif defined(GENERATE_ADDRESS_IS_PREFERRED)
2252 addr = generate_address(base_op, index_op, log2_scale, 0, dst_type);
2253 #else
2254 if (index_op->is_illegal() || log2_scale == 0) {
2255 addr = new LIR_Address(base_op, index_op, dst_type);
2256 } else {
2257 LIR_Opr tmp = new_pointer_register();
2258 __ shift_left(index_op, log2_scale, tmp);
2259 addr = new LIR_Address(base_op, tmp, dst_type);
2260 }
2261 #endif
2262 }
2263
2264 if (x->may_be_unaligned() && (dst_type == T_LONG || dst_type == T_DOUBLE)) {
2265 __ unaligned_move(addr, reg);
2266 } else {
2267 if (dst_type == T_OBJECT && x->is_wide()) {
2268 __ move_wide(addr, reg);
2269 } else {
2270 __ move(addr, reg);
2271 }
2272 }
2273 }
2274
2275
2276 void LIRGenerator::do_UnsafePutRaw(UnsafePutRaw* x) {
2277 int log2_scale = 0;
2278 BasicType type = x->basic_type();
2279
2280 if (x->has_index()) {
2281 log2_scale = x->log2_scale();
2282 }
2283
2284 LIRItem base(x->base(), this);
2285 LIRItem value(x->value(), this);
2286 LIRItem idx(this);
2287
2288 base.load_item();
2289 if (x->has_index()) {
2290 idx.set_instruction(x->index());
2291 idx.load_item();
2292 }
2293
2294 if (type == T_BYTE || type == T_BOOLEAN) {
2295 value.load_byte_item();
2296 } else {
2297 value.load_item();
2298 }
2299
2300 set_no_result(x);
2301
2302 LIR_Opr base_op = base.result();
2303 LIR_Opr index_op = idx.result();
2304
2305 #ifdef GENERATE_ADDRESS_IS_PREFERRED
2306 LIR_Address* addr = generate_address(base_op, index_op, log2_scale, 0, x->basic_type());
2307 #else
2308 #ifndef _LP64
2309 if (base_op->type() == T_LONG) {
2310 base_op = new_register(T_INT);
2311 __ convert(Bytecodes::_l2i, base.result(), base_op);
2312 }
2313 if (x->has_index()) {
2314 if (index_op->type() == T_LONG) {
2315 index_op = new_register(T_INT);
2316 __ convert(Bytecodes::_l2i, idx.result(), index_op);
2317 }
2318 }
2319 // At this point base and index should be all ints and not constants
2320 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2321 assert(!x->has_index() || (index_op->type() == T_INT && !index_op->is_constant()), "index should be an non-constant int");
2322 #else
2323 if (x->has_index()) {
2324 if (index_op->type() == T_INT) {
2325 index_op = new_register(T_LONG);
2326 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2327 }
2328 }
2329 // At this point base and index are long and non-constant
2330 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a non-constant long");
2331 assert(!x->has_index() || (index_op->type() == T_LONG && !index_op->is_constant()), "index must be a non-constant long");
2332 #endif
2333
2334 if (log2_scale != 0) {
2335 // temporary fix (platform dependent code without shift on Intel would be better)
2336 // TODO: ARM also allows embedded shift in the address
2337 LIR_Opr tmp = new_pointer_register();
2338 if (TwoOperandLIRForm) {
2339 __ move(index_op, tmp);
2340 index_op = tmp;
2341 }
2342 __ shift_left(index_op, log2_scale, tmp);
2343 if (!TwoOperandLIRForm) {
2344 index_op = tmp;
2345 }
2346 }
2347
2348 LIR_Address* addr = new LIR_Address(base_op, index_op, x->basic_type());
2349 #endif // !GENERATE_ADDRESS_IS_PREFERRED
2350 __ move(value.result(), addr);
2351 }
2352
2353
2354 void LIRGenerator::do_UnsafeGetObject(UnsafeGetObject* x) {
2355 BasicType type = x->basic_type();
2356 LIRItem src(x->object(), this);
2357 LIRItem off(x->offset(), this);
2358
2359 off.load_item();
2360 src.load_item();
2361
2362 DecoratorSet decorators = IN_HEAP;
2363
2364 if (x->is_volatile()) {
2365 decorators |= MO_SEQ_CST;
2366 }
2367 if (type == T_BOOLEAN) {
2368 decorators |= C1_MASK_BOOLEAN;
2369 }
2370 if (type == T_ARRAY || type == T_OBJECT) {
2371 decorators |= ON_UNKNOWN_OOP_REF;
2372 }
2373
2374 LIR_Opr result = rlock_result(x, type);
2375 access_load_at(decorators, type,
2376 src, off.result(), result);
2377 }
2378
2379
2380 void LIRGenerator::do_UnsafePutObject(UnsafePutObject* x) {
2381 BasicType type = x->basic_type();
2382 LIRItem src(x->object(), this);
2383 LIRItem off(x->offset(), this);
2384 LIRItem data(x->value(), this);
2385
2386 src.load_item();
2387 if (type == T_BOOLEAN || type == T_BYTE) {
2388 data.load_byte_item();
2389 } else {
2390 data.load_item();
2391 }
2392 off.load_item();
2393
2394 set_no_result(x);
2395
2396 DecoratorSet decorators = IN_HEAP;
2397 if (type == T_ARRAY || type == T_OBJECT) {
2398 decorators |= ON_UNKNOWN_OOP_REF;
2399 }
2400 if (x->is_volatile()) {
2401 decorators |= MO_SEQ_CST;
2402 }
2403 access_store_at(decorators, type, src, off.result(), data.result());
2404 }
2405
2406 void LIRGenerator::do_UnsafeGetAndSetObject(UnsafeGetAndSetObject* x) {
2407 BasicType type = x->basic_type();
2408 LIRItem src(x->object(), this);
2409 LIRItem off(x->offset(), this);
2410 LIRItem value(x->value(), this);
2411
2412 DecoratorSet decorators = IN_HEAP | MO_SEQ_CST;
2413
2414 if (type == T_ARRAY || type == T_OBJECT) {
2415 decorators |= ON_UNKNOWN_OOP_REF;
2416 }
2417
2418 LIR_Opr result;
2419 if (x->is_add()) {
2420 result = access_atomic_add_at(decorators, type, src, off, value);
2421 } else {
2422 result = access_atomic_xchg_at(decorators, type, src, off, value);
2423 }
2424 set_result(x, result);
2425 }
2426
2427 void LIRGenerator::do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux) {
2428 int lng = x->length();
2429
2430 for (int i = 0; i < lng; i++) {
2431 SwitchRange* one_range = x->at(i);
2432 int low_key = one_range->low_key();
2433 int high_key = one_range->high_key();
2434 BlockBegin* dest = one_range->sux();
2435 if (low_key == high_key) {
2436 __ cmp(lir_cond_equal, value, low_key);
2437 __ branch(lir_cond_equal, T_INT, dest);
2438 } else if (high_key - low_key == 1) {
2439 __ cmp(lir_cond_equal, value, low_key);
2440 __ branch(lir_cond_equal, T_INT, dest);
2441 __ cmp(lir_cond_equal, value, high_key);
2442 __ branch(lir_cond_equal, T_INT, dest);
2443 } else {
2444 LabelObj* L = new LabelObj();
2445 __ cmp(lir_cond_less, value, low_key);
2446 __ branch(lir_cond_less, T_INT, L->label());
2447 __ cmp(lir_cond_lessEqual, value, high_key);
2448 __ branch(lir_cond_lessEqual, T_INT, dest);
2449 __ branch_destination(L->label());
2450 }
2451 }
2452 __ jump(default_sux);
2453 }
2454
2455
2456 SwitchRangeArray* LIRGenerator::create_lookup_ranges(TableSwitch* x) {
2457 SwitchRangeList* res = new SwitchRangeList();
2458 int len = x->length();
2459 if (len > 0) {
2460 BlockBegin* sux = x->sux_at(0);
2461 int key = x->lo_key();
2462 BlockBegin* default_sux = x->default_sux();
2463 SwitchRange* range = new SwitchRange(key, sux);
2464 for (int i = 0; i < len; i++, key++) {
2465 BlockBegin* new_sux = x->sux_at(i);
2466 if (sux == new_sux) {
2467 // still in same range
2468 range->set_high_key(key);
2469 } else {
2470 // skip tests which explicitly dispatch to the default
2471 if (sux != default_sux) {
2472 res->append(range);
2473 }
2474 range = new SwitchRange(key, new_sux);
2475 }
2476 sux = new_sux;
2477 }
2478 if (res->length() == 0 || res->last() != range) res->append(range);
2479 }
2480 return res;
2481 }
2482
2483
2484 // we expect the keys to be sorted by increasing value
2485 SwitchRangeArray* LIRGenerator::create_lookup_ranges(LookupSwitch* x) {
2486 SwitchRangeList* res = new SwitchRangeList();
2487 int len = x->length();
2488 if (len > 0) {
2489 BlockBegin* default_sux = x->default_sux();
2490 int key = x->key_at(0);
2491 BlockBegin* sux = x->sux_at(0);
2492 SwitchRange* range = new SwitchRange(key, sux);
2493 for (int i = 1; i < len; i++) {
2494 int new_key = x->key_at(i);
2495 BlockBegin* new_sux = x->sux_at(i);
2496 if (key+1 == new_key && sux == new_sux) {
2497 // still in same range
2498 range->set_high_key(new_key);
2499 } else {
2500 // skip tests which explicitly dispatch to the default
2501 if (range->sux() != default_sux) {
2502 res->append(range);
2503 }
2504 range = new SwitchRange(new_key, new_sux);
2505 }
2506 key = new_key;
2507 sux = new_sux;
2508 }
2509 if (res->length() == 0 || res->last() != range) res->append(range);
2510 }
2511 return res;
2512 }
2513
2514
2515 void LIRGenerator::do_TableSwitch(TableSwitch* x) {
2516 LIRItem tag(x->tag(), this);
2517 tag.load_item();
2518 set_no_result(x);
2519
2520 if (x->is_safepoint()) {
2521 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2522 }
2523
2524 // move values into phi locations
2525 move_to_phi(x->state());
2526
2527 int lo_key = x->lo_key();
2528 int len = x->length();
2529 assert(lo_key <= (lo_key + (len - 1)), "integer overflow");
2530 LIR_Opr value = tag.result();
2531
2532 if (compilation()->env()->comp_level() == CompLevel_full_profile && UseSwitchProfiling) {
2533 ciMethod* method = x->state()->scope()->method();
2534 ciMethodData* md = method->method_data_or_null();
2535 assert(md != NULL, "Sanity");
2536 ciProfileData* data = md->bci_to_data(x->state()->bci());
2537 assert(data != NULL, "must have profiling data");
2538 assert(data->is_MultiBranchData(), "bad profile data?");
2539 int default_count_offset = md->byte_offset_of_slot(data, MultiBranchData::default_count_offset());
2540 LIR_Opr md_reg = new_register(T_METADATA);
2541 __ metadata2reg(md->constant_encoding(), md_reg);
2542 LIR_Opr data_offset_reg = new_pointer_register();
2543 LIR_Opr tmp_reg = new_pointer_register();
2544
2545 __ move(LIR_OprFact::intptrConst(default_count_offset), data_offset_reg);
2546 for (int i = 0; i < len; i++) {
2547 int count_offset = md->byte_offset_of_slot(data, MultiBranchData::case_count_offset(i));
2548 __ cmp(lir_cond_equal, value, i + lo_key);
2549 __ move(data_offset_reg, tmp_reg);
2550 __ cmove(lir_cond_equal,
2551 LIR_OprFact::intptrConst(count_offset),
2552 tmp_reg,
2553 data_offset_reg, T_INT);
2554 }
2555
2556 LIR_Opr data_reg = new_pointer_register();
2557 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
2558 __ move(data_addr, data_reg);
2559 __ add(data_reg, LIR_OprFact::intptrConst(1), data_reg);
2560 __ move(data_reg, data_addr);
2561 }
2562
2563 if (UseTableRanges) {
2564 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2565 } else {
2566 for (int i = 0; i < len; i++) {
2567 __ cmp(lir_cond_equal, value, i + lo_key);
2568 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2569 }
2570 __ jump(x->default_sux());
2571 }
2572 }
2573
2574
2575 void LIRGenerator::do_LookupSwitch(LookupSwitch* x) {
2576 LIRItem tag(x->tag(), this);
2577 tag.load_item();
2578 set_no_result(x);
2579
2580 if (x->is_safepoint()) {
2581 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2582 }
2583
2584 // move values into phi locations
2585 move_to_phi(x->state());
2586
2587 LIR_Opr value = tag.result();
2588 int len = x->length();
2589
2590 if (compilation()->env()->comp_level() == CompLevel_full_profile && UseSwitchProfiling) {
2591 ciMethod* method = x->state()->scope()->method();
2592 ciMethodData* md = method->method_data_or_null();
2593 assert(md != NULL, "Sanity");
2594 ciProfileData* data = md->bci_to_data(x->state()->bci());
2595 assert(data != NULL, "must have profiling data");
2596 assert(data->is_MultiBranchData(), "bad profile data?");
2597 int default_count_offset = md->byte_offset_of_slot(data, MultiBranchData::default_count_offset());
2598 LIR_Opr md_reg = new_register(T_METADATA);
2599 __ metadata2reg(md->constant_encoding(), md_reg);
2600 LIR_Opr data_offset_reg = new_pointer_register();
2601 LIR_Opr tmp_reg = new_pointer_register();
2602
2603 __ move(LIR_OprFact::intptrConst(default_count_offset), data_offset_reg);
2604 for (int i = 0; i < len; i++) {
2605 int count_offset = md->byte_offset_of_slot(data, MultiBranchData::case_count_offset(i));
2606 __ cmp(lir_cond_equal, value, x->key_at(i));
2607 __ move(data_offset_reg, tmp_reg);
2608 __ cmove(lir_cond_equal,
2609 LIR_OprFact::intptrConst(count_offset),
2610 tmp_reg,
2611 data_offset_reg, T_INT);
2612 }
2613
2614 LIR_Opr data_reg = new_pointer_register();
2615 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
2616 __ move(data_addr, data_reg);
2617 __ add(data_reg, LIR_OprFact::intptrConst(1), data_reg);
2618 __ move(data_reg, data_addr);
2619 }
2620
2621 if (UseTableRanges) {
2622 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2623 } else {
2624 int len = x->length();
2625 for (int i = 0; i < len; i++) {
2626 __ cmp(lir_cond_equal, value, x->key_at(i));
2627 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2628 }
2629 __ jump(x->default_sux());
2630 }
2631 }
2632
2633
2634 void LIRGenerator::do_Goto(Goto* x) {
2635 set_no_result(x);
2636
2637 if (block()->next()->as_OsrEntry()) {
2638 // need to free up storage used for OSR entry point
2639 LIR_Opr osrBuffer = block()->next()->operand();
2640 BasicTypeList signature;
2641 signature.append(NOT_LP64(T_INT) LP64_ONLY(T_LONG)); // pass a pointer to osrBuffer
2642 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
2643 __ move(osrBuffer, cc->args()->at(0));
2644 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
2645 getThreadTemp(), LIR_OprFact::illegalOpr, cc->args());
2646 }
2647
2648 if (x->is_safepoint()) {
2649 ValueStack* state = x->state_before() ? x->state_before() : x->state();
2650
2651 // increment backedge counter if needed
2652 CodeEmitInfo* info = state_for(x, state);
2653 increment_backedge_counter(info, x->profiled_bci());
2654 CodeEmitInfo* safepoint_info = state_for(x, state);
2655 __ safepoint(safepoint_poll_register(), safepoint_info);
2656 }
2657
2658 // Gotos can be folded Ifs, handle this case.
2659 if (x->should_profile()) {
2660 ciMethod* method = x->profiled_method();
2661 assert(method != NULL, "method should be set if branch is profiled");
2662 ciMethodData* md = method->method_data_or_null();
2663 assert(md != NULL, "Sanity");
2664 ciProfileData* data = md->bci_to_data(x->profiled_bci());
2665 assert(data != NULL, "must have profiling data");
2666 int offset;
2667 if (x->direction() == Goto::taken) {
2668 assert(data->is_BranchData(), "need BranchData for two-way branches");
2669 offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
2670 } else if (x->direction() == Goto::not_taken) {
2671 assert(data->is_BranchData(), "need BranchData for two-way branches");
2672 offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
2673 } else {
2674 assert(data->is_JumpData(), "need JumpData for branches");
2675 offset = md->byte_offset_of_slot(data, JumpData::taken_offset());
2676 }
2677 LIR_Opr md_reg = new_register(T_METADATA);
2678 __ metadata2reg(md->constant_encoding(), md_reg);
2679
2680 increment_counter(new LIR_Address(md_reg, offset,
2681 NOT_LP64(T_INT) LP64_ONLY(T_LONG)), DataLayout::counter_increment);
2682 }
2683
2684 // emit phi-instruction move after safepoint since this simplifies
2685 // describing the state as the safepoint.
2686 move_to_phi(x->state());
2687
2688 __ jump(x->default_sux());
2689 }
2690
2691 /**
2692 * Emit profiling code if needed for arguments, parameters, return value types
2693 *
2694 * @param md MDO the code will update at runtime
2695 * @param md_base_offset common offset in the MDO for this profile and subsequent ones
2696 * @param md_offset offset in the MDO (on top of md_base_offset) for this profile
2697 * @param profiled_k current profile
2698 * @param obj IR node for the object to be profiled
2699 * @param mdp register to hold the pointer inside the MDO (md + md_base_offset).
2700 * Set once we find an update to make and use for next ones.
2701 * @param not_null true if we know obj cannot be null
2702 * @param signature_at_call_k signature at call for obj
2703 * @param callee_signature_k signature of callee for obj
2704 * at call and callee signatures differ at method handle call
2705 * @return the only klass we know will ever be seen at this profile point
2706 */
2707 ciKlass* LIRGenerator::profile_type(ciMethodData* md, int md_base_offset, int md_offset, intptr_t profiled_k,
2708 Value obj, LIR_Opr& mdp, bool not_null, ciKlass* signature_at_call_k,
2709 ciKlass* callee_signature_k) {
2710 ciKlass* result = NULL;
2711 bool do_null = !not_null && !TypeEntries::was_null_seen(profiled_k);
2712 bool do_update = !TypeEntries::is_type_unknown(profiled_k);
2713 // known not to be null or null bit already set and already set to
2714 // unknown: nothing we can do to improve profiling
2715 if (!do_null && !do_update) {
2716 return result;
2717 }
2718
2719 ciKlass* exact_klass = NULL;
2720 Compilation* comp = Compilation::current();
2721 if (do_update) {
2722 // try to find exact type, using CHA if possible, so that loading
2723 // the klass from the object can be avoided
2724 ciType* type = obj->exact_type();
2725 if (type == NULL) {
2726 type = obj->declared_type();
2727 type = comp->cha_exact_type(type);
2728 }
2729 assert(type == NULL || type->is_klass(), "type should be class");
2730 exact_klass = (type != NULL && type->is_loaded()) ? (ciKlass*)type : NULL;
2731
2732 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2733 }
2734
2735 if (!do_null && !do_update) {
2736 return result;
2737 }
2738
2739 ciKlass* exact_signature_k = NULL;
2740 if (do_update) {
2741 // Is the type from the signature exact (the only one possible)?
2742 exact_signature_k = signature_at_call_k->exact_klass();
2743 if (exact_signature_k == NULL) {
2744 exact_signature_k = comp->cha_exact_type(signature_at_call_k);
2745 } else {
2746 result = exact_signature_k;
2747 // Known statically. No need to emit any code: prevent
2748 // LIR_Assembler::emit_profile_type() from emitting useless code
2749 profiled_k = ciTypeEntries::with_status(result, profiled_k);
2750 }
2751 // exact_klass and exact_signature_k can be both non NULL but
2752 // different if exact_klass is loaded after the ciObject for
2753 // exact_signature_k is created.
2754 if (exact_klass == NULL && exact_signature_k != NULL && exact_klass != exact_signature_k) {
2755 // sometimes the type of the signature is better than the best type
2756 // the compiler has
2757 exact_klass = exact_signature_k;
2758 }
2759 if (callee_signature_k != NULL &&
2760 callee_signature_k != signature_at_call_k) {
2761 ciKlass* improved_klass = callee_signature_k->exact_klass();
2762 if (improved_klass == NULL) {
2763 improved_klass = comp->cha_exact_type(callee_signature_k);
2764 }
2765 if (exact_klass == NULL && improved_klass != NULL && exact_klass != improved_klass) {
2766 exact_klass = exact_signature_k;
2767 }
2768 }
2769 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2770 }
2771
2772 if (!do_null && !do_update) {
2773 return result;
2774 }
2775
2776 if (mdp == LIR_OprFact::illegalOpr) {
2777 mdp = new_register(T_METADATA);
2778 __ metadata2reg(md->constant_encoding(), mdp);
2779 if (md_base_offset != 0) {
2780 LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS);
2781 mdp = new_pointer_register();
2782 __ leal(LIR_OprFact::address(base_type_address), mdp);
2783 }
2784 }
2785 LIRItem value(obj, this);
2786 value.load_item();
2787 __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA),
2788 value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != NULL);
2789 return result;
2790 }
2791
2792 // profile parameters on entry to the root of the compilation
2793 void LIRGenerator::profile_parameters(Base* x) {
2794 if (compilation()->profile_parameters()) {
2795 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2796 ciMethodData* md = scope()->method()->method_data_or_null();
2797 assert(md != NULL, "Sanity");
2798
2799 if (md->parameters_type_data() != NULL) {
2800 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
2801 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
2802 LIR_Opr mdp = LIR_OprFact::illegalOpr;
2803 for (int java_index = 0, i = 0, j = 0; j < parameters_type_data->number_of_parameters(); i++) {
2804 LIR_Opr src = args->at(i);
2805 assert(!src->is_illegal(), "check");
2806 BasicType t = src->type();
2807 if (t == T_OBJECT || t == T_ARRAY) {
2808 intptr_t profiled_k = parameters->type(j);
2809 Local* local = x->state()->local_at(java_index)->as_Local();
2810 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
2811 in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)),
2812 profiled_k, local, mdp, false, local->declared_type()->as_klass(), NULL);
2813 // If the profile is known statically set it once for all and do not emit any code
2814 if (exact != NULL) {
2815 md->set_parameter_type(j, exact);
2816 }
2817 j++;
2818 }
2819 java_index += type2size[t];
2820 }
2821 }
2822 }
2823 }
2824
2825 void LIRGenerator::do_Base(Base* x) {
2826 __ std_entry(LIR_OprFact::illegalOpr);
2827 // Emit moves from physical registers / stack slots to virtual registers
2828 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2829 IRScope* irScope = compilation()->hir()->top_scope();
2830 int java_index = 0;
2831 for (int i = 0; i < args->length(); i++) {
2832 LIR_Opr src = args->at(i);
2833 assert(!src->is_illegal(), "check");
2834 BasicType t = src->type();
2835
2836 // Types which are smaller than int are passed as int, so
2837 // correct the type which passed.
2838 switch (t) {
2839 case T_BYTE:
2840 case T_BOOLEAN:
2841 case T_SHORT:
2842 case T_CHAR:
2843 t = T_INT;
2844 break;
2845 default:
2846 break;
2847 }
2848
2849 LIR_Opr dest = new_register(t);
2850 __ move(src, dest);
2851
2852 // Assign new location to Local instruction for this local
2853 Local* local = x->state()->local_at(java_index)->as_Local();
2854 assert(local != NULL, "Locals for incoming arguments must have been created");
2855 #ifndef __SOFTFP__
2856 // The java calling convention passes double as long and float as int.
2857 assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
2858 #endif // __SOFTFP__
2859 local->set_operand(dest);
2860 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL);
2861 java_index += type2size[t];
2862 }
2863
2864 if (compilation()->env()->dtrace_method_probes()) {
2865 BasicTypeList signature;
2866 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
2867 signature.append(T_METADATA); // Method*
2868 LIR_OprList* args = new LIR_OprList();
2869 args->append(getThreadPointer());
2870 LIR_Opr meth = new_register(T_METADATA);
2871 __ metadata2reg(method()->constant_encoding(), meth);
2872 args->append(meth);
2873 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, NULL);
2874 }
2875
2876 if (method()->is_synchronized()) {
2877 LIR_Opr obj;
2878 if (method()->is_static()) {
2879 obj = new_register(T_OBJECT);
2880 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
2881 } else {
2882 Local* receiver = x->state()->local_at(0)->as_Local();
2883 assert(receiver != NULL, "must already exist");
2884 obj = receiver->operand();
2885 }
2886 assert(obj->is_valid(), "must be valid");
2887
2888 if (method()->is_synchronized() && GenerateSynchronizationCode) {
2889 LIR_Opr lock = syncLockOpr();
2890 __ load_stack_address_monitor(0, lock);
2891
2892 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, x->check_flag(Instruction::DeoptimizeOnException));
2893 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
2894
2895 // receiver is guaranteed non-NULL so don't need CodeEmitInfo
2896 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, NULL);
2897 }
2898 }
2899 if (compilation()->age_code()) {
2900 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, 0), NULL, false);
2901 decrement_age(info);
2902 }
2903 // increment invocation counters if needed
2904 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
2905 profile_parameters(x);
2906 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, false);
2907 increment_invocation_counter(info);
2908 }
2909
2910 // all blocks with a successor must end with an unconditional jump
2911 // to the successor even if they are consecutive
2912 __ jump(x->default_sux());
2913 }
2914
2915
2916 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
2917 // construct our frame and model the production of incoming pointer
2918 // to the OSR buffer.
2919 __ osr_entry(LIR_Assembler::osrBufferPointer());
2920 LIR_Opr result = rlock_result(x);
2921 __ move(LIR_Assembler::osrBufferPointer(), result);
2922 }
2923
2924
2925 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
2926 assert(args->length() == arg_list->length(),
2927 "args=%d, arg_list=%d", args->length(), arg_list->length());
2928 for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) {
2929 LIRItem* param = args->at(i);
2930 LIR_Opr loc = arg_list->at(i);
2931 if (loc->is_register()) {
2932 param->load_item_force(loc);
2933 } else {
2934 LIR_Address* addr = loc->as_address_ptr();
2935 param->load_for_store(addr->type());
2936 assert(addr->type() != T_VALUETYPE, "not supported yet");
2937 if (addr->type() == T_OBJECT) {
2938 __ move_wide(param->result(), addr);
2939 } else
2940 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
2941 __ unaligned_move(param->result(), addr);
2942 } else {
2943 __ move(param->result(), addr);
2944 }
2945 }
2946 }
2947
2948 if (x->has_receiver()) {
2949 LIRItem* receiver = args->at(0);
2950 LIR_Opr loc = arg_list->at(0);
2951 if (loc->is_register()) {
2952 receiver->load_item_force(loc);
2953 } else {
2954 assert(loc->is_address(), "just checking");
2955 receiver->load_for_store(T_OBJECT);
2956 __ move_wide(receiver->result(), loc->as_address_ptr());
2957 }
2958 }
2959 }
2960
2961
2962 // Visits all arguments, returns appropriate items without loading them
2963 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
2964 LIRItemList* argument_items = new LIRItemList();
2965 if (x->has_receiver()) {
2966 LIRItem* receiver = new LIRItem(x->receiver(), this);
2967 argument_items->append(receiver);
2968 }
2969 for (int i = 0; i < x->number_of_arguments(); i++) {
2970 LIRItem* param = new LIRItem(x->argument_at(i), this);
2971 argument_items->append(param);
2972 }
2973 return argument_items;
2974 }
2975
2976
2977 // The invoke with receiver has following phases:
2978 // a) traverse and load/lock receiver;
2979 // b) traverse all arguments -> item-array (invoke_visit_argument)
2980 // c) push receiver on stack
2981 // d) load each of the items and push on stack
2982 // e) unlock receiver
2983 // f) move receiver into receiver-register %o0
2984 // g) lock result registers and emit call operation
2985 //
2986 // Before issuing a call, we must spill-save all values on stack
2987 // that are in caller-save register. "spill-save" moves those registers
2988 // either in a free callee-save register or spills them if no free
2989 // callee save register is available.
2990 //
2991 // The problem is where to invoke spill-save.
2992 // - if invoked between e) and f), we may lock callee save
2993 // register in "spill-save" that destroys the receiver register
2994 // before f) is executed
2995 // - if we rearrange f) to be earlier (by loading %o0) it
2996 // may destroy a value on the stack that is currently in %o0
2997 // and is waiting to be spilled
2998 // - if we keep the receiver locked while doing spill-save,
2999 // we cannot spill it as it is spill-locked
3000 //
3001 void LIRGenerator::do_Invoke(Invoke* x) {
3002 CallingConvention* cc = frame_map()->java_calling_convention(x->signature(), true);
3003
3004 LIR_OprList* arg_list = cc->args();
3005 LIRItemList* args = invoke_visit_arguments(x);
3006 LIR_Opr receiver = LIR_OprFact::illegalOpr;
3007
3008 // setup result register
3009 LIR_Opr result_register = LIR_OprFact::illegalOpr;
3010 if (x->type() != voidType) {
3011 result_register = result_register_for(x->type());
3012 }
3013
3014 CodeEmitInfo* info = state_for(x, x->state());
3015
3016 invoke_load_arguments(x, args, arg_list);
3017
3018 if (x->has_receiver()) {
3019 args->at(0)->load_item_force(LIR_Assembler::receiverOpr());
3020 receiver = args->at(0)->result();
3021 }
3022
3023 // emit invoke code
3024 assert(receiver->is_illegal() || receiver->is_equal(LIR_Assembler::receiverOpr()), "must match");
3025
3026 // JSR 292
3027 // Preserve the SP over MethodHandle call sites, if needed.
3028 ciMethod* target = x->target();
3029 bool is_method_handle_invoke = (// %%% FIXME: Are both of these relevant?
3030 target->is_method_handle_intrinsic() ||
3031 target->is_compiled_lambda_form());
3032 if (is_method_handle_invoke) {
3033 info->set_is_method_handle_invoke(true);
3034 if(FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
3035 __ move(FrameMap::stack_pointer(), FrameMap::method_handle_invoke_SP_save_opr());
3036 }
3037 }
3038
3039 switch (x->code()) {
3040 case Bytecodes::_invokestatic:
3041 __ call_static(target, result_register,
3042 SharedRuntime::get_resolve_static_call_stub(),
3043 arg_list, info);
3044 break;
3045 case Bytecodes::_invokespecial:
3046 case Bytecodes::_invokevirtual:
3047 case Bytecodes::_invokeinterface:
3048 // for loaded and final (method or class) target we still produce an inline cache,
3049 // in order to be able to call mixed mode
3050 if (x->code() == Bytecodes::_invokespecial || x->target_is_final()) {
3051 __ call_opt_virtual(target, receiver, result_register,
3052 SharedRuntime::get_resolve_opt_virtual_call_stub(),
3053 arg_list, info);
3054 } else if (x->vtable_index() < 0) {
3055 __ call_icvirtual(target, receiver, result_register,
3056 SharedRuntime::get_resolve_virtual_call_stub(),
3057 arg_list, info);
3058 } else {
3059 int entry_offset = in_bytes(Klass::vtable_start_offset()) + x->vtable_index() * vtableEntry::size_in_bytes();
3060 int vtable_offset = entry_offset + vtableEntry::method_offset_in_bytes();
3061 __ call_virtual(target, receiver, result_register, vtable_offset, arg_list, info);
3062 }
3063 break;
3064 case Bytecodes::_invokedynamic: {
3065 __ call_dynamic(target, receiver, result_register,
3066 SharedRuntime::get_resolve_static_call_stub(),
3067 arg_list, info);
3068 break;
3069 }
3070 default:
3071 fatal("unexpected bytecode: %s", Bytecodes::name(x->code()));
3072 break;
3073 }
3074
3075 // JSR 292
3076 // Restore the SP after MethodHandle call sites, if needed.
3077 if (is_method_handle_invoke
3078 && FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
3079 __ move(FrameMap::method_handle_invoke_SP_save_opr(), FrameMap::stack_pointer());
3080 }
3081
3082 if (x->type()->is_float() || x->type()->is_double()) {
3083 // Force rounding of results from non-strictfp when in strictfp
3084 // scope (or when we don't know the strictness of the callee, to
3085 // be safe.)
3086 if (method()->is_strict()) {
3087 if (!x->target_is_loaded() || !x->target_is_strictfp()) {
3088 result_register = round_item(result_register);
3089 }
3090 }
3091 }
3092
3093 if (result_register->is_valid()) {
3094 LIR_Opr result = rlock_result(x);
3095 __ move(result_register, result);
3096 }
3097 }
3098
3099
3100 void LIRGenerator::do_FPIntrinsics(Intrinsic* x) {
3101 assert(x->number_of_arguments() == 1, "wrong type");
3102 LIRItem value (x->argument_at(0), this);
3103 LIR_Opr reg = rlock_result(x);
3104 value.load_item();
3105 LIR_Opr tmp = force_to_spill(value.result(), as_BasicType(x->type()));
3106 __ move(tmp, reg);
3107 }
3108
3109
3110
3111 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval()
3112 void LIRGenerator::do_IfOp(IfOp* x) {
3113 #ifdef ASSERT
3114 {
3115 ValueTag xtag = x->x()->type()->tag();
3116 ValueTag ttag = x->tval()->type()->tag();
3117 assert(xtag == intTag || xtag == objectTag, "cannot handle others");
3118 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
3119 assert(ttag == x->fval()->type()->tag(), "cannot handle others");
3120 }
3121 #endif
3122
3123 LIRItem left(x->x(), this);
3124 LIRItem right(x->y(), this);
3125 left.load_item();
3126 if (can_inline_as_constant(right.value())) {
3127 right.dont_load_item();
3128 } else {
3129 right.load_item();
3130 }
3131
3132 LIRItem t_val(x->tval(), this);
3133 LIRItem f_val(x->fval(), this);
3134 t_val.dont_load_item();
3135 f_val.dont_load_item();
3136 LIR_Opr reg = rlock_result(x);
3137
3138 __ cmp(lir_cond(x->cond()), left.result(), right.result());
3139 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
3140 }
3141
3142 #ifdef JFR_HAVE_INTRINSICS
3143 void LIRGenerator::do_ClassIDIntrinsic(Intrinsic* x) {
3144 CodeEmitInfo* info = state_for(x);
3145 CodeEmitInfo* info2 = new CodeEmitInfo(info); // Clone for the second null check
3146
3147 assert(info != NULL, "must have info");
3148 LIRItem arg(x->argument_at(0), this);
3149
3150 arg.load_item();
3151 LIR_Opr klass = new_register(T_METADATA);
3152 __ move(new LIR_Address(arg.result(), java_lang_Class::klass_offset_in_bytes(), T_ADDRESS), klass, info);
3153 LIR_Opr id = new_register(T_LONG);
3154 ByteSize offset = KLASS_TRACE_ID_OFFSET;
3155 LIR_Address* trace_id_addr = new LIR_Address(klass, in_bytes(offset), T_LONG);
3156
3157 __ move(trace_id_addr, id);
3158 __ logical_or(id, LIR_OprFact::longConst(0x01l), id);
3159 __ store(id, trace_id_addr);
3160
3161 #ifdef TRACE_ID_META_BITS
3162 __ logical_and(id, LIR_OprFact::longConst(~TRACE_ID_META_BITS), id);
3163 #endif
3164 #ifdef TRACE_ID_SHIFT
3165 __ unsigned_shift_right(id, TRACE_ID_SHIFT, id);
3166 #endif
3167
3168 __ move(id, rlock_result(x));
3169 }
3170
3171 void LIRGenerator::do_getEventWriter(Intrinsic* x) {
3172 LabelObj* L_end = new LabelObj();
3173
3174 LIR_Address* jobj_addr = new LIR_Address(getThreadPointer(),
3175 in_bytes(THREAD_LOCAL_WRITER_OFFSET_JFR),
3176 T_OBJECT);
3177 LIR_Opr result = rlock_result(x);
3178 __ move_wide(jobj_addr, result);
3179 __ cmp(lir_cond_equal, result, LIR_OprFact::oopConst(NULL));
3180 __ branch(lir_cond_equal, T_OBJECT, L_end->label());
3181
3182 LIR_Opr jobj = new_register(T_OBJECT);
3183 __ move(result, jobj);
3184 access_load(IN_NATIVE, T_OBJECT, LIR_OprFact::address(new LIR_Address(jobj, T_OBJECT)), result);
3185
3186 __ branch_destination(L_end->label());
3187 }
3188
3189 #endif
3190
3191
3192 void LIRGenerator::do_RuntimeCall(address routine, Intrinsic* x) {
3193 assert(x->number_of_arguments() == 0, "wrong type");
3194 // Enforce computation of _reserved_argument_area_size which is required on some platforms.
3195 BasicTypeList signature;
3196 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
3197 LIR_Opr reg = result_register_for(x->type());
3198 __ call_runtime_leaf(routine, getThreadTemp(),
3199 reg, new LIR_OprList());
3200 LIR_Opr result = rlock_result(x);
3201 __ move(reg, result);
3202 }
3203
3204
3205
3206 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
3207 switch (x->id()) {
3208 case vmIntrinsics::_intBitsToFloat :
3209 case vmIntrinsics::_doubleToRawLongBits :
3210 case vmIntrinsics::_longBitsToDouble :
3211 case vmIntrinsics::_floatToRawIntBits : {
3212 do_FPIntrinsics(x);
3213 break;
3214 }
3215
3216 #ifdef JFR_HAVE_INTRINSICS
3217 case vmIntrinsics::_getClassId:
3218 do_ClassIDIntrinsic(x);
3219 break;
3220 case vmIntrinsics::_getEventWriter:
3221 do_getEventWriter(x);
3222 break;
3223 case vmIntrinsics::_counterTime:
3224 do_RuntimeCall(CAST_FROM_FN_PTR(address, JFR_TIME_FUNCTION), x);
3225 break;
3226 #endif
3227
3228 case vmIntrinsics::_currentTimeMillis:
3229 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeMillis), x);
3230 break;
3231
3232 case vmIntrinsics::_nanoTime:
3233 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeNanos), x);
3234 break;
3235
3236 case vmIntrinsics::_Object_init: do_RegisterFinalizer(x); break;
3237 case vmIntrinsics::_isInstance: do_isInstance(x); break;
3238 case vmIntrinsics::_isPrimitive: do_isPrimitive(x); break;
3239 case vmIntrinsics::_getClass: do_getClass(x); break;
3240 case vmIntrinsics::_currentThread: do_currentThread(x); break;
3241
3242 case vmIntrinsics::_dlog: // fall through
3243 case vmIntrinsics::_dlog10: // fall through
3244 case vmIntrinsics::_dabs: // fall through
3245 case vmIntrinsics::_dsqrt: // fall through
3246 case vmIntrinsics::_dtan: // fall through
3247 case vmIntrinsics::_dsin : // fall through
3248 case vmIntrinsics::_dcos : // fall through
3249 case vmIntrinsics::_dexp : // fall through
3250 case vmIntrinsics::_dpow : do_MathIntrinsic(x); break;
3251 case vmIntrinsics::_arraycopy: do_ArrayCopy(x); break;
3252
3253 case vmIntrinsics::_fmaD: do_FmaIntrinsic(x); break;
3254 case vmIntrinsics::_fmaF: do_FmaIntrinsic(x); break;
3255
3256 // java.nio.Buffer.checkIndex
3257 case vmIntrinsics::_checkIndex: do_NIOCheckIndex(x); break;
3258
3259 case vmIntrinsics::_compareAndSetReference:
3260 do_CompareAndSwap(x, objectType);
3261 break;
3262 case vmIntrinsics::_compareAndSetInt:
3263 do_CompareAndSwap(x, intType);
3264 break;
3265 case vmIntrinsics::_compareAndSetLong:
3266 do_CompareAndSwap(x, longType);
3267 break;
3268
3269 case vmIntrinsics::_loadFence :
3270 __ membar_acquire();
3271 break;
3272 case vmIntrinsics::_storeFence:
3273 __ membar_release();
3274 break;
3275 case vmIntrinsics::_fullFence :
3276 __ membar();
3277 break;
3278 case vmIntrinsics::_onSpinWait:
3279 __ on_spin_wait();
3280 break;
3281 case vmIntrinsics::_Reference_get:
3282 do_Reference_get(x);
3283 break;
3284
3285 case vmIntrinsics::_updateCRC32:
3286 case vmIntrinsics::_updateBytesCRC32:
3287 case vmIntrinsics::_updateByteBufferCRC32:
3288 do_update_CRC32(x);
3289 break;
3290
3291 case vmIntrinsics::_updateBytesCRC32C:
3292 case vmIntrinsics::_updateDirectByteBufferCRC32C:
3293 do_update_CRC32C(x);
3294 break;
3295
3296 case vmIntrinsics::_vectorizedMismatch:
3297 do_vectorizedMismatch(x);
3298 break;
3299
3300 default: ShouldNotReachHere(); break;
3301 }
3302 }
3303
3304 void LIRGenerator::profile_arguments(ProfileCall* x) {
3305 if (compilation()->profile_arguments()) {
3306 int bci = x->bci_of_invoke();
3307 ciMethodData* md = x->method()->method_data_or_null();
3308 assert(md != NULL, "Sanity");
3309 ciProfileData* data = md->bci_to_data(bci);
3310 if (data != NULL) {
3311 if ((data->is_CallTypeData() && data->as_CallTypeData()->has_arguments()) ||
3312 (data->is_VirtualCallTypeData() && data->as_VirtualCallTypeData()->has_arguments())) {
3313 ByteSize extra = data->is_CallTypeData() ? CallTypeData::args_data_offset() : VirtualCallTypeData::args_data_offset();
3314 int base_offset = md->byte_offset_of_slot(data, extra);
3315 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3316 ciTypeStackSlotEntries* args = data->is_CallTypeData() ? ((ciCallTypeData*)data)->args() : ((ciVirtualCallTypeData*)data)->args();
3317
3318 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3319 int start = 0;
3320 int stop = data->is_CallTypeData() ? ((ciCallTypeData*)data)->number_of_arguments() : ((ciVirtualCallTypeData*)data)->number_of_arguments();
3321 if (x->callee()->is_loaded() && x->callee()->is_static() && Bytecodes::has_receiver(bc)) {
3322 // first argument is not profiled at call (method handle invoke)
3323 assert(x->method()->raw_code_at_bci(bci) == Bytecodes::_invokehandle, "invokehandle expected");
3324 start = 1;
3325 }
3326 ciSignature* callee_signature = x->callee()->signature();
3327 // method handle call to virtual method
3328 bool has_receiver = x->callee()->is_loaded() && !x->callee()->is_static() && !Bytecodes::has_receiver(bc);
3329 ciSignatureStream callee_signature_stream(callee_signature, has_receiver ? x->callee()->holder() : NULL);
3330
3331 bool ignored_will_link;
3332 ciSignature* signature_at_call = NULL;
3333 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3334 ciSignatureStream signature_at_call_stream(signature_at_call);
3335
3336 // if called through method handle invoke, some arguments may have been popped
3337 for (int i = 0; i < stop && i+start < x->nb_profiled_args(); i++) {
3338 int off = in_bytes(TypeEntriesAtCall::argument_type_offset(i)) - in_bytes(TypeEntriesAtCall::args_data_offset());
3339 ciKlass* exact = profile_type(md, base_offset, off,
3340 args->type(i), x->profiled_arg_at(i+start), mdp,
3341 !x->arg_needs_null_check(i+start),
3342 signature_at_call_stream.next_klass(), callee_signature_stream.next_klass());
3343 if (exact != NULL) {
3344 md->set_argument_type(bci, i, exact);
3345 }
3346 }
3347 } else {
3348 #ifdef ASSERT
3349 Bytecodes::Code code = x->method()->raw_code_at_bci(x->bci_of_invoke());
3350 int n = x->nb_profiled_args();
3351 assert(MethodData::profile_parameters() && (MethodData::profile_arguments_jsr292_only() ||
3352 (x->inlined() && ((code == Bytecodes::_invokedynamic && n <= 1) || (code == Bytecodes::_invokehandle && n <= 2)))),
3353 "only at JSR292 bytecodes");
3354 #endif
3355 }
3356 }
3357 }
3358 }
3359
3360 // profile parameters on entry to an inlined method
3361 void LIRGenerator::profile_parameters_at_call(ProfileCall* x) {
3362 if (compilation()->profile_parameters() && x->inlined()) {
3363 ciMethodData* md = x->callee()->method_data_or_null();
3364 if (md != NULL) {
3365 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
3366 if (parameters_type_data != NULL) {
3367 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
3368 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3369 bool has_receiver = !x->callee()->is_static();
3370 ciSignature* sig = x->callee()->signature();
3371 ciSignatureStream sig_stream(sig, has_receiver ? x->callee()->holder() : NULL);
3372 int i = 0; // to iterate on the Instructions
3373 Value arg = x->recv();
3374 bool not_null = false;
3375 int bci = x->bci_of_invoke();
3376 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3377 // The first parameter is the receiver so that's what we start
3378 // with if it exists. One exception is method handle call to
3379 // virtual method: the receiver is in the args list
3380 if (arg == NULL || !Bytecodes::has_receiver(bc)) {
3381 i = 1;
3382 arg = x->profiled_arg_at(0);
3383 not_null = !x->arg_needs_null_check(0);
3384 }
3385 int k = 0; // to iterate on the profile data
3386 for (;;) {
3387 intptr_t profiled_k = parameters->type(k);
3388 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
3389 in_bytes(ParametersTypeData::type_offset(k)) - in_bytes(ParametersTypeData::type_offset(0)),
3390 profiled_k, arg, mdp, not_null, sig_stream.next_klass(), NULL);
3391 // If the profile is known statically set it once for all and do not emit any code
3392 if (exact != NULL) {
3393 md->set_parameter_type(k, exact);
3394 }
3395 k++;
3396 if (k >= parameters_type_data->number_of_parameters()) {
3397 #ifdef ASSERT
3398 int extra = 0;
3399 if (MethodData::profile_arguments() && TypeProfileParmsLimit != -1 &&
3400 x->nb_profiled_args() >= TypeProfileParmsLimit &&
3401 x->recv() != NULL && Bytecodes::has_receiver(bc)) {
3402 extra += 1;
3403 }
3404 assert(i == x->nb_profiled_args() - extra || (TypeProfileParmsLimit != -1 && TypeProfileArgsLimit > TypeProfileParmsLimit), "unused parameters?");
3405 #endif
3406 break;
3407 }
3408 arg = x->profiled_arg_at(i);
3409 not_null = !x->arg_needs_null_check(i);
3410 i++;
3411 }
3412 }
3413 }
3414 }
3415 }
3416
3417 void LIRGenerator::do_ProfileCall(ProfileCall* x) {
3418 // Need recv in a temporary register so it interferes with the other temporaries
3419 LIR_Opr recv = LIR_OprFact::illegalOpr;
3420 LIR_Opr mdo = new_register(T_METADATA);
3421 // tmp is used to hold the counters on SPARC
3422 LIR_Opr tmp = new_pointer_register();
3423
3424 if (x->nb_profiled_args() > 0) {
3425 profile_arguments(x);
3426 }
3427
3428 // profile parameters on inlined method entry including receiver
3429 if (x->recv() != NULL || x->nb_profiled_args() > 0) {
3430 profile_parameters_at_call(x);
3431 }
3432
3433 if (x->recv() != NULL) {
3434 LIRItem value(x->recv(), this);
3435 value.load_item();
3436 recv = new_register(T_OBJECT);
3437 __ move(value.result(), recv);
3438 }
3439 __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder());
3440 }
3441
3442 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) {
3443 int bci = x->bci_of_invoke();
3444 ciMethodData* md = x->method()->method_data_or_null();
3445 assert(md != NULL, "Sanity");
3446 ciProfileData* data = md->bci_to_data(bci);
3447 if (data != NULL) {
3448 assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type");
3449 ciReturnTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret();
3450 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3451
3452 bool ignored_will_link;
3453 ciSignature* signature_at_call = NULL;
3454 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3455
3456 // The offset within the MDO of the entry to update may be too large
3457 // to be used in load/store instructions on some platforms. So have
3458 // profile_type() compute the address of the profile in a register.
3459 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0,
3460 ret->type(), x->ret(), mdp,
3461 !x->needs_null_check(),
3462 signature_at_call->return_type()->as_klass(),
3463 x->callee()->signature()->return_type()->as_klass());
3464 if (exact != NULL) {
3465 md->set_return_type(bci, exact);
3466 }
3467 }
3468 }
3469
3470 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
3471 // We can safely ignore accessors here, since c2 will inline them anyway,
3472 // accessors are also always mature.
3473 if (!x->inlinee()->is_accessor()) {
3474 CodeEmitInfo* info = state_for(x, x->state(), true);
3475 // Notify the runtime very infrequently only to take care of counter overflows
3476 int freq_log = Tier23InlineeNotifyFreqLog;
3477 double scale;
3478 if (_method->has_option_value("CompileThresholdScaling", scale)) {
3479 freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3480 }
3481 increment_event_counter_impl(info, x->inlinee(), LIR_OprFact::intConst(InvocationCounter::count_increment), right_n_bits(freq_log), InvocationEntryBci, false, true);
3482 }
3483 }
3484
3485 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) {
3486 if (compilation()->count_backedges()) {
3487 __ cmp(cond, left, right);
3488 LIR_Opr step = new_register(T_INT);
3489 LIR_Opr plus_one = LIR_OprFact::intConst(InvocationCounter::count_increment);
3490 LIR_Opr zero = LIR_OprFact::intConst(0);
3491 __ cmove(cond,
3492 (left_bci < bci) ? plus_one : zero,
3493 (right_bci < bci) ? plus_one : zero,
3494 step, left->type());
3495 increment_backedge_counter(info, step, bci);
3496 }
3497 }
3498
3499
3500 void LIRGenerator::increment_event_counter(CodeEmitInfo* info, LIR_Opr step, int bci, bool backedge) {
3501 int freq_log = 0;
3502 int level = compilation()->env()->comp_level();
3503 if (level == CompLevel_limited_profile) {
3504 freq_log = (backedge ? Tier2BackedgeNotifyFreqLog : Tier2InvokeNotifyFreqLog);
3505 } else if (level == CompLevel_full_profile) {
3506 freq_log = (backedge ? Tier3BackedgeNotifyFreqLog : Tier3InvokeNotifyFreqLog);
3507 } else {
3508 ShouldNotReachHere();
3509 }
3510 // Increment the appropriate invocation/backedge counter and notify the runtime.
3511 double scale;
3512 if (_method->has_option_value("CompileThresholdScaling", scale)) {
3513 freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3514 }
3515 increment_event_counter_impl(info, info->scope()->method(), step, right_n_bits(freq_log), bci, backedge, true);
3516 }
3517
3518 void LIRGenerator::decrement_age(CodeEmitInfo* info) {
3519 ciMethod* method = info->scope()->method();
3520 MethodCounters* mc_adr = method->ensure_method_counters();
3521 if (mc_adr != NULL) {
3522 LIR_Opr mc = new_pointer_register();
3523 __ move(LIR_OprFact::intptrConst(mc_adr), mc);
3524 int offset = in_bytes(MethodCounters::nmethod_age_offset());
3525 LIR_Address* counter = new LIR_Address(mc, offset, T_INT);
3526 LIR_Opr result = new_register(T_INT);
3527 __ load(counter, result);
3528 __ sub(result, LIR_OprFact::intConst(1), result);
3529 __ store(result, counter);
3530 // DeoptimizeStub will reexecute from the current state in code info.
3531 CodeStub* deopt = new DeoptimizeStub(info, Deoptimization::Reason_tenured,
3532 Deoptimization::Action_make_not_entrant);
3533 __ cmp(lir_cond_lessEqual, result, LIR_OprFact::intConst(0));
3534 __ branch(lir_cond_lessEqual, T_INT, deopt);
3535 }
3536 }
3537
3538
3539 void LIRGenerator::increment_event_counter_impl(CodeEmitInfo* info,
3540 ciMethod *method, LIR_Opr step, int frequency,
3541 int bci, bool backedge, bool notify) {
3542 assert(frequency == 0 || is_power_of_2(frequency + 1), "Frequency must be x^2 - 1 or 0");
3543 int level = _compilation->env()->comp_level();
3544 assert(level > CompLevel_simple, "Shouldn't be here");
3545
3546 int offset = -1;
3547 LIR_Opr counter_holder = NULL;
3548 if (level == CompLevel_limited_profile) {
3549 MethodCounters* counters_adr = method->ensure_method_counters();
3550 if (counters_adr == NULL) {
3551 bailout("method counters allocation failed");
3552 return;
3553 }
3554 counter_holder = new_pointer_register();
3555 __ move(LIR_OprFact::intptrConst(counters_adr), counter_holder);
3556 offset = in_bytes(backedge ? MethodCounters::backedge_counter_offset() :
3557 MethodCounters::invocation_counter_offset());
3558 } else if (level == CompLevel_full_profile) {
3559 counter_holder = new_register(T_METADATA);
3560 offset = in_bytes(backedge ? MethodData::backedge_counter_offset() :
3561 MethodData::invocation_counter_offset());
3562 ciMethodData* md = method->method_data_or_null();
3563 assert(md != NULL, "Sanity");
3564 __ metadata2reg(md->constant_encoding(), counter_holder);
3565 } else {
3566 ShouldNotReachHere();
3567 }
3568 LIR_Address* counter = new LIR_Address(counter_holder, offset, T_INT);
3569 LIR_Opr result = new_register(T_INT);
3570 __ load(counter, result);
3571 __ add(result, step, result);
3572 __ store(result, counter);
3573 if (notify && (!backedge || UseOnStackReplacement)) {
3574 LIR_Opr meth = LIR_OprFact::metadataConst(method->constant_encoding());
3575 // The bci for info can point to cmp for if's we want the if bci
3576 CodeStub* overflow = new CounterOverflowStub(info, bci, meth);
3577 int freq = frequency << InvocationCounter::count_shift;
3578 if (freq == 0) {
3579 if (!step->is_constant()) {
3580 __ cmp(lir_cond_notEqual, step, LIR_OprFact::intConst(0));
3581 __ branch(lir_cond_notEqual, T_ILLEGAL, overflow);
3582 } else {
3583 __ branch(lir_cond_always, T_ILLEGAL, overflow);
3584 }
3585 } else {
3586 LIR_Opr mask = load_immediate(freq, T_INT);
3587 if (!step->is_constant()) {
3588 // If step is 0, make sure the overflow check below always fails
3589 __ cmp(lir_cond_notEqual, step, LIR_OprFact::intConst(0));
3590 __ cmove(lir_cond_notEqual, result, LIR_OprFact::intConst(InvocationCounter::count_increment), result, T_INT);
3591 }
3592 __ logical_and(result, mask, result);
3593 __ cmp(lir_cond_equal, result, LIR_OprFact::intConst(0));
3594 __ branch(lir_cond_equal, T_INT, overflow);
3595 }
3596 __ branch_destination(overflow->continuation());
3597 }
3598 }
3599
3600 void LIRGenerator::do_RuntimeCall(RuntimeCall* x) {
3601 LIR_OprList* args = new LIR_OprList(x->number_of_arguments());
3602 BasicTypeList* signature = new BasicTypeList(x->number_of_arguments());
3603
3604 if (x->pass_thread()) {
3605 signature->append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
3606 args->append(getThreadPointer());
3607 }
3608
3609 for (int i = 0; i < x->number_of_arguments(); i++) {
3610 Value a = x->argument_at(i);
3611 LIRItem* item = new LIRItem(a, this);
3612 item->load_item();
3613 args->append(item->result());
3614 signature->append(as_BasicType(a->type()));
3615 }
3616
3617 LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL);
3618 if (x->type() == voidType) {
3619 set_no_result(x);
3620 } else {
3621 __ move(result, rlock_result(x));
3622 }
3623 }
3624
3625 #ifdef ASSERT
3626 void LIRGenerator::do_Assert(Assert *x) {
3627 ValueTag tag = x->x()->type()->tag();
3628 If::Condition cond = x->cond();
3629
3630 LIRItem xitem(x->x(), this);
3631 LIRItem yitem(x->y(), this);
3632 LIRItem* xin = &xitem;
3633 LIRItem* yin = &yitem;
3634
3635 assert(tag == intTag, "Only integer assertions are valid!");
3636
3637 xin->load_item();
3638 yin->dont_load_item();
3639
3640 set_no_result(x);
3641
3642 LIR_Opr left = xin->result();
3643 LIR_Opr right = yin->result();
3644
3645 __ lir_assert(lir_cond(x->cond()), left, right, x->message(), true);
3646 }
3647 #endif
3648
3649 void LIRGenerator::do_RangeCheckPredicate(RangeCheckPredicate *x) {
3650
3651
3652 Instruction *a = x->x();
3653 Instruction *b = x->y();
3654 if (!a || StressRangeCheckElimination) {
3655 assert(!b || StressRangeCheckElimination, "B must also be null");
3656
3657 CodeEmitInfo *info = state_for(x, x->state());
3658 CodeStub* stub = new PredicateFailedStub(info);
3659
3660 __ jump(stub);
3661 } else if (a->type()->as_IntConstant() && b->type()->as_IntConstant()) {
3662 int a_int = a->type()->as_IntConstant()->value();
3663 int b_int = b->type()->as_IntConstant()->value();
3664
3665 bool ok = false;
3666
3667 switch(x->cond()) {
3668 case Instruction::eql: ok = (a_int == b_int); break;
3669 case Instruction::neq: ok = (a_int != b_int); break;
3670 case Instruction::lss: ok = (a_int < b_int); break;
3671 case Instruction::leq: ok = (a_int <= b_int); break;
3672 case Instruction::gtr: ok = (a_int > b_int); break;
3673 case Instruction::geq: ok = (a_int >= b_int); break;
3674 case Instruction::aeq: ok = ((unsigned int)a_int >= (unsigned int)b_int); break;
3675 case Instruction::beq: ok = ((unsigned int)a_int <= (unsigned int)b_int); break;
3676 default: ShouldNotReachHere();
3677 }
3678
3679 if (ok) {
3680
3681 CodeEmitInfo *info = state_for(x, x->state());
3682 CodeStub* stub = new PredicateFailedStub(info);
3683
3684 __ jump(stub);
3685 }
3686 } else {
3687
3688 ValueTag tag = x->x()->type()->tag();
3689 If::Condition cond = x->cond();
3690 LIRItem xitem(x->x(), this);
3691 LIRItem yitem(x->y(), this);
3692 LIRItem* xin = &xitem;
3693 LIRItem* yin = &yitem;
3694
3695 assert(tag == intTag, "Only integer deoptimizations are valid!");
3696
3697 xin->load_item();
3698 yin->dont_load_item();
3699 set_no_result(x);
3700
3701 LIR_Opr left = xin->result();
3702 LIR_Opr right = yin->result();
3703
3704 CodeEmitInfo *info = state_for(x, x->state());
3705 CodeStub* stub = new PredicateFailedStub(info);
3706
3707 __ cmp(lir_cond(cond), left, right);
3708 __ branch(lir_cond(cond), right->type(), stub);
3709 }
3710 }
3711
3712
3713 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) {
3714 LIRItemList args(1);
3715 LIRItem value(arg1, this);
3716 args.append(&value);
3717 BasicTypeList signature;
3718 signature.append(as_BasicType(arg1->type()));
3719
3720 return call_runtime(&signature, &args, entry, result_type, info);
3721 }
3722
3723
3724 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) {
3725 LIRItemList args(2);
3726 LIRItem value1(arg1, this);
3727 LIRItem value2(arg2, this);
3728 args.append(&value1);
3729 args.append(&value2);
3730 BasicTypeList signature;
3731 signature.append(as_BasicType(arg1->type()));
3732 signature.append(as_BasicType(arg2->type()));
3733
3734 return call_runtime(&signature, &args, entry, result_type, info);
3735 }
3736
3737
3738 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIR_OprList* args,
3739 address entry, ValueType* result_type, CodeEmitInfo* info) {
3740 // get a result register
3741 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3742 LIR_Opr result = LIR_OprFact::illegalOpr;
3743 if (result_type->tag() != voidTag) {
3744 result = new_register(result_type);
3745 phys_reg = result_register_for(result_type);
3746 }
3747
3748 // move the arguments into the correct location
3749 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3750 assert(cc->length() == args->length(), "argument mismatch");
3751 for (int i = 0; i < args->length(); i++) {
3752 LIR_Opr arg = args->at(i);
3753 LIR_Opr loc = cc->at(i);
3754 if (loc->is_register()) {
3755 __ move(arg, loc);
3756 } else {
3757 LIR_Address* addr = loc->as_address_ptr();
3758 // if (!can_store_as_constant(arg)) {
3759 // LIR_Opr tmp = new_register(arg->type());
3760 // __ move(arg, tmp);
3761 // arg = tmp;
3762 // }
3763 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3764 __ unaligned_move(arg, addr);
3765 } else {
3766 __ move(arg, addr);
3767 }
3768 }
3769 }
3770
3771 if (info) {
3772 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3773 } else {
3774 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3775 }
3776 if (result->is_valid()) {
3777 __ move(phys_reg, result);
3778 }
3779 return result;
3780 }
3781
3782
3783 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIRItemList* args,
3784 address entry, ValueType* result_type, CodeEmitInfo* info) {
3785 // get a result register
3786 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3787 LIR_Opr result = LIR_OprFact::illegalOpr;
3788 if (result_type->tag() != voidTag) {
3789 result = new_register(result_type);
3790 phys_reg = result_register_for(result_type);
3791 }
3792
3793 // move the arguments into the correct location
3794 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3795
3796 assert(cc->length() == args->length(), "argument mismatch");
3797 for (int i = 0; i < args->length(); i++) {
3798 LIRItem* arg = args->at(i);
3799 LIR_Opr loc = cc->at(i);
3800 if (loc->is_register()) {
3801 arg->load_item_force(loc);
3802 } else {
3803 LIR_Address* addr = loc->as_address_ptr();
3804 arg->load_for_store(addr->type());
3805 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3806 __ unaligned_move(arg->result(), addr);
3807 } else {
3808 __ move(arg->result(), addr);
3809 }
3810 }
3811 }
3812
3813 if (info) {
3814 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3815 } else {
3816 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3817 }
3818 if (result->is_valid()) {
3819 __ move(phys_reg, result);
3820 }
3821 return result;
3822 }
3823
3824 void LIRGenerator::do_MemBar(MemBar* x) {
3825 LIR_Code code = x->code();
3826 switch(code) {
3827 case lir_membar_acquire : __ membar_acquire(); break;
3828 case lir_membar_release : __ membar_release(); break;
3829 case lir_membar : __ membar(); break;
3830 case lir_membar_loadload : __ membar_loadload(); break;
3831 case lir_membar_storestore: __ membar_storestore(); break;
3832 case lir_membar_loadstore : __ membar_loadstore(); break;
3833 case lir_membar_storeload : __ membar_storeload(); break;
3834 default : ShouldNotReachHere(); break;
3835 }
3836 }
3837
3838 LIR_Opr LIRGenerator::mask_boolean(LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info) {
3839 LIR_Opr value_fixed = rlock_byte(T_BYTE);
3840 if (TwoOperandLIRForm) {
3841 __ move(value, value_fixed);
3842 __ logical_and(value_fixed, LIR_OprFact::intConst(1), value_fixed);
3843 } else {
3844 __ logical_and(value, LIR_OprFact::intConst(1), value_fixed);
3845 }
3846 LIR_Opr klass = new_register(T_METADATA);
3847 __ move(new LIR_Address(array, oopDesc::klass_offset_in_bytes(), T_ADDRESS), klass, null_check_info);
3848 null_check_info = NULL;
3849 LIR_Opr layout = new_register(T_INT);
3850 __ move(new LIR_Address(klass, in_bytes(Klass::layout_helper_offset()), T_INT), layout);
3851 int diffbit = Klass::layout_helper_boolean_diffbit();
3852 __ logical_and(layout, LIR_OprFact::intConst(diffbit), layout);
3853 __ cmp(lir_cond_notEqual, layout, LIR_OprFact::intConst(0));
3854 __ cmove(lir_cond_notEqual, value_fixed, value, value_fixed, T_BYTE);
3855 value = value_fixed;
3856 return value;
3857 }
3858
3859 LIR_Opr LIRGenerator::maybe_mask_boolean(StoreIndexed* x, LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info) {
3860 if (x->check_boolean()) {
3861 value = mask_boolean(array, value, null_check_info);
3862 }
3863 return value;
3864 }