1 /*
2 * Copyright (c) 2005, 2011, 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_FrameMap.hpp"
28 #include "c1/c1_Instruction.hpp"
29 #include "c1/c1_LIRAssembler.hpp"
30 #include "c1/c1_LIRGenerator.hpp"
31 #include "c1/c1_Runtime1.hpp"
32 #include "c1/c1_ValueStack.hpp"
33 #include "ci/ciArray.hpp"
34 #include "ci/ciObjArrayKlass.hpp"
35 #include "ci/ciTypeArrayKlass.hpp"
36 #include "runtime/sharedRuntime.hpp"
37 #include "runtime/stubRoutines.hpp"
38 #include "vmreg_sparc.inline.hpp"
39
40 #ifdef ASSERT
41 #define __ gen()->lir(__FILE__, __LINE__)->
42 #else
43 #define __ gen()->lir()->
44 #endif
45
46 void LIRItem::load_byte_item() {
47 // byte loads use same registers as other loads
48 load_item();
49 }
50
51
52 void LIRItem::load_nonconstant() {
53 LIR_Opr r = value()->operand();
54 if (_gen->can_inline_as_constant(value())) {
55 if (!r->is_constant()) {
56 r = LIR_OprFact::value_type(value()->type());
57 }
58 _result = r;
59 } else {
60 load_item();
61 }
62 }
63
64
65 //--------------------------------------------------------------
66 // LIRGenerator
67 //--------------------------------------------------------------
68
69 LIR_Opr LIRGenerator::exceptionOopOpr() { return FrameMap::Oexception_opr; }
70 LIR_Opr LIRGenerator::exceptionPcOpr() { return FrameMap::Oissuing_pc_opr; }
71 LIR_Opr LIRGenerator::syncTempOpr() { return new_register(T_OBJECT); }
72 LIR_Opr LIRGenerator::getThreadTemp() { return rlock_callee_saved(T_INT); }
73
74 LIR_Opr LIRGenerator::result_register_for(ValueType* type, bool callee) {
75 LIR_Opr opr;
76 switch (type->tag()) {
77 case intTag: opr = callee ? FrameMap::I0_opr : FrameMap::O0_opr; break;
78 case objectTag: opr = callee ? FrameMap::I0_oop_opr : FrameMap::O0_oop_opr; break;
79 case longTag: opr = callee ? FrameMap::in_long_opr : FrameMap::out_long_opr; break;
80 case floatTag: opr = FrameMap::F0_opr; break;
81 case doubleTag: opr = FrameMap::F0_double_opr; break;
82
83 case addressTag:
84 default: ShouldNotReachHere(); return LIR_OprFact::illegalOpr;
85 }
86
87 assert(opr->type_field() == as_OprType(as_BasicType(type)), "type mismatch");
88 return opr;
89 }
90
91 LIR_Opr LIRGenerator::rlock_callee_saved(BasicType type) {
92 LIR_Opr reg = new_register(type);
93 set_vreg_flag(reg, callee_saved);
94 return reg;
95 }
96
97
98 LIR_Opr LIRGenerator::rlock_byte(BasicType type) {
99 return new_register(T_INT);
100 }
101
102
103
104
105
106 //--------- loading items into registers --------------------------------
107
108 // SPARC cannot inline all constants
109 bool LIRGenerator::can_store_as_constant(Value v, BasicType type) const {
110 if (v->type()->as_IntConstant() != NULL) {
111 return v->type()->as_IntConstant()->value() == 0;
112 } else if (v->type()->as_LongConstant() != NULL) {
113 return v->type()->as_LongConstant()->value() == 0L;
114 } else if (v->type()->as_ObjectConstant() != NULL) {
115 return v->type()->as_ObjectConstant()->value()->is_null_object();
116 } else {
117 return false;
118 }
119 }
120
121
122 // only simm13 constants can be inlined
123 bool LIRGenerator:: can_inline_as_constant(Value i) const {
124 if (i->type()->as_IntConstant() != NULL) {
125 return Assembler::is_simm13(i->type()->as_IntConstant()->value());
126 } else {
127 return can_store_as_constant(i, as_BasicType(i->type()));
128 }
129 }
130
131
132 bool LIRGenerator:: can_inline_as_constant(LIR_Const* c) const {
133 if (c->type() == T_INT) {
134 return Assembler::is_simm13(c->as_jint());
135 }
136 return false;
137 }
138
139
140 LIR_Opr LIRGenerator::safepoint_poll_register() {
141 return new_register(T_INT);
142 }
143
144
145
146 LIR_Address* LIRGenerator::generate_address(LIR_Opr base, LIR_Opr index,
147 int shift, int disp, BasicType type) {
148 assert(base->is_register(), "must be");
149
150 // accumulate fixed displacements
151 if (index->is_constant()) {
152 disp += index->as_constant_ptr()->as_jint() << shift;
153 index = LIR_OprFact::illegalOpr;
154 }
155
156 if (index->is_register()) {
157 // apply the shift and accumulate the displacement
158 if (shift > 0) {
159 LIR_Opr tmp = new_pointer_register();
160 __ shift_left(index, shift, tmp);
161 index = tmp;
162 }
163 if (disp != 0) {
164 LIR_Opr tmp = new_pointer_register();
165 if (Assembler::is_simm13(disp)) {
166 __ add(tmp, LIR_OprFact::intptrConst(disp), tmp);
167 index = tmp;
168 } else {
169 __ move(LIR_OprFact::intptrConst(disp), tmp);
170 __ add(tmp, index, tmp);
171 index = tmp;
172 }
173 disp = 0;
174 }
175 } else if (disp != 0 && !Assembler::is_simm13(disp)) {
176 // index is illegal so replace it with the displacement loaded into a register
177 index = new_pointer_register();
178 __ move(LIR_OprFact::intptrConst(disp), index);
179 disp = 0;
180 }
181
182 // at this point we either have base + index or base + displacement
183 if (disp == 0) {
184 return new LIR_Address(base, index, type);
185 } else {
186 assert(Assembler::is_simm13(disp), "must be");
187 return new LIR_Address(base, disp, type);
188 }
189 }
190
191
192 LIR_Address* LIRGenerator::emit_array_address(LIR_Opr array_opr, LIR_Opr index_opr,
193 BasicType type, bool needs_card_mark) {
194 int elem_size = type2aelembytes(type);
195 int shift = exact_log2(elem_size);
196
197 LIR_Opr base_opr;
198 int offset = arrayOopDesc::base_offset_in_bytes(type);
199
200 if (index_opr->is_constant()) {
201 int i = index_opr->as_constant_ptr()->as_jint();
202 int array_offset = i * elem_size;
203 if (Assembler::is_simm13(array_offset + offset)) {
204 base_opr = array_opr;
205 offset = array_offset + offset;
206 } else {
207 base_opr = new_pointer_register();
208 if (Assembler::is_simm13(array_offset)) {
209 __ add(array_opr, LIR_OprFact::intptrConst(array_offset), base_opr);
210 } else {
211 __ move(LIR_OprFact::intptrConst(array_offset), base_opr);
212 __ add(base_opr, array_opr, base_opr);
213 }
214 }
215 } else {
216 #ifdef _LP64
217 if (index_opr->type() == T_INT) {
218 LIR_Opr tmp = new_register(T_LONG);
219 __ convert(Bytecodes::_i2l, index_opr, tmp);
220 index_opr = tmp;
221 }
222 #endif
223
224 base_opr = new_pointer_register();
225 assert (index_opr->is_register(), "Must be register");
226 if (shift > 0) {
227 __ shift_left(index_opr, shift, base_opr);
228 __ add(base_opr, array_opr, base_opr);
229 } else {
230 __ add(index_opr, array_opr, base_opr);
231 }
232 }
233 if (needs_card_mark) {
234 LIR_Opr ptr = new_pointer_register();
235 __ add(base_opr, LIR_OprFact::intptrConst(offset), ptr);
236 return new LIR_Address(ptr, type);
237 } else {
238 return new LIR_Address(base_opr, offset, type);
239 }
240 }
241
242 LIR_Opr LIRGenerator::load_immediate(int x, BasicType type) {
243 LIR_Opr r;
244 if (type == T_LONG) {
245 r = LIR_OprFact::longConst(x);
246 } else if (type == T_INT) {
247 r = LIR_OprFact::intConst(x);
248 } else {
249 ShouldNotReachHere();
250 }
251 if (!Assembler::is_simm13(x)) {
252 LIR_Opr tmp = new_register(type);
253 __ move(r, tmp);
254 return tmp;
255 }
256 return r;
257 }
258
259 void LIRGenerator::increment_counter(address counter, BasicType type, int step) {
260 LIR_Opr pointer = new_pointer_register();
261 __ move(LIR_OprFact::intptrConst(counter), pointer);
262 LIR_Address* addr = new LIR_Address(pointer, type);
263 increment_counter(addr, step);
264 }
265
266 void LIRGenerator::increment_counter(LIR_Address* addr, int step) {
267 LIR_Opr temp = new_register(addr->type());
268 __ move(addr, temp);
269 __ add(temp, load_immediate(step, addr->type()), temp);
270 __ move(temp, addr);
271 }
272
273 void LIRGenerator::cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info) {
274 LIR_Opr o7opr = FrameMap::O7_opr;
275 __ load(new LIR_Address(base, disp, T_INT), o7opr, info);
276 __ cmp(condition, o7opr, c);
277 }
278
279
280 void LIRGenerator::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, int disp, BasicType type, CodeEmitInfo* info) {
281 LIR_Opr o7opr = FrameMap::O7_opr;
282 __ load(new LIR_Address(base, disp, type), o7opr, info);
283 __ cmp(condition, reg, o7opr);
284 }
285
286
287 void LIRGenerator::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, LIR_Opr disp, BasicType type, CodeEmitInfo* info) {
288 LIR_Opr o7opr = FrameMap::O7_opr;
289 __ load(new LIR_Address(base, disp, type), o7opr, info);
290 __ cmp(condition, reg, o7opr);
291 }
292
293
294 bool LIRGenerator::strength_reduce_multiply(LIR_Opr left, int c, LIR_Opr result, LIR_Opr tmp) {
295 assert(left != result, "should be different registers");
296 if (is_power_of_2(c + 1)) {
297 __ shift_left(left, log2_intptr(c + 1), result);
298 __ sub(result, left, result);
299 return true;
300 } else if (is_power_of_2(c - 1)) {
301 __ shift_left(left, log2_intptr(c - 1), result);
302 __ add(result, left, result);
303 return true;
304 }
305 return false;
306 }
307
308
309 void LIRGenerator::store_stack_parameter (LIR_Opr item, ByteSize offset_from_sp) {
310 BasicType t = item->type();
311 LIR_Opr sp_opr = FrameMap::SP_opr;
312 if ((t == T_LONG || t == T_DOUBLE) &&
313 ((in_bytes(offset_from_sp) - STACK_BIAS) % 8 != 0)) {
314 __ unaligned_move(item, new LIR_Address(sp_opr, in_bytes(offset_from_sp), t));
315 } else {
316 __ move(item, new LIR_Address(sp_opr, in_bytes(offset_from_sp), t));
317 }
318 }
319
320 //----------------------------------------------------------------------
321 // visitor functions
322 //----------------------------------------------------------------------
323
324
325 void LIRGenerator::do_StoreIndexed(StoreIndexed* x) {
326 assert(x->is_pinned(),"");
327 bool needs_range_check = true;
328 bool use_length = x->length() != NULL;
329 bool obj_store = x->elt_type() == T_ARRAY || x->elt_type() == T_OBJECT;
330 bool needs_store_check = obj_store && (x->value()->as_Constant() == NULL ||
331 !get_jobject_constant(x->value())->is_null_object());
332
333 LIRItem array(x->array(), this);
334 LIRItem index(x->index(), this);
335 LIRItem value(x->value(), this);
336 LIRItem length(this);
337
338 array.load_item();
339 index.load_nonconstant();
340
341 if (use_length) {
342 needs_range_check = x->compute_needs_range_check();
343 if (needs_range_check) {
344 length.set_instruction(x->length());
345 length.load_item();
346 }
347 }
348 if (needs_store_check) {
349 value.load_item();
350 } else {
351 value.load_for_store(x->elt_type());
352 }
353
354 set_no_result(x);
355
356 // the CodeEmitInfo must be duplicated for each different
357 // LIR-instruction because spilling can occur anywhere between two
358 // instructions and so the debug information must be different
359 CodeEmitInfo* range_check_info = state_for(x);
360 CodeEmitInfo* null_check_info = NULL;
361 if (x->needs_null_check()) {
362 null_check_info = new CodeEmitInfo(range_check_info);
363 }
364
365 // emit array address setup early so it schedules better
366 LIR_Address* array_addr = emit_array_address(array.result(), index.result(), x->elt_type(), obj_store);
367
368 if (GenerateRangeChecks && needs_range_check) {
369 if (use_length) {
370 __ cmp(lir_cond_belowEqual, length.result(), index.result());
371 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result()));
372 } else {
373 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
374 // range_check also does the null check
375 null_check_info = NULL;
376 }
377 }
378
379 if (GenerateArrayStoreCheck && needs_store_check) {
380 LIR_Opr tmp1 = FrameMap::G1_opr;
381 LIR_Opr tmp2 = FrameMap::G3_opr;
382 LIR_Opr tmp3 = FrameMap::G5_opr;
383
384 CodeEmitInfo* store_check_info = new CodeEmitInfo(range_check_info);
385 __ store_check(value.result(), array.result(), tmp1, tmp2, tmp3, store_check_info);
386 }
387
388 if (obj_store) {
389 // Needs GC write barriers.
390 pre_barrier(LIR_OprFact::address(array_addr), LIR_OprFact::illegalOpr /* pre_val */,
391 true /* do_load */, false /* patch */, NULL);
392 }
393 __ move(value.result(), array_addr, null_check_info);
394 if (obj_store) {
395 // Precise card mark
396 post_barrier(LIR_OprFact::address(array_addr), value.result());
397 }
398 }
399
400
401 void LIRGenerator::do_MonitorEnter(MonitorEnter* x) {
402 assert(x->is_pinned(),"");
403 LIRItem obj(x->obj(), this);
404 obj.load_item();
405
406 set_no_result(x);
407
408 LIR_Opr lock = FrameMap::G1_opr;
409 LIR_Opr scratch = FrameMap::G3_opr;
410 LIR_Opr hdr = FrameMap::G4_opr;
411
412 CodeEmitInfo* info_for_exception = NULL;
413 if (x->needs_null_check()) {
414 info_for_exception = state_for(x);
415 }
416
417 // this CodeEmitInfo must not have the xhandlers because here the
418 // object is already locked (xhandlers expects object to be unlocked)
419 CodeEmitInfo* info = state_for(x, x->state(), true);
420 monitor_enter(obj.result(), lock, hdr, scratch, x->monitor_no(), info_for_exception, info);
421 }
422
423
424 void LIRGenerator::do_MonitorExit(MonitorExit* x) {
425 assert(x->is_pinned(),"");
426 LIRItem obj(x->obj(), this);
427 obj.dont_load_item();
428
429 set_no_result(x);
430 LIR_Opr lock = FrameMap::G1_opr;
431 LIR_Opr hdr = FrameMap::G3_opr;
432 LIR_Opr obj_temp = FrameMap::G4_opr;
433 monitor_exit(obj_temp, lock, hdr, LIR_OprFact::illegalOpr, x->monitor_no());
434 }
435
436
437 // _ineg, _lneg, _fneg, _dneg
438 void LIRGenerator::do_NegateOp(NegateOp* x) {
439 LIRItem value(x->x(), this);
440 value.load_item();
441 LIR_Opr reg = rlock_result(x);
442 __ negate(value.result(), reg);
443 }
444
445
446
447 // for _fadd, _fmul, _fsub, _fdiv, _frem
448 // _dadd, _dmul, _dsub, _ddiv, _drem
449 void LIRGenerator::do_ArithmeticOp_FPU(ArithmeticOp* x) {
450 switch (x->op()) {
451 case Bytecodes::_fadd:
452 case Bytecodes::_fmul:
453 case Bytecodes::_fsub:
454 case Bytecodes::_fdiv:
455 case Bytecodes::_dadd:
456 case Bytecodes::_dmul:
457 case Bytecodes::_dsub:
458 case Bytecodes::_ddiv: {
459 LIRItem left(x->x(), this);
460 LIRItem right(x->y(), this);
461 left.load_item();
462 right.load_item();
463 rlock_result(x);
464 arithmetic_op_fpu(x->op(), x->operand(), left.result(), right.result(), x->is_strictfp());
465 }
466 break;
467
468 case Bytecodes::_frem:
469 case Bytecodes::_drem: {
470 address entry;
471 switch (x->op()) {
472 case Bytecodes::_frem:
473 entry = CAST_FROM_FN_PTR(address, SharedRuntime::frem);
474 break;
475 case Bytecodes::_drem:
476 entry = CAST_FROM_FN_PTR(address, SharedRuntime::drem);
477 break;
478 default:
479 ShouldNotReachHere();
480 }
481 LIR_Opr result = call_runtime(x->x(), x->y(), entry, x->type(), NULL);
482 set_result(x, result);
483 }
484 break;
485
486 default: ShouldNotReachHere();
487 }
488 }
489
490
491 // for _ladd, _lmul, _lsub, _ldiv, _lrem
492 void LIRGenerator::do_ArithmeticOp_Long(ArithmeticOp* x) {
493 switch (x->op()) {
494 case Bytecodes::_lrem:
495 case Bytecodes::_lmul:
496 case Bytecodes::_ldiv: {
497
498 if (x->op() == Bytecodes::_ldiv || x->op() == Bytecodes::_lrem) {
499 LIRItem right(x->y(), this);
500 right.load_item();
501
502 CodeEmitInfo* info = state_for(x);
503 LIR_Opr item = right.result();
504 assert(item->is_register(), "must be");
505 __ cmp(lir_cond_equal, item, LIR_OprFact::longConst(0));
506 __ branch(lir_cond_equal, T_LONG, new DivByZeroStub(info));
507 }
508
509 address entry;
510 switch (x->op()) {
511 case Bytecodes::_lrem:
512 entry = CAST_FROM_FN_PTR(address, SharedRuntime::lrem);
513 break; // check if dividend is 0 is done elsewhere
514 case Bytecodes::_ldiv:
515 entry = CAST_FROM_FN_PTR(address, SharedRuntime::ldiv);
516 break; // check if dividend is 0 is done elsewhere
517 case Bytecodes::_lmul:
518 entry = CAST_FROM_FN_PTR(address, SharedRuntime::lmul);
519 break;
520 default:
521 ShouldNotReachHere();
522 }
523
524 // order of arguments to runtime call is reversed.
525 LIR_Opr result = call_runtime(x->y(), x->x(), entry, x->type(), NULL);
526 set_result(x, result);
527 break;
528 }
529 case Bytecodes::_ladd:
530 case Bytecodes::_lsub: {
531 LIRItem left(x->x(), this);
532 LIRItem right(x->y(), this);
533 left.load_item();
534 right.load_item();
535 rlock_result(x);
536
537 arithmetic_op_long(x->op(), x->operand(), left.result(), right.result(), NULL);
538 break;
539 }
540 default: ShouldNotReachHere();
541 }
542 }
543
544
545 // Returns if item is an int constant that can be represented by a simm13
546 static bool is_simm13(LIR_Opr item) {
547 if (item->is_constant() && item->type() == T_INT) {
548 return Assembler::is_simm13(item->as_constant_ptr()->as_jint());
549 } else {
550 return false;
551 }
552 }
553
554
555 // for: _iadd, _imul, _isub, _idiv, _irem
556 void LIRGenerator::do_ArithmeticOp_Int(ArithmeticOp* x) {
557 bool is_div_rem = x->op() == Bytecodes::_idiv || x->op() == Bytecodes::_irem;
558 LIRItem left(x->x(), this);
559 LIRItem right(x->y(), this);
560 // missing test if instr is commutative and if we should swap
561 right.load_nonconstant();
562 assert(right.is_constant() || right.is_register(), "wrong state of right");
563 left.load_item();
564 rlock_result(x);
565 if (is_div_rem) {
566 CodeEmitInfo* info = state_for(x);
567 LIR_Opr tmp = FrameMap::G1_opr;
568 if (x->op() == Bytecodes::_irem) {
569 __ irem(left.result(), right.result(), x->operand(), tmp, info);
570 } else if (x->op() == Bytecodes::_idiv) {
571 __ idiv(left.result(), right.result(), x->operand(), tmp, info);
572 }
573 } else {
574 arithmetic_op_int(x->op(), x->operand(), left.result(), right.result(), FrameMap::G1_opr);
575 }
576 }
577
578
579 void LIRGenerator::do_ArithmeticOp(ArithmeticOp* x) {
580 ValueTag tag = x->type()->tag();
581 assert(x->x()->type()->tag() == tag && x->y()->type()->tag() == tag, "wrong parameters");
582 switch (tag) {
583 case floatTag:
584 case doubleTag: do_ArithmeticOp_FPU(x); return;
585 case longTag: do_ArithmeticOp_Long(x); return;
586 case intTag: do_ArithmeticOp_Int(x); return;
587 }
588 ShouldNotReachHere();
589 }
590
591
592 // _ishl, _lshl, _ishr, _lshr, _iushr, _lushr
593 void LIRGenerator::do_ShiftOp(ShiftOp* x) {
594 LIRItem value(x->x(), this);
595 LIRItem count(x->y(), this);
596 // Long shift destroys count register
597 if (value.type()->is_long()) {
598 count.set_destroys_register();
599 }
600 value.load_item();
601 // the old backend doesn't support this
602 if (count.is_constant() && count.type()->as_IntConstant() != NULL && value.type()->is_int()) {
603 jint c = count.get_jint_constant() & 0x1f;
604 assert(c >= 0 && c < 32, "should be small");
605 count.dont_load_item();
606 } else {
607 count.load_item();
608 }
609 LIR_Opr reg = rlock_result(x);
610 shift_op(x->op(), reg, value.result(), count.result(), LIR_OprFact::illegalOpr);
611 }
612
613
614 // _iand, _land, _ior, _lor, _ixor, _lxor
615 void LIRGenerator::do_LogicOp(LogicOp* x) {
616 LIRItem left(x->x(), this);
617 LIRItem right(x->y(), this);
618
619 left.load_item();
620 right.load_nonconstant();
621 LIR_Opr reg = rlock_result(x);
622
623 logic_op(x->op(), reg, left.result(), right.result());
624 }
625
626
627
628 // _lcmp, _fcmpl, _fcmpg, _dcmpl, _dcmpg
629 void LIRGenerator::do_CompareOp(CompareOp* x) {
630 LIRItem left(x->x(), this);
631 LIRItem right(x->y(), this);
632 left.load_item();
633 right.load_item();
634 LIR_Opr reg = rlock_result(x);
635 if (x->x()->type()->is_float_kind()) {
636 Bytecodes::Code code = x->op();
637 __ fcmp2int(left.result(), right.result(), reg, (code == Bytecodes::_fcmpl || code == Bytecodes::_dcmpl));
638 } else if (x->x()->type()->tag() == longTag) {
639 __ lcmp2int(left.result(), right.result(), reg);
640 } else {
641 Unimplemented();
642 }
643 }
644
645
646 void LIRGenerator::do_AttemptUpdate(Intrinsic* x) {
647 assert(x->number_of_arguments() == 3, "wrong type");
648 LIRItem obj (x->argument_at(0), this); // AtomicLong object
649 LIRItem cmp_value (x->argument_at(1), this); // value to compare with field
650 LIRItem new_value (x->argument_at(2), this); // replace field with new_value if it matches cmp_value
651
652 obj.load_item();
653 cmp_value.load_item();
654 new_value.load_item();
655
656 // generate compare-and-swap and produce zero condition if swap occurs
657 int value_offset = sun_misc_AtomicLongCSImpl::value_offset();
658 LIR_Opr addr = FrameMap::O7_opr;
659 __ add(obj.result(), LIR_OprFact::intConst(value_offset), addr);
660 LIR_Opr t1 = FrameMap::G1_opr; // temp for 64-bit value
661 LIR_Opr t2 = FrameMap::G3_opr; // temp for 64-bit value
662 __ cas_long(addr, cmp_value.result(), new_value.result(), t1, t2);
663
664 // generate conditional move of boolean result
665 LIR_Opr result = rlock_result(x);
666 __ cmove(lir_cond_equal, LIR_OprFact::intConst(1), LIR_OprFact::intConst(0), result, T_LONG);
667 }
668
669
670 void LIRGenerator::do_CompareAndSwap(Intrinsic* x, ValueType* type) {
671 assert(x->number_of_arguments() == 4, "wrong type");
672 LIRItem obj (x->argument_at(0), this); // object
673 LIRItem offset(x->argument_at(1), this); // offset of field
674 LIRItem cmp (x->argument_at(2), this); // value to compare with field
675 LIRItem val (x->argument_at(3), this); // replace field with val if matches cmp
676
677 // Use temps to avoid kills
678 LIR_Opr t1 = FrameMap::G1_opr;
679 LIR_Opr t2 = FrameMap::G3_opr;
680 LIR_Opr addr = new_pointer_register();
681
682 // get address of field
683 obj.load_item();
684 offset.load_item();
685 cmp.load_item();
686 val.load_item();
687
688 __ add(obj.result(), offset.result(), addr);
689
690 if (type == objectType) { // Write-barrier needed for Object fields.
691 pre_barrier(addr, LIR_OprFact::illegalOpr /* pre_val */,
692 true /* do_load */, false /* patch */, NULL);
693 }
694
695 if (type == objectType)
696 __ cas_obj(addr, cmp.result(), val.result(), t1, t2);
697 else if (type == intType)
698 __ cas_int(addr, cmp.result(), val.result(), t1, t2);
699 else if (type == longType)
700 __ cas_long(addr, cmp.result(), val.result(), t1, t2);
701 else {
702 ShouldNotReachHere();
703 }
704 // generate conditional move of boolean result
705 LIR_Opr result = rlock_result(x);
706 __ cmove(lir_cond_equal, LIR_OprFact::intConst(1), LIR_OprFact::intConst(0),
707 result, as_BasicType(type));
708 if (type == objectType) { // Write-barrier needed for Object fields.
709 // Precise card mark since could either be object or array
710 post_barrier(addr, val.result());
711 }
712 }
713
714
715 void LIRGenerator::do_MathIntrinsic(Intrinsic* x) {
716 switch (x->id()) {
717 case vmIntrinsics::_dabs:
718 case vmIntrinsics::_dsqrt: {
719 assert(x->number_of_arguments() == 1, "wrong type");
720 LIRItem value(x->argument_at(0), this);
721 value.load_item();
722 LIR_Opr dst = rlock_result(x);
723
724 switch (x->id()) {
725 case vmIntrinsics::_dsqrt: {
726 __ sqrt(value.result(), dst, LIR_OprFact::illegalOpr);
727 break;
728 }
729 case vmIntrinsics::_dabs: {
730 __ abs(value.result(), dst, LIR_OprFact::illegalOpr);
731 break;
732 }
733 }
734 break;
735 }
736 case vmIntrinsics::_dlog10: // fall through
737 case vmIntrinsics::_dlog: // fall through
738 case vmIntrinsics::_dsin: // fall through
739 case vmIntrinsics::_dtan: // fall through
740 case vmIntrinsics::_dcos: {
741 assert(x->number_of_arguments() == 1, "wrong type");
742
743 address runtime_entry = NULL;
744 switch (x->id()) {
745 case vmIntrinsics::_dsin:
746 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dsin);
747 break;
748 case vmIntrinsics::_dcos:
749 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dcos);
750 break;
751 case vmIntrinsics::_dtan:
752 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dtan);
753 break;
754 case vmIntrinsics::_dlog:
755 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dlog);
756 break;
757 case vmIntrinsics::_dlog10:
758 runtime_entry = CAST_FROM_FN_PTR(address, SharedRuntime::dlog10);
759 break;
760 default:
761 ShouldNotReachHere();
762 }
763
764 LIR_Opr result = call_runtime(x->argument_at(0), runtime_entry, x->type(), NULL);
765 set_result(x, result);
766 }
767 }
768 }
769
770
771 void LIRGenerator::do_ArrayCopy(Intrinsic* x) {
772 assert(x->number_of_arguments() == 5, "wrong type");
773
774 // Make all state_for calls early since they can emit code
775 CodeEmitInfo* info = state_for(x, x->state());
776
777 // Note: spill caller save before setting the item
778 LIRItem src (x->argument_at(0), this);
779 LIRItem src_pos (x->argument_at(1), this);
780 LIRItem dst (x->argument_at(2), this);
781 LIRItem dst_pos (x->argument_at(3), this);
782 LIRItem length (x->argument_at(4), this);
783 // load all values in callee_save_registers, as this makes the
784 // parameter passing to the fast case simpler
785 src.load_item_force (rlock_callee_saved(T_OBJECT));
786 src_pos.load_item_force (rlock_callee_saved(T_INT));
787 dst.load_item_force (rlock_callee_saved(T_OBJECT));
788 dst_pos.load_item_force (rlock_callee_saved(T_INT));
789 length.load_item_force (rlock_callee_saved(T_INT));
790
791 int flags;
792 ciArrayKlass* expected_type;
793 arraycopy_helper(x, &flags, &expected_type);
794
795 __ arraycopy(src.result(), src_pos.result(), dst.result(), dst_pos.result(),
796 length.result(), rlock_callee_saved(T_INT),
797 expected_type, flags, info);
798 set_no_result(x);
799 }
800
801 // _i2l, _i2f, _i2d, _l2i, _l2f, _l2d, _f2i, _f2l, _f2d, _d2i, _d2l, _d2f
802 // _i2b, _i2c, _i2s
803 void LIRGenerator::do_Convert(Convert* x) {
804
805 switch (x->op()) {
806 case Bytecodes::_f2l:
807 case Bytecodes::_d2l:
808 case Bytecodes::_d2i:
809 case Bytecodes::_l2f:
810 case Bytecodes::_l2d: {
811
812 address entry;
813 switch (x->op()) {
814 case Bytecodes::_l2f:
815 entry = CAST_FROM_FN_PTR(address, SharedRuntime::l2f);
816 break;
817 case Bytecodes::_l2d:
818 entry = CAST_FROM_FN_PTR(address, SharedRuntime::l2d);
819 break;
820 case Bytecodes::_f2l:
821 entry = CAST_FROM_FN_PTR(address, SharedRuntime::f2l);
822 break;
823 case Bytecodes::_d2l:
824 entry = CAST_FROM_FN_PTR(address, SharedRuntime::d2l);
825 break;
826 case Bytecodes::_d2i:
827 entry = CAST_FROM_FN_PTR(address, SharedRuntime::d2i);
828 break;
829 default:
830 ShouldNotReachHere();
831 }
832 LIR_Opr result = call_runtime(x->value(), entry, x->type(), NULL);
833 set_result(x, result);
834 break;
835 }
836
837 case Bytecodes::_i2f:
838 case Bytecodes::_i2d: {
839 LIRItem value(x->value(), this);
840
841 LIR_Opr reg = rlock_result(x);
842 // To convert an int to double, we need to load the 32-bit int
843 // from memory into a single precision floating point register
844 // (even numbered). Then the sparc fitod instruction takes care
845 // of the conversion. This is a bit ugly, but is the best way to
846 // get the int value in a single precision floating point register
847 value.load_item();
848 LIR_Opr tmp = force_to_spill(value.result(), T_FLOAT);
849 __ convert(x->op(), tmp, reg);
850 break;
851 }
852 break;
853
854 case Bytecodes::_i2l:
855 case Bytecodes::_i2b:
856 case Bytecodes::_i2c:
857 case Bytecodes::_i2s:
858 case Bytecodes::_l2i:
859 case Bytecodes::_f2d:
860 case Bytecodes::_d2f: { // inline code
861 LIRItem value(x->value(), this);
862
863 value.load_item();
864 LIR_Opr reg = rlock_result(x);
865 __ convert(x->op(), value.result(), reg, false);
866 }
867 break;
868
869 case Bytecodes::_f2i: {
870 LIRItem value (x->value(), this);
871 value.set_destroys_register();
872 value.load_item();
873 LIR_Opr reg = rlock_result(x);
874 set_vreg_flag(reg, must_start_in_memory);
875 __ convert(x->op(), value.result(), reg, false);
876 }
877 break;
878
879 default: ShouldNotReachHere();
880 }
881 }
882
883
884 void LIRGenerator::do_NewInstance(NewInstance* x) {
885 // This instruction can be deoptimized in the slow path : use
886 // O0 as result register.
887 const LIR_Opr reg = result_register_for(x->type());
888 #ifndef PRODUCT
889 if (PrintNotLoaded && !x->klass()->is_loaded()) {
890 tty->print_cr(" ###class not loaded at new bci %d", x->printable_bci());
891 }
892 #endif
893 CodeEmitInfo* info = state_for(x, x->state());
894 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
895 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
896 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
897 LIR_Opr tmp4 = FrameMap::O1_oop_opr;
898 LIR_Opr klass_reg = FrameMap::G5_oop_opr;
899 new_instance(reg, x->klass(), tmp1, tmp2, tmp3, tmp4, klass_reg, info);
900 LIR_Opr result = rlock_result(x);
901 __ move(reg, result);
902 }
903
904
905 void LIRGenerator::do_NewTypeArray(NewTypeArray* x) {
906 // Evaluate state_for early since it may emit code
907 CodeEmitInfo* info = state_for(x, x->state());
908
909 LIRItem length(x->length(), this);
910 length.load_item();
911
912 LIR_Opr reg = result_register_for(x->type());
913 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
914 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
915 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
916 LIR_Opr tmp4 = FrameMap::O1_oop_opr;
917 LIR_Opr klass_reg = FrameMap::G5_oop_opr;
918 LIR_Opr len = length.result();
919 BasicType elem_type = x->elt_type();
920
921 __ oop2reg(ciTypeArrayKlass::make(elem_type)->constant_encoding(), klass_reg);
922
923 CodeStub* slow_path = new NewTypeArrayStub(klass_reg, len, reg, info);
924 __ allocate_array(reg, len, tmp1, tmp2, tmp3, tmp4, elem_type, klass_reg, slow_path);
925
926 LIR_Opr result = rlock_result(x);
927 __ move(reg, result);
928 }
929
930
931 void LIRGenerator::do_NewObjectArray(NewObjectArray* x) {
932 // Evaluate state_for early since it may emit code.
933 CodeEmitInfo* info = state_for(x, x->state());
934 // in case of patching (i.e., object class is not yet loaded), we need to reexecute the instruction
935 // and therefore provide the state before the parameters have been consumed
936 CodeEmitInfo* patching_info = NULL;
937 if (!x->klass()->is_loaded() || PatchALot) {
938 patching_info = state_for(x, x->state_before());
939 }
940
941 LIRItem length(x->length(), this);
942 length.load_item();
943
944 const LIR_Opr reg = result_register_for(x->type());
945 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
946 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
947 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
948 LIR_Opr tmp4 = FrameMap::O1_oop_opr;
949 LIR_Opr klass_reg = FrameMap::G5_oop_opr;
950 LIR_Opr len = length.result();
951
952 CodeStub* slow_path = new NewObjectArrayStub(klass_reg, len, reg, info);
953 ciObject* obj = (ciObject*) ciObjArrayKlass::make(x->klass());
954 if (obj == ciEnv::unloaded_ciobjarrayklass()) {
955 BAILOUT("encountered unloaded_ciobjarrayklass due to out of memory error");
956 }
957 jobject2reg_with_patching(klass_reg, obj, patching_info);
958 __ allocate_array(reg, len, tmp1, tmp2, tmp3, tmp4, T_OBJECT, klass_reg, slow_path);
959
960 LIR_Opr result = rlock_result(x);
961 __ move(reg, result);
962 }
963
964
965 void LIRGenerator::do_NewMultiArray(NewMultiArray* x) {
966 Values* dims = x->dims();
967 int i = dims->length();
968 LIRItemList* items = new LIRItemList(dims->length(), NULL);
969 while (i-- > 0) {
970 LIRItem* size = new LIRItem(dims->at(i), this);
971 items->at_put(i, size);
972 }
973
974 // Evaluate state_for early since it may emit code.
975 CodeEmitInfo* patching_info = NULL;
976 if (!x->klass()->is_loaded() || PatchALot) {
977 patching_info = state_for(x, x->state_before());
978
979 // cannot re-use same xhandlers for multiple CodeEmitInfos, so
980 // clone all handlers. This is handled transparently in other
981 // places by the CodeEmitInfo cloning logic but is handled
982 // specially here because a stub isn't being used.
983 x->set_exception_handlers(new XHandlers(x->exception_handlers()));
984 }
985 CodeEmitInfo* info = state_for(x, x->state());
986
987 i = dims->length();
988 while (i-- > 0) {
989 LIRItem* size = items->at(i);
990 size->load_item();
991 store_stack_parameter (size->result(),
992 in_ByteSize(STACK_BIAS +
993 frame::memory_parameter_word_sp_offset * wordSize +
994 i * sizeof(jint)));
995 }
996
997 // This instruction can be deoptimized in the slow path : use
998 // O0 as result register.
999 const LIR_Opr reg = result_register_for(x->type());
1000 jobject2reg_with_patching(reg, x->klass(), patching_info);
1001 LIR_Opr rank = FrameMap::O1_opr;
1002 __ move(LIR_OprFact::intConst(x->rank()), rank);
1003 LIR_Opr varargs = FrameMap::as_pointer_opr(O2);
1004 int offset_from_sp = (frame::memory_parameter_word_sp_offset * wordSize) + STACK_BIAS;
1005 __ add(FrameMap::SP_opr,
1006 LIR_OprFact::intptrConst(offset_from_sp),
1007 varargs);
1008 LIR_OprList* args = new LIR_OprList(3);
1009 args->append(reg);
1010 args->append(rank);
1011 args->append(varargs);
1012 __ call_runtime(Runtime1::entry_for(Runtime1::new_multi_array_id),
1013 LIR_OprFact::illegalOpr,
1014 reg, args, info);
1015
1016 LIR_Opr result = rlock_result(x);
1017 __ move(reg, result);
1018 }
1019
1020
1021 void LIRGenerator::do_BlockBegin(BlockBegin* x) {
1022 }
1023
1024
1025 void LIRGenerator::do_CheckCast(CheckCast* x) {
1026 LIRItem obj(x->obj(), this);
1027 CodeEmitInfo* patching_info = NULL;
1028 if (!x->klass()->is_loaded() || (PatchALot && !x->is_incompatible_class_change_check())) {
1029 // must do this before locking the destination register as an oop register,
1030 // and before the obj is loaded (so x->obj()->item() is valid for creating a debug info location)
1031 patching_info = state_for(x, x->state_before());
1032 }
1033 obj.load_item();
1034 LIR_Opr out_reg = rlock_result(x);
1035 CodeStub* stub;
1036 CodeEmitInfo* info_for_exception = state_for(x);
1037
1038 if (x->is_incompatible_class_change_check()) {
1039 assert(patching_info == NULL, "can't patch this");
1040 stub = new SimpleExceptionStub(Runtime1::throw_incompatible_class_change_error_id, LIR_OprFact::illegalOpr, info_for_exception);
1041 } else {
1042 stub = new SimpleExceptionStub(Runtime1::throw_class_cast_exception_id, obj.result(), info_for_exception);
1043 }
1044 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
1045 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
1046 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
1047 __ checkcast(out_reg, obj.result(), x->klass(), tmp1, tmp2, tmp3,
1048 x->direct_compare(), info_for_exception, patching_info, stub,
1049 x->profiled_method(), x->profiled_bci());
1050 }
1051
1052
1053 void LIRGenerator::do_InstanceOf(InstanceOf* x) {
1054 LIRItem obj(x->obj(), this);
1055 CodeEmitInfo* patching_info = NULL;
1056 if (!x->klass()->is_loaded() || PatchALot) {
1057 patching_info = state_for(x, x->state_before());
1058 }
1059 // ensure the result register is not the input register because the result is initialized before the patching safepoint
1060 obj.load_item();
1061 LIR_Opr out_reg = rlock_result(x);
1062 LIR_Opr tmp1 = FrameMap::G1_oop_opr;
1063 LIR_Opr tmp2 = FrameMap::G3_oop_opr;
1064 LIR_Opr tmp3 = FrameMap::G4_oop_opr;
1065 __ instanceof(out_reg, obj.result(), x->klass(), tmp1, tmp2, tmp3,
1066 x->direct_compare(), patching_info,
1067 x->profiled_method(), x->profiled_bci());
1068 }
1069
1070
1071 void LIRGenerator::do_If(If* x) {
1072 assert(x->number_of_sux() == 2, "inconsistency");
1073 ValueTag tag = x->x()->type()->tag();
1074 LIRItem xitem(x->x(), this);
1075 LIRItem yitem(x->y(), this);
1076 LIRItem* xin = &xitem;
1077 LIRItem* yin = &yitem;
1078 If::Condition cond = x->cond();
1079
1080 if (tag == longTag) {
1081 // for longs, only conditions "eql", "neq", "lss", "geq" are valid;
1082 // mirror for other conditions
1083 if (cond == If::gtr || cond == If::leq) {
1084 // swap inputs
1085 cond = Instruction::mirror(cond);
1086 xin = &yitem;
1087 yin = &xitem;
1088 }
1089 xin->set_destroys_register();
1090 }
1091
1092 LIR_Opr left = LIR_OprFact::illegalOpr;
1093 LIR_Opr right = LIR_OprFact::illegalOpr;
1094
1095 xin->load_item();
1096 left = xin->result();
1097
1098 if (is_simm13(yin->result())) {
1099 // inline int constants which are small enough to be immediate operands
1100 right = LIR_OprFact::value_type(yin->value()->type());
1101 } else if (tag == longTag && yin->is_constant() && yin->get_jlong_constant() == 0 &&
1102 (cond == If::eql || cond == If::neq)) {
1103 // inline long zero
1104 right = LIR_OprFact::value_type(yin->value()->type());
1105 } else if (tag == objectTag && yin->is_constant() && (yin->get_jobject_constant()->is_null_object())) {
1106 right = LIR_OprFact::value_type(yin->value()->type());
1107 } else {
1108 yin->load_item();
1109 right = yin->result();
1110 }
1111 set_no_result(x);
1112
1113 // add safepoint before generating condition code so it can be recomputed
1114 if (x->is_safepoint()) {
1115 // increment backedge counter if needed
1116 increment_backedge_counter(state_for(x, x->state_before()), x->profiled_bci());
1117 __ safepoint(new_register(T_INT), state_for(x, x->state_before()));
1118 }
1119
1120 __ cmp(lir_cond(cond), left, right);
1121 // Generate branch profiling. Profiling code doesn't kill flags.
1122 profile_branch(x, cond);
1123 move_to_phi(x->state());
1124 if (x->x()->type()->is_float_kind()) {
1125 __ branch(lir_cond(cond), right->type(), x->tsux(), x->usux());
1126 } else {
1127 __ branch(lir_cond(cond), right->type(), x->tsux());
1128 }
1129 assert(x->default_sux() == x->fsux(), "wrong destination above");
1130 __ jump(x->default_sux());
1131 }
1132
1133
1134 LIR_Opr LIRGenerator::getThreadPointer() {
1135 return FrameMap::as_pointer_opr(G2);
1136 }
1137
1138
1139 void LIRGenerator::trace_block_entry(BlockBegin* block) {
1140 __ move(LIR_OprFact::intConst(block->block_id()), FrameMap::O0_opr);
1141 LIR_OprList* args = new LIR_OprList(1);
1142 args->append(FrameMap::O0_opr);
1143 address func = CAST_FROM_FN_PTR(address, Runtime1::trace_block_entry);
1144 __ call_runtime_leaf(func, rlock_callee_saved(T_INT), LIR_OprFact::illegalOpr, args);
1145 }
1146
1147
1148 void LIRGenerator::volatile_field_store(LIR_Opr value, LIR_Address* address,
1149 CodeEmitInfo* info) {
1150 #ifdef _LP64
1151 __ store(value, address, info);
1152 #else
1153 __ volatile_store_mem_reg(value, address, info);
1154 #endif
1155 }
1156
1157 void LIRGenerator::volatile_field_load(LIR_Address* address, LIR_Opr result,
1158 CodeEmitInfo* info) {
1159 #ifdef _LP64
1160 __ load(address, result, info);
1161 #else
1162 __ volatile_load_mem_reg(address, result, info);
1163 #endif
1164 }
1165
1166
1167 void LIRGenerator::put_Object_unsafe(LIR_Opr src, LIR_Opr offset, LIR_Opr data,
1168 BasicType type, bool is_volatile) {
1169 LIR_Opr base_op = src;
1170 LIR_Opr index_op = offset;
1171
1172 bool is_obj = (type == T_ARRAY || type == T_OBJECT);
1173 #ifndef _LP64
1174 if (is_volatile && type == T_LONG) {
1175 __ volatile_store_unsafe_reg(data, src, offset, type, NULL, lir_patch_none);
1176 } else
1177 #endif
1178 {
1179 if (type == T_BOOLEAN) {
1180 type = T_BYTE;
1181 }
1182 LIR_Address* addr;
1183 if (type == T_ARRAY || type == T_OBJECT) {
1184 LIR_Opr tmp = new_pointer_register();
1185 __ add(base_op, index_op, tmp);
1186 addr = new LIR_Address(tmp, type);
1187 } else {
1188 addr = new LIR_Address(base_op, index_op, type);
1189 }
1190
1191 if (is_obj) {
1192 pre_barrier(LIR_OprFact::address(addr), LIR_OprFact::illegalOpr /* pre_val */,
1193 true /* do_load */, false /* patch */, NULL);
1194 // _bs->c1_write_barrier_pre(this, LIR_OprFact::address(addr));
1195 }
1196 __ move(data, addr);
1197 if (is_obj) {
1198 // This address is precise
1199 post_barrier(LIR_OprFact::address(addr), data);
1200 }
1201 }
1202 }
1203
1204
1205 void LIRGenerator::get_Object_unsafe(LIR_Opr dst, LIR_Opr src, LIR_Opr offset,
1206 BasicType type, bool is_volatile) {
1207 #ifndef _LP64
1208 if (is_volatile && type == T_LONG) {
1209 __ volatile_load_unsafe_reg(src, offset, dst, type, NULL, lir_patch_none);
1210 } else
1211 #endif
1212 {
1213 LIR_Address* addr = new LIR_Address(src, offset, type);
1214 __ load(addr, dst);
1215 }
1216 }