1 /*
2 * Copyright (c) 2005, 2018, 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 "gc/shared/c1/barrierSetC1.hpp"
37 #include "runtime/sharedRuntime.hpp"
38 #include "runtime/stubRoutines.hpp"
39 #include "vmreg_x86.inline.hpp"
40
41 #ifdef ASSERT
42 #define __ gen()->lir(__FILE__, __LINE__)->
43 #else
44 #define __ gen()->lir()->
45 #endif
46
47 // Item will be loaded into a byte register; Intel only
48 void LIRItem::load_byte_item() {
49 load_item();
50 LIR_Opr res = result();
51
52 if (!res->is_virtual() || !_gen->is_vreg_flag_set(res, LIRGenerator::byte_reg)) {
53 // make sure that it is a byte register
54 assert(!value()->type()->is_float() && !value()->type()->is_double(),
55 "can't load floats in byte register");
56 LIR_Opr reg = _gen->rlock_byte(T_BYTE);
57 __ move(res, reg);
58
59 _result = reg;
60 }
61 }
62
63
64 void LIRItem::load_nonconstant() {
65 LIR_Opr r = value()->operand();
66 if (r->is_constant()) {
67 _result = r;
68 } else {
69 load_item();
70 }
71 }
72
73 //--------------------------------------------------------------
74 // LIRGenerator
75 //--------------------------------------------------------------
76
77
78 LIR_Opr LIRGenerator::exceptionOopOpr() { return FrameMap::rax_oop_opr; }
79 LIR_Opr LIRGenerator::exceptionPcOpr() { return FrameMap::rdx_opr; }
80 LIR_Opr LIRGenerator::divInOpr() { return FrameMap::rax_opr; }
81 LIR_Opr LIRGenerator::divOutOpr() { return FrameMap::rax_opr; }
82 LIR_Opr LIRGenerator::remOutOpr() { return FrameMap::rdx_opr; }
83 LIR_Opr LIRGenerator::shiftCountOpr() { return FrameMap::rcx_opr; }
84 LIR_Opr LIRGenerator::syncLockOpr() { return new_register(T_INT); }
85 LIR_Opr LIRGenerator::syncTempOpr() { return FrameMap::rax_opr; }
86 LIR_Opr LIRGenerator::getThreadTemp() { return LIR_OprFact::illegalOpr; }
87
88
89 LIR_Opr LIRGenerator::result_register_for(ValueType* type, bool callee) {
90 LIR_Opr opr;
91 switch (type->tag()) {
92 case intTag: opr = FrameMap::rax_opr; break;
93 case objectTag: opr = FrameMap::rax_oop_opr; break;
94 case longTag: opr = FrameMap::long0_opr; break;
95 case floatTag: opr = UseSSE >= 1 ? FrameMap::xmm0_float_opr : FrameMap::fpu0_float_opr; break;
96 case doubleTag: opr = UseSSE >= 2 ? FrameMap::xmm0_double_opr : FrameMap::fpu0_double_opr; break;
97
98 case addressTag:
99 default: ShouldNotReachHere(); return LIR_OprFact::illegalOpr;
100 }
101
102 assert(opr->type_field() == as_OprType(as_BasicType(type)), "type mismatch");
103 return opr;
104 }
105
106
107 LIR_Opr LIRGenerator::rlock_byte(BasicType type) {
108 LIR_Opr reg = new_register(T_INT);
109 set_vreg_flag(reg, LIRGenerator::byte_reg);
110 return reg;
111 }
112
113
114 //--------- loading items into registers --------------------------------
115
116
117 // i486 instructions can inline constants
118 bool LIRGenerator::can_store_as_constant(Value v, BasicType type) const {
119 if (type == T_SHORT || type == T_CHAR) {
120 // there is no immediate move of word values in asembler_i486.?pp
121 return false;
122 }
123 Constant* c = v->as_Constant();
124 if (c && c->state_before() == NULL) {
125 // constants of any type can be stored directly, except for
126 // unloaded object constants.
127 return true;
128 }
129 return false;
130 }
131
132
133 bool LIRGenerator::can_inline_as_constant(Value v) const {
134 if (v->type()->tag() == longTag) return false;
135 return v->type()->tag() != objectTag ||
136 (v->type()->is_constant() && v->type()->as_ObjectType()->constant_value()->is_null_object());
137 }
138
139
140 bool LIRGenerator::can_inline_as_constant(LIR_Const* c) const {
141 if (c->type() == T_LONG) return false;
142 return c->type() != T_OBJECT || c->as_jobject() == NULL;
143 }
144
145
146 LIR_Opr LIRGenerator::safepoint_poll_register() {
147 NOT_LP64( if (SafepointMechanism::uses_thread_local_poll()) { return new_register(T_ADDRESS); } )
148 return LIR_OprFact::illegalOpr;
149 }
150
151
152 LIR_Address* LIRGenerator::generate_address(LIR_Opr base, LIR_Opr index,
153 int shift, int disp, BasicType type) {
154 assert(base->is_register(), "must be");
155 if (index->is_constant()) {
156 LIR_Const *constant = index->as_constant_ptr();
157 #ifdef _LP64
158 jlong c;
159 if (constant->type() == T_INT) {
160 c = (jlong(index->as_jint()) << shift) + disp;
161 } else {
162 assert(constant->type() == T_LONG, "should be");
163 c = (index->as_jlong() << shift) + disp;
164 }
165 if ((jlong)((jint)c) == c) {
166 return new LIR_Address(base, (jint)c, type);
167 } else {
168 LIR_Opr tmp = new_register(T_LONG);
169 __ move(index, tmp);
170 return new LIR_Address(base, tmp, type);
171 }
172 #else
173 return new LIR_Address(base,
174 ((intx)(constant->as_jint()) << shift) + disp,
175 type);
176 #endif
177 } else {
178 return new LIR_Address(base, index, (LIR_Address::Scale)shift, disp, type);
179 }
180 }
181
182
183 LIR_Address* LIRGenerator::emit_array_address(LIR_Opr array_opr, LIR_Opr index_opr,
184 BasicType type) {
185 int offset_in_bytes = arrayOopDesc::base_offset_in_bytes(type);
186
187 LIR_Address* addr;
188 if (index_opr->is_constant()) {
189 int elem_size = type2aelembytes(type);
190 addr = new LIR_Address(array_opr,
191 offset_in_bytes + (intx)(index_opr->as_jint()) * elem_size, type);
192 } else {
193 #ifdef _LP64
194 if (index_opr->type() == T_INT) {
195 LIR_Opr tmp = new_register(T_LONG);
196 __ convert(Bytecodes::_i2l, index_opr, tmp);
197 index_opr = tmp;
198 }
199 #endif // _LP64
200 addr = new LIR_Address(array_opr,
201 index_opr,
202 LIR_Address::scale(type),
203 offset_in_bytes, type);
204 }
205 return addr;
206 }
207
208
209 LIR_Opr LIRGenerator::load_immediate(int x, BasicType type) {
210 LIR_Opr r = NULL;
211 if (type == T_LONG) {
212 r = LIR_OprFact::longConst(x);
213 } else if (type == T_INT) {
214 r = LIR_OprFact::intConst(x);
215 } else {
216 ShouldNotReachHere();
217 }
218 return r;
219 }
220
221 void LIRGenerator::increment_counter(address counter, BasicType type, int step) {
222 LIR_Opr pointer = new_pointer_register();
223 __ move(LIR_OprFact::intptrConst(counter), pointer);
224 LIR_Address* addr = new LIR_Address(pointer, type);
225 increment_counter(addr, step);
226 }
227
228
229 void LIRGenerator::increment_counter(LIR_Address* addr, int step) {
230 __ add((LIR_Opr)addr, LIR_OprFact::intConst(step), (LIR_Opr)addr);
231 }
232
233 void LIRGenerator::cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info) {
234 __ cmp_mem_int(condition, base, disp, c, info);
235 }
236
237
238 void LIRGenerator::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, int disp, BasicType type, CodeEmitInfo* info) {
239 __ cmp_reg_mem(condition, reg, new LIR_Address(base, disp, type), info);
240 }
241
242
243 bool LIRGenerator::strength_reduce_multiply(LIR_Opr left, jint c, LIR_Opr result, LIR_Opr tmp) {
244 if (tmp->is_valid() && c > 0 && c < max_jint) {
245 if (is_power_of_2(c + 1)) {
246 __ move(left, tmp);
247 __ shift_left(left, log2_intptr(c + 1), left);
248 __ sub(left, tmp, result);
249 return true;
250 } else if (is_power_of_2(c - 1)) {
251 __ move(left, tmp);
252 __ shift_left(left, log2_intptr(c - 1), left);
253 __ add(left, tmp, result);
254 return true;
255 }
256 }
257 return false;
258 }
259
260
261 void LIRGenerator::store_stack_parameter (LIR_Opr item, ByteSize offset_from_sp) {
262 BasicType type = item->type();
263 __ store(item, new LIR_Address(FrameMap::rsp_opr, in_bytes(offset_from_sp), type));
264 }
265
266 void LIRGenerator::array_store_check(LIR_Opr value, LIR_Opr array, CodeEmitInfo* store_check_info, ciMethod* profiled_method, int profiled_bci) {
267 LIR_Opr tmp1 = new_register(objectType);
268 LIR_Opr tmp2 = new_register(objectType);
269 LIR_Opr tmp3 = new_register(objectType);
270 __ store_check(value, array, tmp1, tmp2, tmp3, store_check_info, profiled_method, profiled_bci);
271 }
272
273 //----------------------------------------------------------------------
274 // visitor functions
275 //----------------------------------------------------------------------
276
277 void LIRGenerator::do_MonitorEnter(MonitorEnter* x) {
278 assert(x->is_pinned(),"");
279 LIRItem obj(x->obj(), this);
280 obj.load_item();
281
282 set_no_result(x);
283
284 // "lock" stores the address of the monitor stack slot, so this is not an oop
285 LIR_Opr lock = new_register(T_INT);
286 // Need a scratch register for biased locking on x86
287 LIR_Opr scratch = LIR_OprFact::illegalOpr;
288 if (UseBiasedLocking) {
289 scratch = new_register(T_INT);
290 }
291
292 CodeEmitInfo* info_for_exception = NULL;
293 if (x->needs_null_check()) {
294 info_for_exception = state_for(x);
295 }
296 // this CodeEmitInfo must not have the xhandlers because here the
297 // object is already locked (xhandlers expect object to be unlocked)
298 CodeEmitInfo* info = state_for(x, x->state(), true);
299 LIR_Opr obj_opr = obj.result();
300 DecoratorSet decorators = IN_HEAP;
301 if (!x->needs_null_check()) {
302 decorators |= IS_NOT_NULL;
303 }
304 obj_opr = access_resolve_for_write(decorators, obj_opr, state_for(x));
305 monitor_enter(obj_opr, lock, syncTempOpr(), scratch,
306 x->monitor_no(), info_for_exception, info);
307 }
308
309
310 void LIRGenerator::do_MonitorExit(MonitorExit* x) {
311 assert(x->is_pinned(),"");
312
313 LIRItem obj(x->obj(), this);
314 obj.dont_load_item();
315
316 LIR_Opr lock = new_register(T_INT);
317 LIR_Opr obj_temp = new_register(T_INT);
318 set_no_result(x);
319 monitor_exit(obj_temp, lock, syncTempOpr(), LIR_OprFact::illegalOpr, x->monitor_no());
320 }
321
322
323 // _ineg, _lneg, _fneg, _dneg
324 void LIRGenerator::do_NegateOp(NegateOp* x) {
325 LIRItem value(x->x(), this);
326 value.set_destroys_register();
327 value.load_item();
328 LIR_Opr reg = rlock(x);
329 __ negate(value.result(), reg);
330
331 set_result(x, round_item(reg));
332 }
333
334
335 // for _fadd, _fmul, _fsub, _fdiv, _frem
336 // _dadd, _dmul, _dsub, _ddiv, _drem
337 void LIRGenerator::do_ArithmeticOp_FPU(ArithmeticOp* x) {
338 LIRItem left(x->x(), this);
339 LIRItem right(x->y(), this);
340 LIRItem* left_arg = &left;
341 LIRItem* right_arg = &right;
342 assert(!left.is_stack() || !right.is_stack(), "can't both be memory operands");
343 bool must_load_both = (x->op() == Bytecodes::_frem || x->op() == Bytecodes::_drem);
344 if (left.is_register() || x->x()->type()->is_constant() || must_load_both) {
345 left.load_item();
346 } else {
347 left.dont_load_item();
348 }
349
350 // do not load right operand if it is a constant. only 0 and 1 are
351 // loaded because there are special instructions for loading them
352 // without memory access (not needed for SSE2 instructions)
353 bool must_load_right = false;
354 if (right.is_constant()) {
355 LIR_Const* c = right.result()->as_constant_ptr();
356 assert(c != NULL, "invalid constant");
357 assert(c->type() == T_FLOAT || c->type() == T_DOUBLE, "invalid type");
358
359 if (c->type() == T_FLOAT) {
360 must_load_right = UseSSE < 1 && (c->is_one_float() || c->is_zero_float());
361 } else {
362 must_load_right = UseSSE < 2 && (c->is_one_double() || c->is_zero_double());
363 }
364 }
365
366 if (must_load_both) {
367 // frem and drem destroy also right operand, so move it to a new register
368 right.set_destroys_register();
369 right.load_item();
370 } else if (right.is_register() || must_load_right) {
371 right.load_item();
372 } else {
373 right.dont_load_item();
374 }
375 LIR_Opr reg = rlock(x);
376 LIR_Opr tmp = LIR_OprFact::illegalOpr;
377 if (x->is_strictfp() && (x->op() == Bytecodes::_dmul || x->op() == Bytecodes::_ddiv)) {
378 tmp = new_register(T_DOUBLE);
379 }
380
381 if ((UseSSE >= 1 && x->op() == Bytecodes::_frem) || (UseSSE >= 2 && x->op() == Bytecodes::_drem)) {
382 // special handling for frem and drem: no SSE instruction, so must use FPU with temporary fpu stack slots
383 LIR_Opr fpu0, fpu1;
384 if (x->op() == Bytecodes::_frem) {
385 fpu0 = LIR_OprFact::single_fpu(0);
386 fpu1 = LIR_OprFact::single_fpu(1);
387 } else {
388 fpu0 = LIR_OprFact::double_fpu(0);
389 fpu1 = LIR_OprFact::double_fpu(1);
390 }
391 __ move(right.result(), fpu1); // order of left and right operand is important!
392 __ move(left.result(), fpu0);
393 __ rem (fpu0, fpu1, fpu0);
394 __ move(fpu0, reg);
395
396 } else {
397 arithmetic_op_fpu(x->op(), reg, left.result(), right.result(), x->is_strictfp(), tmp);
398 }
399
400 set_result(x, round_item(reg));
401 }
402
403
404 // for _ladd, _lmul, _lsub, _ldiv, _lrem
405 void LIRGenerator::do_ArithmeticOp_Long(ArithmeticOp* x) {
406 if (x->op() == Bytecodes::_ldiv || x->op() == Bytecodes::_lrem ) {
407 // long division is implemented as a direct call into the runtime
408 LIRItem left(x->x(), this);
409 LIRItem right(x->y(), this);
410
411 // the check for division by zero destroys the right operand
412 right.set_destroys_register();
413
414 BasicTypeList signature(2);
415 signature.append(T_LONG);
416 signature.append(T_LONG);
417 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
418
419 // check for division by zero (destroys registers of right operand!)
420 CodeEmitInfo* info = state_for(x);
421
422 const LIR_Opr result_reg = result_register_for(x->type());
423 left.load_item_force(cc->at(1));
424 right.load_item();
425
426 __ move(right.result(), cc->at(0));
427
428 __ cmp(lir_cond_equal, right.result(), LIR_OprFact::longConst(0));
429 __ branch(lir_cond_equal, T_LONG, new DivByZeroStub(info));
430
431 address entry = NULL;
432 switch (x->op()) {
433 case Bytecodes::_lrem:
434 entry = CAST_FROM_FN_PTR(address, SharedRuntime::lrem);
435 break; // check if dividend is 0 is done elsewhere
436 case Bytecodes::_ldiv:
437 entry = CAST_FROM_FN_PTR(address, SharedRuntime::ldiv);
438 break; // check if dividend is 0 is done elsewhere
439 case Bytecodes::_lmul:
440 entry = CAST_FROM_FN_PTR(address, SharedRuntime::lmul);
441 break;
442 default:
443 ShouldNotReachHere();
444 }
445
446 LIR_Opr result = rlock_result(x);
447 __ call_runtime_leaf(entry, getThreadTemp(), result_reg, cc->args());
448 __ move(result_reg, result);
449 } else if (x->op() == Bytecodes::_lmul) {
450 // missing test if instr is commutative and if we should swap
451 LIRItem left(x->x(), this);
452 LIRItem right(x->y(), this);
453
454 // right register is destroyed by the long mul, so it must be
455 // copied to a new register.
456 right.set_destroys_register();
457
458 left.load_item();
459 right.load_item();
460
461 LIR_Opr reg = FrameMap::long0_opr;
462 arithmetic_op_long(x->op(), reg, left.result(), right.result(), NULL);
463 LIR_Opr result = rlock_result(x);
464 __ move(reg, result);
465 } else {
466 // missing test if instr is commutative and if we should swap
467 LIRItem left(x->x(), this);
468 LIRItem right(x->y(), this);
469
470 left.load_item();
471 // don't load constants to save register
472 right.load_nonconstant();
473 rlock_result(x);
474 arithmetic_op_long(x->op(), x->operand(), left.result(), right.result(), NULL);
475 }
476 }
477
478
479
480 // for: _iadd, _imul, _isub, _idiv, _irem
481 void LIRGenerator::do_ArithmeticOp_Int(ArithmeticOp* x) {
482 if (x->op() == Bytecodes::_idiv || x->op() == Bytecodes::_irem) {
483 // The requirements for division and modulo
484 // input : rax,: dividend min_int
485 // reg: divisor (may not be rax,/rdx) -1
486 //
487 // output: rax,: quotient (= rax, idiv reg) min_int
488 // rdx: remainder (= rax, irem reg) 0
489
490 // rax, and rdx will be destroyed
491
492 // Note: does this invalidate the spec ???
493 LIRItem right(x->y(), this);
494 LIRItem left(x->x() , this); // visit left second, so that the is_register test is valid
495
496 // call state_for before load_item_force because state_for may
497 // force the evaluation of other instructions that are needed for
498 // correct debug info. Otherwise the live range of the fix
499 // register might be too long.
500 CodeEmitInfo* info = state_for(x);
501
502 left.load_item_force(divInOpr());
503
504 right.load_item();
505
506 LIR_Opr result = rlock_result(x);
507 LIR_Opr result_reg;
508 if (x->op() == Bytecodes::_idiv) {
509 result_reg = divOutOpr();
510 } else {
511 result_reg = remOutOpr();
512 }
513
514 if (!ImplicitDiv0Checks) {
515 __ cmp(lir_cond_equal, right.result(), LIR_OprFact::intConst(0));
516 __ branch(lir_cond_equal, T_INT, new DivByZeroStub(info));
517 // Idiv/irem cannot trap (passing info would generate an assertion).
518 info = NULL;
519 }
520 LIR_Opr tmp = FrameMap::rdx_opr; // idiv and irem use rdx in their implementation
521 if (x->op() == Bytecodes::_irem) {
522 __ irem(left.result(), right.result(), result_reg, tmp, info);
523 } else if (x->op() == Bytecodes::_idiv) {
524 __ idiv(left.result(), right.result(), result_reg, tmp, info);
525 } else {
526 ShouldNotReachHere();
527 }
528
529 __ move(result_reg, result);
530 } else {
531 // missing test if instr is commutative and if we should swap
532 LIRItem left(x->x(), this);
533 LIRItem right(x->y(), this);
534 LIRItem* left_arg = &left;
535 LIRItem* right_arg = &right;
536 if (x->is_commutative() && left.is_stack() && right.is_register()) {
537 // swap them if left is real stack (or cached) and right is real register(not cached)
538 left_arg = &right;
539 right_arg = &left;
540 }
541
542 left_arg->load_item();
543
544 // do not need to load right, as we can handle stack and constants
545 if (x->op() == Bytecodes::_imul ) {
546 // check if we can use shift instead
547 bool use_constant = false;
548 bool use_tmp = false;
549 if (right_arg->is_constant()) {
550 jint iconst = right_arg->get_jint_constant();
551 if (iconst > 0 && iconst < max_jint) {
552 if (is_power_of_2(iconst)) {
553 use_constant = true;
554 } else if (is_power_of_2(iconst - 1) || is_power_of_2(iconst + 1)) {
555 use_constant = true;
556 use_tmp = true;
557 }
558 }
559 }
560 if (use_constant) {
561 right_arg->dont_load_item();
562 } else {
563 right_arg->load_item();
564 }
565 LIR_Opr tmp = LIR_OprFact::illegalOpr;
566 if (use_tmp) {
567 tmp = new_register(T_INT);
568 }
569 rlock_result(x);
570
571 arithmetic_op_int(x->op(), x->operand(), left_arg->result(), right_arg->result(), tmp);
572 } else {
573 right_arg->dont_load_item();
574 rlock_result(x);
575 LIR_Opr tmp = LIR_OprFact::illegalOpr;
576 arithmetic_op_int(x->op(), x->operand(), left_arg->result(), right_arg->result(), tmp);
577 }
578 }
579 }
580
581
582 void LIRGenerator::do_ArithmeticOp(ArithmeticOp* x) {
583 // when an operand with use count 1 is the left operand, then it is
584 // likely that no move for 2-operand-LIR-form is necessary
585 if (x->is_commutative() && x->y()->as_Constant() == NULL && x->x()->use_count() > x->y()->use_count()) {
586 x->swap_operands();
587 }
588
589 ValueTag tag = x->type()->tag();
590 assert(x->x()->type()->tag() == tag && x->y()->type()->tag() == tag, "wrong parameters");
591 switch (tag) {
592 case floatTag:
593 case doubleTag: do_ArithmeticOp_FPU(x); return;
594 case longTag: do_ArithmeticOp_Long(x); return;
595 case intTag: do_ArithmeticOp_Int(x); return;
596 default: ShouldNotReachHere(); return;
597 }
598 }
599
600
601 // _ishl, _lshl, _ishr, _lshr, _iushr, _lushr
602 void LIRGenerator::do_ShiftOp(ShiftOp* x) {
603 // count must always be in rcx
604 LIRItem value(x->x(), this);
605 LIRItem count(x->y(), this);
606
607 ValueTag elemType = x->type()->tag();
608 bool must_load_count = !count.is_constant() || elemType == longTag;
609 if (must_load_count) {
610 // count for long must be in register
611 count.load_item_force(shiftCountOpr());
612 } else {
613 count.dont_load_item();
614 }
615 value.load_item();
616 LIR_Opr reg = rlock_result(x);
617
618 shift_op(x->op(), reg, value.result(), count.result(), LIR_OprFact::illegalOpr);
619 }
620
621
622 // _iand, _land, _ior, _lor, _ixor, _lxor
623 void LIRGenerator::do_LogicOp(LogicOp* x) {
624 // when an operand with use count 1 is the left operand, then it is
625 // likely that no move for 2-operand-LIR-form is necessary
626 if (x->is_commutative() && x->y()->as_Constant() == NULL && x->x()->use_count() > x->y()->use_count()) {
627 x->swap_operands();
628 }
629
630 LIRItem left(x->x(), this);
631 LIRItem right(x->y(), this);
632
633 left.load_item();
634 right.load_nonconstant();
635 LIR_Opr reg = rlock_result(x);
636
637 logic_op(x->op(), reg, left.result(), right.result());
638 }
639
640
641
642 // _lcmp, _fcmpl, _fcmpg, _dcmpl, _dcmpg
643 void LIRGenerator::do_CompareOp(CompareOp* x) {
644 LIRItem left(x->x(), this);
645 LIRItem right(x->y(), this);
646 ValueTag tag = x->x()->type()->tag();
647 if (tag == longTag) {
648 left.set_destroys_register();
649 }
650 left.load_item();
651 right.load_item();
652 LIR_Opr reg = rlock_result(x);
653
654 if (x->x()->type()->is_float_kind()) {
655 Bytecodes::Code code = x->op();
656 __ fcmp2int(left.result(), right.result(), reg, (code == Bytecodes::_fcmpl || code == Bytecodes::_dcmpl));
657 } else if (x->x()->type()->tag() == longTag) {
658 __ lcmp2int(left.result(), right.result(), reg);
659 } else {
660 Unimplemented();
661 }
662 }
663
664 LIR_Opr LIRGenerator::atomic_cmpxchg(BasicType type, LIR_Opr addr, LIRItem& cmp_value, LIRItem& new_value) {
665 LIR_Opr ill = LIR_OprFact::illegalOpr; // for convenience
666 if (type == T_OBJECT || type == T_ARRAY) {
667 cmp_value.load_item_force(FrameMap::rax_oop_opr);
668 new_value.load_item();
669 __ cas_obj(addr->as_address_ptr()->base(), cmp_value.result(), new_value.result(), new_register(T_OBJECT), new_register(T_OBJECT));
670 } else if (type == T_INT) {
671 cmp_value.load_item_force(FrameMap::rax_opr);
672 new_value.load_item();
673 __ cas_int(addr->as_address_ptr()->base(), cmp_value.result(), new_value.result(), ill, ill);
674 } else if (type == T_LONG) {
675 cmp_value.load_item_force(FrameMap::long0_opr);
676 new_value.load_item_force(FrameMap::long1_opr);
677 __ cas_long(addr->as_address_ptr()->base(), cmp_value.result(), new_value.result(), ill, ill);
678 } else {
679 Unimplemented();
680 }
681 LIR_Opr result = new_register(T_INT);
682 __ cmove(lir_cond_equal, LIR_OprFact::intConst(1), LIR_OprFact::intConst(0),
683 result, type);
684 return result;
685 }
686
687 LIR_Opr LIRGenerator::atomic_xchg(BasicType type, LIR_Opr addr, LIRItem& value) {
688 bool is_oop = type == T_OBJECT || type == T_ARRAY;
689 LIR_Opr result = new_register(type);
690 value.load_item();
691 // Because we want a 2-arg form of xchg and xadd
692 __ move(value.result(), result);
693 assert(type == T_INT || is_oop LP64_ONLY( || type == T_LONG ), "unexpected type");
694 LIR_Opr tmp = is_oop ? new_register(type) : LIR_OprFact::illegalOpr;
695 __ xchg(addr, result, result, tmp);
696 return result;
697 }
698
699 LIR_Opr LIRGenerator::atomic_add(BasicType type, LIR_Opr addr, LIRItem& value) {
700 LIR_Opr result = new_register(type);
701 value.load_item();
702 // Because we want a 2-arg form of xchg and xadd
703 __ move(value.result(), result);
704 assert(type == T_INT LP64_ONLY( || type == T_LONG ), "unexpected type");
705 __ xadd(addr, result, result, LIR_OprFact::illegalOpr);
706 return result;
707 }
708
709 void LIRGenerator::do_FmaIntrinsic(Intrinsic* x) {
710 assert(x->number_of_arguments() == 3, "wrong type");
711 assert(UseFMA, "Needs FMA instructions support.");
712 LIRItem value(x->argument_at(0), this);
713 LIRItem value1(x->argument_at(1), this);
714 LIRItem value2(x->argument_at(2), this);
715
716 value2.set_destroys_register();
717
718 value.load_item();
719 value1.load_item();
720 value2.load_item();
721
722 LIR_Opr calc_input = value.result();
723 LIR_Opr calc_input1 = value1.result();
724 LIR_Opr calc_input2 = value2.result();
725 LIR_Opr calc_result = rlock_result(x);
726
727 switch (x->id()) {
728 case vmIntrinsics::_fmaD: __ fmad(calc_input, calc_input1, calc_input2, calc_result); break;
729 case vmIntrinsics::_fmaF: __ fmaf(calc_input, calc_input1, calc_input2, calc_result); break;
730 default: ShouldNotReachHere();
731 }
732
733 }
734
735
736 void LIRGenerator::do_MathIntrinsic(Intrinsic* x) {
737 assert(x->number_of_arguments() == 1 || (x->number_of_arguments() == 2 && x->id() == vmIntrinsics::_dpow), "wrong type");
738
739 if (x->id() == vmIntrinsics::_dexp || x->id() == vmIntrinsics::_dlog ||
740 x->id() == vmIntrinsics::_dpow || x->id() == vmIntrinsics::_dcos ||
741 x->id() == vmIntrinsics::_dsin || x->id() == vmIntrinsics::_dtan ||
742 x->id() == vmIntrinsics::_dlog10) {
743 do_LibmIntrinsic(x);
744 return;
745 }
746
747 LIRItem value(x->argument_at(0), this);
748
749 bool use_fpu = false;
750 if (UseSSE < 2) {
751 value.set_destroys_register();
752 }
753 value.load_item();
754
755 LIR_Opr calc_input = value.result();
756 LIR_Opr calc_result = rlock_result(x);
757
758 switch(x->id()) {
759 case vmIntrinsics::_dabs: __ abs (calc_input, calc_result, LIR_OprFact::illegalOpr); break;
760 case vmIntrinsics::_dsqrt: __ sqrt (calc_input, calc_result, LIR_OprFact::illegalOpr); break;
761 default: ShouldNotReachHere();
762 }
763
764 if (use_fpu) {
765 __ move(calc_result, x->operand());
766 }
767 }
768
769 void LIRGenerator::do_LibmIntrinsic(Intrinsic* x) {
770 LIRItem value(x->argument_at(0), this);
771 value.set_destroys_register();
772
773 LIR_Opr calc_result = rlock_result(x);
774 LIR_Opr result_reg = result_register_for(x->type());
775
776 CallingConvention* cc = NULL;
777
778 if (x->id() == vmIntrinsics::_dpow) {
779 LIRItem value1(x->argument_at(1), this);
780
781 value1.set_destroys_register();
782
783 BasicTypeList signature(2);
784 signature.append(T_DOUBLE);
785 signature.append(T_DOUBLE);
786 cc = frame_map()->c_calling_convention(&signature);
787 value.load_item_force(cc->at(0));
788 value1.load_item_force(cc->at(1));
789 } else {
790 BasicTypeList signature(1);
791 signature.append(T_DOUBLE);
792 cc = frame_map()->c_calling_convention(&signature);
793 value.load_item_force(cc->at(0));
794 }
795
796 #ifndef _LP64
797 LIR_Opr tmp = FrameMap::fpu0_double_opr;
798 result_reg = tmp;
799 switch(x->id()) {
800 case vmIntrinsics::_dexp:
801 if (StubRoutines::dexp() != NULL) {
802 __ call_runtime_leaf(StubRoutines::dexp(), getThreadTemp(), result_reg, cc->args());
803 } else {
804 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dexp), getThreadTemp(), result_reg, cc->args());
805 }
806 break;
807 case vmIntrinsics::_dlog:
808 if (StubRoutines::dlog() != NULL) {
809 __ call_runtime_leaf(StubRoutines::dlog(), getThreadTemp(), result_reg, cc->args());
810 } else {
811 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dlog), getThreadTemp(), result_reg, cc->args());
812 }
813 break;
814 case vmIntrinsics::_dlog10:
815 if (StubRoutines::dlog10() != NULL) {
816 __ call_runtime_leaf(StubRoutines::dlog10(), getThreadTemp(), result_reg, cc->args());
817 } else {
818 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dlog10), getThreadTemp(), result_reg, cc->args());
819 }
820 break;
821 case vmIntrinsics::_dpow:
822 if (StubRoutines::dpow() != NULL) {
823 __ call_runtime_leaf(StubRoutines::dpow(), getThreadTemp(), result_reg, cc->args());
824 } else {
825 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dpow), getThreadTemp(), result_reg, cc->args());
826 }
827 break;
828 case vmIntrinsics::_dsin:
829 if (VM_Version::supports_sse2() && StubRoutines::dsin() != NULL) {
830 __ call_runtime_leaf(StubRoutines::dsin(), getThreadTemp(), result_reg, cc->args());
831 } else {
832 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dsin), getThreadTemp(), result_reg, cc->args());
833 }
834 break;
835 case vmIntrinsics::_dcos:
836 if (VM_Version::supports_sse2() && StubRoutines::dcos() != NULL) {
837 __ call_runtime_leaf(StubRoutines::dcos(), getThreadTemp(), result_reg, cc->args());
838 } else {
839 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dcos), getThreadTemp(), result_reg, cc->args());
840 }
841 break;
842 case vmIntrinsics::_dtan:
843 if (StubRoutines::dtan() != NULL) {
844 __ call_runtime_leaf(StubRoutines::dtan(), getThreadTemp(), result_reg, cc->args());
845 } else {
846 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dtan), getThreadTemp(), result_reg, cc->args());
847 }
848 break;
849 default: ShouldNotReachHere();
850 }
851 #else
852 switch (x->id()) {
853 case vmIntrinsics::_dexp:
854 if (StubRoutines::dexp() != NULL) {
855 __ call_runtime_leaf(StubRoutines::dexp(), getThreadTemp(), result_reg, cc->args());
856 } else {
857 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dexp), getThreadTemp(), result_reg, cc->args());
858 }
859 break;
860 case vmIntrinsics::_dlog:
861 if (StubRoutines::dlog() != NULL) {
862 __ call_runtime_leaf(StubRoutines::dlog(), getThreadTemp(), result_reg, cc->args());
863 } else {
864 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dlog), getThreadTemp(), result_reg, cc->args());
865 }
866 break;
867 case vmIntrinsics::_dlog10:
868 if (StubRoutines::dlog10() != NULL) {
869 __ call_runtime_leaf(StubRoutines::dlog10(), getThreadTemp(), result_reg, cc->args());
870 } else {
871 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dlog10), getThreadTemp(), result_reg, cc->args());
872 }
873 break;
874 case vmIntrinsics::_dpow:
875 if (StubRoutines::dpow() != NULL) {
876 __ call_runtime_leaf(StubRoutines::dpow(), getThreadTemp(), result_reg, cc->args());
877 } else {
878 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dpow), getThreadTemp(), result_reg, cc->args());
879 }
880 break;
881 case vmIntrinsics::_dsin:
882 if (StubRoutines::dsin() != NULL) {
883 __ call_runtime_leaf(StubRoutines::dsin(), getThreadTemp(), result_reg, cc->args());
884 } else {
885 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dsin), getThreadTemp(), result_reg, cc->args());
886 }
887 break;
888 case vmIntrinsics::_dcos:
889 if (StubRoutines::dcos() != NULL) {
890 __ call_runtime_leaf(StubRoutines::dcos(), getThreadTemp(), result_reg, cc->args());
891 } else {
892 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dcos), getThreadTemp(), result_reg, cc->args());
893 }
894 break;
895 case vmIntrinsics::_dtan:
896 if (StubRoutines::dtan() != NULL) {
897 __ call_runtime_leaf(StubRoutines::dtan(), getThreadTemp(), result_reg, cc->args());
898 } else {
899 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::dtan), getThreadTemp(), result_reg, cc->args());
900 }
901 break;
902 default: ShouldNotReachHere();
903 }
904 #endif // _LP64
905 __ move(result_reg, calc_result);
906 }
907
908 void LIRGenerator::do_ArrayCopy(Intrinsic* x) {
909 assert(x->number_of_arguments() == 5, "wrong type");
910
911 // Make all state_for calls early since they can emit code
912 CodeEmitInfo* info = state_for(x, x->state());
913
914 LIRItem src(x->argument_at(0), this);
915 LIRItem src_pos(x->argument_at(1), this);
916 LIRItem dst(x->argument_at(2), this);
917 LIRItem dst_pos(x->argument_at(3), this);
918 LIRItem length(x->argument_at(4), this);
919
920 dst.load_item();
921 LIR_Opr dst_op = dst.result();
922 DecoratorSet decorators = IN_HEAP;
923 if (!x->arg_needs_null_check(2)) {
924 decorators |= IS_NOT_NULL;
925 }
926 dst_op = access_resolve_for_write(decorators, dst_op, info);
927 src.load_item();
928 LIR_Opr src_op = src.result();
929 decorators = IN_HEAP;
930 if (!x->arg_needs_null_check(0)) {
931 decorators |= IS_NOT_NULL;
932 }
933 src_op = access_resolve_for_read(decorators, src_op, info);
934
935 // operands for arraycopy must use fixed registers, otherwise
936 // LinearScan will fail allocation (because arraycopy always needs a
937 // call)
938
939 #ifndef _LP64
940 src_op = force_opr_to(src_op, FrameMap::rcx_oop_opr);
941 src_pos.load_item_force (FrameMap::rdx_opr);
942 dst_op = force_opr_to(dst_op, FrameMap::rax_oop_opr);
943 dst_pos.load_item_force (FrameMap::rbx_opr);
944 length.load_item_force (FrameMap::rdi_opr);
945 LIR_Opr tmp = (FrameMap::rsi_opr);
946 #else
947
948 // The java calling convention will give us enough registers
949 // so that on the stub side the args will be perfect already.
950 // On the other slow/special case side we call C and the arg
951 // positions are not similar enough to pick one as the best.
952 // Also because the java calling convention is a "shifted" version
953 // of the C convention we can process the java args trivially into C
954 // args without worry of overwriting during the xfer
955
956 src_op = force_opr_to(src_op, FrameMap::as_oop_opr(j_rarg0));
957 src_pos.load_item_force (FrameMap::as_opr(j_rarg1));
958 dst_op = force_opr_to(dst_op, FrameMap::as_oop_opr(j_rarg2));
959 dst_pos.load_item_force (FrameMap::as_opr(j_rarg3));
960 length.load_item_force (FrameMap::as_opr(j_rarg4));
961
962 LIR_Opr tmp = FrameMap::as_opr(j_rarg5);
963 #endif // LP64
964
965 set_no_result(x);
966
967 int flags;
968 ciArrayKlass* expected_type;
969 arraycopy_helper(x, &flags, &expected_type);
970
971 __ arraycopy(src_op, src_pos.result(), dst_op, dst_pos.result(), length.result(), tmp, expected_type, flags, info); // does add_safepoint
972 }
973
974 void LIRGenerator::do_update_CRC32(Intrinsic* x) {
975 assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support");
976 // Make all state_for calls early since they can emit code
977 LIR_Opr result = rlock_result(x);
978 int flags = 0;
979 switch (x->id()) {
980 case vmIntrinsics::_updateCRC32: {
981 LIRItem crc(x->argument_at(0), this);
982 LIRItem val(x->argument_at(1), this);
983 // val is destroyed by update_crc32
984 val.set_destroys_register();
985 crc.load_item();
986 val.load_item();
987 __ update_crc32(crc.result(), val.result(), result);
988 break;
989 }
990 case vmIntrinsics::_updateBytesCRC32:
991 case vmIntrinsics::_updateByteBufferCRC32: {
992 bool is_updateBytes = (x->id() == vmIntrinsics::_updateBytesCRC32);
993
994 LIRItem crc(x->argument_at(0), this);
995 LIRItem buf(x->argument_at(1), this);
996 LIRItem off(x->argument_at(2), this);
997 LIRItem len(x->argument_at(3), this);
998 buf.load_item();
999 off.load_nonconstant();
1000
1001 LIR_Opr index = off.result();
1002 int offset = is_updateBytes ? arrayOopDesc::base_offset_in_bytes(T_BYTE) : 0;
1003 if(off.result()->is_constant()) {
1004 index = LIR_OprFact::illegalOpr;
1005 offset += off.result()->as_jint();
1006 }
1007 LIR_Opr base_op = buf.result();
1008
1009 #ifndef _LP64
1010 if (!is_updateBytes) { // long b raw address
1011 base_op = new_register(T_INT);
1012 __ convert(Bytecodes::_l2i, buf.result(), base_op);
1013 }
1014 #else
1015 if (index->is_valid()) {
1016 LIR_Opr tmp = new_register(T_LONG);
1017 __ convert(Bytecodes::_i2l, index, tmp);
1018 index = tmp;
1019 }
1020 #endif
1021
1022 if (is_updateBytes) {
1023 base_op = access_resolve_for_read(IN_HEAP | IS_NOT_NULL, base_op, NULL);
1024 }
1025
1026 LIR_Address* a = new LIR_Address(base_op,
1027 index,
1028 offset,
1029 T_BYTE);
1030 BasicTypeList signature(3);
1031 signature.append(T_INT);
1032 signature.append(T_ADDRESS);
1033 signature.append(T_INT);
1034 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
1035 const LIR_Opr result_reg = result_register_for(x->type());
1036
1037 LIR_Opr addr = new_pointer_register();
1038 __ leal(LIR_OprFact::address(a), addr);
1039
1040 crc.load_item_force(cc->at(0));
1041 __ move(addr, cc->at(1));
1042 len.load_item_force(cc->at(2));
1043
1044 __ call_runtime_leaf(StubRoutines::updateBytesCRC32(), getThreadTemp(), result_reg, cc->args());
1045 __ move(result_reg, result);
1046
1047 break;
1048 }
1049 default: {
1050 ShouldNotReachHere();
1051 }
1052 }
1053 }
1054
1055 void LIRGenerator::do_update_CRC32C(Intrinsic* x) {
1056 Unimplemented();
1057 }
1058
1059 void LIRGenerator::do_vectorizedMismatch(Intrinsic* x) {
1060 assert(UseVectorizedMismatchIntrinsic, "need AVX instruction support");
1061
1062 // Make all state_for calls early since they can emit code
1063 LIR_Opr result = rlock_result(x);
1064
1065 LIRItem a(x->argument_at(0), this); // Object
1066 LIRItem aOffset(x->argument_at(1), this); // long
1067 LIRItem b(x->argument_at(2), this); // Object
1068 LIRItem bOffset(x->argument_at(3), this); // long
1069 LIRItem length(x->argument_at(4), this); // int
1070 LIRItem log2ArrayIndexScale(x->argument_at(5), this); // int
1071
1072 a.load_item();
1073 aOffset.load_nonconstant();
1074 b.load_item();
1075 bOffset.load_nonconstant();
1076
1077 long constant_aOffset = 0;
1078 LIR_Opr result_aOffset = aOffset.result();
1079 if (result_aOffset->is_constant()) {
1080 constant_aOffset = result_aOffset->as_jlong();
1081 result_aOffset = LIR_OprFact::illegalOpr;
1082 }
1083 LIR_Opr result_a = a.result();
1084 result_a = access_resolve_for_read(IN_HEAP, result_a, NULL);
1085
1086 long constant_bOffset = 0;
1087 LIR_Opr result_bOffset = bOffset.result();
1088 if (result_bOffset->is_constant()) {
1089 constant_bOffset = result_bOffset->as_jlong();
1090 result_bOffset = LIR_OprFact::illegalOpr;
1091 }
1092 LIR_Opr result_b = b.result();
1093 result_b = access_resolve_for_read(IN_HEAP, result_b, NULL);
1094
1095 #ifndef _LP64
1096 result_a = new_register(T_INT);
1097 __ convert(Bytecodes::_l2i, a.result(), result_a);
1098 result_b = new_register(T_INT);
1099 __ convert(Bytecodes::_l2i, b.result(), result_b);
1100 #endif
1101
1102
1103 LIR_Address* addr_a = new LIR_Address(result_a,
1104 result_aOffset,
1105 constant_aOffset,
1106 T_BYTE);
1107
1108 LIR_Address* addr_b = new LIR_Address(result_b,
1109 result_bOffset,
1110 constant_bOffset,
1111 T_BYTE);
1112
1113 BasicTypeList signature(4);
1114 signature.append(T_ADDRESS);
1115 signature.append(T_ADDRESS);
1116 signature.append(T_INT);
1117 signature.append(T_INT);
1118 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
1119 const LIR_Opr result_reg = result_register_for(x->type());
1120
1121 LIR_Opr ptr_addr_a = new_pointer_register();
1122 __ leal(LIR_OprFact::address(addr_a), ptr_addr_a);
1123
1124 LIR_Opr ptr_addr_b = new_pointer_register();
1125 __ leal(LIR_OprFact::address(addr_b), ptr_addr_b);
1126
1127 __ move(ptr_addr_a, cc->at(0));
1128 __ move(ptr_addr_b, cc->at(1));
1129 length.load_item_force(cc->at(2));
1130 log2ArrayIndexScale.load_item_force(cc->at(3));
1131
1132 __ call_runtime_leaf(StubRoutines::vectorizedMismatch(), getThreadTemp(), result_reg, cc->args());
1133 __ move(result_reg, result);
1134 }
1135
1136 // _i2l, _i2f, _i2d, _l2i, _l2f, _l2d, _f2i, _f2l, _f2d, _d2i, _d2l, _d2f
1137 // _i2b, _i2c, _i2s
1138 LIR_Opr fixed_register_for(BasicType type) {
1139 switch (type) {
1140 case T_FLOAT: return FrameMap::fpu0_float_opr;
1141 case T_DOUBLE: return FrameMap::fpu0_double_opr;
1142 case T_INT: return FrameMap::rax_opr;
1143 case T_LONG: return FrameMap::long0_opr;
1144 default: ShouldNotReachHere(); return LIR_OprFact::illegalOpr;
1145 }
1146 }
1147
1148 void LIRGenerator::do_Convert(Convert* x) {
1149 // flags that vary for the different operations and different SSE-settings
1150 bool fixed_input = false, fixed_result = false, round_result = false, needs_stub = false;
1151
1152 switch (x->op()) {
1153 case Bytecodes::_i2l: // fall through
1154 case Bytecodes::_l2i: // fall through
1155 case Bytecodes::_i2b: // fall through
1156 case Bytecodes::_i2c: // fall through
1157 case Bytecodes::_i2s: fixed_input = false; fixed_result = false; round_result = false; needs_stub = false; break;
1158
1159 case Bytecodes::_f2d: fixed_input = UseSSE == 1; fixed_result = false; round_result = false; needs_stub = false; break;
1160 case Bytecodes::_d2f: fixed_input = false; fixed_result = UseSSE == 1; round_result = UseSSE < 1; needs_stub = false; break;
1161 case Bytecodes::_i2f: fixed_input = false; fixed_result = false; round_result = UseSSE < 1; needs_stub = false; break;
1162 case Bytecodes::_i2d: fixed_input = false; fixed_result = false; round_result = false; needs_stub = false; break;
1163 case Bytecodes::_f2i: fixed_input = false; fixed_result = false; round_result = false; needs_stub = true; break;
1164 case Bytecodes::_d2i: fixed_input = false; fixed_result = false; round_result = false; needs_stub = true; break;
1165 case Bytecodes::_l2f: fixed_input = false; fixed_result = UseSSE >= 1; round_result = UseSSE < 1; needs_stub = false; break;
1166 case Bytecodes::_l2d: fixed_input = false; fixed_result = UseSSE >= 2; round_result = UseSSE < 2; needs_stub = false; break;
1167 case Bytecodes::_f2l: fixed_input = true; fixed_result = true; round_result = false; needs_stub = false; break;
1168 case Bytecodes::_d2l: fixed_input = true; fixed_result = true; round_result = false; needs_stub = false; break;
1169 default: ShouldNotReachHere();
1170 }
1171
1172 LIRItem value(x->value(), this);
1173 value.load_item();
1174 LIR_Opr input = value.result();
1175 LIR_Opr result = rlock(x);
1176
1177 // arguments of lir_convert
1178 LIR_Opr conv_input = input;
1179 LIR_Opr conv_result = result;
1180 ConversionStub* stub = NULL;
1181
1182 if (fixed_input) {
1183 conv_input = fixed_register_for(input->type());
1184 __ move(input, conv_input);
1185 }
1186
1187 assert(fixed_result == false || round_result == false, "cannot set both");
1188 if (fixed_result) {
1189 conv_result = fixed_register_for(result->type());
1190 } else if (round_result) {
1191 result = new_register(result->type());
1192 set_vreg_flag(result, must_start_in_memory);
1193 }
1194
1195 if (needs_stub) {
1196 stub = new ConversionStub(x->op(), conv_input, conv_result);
1197 }
1198
1199 __ convert(x->op(), conv_input, conv_result, stub);
1200
1201 if (result != conv_result) {
1202 __ move(conv_result, result);
1203 }
1204
1205 assert(result->is_virtual(), "result must be virtual register");
1206 set_result(x, result);
1207 }
1208
1209
1210 void LIRGenerator::do_NewInstance(NewInstance* x) {
1211 print_if_not_loaded(x);
1212
1213 CodeEmitInfo* info = state_for(x, x->state());
1214 LIR_Opr reg = result_register_for(x->type());
1215 new_instance(reg, x->klass(), x->is_unresolved(),
1216 FrameMap::rcx_oop_opr,
1217 FrameMap::rdi_oop_opr,
1218 FrameMap::rsi_oop_opr,
1219 LIR_OprFact::illegalOpr,
1220 FrameMap::rdx_metadata_opr, info);
1221 LIR_Opr result = rlock_result(x);
1222 __ move(reg, result);
1223 }
1224
1225
1226 void LIRGenerator::do_NewTypeArray(NewTypeArray* x) {
1227 CodeEmitInfo* info = state_for(x, x->state());
1228
1229 LIRItem length(x->length(), this);
1230 length.load_item_force(FrameMap::rbx_opr);
1231
1232 LIR_Opr reg = result_register_for(x->type());
1233 LIR_Opr tmp1 = FrameMap::rcx_oop_opr;
1234 LIR_Opr tmp2 = FrameMap::rsi_oop_opr;
1235 LIR_Opr tmp3 = FrameMap::rdi_oop_opr;
1236 LIR_Opr tmp4 = reg;
1237 LIR_Opr klass_reg = FrameMap::rdx_metadata_opr;
1238 LIR_Opr len = length.result();
1239 BasicType elem_type = x->elt_type();
1240
1241 __ metadata2reg(ciTypeArrayKlass::make(elem_type)->constant_encoding(), klass_reg);
1242
1243 CodeStub* slow_path = new NewTypeArrayStub(klass_reg, len, reg, info);
1244 __ allocate_array(reg, len, tmp1, tmp2, tmp3, tmp4, elem_type, klass_reg, slow_path);
1245
1246 LIR_Opr result = rlock_result(x);
1247 __ move(reg, result);
1248 }
1249
1250
1251 void LIRGenerator::do_NewObjectArray(NewObjectArray* x) {
1252 LIRItem length(x->length(), this);
1253 // in case of patching (i.e., object class is not yet loaded), we need to reexecute the instruction
1254 // and therefore provide the state before the parameters have been consumed
1255 CodeEmitInfo* patching_info = NULL;
1256 if (!x->klass()->is_loaded() || PatchALot) {
1257 patching_info = state_for(x, x->state_before());
1258 }
1259
1260 CodeEmitInfo* info = state_for(x, x->state());
1261
1262 const LIR_Opr reg = result_register_for(x->type());
1263 LIR_Opr tmp1 = FrameMap::rcx_oop_opr;
1264 LIR_Opr tmp2 = FrameMap::rsi_oop_opr;
1265 LIR_Opr tmp3 = FrameMap::rdi_oop_opr;
1266 LIR_Opr tmp4 = reg;
1267 LIR_Opr klass_reg = FrameMap::rdx_metadata_opr;
1268
1269 length.load_item_force(FrameMap::rbx_opr);
1270 LIR_Opr len = length.result();
1271
1272 CodeStub* slow_path = new NewObjectArrayStub(klass_reg, len, reg, info);
1273 ciKlass* obj = (ciKlass*) ciObjArrayKlass::make(x->klass());
1274 if (obj == ciEnv::unloaded_ciobjarrayklass()) {
1275 BAILOUT("encountered unloaded_ciobjarrayklass due to out of memory error");
1276 }
1277 klass2reg_with_patching(klass_reg, obj, patching_info);
1278 __ allocate_array(reg, len, tmp1, tmp2, tmp3, tmp4, T_OBJECT, klass_reg, slow_path);
1279
1280 LIR_Opr result = rlock_result(x);
1281 __ move(reg, result);
1282 }
1283
1284
1285 void LIRGenerator::do_NewMultiArray(NewMultiArray* x) {
1286 Values* dims = x->dims();
1287 int i = dims->length();
1288 LIRItemList* items = new LIRItemList(i, i, NULL);
1289 while (i-- > 0) {
1290 LIRItem* size = new LIRItem(dims->at(i), this);
1291 items->at_put(i, size);
1292 }
1293
1294 // Evaluate state_for early since it may emit code.
1295 CodeEmitInfo* patching_info = NULL;
1296 if (!x->klass()->is_loaded() || PatchALot) {
1297 patching_info = state_for(x, x->state_before());
1298
1299 // Cannot re-use same xhandlers for multiple CodeEmitInfos, so
1300 // clone all handlers (NOTE: Usually this is handled transparently
1301 // by the CodeEmitInfo cloning logic in CodeStub constructors but
1302 // is done explicitly here because a stub isn't being used).
1303 x->set_exception_handlers(new XHandlers(x->exception_handlers()));
1304 }
1305 CodeEmitInfo* info = state_for(x, x->state());
1306
1307 i = dims->length();
1308 while (i-- > 0) {
1309 LIRItem* size = items->at(i);
1310 size->load_nonconstant();
1311
1312 store_stack_parameter(size->result(), in_ByteSize(i*4));
1313 }
1314
1315 LIR_Opr klass_reg = FrameMap::rax_metadata_opr;
1316 klass2reg_with_patching(klass_reg, x->klass(), patching_info);
1317
1318 LIR_Opr rank = FrameMap::rbx_opr;
1319 __ move(LIR_OprFact::intConst(x->rank()), rank);
1320 LIR_Opr varargs = FrameMap::rcx_opr;
1321 __ move(FrameMap::rsp_opr, varargs);
1322 LIR_OprList* args = new LIR_OprList(3);
1323 args->append(klass_reg);
1324 args->append(rank);
1325 args->append(varargs);
1326 LIR_Opr reg = result_register_for(x->type());
1327 __ call_runtime(Runtime1::entry_for(Runtime1::new_multi_array_id),
1328 LIR_OprFact::illegalOpr,
1329 reg, args, info);
1330
1331 LIR_Opr result = rlock_result(x);
1332 __ move(reg, result);
1333 }
1334
1335
1336 void LIRGenerator::do_BlockBegin(BlockBegin* x) {
1337 // nothing to do for now
1338 }
1339
1340
1341 void LIRGenerator::do_CheckCast(CheckCast* x) {
1342 LIRItem obj(x->obj(), this);
1343
1344 CodeEmitInfo* patching_info = NULL;
1345 if (!x->klass()->is_loaded() || (PatchALot && !x->is_incompatible_class_change_check() && !x->is_invokespecial_receiver_check())) {
1346 // must do this before locking the destination register as an oop register,
1347 // and before the obj is loaded (the latter is for deoptimization)
1348 patching_info = state_for(x, x->state_before());
1349 }
1350 obj.load_item();
1351
1352 // info for exceptions
1353 CodeEmitInfo* info_for_exception =
1354 (x->needs_exception_state() ? state_for(x) :
1355 state_for(x, x->state_before(), true /*ignore_xhandler*/));
1356
1357 CodeStub* stub;
1358 if (x->is_incompatible_class_change_check()) {
1359 assert(patching_info == NULL, "can't patch this");
1360 stub = new SimpleExceptionStub(Runtime1::throw_incompatible_class_change_error_id, LIR_OprFact::illegalOpr, info_for_exception);
1361 } else if (x->is_invokespecial_receiver_check()) {
1362 assert(patching_info == NULL, "can't patch this");
1363 stub = new DeoptimizeStub(info_for_exception, Deoptimization::Reason_class_check, Deoptimization::Action_none);
1364 } else {
1365 stub = new SimpleExceptionStub(Runtime1::throw_class_cast_exception_id, obj.result(), info_for_exception);
1366 }
1367 LIR_Opr reg = rlock_result(x);
1368 LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
1369 if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
1370 tmp3 = new_register(objectType);
1371 }
1372 __ checkcast(reg, obj.result(), x->klass(),
1373 new_register(objectType), new_register(objectType), tmp3,
1374 x->direct_compare(), info_for_exception, patching_info, stub,
1375 x->profiled_method(), x->profiled_bci());
1376 }
1377
1378
1379 void LIRGenerator::do_InstanceOf(InstanceOf* x) {
1380 LIRItem obj(x->obj(), this);
1381
1382 // result and test object may not be in same register
1383 LIR_Opr reg = rlock_result(x);
1384 CodeEmitInfo* patching_info = NULL;
1385 if ((!x->klass()->is_loaded() || PatchALot)) {
1386 // must do this before locking the destination register as an oop register
1387 patching_info = state_for(x, x->state_before());
1388 }
1389 obj.load_item();
1390 LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
1391 if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
1392 tmp3 = new_register(objectType);
1393 }
1394 __ instanceof(reg, obj.result(), x->klass(),
1395 new_register(objectType), new_register(objectType), tmp3,
1396 x->direct_compare(), patching_info, x->profiled_method(), x->profiled_bci());
1397 }
1398
1399
1400 void LIRGenerator::do_If(If* x) {
1401 assert(x->number_of_sux() == 2, "inconsistency");
1402 ValueTag tag = x->x()->type()->tag();
1403 bool is_safepoint = x->is_safepoint();
1404
1405 If::Condition cond = x->cond();
1406
1407 LIRItem xitem(x->x(), this);
1408 LIRItem yitem(x->y(), this);
1409 LIRItem* xin = &xitem;
1410 LIRItem* yin = &yitem;
1411
1412 if (tag == longTag) {
1413 // for longs, only conditions "eql", "neq", "lss", "geq" are valid;
1414 // mirror for other conditions
1415 if (cond == If::gtr || cond == If::leq) {
1416 cond = Instruction::mirror(cond);
1417 xin = &yitem;
1418 yin = &xitem;
1419 }
1420 xin->set_destroys_register();
1421 }
1422 xin->load_item();
1423 if (tag == longTag && yin->is_constant() && yin->get_jlong_constant() == 0 && (cond == If::eql || cond == If::neq)) {
1424 // inline long zero
1425 yin->dont_load_item();
1426 } else if (tag == longTag || tag == floatTag || tag == doubleTag) {
1427 // longs cannot handle constants at right side
1428 yin->load_item();
1429 } else {
1430 yin->dont_load_item();
1431 }
1432
1433 LIR_Opr left = xin->result();
1434 LIR_Opr right = yin->result();
1435
1436 set_no_result(x);
1437
1438 // add safepoint before generating condition code so it can be recomputed
1439 if (x->is_safepoint()) {
1440 // increment backedge counter if needed
1441 increment_backedge_counter_conditionally(lir_cond(cond), left, right, state_for(x, x->state_before()),
1442 x->tsux()->bci(), x->fsux()->bci(), x->profiled_bci());
1443 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
1444 }
1445
1446 __ cmp(lir_cond(cond), left, right);
1447 // Generate branch profiling. Profiling code doesn't kill flags.
1448 profile_branch(x, cond);
1449 move_to_phi(x->state());
1450 if (x->x()->type()->is_float_kind()) {
1451 __ branch(lir_cond(cond), right->type(), x->tsux(), x->usux());
1452 } else {
1453 __ branch(lir_cond(cond), right->type(), x->tsux());
1454 }
1455 assert(x->default_sux() == x->fsux(), "wrong destination above");
1456 __ jump(x->default_sux());
1457 }
1458
1459
1460 LIR_Opr LIRGenerator::getThreadPointer() {
1461 #ifdef _LP64
1462 return FrameMap::as_pointer_opr(r15_thread);
1463 #else
1464 LIR_Opr result = new_register(T_INT);
1465 __ get_thread(result);
1466 return result;
1467 #endif //
1468 }
1469
1470 void LIRGenerator::trace_block_entry(BlockBegin* block) {
1471 store_stack_parameter(LIR_OprFact::intConst(block->block_id()), in_ByteSize(0));
1472 LIR_OprList* args = new LIR_OprList();
1473 address func = CAST_FROM_FN_PTR(address, Runtime1::trace_block_entry);
1474 __ call_runtime_leaf(func, LIR_OprFact::illegalOpr, LIR_OprFact::illegalOpr, args);
1475 }
1476
1477
1478 void LIRGenerator::volatile_field_store(LIR_Opr value, LIR_Address* address,
1479 CodeEmitInfo* info) {
1480 if (address->type() == T_LONG) {
1481 address = new LIR_Address(address->base(),
1482 address->index(), address->scale(),
1483 address->disp(), T_DOUBLE);
1484 // Transfer the value atomically by using FP moves. This means
1485 // the value has to be moved between CPU and FPU registers. It
1486 // always has to be moved through spill slot since there's no
1487 // quick way to pack the value into an SSE register.
1488 LIR_Opr temp_double = new_register(T_DOUBLE);
1489 LIR_Opr spill = new_register(T_LONG);
1490 set_vreg_flag(spill, must_start_in_memory);
1491 __ move(value, spill);
1492 __ volatile_move(spill, temp_double, T_LONG);
1493 __ volatile_move(temp_double, LIR_OprFact::address(address), T_LONG, info);
1494 } else {
1495 __ store(value, address, info);
1496 }
1497 }
1498
1499 void LIRGenerator::volatile_field_load(LIR_Address* address, LIR_Opr result,
1500 CodeEmitInfo* info) {
1501 if (address->type() == T_LONG) {
1502 address = new LIR_Address(address->base(),
1503 address->index(), address->scale(),
1504 address->disp(), T_DOUBLE);
1505 // Transfer the value atomically by using FP moves. This means
1506 // the value has to be moved between CPU and FPU registers. In
1507 // SSE0 and SSE1 mode it has to be moved through spill slot but in
1508 // SSE2+ mode it can be moved directly.
1509 LIR_Opr temp_double = new_register(T_DOUBLE);
1510 __ volatile_move(LIR_OprFact::address(address), temp_double, T_LONG, info);
1511 __ volatile_move(temp_double, result, T_LONG);
1512 if (UseSSE < 2) {
1513 // no spill slot needed in SSE2 mode because xmm->cpu register move is possible
1514 set_vreg_flag(result, must_start_in_memory);
1515 }
1516 } else {
1517 __ load(address, result, info);
1518 }
1519 }