1 /*
2 * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
6 * This code is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 only, as
8 * published by the Free Software Foundation.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 *
24 */
25
26 #include "asm/macroAssembler.inline.hpp"
27 #include "c1/c1_Compilation.hpp"
28 #include "c1/c1_LIRAssembler.hpp"
29 #include "c1/c1_MacroAssembler.hpp"
30 #include "c1/c1_Runtime1.hpp"
31 #include "c1/c1_ValueStack.hpp"
32 #include "ci/ciArrayKlass.hpp"
33 #include "ci/ciInstance.hpp"
34 #include "gc/shared/collectedHeap.hpp"
35 #include "memory/universe.hpp"
36 #include "nativeInst_ppc.hpp"
37 #include "oops/compressedOops.hpp"
38 #include "oops/objArrayKlass.hpp"
39 #include "runtime/frame.inline.hpp"
40 #include "runtime/os.inline.hpp"
41 #include "runtime/safepointMechanism.inline.hpp"
42 #include "runtime/sharedRuntime.hpp"
43 #include "runtime/stubRoutines.hpp"
44 #include "runtime/vm_version.hpp"
45 #include "utilities/macros.hpp"
46 #include "utilities/powerOfTwo.hpp"
47
48 #define __ _masm->
49
50
51 const ConditionRegister LIR_Assembler::BOOL_RESULT = CR5;
52
53
54 bool LIR_Assembler::is_small_constant(LIR_Opr opr) {
55 Unimplemented(); return false; // Currently not used on this platform.
56 }
57
58
59 LIR_Opr LIR_Assembler::receiverOpr() {
60 return FrameMap::R3_oop_opr;
61 }
62
63
64 LIR_Opr LIR_Assembler::osrBufferPointer() {
65 return FrameMap::R3_opr;
66 }
67
68
69 // This specifies the stack pointer decrement needed to build the frame.
70 int LIR_Assembler::initial_frame_size_in_bytes() const {
71 return in_bytes(frame_map()->framesize_in_bytes());
72 }
73
74
75 // Inline cache check: the inline cached class is in inline_cache_reg;
76 // we fetch the class of the receiver and compare it with the cached class.
77 // If they do not match we jump to slow case.
78 int LIR_Assembler::check_icache() {
79 return __ ic_check(CodeEntryAlignment);
80 }
81
82 void LIR_Assembler::clinit_barrier(ciMethod* method) {
83 assert(!method->holder()->is_not_initialized(), "initialization should have been started");
84
85 Label L_skip_barrier;
86 Register klass = R20;
87
88 metadata2reg(method->holder()->constant_encoding(), klass);
89 __ clinit_barrier(klass, R16_thread, &L_skip_barrier /*L_fast_path*/);
90
91 __ load_const_optimized(klass, SharedRuntime::get_handle_wrong_method_stub(), R0);
92 __ mtctr(klass);
93 __ bctr();
94
95 __ bind(L_skip_barrier);
96 }
97
98 void LIR_Assembler::osr_entry() {
99 // On-stack-replacement entry sequence:
100 //
101 // 1. Create a new compiled activation.
102 // 2. Initialize local variables in the compiled activation. The expression
103 // stack must be empty at the osr_bci; it is not initialized.
104 // 3. Jump to the continuation address in compiled code to resume execution.
105
106 // OSR entry point
107 offsets()->set_value(CodeOffsets::OSR_Entry, code_offset());
108 BlockBegin* osr_entry = compilation()->hir()->osr_entry();
109 ValueStack* entry_state = osr_entry->end()->state();
110 int number_of_locks = entry_state->locks_size();
111
112 // Create a frame for the compiled activation.
113 __ build_frame(initial_frame_size_in_bytes(), bang_size_in_bytes());
114
115 // OSR buffer is
116 //
117 // locals[nlocals-1..0]
118 // monitors[number_of_locks-1..0]
119 //
120 // Locals is a direct copy of the interpreter frame so in the osr buffer
121 // the first slot in the local array is the last local from the interpreter
122 // and the last slot is local[0] (receiver) from the interpreter.
123 //
124 // Similarly with locks. The first lock slot in the osr buffer is the nth lock
125 // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock
126 // in the interpreter frame (the method lock if a sync method).
127
128 // Initialize monitors in the compiled activation.
129 // R3: pointer to osr buffer
130 //
131 // All other registers are dead at this point and the locals will be
132 // copied into place by code emitted in the IR.
133
134 Register OSR_buf = osrBufferPointer()->as_register();
135 {
136 assert(frame::interpreter_frame_monitor_size() == BasicObjectLock::size(), "adjust code below");
137
138 const int locals_space = BytesPerWord * method()->max_locals();
139 int monitor_offset = locals_space + (2 * BytesPerWord) * (number_of_locks - 1);
140 bool use_OSR_bias = false;
141
142 if (!Assembler::is_simm16(monitor_offset + BytesPerWord) && number_of_locks > 0) {
143 // Offsets too large for ld instructions. Use bias.
144 __ add_const_optimized(OSR_buf, OSR_buf, locals_space);
145 monitor_offset -= locals_space;
146 use_OSR_bias = true;
147 }
148
149 // SharedRuntime::OSR_migration_begin() packs BasicObjectLocks in
150 // the OSR buffer using 2 word entries: first the lock and then
151 // the oop.
152 for (int i = 0; i < number_of_locks; i++) {
153 int slot_offset = monitor_offset - ((i * 2) * BytesPerWord);
154 #ifdef ASSERT
155 // Verify the interpreter's monitor has a non-null object.
156 {
157 Label L;
158 __ ld(R0, slot_offset + 1*BytesPerWord, OSR_buf);
159 __ cmpdi(CR0, R0, 0);
160 __ bne(CR0, L);
161 __ stop("locked object is null");
162 __ bind(L);
163 }
164 #endif // ASSERT
165 // Copy the lock field into the compiled activation.
166 Address ml = frame_map()->address_for_monitor_lock(i),
167 mo = frame_map()->address_for_monitor_object(i);
168 assert(ml.index() == noreg && mo.index() == noreg, "sanity");
169 __ ld(R0, slot_offset + 0, OSR_buf);
170 __ std(R0, ml);
171 __ ld(R0, slot_offset + 1*BytesPerWord, OSR_buf);
172 __ std(R0, mo);
173 }
174
175 if (use_OSR_bias) {
176 // Restore.
177 __ sub_const_optimized(OSR_buf, OSR_buf, locals_space);
178 }
179 }
180 }
181
182
183 int LIR_Assembler::emit_exception_handler() {
184 // Generate code for the exception handler.
185 address handler_base = __ start_a_stub(exception_handler_size());
186
187 if (handler_base == nullptr) {
188 // Not enough space left for the handler.
189 bailout("exception handler overflow");
190 return -1;
191 }
192
193 int offset = code_offset();
194 address entry_point = CAST_FROM_FN_PTR(address, Runtime1::entry_for(StubId::c1_handle_exception_from_callee_id));
195 //__ load_const_optimized(R0, entry_point);
196 __ add_const_optimized(R0, R29_TOC, MacroAssembler::offset_to_global_toc(entry_point));
197 __ mtctr(R0);
198 __ bctr();
199
200 guarantee(code_offset() - offset <= exception_handler_size(), "overflow");
201 __ end_a_stub();
202
203 return offset;
204 }
205
206
207 // Emit the code to remove the frame from the stack in the exception
208 // unwind path.
209 int LIR_Assembler::emit_unwind_handler() {
210 _masm->block_comment("Unwind handler");
211
212 int offset = code_offset();
213 bool preserve_exception = method()->is_synchronized();
214 const Register Rexception = R3 /*LIRGenerator::exceptionOopOpr()*/, Rexception_save = R31;
215
216 // Fetch the exception from TLS and clear out exception related thread state.
217 __ ld(Rexception, in_bytes(JavaThread::exception_oop_offset()), R16_thread);
218 __ li(R0, 0);
219 __ std(R0, in_bytes(JavaThread::exception_oop_offset()), R16_thread);
220 __ std(R0, in_bytes(JavaThread::exception_pc_offset()), R16_thread);
221
222 __ bind(_unwind_handler_entry);
223 __ verify_not_null_oop(Rexception);
224 if (preserve_exception) { __ mr(Rexception_save, Rexception); }
225
226 // Perform needed unlocking
227 MonitorExitStub* stub = nullptr;
228 if (method()->is_synchronized()) {
229 monitor_address(0, FrameMap::R4_opr);
230 stub = new MonitorExitStub(FrameMap::R4_opr, 0);
231 __ unlock_object(R5, R6, R4, *stub->entry());
232 __ bind(*stub->continuation());
233 }
234
235 // Dispatch to the unwind logic.
236 address unwind_stub = Runtime1::entry_for(StubId::c1_unwind_exception_id);
237 //__ load_const_optimized(R0, unwind_stub);
238 __ add_const_optimized(R0, R29_TOC, MacroAssembler::offset_to_global_toc(unwind_stub));
239 if (preserve_exception) { __ mr(Rexception, Rexception_save); }
240 __ mtctr(R0);
241 __ bctr();
242
243 // Emit the slow path assembly.
244 if (stub != nullptr) {
245 stub->emit_code(this);
246 }
247
248 return offset;
249 }
250
251
252 int LIR_Assembler::emit_deopt_handler() {
253 // Generate code for deopt handler.
254 address handler_base = __ start_a_stub(deopt_handler_size());
255
256 if (handler_base == nullptr) {
257 // Not enough space left for the handler.
258 bailout("deopt handler overflow");
259 return -1;
260 }
261
262 int offset = code_offset();
263 Label start;
264
265 __ bind(start);
266 __ bl64_patchable(SharedRuntime::deopt_blob()->unpack(), relocInfo::runtime_call_type);
267 int entry_offset = __ offset();
268 __ b(start);
269
270 guarantee(code_offset() - offset <= deopt_handler_size(), "overflow");
271 assert(code_offset() - entry_offset >= NativePostCallNop::first_check_size,
272 "out of bounds read in post-call NOP check");
273 __ end_a_stub();
274
275 return entry_offset;
276 }
277
278
279 void LIR_Assembler::jobject2reg(jobject o, Register reg) {
280 if (o == nullptr) {
281 __ li(reg, 0);
282 } else {
283 AddressLiteral addrlit = __ constant_oop_address(o);
284 __ load_const(reg, addrlit, (reg != R0) ? R0 : noreg);
285 }
286 }
287
288
289 void LIR_Assembler::jobject2reg_with_patching(Register reg, CodeEmitInfo *info) {
290 // Allocate a new index in table to hold the object once it's been patched.
291 int oop_index = __ oop_recorder()->allocate_oop_index(nullptr);
292 PatchingStub* patch = new PatchingStub(_masm, patching_id(info), oop_index);
293
294 AddressLiteral addrlit((address)nullptr, oop_Relocation::spec(oop_index));
295 __ load_const(reg, addrlit, R0);
296
297 patching_epilog(patch, lir_patch_normal, reg, info);
298 }
299
300
301 void LIR_Assembler::metadata2reg(Metadata* o, Register reg) {
302 AddressLiteral md = __ constant_metadata_address(o); // Notify OOP recorder (don't need the relocation)
303 __ load_const_optimized(reg, md.value(), (reg != R0) ? R0 : noreg);
304 }
305
306
307 void LIR_Assembler::klass2reg_with_patching(Register reg, CodeEmitInfo *info) {
308 // Allocate a new index in table to hold the klass once it's been patched.
309 int index = __ oop_recorder()->allocate_metadata_index(nullptr);
310 PatchingStub* patch = new PatchingStub(_masm, PatchingStub::load_klass_id, index);
311
312 AddressLiteral addrlit((address)nullptr, metadata_Relocation::spec(index));
313 assert(addrlit.rspec().type() == relocInfo::metadata_type, "must be an metadata reloc");
314 __ load_const(reg, addrlit, R0);
315
316 patching_epilog(patch, lir_patch_normal, reg, info);
317 }
318
319
320 void LIR_Assembler::arithmetic_idiv(LIR_Code code, LIR_Opr left, LIR_Opr right, LIR_Opr temp, LIR_Opr result, CodeEmitInfo* info) {
321 const bool is_int = result->is_single_cpu();
322 Register Rdividend = is_int ? left->as_register() : left->as_register_lo();
323 Register Rdivisor = noreg;
324 Register Rscratch = temp->as_register();
325 Register Rresult = is_int ? result->as_register() : result->as_register_lo();
326 long divisor = -1;
327
328 if (right->is_register()) {
329 Rdivisor = is_int ? right->as_register() : right->as_register_lo();
330 } else {
331 divisor = is_int ? right->as_constant_ptr()->as_jint()
332 : right->as_constant_ptr()->as_jlong();
333 }
334
335 assert(Rdividend != Rscratch, "");
336 assert(Rdivisor != Rscratch, "");
337 assert(code == lir_idiv || code == lir_irem, "Must be irem or idiv");
338
339 if (Rdivisor == noreg) {
340 if (divisor == 1) { // stupid, but can happen
341 if (code == lir_idiv) {
342 __ mr_if_needed(Rresult, Rdividend);
343 } else {
344 __ li(Rresult, 0);
345 }
346
347 } else if (is_power_of_2(divisor)) {
348 // Convert division by a power of two into some shifts and logical operations.
349 int log2 = log2i_exact(divisor);
350
351 // Round towards 0.
352 if (divisor == 2) {
353 if (is_int) {
354 __ srwi(Rscratch, Rdividend, 31);
355 } else {
356 __ srdi(Rscratch, Rdividend, 63);
357 }
358 } else {
359 if (is_int) {
360 __ srawi(Rscratch, Rdividend, 31);
361 } else {
362 __ sradi(Rscratch, Rdividend, 63);
363 }
364 __ clrldi(Rscratch, Rscratch, 64-log2);
365 }
366 __ add(Rscratch, Rdividend, Rscratch);
367
368 if (code == lir_idiv) {
369 if (is_int) {
370 __ srawi(Rresult, Rscratch, log2);
371 } else {
372 __ sradi(Rresult, Rscratch, log2);
373 }
374 } else { // lir_irem
375 __ clrrdi(Rscratch, Rscratch, log2);
376 __ sub(Rresult, Rdividend, Rscratch);
377 }
378
379 } else if (divisor == -1) {
380 if (code == lir_idiv) {
381 __ neg(Rresult, Rdividend);
382 } else {
383 __ li(Rresult, 0);
384 }
385
386 } else {
387 __ load_const_optimized(Rscratch, divisor);
388 if (code == lir_idiv) {
389 if (is_int) {
390 __ divw(Rresult, Rdividend, Rscratch); // Can't divide minint/-1.
391 } else {
392 __ divd(Rresult, Rdividend, Rscratch); // Can't divide minint/-1.
393 }
394 } else {
395 assert(Rscratch != R0, "need both");
396 if (is_int) {
397 __ divw(R0, Rdividend, Rscratch); // Can't divide minint/-1.
398 __ mullw(Rscratch, R0, Rscratch);
399 } else {
400 __ divd(R0, Rdividend, Rscratch); // Can't divide minint/-1.
401 __ mulld(Rscratch, R0, Rscratch);
402 }
403 __ sub(Rresult, Rdividend, Rscratch);
404 }
405
406 }
407 return;
408 }
409
410 Label regular, done;
411 if (is_int) {
412 __ cmpwi(CR0, Rdivisor, -1);
413 } else {
414 __ cmpdi(CR0, Rdivisor, -1);
415 }
416 __ bne(CR0, regular);
417 if (code == lir_idiv) {
418 __ neg(Rresult, Rdividend);
419 __ b(done);
420 __ bind(regular);
421 if (is_int) {
422 __ divw(Rresult, Rdividend, Rdivisor); // Can't divide minint/-1.
423 } else {
424 __ divd(Rresult, Rdividend, Rdivisor); // Can't divide minint/-1.
425 }
426 } else { // lir_irem
427 __ li(Rresult, 0);
428 __ b(done);
429 __ bind(regular);
430 if (is_int) {
431 __ divw(Rscratch, Rdividend, Rdivisor); // Can't divide minint/-1.
432 __ mullw(Rscratch, Rscratch, Rdivisor);
433 } else {
434 __ divd(Rscratch, Rdividend, Rdivisor); // Can't divide minint/-1.
435 __ mulld(Rscratch, Rscratch, Rdivisor);
436 }
437 __ sub(Rresult, Rdividend, Rscratch);
438 }
439 __ bind(done);
440 }
441
442
443 void LIR_Assembler::emit_op3(LIR_Op3* op) {
444 switch (op->code()) {
445 case lir_idiv:
446 case lir_irem:
447 arithmetic_idiv(op->code(), op->in_opr1(), op->in_opr2(), op->in_opr3(),
448 op->result_opr(), op->info());
449 break;
450 case lir_fmad:
451 __ fmadd(op->result_opr()->as_double_reg(), op->in_opr1()->as_double_reg(),
452 op->in_opr2()->as_double_reg(), op->in_opr3()->as_double_reg());
453 break;
454 case lir_fmaf:
455 __ fmadds(op->result_opr()->as_float_reg(), op->in_opr1()->as_float_reg(),
456 op->in_opr2()->as_float_reg(), op->in_opr3()->as_float_reg());
457 break;
458 default: ShouldNotReachHere(); break;
459 }
460 }
461
462
463 void LIR_Assembler::emit_opBranch(LIR_OpBranch* op) {
464 #ifdef ASSERT
465 assert(op->block() == nullptr || op->block()->label() == op->label(), "wrong label");
466 if (op->block() != nullptr) _branch_target_blocks.append(op->block());
467 if (op->ublock() != nullptr) _branch_target_blocks.append(op->ublock());
468 assert(op->info() == nullptr, "shouldn't have CodeEmitInfo");
469 #endif
470
471 Label *L = op->label();
472 if (op->cond() == lir_cond_always) {
473 __ b(*L);
474 } else {
475 Label done;
476 bool is_unordered = false;
477 if (op->code() == lir_cond_float_branch) {
478 assert(op->ublock() != nullptr, "must have unordered successor");
479 is_unordered = true;
480 } else {
481 assert(op->code() == lir_branch, "just checking");
482 }
483
484 bool positive = false;
485 Assembler::Condition cond = Assembler::equal;
486 switch (op->cond()) {
487 case lir_cond_equal: positive = true ; cond = Assembler::equal ; is_unordered = false; break;
488 case lir_cond_notEqual: positive = false; cond = Assembler::equal ; is_unordered = false; break;
489 case lir_cond_less: positive = true ; cond = Assembler::less ; break;
490 case lir_cond_belowEqual: assert(op->code() != lir_cond_float_branch, ""); // fallthru
491 case lir_cond_lessEqual: positive = false; cond = Assembler::greater; break;
492 case lir_cond_greater: positive = true ; cond = Assembler::greater; break;
493 case lir_cond_aboveEqual: assert(op->code() != lir_cond_float_branch, ""); // fallthru
494 case lir_cond_greaterEqual: positive = false; cond = Assembler::less ; break;
495 default: ShouldNotReachHere();
496 }
497 int bo = positive ? Assembler::bcondCRbiIs1 : Assembler::bcondCRbiIs0;
498 int bi = Assembler::bi0(BOOL_RESULT, cond);
499 if (is_unordered) {
500 if (positive) {
501 if (op->ublock() == op->block()) {
502 __ bc_far_optimized(Assembler::bcondCRbiIs1, __ bi0(BOOL_RESULT, Assembler::summary_overflow), *L);
503 }
504 } else {
505 if (op->ublock() != op->block()) { __ bso(BOOL_RESULT, done); }
506 }
507 }
508 __ bc_far_optimized(bo, bi, *L);
509 __ bind(done);
510 }
511 }
512
513
514 void LIR_Assembler::emit_opConvert(LIR_OpConvert* op) {
515 Bytecodes::Code code = op->bytecode();
516 LIR_Opr src = op->in_opr(),
517 dst = op->result_opr();
518
519 switch(code) {
520 case Bytecodes::_i2l: {
521 __ extsw(dst->as_register_lo(), src->as_register());
522 break;
523 }
524 case Bytecodes::_l2i: {
525 __ mr_if_needed(dst->as_register(), src->as_register_lo()); // high bits are garbage
526 break;
527 }
528 case Bytecodes::_i2b: {
529 __ extsb(dst->as_register(), src->as_register());
530 break;
531 }
532 case Bytecodes::_i2c: {
533 __ clrldi(dst->as_register(), src->as_register(), 64-16);
534 break;
535 }
536 case Bytecodes::_i2s: {
537 __ extsh(dst->as_register(), src->as_register());
538 break;
539 }
540 case Bytecodes::_i2d:{
541 FloatRegister rdst = dst->as_double_reg();
542 // move src to dst register
543 __ mtfprwa(rdst, src->as_register());
544 __ fcfid(rdst, rdst);
545 break;
546 }
547 case Bytecodes::_l2d: {
548 FloatRegister rdst = dst->as_double_reg();
549 // move src to dst register
550 __ mtfprd(rdst, src->as_register_lo());
551 __ fcfid(rdst, rdst);
552 break;
553 }
554 case Bytecodes::_i2f:{
555 FloatRegister rdst = dst->as_float_reg();
556 // move src to dst register
557 __ mtfprwa(rdst, src->as_register());
558 __ fcfids(rdst, rdst);
559 break;
560 }
561 case Bytecodes::_l2f: {
562 FloatRegister rdst = dst->as_float_reg();
563 // move src to dst register
564 __ mtfprd(rdst, src->as_register_lo());
565 __ fcfids(rdst, rdst);
566 break;
567 }
568 case Bytecodes::_f2d: {
569 __ fmr_if_needed(dst->as_double_reg(), src->as_float_reg());
570 break;
571 }
572 case Bytecodes::_d2f: {
573 __ frsp(dst->as_float_reg(), src->as_double_reg());
574 break;
575 }
576 case Bytecodes::_d2i:
577 case Bytecodes::_f2i: {
578 FloatRegister rsrc = (code == Bytecodes::_d2i) ? src->as_double_reg() : src->as_float_reg();
579 Label L;
580 // Result must be 0 if value is NaN; test by comparing value to itself.
581 __ fcmpu(CR0, rsrc, rsrc);
582 __ li(dst->as_register(), 0);
583 __ bso(CR0, L);
584 __ fctiwz(rsrc, rsrc); // USE_KILL
585 __ mffprd(dst->as_register(), rsrc);
586 __ bind(L);
587 break;
588 }
589 case Bytecodes::_d2l:
590 case Bytecodes::_f2l: {
591 FloatRegister rsrc = (code == Bytecodes::_d2l) ? src->as_double_reg() : src->as_float_reg();
592 Label L;
593 // Result must be 0 if value is NaN; test by comparing value to itself.
594 __ fcmpu(CR0, rsrc, rsrc);
595 __ li(dst->as_register_lo(), 0);
596 __ bso(CR0, L);
597 __ fctidz(rsrc, rsrc); // USE_KILL
598 __ mffprd(dst->as_register_lo(), rsrc);
599 __ bind(L);
600 break;
601 }
602
603 default: ShouldNotReachHere();
604 }
605 }
606
607
608 void LIR_Assembler::align_call(LIR_Code) {
609 // do nothing since all instructions are word aligned on ppc
610 }
611
612 void LIR_Assembler::call(LIR_OpJavaCall* op, relocInfo::relocType rtype) {
613 assert(rtype==relocInfo::opt_virtual_call_type || rtype==relocInfo::static_call_type, "unexpected rtype");
614
615 address call_pc = __ trampoline_call(AddressLiteral(op->addr(), rtype));
616 if (call_pc == nullptr) {
617 bailout("const/stub overflow in call with trampoline");
618 return;
619 }
620 add_call_info(code_offset(), op->info());
621 __ post_call_nop();
622 }
623
624 void LIR_Assembler::ic_call(LIR_OpJavaCall* op) {
625 __ calculate_address_from_global_toc(R2_TOC, __ method_toc());
626 bool success = __ ic_call(R2_TOC, op->addr());
627 if (!success) {
628 bailout("const/stub overflow in ic_call with trampoline");
629 return;
630 }
631 add_call_info(code_offset(), op->info());
632 __ post_call_nop();
633 }
634
635 void LIR_Assembler::explicit_null_check(Register addr, CodeEmitInfo* info) {
636 ImplicitNullCheckStub* stub = new ImplicitNullCheckStub(code_offset(), info);
637 __ null_check(addr, stub->entry());
638 append_code_stub(stub);
639 }
640
641
642 // Attention: caller must encode oop if needed
643 int LIR_Assembler::store(LIR_Opr from_reg, Register base, int offset, BasicType type, bool wide) {
644 int store_offset;
645 if (!Assembler::is_simm16(offset)) {
646 // For offsets larger than a simm16 we setup the offset.
647 assert(wide && !from_reg->is_same_register(FrameMap::R0_opr), "large offset only supported in special case");
648 __ load_const_optimized(R0, offset);
649 store_offset = store(from_reg, base, R0, type, wide);
650 } else {
651 store_offset = code_offset();
652 switch (type) {
653 case T_BOOLEAN: // fall through
654 case T_BYTE : __ stb(from_reg->as_register(), offset, base); break;
655 case T_CHAR :
656 case T_SHORT : __ sth(from_reg->as_register(), offset, base); break;
657 case T_INT : __ stw(from_reg->as_register(), offset, base); break;
658 case T_LONG : __ std(from_reg->as_register_lo(), offset, base); break;
659 case T_ADDRESS:
660 case T_METADATA: __ std(from_reg->as_register(), offset, base); break;
661 case T_ARRAY : // fall through
662 case T_OBJECT:
663 {
664 if (UseCompressedOops && !wide) {
665 // Encoding done in caller
666 __ stw(from_reg->as_register(), offset, base);
667 __ verify_coop(from_reg->as_register(), FILE_AND_LINE);
668 } else {
669 __ std(from_reg->as_register(), offset, base);
670 if (VerifyOops) {
671 BarrierSetAssembler* bs = BarrierSet::barrier_set()->barrier_set_assembler();
672 bs->check_oop(_masm, from_reg->as_register(), FILE_AND_LINE); // kills R0
673 }
674 }
675 break;
676 }
677 case T_FLOAT : __ stfs(from_reg->as_float_reg(), offset, base); break;
678 case T_DOUBLE: __ stfd(from_reg->as_double_reg(), offset, base); break;
679 default : ShouldNotReachHere();
680 }
681 }
682 return store_offset;
683 }
684
685
686 // Attention: caller must encode oop if needed
687 int LIR_Assembler::store(LIR_Opr from_reg, Register base, Register disp, BasicType type, bool wide) {
688 int store_offset = code_offset();
689 switch (type) {
690 case T_BOOLEAN: // fall through
691 case T_BYTE : __ stbx(from_reg->as_register(), base, disp); break;
692 case T_CHAR :
693 case T_SHORT : __ sthx(from_reg->as_register(), base, disp); break;
694 case T_INT : __ stwx(from_reg->as_register(), base, disp); break;
695 case T_LONG :
696 #ifdef _LP64
697 __ stdx(from_reg->as_register_lo(), base, disp);
698 #else
699 Unimplemented();
700 #endif
701 break;
702 case T_ADDRESS:
703 __ stdx(from_reg->as_register(), base, disp);
704 break;
705 case T_ARRAY : // fall through
706 case T_OBJECT:
707 {
708 if (UseCompressedOops && !wide) {
709 // Encoding done in caller.
710 __ stwx(from_reg->as_register(), base, disp);
711 __ verify_coop(from_reg->as_register(), FILE_AND_LINE); // kills R0
712 } else {
713 __ stdx(from_reg->as_register(), base, disp);
714 if (VerifyOops) {
715 BarrierSetAssembler* bs = BarrierSet::barrier_set()->barrier_set_assembler();
716 bs->check_oop(_masm, from_reg->as_register(), FILE_AND_LINE); // kills R0
717 }
718 }
719 break;
720 }
721 case T_FLOAT : __ stfsx(from_reg->as_float_reg(), base, disp); break;
722 case T_DOUBLE: __ stfdx(from_reg->as_double_reg(), base, disp); break;
723 default : ShouldNotReachHere();
724 }
725 return store_offset;
726 }
727
728
729 int LIR_Assembler::load(Register base, int offset, LIR_Opr to_reg, BasicType type, bool wide) {
730 int load_offset;
731 if (!Assembler::is_simm16(offset)) {
732 // For offsets larger than a simm16 we setup the offset.
733 __ load_const_optimized(R0, offset);
734 load_offset = load(base, R0, to_reg, type, wide);
735 } else {
736 load_offset = code_offset();
737 switch(type) {
738 case T_BOOLEAN: // fall through
739 case T_BYTE : __ lbz(to_reg->as_register(), offset, base);
740 __ extsb(to_reg->as_register(), to_reg->as_register()); break;
741 case T_CHAR : __ lhz(to_reg->as_register(), offset, base); break;
742 case T_SHORT : __ lha(to_reg->as_register(), offset, base); break;
743 case T_INT : __ lwa(to_reg->as_register(), offset, base); break;
744 case T_LONG : __ ld(to_reg->as_register_lo(), offset, base); break;
745 case T_METADATA: __ ld(to_reg->as_register(), offset, base); break;
746 case T_ADDRESS:
747 __ ld(to_reg->as_register(), offset, base);
748 break;
749 case T_ARRAY : // fall through
750 case T_OBJECT:
751 {
752 if (UseCompressedOops && !wide) {
753 __ lwz(to_reg->as_register(), offset, base);
754 __ decode_heap_oop(to_reg->as_register());
755 } else {
756 __ ld(to_reg->as_register(), offset, base);
757 }
758 break;
759 }
760 case T_FLOAT: __ lfs(to_reg->as_float_reg(), offset, base); break;
761 case T_DOUBLE: __ lfd(to_reg->as_double_reg(), offset, base); break;
762 default : ShouldNotReachHere();
763 }
764 }
765 return load_offset;
766 }
767
768
769 int LIR_Assembler::load(Register base, Register disp, LIR_Opr to_reg, BasicType type, bool wide) {
770 int load_offset = code_offset();
771 switch(type) {
772 case T_BOOLEAN: // fall through
773 case T_BYTE : __ lbzx(to_reg->as_register(), base, disp);
774 __ extsb(to_reg->as_register(), to_reg->as_register()); break;
775 case T_CHAR : __ lhzx(to_reg->as_register(), base, disp); break;
776 case T_SHORT : __ lhax(to_reg->as_register(), base, disp); break;
777 case T_INT : __ lwax(to_reg->as_register(), base, disp); break;
778 case T_ADDRESS: __ ldx(to_reg->as_register(), base, disp); break;
779 case T_ARRAY : // fall through
780 case T_OBJECT:
781 {
782 if (UseCompressedOops && !wide) {
783 __ lwzx(to_reg->as_register(), base, disp);
784 __ decode_heap_oop(to_reg->as_register());
785 } else {
786 __ ldx(to_reg->as_register(), base, disp);
787 }
788 break;
789 }
790 case T_FLOAT: __ lfsx(to_reg->as_float_reg() , base, disp); break;
791 case T_DOUBLE: __ lfdx(to_reg->as_double_reg(), base, disp); break;
792 case T_LONG :
793 #ifdef _LP64
794 __ ldx(to_reg->as_register_lo(), base, disp);
795 #else
796 Unimplemented();
797 #endif
798 break;
799 default : ShouldNotReachHere();
800 }
801 return load_offset;
802 }
803
804
805 void LIR_Assembler::const2stack(LIR_Opr src, LIR_Opr dest) {
806 LIR_Const* c = src->as_constant_ptr();
807 Register src_reg = R0;
808 switch (c->type()) {
809 case T_INT:
810 case T_FLOAT: {
811 int value = c->as_jint_bits();
812 __ load_const_optimized(src_reg, value);
813 Address addr = frame_map()->address_for_slot(dest->single_stack_ix());
814 __ stw(src_reg, addr);
815 break;
816 }
817 case T_ADDRESS: {
818 int value = c->as_jint_bits();
819 __ load_const_optimized(src_reg, value);
820 Address addr = frame_map()->address_for_slot(dest->single_stack_ix());
821 __ std(src_reg, addr);
822 break;
823 }
824 case T_OBJECT: {
825 jobject2reg(c->as_jobject(), src_reg);
826 Address addr = frame_map()->address_for_slot(dest->single_stack_ix());
827 __ std(src_reg, addr);
828 break;
829 }
830 case T_LONG:
831 case T_DOUBLE: {
832 int value = c->as_jlong_bits();
833 __ load_const_optimized(src_reg, value);
834 Address addr = frame_map()->address_for_double_slot(dest->double_stack_ix());
835 __ std(src_reg, addr);
836 break;
837 }
838 default:
839 Unimplemented();
840 }
841 }
842
843
844 void LIR_Assembler::const2mem(LIR_Opr src, LIR_Opr dest, BasicType type, CodeEmitInfo* info, bool wide) {
845 LIR_Const* c = src->as_constant_ptr();
846 LIR_Address* addr = dest->as_address_ptr();
847 Register base = addr->base()->as_pointer_register();
848 LIR_Opr tmp = LIR_OprFact::illegalOpr;
849 int offset = -1;
850 // Null check for large offsets in LIRGenerator::do_StoreField.
851 bool needs_explicit_null_check = !ImplicitNullChecks;
852
853 if (info != nullptr && needs_explicit_null_check) {
854 explicit_null_check(base, info);
855 }
856
857 switch (c->type()) {
858 case T_FLOAT: type = T_INT;
859 case T_INT:
860 case T_ADDRESS: {
861 tmp = FrameMap::R0_opr;
862 __ load_const_optimized(tmp->as_register(), c->as_jint_bits());
863 break;
864 }
865 case T_DOUBLE: type = T_LONG;
866 case T_LONG: {
867 tmp = FrameMap::R0_long_opr;
868 __ load_const_optimized(tmp->as_register_lo(), c->as_jlong_bits());
869 break;
870 }
871 case T_OBJECT: {
872 tmp = FrameMap::R0_opr;
873 if (UseCompressedOops && !wide && c->as_jobject() != nullptr) {
874 AddressLiteral oop_addr = __ constant_oop_address(c->as_jobject());
875 // Don't care about sign extend (will use stw).
876 __ lis(R0, 0); // Will get patched.
877 __ relocate(oop_addr.rspec(), /*compressed format*/ 1);
878 __ ori(R0, R0, 0); // Will get patched.
879 } else {
880 jobject2reg(c->as_jobject(), R0);
881 }
882 break;
883 }
884 default:
885 Unimplemented();
886 }
887
888 // Handle either reg+reg or reg+disp address.
889 if (addr->index()->is_valid()) {
890 assert(addr->disp() == 0, "must be zero");
891 offset = store(tmp, base, addr->index()->as_pointer_register(), type, wide);
892 } else {
893 assert(Assembler::is_simm16(addr->disp()), "can't handle larger addresses");
894 offset = store(tmp, base, addr->disp(), type, wide);
895 }
896
897 if (info != nullptr) {
898 assert(offset != -1, "offset should've been set");
899 if (!needs_explicit_null_check) {
900 add_debug_info_for_null_check(offset, info);
901 }
902 }
903 }
904
905
906 void LIR_Assembler::const2reg(LIR_Opr src, LIR_Opr dest, LIR_PatchCode patch_code, CodeEmitInfo* info) {
907 LIR_Const* c = src->as_constant_ptr();
908 LIR_Opr to_reg = dest;
909
910 switch (c->type()) {
911 case T_INT: {
912 assert(patch_code == lir_patch_none, "no patching handled here");
913 __ load_const_optimized(dest->as_register(), c->as_jint(), R0);
914 break;
915 }
916 case T_ADDRESS: {
917 assert(patch_code == lir_patch_none, "no patching handled here");
918 __ load_const_optimized(dest->as_register(), c->as_jint(), R0); // Yes, as_jint ...
919 break;
920 }
921 case T_LONG: {
922 assert(patch_code == lir_patch_none, "no patching handled here");
923 __ load_const_optimized(dest->as_register_lo(), c->as_jlong(), R0);
924 break;
925 }
926
927 case T_OBJECT: {
928 if (patch_code == lir_patch_none) {
929 jobject2reg(c->as_jobject(), to_reg->as_register());
930 } else {
931 jobject2reg_with_patching(to_reg->as_register(), info);
932 }
933 break;
934 }
935
936 case T_METADATA:
937 {
938 if (patch_code == lir_patch_none) {
939 metadata2reg(c->as_metadata(), to_reg->as_register());
940 } else {
941 klass2reg_with_patching(to_reg->as_register(), info);
942 }
943 }
944 break;
945
946 case T_FLOAT:
947 {
948 if (to_reg->is_single_fpu()) {
949 address const_addr = __ float_constant(c->as_jfloat());
950 if (const_addr == nullptr) {
951 bailout("const section overflow");
952 break;
953 }
954 RelocationHolder rspec = internal_word_Relocation::spec(const_addr);
955 __ relocate(rspec);
956 __ load_const(R0, const_addr);
957 __ lfsx(to_reg->as_float_reg(), R0);
958 } else {
959 assert(to_reg->is_single_cpu(), "Must be a cpu register.");
960 __ load_const_optimized(to_reg->as_register(), jint_cast(c->as_jfloat()), R0);
961 }
962 }
963 break;
964
965 case T_DOUBLE:
966 {
967 if (to_reg->is_double_fpu()) {
968 address const_addr = __ double_constant(c->as_jdouble());
969 if (const_addr == nullptr) {
970 bailout("const section overflow");
971 break;
972 }
973 RelocationHolder rspec = internal_word_Relocation::spec(const_addr);
974 __ relocate(rspec);
975 __ load_const(R0, const_addr);
976 __ lfdx(to_reg->as_double_reg(), R0);
977 } else {
978 assert(to_reg->is_double_cpu(), "Must be a long register.");
979 __ load_const_optimized(to_reg->as_register_lo(), jlong_cast(c->as_jdouble()), R0);
980 }
981 }
982 break;
983
984 default:
985 ShouldNotReachHere();
986 }
987 }
988
989
990 Address LIR_Assembler::as_Address(LIR_Address* addr) {
991 Unimplemented(); return Address();
992 }
993
994
995 inline RegisterOrConstant index_or_disp(LIR_Address* addr) {
996 if (addr->index()->is_illegal()) {
997 return (RegisterOrConstant)(addr->disp());
998 } else {
999 return (RegisterOrConstant)(addr->index()->as_pointer_register());
1000 }
1001 }
1002
1003
1004 void LIR_Assembler::stack2stack(LIR_Opr src, LIR_Opr dest, BasicType type) {
1005 const Register tmp = R0;
1006 switch (type) {
1007 case T_INT:
1008 case T_FLOAT: {
1009 Address from = frame_map()->address_for_slot(src->single_stack_ix());
1010 Address to = frame_map()->address_for_slot(dest->single_stack_ix());
1011 __ lwz(tmp, from);
1012 __ stw(tmp, to);
1013 break;
1014 }
1015 case T_ADDRESS:
1016 case T_OBJECT: {
1017 Address from = frame_map()->address_for_slot(src->single_stack_ix());
1018 Address to = frame_map()->address_for_slot(dest->single_stack_ix());
1019 __ ld(tmp, from);
1020 __ std(tmp, to);
1021 break;
1022 }
1023 case T_LONG:
1024 case T_DOUBLE: {
1025 Address from = frame_map()->address_for_double_slot(src->double_stack_ix());
1026 Address to = frame_map()->address_for_double_slot(dest->double_stack_ix());
1027 __ ld(tmp, from);
1028 __ std(tmp, to);
1029 break;
1030 }
1031
1032 default:
1033 ShouldNotReachHere();
1034 }
1035 }
1036
1037
1038 Address LIR_Assembler::as_Address_hi(LIR_Address* addr) {
1039 Unimplemented(); return Address();
1040 }
1041
1042
1043 Address LIR_Assembler::as_Address_lo(LIR_Address* addr) {
1044 Unimplemented(); return Address();
1045 }
1046
1047
1048 void LIR_Assembler::mem2reg(LIR_Opr src_opr, LIR_Opr dest, BasicType type,
1049 LIR_PatchCode patch_code, CodeEmitInfo* info, bool wide) {
1050
1051 assert(type != T_METADATA, "load of metadata ptr not supported");
1052 LIR_Address* addr = src_opr->as_address_ptr();
1053 LIR_Opr to_reg = dest;
1054
1055 Register src = addr->base()->as_pointer_register();
1056 Register disp_reg = noreg;
1057 int disp_value = addr->disp();
1058 bool needs_patching = (patch_code != lir_patch_none);
1059 // null check for large offsets in LIRGenerator::do_LoadField
1060 bool needs_explicit_null_check = !os::zero_page_read_protected() || !ImplicitNullChecks;
1061
1062 if (info != nullptr && needs_explicit_null_check) {
1063 explicit_null_check(src, info);
1064 }
1065
1066 if (addr->base()->type() == T_OBJECT) {
1067 __ verify_oop(src, FILE_AND_LINE);
1068 }
1069
1070 PatchingStub* patch = nullptr;
1071 if (needs_patching) {
1072 patch = new PatchingStub(_masm, PatchingStub::access_field_id);
1073 assert(!to_reg->is_double_cpu() ||
1074 patch_code == lir_patch_none ||
1075 patch_code == lir_patch_normal, "patching doesn't match register");
1076 }
1077
1078 if (addr->index()->is_illegal()) {
1079 if (!Assembler::is_simm16(disp_value)) {
1080 if (needs_patching) {
1081 __ load_const32(R0, 0); // patchable int
1082 } else {
1083 __ load_const_optimized(R0, disp_value);
1084 }
1085 disp_reg = R0;
1086 }
1087 } else {
1088 disp_reg = addr->index()->as_pointer_register();
1089 assert(disp_value == 0, "can't handle 3 operand addresses");
1090 }
1091
1092 // Remember the offset of the load. The patching_epilog must be done
1093 // before the call to add_debug_info, otherwise the PcDescs don't get
1094 // entered in increasing order.
1095 int offset;
1096
1097 if (disp_reg == noreg) {
1098 assert(Assembler::is_simm16(disp_value), "should have set this up");
1099 offset = load(src, disp_value, to_reg, type, wide);
1100 } else {
1101 offset = load(src, disp_reg, to_reg, type, wide);
1102 }
1103
1104 if (patch != nullptr) {
1105 patching_epilog(patch, patch_code, src, info);
1106 }
1107 if (info != nullptr && !needs_explicit_null_check) {
1108 add_debug_info_for_null_check(offset, info);
1109 }
1110 }
1111
1112
1113 void LIR_Assembler::stack2reg(LIR_Opr src, LIR_Opr dest, BasicType type) {
1114 Address addr;
1115 if (src->is_single_word()) {
1116 addr = frame_map()->address_for_slot(src->single_stack_ix());
1117 } else if (src->is_double_word()) {
1118 addr = frame_map()->address_for_double_slot(src->double_stack_ix());
1119 }
1120
1121 load(addr.base(), addr.disp(), dest, dest->type(), true /*wide*/);
1122 }
1123
1124
1125 void LIR_Assembler::reg2stack(LIR_Opr from_reg, LIR_Opr dest, BasicType type) {
1126 Address addr;
1127 if (dest->is_single_word()) {
1128 addr = frame_map()->address_for_slot(dest->single_stack_ix());
1129 } else if (dest->is_double_word()) {
1130 addr = frame_map()->address_for_slot(dest->double_stack_ix());
1131 }
1132
1133 store(from_reg, addr.base(), addr.disp(), from_reg->type(), true /*wide*/);
1134 }
1135
1136
1137 void LIR_Assembler::reg2reg(LIR_Opr from_reg, LIR_Opr to_reg) {
1138 if (from_reg->is_float_kind() && to_reg->is_float_kind()) {
1139 if (from_reg->is_double_fpu()) {
1140 // double to double moves
1141 assert(to_reg->is_double_fpu(), "should match");
1142 __ fmr_if_needed(to_reg->as_double_reg(), from_reg->as_double_reg());
1143 } else {
1144 // float to float moves
1145 assert(to_reg->is_single_fpu(), "should match");
1146 __ fmr_if_needed(to_reg->as_float_reg(), from_reg->as_float_reg());
1147 }
1148 } else if (!from_reg->is_float_kind() && !to_reg->is_float_kind()) {
1149 if (from_reg->is_double_cpu()) {
1150 __ mr_if_needed(to_reg->as_pointer_register(), from_reg->as_pointer_register());
1151 } else if (to_reg->is_double_cpu()) {
1152 // int to int moves
1153 __ mr_if_needed(to_reg->as_register_lo(), from_reg->as_register());
1154 } else {
1155 // int to int moves
1156 __ mr_if_needed(to_reg->as_register(), from_reg->as_register());
1157 }
1158 } else {
1159 ShouldNotReachHere();
1160 }
1161 if (is_reference_type(to_reg->type())) {
1162 __ verify_oop(to_reg->as_register(), FILE_AND_LINE);
1163 }
1164 }
1165
1166
1167 void LIR_Assembler::reg2mem(LIR_Opr from_reg, LIR_Opr dest, BasicType type,
1168 LIR_PatchCode patch_code, CodeEmitInfo* info,
1169 bool wide) {
1170 assert(type != T_METADATA, "store of metadata ptr not supported");
1171 LIR_Address* addr = dest->as_address_ptr();
1172
1173 Register src = addr->base()->as_pointer_register();
1174 Register disp_reg = noreg;
1175 int disp_value = addr->disp();
1176 bool needs_patching = (patch_code != lir_patch_none);
1177 bool compress_oop = (is_reference_type(type)) && UseCompressedOops && !wide &&
1178 CompressedOops::mode() != CompressedOops::UnscaledNarrowOop;
1179 bool load_disp = addr->index()->is_illegal() && !Assembler::is_simm16(disp_value);
1180 bool use_R29 = compress_oop && load_disp; // Avoid register conflict, also do null check before killing R29.
1181 // Null check for large offsets in LIRGenerator::do_StoreField.
1182 bool needs_explicit_null_check = !ImplicitNullChecks || use_R29;
1183
1184 if (info != nullptr && needs_explicit_null_check) {
1185 explicit_null_check(src, info);
1186 }
1187
1188 if (addr->base()->is_oop_register()) {
1189 __ verify_oop(src, FILE_AND_LINE);
1190 }
1191
1192 PatchingStub* patch = nullptr;
1193 if (needs_patching) {
1194 patch = new PatchingStub(_masm, PatchingStub::access_field_id);
1195 assert(!from_reg->is_double_cpu() ||
1196 patch_code == lir_patch_none ||
1197 patch_code == lir_patch_normal, "patching doesn't match register");
1198 }
1199
1200 if (addr->index()->is_illegal()) {
1201 if (load_disp) {
1202 disp_reg = use_R29 ? R29_TOC : R0;
1203 if (needs_patching) {
1204 __ load_const32(disp_reg, 0); // patchable int
1205 } else {
1206 __ load_const_optimized(disp_reg, disp_value);
1207 }
1208 }
1209 } else {
1210 disp_reg = addr->index()->as_pointer_register();
1211 assert(disp_value == 0, "can't handle 3 operand addresses");
1212 }
1213
1214 // remember the offset of the store. The patching_epilog must be done
1215 // before the call to add_debug_info_for_null_check, otherwise the PcDescs don't get
1216 // entered in increasing order.
1217 int offset;
1218
1219 if (compress_oop) {
1220 Register co = __ encode_heap_oop(R0, from_reg->as_register());
1221 from_reg = FrameMap::as_opr(co);
1222 }
1223
1224 if (disp_reg == noreg) {
1225 assert(Assembler::is_simm16(disp_value), "should have set this up");
1226 offset = store(from_reg, src, disp_value, type, wide);
1227 } else {
1228 offset = store(from_reg, src, disp_reg, type, wide);
1229 }
1230
1231 if (use_R29) {
1232 __ load_const_optimized(R29_TOC, MacroAssembler::global_toc(), R0); // reinit
1233 }
1234
1235 if (patch != nullptr) {
1236 patching_epilog(patch, patch_code, src, info);
1237 }
1238
1239 if (info != nullptr && !needs_explicit_null_check) {
1240 add_debug_info_for_null_check(offset, info);
1241 }
1242 }
1243
1244
1245 void LIR_Assembler::return_op(LIR_Opr result, C1SafepointPollStub* code_stub) {
1246 const Register return_pc = R31; // Must survive C-call to enable_stack_reserved_zone().
1247 const Register temp = R12;
1248
1249 assert(!InlineTypeReturnedAsFields, "unimplemented");
1250
1251 // Pop the stack before the safepoint code.
1252 int frame_size = initial_frame_size_in_bytes();
1253 if (Assembler::is_simm(frame_size, 16)) {
1254 __ addi(R1_SP, R1_SP, frame_size);
1255 } else {
1256 __ pop_frame();
1257 }
1258
1259 // Restore return pc relative to callers' sp.
1260 __ ld(return_pc, _abi0(lr), R1_SP);
1261 // Move return pc to LR.
1262 __ mtlr(return_pc);
1263
1264 if (StackReservedPages > 0 && compilation()->has_reserved_stack_access()) {
1265 __ reserved_stack_check(return_pc);
1266 }
1267
1268 // We need to mark the code position where the load from the safepoint
1269 // polling page was emitted as relocInfo::poll_return_type here.
1270 if (!UseSIGTRAP) {
1271 code_stub->set_safepoint_offset(__ offset());
1272 __ relocate(relocInfo::poll_return_type);
1273 }
1274 __ safepoint_poll(*code_stub->entry(), temp, true /* at_return */, true /* in_nmethod */);
1275
1276 // Return.
1277 __ blr();
1278 }
1279
1280
1281 int LIR_Assembler::safepoint_poll(LIR_Opr tmp, CodeEmitInfo* info) {
1282 const Register poll_addr = tmp->as_register();
1283 __ ld(poll_addr, in_bytes(JavaThread::polling_page_offset()), R16_thread);
1284 if (info != nullptr) {
1285 add_debug_info_for_branch(info);
1286 }
1287 int offset = __ offset();
1288 __ relocate(relocInfo::poll_type);
1289 __ load_from_polling_page(poll_addr);
1290
1291 return offset;
1292 }
1293
1294
1295 void LIR_Assembler::emit_static_call_stub() {
1296 address call_pc = __ pc();
1297 address stub = __ start_a_stub(static_call_stub_size());
1298 if (stub == nullptr) {
1299 bailout("static call stub overflow");
1300 return;
1301 }
1302
1303 // For java_to_interp stubs we use R11_scratch1 as scratch register
1304 // and in call trampoline stubs we use R12_scratch2. This way we
1305 // can distinguish them (see is_NativeCallTrampolineStub_at()).
1306 const Register reg_scratch = R11_scratch1;
1307
1308 // Create a static stub relocation which relates this stub
1309 // with the call instruction at insts_call_instruction_offset in the
1310 // instructions code-section.
1311 int start = __ offset();
1312 __ relocate(static_stub_Relocation::spec(call_pc));
1313
1314 // Now, create the stub's code:
1315 // - load the TOC
1316 // - load the inline cache oop from the constant pool
1317 // - load the call target from the constant pool
1318 // - call
1319 __ calculate_address_from_global_toc(reg_scratch, __ method_toc());
1320 AddressLiteral ic = __ allocate_metadata_address((Metadata *)nullptr);
1321 bool success = __ load_const_from_method_toc(R19_inline_cache_reg, ic, reg_scratch, /*fixed_size*/ true);
1322
1323 if (ReoptimizeCallSequences) {
1324 __ b64_patchable((address)-1, relocInfo::none);
1325 } else {
1326 AddressLiteral a((address)-1);
1327 success = success && __ load_const_from_method_toc(reg_scratch, a, reg_scratch, /*fixed_size*/ true);
1328 __ mtctr(reg_scratch);
1329 __ bctr();
1330 }
1331 if (!success) {
1332 bailout("const section overflow");
1333 return;
1334 }
1335
1336 assert(__ offset() - start <= static_call_stub_size(), "stub too big");
1337 __ end_a_stub();
1338 }
1339
1340
1341 void LIR_Assembler::comp_op(LIR_Condition condition, LIR_Opr opr1, LIR_Opr opr2, LIR_Op2* op) {
1342 bool unsigned_comp = (condition == lir_cond_belowEqual || condition == lir_cond_aboveEqual);
1343 if (opr1->is_single_fpu()) {
1344 __ fcmpu(BOOL_RESULT, opr1->as_float_reg(), opr2->as_float_reg());
1345 } else if (opr1->is_double_fpu()) {
1346 __ fcmpu(BOOL_RESULT, opr1->as_double_reg(), opr2->as_double_reg());
1347 } else if (opr1->is_single_cpu()) {
1348 if (opr2->is_constant()) {
1349 switch (opr2->as_constant_ptr()->type()) {
1350 case T_INT:
1351 {
1352 jint con = opr2->as_constant_ptr()->as_jint();
1353 if (unsigned_comp) {
1354 if (Assembler::is_uimm(con, 16)) {
1355 __ cmplwi(BOOL_RESULT, opr1->as_register(), con);
1356 } else {
1357 __ load_const_optimized(R0, con);
1358 __ cmplw(BOOL_RESULT, opr1->as_register(), R0);
1359 }
1360 } else {
1361 if (Assembler::is_simm(con, 16)) {
1362 __ cmpwi(BOOL_RESULT, opr1->as_register(), con);
1363 } else {
1364 __ load_const_optimized(R0, con);
1365 __ cmpw(BOOL_RESULT, opr1->as_register(), R0);
1366 }
1367 }
1368 }
1369 break;
1370
1371 case T_OBJECT:
1372 // There are only equal/notequal comparisons on objects.
1373 {
1374 assert(condition == lir_cond_equal || condition == lir_cond_notEqual, "oops");
1375 jobject con = opr2->as_constant_ptr()->as_jobject();
1376 if (con == nullptr) {
1377 __ cmpdi(BOOL_RESULT, opr1->as_register(), 0);
1378 } else {
1379 jobject2reg(con, R0);
1380 __ cmpd(BOOL_RESULT, opr1->as_register(), R0);
1381 }
1382 }
1383 break;
1384
1385 case T_METADATA:
1386 // We only need, for now, comparison with null for metadata.
1387 {
1388 assert(condition == lir_cond_equal || condition == lir_cond_notEqual, "oops");
1389 Metadata* p = opr2->as_constant_ptr()->as_metadata();
1390 if (p == nullptr) {
1391 __ cmpdi(BOOL_RESULT, opr1->as_register(), 0);
1392 } else {
1393 ShouldNotReachHere();
1394 }
1395 }
1396 break;
1397
1398 default:
1399 ShouldNotReachHere();
1400 break;
1401 }
1402 } else {
1403 assert(opr1->type() != T_ADDRESS && opr2->type() != T_ADDRESS, "currently unsupported");
1404 if (is_reference_type(opr1->type())) {
1405 // There are only equal/notequal comparisons on objects.
1406 assert(condition == lir_cond_equal || condition == lir_cond_notEqual, "oops");
1407 __ cmpd(BOOL_RESULT, opr1->as_register(), opr2->as_register());
1408 } else {
1409 if (unsigned_comp) {
1410 __ cmplw(BOOL_RESULT, opr1->as_register(), opr2->as_register());
1411 } else {
1412 __ cmpw(BOOL_RESULT, opr1->as_register(), opr2->as_register());
1413 }
1414 }
1415 }
1416 } else if (opr1->is_double_cpu()) {
1417 if (opr2->is_constant()) {
1418 jlong con = opr2->as_constant_ptr()->as_jlong();
1419 if (unsigned_comp) {
1420 if (Assembler::is_uimm(con, 16)) {
1421 __ cmpldi(BOOL_RESULT, opr1->as_register_lo(), con);
1422 } else {
1423 __ load_const_optimized(R0, con);
1424 __ cmpld(BOOL_RESULT, opr1->as_register_lo(), R0);
1425 }
1426 } else {
1427 if (Assembler::is_simm(con, 16)) {
1428 __ cmpdi(BOOL_RESULT, opr1->as_register_lo(), con);
1429 } else {
1430 __ load_const_optimized(R0, con);
1431 __ cmpd(BOOL_RESULT, opr1->as_register_lo(), R0);
1432 }
1433 }
1434 } else if (opr2->is_register()) {
1435 if (unsigned_comp) {
1436 __ cmpld(BOOL_RESULT, opr1->as_register_lo(), opr2->as_register_lo());
1437 } else {
1438 __ cmpd(BOOL_RESULT, opr1->as_register_lo(), opr2->as_register_lo());
1439 }
1440 } else {
1441 ShouldNotReachHere();
1442 }
1443 } else {
1444 ShouldNotReachHere();
1445 }
1446 }
1447
1448
1449 void LIR_Assembler::comp_fl2i(LIR_Code code, LIR_Opr left, LIR_Opr right, LIR_Opr dst, LIR_Op2* op){
1450 const Register Rdst = dst->as_register();
1451 if (code == lir_cmp_fd2i || code == lir_ucmp_fd2i) {
1452 bool is_unordered_less = (code == lir_ucmp_fd2i);
1453 if (left->is_single_fpu()) {
1454 __ fcmpu(CR0, left->as_float_reg(), right->as_float_reg());
1455 } else if (left->is_double_fpu()) {
1456 __ fcmpu(CR0, left->as_double_reg(), right->as_double_reg());
1457 } else {
1458 ShouldNotReachHere();
1459 }
1460 __ set_cmpu3(Rdst, is_unordered_less); // is_unordered_less ? -1 : 1
1461 } else if (code == lir_cmp_l2i) {
1462 __ cmpd(CR0, left->as_register_lo(), right->as_register_lo());
1463 __ set_cmp3(Rdst); // set result as follows: <: -1, =: 0, >: 1
1464 } else {
1465 ShouldNotReachHere();
1466 }
1467 }
1468
1469
1470 inline void load_to_reg(LIR_Assembler *lasm, LIR_Opr src, LIR_Opr dst) {
1471 if (src->is_constant()) {
1472 lasm->const2reg(src, dst, lir_patch_none, nullptr);
1473 } else if (src->is_register()) {
1474 lasm->reg2reg(src, dst);
1475 } else if (src->is_stack()) {
1476 lasm->stack2reg(src, dst, dst->type());
1477 } else {
1478 ShouldNotReachHere();
1479 }
1480 }
1481
1482 void LIR_Assembler::cmove(LIR_Condition condition, LIR_Opr opr1, LIR_Opr opr2, LIR_Opr result, BasicType type,
1483 LIR_Opr cmp_opr1, LIR_Opr cmp_opr2) {
1484 assert(cmp_opr1 == LIR_OprFact::illegalOpr && cmp_opr2 == LIR_OprFact::illegalOpr, "unnecessary cmp oprs on ppc");
1485
1486 if (opr1->is_equal(opr2) || opr1->is_same_register(opr2)) {
1487 load_to_reg(this, opr1, result); // Condition doesn't matter.
1488 return;
1489 }
1490
1491 bool positive = false;
1492 Assembler::Condition cond = Assembler::equal;
1493 switch (condition) {
1494 case lir_cond_equal: positive = true ; cond = Assembler::equal ; break;
1495 case lir_cond_notEqual: positive = false; cond = Assembler::equal ; break;
1496 case lir_cond_less: positive = true ; cond = Assembler::less ; break;
1497 case lir_cond_belowEqual:
1498 case lir_cond_lessEqual: positive = false; cond = Assembler::greater; break;
1499 case lir_cond_greater: positive = true ; cond = Assembler::greater; break;
1500 case lir_cond_aboveEqual:
1501 case lir_cond_greaterEqual: positive = false; cond = Assembler::less ; break;
1502 default: ShouldNotReachHere();
1503 }
1504
1505 if (result->is_cpu_register()) {
1506 bool o1_is_reg = opr1->is_cpu_register(), o2_is_reg = opr2->is_cpu_register();
1507 const Register result_reg = result->is_single_cpu() ? result->as_register() : result->as_register_lo();
1508
1509 // We can use result_reg to load one operand if not already in register.
1510 Register first = o1_is_reg ? (opr1->is_single_cpu() ? opr1->as_register() : opr1->as_register_lo()) : result_reg,
1511 second = o2_is_reg ? (opr2->is_single_cpu() ? opr2->as_register() : opr2->as_register_lo()) : result_reg;
1512
1513 if (first != second) {
1514 if (!o1_is_reg) {
1515 load_to_reg(this, opr1, result);
1516 }
1517
1518 if (!o2_is_reg) {
1519 load_to_reg(this, opr2, result);
1520 }
1521
1522 __ isel(result_reg, BOOL_RESULT, cond, !positive, first, second);
1523 return;
1524 }
1525 } // isel
1526
1527 load_to_reg(this, opr1, result);
1528
1529 Label skip;
1530 int bo = positive ? Assembler::bcondCRbiIs1 : Assembler::bcondCRbiIs0;
1531 int bi = Assembler::bi0(BOOL_RESULT, cond);
1532 __ bc(bo, bi, skip);
1533
1534 load_to_reg(this, opr2, result);
1535 __ bind(skip);
1536 }
1537
1538
1539 void LIR_Assembler::arith_op(LIR_Code code, LIR_Opr left, LIR_Opr right, LIR_Opr dest,
1540 CodeEmitInfo* info) {
1541 assert(info == nullptr, "unused on this code path");
1542 assert(left->is_register(), "wrong items state");
1543 assert(dest->is_register(), "wrong items state");
1544
1545 if (right->is_register()) {
1546 if (dest->is_float_kind()) {
1547
1548 FloatRegister lreg, rreg, res;
1549 if (right->is_single_fpu()) {
1550 lreg = left->as_float_reg();
1551 rreg = right->as_float_reg();
1552 res = dest->as_float_reg();
1553 switch (code) {
1554 case lir_add: __ fadds(res, lreg, rreg); break;
1555 case lir_sub: __ fsubs(res, lreg, rreg); break;
1556 case lir_mul: __ fmuls(res, lreg, rreg); break;
1557 case lir_div: __ fdivs(res, lreg, rreg); break;
1558 default: ShouldNotReachHere();
1559 }
1560 } else {
1561 lreg = left->as_double_reg();
1562 rreg = right->as_double_reg();
1563 res = dest->as_double_reg();
1564 switch (code) {
1565 case lir_add: __ fadd(res, lreg, rreg); break;
1566 case lir_sub: __ fsub(res, lreg, rreg); break;
1567 case lir_mul: __ fmul(res, lreg, rreg); break;
1568 case lir_div: __ fdiv(res, lreg, rreg); break;
1569 default: ShouldNotReachHere();
1570 }
1571 }
1572
1573 } else if (dest->is_double_cpu()) {
1574
1575 Register dst_lo = dest->as_register_lo();
1576 Register op1_lo = left->as_pointer_register();
1577 Register op2_lo = right->as_pointer_register();
1578
1579 switch (code) {
1580 case lir_add: __ add(dst_lo, op1_lo, op2_lo); break;
1581 case lir_sub: __ sub(dst_lo, op1_lo, op2_lo); break;
1582 case lir_mul: __ mulld(dst_lo, op1_lo, op2_lo); break;
1583 default: ShouldNotReachHere();
1584 }
1585 } else {
1586 assert (right->is_single_cpu(), "Just Checking");
1587
1588 Register lreg = left->as_register();
1589 Register res = dest->as_register();
1590 Register rreg = right->as_register();
1591 switch (code) {
1592 case lir_add: __ add (res, lreg, rreg); break;
1593 case lir_sub: __ sub (res, lreg, rreg); break;
1594 case lir_mul: __ mullw(res, lreg, rreg); break;
1595 default: ShouldNotReachHere();
1596 }
1597 }
1598 } else {
1599 assert (right->is_constant(), "must be constant");
1600
1601 if (dest->is_single_cpu()) {
1602 Register lreg = left->as_register();
1603 Register res = dest->as_register();
1604 int simm16 = right->as_constant_ptr()->as_jint();
1605
1606 switch (code) {
1607 case lir_sub: assert(Assembler::is_simm16(-simm16), "cannot encode"); // see do_ArithmeticOp_Int
1608 simm16 = -simm16;
1609 case lir_add: if (res == lreg && simm16 == 0) break;
1610 __ addi(res, lreg, simm16); break;
1611 case lir_mul: if (res == lreg && simm16 == 1) break;
1612 __ mulli(res, lreg, simm16); break;
1613 default: ShouldNotReachHere();
1614 }
1615 } else {
1616 Register lreg = left->as_pointer_register();
1617 Register res = dest->as_register_lo();
1618 long con = right->as_constant_ptr()->as_jlong();
1619 assert(Assembler::is_simm16(con), "must be simm16");
1620
1621 switch (code) {
1622 case lir_sub: assert(Assembler::is_simm16(-con), "cannot encode"); // see do_ArithmeticOp_Long
1623 con = -con;
1624 case lir_add: if (res == lreg && con == 0) break;
1625 __ addi(res, lreg, (int)con); break;
1626 case lir_mul: if (res == lreg && con == 1) break;
1627 __ mulli(res, lreg, (int)con); break;
1628 default: ShouldNotReachHere();
1629 }
1630 }
1631 }
1632 }
1633
1634
1635 void LIR_Assembler::intrinsic_op(LIR_Code code, LIR_Opr value, LIR_Opr tmp, LIR_Opr dest, LIR_Op* op) {
1636 switch (code) {
1637 case lir_sqrt: {
1638 __ fsqrt(dest->as_double_reg(), value->as_double_reg());
1639 break;
1640 }
1641 case lir_abs: {
1642 __ fabs(dest->as_double_reg(), value->as_double_reg());
1643 break;
1644 }
1645 case lir_f2hf: {
1646 __ f2hf(dest.as_register(), value.as_float_reg(), tmp.as_float_reg());
1647 break;
1648 }
1649 case lir_hf2f: {
1650 __ hf2f(dest->as_float_reg(), value.as_register());
1651 break;
1652 }
1653 default: {
1654 ShouldNotReachHere();
1655 break;
1656 }
1657 }
1658 }
1659
1660
1661 void LIR_Assembler::logic_op(LIR_Code code, LIR_Opr left, LIR_Opr right, LIR_Opr dest) {
1662 if (right->is_constant()) { // see do_LogicOp
1663 long uimm;
1664 Register d, l;
1665 if (dest->is_single_cpu()) {
1666 uimm = right->as_constant_ptr()->as_jint();
1667 d = dest->as_register();
1668 l = left->as_register();
1669 } else {
1670 uimm = right->as_constant_ptr()->as_jlong();
1671 d = dest->as_register_lo();
1672 l = left->as_register_lo();
1673 }
1674 long uimms = (unsigned long)uimm >> 16;
1675
1676 switch (code) {
1677 case lir_logic_and:
1678 if (Assembler::andi_supports(uimm)) {
1679 __ andi(d, l, uimm); // includes andis_ and special cases
1680 } else { // for operands which are not generated by LIRGenerator::do_LogicOp
1681 __ load_const_optimized(R0, uimm);
1682 __ andr(d, l, R0);
1683 }
1684 break;
1685
1686 case lir_logic_or:
1687 if (Assembler::is_uimm(uimm, 16)) {
1688 __ ori(d, l, uimm);
1689 } else if ((uimm & 0xFFFF) == 0 && Assembler::is_uimm(uimms, 16)) {
1690 __ oris(d, l, uimms);
1691 } else { // for operands which are not generated by LIRGenerator::do_LogicOp
1692 __ load_const_optimized(R0, uimm);
1693 __ orr(d, l, R0);
1694 }
1695 break;
1696
1697 case lir_logic_xor:
1698 if (Assembler::is_uimm(uimm, 16)) {
1699 __ xori(d, l, uimm);
1700 } else if ((uimm & 0xFFFF) == 0 && Assembler::is_uimm(uimms, 16)) {
1701 __ xoris(d, l, uimms);
1702 } else if (uimm == -1) {
1703 __ nand(d, l, l); // special case
1704 } else { // for operands which are not generated by LIRGenerator::do_LogicOp
1705 __ load_const_optimized(R0, uimm);
1706 __ xorr(d, l, R0);
1707 }
1708 break;
1709
1710 default: ShouldNotReachHere();
1711 }
1712 } else {
1713 assert(right->is_register(), "right should be in register");
1714
1715 if (dest->is_single_cpu()) {
1716 switch (code) {
1717 case lir_logic_and: __ andr(dest->as_register(), left->as_register(), right->as_register()); break;
1718 case lir_logic_or: __ orr (dest->as_register(), left->as_register(), right->as_register()); break;
1719 case lir_logic_xor: __ xorr(dest->as_register(), left->as_register(), right->as_register()); break;
1720 default: ShouldNotReachHere();
1721 }
1722 } else {
1723 Register l = (left->is_single_cpu() && left->is_oop_register()) ? left->as_register() :
1724 left->as_register_lo();
1725 Register r = (right->is_single_cpu() && right->is_oop_register()) ? right->as_register() :
1726 right->as_register_lo();
1727
1728 switch (code) {
1729 case lir_logic_and: __ andr(dest->as_register_lo(), l, r); break;
1730 case lir_logic_or: __ orr (dest->as_register_lo(), l, r); break;
1731 case lir_logic_xor: __ xorr(dest->as_register_lo(), l, r); break;
1732 default: ShouldNotReachHere();
1733 }
1734 }
1735 }
1736 }
1737
1738
1739 int LIR_Assembler::shift_amount(BasicType t) {
1740 int elem_size = type2aelembytes(t);
1741 switch (elem_size) {
1742 case 1 : return 0;
1743 case 2 : return 1;
1744 case 4 : return 2;
1745 case 8 : return 3;
1746 }
1747 ShouldNotReachHere();
1748 return -1;
1749 }
1750
1751
1752 void LIR_Assembler::throw_op(LIR_Opr exceptionPC, LIR_Opr exceptionOop, CodeEmitInfo* info) {
1753 info->add_register_oop(exceptionOop);
1754
1755 // Reuse the debug info from the safepoint poll for the throw op itself.
1756 address pc_for_athrow = __ pc();
1757 int pc_for_athrow_offset = __ offset();
1758 //RelocationHolder rspec = internal_word_Relocation::spec(pc_for_athrow);
1759 //__ relocate(rspec);
1760 //__ load_const(exceptionPC->as_register(), pc_for_athrow, R0);
1761 __ calculate_address_from_global_toc(exceptionPC->as_register(), pc_for_athrow, true, true, /*add_relocation*/ true);
1762 add_call_info(pc_for_athrow_offset, info); // for exception handler
1763
1764 address stub = Runtime1::entry_for(compilation()->has_fpu_code() ? StubId::c1_handle_exception_id
1765 : StubId::c1_handle_exception_nofpu_id);
1766 //__ load_const_optimized(R0, stub);
1767 __ add_const_optimized(R0, R29_TOC, MacroAssembler::offset_to_global_toc(stub));
1768 __ mtctr(R0);
1769 __ bctr();
1770 }
1771
1772
1773 void LIR_Assembler::unwind_op(LIR_Opr exceptionOop) {
1774 // Note: Not used with EnableDebuggingOnDemand.
1775 assert(exceptionOop->as_register() == R3, "should match");
1776 __ b(_unwind_handler_entry);
1777 }
1778
1779
1780 void LIR_Assembler::arraycopy_inlinetype_check(Register obj, Register tmp, CodeStub* slow_path, bool is_dest, bool null_check) {
1781 if (null_check) {
1782 __ cmpdi(CR0, obj, 0);
1783 __ bc_far_optimized(Assembler::bcondCRbiIs1, __ bi0(CR0, Assembler::equal), *slow_path->entry());
1784 }
1785 if (is_dest) {
1786 __ test_null_free_array_oop(obj, tmp, *slow_path->entry(), true);
1787 __ test_flat_array_oop(obj, tmp, *slow_path->entry(), true);
1788 } else {
1789 __ test_flat_array_oop(obj, tmp, *slow_path->entry(), true);
1790 }
1791 }
1792
1793
1794 void LIR_Assembler::emit_arraycopy(LIR_OpArrayCopy* op) {
1795 Register src = op->src()->as_register();
1796 Register dst = op->dst()->as_register();
1797 Register src_pos = op->src_pos()->as_register();
1798 Register dst_pos = op->dst_pos()->as_register();
1799 Register length = op->length()->as_register();
1800 Register tmp = op->tmp()->as_register();
1801 Register tmp2 = R0;
1802
1803 int flags = op->flags();
1804 ciArrayKlass* default_type = op->expected_type();
1805 BasicType basic_type = (default_type != nullptr) ? default_type->element_type()->basic_type() : T_ILLEGAL;
1806 if (basic_type == T_ARRAY) basic_type = T_OBJECT;
1807
1808 // Set up the arraycopy stub information.
1809 ArrayCopyStub* stub = op->stub();
1810
1811 if (flags & LIR_OpArrayCopy::always_slow_path) {
1812 __ b(*stub->entry());
1813 __ bind(*stub->continuation());
1814 return;
1815 }
1816
1817 // Always do stub if no type information is available. It's ok if
1818 // the known type isn't loaded since the code sanity checks
1819 // in debug mode and the type isn't required when we know the exact type
1820 // also check that the type is an array type.
1821 if (default_type == nullptr) {
1822 assert(src->is_nonvolatile() && src_pos->is_nonvolatile() && dst->is_nonvolatile() && dst_pos->is_nonvolatile() &&
1823 length->is_nonvolatile(), "must preserve");
1824 address copyfunc_addr = StubRoutines::generic_arraycopy();
1825 assert(copyfunc_addr != nullptr, "generic arraycopy stub required");
1826
1827 // 3 parms are int. Convert to long.
1828 __ mr(R3_ARG1, src);
1829 __ extsw(R4_ARG2, src_pos);
1830 __ mr(R5_ARG3, dst);
1831 __ extsw(R6_ARG4, dst_pos);
1832 __ extsw(R7_ARG5, length);
1833
1834 #ifndef PRODUCT
1835 if (PrintC1Statistics) {
1836 address counter = (address)&Runtime1::_generic_arraycopystub_cnt;
1837 int simm16_offs = __ load_const_optimized(tmp, counter, tmp2, true);
1838 __ lwz(R11_scratch1, simm16_offs, tmp);
1839 __ addi(R11_scratch1, R11_scratch1, 1);
1840 __ stw(R11_scratch1, simm16_offs, tmp);
1841 }
1842 #endif
1843 __ call_c(copyfunc_addr, relocInfo::runtime_call_type);
1844
1845 __ nand(tmp, R3_RET, R3_RET);
1846 __ subf(length, tmp, length);
1847 __ add(src_pos, tmp, src_pos);
1848 __ add(dst_pos, tmp, dst_pos);
1849
1850 __ cmpwi(CR0, R3_RET, 0);
1851 __ bc_far_optimized(Assembler::bcondCRbiIs1, __ bi0(CR0, Assembler::less), *stub->entry());
1852 __ bind(*stub->continuation());
1853 return;
1854 }
1855
1856 // Handle inline type arrays
1857 if (flags & LIR_OpArrayCopy::src_inlinetype_check) {
1858 arraycopy_inlinetype_check(src, tmp, stub, false, (flags & LIR_OpArrayCopy::src_null_check));
1859 }
1860 if (flags & LIR_OpArrayCopy::dst_inlinetype_check) {
1861 arraycopy_inlinetype_check(dst, tmp, stub, true, (flags & LIR_OpArrayCopy::dst_null_check));
1862 }
1863
1864 assert(default_type != nullptr && default_type->is_array_klass() && default_type->is_loaded(), "must be true at this point");
1865 Label cont, slow, copyfunc;
1866
1867 bool simple_check_flag_set = flags & (LIR_OpArrayCopy::src_null_check |
1868 LIR_OpArrayCopy::dst_null_check |
1869 LIR_OpArrayCopy::src_pos_positive_check |
1870 LIR_OpArrayCopy::dst_pos_positive_check |
1871 LIR_OpArrayCopy::length_positive_check);
1872
1873 // Use only one conditional branch for simple checks.
1874 if (simple_check_flag_set) {
1875 ConditionRegister combined_check = CR1, tmp_check = CR1;
1876
1877 // Make sure src and dst are non-null.
1878 if (flags & LIR_OpArrayCopy::src_null_check) {
1879 __ cmpdi(combined_check, src, 0);
1880 tmp_check = CR0;
1881 }
1882
1883 if (flags & LIR_OpArrayCopy::dst_null_check) {
1884 __ cmpdi(tmp_check, dst, 0);
1885 if (tmp_check != combined_check) {
1886 __ cror(combined_check, Assembler::equal, tmp_check, Assembler::equal);
1887 }
1888 tmp_check = CR0;
1889 }
1890
1891 // Clear combined_check.eq if not already used.
1892 if (tmp_check == combined_check) {
1893 __ crandc(combined_check, Assembler::equal, combined_check, Assembler::equal);
1894 tmp_check = CR0;
1895 }
1896
1897 if (flags & LIR_OpArrayCopy::src_pos_positive_check) {
1898 // Test src_pos register.
1899 __ cmpwi(tmp_check, src_pos, 0);
1900 __ cror(combined_check, Assembler::equal, tmp_check, Assembler::less);
1901 }
1902
1903 if (flags & LIR_OpArrayCopy::dst_pos_positive_check) {
1904 // Test dst_pos register.
1905 __ cmpwi(tmp_check, dst_pos, 0);
1906 __ cror(combined_check, Assembler::equal, tmp_check, Assembler::less);
1907 }
1908
1909 if (flags & LIR_OpArrayCopy::length_positive_check) {
1910 // Make sure length isn't negative.
1911 __ cmpwi(tmp_check, length, 0);
1912 __ cror(combined_check, Assembler::equal, tmp_check, Assembler::less);
1913 }
1914
1915 __ beq(combined_check, slow);
1916 }
1917
1918 // If the compiler was not able to prove that exact type of the source or the destination
1919 // of the arraycopy is an array type, check at runtime if the source or the destination is
1920 // an instance type.
1921 if (flags & LIR_OpArrayCopy::type_check) {
1922 if (!(flags & LIR_OpArrayCopy::dst_objarray)) {
1923 __ load_klass(tmp, dst);
1924 __ lwz(tmp2, in_bytes(Klass::layout_helper_offset()), tmp);
1925 __ cmpwi(CR0, tmp2, Klass::_lh_neutral_value);
1926 __ bge(CR0, slow);
1927 }
1928
1929 if (!(flags & LIR_OpArrayCopy::src_objarray)) {
1930 __ load_klass(tmp, src);
1931 __ lwz(tmp2, in_bytes(Klass::layout_helper_offset()), tmp);
1932 __ cmpwi(CR0, tmp2, Klass::_lh_neutral_value);
1933 __ bge(CR0, slow);
1934 }
1935 }
1936
1937 // Higher 32bits must be null.
1938 __ extsw(length, length);
1939
1940 __ extsw(src_pos, src_pos);
1941 if (flags & LIR_OpArrayCopy::src_range_check) {
1942 __ lwz(tmp2, arrayOopDesc::length_offset_in_bytes(), src);
1943 __ add(tmp, length, src_pos);
1944 __ cmpld(CR0, tmp2, tmp);
1945 __ ble(CR0, slow);
1946 }
1947
1948 __ extsw(dst_pos, dst_pos);
1949 if (flags & LIR_OpArrayCopy::dst_range_check) {
1950 __ lwz(tmp2, arrayOopDesc::length_offset_in_bytes(), dst);
1951 __ add(tmp, length, dst_pos);
1952 __ cmpld(CR0, tmp2, tmp);
1953 __ ble(CR0, slow);
1954 }
1955
1956 int shift = shift_amount(basic_type);
1957
1958 if (!(flags & LIR_OpArrayCopy::type_check)) {
1959 if (stub != nullptr) {
1960 __ b(cont);
1961 __ bind(slow);
1962 __ b(*stub->entry());
1963 }
1964 } else {
1965 // We don't know the array types are compatible.
1966 if (basic_type != T_OBJECT) {
1967 // Simple test for basic type arrays.
1968 __ cmp_klasses_from_objects(CR0, src, dst, tmp, tmp2);
1969 __ beq(CR0, cont);
1970 } else {
1971 // For object arrays, if src is a sub class of dst then we can
1972 // safely do the copy.
1973 address copyfunc_addr = StubRoutines::checkcast_arraycopy();
1974
1975 const Register sub_klass = R5, super_klass = R4; // like CheckCast/InstanceOf
1976 assert_different_registers(tmp, tmp2, sub_klass, super_klass);
1977
1978 __ load_klass(sub_klass, src);
1979 __ load_klass(super_klass, dst);
1980
1981 __ check_klass_subtype_fast_path(sub_klass, super_klass, tmp, tmp2,
1982 &cont, copyfunc_addr != nullptr ? ©func : &slow, nullptr);
1983
1984 address slow_stc = Runtime1::entry_for(StubId::c1_slow_subtype_check_id);
1985 //__ load_const_optimized(tmp, slow_stc, tmp2);
1986 __ calculate_address_from_global_toc(tmp, slow_stc, true, true, false);
1987 __ mtctr(tmp);
1988 __ bctrl(); // sets CR0
1989 __ beq(CR0, cont);
1990
1991 if (copyfunc_addr != nullptr) { // Use stub if available.
1992 __ bind(copyfunc);
1993 // Src is not a sub class of dst so we have to do a
1994 // per-element check.
1995 int mask = LIR_OpArrayCopy::src_objarray|LIR_OpArrayCopy::dst_objarray;
1996 if ((flags & mask) != mask) {
1997 assert(flags & mask, "one of the two should be known to be an object array");
1998
1999 if (!(flags & LIR_OpArrayCopy::src_objarray)) {
2000 __ load_klass(tmp, src);
2001 } else if (!(flags & LIR_OpArrayCopy::dst_objarray)) {
2002 __ load_klass(tmp, dst);
2003 }
2004
2005 __ lwz(tmp2, in_bytes(Klass::layout_helper_offset()), tmp);
2006
2007 jint objArray_lh = Klass::array_layout_helper(T_OBJECT);
2008 __ load_const_optimized(tmp, objArray_lh);
2009 __ cmpw(CR0, tmp, tmp2);
2010 __ bne(CR0, slow);
2011 }
2012
2013 Register src_ptr = R3_ARG1;
2014 Register dst_ptr = R4_ARG2;
2015 Register len = R5_ARG3;
2016 Register chk_off = R6_ARG4;
2017 Register super_k = R7_ARG5;
2018
2019 __ addi(src_ptr, src, arrayOopDesc::base_offset_in_bytes(basic_type));
2020 __ addi(dst_ptr, dst, arrayOopDesc::base_offset_in_bytes(basic_type));
2021 if (shift == 0) {
2022 __ add(src_ptr, src_pos, src_ptr);
2023 __ add(dst_ptr, dst_pos, dst_ptr);
2024 } else {
2025 __ sldi(tmp, src_pos, shift);
2026 __ sldi(tmp2, dst_pos, shift);
2027 __ add(src_ptr, tmp, src_ptr);
2028 __ add(dst_ptr, tmp2, dst_ptr);
2029 }
2030
2031 __ load_klass(tmp, dst);
2032 __ mr(len, length);
2033
2034 int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset());
2035 __ ld(super_k, ek_offset, tmp);
2036
2037 int sco_offset = in_bytes(Klass::super_check_offset_offset());
2038 __ lwz(chk_off, sco_offset, super_k);
2039
2040 __ call_c(copyfunc_addr, relocInfo::runtime_call_type);
2041
2042 #ifndef PRODUCT
2043 if (PrintC1Statistics) {
2044 Label failed;
2045 __ cmpwi(CR0, R3_RET, 0);
2046 __ bne(CR0, failed);
2047 address counter = (address)&Runtime1::_arraycopy_checkcast_cnt;
2048 int simm16_offs = __ load_const_optimized(tmp, counter, tmp2, true);
2049 __ lwz(R11_scratch1, simm16_offs, tmp);
2050 __ addi(R11_scratch1, R11_scratch1, 1);
2051 __ stw(R11_scratch1, simm16_offs, tmp);
2052 __ bind(failed);
2053 }
2054 #endif
2055
2056 __ nand(tmp, R3_RET, R3_RET);
2057 __ cmpwi(CR0, R3_RET, 0);
2058 __ beq(CR0, *stub->continuation());
2059
2060 #ifndef PRODUCT
2061 if (PrintC1Statistics) {
2062 address counter = (address)&Runtime1::_arraycopy_checkcast_attempt_cnt;
2063 int simm16_offs = __ load_const_optimized(tmp, counter, tmp2, true);
2064 __ lwz(R11_scratch1, simm16_offs, tmp);
2065 __ addi(R11_scratch1, R11_scratch1, 1);
2066 __ stw(R11_scratch1, simm16_offs, tmp);
2067 }
2068 #endif
2069
2070 __ subf(length, tmp, length);
2071 __ add(src_pos, tmp, src_pos);
2072 __ add(dst_pos, tmp, dst_pos);
2073 }
2074 }
2075 __ bind(slow);
2076 __ b(*stub->entry());
2077 }
2078 __ bind(cont);
2079
2080 #ifdef ASSERT
2081 if (basic_type != T_OBJECT || !(flags & LIR_OpArrayCopy::type_check)) {
2082 // Sanity check the known type with the incoming class. For the
2083 // primitive case the types must match exactly with src.klass and
2084 // dst.klass each exactly matching the default type. For the
2085 // object array case, if no type check is needed then either the
2086 // dst type is exactly the expected type and the src type is a
2087 // subtype which we can't check or src is the same array as dst
2088 // but not necessarily exactly of type default_type.
2089 Label known_ok, halt;
2090 metadata2reg(default_type->constant_encoding(), tmp);
2091 __ cmp_klass(CR0, dst, tmp, R11_scratch1, R12_scratch2);
2092 if (basic_type != T_OBJECT) {
2093 __ bne(CR0, halt);
2094 __ cmp_klass(CR0, src, tmp, R11_scratch1, R12_scratch2);
2095 __ beq(CR0, known_ok);
2096 } else {
2097 __ beq(CR0, known_ok);
2098 __ cmpw(CR0, src, dst);
2099 __ beq(CR0, known_ok);
2100 }
2101 __ bind(halt);
2102 __ stop("incorrect type information in arraycopy");
2103 __ bind(known_ok);
2104 }
2105 #endif
2106
2107 #ifndef PRODUCT
2108 if (PrintC1Statistics) {
2109 address counter = Runtime1::arraycopy_count_address(basic_type);
2110 int simm16_offs = __ load_const_optimized(tmp, counter, tmp2, true);
2111 __ lwz(R11_scratch1, simm16_offs, tmp);
2112 __ addi(R11_scratch1, R11_scratch1, 1);
2113 __ stw(R11_scratch1, simm16_offs, tmp);
2114 }
2115 #endif
2116
2117 Register src_ptr = R3_ARG1;
2118 Register dst_ptr = R4_ARG2;
2119 Register len = R5_ARG3;
2120
2121 __ addi(src_ptr, src, arrayOopDesc::base_offset_in_bytes(basic_type));
2122 __ addi(dst_ptr, dst, arrayOopDesc::base_offset_in_bytes(basic_type));
2123 if (shift == 0) {
2124 __ add(src_ptr, src_pos, src_ptr);
2125 __ add(dst_ptr, dst_pos, dst_ptr);
2126 } else {
2127 __ sldi(tmp, src_pos, shift);
2128 __ sldi(tmp2, dst_pos, shift);
2129 __ add(src_ptr, tmp, src_ptr);
2130 __ add(dst_ptr, tmp2, dst_ptr);
2131 }
2132
2133 bool disjoint = (flags & LIR_OpArrayCopy::overlapping) == 0;
2134 bool aligned = (flags & LIR_OpArrayCopy::unaligned) == 0;
2135 const char *name;
2136 address entry = StubRoutines::select_arraycopy_function(basic_type, aligned, disjoint, name, false);
2137
2138 // Arraycopy stubs takes a length in number of elements, so don't scale it.
2139 __ mr(len, length);
2140 __ call_c(entry, relocInfo::runtime_call_type);
2141
2142 if (stub != nullptr) {
2143 __ bind(*stub->continuation());
2144 }
2145 }
2146
2147
2148 void LIR_Assembler::shift_op(LIR_Code code, LIR_Opr left, LIR_Opr count, LIR_Opr dest, LIR_Opr tmp) {
2149 if (dest->is_single_cpu()) {
2150 __ rldicl(tmp->as_register(), count->as_register(), 0, 64-5);
2151 #ifdef _LP64
2152 if (left->type() == T_OBJECT) {
2153 switch (code) {
2154 case lir_shl: __ sld(dest->as_register(), left->as_register(), tmp->as_register()); break;
2155 case lir_shr: __ srad(dest->as_register(), left->as_register(), tmp->as_register()); break;
2156 case lir_ushr: __ srd(dest->as_register(), left->as_register(), tmp->as_register()); break;
2157 default: ShouldNotReachHere();
2158 }
2159 } else
2160 #endif
2161 switch (code) {
2162 case lir_shl: __ slw(dest->as_register(), left->as_register(), tmp->as_register()); break;
2163 case lir_shr: __ sraw(dest->as_register(), left->as_register(), tmp->as_register()); break;
2164 case lir_ushr: __ srw(dest->as_register(), left->as_register(), tmp->as_register()); break;
2165 default: ShouldNotReachHere();
2166 }
2167 } else {
2168 __ rldicl(tmp->as_register(), count->as_register(), 0, 64-6);
2169 switch (code) {
2170 case lir_shl: __ sld(dest->as_register_lo(), left->as_register_lo(), tmp->as_register()); break;
2171 case lir_shr: __ srad(dest->as_register_lo(), left->as_register_lo(), tmp->as_register()); break;
2172 case lir_ushr: __ srd(dest->as_register_lo(), left->as_register_lo(), tmp->as_register()); break;
2173 default: ShouldNotReachHere();
2174 }
2175 }
2176 }
2177
2178
2179 void LIR_Assembler::shift_op(LIR_Code code, LIR_Opr left, jint count, LIR_Opr dest) {
2180 #ifdef _LP64
2181 if (left->type() == T_OBJECT) {
2182 count = count & 63; // Shouldn't shift by more than sizeof(intptr_t).
2183 if (count == 0) { __ mr_if_needed(dest->as_register_lo(), left->as_register()); }
2184 else {
2185 switch (code) {
2186 case lir_shl: __ sldi(dest->as_register_lo(), left->as_register(), count); break;
2187 case lir_shr: __ sradi(dest->as_register_lo(), left->as_register(), count); break;
2188 case lir_ushr: __ srdi(dest->as_register_lo(), left->as_register(), count); break;
2189 default: ShouldNotReachHere();
2190 }
2191 }
2192 return;
2193 }
2194 #endif
2195
2196 if (dest->is_single_cpu()) {
2197 count = count & 0x1F; // Java spec
2198 if (count == 0) { __ mr_if_needed(dest->as_register(), left->as_register()); }
2199 else {
2200 switch (code) {
2201 case lir_shl: __ slwi(dest->as_register(), left->as_register(), count); break;
2202 case lir_shr: __ srawi(dest->as_register(), left->as_register(), count); break;
2203 case lir_ushr: __ srwi(dest->as_register(), left->as_register(), count); break;
2204 default: ShouldNotReachHere();
2205 }
2206 }
2207 } else if (dest->is_double_cpu()) {
2208 count = count & 63; // Java spec
2209 if (count == 0) { __ mr_if_needed(dest->as_pointer_register(), left->as_pointer_register()); }
2210 else {
2211 switch (code) {
2212 case lir_shl: __ sldi(dest->as_pointer_register(), left->as_pointer_register(), count); break;
2213 case lir_shr: __ sradi(dest->as_pointer_register(), left->as_pointer_register(), count); break;
2214 case lir_ushr: __ srdi(dest->as_pointer_register(), left->as_pointer_register(), count); break;
2215 default: ShouldNotReachHere();
2216 }
2217 }
2218 } else {
2219 ShouldNotReachHere();
2220 }
2221 }
2222
2223
2224 void LIR_Assembler::emit_alloc_obj(LIR_OpAllocObj* op) {
2225 if (op->init_check()) {
2226 if (!os::zero_page_read_protected() || !ImplicitNullChecks) {
2227 explicit_null_check(op->klass()->as_register(), op->stub()->info());
2228 } else {
2229 add_debug_info_for_null_check_here(op->stub()->info());
2230 }
2231 __ lbz(op->tmp1()->as_register(),
2232 in_bytes(InstanceKlass::init_state_offset()), op->klass()->as_register());
2233 // acquire barrier included in membar_storestore() which follows the allocation immediately.
2234 __ cmpwi(CR0, op->tmp1()->as_register(), InstanceKlass::fully_initialized);
2235 __ bc_far_optimized(Assembler::bcondCRbiIs0, __ bi0(CR0, Assembler::equal), *op->stub()->entry());
2236 }
2237 __ allocate_object(op->obj()->as_register(),
2238 op->tmp1()->as_register(),
2239 op->tmp2()->as_register(),
2240 op->tmp3()->as_register(),
2241 op->header_size(),
2242 op->object_size(),
2243 op->klass()->as_register(),
2244 *op->stub()->entry());
2245
2246 __ bind(*op->stub()->continuation());
2247 __ verify_oop(op->obj()->as_register(), FILE_AND_LINE);
2248 }
2249
2250
2251 void LIR_Assembler::emit_alloc_array(LIR_OpAllocArray* op) {
2252 LP64_ONLY( __ extsw(op->len()->as_register(), op->len()->as_register()); )
2253 if (UseSlowPath ||
2254 (!UseFastNewObjectArray && (is_reference_type(op->type()))) ||
2255 (!UseFastNewTypeArray && (!is_reference_type(op->type())))) {
2256 __ b(*op->stub()->entry());
2257 } else {
2258 __ allocate_array(op->obj()->as_register(),
2259 op->len()->as_register(),
2260 op->tmp1()->as_register(),
2261 op->tmp2()->as_register(),
2262 op->tmp3()->as_register(),
2263 arrayOopDesc::base_offset_in_bytes(op->type()),
2264 type2aelembytes(op->type()),
2265 op->klass()->as_register(),
2266 *op->stub()->entry(),
2267 op->zero_array());
2268 }
2269 __ bind(*op->stub()->continuation());
2270 }
2271
2272
2273 // kills recv
2274 void LIR_Assembler::type_profile_helper(Register mdo, int mdo_offset_bias,
2275 ciMethodData *md, ciProfileData *data,
2276 Register recv, Register tmp) {
2277 int mdp_offset = md->byte_offset_of_slot(data, in_ByteSize(0)) - mdo_offset_bias;
2278 __ profile_receiver_type(recv, mdo, mdp_offset, tmp, noreg);
2279 }
2280
2281
2282 void LIR_Assembler::setup_md_access(ciMethod* method, int bci,
2283 ciMethodData*& md, ciProfileData*& data, int& mdo_offset_bias) {
2284 md = method->method_data_or_null();
2285 assert(md != nullptr, "Sanity");
2286 data = md->bci_to_data(bci);
2287 assert(data != nullptr, "need data for checkcast");
2288 assert(data->is_ReceiverTypeData(), "need ReceiverTypeData for type check");
2289 if (!Assembler::is_simm16(md->byte_offset_of_slot(data, DataLayout::header_offset()) + data->size_in_bytes())) {
2290 // The offset is large so bias the mdo by the base of the slot so
2291 // that the ld can use simm16s to reference the slots of the data.
2292 mdo_offset_bias = md->byte_offset_of_slot(data, DataLayout::header_offset());
2293 }
2294 }
2295
2296
2297 void LIR_Assembler::emit_typecheck_helper(LIR_OpTypeCheck *op, Label* success, Label* failure, Label* obj_is_null) {
2298 const Register obj = op->object()->as_register(); // Needs to live in this register at safepoint (patching stub).
2299 Register k_RInfo = op->tmp1()->as_register();
2300 Register klass_RInfo = op->tmp2()->as_register();
2301 Register Rtmp1 = op->tmp3()->as_register();
2302 Register dst = op->result_opr()->as_register();
2303 ciKlass* k = op->klass();
2304 bool should_profile = op->should_profile();
2305 // Attention: do_temp(opTypeCheck->_object) is not used, i.e. obj may be same as one of the temps.
2306 bool reg_conflict = false;
2307 if (obj == k_RInfo) {
2308 k_RInfo = dst;
2309 reg_conflict = true;
2310 } else if (obj == klass_RInfo) {
2311 klass_RInfo = dst;
2312 reg_conflict = true;
2313 } else if (obj == Rtmp1) {
2314 Rtmp1 = dst;
2315 reg_conflict = true;
2316 }
2317 assert_different_registers(obj, k_RInfo, klass_RInfo, Rtmp1);
2318
2319 ciMethodData* md = nullptr;
2320 ciProfileData* data = nullptr;
2321 int mdo_offset_bias = 0;
2322 if (should_profile) {
2323 ciMethod* method = op->profiled_method();
2324 assert(method != nullptr, "Should have method");
2325 setup_md_access(method, op->profiled_bci(), md, data, mdo_offset_bias);
2326
2327 Register mdo = k_RInfo;
2328 Register data_val = Rtmp1;
2329 Label not_null;
2330 metadata2reg(md->constant_encoding(), mdo);
2331 __ add_const_optimized(mdo, mdo, mdo_offset_bias, R0);
2332 __ cmpdi(CR0, obj, 0);
2333 __ bne(CR0, not_null);
2334 __ lbz(data_val, md->byte_offset_of_slot(data, DataLayout::flags_offset()) - mdo_offset_bias, mdo);
2335 __ ori(data_val, data_val, BitData::null_seen_byte_constant());
2336 __ stb(data_val, md->byte_offset_of_slot(data, DataLayout::flags_offset()) - mdo_offset_bias, mdo);
2337 __ b(*obj_is_null);
2338 __ bind(not_null);
2339
2340 Register recv = klass_RInfo;
2341 __ load_klass(recv, obj);
2342 type_profile_helper(mdo, mdo_offset_bias, md, data, recv, Rtmp1); // kills recv
2343 } else {
2344 __ cmpdi(CR0, obj, 0);
2345 __ beq(CR0, *obj_is_null);
2346 }
2347
2348 // get object class
2349 __ load_klass(klass_RInfo, obj);
2350
2351 if (k->is_loaded()) {
2352 metadata2reg(k->constant_encoding(), k_RInfo);
2353 } else {
2354 klass2reg_with_patching(k_RInfo, op->info_for_patch());
2355 }
2356
2357 if (op->fast_check()) {
2358 assert(!k->is_loaded() || !k->is_obj_array_klass(), "Use refined array for a direct pointer comparison");
2359 assert_different_registers(klass_RInfo, k_RInfo);
2360 __ cmpd(CR0, k_RInfo, klass_RInfo);
2361 __ beq(CR0, *success);
2362 // Fall through to failure case.
2363 } else {
2364 bool need_slow_path = true;
2365 if (k->is_loaded()) {
2366 if ((int) k->super_check_offset() != in_bytes(Klass::secondary_super_cache_offset())) {
2367 need_slow_path = false;
2368 }
2369 // Perform the fast part of the checking logic.
2370 __ check_klass_subtype_fast_path(klass_RInfo, k_RInfo, Rtmp1, R0, (need_slow_path ? success : nullptr),
2371 failure, nullptr, RegisterOrConstant(k->super_check_offset()));
2372 } else {
2373 // Perform the fast part of the checking logic.
2374 __ check_klass_subtype_fast_path(klass_RInfo, k_RInfo, Rtmp1, R0, success, failure);
2375 }
2376 if (!need_slow_path) {
2377 __ b(*success);
2378 } else {
2379 // Call out-of-line instance of __ check_klass_subtype_slow_path(...):
2380 address entry = Runtime1::entry_for(StubId::c1_slow_subtype_check_id);
2381 // Stub needs fixed registers (tmp1-3).
2382 Register original_k_RInfo = op->tmp1()->as_register();
2383 Register original_klass_RInfo = op->tmp2()->as_register();
2384 Register original_Rtmp1 = op->tmp3()->as_register();
2385 bool keep_obj_alive = reg_conflict && (op->code() == lir_checkcast);
2386 if (keep_obj_alive && (obj != original_Rtmp1)) { __ mr(R0, obj); }
2387 __ mr_if_needed(original_k_RInfo, k_RInfo);
2388 __ mr_if_needed(original_klass_RInfo, klass_RInfo);
2389 if (keep_obj_alive) { __ mr(dst, (obj == original_Rtmp1) ? obj : R0); }
2390 //__ load_const_optimized(original_Rtmp1, entry, R0);
2391 __ calculate_address_from_global_toc(original_Rtmp1, entry, true, true, false);
2392 __ mtctr(original_Rtmp1);
2393 __ bctrl(); // sets CR0
2394 if (keep_obj_alive) { __ mr(obj, dst); }
2395 __ beq(CR0, *success);
2396 // Fall through to failure case.
2397 }
2398 }
2399
2400 __ bind(*failure);
2401 }
2402
2403
2404 void LIR_Assembler::emit_opTypeCheck(LIR_OpTypeCheck* op) {
2405 LIR_Code code = op->code();
2406 if (code == lir_store_check) {
2407 Register value = op->object()->as_register();
2408 Register array = op->array()->as_register();
2409 Register k_RInfo = op->tmp1()->as_register();
2410 Register klass_RInfo = op->tmp2()->as_register();
2411 Register Rtmp1 = op->tmp3()->as_register();
2412 bool should_profile = op->should_profile();
2413
2414 __ verify_oop(value, FILE_AND_LINE);
2415 CodeStub* stub = op->stub();
2416 // Check if it needs to be profiled.
2417 ciMethodData* md = nullptr;
2418 ciProfileData* data = nullptr;
2419 int mdo_offset_bias = 0;
2420 if (should_profile) {
2421 ciMethod* method = op->profiled_method();
2422 assert(method != nullptr, "Should have method");
2423 setup_md_access(method, op->profiled_bci(), md, data, mdo_offset_bias);
2424 }
2425
2426 Label done;
2427
2428 if (op->need_null_check()) {
2429 if (should_profile) {
2430 Label not_null;
2431 Register mdo = k_RInfo;
2432 Register data_val = Rtmp1;
2433 metadata2reg(md->constant_encoding(), mdo);
2434 __ add_const_optimized(mdo, mdo, mdo_offset_bias, R0);
2435 __ cmpdi(CR0, value, 0);
2436 __ bne(CR0, not_null);
2437 __ lbz(data_val, md->byte_offset_of_slot(data, DataLayout::flags_offset()) - mdo_offset_bias, mdo);
2438 __ ori(data_val, data_val, BitData::null_seen_byte_constant());
2439 __ stb(data_val, md->byte_offset_of_slot(data, DataLayout::flags_offset()) - mdo_offset_bias, mdo);
2440 __ b(done);
2441 __ bind(not_null);
2442
2443 Register recv = klass_RInfo;
2444 __ load_klass(recv, value);
2445 type_profile_helper(mdo, mdo_offset_bias, md, data, recv, Rtmp1); // kills recv
2446 } else {
2447 __ cmpdi(CR0, value, 0);
2448 __ beq(CR0, done);
2449 }
2450 }
2451 if (!os::zero_page_read_protected() || !ImplicitNullChecks) {
2452 explicit_null_check(array, op->info_for_exception());
2453 } else {
2454 add_debug_info_for_null_check_here(op->info_for_exception());
2455 }
2456 __ load_klass(k_RInfo, array);
2457 __ load_klass(klass_RInfo, value);
2458
2459 Label failure;
2460
2461 // Get instance klass.
2462 __ ld(k_RInfo, in_bytes(ObjArrayKlass::element_klass_offset()), k_RInfo);
2463 // Perform the fast part of the checking logic.
2464 __ check_klass_subtype_fast_path(klass_RInfo, k_RInfo, Rtmp1, R0, &done, &failure, nullptr);
2465
2466 // Call out-of-line instance of __ check_klass_subtype_slow_path(...):
2467 const address slow_path = Runtime1::entry_for(StubId::c1_slow_subtype_check_id);
2468 //__ load_const_optimized(R0, slow_path);
2469 __ add_const_optimized(R0, R29_TOC, MacroAssembler::offset_to_global_toc(slow_path));
2470 __ mtctr(R0);
2471 __ bctrl(); // sets CR0
2472 __ beq(CR0, done);
2473
2474 __ bind(failure);
2475 __ b(*stub->entry());
2476 __ align(32, 12);
2477 __ bind(done);
2478
2479 } else if (code == lir_checkcast) {
2480 Label success, failure;
2481 emit_typecheck_helper(op, &success, /*fallthru*/&failure, &success);
2482 __ b(*op->stub()->entry());
2483 __ align(32, 12);
2484 __ bind(success);
2485 __ mr_if_needed(op->result_opr()->as_register(), op->object()->as_register());
2486 } else if (code == lir_instanceof) {
2487 Register dst = op->result_opr()->as_register();
2488 Label success, failure, done;
2489 emit_typecheck_helper(op, &success, /*fallthru*/&failure, &failure);
2490 __ li(dst, 0);
2491 __ b(done);
2492 __ align(32, 12);
2493 __ bind(success);
2494 __ li(dst, 1);
2495 __ bind(done);
2496 } else {
2497 ShouldNotReachHere();
2498 }
2499 }
2500
2501
2502 void LIR_Assembler::emit_compare_and_swap(LIR_OpCompareAndSwap* op) {
2503 Register addr = op->addr()->as_pointer_register();
2504 Register cmp_value = noreg, new_value = noreg;
2505 bool is_64bit = false;
2506
2507 if (op->code() == lir_cas_long) {
2508 cmp_value = op->cmp_value()->as_register_lo();
2509 new_value = op->new_value()->as_register_lo();
2510 is_64bit = true;
2511 } else if (op->code() == lir_cas_int || op->code() == lir_cas_obj) {
2512 cmp_value = op->cmp_value()->as_register();
2513 new_value = op->new_value()->as_register();
2514 if (op->code() == lir_cas_obj) {
2515 if (UseCompressedOops) {
2516 Register t1 = op->tmp1()->as_register();
2517 Register t2 = op->tmp2()->as_register();
2518 cmp_value = __ encode_heap_oop(t1, cmp_value);
2519 new_value = __ encode_heap_oop(t2, new_value);
2520 } else {
2521 is_64bit = true;
2522 }
2523 }
2524 } else {
2525 Unimplemented();
2526 }
2527
2528 // There might be a volatile load before this Unsafe CAS.
2529 if (support_IRIW_for_not_multiple_copy_atomic_cpu) {
2530 __ sync();
2531 } else {
2532 __ lwsync();
2533 }
2534
2535 if (is_64bit) {
2536 __ cmpxchgd(BOOL_RESULT, /*current_value=*/R0, cmp_value, new_value, addr,
2537 MacroAssembler::MemBarNone,
2538 MacroAssembler::cmpxchgx_hint_atomic_update(),
2539 noreg, nullptr, /*check without ldarx first*/true);
2540 } else {
2541 __ cmpxchgw(BOOL_RESULT, /*current_value=*/R0, cmp_value, new_value, addr,
2542 MacroAssembler::MemBarNone,
2543 MacroAssembler::cmpxchgx_hint_atomic_update(),
2544 noreg, nullptr, /*check without ldarx first*/true);
2545 }
2546
2547 if (support_IRIW_for_not_multiple_copy_atomic_cpu) {
2548 __ isync();
2549 } else {
2550 __ sync();
2551 }
2552 }
2553
2554 void LIR_Assembler::breakpoint() {
2555 __ illtrap();
2556 }
2557
2558
2559 void LIR_Assembler::push(LIR_Opr opr) {
2560 Unimplemented();
2561 }
2562
2563 void LIR_Assembler::pop(LIR_Opr opr) {
2564 Unimplemented();
2565 }
2566
2567
2568 void LIR_Assembler::monitor_address(int monitor_no, LIR_Opr dst_opr) {
2569 Address mon_addr = frame_map()->address_for_monitor_lock(monitor_no);
2570 Register dst = dst_opr->as_register();
2571 Register reg = mon_addr.base();
2572 int offset = mon_addr.disp();
2573 // Compute pointer to BasicLock.
2574 __ add_const_optimized(dst, reg, offset);
2575 }
2576
2577
2578 void LIR_Assembler::emit_lock(LIR_OpLock* op) {
2579 Register obj = op->obj_opr()->as_register();
2580 Register hdr = op->hdr_opr()->as_register();
2581 Register lock = op->lock_opr()->as_register();
2582
2583 // Obj may not be an oop.
2584 if (op->code() == lir_lock) {
2585 MonitorEnterStub* stub = (MonitorEnterStub*)op->stub();
2586 // Add debug info for NullPointerException only if one is possible.
2587 if (op->info() != nullptr) {
2588 if (!os::zero_page_read_protected() || !ImplicitNullChecks) {
2589 explicit_null_check(obj, op->info());
2590 } else {
2591 add_debug_info_for_null_check_here(op->info());
2592 }
2593 }
2594 __ lock_object(hdr, obj, lock, op->scratch_opr()->as_register(), *op->stub()->entry());
2595 } else {
2596 assert (op->code() == lir_unlock, "Invalid code, expected lir_unlock");
2597 __ unlock_object(hdr, obj, lock, *op->stub()->entry());
2598 }
2599 __ bind(*op->stub()->continuation());
2600 }
2601
2602 void LIR_Assembler::emit_load_klass(LIR_OpLoadKlass* op) {
2603 Register obj = op->obj()->as_pointer_register();
2604 Register result = op->result_opr()->as_pointer_register();
2605
2606 CodeEmitInfo* info = op->info();
2607 if (info != nullptr) {
2608 if (!os::zero_page_read_protected() || !ImplicitNullChecks) {
2609 explicit_null_check(obj, info);
2610 } else {
2611 add_debug_info_for_null_check_here(info);
2612 }
2613 }
2614
2615 __ load_klass(result, obj);
2616 }
2617
2618 void LIR_Assembler::emit_profile_call(LIR_OpProfileCall* op) {
2619 ciMethod* method = op->profiled_method();
2620 int bci = op->profiled_bci();
2621 ciMethod* callee = op->profiled_callee();
2622
2623 // Update counter for all call types.
2624 ciMethodData* md = method->method_data_or_null();
2625 assert(md != nullptr, "Sanity");
2626 ciProfileData* data = md->bci_to_data(bci);
2627 assert(data != nullptr && data->is_CounterData(), "need CounterData for calls");
2628 assert(op->mdo()->is_single_cpu(), "mdo must be allocated");
2629 Register mdo = op->mdo()->as_register();
2630 #ifdef _LP64
2631 assert(op->tmp1()->is_double_cpu(), "tmp1 must be allocated");
2632 Register tmp1 = op->tmp1()->as_register_lo();
2633 #else
2634 assert(op->tmp1()->is_single_cpu(), "tmp1 must be allocated");
2635 Register tmp1 = op->tmp1()->as_register();
2636 #endif
2637 metadata2reg(md->constant_encoding(), mdo);
2638 int mdo_offset_bias = 0;
2639 if (!Assembler::is_simm16(md->byte_offset_of_slot(data, CounterData::count_offset()) +
2640 data->size_in_bytes())) {
2641 // The offset is large so bias the mdo by the base of the slot so
2642 // that the ld can use simm16s to reference the slots of the data.
2643 mdo_offset_bias = md->byte_offset_of_slot(data, CounterData::count_offset());
2644 __ add_const_optimized(mdo, mdo, mdo_offset_bias, R0);
2645 }
2646
2647 // Perform additional virtual call profiling for invokevirtual and
2648 // invokeinterface bytecodes
2649 if (op->should_profile_receiver_type()) {
2650 assert(op->recv()->is_single_cpu(), "recv must be allocated");
2651 Register recv = op->recv()->as_register();
2652 assert_different_registers(mdo, tmp1, recv);
2653 assert(data->is_VirtualCallData(), "need VirtualCallData for virtual calls");
2654 ciKlass* known_klass = op->known_holder();
2655 if (C1OptimizeVirtualCallProfiling && known_klass != nullptr) {
2656 // We know the type that will be seen at this call site; we can
2657 // statically update the MethodData* rather than needing to do
2658 // dynamic tests on the receiver type.
2659 ciVirtualCallData* vc_data = (ciVirtualCallData*) data;
2660 for (uint i = 0; i < VirtualCallData::row_limit(); i++) {
2661 ciKlass* receiver = vc_data->receiver(i);
2662 if (known_klass->equals(receiver)) {
2663 __ increment_mem64(mdo, md->byte_offset_of_slot(data, VirtualCallData::receiver_count_offset(i)) - mdo_offset_bias,
2664 DataLayout::counter_increment, tmp1);
2665 return;
2666 }
2667 }
2668
2669 // Receiver type is not found in profile data.
2670 // Fall back to runtime helper to handle the rest at runtime.
2671 metadata2reg(known_klass->constant_encoding(), recv);
2672 } else {
2673 __ load_klass(recv, recv);
2674 }
2675 type_profile_helper(mdo, mdo_offset_bias, md, data, recv, tmp1); // kills recv
2676 } else {
2677 // Static call
2678 __ increment_mem64(mdo, md->byte_offset_of_slot(data, CounterData::count_offset()) - mdo_offset_bias,
2679 DataLayout::counter_increment, tmp1);
2680 }
2681 }
2682
2683
2684 void LIR_Assembler::align_backward_branch_target() {
2685 __ align(32, 12); // Insert up to 3 nops to align with 32 byte boundary.
2686 }
2687
2688
2689 void LIR_Assembler::negate(LIR_Opr left, LIR_Opr dest, LIR_Opr tmp) {
2690 // tmp must be unused
2691 assert(tmp->is_illegal(), "wasting a register if tmp is allocated");
2692 assert(left->is_register(), "can only handle registers");
2693
2694 if (left->is_single_cpu()) {
2695 __ neg(dest->as_register(), left->as_register());
2696 } else if (left->is_single_fpu()) {
2697 __ fneg(dest->as_float_reg(), left->as_float_reg());
2698 } else if (left->is_double_fpu()) {
2699 __ fneg(dest->as_double_reg(), left->as_double_reg());
2700 } else {
2701 assert (left->is_double_cpu(), "Must be a long");
2702 __ neg(dest->as_register_lo(), left->as_register_lo());
2703 }
2704 }
2705
2706
2707 void LIR_Assembler::rt_call(LIR_Opr result, address dest,
2708 const LIR_OprList* args, LIR_Opr tmp, CodeEmitInfo* info) {
2709 // Stubs: Called via rt_call, but dest is a stub address (no FunctionDescriptor).
2710 if (dest == Runtime1::entry_for(StubId::c1_register_finalizer_id) ||
2711 dest == Runtime1::entry_for(StubId::c1_new_multi_array_id ) ||
2712 dest == Runtime1::entry_for(StubId::c1_is_instance_of_id )) {
2713 assert(CodeCache::contains(dest), "simplified call is only for special C1 stubs");
2714 //__ load_const_optimized(R0, dest);
2715 __ add_const_optimized(R0, R29_TOC, MacroAssembler::offset_to_global_toc(dest));
2716 __ mtctr(R0);
2717 __ bctrl();
2718 if (info != nullptr) {
2719 add_call_info_here(info);
2720 __ post_call_nop();
2721 }
2722 return;
2723 }
2724
2725 __ call_c(dest, relocInfo::runtime_call_type);
2726 assert(__ last_calls_return_pc() == __ pc(), "pcn not at return pc");
2727 if (info != nullptr) {
2728 add_call_info_here(info);
2729 __ post_call_nop();
2730 }
2731 }
2732
2733
2734 void LIR_Assembler::volatile_move_op(LIR_Opr src, LIR_Opr dest, BasicType type, CodeEmitInfo* info) {
2735 ShouldNotReachHere(); // Not needed on _LP64.
2736 }
2737
2738 void LIR_Assembler::membar() {
2739 __ fence();
2740 }
2741
2742 void LIR_Assembler::membar_acquire() {
2743 __ acquire();
2744 }
2745
2746 void LIR_Assembler::membar_release() {
2747 __ release();
2748 }
2749
2750 void LIR_Assembler::membar_loadload() {
2751 __ membar(Assembler::LoadLoad);
2752 }
2753
2754 void LIR_Assembler::membar_storestore() {
2755 __ membar(Assembler::StoreStore);
2756 }
2757
2758 void LIR_Assembler::membar_loadstore() {
2759 __ membar(Assembler::LoadStore);
2760 }
2761
2762 void LIR_Assembler::membar_storeload() {
2763 __ membar(Assembler::StoreLoad);
2764 }
2765
2766 void LIR_Assembler::on_spin_wait() {
2767 // SMT priority hint: drop to low for the spin, then restore to medium so
2768 // subsequent code is not penalised.
2769 // Yield (or 27,27,27) is not used because it was never implemented on Power CPUs, see JDK-8201218.
2770 __ block_comment("spin_wait {");
2771 __ smt_prio_low();
2772 __ smt_prio_medium();
2773 __ block_comment("}");
2774 }
2775
2776 void LIR_Assembler::leal(LIR_Opr addr_opr, LIR_Opr dest, LIR_PatchCode patch_code, CodeEmitInfo* info) {
2777 LIR_Address* addr = addr_opr->as_address_ptr();
2778 assert(addr->scale() == LIR_Address::times_1, "no scaling on this platform");
2779
2780 if (addr->index()->is_illegal()) {
2781 if (patch_code != lir_patch_none) {
2782 PatchingStub* patch = new PatchingStub(_masm, PatchingStub::access_field_id);
2783 __ load_const32(R0, 0); // patchable int
2784 __ add(dest->as_pointer_register(), addr->base()->as_pointer_register(), R0);
2785 patching_epilog(patch, patch_code, addr->base()->as_register(), info);
2786 } else {
2787 __ add_const_optimized(dest->as_pointer_register(), addr->base()->as_pointer_register(), addr->disp());
2788 }
2789 } else {
2790 assert(patch_code == lir_patch_none, "Patch code not supported");
2791 assert(addr->disp() == 0, "can't have both: index and disp");
2792 __ add(dest->as_pointer_register(), addr->index()->as_pointer_register(), addr->base()->as_pointer_register());
2793 }
2794 }
2795
2796
2797 void LIR_Assembler::get_thread(LIR_Opr result_reg) {
2798 ShouldNotReachHere();
2799 }
2800
2801
2802 #ifdef ASSERT
2803 // Emit run-time assertion.
2804 void LIR_Assembler::emit_assert(LIR_OpAssert* op) {
2805 Unimplemented();
2806 }
2807 #endif
2808
2809
2810 void LIR_Assembler::peephole(LIR_List* lir) {
2811 // Optimize instruction pairs before emitting.
2812 LIR_OpList* inst = lir->instructions_list();
2813 for (int i = 1; i < inst->length(); i++) {
2814 LIR_Op* op = inst->at(i);
2815
2816 // 2 register-register-moves
2817 if (op->code() == lir_move) {
2818 LIR_Opr in2 = ((LIR_Op1*)op)->in_opr(),
2819 res2 = ((LIR_Op1*)op)->result_opr();
2820 if (in2->is_register() && res2->is_register()) {
2821 LIR_Op* prev = inst->at(i - 1);
2822 if (prev && prev->code() == lir_move) {
2823 LIR_Opr in1 = ((LIR_Op1*)prev)->in_opr(),
2824 res1 = ((LIR_Op1*)prev)->result_opr();
2825 if (in1->is_same_register(res2) && in2->is_same_register(res1)) {
2826 inst->remove_at(i);
2827 }
2828 }
2829 }
2830 }
2831
2832 }
2833 return;
2834 }
2835
2836
2837 void LIR_Assembler::atomic_op(LIR_Code code, LIR_Opr src, LIR_Opr data, LIR_Opr dest, LIR_Opr tmp) {
2838 const LIR_Address *addr = src->as_address_ptr();
2839 assert(addr->disp() == 0 && addr->index()->is_illegal(), "use leal!");
2840 const Register Rptr = addr->base()->as_pointer_register(),
2841 Rtmp = tmp->as_register();
2842 Register Robj = noreg;
2843 if (data->is_oop()) {
2844 if (UseCompressedOops) {
2845 Robj = __ encode_heap_oop(Rtmp, data->as_register());
2846 } else {
2847 Robj = data->as_register();
2848 if (Robj == dest->as_register()) { // May happen with ZGC.
2849 __ mr(Rtmp, Robj);
2850 Robj = Rtmp;
2851 }
2852 }
2853 }
2854
2855 // There might be a volatile load before this Unsafe OP.
2856 if (support_IRIW_for_not_multiple_copy_atomic_cpu) {
2857 __ sync();
2858 } else {
2859 __ lwsync();
2860 }
2861
2862 Label Lretry;
2863 __ bind(Lretry);
2864
2865 if (data->type() == T_INT) {
2866 const Register Rold = dest->as_register(),
2867 Rsrc = data->as_register();
2868 assert_different_registers(Rptr, Rtmp, Rold, Rsrc);
2869 __ lwarx(Rold, Rptr, MacroAssembler::cmpxchgx_hint_atomic_update());
2870 if (code == lir_xadd) {
2871 __ add(Rtmp, Rsrc, Rold);
2872 __ stwcx_(Rtmp, Rptr);
2873 } else {
2874 __ stwcx_(Rsrc, Rptr);
2875 }
2876 } else if (data->is_oop()) {
2877 assert(code == lir_xchg, "xadd for oops");
2878 const Register Rold = dest->as_register();
2879 assert_different_registers(Rptr, Rold, Robj);
2880 if (UseCompressedOops) {
2881 __ lwarx(Rold, Rptr, MacroAssembler::cmpxchgx_hint_atomic_update());
2882 __ stwcx_(Robj, Rptr);
2883 } else {
2884 __ ldarx(Rold, Rptr, MacroAssembler::cmpxchgx_hint_atomic_update());
2885 __ stdcx_(Robj, Rptr);
2886 }
2887 } else if (data->type() == T_LONG) {
2888 const Register Rold = dest->as_register_lo(),
2889 Rsrc = data->as_register_lo();
2890 assert_different_registers(Rptr, Rtmp, Rold, Rsrc);
2891 __ ldarx(Rold, Rptr, MacroAssembler::cmpxchgx_hint_atomic_update());
2892 if (code == lir_xadd) {
2893 __ add(Rtmp, Rsrc, Rold);
2894 __ stdcx_(Rtmp, Rptr);
2895 } else {
2896 __ stdcx_(Rsrc, Rptr);
2897 }
2898 } else {
2899 ShouldNotReachHere();
2900 }
2901
2902 if (UseStaticBranchPredictionInCompareAndSwapPPC64) {
2903 __ bne_predict_not_taken(CR0, Lretry);
2904 } else {
2905 __ bne( CR0, Lretry);
2906 }
2907
2908 if (UseCompressedOops && data->is_oop()) {
2909 __ decode_heap_oop(dest->as_register());
2910 }
2911
2912 if (support_IRIW_for_not_multiple_copy_atomic_cpu) {
2913 __ isync();
2914 } else {
2915 __ sync();
2916 }
2917 }
2918
2919
2920 void LIR_Assembler::emit_profile_type(LIR_OpProfileType* op) {
2921 Register obj = op->obj()->as_register();
2922 Register tmp = op->tmp()->as_pointer_register();
2923 LIR_Address* mdo_addr = op->mdp()->as_address_ptr();
2924 ciKlass* exact_klass = op->exact_klass();
2925 intptr_t current_klass = op->current_klass();
2926 bool not_null = op->not_null();
2927 bool no_conflict = op->no_conflict();
2928
2929 Label Lupdate, Ldo_update, Ldone;
2930
2931 bool do_null = !not_null;
2932 bool exact_klass_set = exact_klass != nullptr && ciTypeEntries::valid_ciklass(current_klass) == exact_klass;
2933 bool do_update = !TypeEntries::is_type_unknown(current_klass) && !exact_klass_set;
2934
2935 assert(do_null || do_update, "why are we here?");
2936 assert(!TypeEntries::was_null_seen(current_klass) || do_update, "why are we here?");
2937
2938 __ verify_oop(obj, FILE_AND_LINE);
2939
2940 if (do_null) {
2941 if (!TypeEntries::was_null_seen(current_klass)) {
2942 __ cmpdi(CR0, obj, 0);
2943 __ bne(CR0, Lupdate);
2944 __ ld(R0, index_or_disp(mdo_addr), mdo_addr->base()->as_pointer_register());
2945 __ ori(R0, R0, TypeEntries::null_seen);
2946 if (do_update) {
2947 __ b(Ldo_update);
2948 } else {
2949 __ std(R0, index_or_disp(mdo_addr), mdo_addr->base()->as_pointer_register());
2950 }
2951 } else {
2952 if (do_update) {
2953 __ cmpdi(CR0, obj, 0);
2954 __ beq(CR0, Ldone);
2955 }
2956 }
2957 #ifdef ASSERT
2958 } else {
2959 __ cmpdi(CR0, obj, 0);
2960 __ bne(CR0, Lupdate);
2961 __ stop("unexpected null obj");
2962 #endif
2963 }
2964
2965 __ bind(Lupdate);
2966 if (do_update) {
2967 Label Lnext;
2968 const Register klass = R29_TOC; // kill and reload
2969 bool klass_reg_used = false;
2970 #ifdef ASSERT
2971 if (exact_klass != nullptr) {
2972 Label ok;
2973 klass_reg_used = true;
2974 __ load_klass(klass, obj);
2975 metadata2reg(exact_klass->constant_encoding(), R0);
2976 __ cmpd(CR0, klass, R0);
2977 __ beq(CR0, ok);
2978 __ stop("exact klass and actual klass differ");
2979 __ bind(ok);
2980 }
2981 #endif
2982
2983 if (!no_conflict) {
2984 if (exact_klass == nullptr || TypeEntries::is_type_none(current_klass)) {
2985 klass_reg_used = true;
2986 if (exact_klass != nullptr) {
2987 __ ld(tmp, index_or_disp(mdo_addr), mdo_addr->base()->as_pointer_register());
2988 metadata2reg(exact_klass->constant_encoding(), klass);
2989 } else {
2990 __ load_klass(klass, obj);
2991 __ ld(tmp, index_or_disp(mdo_addr), mdo_addr->base()->as_pointer_register()); // may kill obj
2992 }
2993
2994 // Like InterpreterMacroAssembler::profile_obj_type
2995 __ clrrdi(R0, tmp, exact_log2(-TypeEntries::type_klass_mask));
2996 // Basically same as andi(R0, tmp, TypeEntries::type_klass_mask);
2997 __ cmpd(CR1, R0, klass);
2998 // Klass seen before, nothing to do (regardless of unknown bit).
2999 //beq(CR1, do_nothing);
3000
3001 __ andi_(R0, tmp, TypeEntries::type_unknown);
3002 // Already unknown. Nothing to do anymore.
3003 //bne(CR0, do_nothing);
3004 __ crorc(CR0, Assembler::equal, CR1, Assembler::equal); // cr0 eq = cr1 eq or cr0 ne
3005 __ beq(CR0, Lnext);
3006
3007 if (TypeEntries::is_type_none(current_klass)) {
3008 __ clrrdi_(R0, tmp, exact_log2(-TypeEntries::type_mask));
3009 __ orr(R0, klass, tmp); // Combine klass and null_seen bit (only used if (tmp & type_mask)==0).
3010 __ beq(CR0, Ldo_update); // First time here. Set profile type.
3011 }
3012
3013 } else {
3014 assert(ciTypeEntries::valid_ciklass(current_klass) != nullptr &&
3015 ciTypeEntries::valid_ciklass(current_klass) != exact_klass, "conflict only");
3016
3017 __ ld(tmp, index_or_disp(mdo_addr), mdo_addr->base()->as_pointer_register());
3018 __ andi_(R0, tmp, TypeEntries::type_unknown);
3019 // Already unknown. Nothing to do anymore.
3020 __ bne(CR0, Lnext);
3021 }
3022
3023 // Different than before. Cannot keep accurate profile.
3024 __ ori(R0, tmp, TypeEntries::type_unknown);
3025 } else {
3026 // There's a single possible klass at this profile point
3027 assert(exact_klass != nullptr, "should be");
3028 __ ld(tmp, index_or_disp(mdo_addr), mdo_addr->base()->as_pointer_register());
3029
3030 if (TypeEntries::is_type_none(current_klass)) {
3031 klass_reg_used = true;
3032 metadata2reg(exact_klass->constant_encoding(), klass);
3033
3034 __ clrrdi(R0, tmp, exact_log2(-TypeEntries::type_klass_mask));
3035 // Basically same as andi(R0, tmp, TypeEntries::type_klass_mask);
3036 __ cmpd(CR1, R0, klass);
3037 // Klass seen before, nothing to do (regardless of unknown bit).
3038 __ beq(CR1, Lnext);
3039 #ifdef ASSERT
3040 {
3041 Label ok;
3042 __ clrrdi_(R0, tmp, exact_log2(-TypeEntries::type_mask));
3043 __ beq(CR0, ok); // First time here.
3044
3045 __ stop("unexpected profiling mismatch");
3046 __ bind(ok);
3047 }
3048 #endif
3049 // First time here. Set profile type.
3050 __ orr(R0, klass, tmp); // Combine klass and null_seen bit (only used if (tmp & type_mask)==0).
3051 } else {
3052 assert(ciTypeEntries::valid_ciklass(current_klass) != nullptr &&
3053 ciTypeEntries::valid_ciklass(current_klass) != exact_klass, "inconsistent");
3054
3055 // Already unknown. Nothing to do anymore.
3056 __ andi_(R0, tmp, TypeEntries::type_unknown);
3057 __ bne(CR0, Lnext);
3058
3059 // Different than before. Cannot keep accurate profile.
3060 __ ori(R0, tmp, TypeEntries::type_unknown);
3061 }
3062 }
3063
3064 __ bind(Ldo_update);
3065 __ std(R0, index_or_disp(mdo_addr), mdo_addr->base()->as_pointer_register());
3066
3067 __ bind(Lnext);
3068 if (klass_reg_used) { __ load_const_optimized(R29_TOC, MacroAssembler::global_toc(), R0); } // reinit
3069 }
3070 __ bind(Ldone);
3071 }
3072
3073 void LIR_Assembler::emit_profile_inline_type(LIR_OpProfileInlineType* op) {
3074 Register obj = op->obj()->as_register();
3075 //Register tmp = op->tmp()->as_pointer_register(); not needed!
3076 LIR_Address* mdo_addr = op->mdp()->as_address_ptr();
3077 assert(!mdo_addr->index()->is_valid(), "index unsupported");
3078 Register mdo_base = mdo_addr->base()->as_pointer_register();
3079 int mdo_offs = mdo_addr->disp();
3080 bool not_null = op->not_null();
3081 int flag = op->flag();
3082
3083 Label not_inline_type;
3084 __ test_oop_is_not_inline_type(obj, not_inline_type, !not_null);
3085
3086 __ lbz(R0, mdo_offs, mdo_base);
3087 __ ori(R0, R0, flag);
3088 __ stb(R0, mdo_offs, mdo_base);
3089
3090 __ bind(not_inline_type);
3091 }
3092
3093 void LIR_Assembler::emit_updatecrc32(LIR_OpUpdateCRC32* op) {
3094 assert(op->crc()->is_single_cpu(), "crc must be register");
3095 assert(op->val()->is_single_cpu(), "byte value must be register");
3096 assert(op->result_opr()->is_single_cpu(), "result must be register");
3097 Register crc = op->crc()->as_register();
3098 Register val = op->val()->as_register();
3099 Register res = op->result_opr()->as_register();
3100
3101 assert_different_registers(val, crc, res);
3102
3103 __ load_const_optimized(res, StubRoutines::crc_table_addr(), R0);
3104 __ kernel_crc32_singleByteReg(crc, val, res, true);
3105 __ mr(res, crc);
3106 }
3107
3108 // Valhalla support
3109
3110 void LIR_Assembler::check_orig_pc() {
3111 Address address_for_orig_pc_addr = frame_map()->address_for_orig_pc_addr();
3112 __ ld(R0, address_for_orig_pc_addr);
3113 __ cmpdi(BOOL_RESULT, R0, (u1)NULL_WORD);
3114 }
3115
3116 int LIR_Assembler::store_inline_type_fields_to_buf(ciInlineKlass* vk) {
3117 return (__ store_inline_type_fields_to_buf(vk, false));
3118 }
3119
3120 void LIR_Assembler::emit_opFlattenedArrayCheck(LIR_OpFlattenedArrayCheck* op) {
3121 // We are loading/storing from/to an array that *may* be a flat array (the
3122 // declared type is Object[], abstract[], interface[] or VT.ref[]).
3123 // If this array is a flat array, take the slow path.
3124 __ test_flat_array_oop(op->array()->as_register(), op->tmp()->as_register(), *op->stub()->entry(), true);
3125 }
3126
3127 void LIR_Assembler::emit_opNullFreeArrayCheck(LIR_OpNullFreeArrayCheck* op) {
3128 // We are storing into an array that *may* be null-free (the declared type is
3129 // Object[], abstract[], interface[] or VT.ref[]).
3130 Label test_mark_word;
3131 Register tmp = op->tmp()->as_register();
3132 __ ld(tmp, oopDesc::mark_offset_in_bytes(), op->array()->as_register());
3133 __ andi_(R0, tmp, markWord::unlocked_value);
3134 __ bne(CR0, test_mark_word);
3135 __ load_prototype_header(tmp, op->array()->as_register());
3136 __ bind(test_mark_word);
3137 __ andi(R0, tmp, markWord::null_free_array_bit_in_place);
3138 __ cmpwi(BOOL_RESULT, R0, 0);
3139 }
3140
3141 void LIR_Assembler::emit_opSubstitutabilityCheck(LIR_OpSubstitutabilityCheck* op) {
3142 Label L_oops_equal;
3143 Label L_oops_not_equal;
3144 Label L_end;
3145
3146 Register left = op->left()->as_register();
3147 Register right = op->right()->as_register();
3148
3149 __ cmpd(CR0, left, right);
3150 __ beq(CR0, L_oops_equal);
3151
3152 // (1) Null check -- if one of the operands is null, the other must not be null (because
3153 // the two references are not equal), so they are not substitutable,
3154 __ cmpdi(CR0, left, 0);
3155 __ cmpdi(CR1, right, 0);
3156 __ cror(CR0, Assembler::equal, CR1, Assembler::equal);
3157 __ beq(CR0, L_oops_not_equal);
3158
3159 ciKlass* left_klass = op->left_klass();
3160 ciKlass* right_klass = op->right_klass();
3161
3162 // (2) Inline type check -- if either of the operands is not an inline type,
3163 // they are not substitutable. We do this only if we are not sure that the
3164 // operands are inline type
3165 if ((left_klass == nullptr || right_klass == nullptr) ||// The klass is still unloaded, or came from a Phi node.
3166 !left_klass->is_inlinetype() || !right_klass->is_inlinetype()) {
3167 Register tmp = op->tmp1()->as_register();
3168 __ ld(tmp, oopDesc::mark_offset_in_bytes(), left);
3169 __ ld(R0, oopDesc::mark_offset_in_bytes(), right);
3170 __ andi(tmp, tmp, (intptr_t)markWord::inline_type_pattern);
3171 __ andr(tmp, tmp, R0);
3172 __ cmpdi(CR0, tmp, (intptr_t)markWord::inline_type_pattern);
3173 __ bne(CR0, L_oops_not_equal);
3174 }
3175
3176 // (3) Same klass check: if the operands are of different klasses, they are not substitutable.
3177 if (left_klass != nullptr && left_klass->is_inlinetype() && left_klass == right_klass) {
3178 // No need to load klass -- the operands are statically known to be the same inline klass.
3179 __ b(*op->stub()->entry());
3180 } else {
3181 Register tmp1 = op->tmp1()->as_register();
3182 Register tmp2 = op->tmp2()->as_register();
3183 if (left == right) { // same operand, so clearly the same klasses, let's save the check
3184 __ b(*op->stub()->entry()); // -> do slow check
3185 } else {
3186 __ cmp_klasses_from_objects(CR0, left, right, tmp1, tmp2);
3187 __ bc_far_optimized(Assembler::bcondCRbiIs1, __ bi0(CR0, Assembler::equal),
3188 *op->stub()->entry()); // same klass -> do slow check
3189 }
3190 // fall through to L_oops_not_equal
3191 }
3192
3193 __ bind(L_oops_not_equal);
3194 load_to_reg(this, op->not_equal_result(), op->result_opr());
3195 __ b(L_end);
3196
3197 // We've returned from the stub. R3_RET (stub's _scratch_reg) contains 0x0 IFF the two
3198 // operands are not substitutable. (Don't compare against 0x1 in case the
3199 // C compiler is naughty)
3200 __ bind(*op->stub()->continuation());
3201 __ cmpdi(CR0, R3_RET, 0);
3202 __ beq(CR0, L_oops_not_equal);
3203
3204 __ bind(L_oops_equal);
3205 load_to_reg(this, op->equal_result(), op->result_opr()); // (call_stub() != 0x0) -> equal
3206 // fall-through
3207 __ bind(L_end);
3208 }
3209 #undef __