1 /*
2 * Copyright (c) 2000, 2019, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "c1/c1_InstructionPrinter.hpp"
27 #include "c1/c1_LIR.hpp"
28 #include "c1/c1_LIRAssembler.hpp"
29 #include "c1/c1_ValueStack.hpp"
30 #include "ci/ciInstance.hpp"
31 #include "runtime/sharedRuntime.hpp"
32
33 Register LIR_OprDesc::as_register() const {
34 return FrameMap::cpu_rnr2reg(cpu_regnr());
35 }
36
37 Register LIR_OprDesc::as_register_lo() const {
38 return FrameMap::cpu_rnr2reg(cpu_regnrLo());
39 }
40
41 Register LIR_OprDesc::as_register_hi() const {
42 return FrameMap::cpu_rnr2reg(cpu_regnrHi());
43 }
44
45 LIR_Opr LIR_OprFact::illegalOpr = LIR_OprFact::illegal();
46
47 LIR_Opr LIR_OprFact::value_type(ValueType* type) {
48 ValueTag tag = type->tag();
49 switch (tag) {
50 case metaDataTag : {
51 ClassConstant* c = type->as_ClassConstant();
52 if (c != NULL && !c->value()->is_loaded()) {
53 return LIR_OprFact::metadataConst(NULL);
54 } else if (c != NULL) {
55 return LIR_OprFact::metadataConst(c->value()->constant_encoding());
56 } else {
57 MethodConstant* m = type->as_MethodConstant();
58 assert (m != NULL, "not a class or a method?");
59 return LIR_OprFact::metadataConst(m->value()->constant_encoding());
60 }
61 }
62 case objectTag : {
63 return LIR_OprFact::oopConst(type->as_ObjectType()->encoding());
64 }
65 case addressTag: return LIR_OprFact::addressConst(type->as_AddressConstant()->value());
66 case intTag : return LIR_OprFact::intConst(type->as_IntConstant()->value());
67 case floatTag : return LIR_OprFact::floatConst(type->as_FloatConstant()->value());
68 case longTag : return LIR_OprFact::longConst(type->as_LongConstant()->value());
69 case doubleTag : return LIR_OprFact::doubleConst(type->as_DoubleConstant()->value());
70 default: ShouldNotReachHere(); return LIR_OprFact::intConst(-1);
71 }
72 }
73
74
75 LIR_Opr LIR_OprFact::dummy_value_type(ValueType* type) {
76 switch (type->tag()) {
77 case objectTag: return LIR_OprFact::oopConst(NULL);
78 case addressTag:return LIR_OprFact::addressConst(0);
79 case intTag: return LIR_OprFact::intConst(0);
80 case floatTag: return LIR_OprFact::floatConst(0.0);
81 case longTag: return LIR_OprFact::longConst(0);
82 case doubleTag: return LIR_OprFact::doubleConst(0.0);
83 default: ShouldNotReachHere(); return LIR_OprFact::intConst(-1);
84 }
85 return illegalOpr;
86 }
87
88
89
90 //---------------------------------------------------
91
92
93 LIR_Address::Scale LIR_Address::scale(BasicType type) {
94 int elem_size = type2aelembytes(type);
95 switch (elem_size) {
96 case 1: return LIR_Address::times_1;
97 case 2: return LIR_Address::times_2;
98 case 4: return LIR_Address::times_4;
99 case 8: return LIR_Address::times_8;
100 }
101 ShouldNotReachHere();
102 return LIR_Address::times_1;
103 }
104
105 //---------------------------------------------------
106
107 char LIR_OprDesc::type_char(BasicType t) {
108 switch (t) {
109 case T_ARRAY:
110 case T_VALUETYPE:
111 t = T_OBJECT;
112 case T_BOOLEAN:
113 case T_CHAR:
114 case T_FLOAT:
115 case T_DOUBLE:
116 case T_BYTE:
117 case T_SHORT:
118 case T_INT:
119 case T_LONG:
120 case T_OBJECT:
121 case T_ADDRESS:
122 case T_VOID:
123 return ::type2char(t);
124 case T_METADATA:
125 return 'M';
126 case T_ILLEGAL:
127 return '?';
128
129 default:
130 ShouldNotReachHere();
131 return '?';
132 }
133 }
134
135 #ifndef PRODUCT
136 void LIR_OprDesc::validate_type() const {
137
138 #ifdef ASSERT
139 if (!is_pointer() && !is_illegal()) {
140 OprKind kindfield = kind_field(); // Factored out because of compiler bug, see 8002160
141 switch (as_BasicType(type_field())) {
142 case T_LONG:
143 assert((kindfield == cpu_register || kindfield == stack_value) &&
144 size_field() == double_size, "must match");
145 break;
146 case T_FLOAT:
147 // FP return values can be also in CPU registers on ARM and PPC32 (softfp ABI)
148 assert((kindfield == fpu_register || kindfield == stack_value
149 ARM_ONLY(|| kindfield == cpu_register)
150 PPC32_ONLY(|| kindfield == cpu_register) ) &&
151 size_field() == single_size, "must match");
152 break;
153 case T_DOUBLE:
154 // FP return values can be also in CPU registers on ARM and PPC32 (softfp ABI)
155 assert((kindfield == fpu_register || kindfield == stack_value
156 ARM_ONLY(|| kindfield == cpu_register)
157 PPC32_ONLY(|| kindfield == cpu_register) ) &&
158 size_field() == double_size, "must match");
159 break;
160 case T_BOOLEAN:
161 case T_CHAR:
162 case T_BYTE:
163 case T_SHORT:
164 case T_INT:
165 case T_ADDRESS:
166 case T_OBJECT:
167 case T_METADATA:
168 case T_ARRAY:
169 case T_VALUETYPE:
170 assert((kindfield == cpu_register || kindfield == stack_value) &&
171 size_field() == single_size, "must match");
172 break;
173
174 case T_ILLEGAL:
175 // XXX TKR also means unknown right now
176 // assert(is_illegal(), "must match");
177 break;
178
179 default:
180 ShouldNotReachHere();
181 }
182 }
183 #endif
184
185 }
186 #endif // PRODUCT
187
188
189 bool LIR_OprDesc::is_oop() const {
190 if (is_pointer()) {
191 return pointer()->is_oop_pointer();
192 } else {
193 OprType t= type_field();
194 assert(t != unknown_type, "not set");
195 return t == object_type;
196 }
197 }
198
199
200
201 void LIR_Op2::verify() const {
202 #ifdef ASSERT
203 switch (code()) {
204 case lir_cmove:
205 case lir_xchg:
206 break;
207
208 default:
209 assert(!result_opr()->is_register() || !result_opr()->is_oop_register(),
210 "can't produce oops from arith");
211 }
212
213 if (TwoOperandLIRForm) {
214
215 #ifdef ASSERT
216 bool threeOperandForm = false;
217 #ifdef S390
218 // There are 3 operand shifts on S390 (see LIR_Assembler::shift_op()).
219 threeOperandForm =
220 code() == lir_shl ||
221 ((code() == lir_shr || code() == lir_ushr) && (result_opr()->is_double_cpu() || in_opr1()->type() == T_OBJECT));
222 #endif
223 #endif
224
225 switch (code()) {
226 case lir_add:
227 case lir_sub:
228 case lir_mul:
229 case lir_mul_strictfp:
230 case lir_div:
231 case lir_div_strictfp:
232 case lir_rem:
233 case lir_logic_and:
234 case lir_logic_or:
235 case lir_logic_xor:
236 case lir_shl:
237 case lir_shr:
238 assert(in_opr1() == result_opr() || threeOperandForm, "opr1 and result must match");
239 assert(in_opr1()->is_valid() && in_opr2()->is_valid(), "must be valid");
240 break;
241
242 // special handling for lir_ushr because of write barriers
243 case lir_ushr:
244 assert(in_opr1() == result_opr() || in_opr2()->is_constant() || threeOperandForm, "opr1 and result must match or shift count is constant");
245 assert(in_opr1()->is_valid() && in_opr2()->is_valid(), "must be valid");
246 break;
247
248 default:
249 break;
250 }
251 }
252 #endif
253 }
254
255
256 LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, BlockBegin* block)
257 : LIR_Op(lir_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL)
258 , _cond(cond)
259 , _type(type)
260 , _label(block->label())
261 , _block(block)
262 , _ublock(NULL)
263 , _stub(NULL) {
264 }
265
266 LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, CodeStub* stub) :
267 LIR_Op(lir_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL)
268 , _cond(cond)
269 , _type(type)
270 , _label(stub->entry())
271 , _block(NULL)
272 , _ublock(NULL)
273 , _stub(stub) {
274 }
275
276 LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, BlockBegin* block, BlockBegin* ublock)
277 : LIR_Op(lir_cond_float_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL)
278 , _cond(cond)
279 , _type(type)
280 , _label(block->label())
281 , _block(block)
282 , _ublock(ublock)
283 , _stub(NULL)
284 {
285 }
286
287 void LIR_OpBranch::change_block(BlockBegin* b) {
288 assert(_block != NULL, "must have old block");
289 assert(_block->label() == label(), "must be equal");
290
291 _block = b;
292 _label = b->label();
293 }
294
295 void LIR_OpBranch::change_ublock(BlockBegin* b) {
296 assert(_ublock != NULL, "must have old block");
297 _ublock = b;
298 }
299
300 void LIR_OpBranch::negate_cond() {
301 switch (_cond) {
302 case lir_cond_equal: _cond = lir_cond_notEqual; break;
303 case lir_cond_notEqual: _cond = lir_cond_equal; break;
304 case lir_cond_less: _cond = lir_cond_greaterEqual; break;
305 case lir_cond_lessEqual: _cond = lir_cond_greater; break;
306 case lir_cond_greaterEqual: _cond = lir_cond_less; break;
307 case lir_cond_greater: _cond = lir_cond_lessEqual; break;
308 default: ShouldNotReachHere();
309 }
310 }
311
312
313 LIR_OpTypeCheck::LIR_OpTypeCheck(LIR_Code code, LIR_Opr result, LIR_Opr object, ciKlass* klass,
314 LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3,
315 bool fast_check, CodeEmitInfo* info_for_exception, CodeEmitInfo* info_for_patch,
316 CodeStub* stub, bool need_null_check)
317
318 : LIR_Op(code, result, NULL)
319 , _object(object)
320 , _array(LIR_OprFact::illegalOpr)
321 , _klass(klass)
322 , _tmp1(tmp1)
323 , _tmp2(tmp2)
324 , _tmp3(tmp3)
325 , _fast_check(fast_check)
326 , _info_for_patch(info_for_patch)
327 , _info_for_exception(info_for_exception)
328 , _stub(stub)
329 , _profiled_method(NULL)
330 , _profiled_bci(-1)
331 , _should_profile(false)
332 , _need_null_check(need_null_check)
333 {
334 if (code == lir_checkcast) {
335 assert(info_for_exception != NULL, "checkcast throws exceptions");
336 } else if (code == lir_instanceof) {
337 assert(info_for_exception == NULL, "instanceof throws no exceptions");
338 } else {
339 ShouldNotReachHere();
340 }
341 }
342
343
344
345 LIR_OpTypeCheck::LIR_OpTypeCheck(LIR_Code code, LIR_Opr object, LIR_Opr array, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, CodeEmitInfo* info_for_exception)
346 : LIR_Op(code, LIR_OprFact::illegalOpr, NULL)
347 , _object(object)
348 , _array(array)
349 , _klass(NULL)
350 , _tmp1(tmp1)
351 , _tmp2(tmp2)
352 , _tmp3(tmp3)
353 , _fast_check(false)
354 , _info_for_patch(NULL)
355 , _info_for_exception(info_for_exception)
356 , _stub(NULL)
357 , _profiled_method(NULL)
358 , _profiled_bci(-1)
359 , _should_profile(false)
360 , _need_null_check(true)
361 {
362 if (code == lir_store_check) {
363 _stub = new ArrayStoreExceptionStub(object, info_for_exception);
364 assert(info_for_exception != NULL, "store_check throws exceptions");
365 } else {
366 ShouldNotReachHere();
367 }
368 }
369
370 LIR_OpFlattenedArrayCheck::LIR_OpFlattenedArrayCheck(LIR_Opr array, LIR_Opr value, LIR_Opr tmp, CodeStub* stub)
371 : LIR_Op(lir_flattened_array_check, LIR_OprFact::illegalOpr, NULL)
372 , _array(array)
373 , _value(value)
374 , _tmp(tmp)
375 , _stub(stub) {}
376
377
378 LIR_OpNullFreeArrayCheck::LIR_OpNullFreeArrayCheck(LIR_Opr array, LIR_Opr tmp)
379 : LIR_Op(lir_null_free_array_check, LIR_OprFact::illegalOpr, NULL)
380 , _array(array)
381 , _tmp(tmp) {}
382
383
384 LIR_OpArrayCopy::LIR_OpArrayCopy(LIR_Opr src, LIR_Opr src_pos, LIR_Opr dst, LIR_Opr dst_pos, LIR_Opr length,
385 LIR_Opr tmp, ciArrayKlass* expected_type, int flags, CodeEmitInfo* info)
386 : LIR_Op(lir_arraycopy, LIR_OprFact::illegalOpr, info)
387 , _src(src)
388 , _src_pos(src_pos)
389 , _dst(dst)
390 , _dst_pos(dst_pos)
391 , _length(length)
392 , _tmp(tmp)
393 , _expected_type(expected_type)
394 , _flags(flags) {
395 _stub = new ArrayCopyStub(this);
396 }
397
398 LIR_OpUpdateCRC32::LIR_OpUpdateCRC32(LIR_Opr crc, LIR_Opr val, LIR_Opr res)
399 : LIR_Op(lir_updatecrc32, res, NULL)
400 , _crc(crc)
401 , _val(val) {
402 }
403
404 //-------------------verify--------------------------
405
406 void LIR_Op1::verify() const {
407 switch(code()) {
408 case lir_move:
409 assert(in_opr()->is_valid() && result_opr()->is_valid(), "must be");
410 break;
411 case lir_null_check:
412 assert(in_opr()->is_register(), "must be");
413 break;
414 case lir_return:
415 assert(in_opr()->is_register() || in_opr()->is_illegal(), "must be");
416 break;
417 default:
418 break;
419 }
420 }
421
422 void LIR_OpRTCall::verify() const {
423 assert(strcmp(Runtime1::name_for_address(addr()), "<unknown function>") != 0, "unknown function");
424 }
425
426 //-------------------visits--------------------------
427
428 // complete rework of LIR instruction visitor.
429 // The virtual call for each instruction type is replaced by a big
430 // switch that adds the operands for each instruction
431
432 void LIR_OpVisitState::visit(LIR_Op* op) {
433 // copy information from the LIR_Op
434 reset();
435 set_op(op);
436
437 switch (op->code()) {
438
439 // LIR_Op0
440 case lir_word_align: // result and info always invalid
441 case lir_backwardbranch_target: // result and info always invalid
442 case lir_build_frame: // result and info always invalid
443 case lir_fpop_raw: // result and info always invalid
444 case lir_24bit_FPU: // result and info always invalid
445 case lir_reset_FPU: // result and info always invalid
446 case lir_breakpoint: // result and info always invalid
447 case lir_membar: // result and info always invalid
448 case lir_membar_acquire: // result and info always invalid
449 case lir_membar_release: // result and info always invalid
450 case lir_membar_loadload: // result and info always invalid
451 case lir_membar_storestore: // result and info always invalid
452 case lir_membar_loadstore: // result and info always invalid
453 case lir_membar_storeload: // result and info always invalid
454 case lir_on_spin_wait:
455 {
456 assert(op->as_Op0() != NULL, "must be");
457 assert(op->_info == NULL, "info not used by this instruction");
458 assert(op->_result->is_illegal(), "not used");
459 break;
460 }
461
462 case lir_nop: // may have info, result always invalid
463 case lir_std_entry: // may have result, info always invalid
464 case lir_osr_entry: // may have result, info always invalid
465 case lir_get_thread: // may have result, info always invalid
466 {
467 assert(op->as_Op0() != NULL, "must be");
468 if (op->_info != NULL) do_info(op->_info);
469 if (op->_result->is_valid()) do_output(op->_result);
470 break;
471 }
472
473
474 // LIR_OpLabel
475 case lir_label: // result and info always invalid
476 {
477 assert(op->as_OpLabel() != NULL, "must be");
478 assert(op->_info == NULL, "info not used by this instruction");
479 assert(op->_result->is_illegal(), "not used");
480 break;
481 }
482
483
484 // LIR_Op1
485 case lir_fxch: // input always valid, result and info always invalid
486 case lir_fld: // input always valid, result and info always invalid
487 case lir_ffree: // input always valid, result and info always invalid
488 case lir_push: // input always valid, result and info always invalid
489 case lir_pop: // input always valid, result and info always invalid
490 case lir_return: // input always valid, result and info always invalid
491 case lir_leal: // input and result always valid, info always invalid
492 case lir_monaddr: // input and result always valid, info always invalid
493 case lir_null_check: // input and info always valid, result always invalid
494 case lir_move: // input and result always valid, may have info
495 case lir_pack64: // input and result always valid
496 case lir_unpack64: // input and result always valid
497 {
498 assert(op->as_Op1() != NULL, "must be");
499 LIR_Op1* op1 = (LIR_Op1*)op;
500
501 if (op1->_info) do_info(op1->_info);
502 if (op1->_opr->is_valid()) do_input(op1->_opr);
503 if (op1->_result->is_valid()) do_output(op1->_result);
504
505 break;
506 }
507
508 case lir_safepoint:
509 {
510 assert(op->as_Op1() != NULL, "must be");
511 LIR_Op1* op1 = (LIR_Op1*)op;
512
513 assert(op1->_info != NULL, ""); do_info(op1->_info);
514 if (op1->_opr->is_valid()) do_temp(op1->_opr); // safepoints on SPARC need temporary register
515 assert(op1->_result->is_illegal(), "safepoint does not produce value");
516
517 break;
518 }
519
520 // LIR_OpConvert;
521 case lir_convert: // input and result always valid, info always invalid
522 {
523 assert(op->as_OpConvert() != NULL, "must be");
524 LIR_OpConvert* opConvert = (LIR_OpConvert*)op;
525
526 assert(opConvert->_info == NULL, "must be");
527 if (opConvert->_opr->is_valid()) do_input(opConvert->_opr);
528 if (opConvert->_result->is_valid()) do_output(opConvert->_result);
529 #ifdef PPC32
530 if (opConvert->_tmp1->is_valid()) do_temp(opConvert->_tmp1);
531 if (opConvert->_tmp2->is_valid()) do_temp(opConvert->_tmp2);
532 #endif
533 do_stub(opConvert->_stub);
534
535 break;
536 }
537
538 // LIR_OpBranch;
539 case lir_branch: // may have info, input and result register always invalid
540 case lir_cond_float_branch: // may have info, input and result register always invalid
541 {
542 assert(op->as_OpBranch() != NULL, "must be");
543 LIR_OpBranch* opBranch = (LIR_OpBranch*)op;
544
545 if (opBranch->_info != NULL) do_info(opBranch->_info);
546 assert(opBranch->_result->is_illegal(), "not used");
547 if (opBranch->_stub != NULL) opBranch->stub()->visit(this);
548
549 break;
550 }
551
552
553 // LIR_OpAllocObj
554 case lir_alloc_object:
555 {
556 assert(op->as_OpAllocObj() != NULL, "must be");
557 LIR_OpAllocObj* opAllocObj = (LIR_OpAllocObj*)op;
558
559 if (opAllocObj->_info) do_info(opAllocObj->_info);
560 if (opAllocObj->_opr->is_valid()) { do_input(opAllocObj->_opr);
561 do_temp(opAllocObj->_opr);
562 }
563 if (opAllocObj->_tmp1->is_valid()) do_temp(opAllocObj->_tmp1);
564 if (opAllocObj->_tmp2->is_valid()) do_temp(opAllocObj->_tmp2);
565 if (opAllocObj->_tmp3->is_valid()) do_temp(opAllocObj->_tmp3);
566 if (opAllocObj->_tmp4->is_valid()) do_temp(opAllocObj->_tmp4);
567 if (opAllocObj->_result->is_valid()) do_output(opAllocObj->_result);
568 do_stub(opAllocObj->_stub);
569 break;
570 }
571
572
573 // LIR_OpRoundFP;
574 case lir_roundfp: {
575 assert(op->as_OpRoundFP() != NULL, "must be");
576 LIR_OpRoundFP* opRoundFP = (LIR_OpRoundFP*)op;
577
578 assert(op->_info == NULL, "info not used by this instruction");
579 assert(opRoundFP->_tmp->is_illegal(), "not used");
580 do_input(opRoundFP->_opr);
581 do_output(opRoundFP->_result);
582
583 break;
584 }
585
586
587 // LIR_Op2
588 case lir_cmp:
589 case lir_cmp_l2i:
590 case lir_ucmp_fd2i:
591 case lir_cmp_fd2i:
592 case lir_add:
593 case lir_sub:
594 case lir_mul:
595 case lir_div:
596 case lir_rem:
597 case lir_sqrt:
598 case lir_abs:
599 case lir_neg:
600 case lir_logic_and:
601 case lir_logic_or:
602 case lir_logic_xor:
603 case lir_shl:
604 case lir_shr:
605 case lir_ushr:
606 case lir_xadd:
607 case lir_xchg:
608 case lir_assert:
609 {
610 assert(op->as_Op2() != NULL, "must be");
611 LIR_Op2* op2 = (LIR_Op2*)op;
612 assert(op2->_tmp2->is_illegal() && op2->_tmp3->is_illegal() &&
613 op2->_tmp4->is_illegal() && op2->_tmp5->is_illegal(), "not used");
614
615 if (op2->_info) do_info(op2->_info);
616 if (op2->_opr1->is_valid()) do_input(op2->_opr1);
617 if (op2->_opr2->is_valid()) do_input(op2->_opr2);
618 if (op2->_tmp1->is_valid()) do_temp(op2->_tmp1);
619 if (op2->_result->is_valid()) do_output(op2->_result);
620 if (op->code() == lir_xchg || op->code() == lir_xadd) {
621 // on ARM and PPC, return value is loaded first so could
622 // destroy inputs. On other platforms that implement those
623 // (x86, sparc), the extra constrainsts are harmless.
624 if (op2->_opr1->is_valid()) do_temp(op2->_opr1);
625 if (op2->_opr2->is_valid()) do_temp(op2->_opr2);
626 }
627
628 break;
629 }
630
631 // special handling for cmove: right input operand must not be equal
632 // to the result operand, otherwise the backend fails
633 case lir_cmove:
634 {
635 assert(op->as_Op2() != NULL, "must be");
636 LIR_Op2* op2 = (LIR_Op2*)op;
637
638 assert(op2->_info == NULL && op2->_tmp1->is_illegal() && op2->_tmp2->is_illegal() &&
639 op2->_tmp3->is_illegal() && op2->_tmp4->is_illegal() && op2->_tmp5->is_illegal(), "not used");
640 assert(op2->_opr1->is_valid() && op2->_opr2->is_valid() && op2->_result->is_valid(), "used");
641
642 do_input(op2->_opr1);
643 do_input(op2->_opr2);
644 do_temp(op2->_opr2);
645 do_output(op2->_result);
646
647 break;
648 }
649
650 // vspecial handling for strict operations: register input operands
651 // as temp to guarantee that they do not overlap with other
652 // registers
653 case lir_mul_strictfp:
654 case lir_div_strictfp:
655 {
656 assert(op->as_Op2() != NULL, "must be");
657 LIR_Op2* op2 = (LIR_Op2*)op;
658
659 assert(op2->_info == NULL, "not used");
660 assert(op2->_opr1->is_valid(), "used");
661 assert(op2->_opr2->is_valid(), "used");
662 assert(op2->_result->is_valid(), "used");
663 assert(op2->_tmp2->is_illegal() && op2->_tmp3->is_illegal() &&
664 op2->_tmp4->is_illegal() && op2->_tmp5->is_illegal(), "not used");
665
666 do_input(op2->_opr1); do_temp(op2->_opr1);
667 do_input(op2->_opr2); do_temp(op2->_opr2);
668 if (op2->_tmp1->is_valid()) do_temp(op2->_tmp1);
669 do_output(op2->_result);
670
671 break;
672 }
673
674 case lir_throw: {
675 assert(op->as_Op2() != NULL, "must be");
676 LIR_Op2* op2 = (LIR_Op2*)op;
677
678 if (op2->_info) do_info(op2->_info);
679 if (op2->_opr1->is_valid()) do_temp(op2->_opr1);
680 if (op2->_opr2->is_valid()) do_input(op2->_opr2); // exception object is input parameter
681 assert(op2->_result->is_illegal(), "no result");
682 assert(op2->_tmp2->is_illegal() && op2->_tmp3->is_illegal() &&
683 op2->_tmp4->is_illegal() && op2->_tmp5->is_illegal(), "not used");
684
685 break;
686 }
687
688 case lir_unwind: {
689 assert(op->as_Op1() != NULL, "must be");
690 LIR_Op1* op1 = (LIR_Op1*)op;
691
692 assert(op1->_info == NULL, "no info");
693 assert(op1->_opr->is_valid(), "exception oop"); do_input(op1->_opr);
694 assert(op1->_result->is_illegal(), "no result");
695
696 break;
697 }
698
699 // LIR_Op3
700 case lir_idiv:
701 case lir_irem: {
702 assert(op->as_Op3() != NULL, "must be");
703 LIR_Op3* op3= (LIR_Op3*)op;
704
705 if (op3->_info) do_info(op3->_info);
706 if (op3->_opr1->is_valid()) do_input(op3->_opr1);
707
708 // second operand is input and temp, so ensure that second operand
709 // and third operand get not the same register
710 if (op3->_opr2->is_valid()) do_input(op3->_opr2);
711 if (op3->_opr2->is_valid()) do_temp(op3->_opr2);
712 if (op3->_opr3->is_valid()) do_temp(op3->_opr3);
713
714 if (op3->_result->is_valid()) do_output(op3->_result);
715
716 break;
717 }
718
719 case lir_fmad:
720 case lir_fmaf: {
721 assert(op->as_Op3() != NULL, "must be");
722 LIR_Op3* op3= (LIR_Op3*)op;
723 assert(op3->_info == NULL, "no info");
724 do_input(op3->_opr1);
725 do_input(op3->_opr2);
726 do_input(op3->_opr3);
727 do_output(op3->_result);
728 break;
729 }
730
731 // LIR_OpJavaCall
732 case lir_static_call:
733 case lir_optvirtual_call:
734 case lir_icvirtual_call:
735 case lir_virtual_call:
736 case lir_dynamic_call: {
737 LIR_OpJavaCall* opJavaCall = op->as_OpJavaCall();
738 assert(opJavaCall != NULL, "must be");
739
740 if (opJavaCall->_receiver->is_valid()) do_input(opJavaCall->_receiver);
741
742 // only visit register parameters
743 int n = opJavaCall->_arguments->length();
744 for (int i = opJavaCall->_receiver->is_valid() ? 1 : 0; i < n; i++) {
745 if (!opJavaCall->_arguments->at(i)->is_pointer()) {
746 do_input(*opJavaCall->_arguments->adr_at(i));
747 }
748 }
749
750 if (opJavaCall->_info) do_info(opJavaCall->_info);
751 if (FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr &&
752 opJavaCall->is_method_handle_invoke()) {
753 opJavaCall->_method_handle_invoke_SP_save_opr = FrameMap::method_handle_invoke_SP_save_opr();
754 do_temp(opJavaCall->_method_handle_invoke_SP_save_opr);
755 }
756 do_call();
757 if (opJavaCall->_result->is_valid()) do_output(opJavaCall->_result);
758
759 break;
760 }
761
762
763 // LIR_OpRTCall
764 case lir_rtcall: {
765 assert(op->as_OpRTCall() != NULL, "must be");
766 LIR_OpRTCall* opRTCall = (LIR_OpRTCall*)op;
767
768 // only visit register parameters
769 int n = opRTCall->_arguments->length();
770 for (int i = 0; i < n; i++) {
771 if (!opRTCall->_arguments->at(i)->is_pointer()) {
772 do_input(*opRTCall->_arguments->adr_at(i));
773 }
774 }
775 if (opRTCall->_info) do_info(opRTCall->_info);
776 if (opRTCall->_tmp->is_valid()) do_temp(opRTCall->_tmp);
777 do_call();
778 if (opRTCall->_result->is_valid()) do_output(opRTCall->_result);
779
780 break;
781 }
782
783
784 // LIR_OpArrayCopy
785 case lir_arraycopy: {
786 assert(op->as_OpArrayCopy() != NULL, "must be");
787 LIR_OpArrayCopy* opArrayCopy = (LIR_OpArrayCopy*)op;
788
789 assert(opArrayCopy->_result->is_illegal(), "unused");
790 assert(opArrayCopy->_src->is_valid(), "used"); do_input(opArrayCopy->_src); do_temp(opArrayCopy->_src);
791 assert(opArrayCopy->_src_pos->is_valid(), "used"); do_input(opArrayCopy->_src_pos); do_temp(opArrayCopy->_src_pos);
792 assert(opArrayCopy->_dst->is_valid(), "used"); do_input(opArrayCopy->_dst); do_temp(opArrayCopy->_dst);
793 assert(opArrayCopy->_dst_pos->is_valid(), "used"); do_input(opArrayCopy->_dst_pos); do_temp(opArrayCopy->_dst_pos);
794 assert(opArrayCopy->_length->is_valid(), "used"); do_input(opArrayCopy->_length); do_temp(opArrayCopy->_length);
795 assert(opArrayCopy->_tmp->is_valid(), "used"); do_temp(opArrayCopy->_tmp);
796 if (opArrayCopy->_info) do_info(opArrayCopy->_info);
797
798 // the implementation of arraycopy always has a call into the runtime
799 do_call();
800
801 break;
802 }
803
804
805 // LIR_OpUpdateCRC32
806 case lir_updatecrc32: {
807 assert(op->as_OpUpdateCRC32() != NULL, "must be");
808 LIR_OpUpdateCRC32* opUp = (LIR_OpUpdateCRC32*)op;
809
810 assert(opUp->_crc->is_valid(), "used"); do_input(opUp->_crc); do_temp(opUp->_crc);
811 assert(opUp->_val->is_valid(), "used"); do_input(opUp->_val); do_temp(opUp->_val);
812 assert(opUp->_result->is_valid(), "used"); do_output(opUp->_result);
813 assert(opUp->_info == NULL, "no info for LIR_OpUpdateCRC32");
814
815 break;
816 }
817
818
819 // LIR_OpLock
820 case lir_lock:
821 case lir_unlock: {
822 assert(op->as_OpLock() != NULL, "must be");
823 LIR_OpLock* opLock = (LIR_OpLock*)op;
824
825 if (opLock->_info) do_info(opLock->_info);
826
827 // TODO: check if these operands really have to be temp
828 // (or if input is sufficient). This may have influence on the oop map!
829 assert(opLock->_lock->is_valid(), "used"); do_temp(opLock->_lock);
830 assert(opLock->_hdr->is_valid(), "used"); do_temp(opLock->_hdr);
831 assert(opLock->_obj->is_valid(), "used"); do_temp(opLock->_obj);
832
833 if (opLock->_scratch->is_valid()) do_temp(opLock->_scratch);
834 assert(opLock->_result->is_illegal(), "unused");
835
836 do_stub(opLock->_stub);
837 do_stub(opLock->_throw_imse_stub);
838
839 break;
840 }
841
842
843 // LIR_OpDelay
844 case lir_delay_slot: {
845 assert(op->as_OpDelay() != NULL, "must be");
846 LIR_OpDelay* opDelay = (LIR_OpDelay*)op;
847
848 visit(opDelay->delay_op());
849 break;
850 }
851
852 // LIR_OpTypeCheck
853 case lir_instanceof:
854 case lir_checkcast:
855 case lir_store_check: {
856 assert(op->as_OpTypeCheck() != NULL, "must be");
857 LIR_OpTypeCheck* opTypeCheck = (LIR_OpTypeCheck*)op;
858
859 if (opTypeCheck->_info_for_exception) do_info(opTypeCheck->_info_for_exception);
860 if (opTypeCheck->_info_for_patch) do_info(opTypeCheck->_info_for_patch);
861 if (opTypeCheck->_object->is_valid()) do_input(opTypeCheck->_object);
862 if (op->code() == lir_store_check && opTypeCheck->_object->is_valid()) {
863 do_temp(opTypeCheck->_object);
864 }
865 if (opTypeCheck->_array->is_valid()) do_input(opTypeCheck->_array);
866 if (opTypeCheck->_tmp1->is_valid()) do_temp(opTypeCheck->_tmp1);
867 if (opTypeCheck->_tmp2->is_valid()) do_temp(opTypeCheck->_tmp2);
868 if (opTypeCheck->_tmp3->is_valid()) do_temp(opTypeCheck->_tmp3);
869 if (opTypeCheck->_result->is_valid()) do_output(opTypeCheck->_result);
870 do_stub(opTypeCheck->_stub);
871 break;
872 }
873
874 // LIR_OpFlattenedArrayCheck
875 case lir_flattened_array_check: {
876 assert(op->as_OpFlattenedArrayCheck() != NULL, "must be");
877 LIR_OpFlattenedArrayCheck* opFlattenedArrayCheck = (LIR_OpFlattenedArrayCheck*)op;
878
879 if (opFlattenedArrayCheck->_array->is_valid()) do_input(opFlattenedArrayCheck->_array);
880 if (opFlattenedArrayCheck->_value->is_valid()) do_input(opFlattenedArrayCheck->_value);
881 if (opFlattenedArrayCheck->_tmp->is_valid()) do_temp(opFlattenedArrayCheck->_tmp);
882 do_stub(opFlattenedArrayCheck->_stub);
883
884 break;
885 }
886
887 // LIR_OpNullFreeArrayCheck
888 case lir_null_free_array_check: {
889 assert(op->as_OpNullFreeArrayCheck() != NULL, "must be");
890 LIR_OpNullFreeArrayCheck* opNullFreeArrayCheck = (LIR_OpNullFreeArrayCheck*)op;
891
892 if (opNullFreeArrayCheck->_array->is_valid()) do_input(opNullFreeArrayCheck->_array);
893 if (opNullFreeArrayCheck->_tmp->is_valid()) do_temp(opNullFreeArrayCheck->_tmp);
894 break;
895 }
896
897 // LIR_OpCompareAndSwap
898 case lir_cas_long:
899 case lir_cas_obj:
900 case lir_cas_int: {
901 assert(op->as_OpCompareAndSwap() != NULL, "must be");
902 LIR_OpCompareAndSwap* opCompareAndSwap = (LIR_OpCompareAndSwap*)op;
903
904 assert(opCompareAndSwap->_addr->is_valid(), "used");
905 assert(opCompareAndSwap->_cmp_value->is_valid(), "used");
906 assert(opCompareAndSwap->_new_value->is_valid(), "used");
907 if (opCompareAndSwap->_info) do_info(opCompareAndSwap->_info);
908 do_input(opCompareAndSwap->_addr);
909 do_temp(opCompareAndSwap->_addr);
910 do_input(opCompareAndSwap->_cmp_value);
911 do_temp(opCompareAndSwap->_cmp_value);
912 do_input(opCompareAndSwap->_new_value);
913 do_temp(opCompareAndSwap->_new_value);
914 if (opCompareAndSwap->_tmp1->is_valid()) do_temp(opCompareAndSwap->_tmp1);
915 if (opCompareAndSwap->_tmp2->is_valid()) do_temp(opCompareAndSwap->_tmp2);
916 if (opCompareAndSwap->_result->is_valid()) do_output(opCompareAndSwap->_result);
917
918 break;
919 }
920
921
922 // LIR_OpAllocArray;
923 case lir_alloc_array: {
924 assert(op->as_OpAllocArray() != NULL, "must be");
925 LIR_OpAllocArray* opAllocArray = (LIR_OpAllocArray*)op;
926
927 if (opAllocArray->_info) do_info(opAllocArray->_info);
928 if (opAllocArray->_klass->is_valid()) do_input(opAllocArray->_klass); do_temp(opAllocArray->_klass);
929 if (opAllocArray->_len->is_valid()) do_input(opAllocArray->_len); do_temp(opAllocArray->_len);
930 if (opAllocArray->_tmp1->is_valid()) do_temp(opAllocArray->_tmp1);
931 if (opAllocArray->_tmp2->is_valid()) do_temp(opAllocArray->_tmp2);
932 if (opAllocArray->_tmp3->is_valid()) do_temp(opAllocArray->_tmp3);
933 if (opAllocArray->_tmp4->is_valid()) do_temp(opAllocArray->_tmp4);
934 if (opAllocArray->_result->is_valid()) do_output(opAllocArray->_result);
935 do_stub(opAllocArray->_stub);
936 break;
937 }
938
939 // LIR_OpProfileCall:
940 case lir_profile_call: {
941 assert(op->as_OpProfileCall() != NULL, "must be");
942 LIR_OpProfileCall* opProfileCall = (LIR_OpProfileCall*)op;
943
944 if (opProfileCall->_recv->is_valid()) do_temp(opProfileCall->_recv);
945 assert(opProfileCall->_mdo->is_valid(), "used"); do_temp(opProfileCall->_mdo);
946 assert(opProfileCall->_tmp1->is_valid(), "used"); do_temp(opProfileCall->_tmp1);
947 break;
948 }
949
950 // LIR_OpProfileType:
951 case lir_profile_type: {
952 assert(op->as_OpProfileType() != NULL, "must be");
953 LIR_OpProfileType* opProfileType = (LIR_OpProfileType*)op;
954
955 do_input(opProfileType->_mdp); do_temp(opProfileType->_mdp);
956 do_input(opProfileType->_obj);
957 do_temp(opProfileType->_tmp);
958 break;
959 }
960 default:
961 op->visit(this);
962 }
963 }
964
965 void LIR_Op::visit(LIR_OpVisitState* state) {
966 ShouldNotReachHere();
967 }
968
969 void LIR_OpVisitState::do_stub(CodeStub* stub) {
970 if (stub != NULL) {
971 stub->visit(this);
972 }
973 }
974
975 XHandlers* LIR_OpVisitState::all_xhandler() {
976 XHandlers* result = NULL;
977
978 int i;
979 for (i = 0; i < info_count(); i++) {
980 if (info_at(i)->exception_handlers() != NULL) {
981 result = info_at(i)->exception_handlers();
982 break;
983 }
984 }
985
986 #ifdef ASSERT
987 for (i = 0; i < info_count(); i++) {
988 assert(info_at(i)->exception_handlers() == NULL ||
989 info_at(i)->exception_handlers() == result,
990 "only one xhandler list allowed per LIR-operation");
991 }
992 #endif
993
994 if (result != NULL) {
995 return result;
996 } else {
997 return new XHandlers();
998 }
999
1000 return result;
1001 }
1002
1003
1004 #ifdef ASSERT
1005 bool LIR_OpVisitState::no_operands(LIR_Op* op) {
1006 visit(op);
1007
1008 return opr_count(inputMode) == 0 &&
1009 opr_count(outputMode) == 0 &&
1010 opr_count(tempMode) == 0 &&
1011 info_count() == 0 &&
1012 !has_call() &&
1013 !has_slow_case();
1014 }
1015 #endif
1016
1017 //---------------------------------------------------
1018
1019
1020 void LIR_OpJavaCall::emit_code(LIR_Assembler* masm) {
1021 masm->emit_call(this);
1022 }
1023
1024 void LIR_OpRTCall::emit_code(LIR_Assembler* masm) {
1025 masm->emit_rtcall(this);
1026 }
1027
1028 void LIR_OpLabel::emit_code(LIR_Assembler* masm) {
1029 masm->emit_opLabel(this);
1030 }
1031
1032 void LIR_OpArrayCopy::emit_code(LIR_Assembler* masm) {
1033 masm->emit_arraycopy(this);
1034 masm->append_code_stub(stub());
1035 }
1036
1037 void LIR_OpUpdateCRC32::emit_code(LIR_Assembler* masm) {
1038 masm->emit_updatecrc32(this);
1039 }
1040
1041 void LIR_Op0::emit_code(LIR_Assembler* masm) {
1042 masm->emit_op0(this);
1043 }
1044
1045 void LIR_Op1::emit_code(LIR_Assembler* masm) {
1046 masm->emit_op1(this);
1047 }
1048
1049 void LIR_OpAllocObj::emit_code(LIR_Assembler* masm) {
1050 masm->emit_alloc_obj(this);
1051 masm->append_code_stub(stub());
1052 }
1053
1054 void LIR_OpBranch::emit_code(LIR_Assembler* masm) {
1055 masm->emit_opBranch(this);
1056 if (stub()) {
1057 masm->append_code_stub(stub());
1058 }
1059 }
1060
1061 void LIR_OpConvert::emit_code(LIR_Assembler* masm) {
1062 masm->emit_opConvert(this);
1063 if (stub() != NULL) {
1064 masm->append_code_stub(stub());
1065 }
1066 }
1067
1068 void LIR_Op2::emit_code(LIR_Assembler* masm) {
1069 masm->emit_op2(this);
1070 }
1071
1072 void LIR_OpAllocArray::emit_code(LIR_Assembler* masm) {
1073 masm->emit_alloc_array(this);
1074 masm->append_code_stub(stub());
1075 }
1076
1077 void LIR_OpTypeCheck::emit_code(LIR_Assembler* masm) {
1078 masm->emit_opTypeCheck(this);
1079 if (stub()) {
1080 masm->append_code_stub(stub());
1081 }
1082 }
1083
1084 void LIR_OpFlattenedArrayCheck::emit_code(LIR_Assembler* masm) {
1085 masm->emit_opFlattenedArrayCheck(this);
1086 if (stub() != NULL) {
1087 masm->append_code_stub(stub());
1088 }
1089 }
1090
1091 void LIR_OpNullFreeArrayCheck::emit_code(LIR_Assembler* masm) {
1092 masm->emit_opNullFreeArrayCheck(this);
1093 }
1094
1095 void LIR_OpCompareAndSwap::emit_code(LIR_Assembler* masm) {
1096 masm->emit_compare_and_swap(this);
1097 }
1098
1099 void LIR_Op3::emit_code(LIR_Assembler* masm) {
1100 masm->emit_op3(this);
1101 }
1102
1103 void LIR_OpLock::emit_code(LIR_Assembler* masm) {
1104 masm->emit_lock(this);
1105 if (stub()) {
1106 masm->append_code_stub(stub());
1107 }
1108 if (throw_imse_stub()) {
1109 masm->append_code_stub(throw_imse_stub());
1110 }
1111 }
1112
1113 #ifdef ASSERT
1114 void LIR_OpAssert::emit_code(LIR_Assembler* masm) {
1115 masm->emit_assert(this);
1116 }
1117 #endif
1118
1119 void LIR_OpDelay::emit_code(LIR_Assembler* masm) {
1120 masm->emit_delay(this);
1121 }
1122
1123 void LIR_OpProfileCall::emit_code(LIR_Assembler* masm) {
1124 masm->emit_profile_call(this);
1125 }
1126
1127 void LIR_OpProfileType::emit_code(LIR_Assembler* masm) {
1128 masm->emit_profile_type(this);
1129 }
1130
1131 // LIR_List
1132 LIR_List::LIR_List(Compilation* compilation, BlockBegin* block)
1133 : _operations(8)
1134 , _compilation(compilation)
1135 #ifndef PRODUCT
1136 , _block(block)
1137 #endif
1138 #ifdef ASSERT
1139 , _file(NULL)
1140 , _line(0)
1141 #endif
1142 { }
1143
1144
1145 #ifdef ASSERT
1146 void LIR_List::set_file_and_line(const char * file, int line) {
1147 const char * f = strrchr(file, '/');
1148 if (f == NULL) f = strrchr(file, '\\');
1149 if (f == NULL) {
1150 f = file;
1151 } else {
1152 f++;
1153 }
1154 _file = f;
1155 _line = line;
1156 }
1157 #endif
1158
1159
1160 void LIR_List::append(LIR_InsertionBuffer* buffer) {
1161 assert(this == buffer->lir_list(), "wrong lir list");
1162 const int n = _operations.length();
1163
1164 if (buffer->number_of_ops() > 0) {
1165 // increase size of instructions list
1166 _operations.at_grow(n + buffer->number_of_ops() - 1, NULL);
1167 // insert ops from buffer into instructions list
1168 int op_index = buffer->number_of_ops() - 1;
1169 int ip_index = buffer->number_of_insertion_points() - 1;
1170 int from_index = n - 1;
1171 int to_index = _operations.length() - 1;
1172 for (; ip_index >= 0; ip_index --) {
1173 int index = buffer->index_at(ip_index);
1174 // make room after insertion point
1175 while (index < from_index) {
1176 _operations.at_put(to_index --, _operations.at(from_index --));
1177 }
1178 // insert ops from buffer
1179 for (int i = buffer->count_at(ip_index); i > 0; i --) {
1180 _operations.at_put(to_index --, buffer->op_at(op_index --));
1181 }
1182 }
1183 }
1184
1185 buffer->finish();
1186 }
1187
1188
1189 void LIR_List::oop2reg_patch(jobject o, LIR_Opr reg, CodeEmitInfo* info) {
1190 assert(reg->type() == T_OBJECT, "bad reg");
1191 append(new LIR_Op1(lir_move, LIR_OprFact::oopConst(o), reg, T_OBJECT, lir_patch_normal, info));
1192 }
1193
1194 void LIR_List::klass2reg_patch(Metadata* o, LIR_Opr reg, CodeEmitInfo* info) {
1195 assert(reg->type() == T_METADATA, "bad reg");
1196 append(new LIR_Op1(lir_move, LIR_OprFact::metadataConst(o), reg, T_METADATA, lir_patch_normal, info));
1197 }
1198
1199 void LIR_List::load(LIR_Address* addr, LIR_Opr src, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1200 append(new LIR_Op1(
1201 lir_move,
1202 LIR_OprFact::address(addr),
1203 src,
1204 addr->type(),
1205 patch_code,
1206 info));
1207 }
1208
1209
1210 void LIR_List::volatile_load_mem_reg(LIR_Address* address, LIR_Opr dst, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1211 append(new LIR_Op1(
1212 lir_move,
1213 LIR_OprFact::address(address),
1214 dst,
1215 address->type(),
1216 patch_code,
1217 info, lir_move_volatile));
1218 }
1219
1220 void LIR_List::volatile_load_unsafe_reg(LIR_Opr base, LIR_Opr offset, LIR_Opr dst, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1221 append(new LIR_Op1(
1222 lir_move,
1223 LIR_OprFact::address(new LIR_Address(base, offset, type)),
1224 dst,
1225 type,
1226 patch_code,
1227 info, lir_move_volatile));
1228 }
1229
1230
1231 void LIR_List::store_mem_int(jint v, LIR_Opr base, int offset_in_bytes, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1232 append(new LIR_Op1(
1233 lir_move,
1234 LIR_OprFact::intConst(v),
1235 LIR_OprFact::address(new LIR_Address(base, offset_in_bytes, type)),
1236 type,
1237 patch_code,
1238 info));
1239 }
1240
1241
1242 void LIR_List::store_mem_oop(jobject o, LIR_Opr base, int offset_in_bytes, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1243 append(new LIR_Op1(
1244 lir_move,
1245 LIR_OprFact::oopConst(o),
1246 LIR_OprFact::address(new LIR_Address(base, offset_in_bytes, type)),
1247 type,
1248 patch_code,
1249 info));
1250 }
1251
1252
1253 void LIR_List::store(LIR_Opr src, LIR_Address* addr, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1254 append(new LIR_Op1(
1255 lir_move,
1256 src,
1257 LIR_OprFact::address(addr),
1258 addr->type(),
1259 patch_code,
1260 info));
1261 }
1262
1263
1264 void LIR_List::volatile_store_mem_reg(LIR_Opr src, LIR_Address* addr, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1265 append(new LIR_Op1(
1266 lir_move,
1267 src,
1268 LIR_OprFact::address(addr),
1269 addr->type(),
1270 patch_code,
1271 info,
1272 lir_move_volatile));
1273 }
1274
1275 void LIR_List::volatile_store_unsafe_reg(LIR_Opr src, LIR_Opr base, LIR_Opr offset, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) {
1276 append(new LIR_Op1(
1277 lir_move,
1278 src,
1279 LIR_OprFact::address(new LIR_Address(base, offset, type)),
1280 type,
1281 patch_code,
1282 info, lir_move_volatile));
1283 }
1284
1285
1286 void LIR_List::idiv(LIR_Opr left, LIR_Opr right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
1287 append(new LIR_Op3(
1288 lir_idiv,
1289 left,
1290 right,
1291 tmp,
1292 res,
1293 info));
1294 }
1295
1296
1297 void LIR_List::idiv(LIR_Opr left, int right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
1298 append(new LIR_Op3(
1299 lir_idiv,
1300 left,
1301 LIR_OprFact::intConst(right),
1302 tmp,
1303 res,
1304 info));
1305 }
1306
1307
1308 void LIR_List::irem(LIR_Opr left, LIR_Opr right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
1309 append(new LIR_Op3(
1310 lir_irem,
1311 left,
1312 right,
1313 tmp,
1314 res,
1315 info));
1316 }
1317
1318
1319 void LIR_List::irem(LIR_Opr left, int right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) {
1320 append(new LIR_Op3(
1321 lir_irem,
1322 left,
1323 LIR_OprFact::intConst(right),
1324 tmp,
1325 res,
1326 info));
1327 }
1328
1329
1330 void LIR_List::cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info) {
1331 append(new LIR_Op2(
1332 lir_cmp,
1333 condition,
1334 LIR_OprFact::address(new LIR_Address(base, disp, T_INT)),
1335 LIR_OprFact::intConst(c),
1336 info));
1337 }
1338
1339
1340 void LIR_List::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Address* addr, CodeEmitInfo* info) {
1341 append(new LIR_Op2(
1342 lir_cmp,
1343 condition,
1344 reg,
1345 LIR_OprFact::address(addr),
1346 info));
1347 }
1348
1349 void LIR_List::allocate_object(LIR_Opr dst, LIR_Opr t1, LIR_Opr t2, LIR_Opr t3, LIR_Opr t4,
1350 int header_size, int object_size, LIR_Opr klass, bool init_check, CodeStub* stub) {
1351 append(new LIR_OpAllocObj(
1352 klass,
1353 dst,
1354 t1,
1355 t2,
1356 t3,
1357 t4,
1358 header_size,
1359 object_size,
1360 init_check,
1361 stub));
1362 }
1363
1364 void LIR_List::allocate_array(LIR_Opr dst, LIR_Opr len, LIR_Opr t1,LIR_Opr t2, LIR_Opr t3,LIR_Opr t4, BasicType type, LIR_Opr klass, CodeStub* stub) {
1365 append(new LIR_OpAllocArray(
1366 klass,
1367 len,
1368 dst,
1369 t1,
1370 t2,
1371 t3,
1372 t4,
1373 type,
1374 stub));
1375 }
1376
1377 void LIR_List::shift_left(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) {
1378 append(new LIR_Op2(
1379 lir_shl,
1380 value,
1381 count,
1382 dst,
1383 tmp));
1384 }
1385
1386 void LIR_List::shift_right(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) {
1387 append(new LIR_Op2(
1388 lir_shr,
1389 value,
1390 count,
1391 dst,
1392 tmp));
1393 }
1394
1395
1396 void LIR_List::unsigned_shift_right(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) {
1397 append(new LIR_Op2(
1398 lir_ushr,
1399 value,
1400 count,
1401 dst,
1402 tmp));
1403 }
1404
1405 void LIR_List::fcmp2int(LIR_Opr left, LIR_Opr right, LIR_Opr dst, bool is_unordered_less) {
1406 append(new LIR_Op2(is_unordered_less ? lir_ucmp_fd2i : lir_cmp_fd2i,
1407 left,
1408 right,
1409 dst));
1410 }
1411
1412 void LIR_List::lock_object(LIR_Opr hdr, LIR_Opr obj, LIR_Opr lock, LIR_Opr scratch, CodeStub* stub, CodeEmitInfo* info, CodeStub* throw_imse_stub) {
1413 append(new LIR_OpLock(
1414 lir_lock,
1415 hdr,
1416 obj,
1417 lock,
1418 scratch,
1419 stub,
1420 info,
1421 throw_imse_stub));
1422 }
1423
1424 void LIR_List::unlock_object(LIR_Opr hdr, LIR_Opr obj, LIR_Opr lock, LIR_Opr scratch, CodeStub* stub) {
1425 append(new LIR_OpLock(
1426 lir_unlock,
1427 hdr,
1428 obj,
1429 lock,
1430 scratch,
1431 stub,
1432 NULL));
1433 }
1434
1435
1436 void check_LIR() {
1437 // cannot do the proper checking as PRODUCT and other modes return different results
1438 // guarantee(sizeof(LIR_OprDesc) == wordSize, "may not have a v-table");
1439 }
1440
1441
1442
1443 void LIR_List::checkcast (LIR_Opr result, LIR_Opr object, ciKlass* klass,
1444 LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, bool fast_check,
1445 CodeEmitInfo* info_for_exception, CodeEmitInfo* info_for_patch, CodeStub* stub,
1446 ciMethod* profiled_method, int profiled_bci, bool is_never_null) {
1447 // If klass is non-nullable, LIRGenerator::do_CheckCast has already performed null-check
1448 // on the object.
1449 bool need_null_check = !is_never_null;
1450 LIR_OpTypeCheck* c = new LIR_OpTypeCheck(lir_checkcast, result, object, klass,
1451 tmp1, tmp2, tmp3, fast_check, info_for_exception, info_for_patch, stub,
1452 need_null_check);
1453 if (profiled_method != NULL) {
1454 c->set_profiled_method(profiled_method);
1455 c->set_profiled_bci(profiled_bci);
1456 c->set_should_profile(true);
1457 }
1458 append(c);
1459 }
1460
1461 void LIR_List::instanceof(LIR_Opr result, LIR_Opr object, ciKlass* klass, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, bool fast_check, CodeEmitInfo* info_for_patch, ciMethod* profiled_method, int profiled_bci) {
1462 LIR_OpTypeCheck* c = new LIR_OpTypeCheck(lir_instanceof, result, object, klass, tmp1, tmp2, tmp3, fast_check, NULL, info_for_patch, NULL);
1463 if (profiled_method != NULL) {
1464 c->set_profiled_method(profiled_method);
1465 c->set_profiled_bci(profiled_bci);
1466 c->set_should_profile(true);
1467 }
1468 append(c);
1469 }
1470
1471
1472 void LIR_List::store_check(LIR_Opr object, LIR_Opr array, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3,
1473 CodeEmitInfo* info_for_exception, ciMethod* profiled_method, int profiled_bci) {
1474 // FIXME -- if the types of the array and/or the object are known statically, we can avoid loading the klass
1475 LIR_OpTypeCheck* c = new LIR_OpTypeCheck(lir_store_check, object, array, tmp1, tmp2, tmp3, info_for_exception);
1476 if (profiled_method != NULL) {
1477 c->set_profiled_method(profiled_method);
1478 c->set_profiled_bci(profiled_bci);
1479 c->set_should_profile(true);
1480 }
1481 append(c);
1482 }
1483
1484 void LIR_List::null_check(LIR_Opr opr, CodeEmitInfo* info, bool deoptimize_on_null) {
1485 if (deoptimize_on_null) {
1486 // Emit an explicit null check and deoptimize if opr is null
1487 CodeStub* deopt = new DeoptimizeStub(info, Deoptimization::Reason_null_check, Deoptimization::Action_none);
1488 cmp(lir_cond_equal, opr, LIR_OprFact::oopConst(NULL));
1489 branch(lir_cond_equal, T_OBJECT, deopt);
1490 } else {
1491 // Emit an implicit null check
1492 append(new LIR_Op1(lir_null_check, opr, info));
1493 }
1494 }
1495
1496 void LIR_List::check_flattened_array(LIR_Opr array, LIR_Opr value, LIR_Opr tmp, CodeStub* stub) {
1497 LIR_OpFlattenedArrayCheck* c = new LIR_OpFlattenedArrayCheck(array, value, tmp, stub);
1498 append(c);
1499 }
1500
1501 void LIR_List::check_null_free_array(LIR_Opr array, LIR_Opr tmp) {
1502 LIR_OpNullFreeArrayCheck* c = new LIR_OpNullFreeArrayCheck(array, tmp);
1503 append(c);
1504 }
1505
1506 void LIR_List::cas_long(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value,
1507 LIR_Opr t1, LIR_Opr t2, LIR_Opr result) {
1508 append(new LIR_OpCompareAndSwap(lir_cas_long, addr, cmp_value, new_value, t1, t2, result));
1509 }
1510
1511 void LIR_List::cas_obj(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value,
1512 LIR_Opr t1, LIR_Opr t2, LIR_Opr result) {
1513 append(new LIR_OpCompareAndSwap(lir_cas_obj, addr, cmp_value, new_value, t1, t2, result));
1514 }
1515
1516 void LIR_List::cas_int(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value,
1517 LIR_Opr t1, LIR_Opr t2, LIR_Opr result) {
1518 append(new LIR_OpCompareAndSwap(lir_cas_int, addr, cmp_value, new_value, t1, t2, result));
1519 }
1520
1521
1522 #ifdef PRODUCT
1523
1524 void print_LIR(BlockList* blocks) {
1525 }
1526
1527 #else
1528 // LIR_OprDesc
1529 void LIR_OprDesc::print() const {
1530 print(tty);
1531 }
1532
1533 void LIR_OprDesc::print(outputStream* out) const {
1534 if (is_illegal()) {
1535 return;
1536 }
1537
1538 out->print("[");
1539 if (is_pointer()) {
1540 pointer()->print_value_on(out);
1541 } else if (is_single_stack()) {
1542 out->print("stack:%d", single_stack_ix());
1543 } else if (is_double_stack()) {
1544 out->print("dbl_stack:%d",double_stack_ix());
1545 } else if (is_virtual()) {
1546 out->print("R%d", vreg_number());
1547 } else if (is_single_cpu()) {
1548 out->print("%s", as_register()->name());
1549 } else if (is_double_cpu()) {
1550 out->print("%s", as_register_hi()->name());
1551 out->print("%s", as_register_lo()->name());
1552 #if defined(X86)
1553 } else if (is_single_xmm()) {
1554 out->print("%s", as_xmm_float_reg()->name());
1555 } else if (is_double_xmm()) {
1556 out->print("%s", as_xmm_double_reg()->name());
1557 } else if (is_single_fpu()) {
1558 out->print("fpu%d", fpu_regnr());
1559 } else if (is_double_fpu()) {
1560 out->print("fpu%d", fpu_regnrLo());
1561 #elif defined(AARCH64)
1562 } else if (is_single_fpu()) {
1563 out->print("fpu%d", fpu_regnr());
1564 } else if (is_double_fpu()) {
1565 out->print("fpu%d", fpu_regnrLo());
1566 #elif defined(ARM)
1567 } else if (is_single_fpu()) {
1568 out->print("s%d", fpu_regnr());
1569 } else if (is_double_fpu()) {
1570 out->print("d%d", fpu_regnrLo() >> 1);
1571 #else
1572 } else if (is_single_fpu()) {
1573 out->print("%s", as_float_reg()->name());
1574 } else if (is_double_fpu()) {
1575 out->print("%s", as_double_reg()->name());
1576 #endif
1577
1578 } else if (is_illegal()) {
1579 out->print("-");
1580 } else {
1581 out->print("Unknown Operand");
1582 }
1583 if (!is_illegal()) {
1584 out->print("|%c", type_char());
1585 }
1586 if (is_register() && is_last_use()) {
1587 out->print("(last_use)");
1588 }
1589 out->print("]");
1590 }
1591
1592
1593 // LIR_Address
1594 void LIR_Const::print_value_on(outputStream* out) const {
1595 switch (type()) {
1596 case T_ADDRESS:out->print("address:%d",as_jint()); break;
1597 case T_INT: out->print("int:%d", as_jint()); break;
1598 case T_LONG: out->print("lng:" JLONG_FORMAT, as_jlong()); break;
1599 case T_FLOAT: out->print("flt:%f", as_jfloat()); break;
1600 case T_DOUBLE: out->print("dbl:%f", as_jdouble()); break;
1601 case T_OBJECT: out->print("obj:" INTPTR_FORMAT, p2i(as_jobject())); break;
1602 case T_METADATA: out->print("metadata:" INTPTR_FORMAT, p2i(as_metadata()));break;
1603 default: out->print("%3d:0x" UINT64_FORMAT_X, type(), (uint64_t)as_jlong()); break;
1604 }
1605 }
1606
1607 // LIR_Address
1608 void LIR_Address::print_value_on(outputStream* out) const {
1609 out->print("Base:"); _base->print(out);
1610 if (!_index->is_illegal()) {
1611 out->print(" Index:"); _index->print(out);
1612 switch (scale()) {
1613 case times_1: break;
1614 case times_2: out->print(" * 2"); break;
1615 case times_4: out->print(" * 4"); break;
1616 case times_8: out->print(" * 8"); break;
1617 }
1618 }
1619 out->print(" Disp: " INTX_FORMAT, _disp);
1620 }
1621
1622 // debug output of block header without InstructionPrinter
1623 // (because phi functions are not necessary for LIR)
1624 static void print_block(BlockBegin* x) {
1625 // print block id
1626 BlockEnd* end = x->end();
1627 tty->print("B%d ", x->block_id());
1628
1629 // print flags
1630 if (x->is_set(BlockBegin::std_entry_flag)) tty->print("std ");
1631 if (x->is_set(BlockBegin::osr_entry_flag)) tty->print("osr ");
1632 if (x->is_set(BlockBegin::exception_entry_flag)) tty->print("ex ");
1633 if (x->is_set(BlockBegin::subroutine_entry_flag)) tty->print("jsr ");
1634 if (x->is_set(BlockBegin::backward_branch_target_flag)) tty->print("bb ");
1635 if (x->is_set(BlockBegin::linear_scan_loop_header_flag)) tty->print("lh ");
1636 if (x->is_set(BlockBegin::linear_scan_loop_end_flag)) tty->print("le ");
1637
1638 // print block bci range
1639 tty->print("[%d, %d] ", x->bci(), (end == NULL ? -1 : end->printable_bci()));
1640
1641 // print predecessors and successors
1642 if (x->number_of_preds() > 0) {
1643 tty->print("preds: ");
1644 for (int i = 0; i < x->number_of_preds(); i ++) {
1645 tty->print("B%d ", x->pred_at(i)->block_id());
1646 }
1647 }
1648
1649 if (x->number_of_sux() > 0) {
1650 tty->print("sux: ");
1651 for (int i = 0; i < x->number_of_sux(); i ++) {
1652 tty->print("B%d ", x->sux_at(i)->block_id());
1653 }
1654 }
1655
1656 // print exception handlers
1657 if (x->number_of_exception_handlers() > 0) {
1658 tty->print("xhandler: ");
1659 for (int i = 0; i < x->number_of_exception_handlers(); i++) {
1660 tty->print("B%d ", x->exception_handler_at(i)->block_id());
1661 }
1662 }
1663
1664 tty->cr();
1665 }
1666
1667 void print_LIR(BlockList* blocks) {
1668 tty->print_cr("LIR:");
1669 int i;
1670 for (i = 0; i < blocks->length(); i++) {
1671 BlockBegin* bb = blocks->at(i);
1672 print_block(bb);
1673 tty->print("__id_Instruction___________________________________________"); tty->cr();
1674 bb->lir()->print_instructions();
1675 }
1676 }
1677
1678 void LIR_List::print_instructions() {
1679 for (int i = 0; i < _operations.length(); i++) {
1680 _operations.at(i)->print(); tty->cr();
1681 }
1682 tty->cr();
1683 }
1684
1685 // LIR_Ops printing routines
1686 // LIR_Op
1687 void LIR_Op::print_on(outputStream* out) const {
1688 if (id() != -1 || PrintCFGToFile) {
1689 out->print("%4d ", id());
1690 } else {
1691 out->print(" ");
1692 }
1693 out->print("%s ", name());
1694 print_instr(out);
1695 if (info() != NULL) out->print(" [bci:%d]", info()->stack()->bci());
1696 #ifdef ASSERT
1697 if (Verbose && _file != NULL) {
1698 out->print(" (%s:%d)", _file, _line);
1699 }
1700 #endif
1701 }
1702
1703 const char * LIR_Op::name() const {
1704 const char* s = NULL;
1705 switch(code()) {
1706 // LIR_Op0
1707 case lir_membar: s = "membar"; break;
1708 case lir_membar_acquire: s = "membar_acquire"; break;
1709 case lir_membar_release: s = "membar_release"; break;
1710 case lir_membar_loadload: s = "membar_loadload"; break;
1711 case lir_membar_storestore: s = "membar_storestore"; break;
1712 case lir_membar_loadstore: s = "membar_loadstore"; break;
1713 case lir_membar_storeload: s = "membar_storeload"; break;
1714 case lir_word_align: s = "word_align"; break;
1715 case lir_label: s = "label"; break;
1716 case lir_nop: s = "nop"; break;
1717 case lir_on_spin_wait: s = "on_spin_wait"; break;
1718 case lir_backwardbranch_target: s = "backbranch"; break;
1719 case lir_std_entry: s = "std_entry"; break;
1720 case lir_osr_entry: s = "osr_entry"; break;
1721 case lir_build_frame: s = "build_frm"; break;
1722 case lir_fpop_raw: s = "fpop_raw"; break;
1723 case lir_24bit_FPU: s = "24bit_FPU"; break;
1724 case lir_reset_FPU: s = "reset_FPU"; break;
1725 case lir_breakpoint: s = "breakpoint"; break;
1726 case lir_get_thread: s = "get_thread"; break;
1727 // LIR_Op1
1728 case lir_fxch: s = "fxch"; break;
1729 case lir_fld: s = "fld"; break;
1730 case lir_ffree: s = "ffree"; break;
1731 case lir_push: s = "push"; break;
1732 case lir_pop: s = "pop"; break;
1733 case lir_null_check: s = "null_check"; break;
1734 case lir_return: s = "return"; break;
1735 case lir_safepoint: s = "safepoint"; break;
1736 case lir_leal: s = "leal"; break;
1737 case lir_branch: s = "branch"; break;
1738 case lir_cond_float_branch: s = "flt_cond_br"; break;
1739 case lir_move: s = "move"; break;
1740 case lir_roundfp: s = "roundfp"; break;
1741 case lir_rtcall: s = "rtcall"; break;
1742 case lir_throw: s = "throw"; break;
1743 case lir_unwind: s = "unwind"; break;
1744 case lir_convert: s = "convert"; break;
1745 case lir_alloc_object: s = "alloc_obj"; break;
1746 case lir_monaddr: s = "mon_addr"; break;
1747 case lir_pack64: s = "pack64"; break;
1748 case lir_unpack64: s = "unpack64"; break;
1749 // LIR_Op2
1750 case lir_cmp: s = "cmp"; break;
1751 case lir_cmp_l2i: s = "cmp_l2i"; break;
1752 case lir_ucmp_fd2i: s = "ucomp_fd2i"; break;
1753 case lir_cmp_fd2i: s = "comp_fd2i"; break;
1754 case lir_cmove: s = "cmove"; break;
1755 case lir_add: s = "add"; break;
1756 case lir_sub: s = "sub"; break;
1757 case lir_mul: s = "mul"; break;
1758 case lir_mul_strictfp: s = "mul_strictfp"; break;
1759 case lir_div: s = "div"; break;
1760 case lir_div_strictfp: s = "div_strictfp"; break;
1761 case lir_rem: s = "rem"; break;
1762 case lir_abs: s = "abs"; break;
1763 case lir_neg: s = "neg"; break;
1764 case lir_sqrt: s = "sqrt"; break;
1765 case lir_logic_and: s = "logic_and"; break;
1766 case lir_logic_or: s = "logic_or"; break;
1767 case lir_logic_xor: s = "logic_xor"; break;
1768 case lir_shl: s = "shift_left"; break;
1769 case lir_shr: s = "shift_right"; break;
1770 case lir_ushr: s = "ushift_right"; break;
1771 case lir_alloc_array: s = "alloc_array"; break;
1772 case lir_xadd: s = "xadd"; break;
1773 case lir_xchg: s = "xchg"; break;
1774 // LIR_Op3
1775 case lir_idiv: s = "idiv"; break;
1776 case lir_irem: s = "irem"; break;
1777 case lir_fmad: s = "fmad"; break;
1778 case lir_fmaf: s = "fmaf"; break;
1779 // LIR_OpJavaCall
1780 case lir_static_call: s = "static"; break;
1781 case lir_optvirtual_call: s = "optvirtual"; break;
1782 case lir_icvirtual_call: s = "icvirtual"; break;
1783 case lir_virtual_call: s = "virtual"; break;
1784 case lir_dynamic_call: s = "dynamic"; break;
1785 // LIR_OpArrayCopy
1786 case lir_arraycopy: s = "arraycopy"; break;
1787 // LIR_OpUpdateCRC32
1788 case lir_updatecrc32: s = "updatecrc32"; break;
1789 // LIR_OpLock
1790 case lir_lock: s = "lock"; break;
1791 case lir_unlock: s = "unlock"; break;
1792 // LIR_OpDelay
1793 case lir_delay_slot: s = "delay"; break;
1794 // LIR_OpTypeCheck
1795 case lir_instanceof: s = "instanceof"; break;
1796 case lir_checkcast: s = "checkcast"; break;
1797 case lir_store_check: s = "store_check"; break;
1798 // LIR_OpFlattenedArrayCheck
1799 case lir_flattened_array_check: s = "flattened_array_check"; break;
1800 // LIR_OpNullFreeArrayCheck
1801 case lir_null_free_array_check: s = "null_free_array_check"; break;
1802 // LIR_OpCompareAndSwap
1803 case lir_cas_long: s = "cas_long"; break;
1804 case lir_cas_obj: s = "cas_obj"; break;
1805 case lir_cas_int: s = "cas_int"; break;
1806 // LIR_OpProfileCall
1807 case lir_profile_call: s = "profile_call"; break;
1808 // LIR_OpProfileType
1809 case lir_profile_type: s = "profile_type"; break;
1810 // LIR_OpAssert
1811 #ifdef ASSERT
1812 case lir_assert: s = "assert"; break;
1813 #endif
1814 case lir_none: ShouldNotReachHere();break;
1815 default: s = "illegal_op"; break;
1816 }
1817 return s;
1818 }
1819
1820 // LIR_OpJavaCall
1821 void LIR_OpJavaCall::print_instr(outputStream* out) const {
1822 out->print("call: ");
1823 out->print("[addr: " INTPTR_FORMAT "]", p2i(address()));
1824 if (receiver()->is_valid()) {
1825 out->print(" [recv: "); receiver()->print(out); out->print("]");
1826 }
1827 if (result_opr()->is_valid()) {
1828 out->print(" [result: "); result_opr()->print(out); out->print("]");
1829 }
1830 }
1831
1832 // LIR_OpLabel
1833 void LIR_OpLabel::print_instr(outputStream* out) const {
1834 out->print("[label:" INTPTR_FORMAT "]", p2i(_label));
1835 }
1836
1837 // LIR_OpArrayCopy
1838 void LIR_OpArrayCopy::print_instr(outputStream* out) const {
1839 src()->print(out); out->print(" ");
1840 src_pos()->print(out); out->print(" ");
1841 dst()->print(out); out->print(" ");
1842 dst_pos()->print(out); out->print(" ");
1843 length()->print(out); out->print(" ");
1844 tmp()->print(out); out->print(" ");
1845 }
1846
1847 // LIR_OpUpdateCRC32
1848 void LIR_OpUpdateCRC32::print_instr(outputStream* out) const {
1849 crc()->print(out); out->print(" ");
1850 val()->print(out); out->print(" ");
1851 result_opr()->print(out); out->print(" ");
1852 }
1853
1854 // LIR_OpCompareAndSwap
1855 void LIR_OpCompareAndSwap::print_instr(outputStream* out) const {
1856 addr()->print(out); out->print(" ");
1857 cmp_value()->print(out); out->print(" ");
1858 new_value()->print(out); out->print(" ");
1859 tmp1()->print(out); out->print(" ");
1860 tmp2()->print(out); out->print(" ");
1861
1862 }
1863
1864 // LIR_Op0
1865 void LIR_Op0::print_instr(outputStream* out) const {
1866 result_opr()->print(out);
1867 }
1868
1869 // LIR_Op1
1870 const char * LIR_Op1::name() const {
1871 if (code() == lir_move) {
1872 switch (move_kind()) {
1873 case lir_move_normal:
1874 return "move";
1875 case lir_move_unaligned:
1876 return "unaligned move";
1877 case lir_move_volatile:
1878 return "volatile_move";
1879 case lir_move_wide:
1880 return "wide_move";
1881 default:
1882 ShouldNotReachHere();
1883 return "illegal_op";
1884 }
1885 } else {
1886 return LIR_Op::name();
1887 }
1888 }
1889
1890
1891 void LIR_Op1::print_instr(outputStream* out) const {
1892 _opr->print(out); out->print(" ");
1893 result_opr()->print(out); out->print(" ");
1894 print_patch_code(out, patch_code());
1895 }
1896
1897
1898 // LIR_Op1
1899 void LIR_OpRTCall::print_instr(outputStream* out) const {
1900 intx a = (intx)addr();
1901 out->print("%s", Runtime1::name_for_address(addr()));
1902 out->print(" ");
1903 tmp()->print(out);
1904 }
1905
1906 void LIR_Op1::print_patch_code(outputStream* out, LIR_PatchCode code) {
1907 switch(code) {
1908 case lir_patch_none: break;
1909 case lir_patch_low: out->print("[patch_low]"); break;
1910 case lir_patch_high: out->print("[patch_high]"); break;
1911 case lir_patch_normal: out->print("[patch_normal]"); break;
1912 default: ShouldNotReachHere();
1913 }
1914 }
1915
1916 // LIR_OpBranch
1917 void LIR_OpBranch::print_instr(outputStream* out) const {
1918 print_condition(out, cond()); out->print(" ");
1919 if (block() != NULL) {
1920 out->print("[B%d] ", block()->block_id());
1921 } else if (stub() != NULL) {
1922 out->print("[");
1923 stub()->print_name(out);
1924 out->print(": " INTPTR_FORMAT "]", p2i(stub()));
1925 if (stub()->info() != NULL) out->print(" [bci:%d]", stub()->info()->stack()->bci());
1926 } else {
1927 out->print("[label:" INTPTR_FORMAT "] ", p2i(label()));
1928 }
1929 if (ublock() != NULL) {
1930 out->print("unordered: [B%d] ", ublock()->block_id());
1931 }
1932 }
1933
1934 void LIR_Op::print_condition(outputStream* out, LIR_Condition cond) {
1935 switch(cond) {
1936 case lir_cond_equal: out->print("[EQ]"); break;
1937 case lir_cond_notEqual: out->print("[NE]"); break;
1938 case lir_cond_less: out->print("[LT]"); break;
1939 case lir_cond_lessEqual: out->print("[LE]"); break;
1940 case lir_cond_greaterEqual: out->print("[GE]"); break;
1941 case lir_cond_greater: out->print("[GT]"); break;
1942 case lir_cond_belowEqual: out->print("[BE]"); break;
1943 case lir_cond_aboveEqual: out->print("[AE]"); break;
1944 case lir_cond_always: out->print("[AL]"); break;
1945 default: out->print("[%d]",cond); break;
1946 }
1947 }
1948
1949 // LIR_OpConvert
1950 void LIR_OpConvert::print_instr(outputStream* out) const {
1951 print_bytecode(out, bytecode());
1952 in_opr()->print(out); out->print(" ");
1953 result_opr()->print(out); out->print(" ");
1954 #ifdef PPC32
1955 if(tmp1()->is_valid()) {
1956 tmp1()->print(out); out->print(" ");
1957 tmp2()->print(out); out->print(" ");
1958 }
1959 #endif
1960 }
1961
1962 void LIR_OpConvert::print_bytecode(outputStream* out, Bytecodes::Code code) {
1963 switch(code) {
1964 case Bytecodes::_d2f: out->print("[d2f] "); break;
1965 case Bytecodes::_d2i: out->print("[d2i] "); break;
1966 case Bytecodes::_d2l: out->print("[d2l] "); break;
1967 case Bytecodes::_f2d: out->print("[f2d] "); break;
1968 case Bytecodes::_f2i: out->print("[f2i] "); break;
1969 case Bytecodes::_f2l: out->print("[f2l] "); break;
1970 case Bytecodes::_i2b: out->print("[i2b] "); break;
1971 case Bytecodes::_i2c: out->print("[i2c] "); break;
1972 case Bytecodes::_i2d: out->print("[i2d] "); break;
1973 case Bytecodes::_i2f: out->print("[i2f] "); break;
1974 case Bytecodes::_i2l: out->print("[i2l] "); break;
1975 case Bytecodes::_i2s: out->print("[i2s] "); break;
1976 case Bytecodes::_l2i: out->print("[l2i] "); break;
1977 case Bytecodes::_l2f: out->print("[l2f] "); break;
1978 case Bytecodes::_l2d: out->print("[l2d] "); break;
1979 default:
1980 out->print("[?%d]",code);
1981 break;
1982 }
1983 }
1984
1985 void LIR_OpAllocObj::print_instr(outputStream* out) const {
1986 klass()->print(out); out->print(" ");
1987 obj()->print(out); out->print(" ");
1988 tmp1()->print(out); out->print(" ");
1989 tmp2()->print(out); out->print(" ");
1990 tmp3()->print(out); out->print(" ");
1991 tmp4()->print(out); out->print(" ");
1992 out->print("[hdr:%d]", header_size()); out->print(" ");
1993 out->print("[obj:%d]", object_size()); out->print(" ");
1994 out->print("[lbl:" INTPTR_FORMAT "]", p2i(stub()->entry()));
1995 }
1996
1997 void LIR_OpRoundFP::print_instr(outputStream* out) const {
1998 _opr->print(out); out->print(" ");
1999 tmp()->print(out); out->print(" ");
2000 result_opr()->print(out); out->print(" ");
2001 }
2002
2003 // LIR_Op2
2004 void LIR_Op2::print_instr(outputStream* out) const {
2005 if (code() == lir_cmove || code() == lir_cmp) {
2006 print_condition(out, condition()); out->print(" ");
2007 }
2008 in_opr1()->print(out); out->print(" ");
2009 in_opr2()->print(out); out->print(" ");
2010 if (tmp1_opr()->is_valid()) { tmp1_opr()->print(out); out->print(" "); }
2011 if (tmp2_opr()->is_valid()) { tmp2_opr()->print(out); out->print(" "); }
2012 if (tmp3_opr()->is_valid()) { tmp3_opr()->print(out); out->print(" "); }
2013 if (tmp4_opr()->is_valid()) { tmp4_opr()->print(out); out->print(" "); }
2014 if (tmp5_opr()->is_valid()) { tmp5_opr()->print(out); out->print(" "); }
2015 result_opr()->print(out);
2016 }
2017
2018 void LIR_OpAllocArray::print_instr(outputStream* out) const {
2019 klass()->print(out); out->print(" ");
2020 len()->print(out); out->print(" ");
2021 obj()->print(out); out->print(" ");
2022 tmp1()->print(out); out->print(" ");
2023 tmp2()->print(out); out->print(" ");
2024 tmp3()->print(out); out->print(" ");
2025 tmp4()->print(out); out->print(" ");
2026 out->print("[type:0x%x]", type()); out->print(" ");
2027 out->print("[label:" INTPTR_FORMAT "]", p2i(stub()->entry()));
2028 }
2029
2030
2031 void LIR_OpTypeCheck::print_instr(outputStream* out) const {
2032 object()->print(out); out->print(" ");
2033 if (code() == lir_store_check) {
2034 array()->print(out); out->print(" ");
2035 }
2036 if (code() != lir_store_check) {
2037 klass()->print_name_on(out); out->print(" ");
2038 if (fast_check()) out->print("fast_check ");
2039 }
2040 tmp1()->print(out); out->print(" ");
2041 tmp2()->print(out); out->print(" ");
2042 tmp3()->print(out); out->print(" ");
2043 result_opr()->print(out); out->print(" ");
2044 if (info_for_exception() != NULL) out->print(" [bci:%d]", info_for_exception()->stack()->bci());
2045 }
2046
2047 void LIR_OpFlattenedArrayCheck::print_instr(outputStream* out) const {
2048 array()->print(out); out->print(" ");
2049 value()->print(out); out->print(" ");
2050 tmp()->print(out); out->print(" ");
2051 if (stub() != NULL) {
2052 out->print("[label:" INTPTR_FORMAT "]", p2i(stub()->entry()));
2053 }
2054 }
2055
2056 void LIR_OpNullFreeArrayCheck::print_instr(outputStream* out) const {
2057 array()->print(out); out->print(" ");
2058 tmp()->print(out); out->print(" ");
2059 }
2060
2061 // LIR_Op3
2062 void LIR_Op3::print_instr(outputStream* out) const {
2063 in_opr1()->print(out); out->print(" ");
2064 in_opr2()->print(out); out->print(" ");
2065 in_opr3()->print(out); out->print(" ");
2066 result_opr()->print(out);
2067 }
2068
2069
2070 void LIR_OpLock::print_instr(outputStream* out) const {
2071 hdr_opr()->print(out); out->print(" ");
2072 obj_opr()->print(out); out->print(" ");
2073 lock_opr()->print(out); out->print(" ");
2074 if (_scratch->is_valid()) {
2075 _scratch->print(out); out->print(" ");
2076 }
2077 out->print("[lbl:" INTPTR_FORMAT "]", p2i(stub()->entry()));
2078 }
2079
2080 #ifdef ASSERT
2081 void LIR_OpAssert::print_instr(outputStream* out) const {
2082 print_condition(out, condition()); out->print(" ");
2083 in_opr1()->print(out); out->print(" ");
2084 in_opr2()->print(out); out->print(", \"");
2085 out->print("%s", msg()); out->print("\"");
2086 }
2087 #endif
2088
2089
2090 void LIR_OpDelay::print_instr(outputStream* out) const {
2091 _op->print_on(out);
2092 }
2093
2094
2095 // LIR_OpProfileCall
2096 void LIR_OpProfileCall::print_instr(outputStream* out) const {
2097 profiled_method()->name()->print_symbol_on(out);
2098 out->print(".");
2099 profiled_method()->holder()->name()->print_symbol_on(out);
2100 out->print(" @ %d ", profiled_bci());
2101 mdo()->print(out); out->print(" ");
2102 recv()->print(out); out->print(" ");
2103 tmp1()->print(out); out->print(" ");
2104 }
2105
2106 // LIR_OpProfileType
2107 void LIR_OpProfileType::print_instr(outputStream* out) const {
2108 out->print("exact = ");
2109 if (exact_klass() == NULL) {
2110 out->print("unknown");
2111 } else {
2112 exact_klass()->print_name_on(out);
2113 }
2114 out->print(" current = "); ciTypeEntries::print_ciklass(out, current_klass());
2115 out->print(" ");
2116 mdp()->print(out); out->print(" ");
2117 obj()->print(out); out->print(" ");
2118 tmp()->print(out); out->print(" ");
2119 }
2120
2121 #endif // PRODUCT
2122
2123 // Implementation of LIR_InsertionBuffer
2124
2125 void LIR_InsertionBuffer::append(int index, LIR_Op* op) {
2126 assert(_index_and_count.length() % 2 == 0, "must have a count for each index");
2127
2128 int i = number_of_insertion_points() - 1;
2129 if (i < 0 || index_at(i) < index) {
2130 append_new(index, 1);
2131 } else {
2132 assert(index_at(i) == index, "can append LIR_Ops in ascending order only");
2133 assert(count_at(i) > 0, "check");
2134 set_count_at(i, count_at(i) + 1);
2135 }
2136 _ops.push(op);
2137
2138 DEBUG_ONLY(verify());
2139 }
2140
2141 #ifdef ASSERT
2142 void LIR_InsertionBuffer::verify() {
2143 int sum = 0;
2144 int prev_idx = -1;
2145
2146 for (int i = 0; i < number_of_insertion_points(); i++) {
2147 assert(prev_idx < index_at(i), "index must be ordered ascending");
2148 sum += count_at(i);
2149 }
2150 assert(sum == number_of_ops(), "wrong total sum");
2151 }
2152 #endif