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