1 /*
2 * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2014, 2015, Red Hat Inc. 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 <sys/types.h>
27
28 #include "precompiled.hpp"
29 #include "jvm.h"
30 #include "asm/assembler.hpp"
31 #include "asm/assembler.inline.hpp"
32 #include "gc/shared/barrierSet.hpp"
33 #include "gc/shared/cardTable.hpp"
34 #include "gc/shared/barrierSetAssembler.hpp"
35 #include "gc/shared/cardTableBarrierSet.hpp"
36 #include "interpreter/interpreter.hpp"
37 #include "compiler/disassembler.hpp"
38 #include "memory/resourceArea.hpp"
39 #include "nativeInst_aarch64.hpp"
40 #include "oops/accessDecorators.hpp"
41 #include "oops/compressedOops.inline.hpp"
42 #include "oops/klass.inline.hpp"
43 #include "oops/oop.hpp"
44 #include "opto/compile.hpp"
45 #include "opto/intrinsicnode.hpp"
46 #include "opto/node.hpp"
47 #include "runtime/biasedLocking.hpp"
48 #include "runtime/icache.hpp"
49 #include "runtime/interfaceSupport.inline.hpp"
50 #include "runtime/jniHandles.inline.hpp"
51 #include "runtime/sharedRuntime.hpp"
52 #include "runtime/thread.hpp"
53
54 #ifdef PRODUCT
55 #define BLOCK_COMMENT(str) /* nothing */
56 #define STOP(error) stop(error)
57 #else
58 #define BLOCK_COMMENT(str) block_comment(str)
59 #define STOP(error) block_comment(error); stop(error)
60 #endif
61
62 #define BIND(label) bind(label); BLOCK_COMMENT(#label ":")
63
64 // Patch any kind of instruction; there may be several instructions.
65 // Return the total length (in bytes) of the instructions.
66 int MacroAssembler::pd_patch_instruction_size(address branch, address target) {
67 int instructions = 1;
68 assert((uint64_t)target < (1ul << 48), "48-bit overflow in address constant");
69 long offset = (target - branch) >> 2;
70 unsigned insn = *(unsigned*)branch;
71 if ((Instruction_aarch64::extract(insn, 29, 24) & 0b111011) == 0b011000) {
72 // Load register (literal)
73 Instruction_aarch64::spatch(branch, 23, 5, offset);
74 } else if (Instruction_aarch64::extract(insn, 30, 26) == 0b00101) {
75 // Unconditional branch (immediate)
76 Instruction_aarch64::spatch(branch, 25, 0, offset);
77 } else if (Instruction_aarch64::extract(insn, 31, 25) == 0b0101010) {
78 // Conditional branch (immediate)
79 Instruction_aarch64::spatch(branch, 23, 5, offset);
80 } else if (Instruction_aarch64::extract(insn, 30, 25) == 0b011010) {
81 // Compare & branch (immediate)
82 Instruction_aarch64::spatch(branch, 23, 5, offset);
83 } else if (Instruction_aarch64::extract(insn, 30, 25) == 0b011011) {
84 // Test & branch (immediate)
85 Instruction_aarch64::spatch(branch, 18, 5, offset);
86 } else if (Instruction_aarch64::extract(insn, 28, 24) == 0b10000) {
87 // PC-rel. addressing
88 offset = target-branch;
89 int shift = Instruction_aarch64::extract(insn, 31, 31);
90 if (shift) {
91 u_int64_t dest = (u_int64_t)target;
92 uint64_t pc_page = (uint64_t)branch >> 12;
93 uint64_t adr_page = (uint64_t)target >> 12;
94 unsigned offset_lo = dest & 0xfff;
95 offset = adr_page - pc_page;
96
97 // We handle 4 types of PC relative addressing
98 // 1 - adrp Rx, target_page
99 // ldr/str Ry, [Rx, #offset_in_page]
100 // 2 - adrp Rx, target_page
101 // add Ry, Rx, #offset_in_page
102 // 3 - adrp Rx, target_page (page aligned reloc, offset == 0)
103 // movk Rx, #imm16<<32
104 // 4 - adrp Rx, target_page (page aligned reloc, offset == 0)
105 // In the first 3 cases we must check that Rx is the same in the adrp and the
106 // subsequent ldr/str, add or movk instruction. Otherwise we could accidentally end
107 // up treating a type 4 relocation as a type 1, 2 or 3 just because it happened
108 // to be followed by a random unrelated ldr/str, add or movk instruction.
109 //
110 unsigned insn2 = ((unsigned*)branch)[1];
111 if (Instruction_aarch64::extract(insn2, 29, 24) == 0b111001 &&
112 Instruction_aarch64::extract(insn, 4, 0) ==
113 Instruction_aarch64::extract(insn2, 9, 5)) {
114 // Load/store register (unsigned immediate)
115 unsigned size = Instruction_aarch64::extract(insn2, 31, 30);
116 Instruction_aarch64::patch(branch + sizeof (unsigned),
117 21, 10, offset_lo >> size);
118 guarantee(((dest >> size) << size) == dest, "misaligned target");
119 instructions = 2;
120 } else if (Instruction_aarch64::extract(insn2, 31, 22) == 0b1001000100 &&
121 Instruction_aarch64::extract(insn, 4, 0) ==
122 Instruction_aarch64::extract(insn2, 4, 0)) {
123 // add (immediate)
124 Instruction_aarch64::patch(branch + sizeof (unsigned),
125 21, 10, offset_lo);
126 instructions = 2;
127 } else if (Instruction_aarch64::extract(insn2, 31, 21) == 0b11110010110 &&
128 Instruction_aarch64::extract(insn, 4, 0) ==
129 Instruction_aarch64::extract(insn2, 4, 0)) {
130 // movk #imm16<<32
131 Instruction_aarch64::patch(branch + 4, 20, 5, (uint64_t)target >> 32);
132 long dest = ((long)target & 0xffffffffL) | ((long)branch & 0xffff00000000L);
133 long pc_page = (long)branch >> 12;
134 long adr_page = (long)dest >> 12;
135 offset = adr_page - pc_page;
136 instructions = 2;
137 }
138 }
139 int offset_lo = offset & 3;
140 offset >>= 2;
141 Instruction_aarch64::spatch(branch, 23, 5, offset);
142 Instruction_aarch64::patch(branch, 30, 29, offset_lo);
143 } else if (Instruction_aarch64::extract(insn, 31, 21) == 0b11010010100) {
144 u_int64_t dest = (u_int64_t)target;
145 // Move wide constant
146 assert(nativeInstruction_at(branch+4)->is_movk(), "wrong insns in patch");
147 assert(nativeInstruction_at(branch+8)->is_movk(), "wrong insns in patch");
148 Instruction_aarch64::patch(branch, 20, 5, dest & 0xffff);
149 Instruction_aarch64::patch(branch+4, 20, 5, (dest >>= 16) & 0xffff);
150 Instruction_aarch64::patch(branch+8, 20, 5, (dest >>= 16) & 0xffff);
151 assert(target_addr_for_insn(branch) == target, "should be");
152 instructions = 3;
153 } else if (Instruction_aarch64::extract(insn, 31, 22) == 0b1011100101 &&
154 Instruction_aarch64::extract(insn, 4, 0) == 0b11111) {
155 // nothing to do
156 assert(target == 0, "did not expect to relocate target for polling page load");
157 } else {
158 ShouldNotReachHere();
159 }
160 return instructions * NativeInstruction::instruction_size;
161 }
162
163 int MacroAssembler::patch_oop(address insn_addr, address o) {
164 int instructions;
165 unsigned insn = *(unsigned*)insn_addr;
166 assert(nativeInstruction_at(insn_addr+4)->is_movk(), "wrong insns in patch");
167
168 // OOPs are either narrow (32 bits) or wide (48 bits). We encode
169 // narrow OOPs by setting the upper 16 bits in the first
170 // instruction.
171 if (Instruction_aarch64::extract(insn, 31, 21) == 0b11010010101) {
172 // Move narrow OOP
173 narrowOop n = CompressedOops::encode((oop)o);
174 Instruction_aarch64::patch(insn_addr, 20, 5, n >> 16);
175 Instruction_aarch64::patch(insn_addr+4, 20, 5, n & 0xffff);
176 instructions = 2;
177 } else {
178 // Move wide OOP
179 assert(nativeInstruction_at(insn_addr+8)->is_movk(), "wrong insns in patch");
180 uintptr_t dest = (uintptr_t)o;
181 Instruction_aarch64::patch(insn_addr, 20, 5, dest & 0xffff);
182 Instruction_aarch64::patch(insn_addr+4, 20, 5, (dest >>= 16) & 0xffff);
183 Instruction_aarch64::patch(insn_addr+8, 20, 5, (dest >>= 16) & 0xffff);
184 instructions = 3;
185 }
186 return instructions * NativeInstruction::instruction_size;
187 }
188
189 int MacroAssembler::patch_narrow_klass(address insn_addr, narrowKlass n) {
190 // Metatdata pointers are either narrow (32 bits) or wide (48 bits).
191 // We encode narrow ones by setting the upper 16 bits in the first
192 // instruction.
193 NativeInstruction *insn = nativeInstruction_at(insn_addr);
194 assert(Instruction_aarch64::extract(insn->encoding(), 31, 21) == 0b11010010101 &&
195 nativeInstruction_at(insn_addr+4)->is_movk(), "wrong insns in patch");
196
197 Instruction_aarch64::patch(insn_addr, 20, 5, n >> 16);
198 Instruction_aarch64::patch(insn_addr+4, 20, 5, n & 0xffff);
199 return 2 * NativeInstruction::instruction_size;
200 }
201
202 address MacroAssembler::target_addr_for_insn(address insn_addr, unsigned insn) {
203 long offset = 0;
204 if ((Instruction_aarch64::extract(insn, 29, 24) & 0b011011) == 0b00011000) {
205 // Load register (literal)
206 offset = Instruction_aarch64::sextract(insn, 23, 5);
207 return address(((uint64_t)insn_addr + (offset << 2)));
208 } else if (Instruction_aarch64::extract(insn, 30, 26) == 0b00101) {
209 // Unconditional branch (immediate)
210 offset = Instruction_aarch64::sextract(insn, 25, 0);
211 } else if (Instruction_aarch64::extract(insn, 31, 25) == 0b0101010) {
212 // Conditional branch (immediate)
213 offset = Instruction_aarch64::sextract(insn, 23, 5);
214 } else if (Instruction_aarch64::extract(insn, 30, 25) == 0b011010) {
215 // Compare & branch (immediate)
216 offset = Instruction_aarch64::sextract(insn, 23, 5);
217 } else if (Instruction_aarch64::extract(insn, 30, 25) == 0b011011) {
218 // Test & branch (immediate)
219 offset = Instruction_aarch64::sextract(insn, 18, 5);
220 } else if (Instruction_aarch64::extract(insn, 28, 24) == 0b10000) {
221 // PC-rel. addressing
222 offset = Instruction_aarch64::extract(insn, 30, 29);
223 offset |= Instruction_aarch64::sextract(insn, 23, 5) << 2;
224 int shift = Instruction_aarch64::extract(insn, 31, 31) ? 12 : 0;
225 if (shift) {
226 offset <<= shift;
227 uint64_t target_page = ((uint64_t)insn_addr) + offset;
228 target_page &= ((uint64_t)-1) << shift;
229 // Return the target address for the following sequences
230 // 1 - adrp Rx, target_page
231 // ldr/str Ry, [Rx, #offset_in_page]
232 // 2 - adrp Rx, target_page
233 // add Ry, Rx, #offset_in_page
234 // 3 - adrp Rx, target_page (page aligned reloc, offset == 0)
235 // movk Rx, #imm12<<32
236 // 4 - adrp Rx, target_page (page aligned reloc, offset == 0)
237 //
238 // In the first two cases we check that the register is the same and
239 // return the target_page + the offset within the page.
240 // Otherwise we assume it is a page aligned relocation and return
241 // the target page only.
242 //
243 unsigned insn2 = ((unsigned*)insn_addr)[1];
244 if (Instruction_aarch64::extract(insn2, 29, 24) == 0b111001 &&
245 Instruction_aarch64::extract(insn, 4, 0) ==
246 Instruction_aarch64::extract(insn2, 9, 5)) {
247 // Load/store register (unsigned immediate)
248 unsigned int byte_offset = Instruction_aarch64::extract(insn2, 21, 10);
249 unsigned int size = Instruction_aarch64::extract(insn2, 31, 30);
250 return address(target_page + (byte_offset << size));
251 } else if (Instruction_aarch64::extract(insn2, 31, 22) == 0b1001000100 &&
252 Instruction_aarch64::extract(insn, 4, 0) ==
253 Instruction_aarch64::extract(insn2, 4, 0)) {
254 // add (immediate)
255 unsigned int byte_offset = Instruction_aarch64::extract(insn2, 21, 10);
256 return address(target_page + byte_offset);
257 } else {
258 if (Instruction_aarch64::extract(insn2, 31, 21) == 0b11110010110 &&
259 Instruction_aarch64::extract(insn, 4, 0) ==
260 Instruction_aarch64::extract(insn2, 4, 0)) {
261 target_page = (target_page & 0xffffffff) |
262 ((uint64_t)Instruction_aarch64::extract(insn2, 20, 5) << 32);
263 }
264 return (address)target_page;
265 }
266 } else {
267 ShouldNotReachHere();
268 }
269 } else if (Instruction_aarch64::extract(insn, 31, 23) == 0b110100101) {
270 u_int32_t *insns = (u_int32_t *)insn_addr;
271 // Move wide constant: movz, movk, movk. See movptr().
272 assert(nativeInstruction_at(insns+1)->is_movk(), "wrong insns in patch");
273 assert(nativeInstruction_at(insns+2)->is_movk(), "wrong insns in patch");
274 return address(u_int64_t(Instruction_aarch64::extract(insns[0], 20, 5))
275 + (u_int64_t(Instruction_aarch64::extract(insns[1], 20, 5)) << 16)
276 + (u_int64_t(Instruction_aarch64::extract(insns[2], 20, 5)) << 32));
277 } else if (Instruction_aarch64::extract(insn, 31, 22) == 0b1011100101 &&
278 Instruction_aarch64::extract(insn, 4, 0) == 0b11111) {
279 return 0;
280 } else {
281 ShouldNotReachHere();
282 }
283 return address(((uint64_t)insn_addr + (offset << 2)));
284 }
285
286 void MacroAssembler::serialize_memory(Register thread, Register tmp) {
287 dsb(Assembler::SY);
288 }
289
290 void MacroAssembler::safepoint_poll(Label& slow_path) {
291 if (SafepointMechanism::uses_thread_local_poll()) {
292 ldr(rscratch1, Address(rthread, Thread::polling_page_offset()));
293 tbnz(rscratch1, exact_log2(SafepointMechanism::poll_bit()), slow_path);
294 } else {
295 unsigned long offset;
296 adrp(rscratch1, ExternalAddress(SafepointSynchronize::address_of_state()), offset);
297 ldrw(rscratch1, Address(rscratch1, offset));
298 assert(SafepointSynchronize::_not_synchronized == 0, "rewrite this code");
299 cbnz(rscratch1, slow_path);
300 }
301 }
302
303 // Just like safepoint_poll, but use an acquiring load for thread-
304 // local polling.
305 //
306 // We need an acquire here to ensure that any subsequent load of the
307 // global SafepointSynchronize::_state flag is ordered after this load
308 // of the local Thread::_polling page. We don't want this poll to
309 // return false (i.e. not safepointing) and a later poll of the global
310 // SafepointSynchronize::_state spuriously to return true.
311 //
312 // This is to avoid a race when we're in a native->Java transition
313 // racing the code which wakes up from a safepoint.
314 //
315 void MacroAssembler::safepoint_poll_acquire(Label& slow_path) {
316 if (SafepointMechanism::uses_thread_local_poll()) {
317 lea(rscratch1, Address(rthread, Thread::polling_page_offset()));
318 ldar(rscratch1, rscratch1);
319 tbnz(rscratch1, exact_log2(SafepointMechanism::poll_bit()), slow_path);
320 } else {
321 safepoint_poll(slow_path);
322 }
323 }
324
325 void MacroAssembler::reset_last_Java_frame(bool clear_fp) {
326 // we must set sp to zero to clear frame
327 str(zr, Address(rthread, JavaThread::last_Java_sp_offset()));
328
329 // must clear fp, so that compiled frames are not confused; it is
330 // possible that we need it only for debugging
331 if (clear_fp) {
332 str(zr, Address(rthread, JavaThread::last_Java_fp_offset()));
333 }
334
335 // Always clear the pc because it could have been set by make_walkable()
336 str(zr, Address(rthread, JavaThread::last_Java_pc_offset()));
337 }
338
339 // Calls to C land
340 //
341 // When entering C land, the rfp, & resp of the last Java frame have to be recorded
342 // in the (thread-local) JavaThread object. When leaving C land, the last Java fp
343 // has to be reset to 0. This is required to allow proper stack traversal.
344 void MacroAssembler::set_last_Java_frame(Register last_java_sp,
345 Register last_java_fp,
346 Register last_java_pc,
347 Register scratch) {
348
349 if (last_java_pc->is_valid()) {
350 str(last_java_pc, Address(rthread,
351 JavaThread::frame_anchor_offset()
352 + JavaFrameAnchor::last_Java_pc_offset()));
353 }
354
355 // determine last_java_sp register
356 if (last_java_sp == sp) {
357 mov(scratch, sp);
358 last_java_sp = scratch;
359 } else if (!last_java_sp->is_valid()) {
360 last_java_sp = esp;
361 }
362
363 str(last_java_sp, Address(rthread, JavaThread::last_Java_sp_offset()));
364
365 // last_java_fp is optional
366 if (last_java_fp->is_valid()) {
367 str(last_java_fp, Address(rthread, JavaThread::last_Java_fp_offset()));
368 }
369 }
370
371 void MacroAssembler::set_last_Java_frame(Register last_java_sp,
372 Register last_java_fp,
373 address last_java_pc,
374 Register scratch) {
375 if (last_java_pc != NULL) {
376 adr(scratch, last_java_pc);
377 } else {
378 // FIXME: This is almost never correct. We should delete all
379 // cases of set_last_Java_frame with last_java_pc=NULL and use the
380 // correct return address instead.
381 adr(scratch, pc());
382 }
383
384 str(scratch, Address(rthread,
385 JavaThread::frame_anchor_offset()
386 + JavaFrameAnchor::last_Java_pc_offset()));
387
388 set_last_Java_frame(last_java_sp, last_java_fp, noreg, scratch);
389 }
390
391 void MacroAssembler::set_last_Java_frame(Register last_java_sp,
392 Register last_java_fp,
393 Label &L,
394 Register scratch) {
395 if (L.is_bound()) {
396 set_last_Java_frame(last_java_sp, last_java_fp, target(L), scratch);
397 } else {
398 InstructionMark im(this);
399 L.add_patch_at(code(), locator());
400 set_last_Java_frame(last_java_sp, last_java_fp, (address)NULL, scratch);
401 }
402 }
403
404 void MacroAssembler::far_call(Address entry, CodeBuffer *cbuf, Register tmp) {
405 assert(ReservedCodeCacheSize < 4*G, "branch out of range");
406 assert(CodeCache::find_blob(entry.target()) != NULL,
407 "destination of far call not found in code cache");
408 if (far_branches()) {
409 unsigned long offset;
410 // We can use ADRP here because we know that the total size of
411 // the code cache cannot exceed 2Gb.
412 adrp(tmp, entry, offset);
413 add(tmp, tmp, offset);
414 if (cbuf) cbuf->set_insts_mark();
415 blr(tmp);
416 } else {
417 if (cbuf) cbuf->set_insts_mark();
418 bl(entry);
419 }
420 }
421
422 void MacroAssembler::far_jump(Address entry, CodeBuffer *cbuf, Register tmp) {
423 assert(ReservedCodeCacheSize < 4*G, "branch out of range");
424 assert(CodeCache::find_blob(entry.target()) != NULL,
425 "destination of far call not found in code cache");
426 if (far_branches()) {
427 unsigned long offset;
428 // We can use ADRP here because we know that the total size of
429 // the code cache cannot exceed 2Gb.
430 adrp(tmp, entry, offset);
431 add(tmp, tmp, offset);
432 if (cbuf) cbuf->set_insts_mark();
433 br(tmp);
434 } else {
435 if (cbuf) cbuf->set_insts_mark();
436 b(entry);
437 }
438 }
439
440 void MacroAssembler::reserved_stack_check() {
441 // testing if reserved zone needs to be enabled
442 Label no_reserved_zone_enabling;
443
444 ldr(rscratch1, Address(rthread, JavaThread::reserved_stack_activation_offset()));
445 cmp(sp, rscratch1);
446 br(Assembler::LO, no_reserved_zone_enabling);
447
448 enter(); // LR and FP are live.
449 lea(rscratch1, CAST_FROM_FN_PTR(address, SharedRuntime::enable_stack_reserved_zone));
450 mov(c_rarg0, rthread);
451 blr(rscratch1);
452 leave();
453
454 // We have already removed our own frame.
455 // throw_delayed_StackOverflowError will think that it's been
456 // called by our caller.
457 lea(rscratch1, RuntimeAddress(StubRoutines::throw_delayed_StackOverflowError_entry()));
458 br(rscratch1);
459 should_not_reach_here();
460
461 bind(no_reserved_zone_enabling);
462 }
463
464 int MacroAssembler::biased_locking_enter(Register lock_reg,
465 Register obj_reg,
466 Register swap_reg,
467 Register tmp_reg,
468 bool swap_reg_contains_mark,
469 Label& done,
470 Label* slow_case,
471 BiasedLockingCounters* counters) {
472 assert(UseBiasedLocking, "why call this otherwise?");
473 assert_different_registers(lock_reg, obj_reg, swap_reg);
474
475 if (PrintBiasedLockingStatistics && counters == NULL)
476 counters = BiasedLocking::counters();
477
478 assert_different_registers(lock_reg, obj_reg, swap_reg, tmp_reg, rscratch1, rscratch2, noreg);
479 assert(markOopDesc::age_shift == markOopDesc::lock_bits + markOopDesc::biased_lock_bits, "biased locking makes assumptions about bit layout");
480 Address mark_addr (obj_reg, oopDesc::mark_offset_in_bytes());
481 Address klass_addr (obj_reg, oopDesc::klass_offset_in_bytes());
482 Address saved_mark_addr(lock_reg, 0);
483
484 // Biased locking
485 // See whether the lock is currently biased toward our thread and
486 // whether the epoch is still valid
487 // Note that the runtime guarantees sufficient alignment of JavaThread
488 // pointers to allow age to be placed into low bits
489 // First check to see whether biasing is even enabled for this object
490 Label cas_label;
491 int null_check_offset = -1;
492 if (!swap_reg_contains_mark) {
493 null_check_offset = offset();
494 ldr(swap_reg, mark_addr);
495 }
496 andr(tmp_reg, swap_reg, markOopDesc::biased_lock_mask_in_place);
497 cmp(tmp_reg, markOopDesc::biased_lock_pattern);
498 br(Assembler::NE, cas_label);
499 // The bias pattern is present in the object's header. Need to check
500 // whether the bias owner and the epoch are both still current.
501 load_prototype_header(tmp_reg, obj_reg);
502 orr(tmp_reg, tmp_reg, rthread);
503 eor(tmp_reg, swap_reg, tmp_reg);
504 andr(tmp_reg, tmp_reg, ~((int) markOopDesc::age_mask_in_place));
505 if (counters != NULL) {
506 Label around;
507 cbnz(tmp_reg, around);
508 atomic_incw(Address((address)counters->biased_lock_entry_count_addr()), tmp_reg, rscratch1, rscratch2);
509 b(done);
510 bind(around);
511 } else {
512 cbz(tmp_reg, done);
513 }
514
515 Label try_revoke_bias;
516 Label try_rebias;
517
518 // At this point we know that the header has the bias pattern and
519 // that we are not the bias owner in the current epoch. We need to
520 // figure out more details about the state of the header in order to
521 // know what operations can be legally performed on the object's
522 // header.
523
524 // If the low three bits in the xor result aren't clear, that means
525 // the prototype header is no longer biased and we have to revoke
526 // the bias on this object.
527 andr(rscratch1, tmp_reg, markOopDesc::biased_lock_mask_in_place);
528 cbnz(rscratch1, try_revoke_bias);
529
530 // Biasing is still enabled for this data type. See whether the
531 // epoch of the current bias is still valid, meaning that the epoch
532 // bits of the mark word are equal to the epoch bits of the
533 // prototype header. (Note that the prototype header's epoch bits
534 // only change at a safepoint.) If not, attempt to rebias the object
535 // toward the current thread. Note that we must be absolutely sure
536 // that the current epoch is invalid in order to do this because
537 // otherwise the manipulations it performs on the mark word are
538 // illegal.
539 andr(rscratch1, tmp_reg, markOopDesc::epoch_mask_in_place);
540 cbnz(rscratch1, try_rebias);
541
542 // The epoch of the current bias is still valid but we know nothing
543 // about the owner; it might be set or it might be clear. Try to
544 // acquire the bias of the object using an atomic operation. If this
545 // fails we will go in to the runtime to revoke the object's bias.
546 // Note that we first construct the presumed unbiased header so we
547 // don't accidentally blow away another thread's valid bias.
548 {
549 Label here;
550 mov(rscratch1, markOopDesc::biased_lock_mask_in_place | markOopDesc::age_mask_in_place | markOopDesc::epoch_mask_in_place);
551 andr(swap_reg, swap_reg, rscratch1);
552 orr(tmp_reg, swap_reg, rthread);
553 cmpxchg_obj_header(swap_reg, tmp_reg, obj_reg, rscratch1, here, slow_case);
554 // If the biasing toward our thread failed, this means that
555 // another thread succeeded in biasing it toward itself and we
556 // need to revoke that bias. The revocation will occur in the
557 // interpreter runtime in the slow case.
558 bind(here);
559 if (counters != NULL) {
560 atomic_incw(Address((address)counters->anonymously_biased_lock_entry_count_addr()),
561 tmp_reg, rscratch1, rscratch2);
562 }
563 }
564 b(done);
565
566 bind(try_rebias);
567 // At this point we know the epoch has expired, meaning that the
568 // current "bias owner", if any, is actually invalid. Under these
569 // circumstances _only_, we are allowed to use the current header's
570 // value as the comparison value when doing the cas to acquire the
571 // bias in the current epoch. In other words, we allow transfer of
572 // the bias from one thread to another directly in this situation.
573 //
574 // FIXME: due to a lack of registers we currently blow away the age
575 // bits in this situation. Should attempt to preserve them.
576 {
577 Label here;
578 load_prototype_header(tmp_reg, obj_reg);
579 orr(tmp_reg, rthread, tmp_reg);
580 cmpxchg_obj_header(swap_reg, tmp_reg, obj_reg, rscratch1, here, slow_case);
581 // If the biasing toward our thread failed, then another thread
582 // succeeded in biasing it toward itself and we need to revoke that
583 // bias. The revocation will occur in the runtime in the slow case.
584 bind(here);
585 if (counters != NULL) {
586 atomic_incw(Address((address)counters->rebiased_lock_entry_count_addr()),
587 tmp_reg, rscratch1, rscratch2);
588 }
589 }
590 b(done);
591
592 bind(try_revoke_bias);
593 // The prototype mark in the klass doesn't have the bias bit set any
594 // more, indicating that objects of this data type are not supposed
595 // to be biased any more. We are going to try to reset the mark of
596 // this object to the prototype value and fall through to the
597 // CAS-based locking scheme. Note that if our CAS fails, it means
598 // that another thread raced us for the privilege of revoking the
599 // bias of this particular object, so it's okay to continue in the
600 // normal locking code.
601 //
602 // FIXME: due to a lack of registers we currently blow away the age
603 // bits in this situation. Should attempt to preserve them.
604 {
605 Label here, nope;
606 load_prototype_header(tmp_reg, obj_reg);
607 cmpxchg_obj_header(swap_reg, tmp_reg, obj_reg, rscratch1, here, &nope);
608 bind(here);
609
610 // Fall through to the normal CAS-based lock, because no matter what
611 // the result of the above CAS, some thread must have succeeded in
612 // removing the bias bit from the object's header.
613 if (counters != NULL) {
614 atomic_incw(Address((address)counters->revoked_lock_entry_count_addr()), tmp_reg,
615 rscratch1, rscratch2);
616 }
617 bind(nope);
618 }
619
620 bind(cas_label);
621
622 return null_check_offset;
623 }
624
625 void MacroAssembler::biased_locking_exit(Register obj_reg, Register temp_reg, Label& done) {
626 assert(UseBiasedLocking, "why call this otherwise?");
627
628 // Check for biased locking unlock case, which is a no-op
629 // Note: we do not have to check the thread ID for two reasons.
630 // First, the interpreter checks for IllegalMonitorStateException at
631 // a higher level. Second, if the bias was revoked while we held the
632 // lock, the object could not be rebiased toward another thread, so
633 // the bias bit would be clear.
634 ldr(temp_reg, Address(obj_reg, oopDesc::mark_offset_in_bytes()));
635 andr(temp_reg, temp_reg, markOopDesc::biased_lock_mask_in_place);
636 cmp(temp_reg, markOopDesc::biased_lock_pattern);
637 br(Assembler::EQ, done);
638 }
639
640 static void pass_arg0(MacroAssembler* masm, Register arg) {
641 if (c_rarg0 != arg ) {
642 masm->mov(c_rarg0, arg);
643 }
644 }
645
646 static void pass_arg1(MacroAssembler* masm, Register arg) {
647 if (c_rarg1 != arg ) {
648 masm->mov(c_rarg1, arg);
649 }
650 }
651
652 static void pass_arg2(MacroAssembler* masm, Register arg) {
653 if (c_rarg2 != arg ) {
654 masm->mov(c_rarg2, arg);
655 }
656 }
657
658 static void pass_arg3(MacroAssembler* masm, Register arg) {
659 if (c_rarg3 != arg ) {
660 masm->mov(c_rarg3, arg);
661 }
662 }
663
664 void MacroAssembler::call_VM_base(Register oop_result,
665 Register java_thread,
666 Register last_java_sp,
667 address entry_point,
668 int number_of_arguments,
669 bool check_exceptions) {
670 // determine java_thread register
671 if (!java_thread->is_valid()) {
672 java_thread = rthread;
673 }
674
675 // determine last_java_sp register
676 if (!last_java_sp->is_valid()) {
677 last_java_sp = esp;
678 }
679
680 // debugging support
681 assert(number_of_arguments >= 0 , "cannot have negative number of arguments");
682 assert(java_thread == rthread, "unexpected register");
683 #ifdef ASSERT
684 // TraceBytecodes does not use r12 but saves it over the call, so don't verify
685 // if ((UseCompressedOops || UseCompressedClassPointers) && !TraceBytecodes) verify_heapbase("call_VM_base: heap base corrupted?");
686 #endif // ASSERT
687
688 assert(java_thread != oop_result , "cannot use the same register for java_thread & oop_result");
689 assert(java_thread != last_java_sp, "cannot use the same register for java_thread & last_java_sp");
690
691 // push java thread (becomes first argument of C function)
692
693 mov(c_rarg0, java_thread);
694
695 // set last Java frame before call
696 assert(last_java_sp != rfp, "can't use rfp");
697
698 Label l;
699 set_last_Java_frame(last_java_sp, rfp, l, rscratch1);
700
701 // do the call, remove parameters
702 MacroAssembler::call_VM_leaf_base(entry_point, number_of_arguments, &l);
703
704 // reset last Java frame
705 // Only interpreter should have to clear fp
706 reset_last_Java_frame(true);
707
708 // C++ interp handles this in the interpreter
709 check_and_handle_popframe(java_thread);
710 check_and_handle_earlyret(java_thread);
711
712 if (check_exceptions) {
713 // check for pending exceptions (java_thread is set upon return)
714 ldr(rscratch1, Address(java_thread, in_bytes(Thread::pending_exception_offset())));
715 Label ok;
716 cbz(rscratch1, ok);
717 lea(rscratch1, RuntimeAddress(StubRoutines::forward_exception_entry()));
718 br(rscratch1);
719 bind(ok);
720 }
721
722 // get oop result if there is one and reset the value in the thread
723 if (oop_result->is_valid()) {
724 get_vm_result(oop_result, java_thread);
725 }
726 }
727
728 void MacroAssembler::call_VM_helper(Register oop_result, address entry_point, int number_of_arguments, bool check_exceptions) {
729 call_VM_base(oop_result, noreg, noreg, entry_point, number_of_arguments, check_exceptions);
730 }
731
732 // Maybe emit a call via a trampoline. If the code cache is small
733 // trampolines won't be emitted.
734
735 address MacroAssembler::trampoline_call(Address entry, CodeBuffer *cbuf) {
736 assert(JavaThread::current()->is_Compiler_thread(), "just checking");
737 assert(entry.rspec().type() == relocInfo::runtime_call_type
738 || entry.rspec().type() == relocInfo::opt_virtual_call_type
739 || entry.rspec().type() == relocInfo::static_call_type
740 || entry.rspec().type() == relocInfo::virtual_call_type, "wrong reloc type");
741
742 unsigned int start_offset = offset();
743 if (far_branches() && !Compile::current()->in_scratch_emit_size()) {
744 address stub = emit_trampoline_stub(start_offset, entry.target());
745 if (stub == NULL) {
746 return NULL; // CodeCache is full
747 }
748 }
749
750 if (cbuf) cbuf->set_insts_mark();
751 relocate(entry.rspec());
752 if (!far_branches()) {
753 bl(entry.target());
754 } else {
755 bl(pc());
756 }
757 // just need to return a non-null address
758 return pc();
759 }
760
761
762 // Emit a trampoline stub for a call to a target which is too far away.
763 //
764 // code sequences:
765 //
766 // call-site:
767 // branch-and-link to <destination> or <trampoline stub>
768 //
769 // Related trampoline stub for this call site in the stub section:
770 // load the call target from the constant pool
771 // branch (LR still points to the call site above)
772
773 address MacroAssembler::emit_trampoline_stub(int insts_call_instruction_offset,
774 address dest) {
775 address stub = start_a_stub(Compile::MAX_stubs_size/2);
776 if (stub == NULL) {
777 return NULL; // CodeBuffer::expand failed
778 }
779
780 // Create a trampoline stub relocation which relates this trampoline stub
781 // with the call instruction at insts_call_instruction_offset in the
782 // instructions code-section.
783 align(wordSize);
784 relocate(trampoline_stub_Relocation::spec(code()->insts()->start()
785 + insts_call_instruction_offset));
786 const int stub_start_offset = offset();
787
788 // Now, create the trampoline stub's code:
789 // - load the call
790 // - call
791 Label target;
792 ldr(rscratch1, target);
793 br(rscratch1);
794 bind(target);
795 assert(offset() - stub_start_offset == NativeCallTrampolineStub::data_offset,
796 "should be");
797 emit_int64((int64_t)dest);
798
799 const address stub_start_addr = addr_at(stub_start_offset);
800
801 assert(is_NativeCallTrampolineStub_at(stub_start_addr), "doesn't look like a trampoline");
802
803 end_a_stub();
804 return stub_start_addr;
805 }
806
807 address MacroAssembler::ic_call(address entry, jint method_index) {
808 RelocationHolder rh = virtual_call_Relocation::spec(pc(), method_index);
809 // address const_ptr = long_constant((jlong)Universe::non_oop_word());
810 // unsigned long offset;
811 // ldr_constant(rscratch2, const_ptr);
812 movptr(rscratch2, (uintptr_t)Universe::non_oop_word());
813 return trampoline_call(Address(entry, rh));
814 }
815
816 // Implementation of call_VM versions
817
818 void MacroAssembler::call_VM(Register oop_result,
819 address entry_point,
820 bool check_exceptions) {
821 call_VM_helper(oop_result, entry_point, 0, check_exceptions);
822 }
823
824 void MacroAssembler::call_VM(Register oop_result,
825 address entry_point,
826 Register arg_1,
827 bool check_exceptions) {
828 pass_arg1(this, arg_1);
829 call_VM_helper(oop_result, entry_point, 1, check_exceptions);
830 }
831
832 void MacroAssembler::call_VM(Register oop_result,
833 address entry_point,
834 Register arg_1,
835 Register arg_2,
836 bool check_exceptions) {
837 assert(arg_1 != c_rarg2, "smashed arg");
838 pass_arg2(this, arg_2);
839 pass_arg1(this, arg_1);
840 call_VM_helper(oop_result, entry_point, 2, check_exceptions);
841 }
842
843 void MacroAssembler::call_VM(Register oop_result,
844 address entry_point,
845 Register arg_1,
846 Register arg_2,
847 Register arg_3,
848 bool check_exceptions) {
849 assert(arg_1 != c_rarg3, "smashed arg");
850 assert(arg_2 != c_rarg3, "smashed arg");
851 pass_arg3(this, arg_3);
852
853 assert(arg_1 != c_rarg2, "smashed arg");
854 pass_arg2(this, arg_2);
855
856 pass_arg1(this, arg_1);
857 call_VM_helper(oop_result, entry_point, 3, check_exceptions);
858 }
859
860 void MacroAssembler::call_VM(Register oop_result,
861 Register last_java_sp,
862 address entry_point,
863 int number_of_arguments,
864 bool check_exceptions) {
865 call_VM_base(oop_result, rthread, last_java_sp, entry_point, number_of_arguments, check_exceptions);
866 }
867
868 void MacroAssembler::call_VM(Register oop_result,
869 Register last_java_sp,
870 address entry_point,
871 Register arg_1,
872 bool check_exceptions) {
873 pass_arg1(this, arg_1);
874 call_VM(oop_result, last_java_sp, entry_point, 1, check_exceptions);
875 }
876
877 void MacroAssembler::call_VM(Register oop_result,
878 Register last_java_sp,
879 address entry_point,
880 Register arg_1,
881 Register arg_2,
882 bool check_exceptions) {
883
884 assert(arg_1 != c_rarg2, "smashed arg");
885 pass_arg2(this, arg_2);
886 pass_arg1(this, arg_1);
887 call_VM(oop_result, last_java_sp, entry_point, 2, check_exceptions);
888 }
889
890 void MacroAssembler::call_VM(Register oop_result,
891 Register last_java_sp,
892 address entry_point,
893 Register arg_1,
894 Register arg_2,
895 Register arg_3,
896 bool check_exceptions) {
897 assert(arg_1 != c_rarg3, "smashed arg");
898 assert(arg_2 != c_rarg3, "smashed arg");
899 pass_arg3(this, arg_3);
900 assert(arg_1 != c_rarg2, "smashed arg");
901 pass_arg2(this, arg_2);
902 pass_arg1(this, arg_1);
903 call_VM(oop_result, last_java_sp, entry_point, 3, check_exceptions);
904 }
905
906
907 void MacroAssembler::get_vm_result(Register oop_result, Register java_thread) {
908 ldr(oop_result, Address(java_thread, JavaThread::vm_result_offset()));
909 str(zr, Address(java_thread, JavaThread::vm_result_offset()));
910 verify_oop(oop_result, "broken oop in call_VM_base");
911 }
912
913 void MacroAssembler::get_vm_result_2(Register metadata_result, Register java_thread) {
914 ldr(metadata_result, Address(java_thread, JavaThread::vm_result_2_offset()));
915 str(zr, Address(java_thread, JavaThread::vm_result_2_offset()));
916 }
917
918 void MacroAssembler::align(int modulus) {
919 while (offset() % modulus != 0) nop();
920 }
921
922 // these are no-ops overridden by InterpreterMacroAssembler
923
924 void MacroAssembler::check_and_handle_earlyret(Register java_thread) { }
925
926 void MacroAssembler::check_and_handle_popframe(Register java_thread) { }
927
928
929 RegisterOrConstant MacroAssembler::delayed_value_impl(intptr_t* delayed_value_addr,
930 Register tmp,
931 int offset) {
932 intptr_t value = *delayed_value_addr;
933 if (value != 0)
934 return RegisterOrConstant(value + offset);
935
936 // load indirectly to solve generation ordering problem
937 ldr(tmp, ExternalAddress((address) delayed_value_addr));
938
939 if (offset != 0)
940 add(tmp, tmp, offset);
941
942 return RegisterOrConstant(tmp);
943 }
944
945
946 void MacroAssembler:: notify(int type) {
947 if (type == bytecode_start) {
948 // set_last_Java_frame(esp, rfp, (address)NULL);
949 Assembler:: notify(type);
950 // reset_last_Java_frame(true);
951 }
952 else
953 Assembler:: notify(type);
954 }
955
956 // Look up the method for a megamorphic invokeinterface call.
957 // The target method is determined by <intf_klass, itable_index>.
958 // The receiver klass is in recv_klass.
959 // On success, the result will be in method_result, and execution falls through.
960 // On failure, execution transfers to the given label.
961 void MacroAssembler::lookup_interface_method(Register recv_klass,
962 Register intf_klass,
963 RegisterOrConstant itable_index,
964 Register method_result,
965 Register scan_temp,
966 Label& L_no_such_interface,
967 bool return_method) {
968 assert_different_registers(recv_klass, intf_klass, scan_temp);
969 assert_different_registers(method_result, intf_klass, scan_temp);
970 assert(recv_klass != method_result || !return_method,
971 "recv_klass can be destroyed when method isn't needed");
972 assert(itable_index.is_constant() || itable_index.as_register() == method_result,
973 "caller must use same register for non-constant itable index as for method");
974
975 // Compute start of first itableOffsetEntry (which is at the end of the vtable)
976 int vtable_base = in_bytes(Klass::vtable_start_offset());
977 int itentry_off = itableMethodEntry::method_offset_in_bytes();
978 int scan_step = itableOffsetEntry::size() * wordSize;
979 int vte_size = vtableEntry::size_in_bytes();
980 assert(vte_size == wordSize, "else adjust times_vte_scale");
981
982 ldrw(scan_temp, Address(recv_klass, Klass::vtable_length_offset()));
983
984 // %%% Could store the aligned, prescaled offset in the klassoop.
985 // lea(scan_temp, Address(recv_klass, scan_temp, times_vte_scale, vtable_base));
986 lea(scan_temp, Address(recv_klass, scan_temp, Address::lsl(3)));
987 add(scan_temp, scan_temp, vtable_base);
988
989 if (return_method) {
990 // Adjust recv_klass by scaled itable_index, so we can free itable_index.
991 assert(itableMethodEntry::size() * wordSize == wordSize, "adjust the scaling in the code below");
992 // lea(recv_klass, Address(recv_klass, itable_index, Address::times_ptr, itentry_off));
993 lea(recv_klass, Address(recv_klass, itable_index, Address::lsl(3)));
994 if (itentry_off)
995 add(recv_klass, recv_klass, itentry_off);
996 }
997
998 // for (scan = klass->itable(); scan->interface() != NULL; scan += scan_step) {
999 // if (scan->interface() == intf) {
1000 // result = (klass + scan->offset() + itable_index);
1001 // }
1002 // }
1003 Label search, found_method;
1004
1005 for (int peel = 1; peel >= 0; peel--) {
1006 ldr(method_result, Address(scan_temp, itableOffsetEntry::interface_offset_in_bytes()));
1007 cmp(intf_klass, method_result);
1008
1009 if (peel) {
1010 br(Assembler::EQ, found_method);
1011 } else {
1012 br(Assembler::NE, search);
1013 // (invert the test to fall through to found_method...)
1014 }
1015
1016 if (!peel) break;
1017
1018 bind(search);
1019
1020 // Check that the previous entry is non-null. A null entry means that
1021 // the receiver class doesn't implement the interface, and wasn't the
1022 // same as when the caller was compiled.
1023 cbz(method_result, L_no_such_interface);
1024 add(scan_temp, scan_temp, scan_step);
1025 }
1026
1027 bind(found_method);
1028
1029 // Got a hit.
1030 if (return_method) {
1031 ldrw(scan_temp, Address(scan_temp, itableOffsetEntry::offset_offset_in_bytes()));
1032 ldr(method_result, Address(recv_klass, scan_temp, Address::uxtw(0)));
1033 }
1034 }
1035
1036 // virtual method calling
1037 void MacroAssembler::lookup_virtual_method(Register recv_klass,
1038 RegisterOrConstant vtable_index,
1039 Register method_result) {
1040 const int base = in_bytes(Klass::vtable_start_offset());
1041 assert(vtableEntry::size() * wordSize == 8,
1042 "adjust the scaling in the code below");
1043 int vtable_offset_in_bytes = base + vtableEntry::method_offset_in_bytes();
1044
1045 if (vtable_index.is_register()) {
1046 lea(method_result, Address(recv_klass,
1047 vtable_index.as_register(),
1048 Address::lsl(LogBytesPerWord)));
1049 ldr(method_result, Address(method_result, vtable_offset_in_bytes));
1050 } else {
1051 vtable_offset_in_bytes += vtable_index.as_constant() * wordSize;
1052 ldr(method_result,
1053 form_address(rscratch1, recv_klass, vtable_offset_in_bytes, 0));
1054 }
1055 }
1056
1057 void MacroAssembler::check_klass_subtype(Register sub_klass,
1058 Register super_klass,
1059 Register temp_reg,
1060 Label& L_success) {
1061 Label L_failure;
1062 check_klass_subtype_fast_path(sub_klass, super_klass, temp_reg, &L_success, &L_failure, NULL);
1063 check_klass_subtype_slow_path(sub_klass, super_klass, temp_reg, noreg, &L_success, NULL);
1064 bind(L_failure);
1065 }
1066
1067
1068 void MacroAssembler::check_klass_subtype_fast_path(Register sub_klass,
1069 Register super_klass,
1070 Register temp_reg,
1071 Label* L_success,
1072 Label* L_failure,
1073 Label* L_slow_path,
1074 RegisterOrConstant super_check_offset) {
1075 assert_different_registers(sub_klass, super_klass, temp_reg);
1076 bool must_load_sco = (super_check_offset.constant_or_zero() == -1);
1077 if (super_check_offset.is_register()) {
1078 assert_different_registers(sub_klass, super_klass,
1079 super_check_offset.as_register());
1080 } else if (must_load_sco) {
1081 assert(temp_reg != noreg, "supply either a temp or a register offset");
1082 }
1083
1084 Label L_fallthrough;
1085 int label_nulls = 0;
1086 if (L_success == NULL) { L_success = &L_fallthrough; label_nulls++; }
1087 if (L_failure == NULL) { L_failure = &L_fallthrough; label_nulls++; }
1088 if (L_slow_path == NULL) { L_slow_path = &L_fallthrough; label_nulls++; }
1089 assert(label_nulls <= 1, "at most one NULL in the batch");
1090
1091 int sc_offset = in_bytes(Klass::secondary_super_cache_offset());
1092 int sco_offset = in_bytes(Klass::super_check_offset_offset());
1093 Address super_check_offset_addr(super_klass, sco_offset);
1094
1095 // Hacked jmp, which may only be used just before L_fallthrough.
1096 #define final_jmp(label) \
1097 if (&(label) == &L_fallthrough) { /*do nothing*/ } \
1098 else b(label) /*omit semi*/
1099
1100 // If the pointers are equal, we are done (e.g., String[] elements).
1101 // This self-check enables sharing of secondary supertype arrays among
1102 // non-primary types such as array-of-interface. Otherwise, each such
1103 // type would need its own customized SSA.
1104 // We move this check to the front of the fast path because many
1105 // type checks are in fact trivially successful in this manner,
1106 // so we get a nicely predicted branch right at the start of the check.
1107 cmp(sub_klass, super_klass);
1108 br(Assembler::EQ, *L_success);
1109
1110 // Check the supertype display:
1111 if (must_load_sco) {
1112 ldrw(temp_reg, super_check_offset_addr);
1113 super_check_offset = RegisterOrConstant(temp_reg);
1114 }
1115 Address super_check_addr(sub_klass, super_check_offset);
1116 ldr(rscratch1, super_check_addr);
1117 cmp(super_klass, rscratch1); // load displayed supertype
1118
1119 // This check has worked decisively for primary supers.
1120 // Secondary supers are sought in the super_cache ('super_cache_addr').
1121 // (Secondary supers are interfaces and very deeply nested subtypes.)
1122 // This works in the same check above because of a tricky aliasing
1123 // between the super_cache and the primary super display elements.
1124 // (The 'super_check_addr' can address either, as the case requires.)
1125 // Note that the cache is updated below if it does not help us find
1126 // what we need immediately.
1127 // So if it was a primary super, we can just fail immediately.
1128 // Otherwise, it's the slow path for us (no success at this point).
1129
1130 if (super_check_offset.is_register()) {
1131 br(Assembler::EQ, *L_success);
1132 cmp(super_check_offset.as_register(), sc_offset);
1133 if (L_failure == &L_fallthrough) {
1134 br(Assembler::EQ, *L_slow_path);
1135 } else {
1136 br(Assembler::NE, *L_failure);
1137 final_jmp(*L_slow_path);
1138 }
1139 } else if (super_check_offset.as_constant() == sc_offset) {
1140 // Need a slow path; fast failure is impossible.
1141 if (L_slow_path == &L_fallthrough) {
1142 br(Assembler::EQ, *L_success);
1143 } else {
1144 br(Assembler::NE, *L_slow_path);
1145 final_jmp(*L_success);
1146 }
1147 } else {
1148 // No slow path; it's a fast decision.
1149 if (L_failure == &L_fallthrough) {
1150 br(Assembler::EQ, *L_success);
1151 } else {
1152 br(Assembler::NE, *L_failure);
1153 final_jmp(*L_success);
1154 }
1155 }
1156
1157 bind(L_fallthrough);
1158
1159 #undef final_jmp
1160 }
1161
1162 // These two are taken from x86, but they look generally useful
1163
1164 // scans count pointer sized words at [addr] for occurence of value,
1165 // generic
1166 void MacroAssembler::repne_scan(Register addr, Register value, Register count,
1167 Register scratch) {
1168 Label Lloop, Lexit;
1169 cbz(count, Lexit);
1170 bind(Lloop);
1171 ldr(scratch, post(addr, wordSize));
1172 cmp(value, scratch);
1173 br(EQ, Lexit);
1174 sub(count, count, 1);
1175 cbnz(count, Lloop);
1176 bind(Lexit);
1177 }
1178
1179 // scans count 4 byte words at [addr] for occurence of value,
1180 // generic
1181 void MacroAssembler::repne_scanw(Register addr, Register value, Register count,
1182 Register scratch) {
1183 Label Lloop, Lexit;
1184 cbz(count, Lexit);
1185 bind(Lloop);
1186 ldrw(scratch, post(addr, wordSize));
1187 cmpw(value, scratch);
1188 br(EQ, Lexit);
1189 sub(count, count, 1);
1190 cbnz(count, Lloop);
1191 bind(Lexit);
1192 }
1193
1194 void MacroAssembler::check_klass_subtype_slow_path(Register sub_klass,
1195 Register super_klass,
1196 Register temp_reg,
1197 Register temp2_reg,
1198 Label* L_success,
1199 Label* L_failure,
1200 bool set_cond_codes) {
1201 assert_different_registers(sub_klass, super_klass, temp_reg);
1202 if (temp2_reg != noreg)
1203 assert_different_registers(sub_klass, super_klass, temp_reg, temp2_reg, rscratch1);
1204 #define IS_A_TEMP(reg) ((reg) == temp_reg || (reg) == temp2_reg)
1205
1206 Label L_fallthrough;
1207 int label_nulls = 0;
1208 if (L_success == NULL) { L_success = &L_fallthrough; label_nulls++; }
1209 if (L_failure == NULL) { L_failure = &L_fallthrough; label_nulls++; }
1210 assert(label_nulls <= 1, "at most one NULL in the batch");
1211
1212 // a couple of useful fields in sub_klass:
1213 int ss_offset = in_bytes(Klass::secondary_supers_offset());
1214 int sc_offset = in_bytes(Klass::secondary_super_cache_offset());
1215 Address secondary_supers_addr(sub_klass, ss_offset);
1216 Address super_cache_addr( sub_klass, sc_offset);
1217
1218 BLOCK_COMMENT("check_klass_subtype_slow_path");
1219
1220 // Do a linear scan of the secondary super-klass chain.
1221 // This code is rarely used, so simplicity is a virtue here.
1222 // The repne_scan instruction uses fixed registers, which we must spill.
1223 // Don't worry too much about pre-existing connections with the input regs.
1224
1225 assert(sub_klass != r0, "killed reg"); // killed by mov(r0, super)
1226 assert(sub_klass != r2, "killed reg"); // killed by lea(r2, &pst_counter)
1227
1228 RegSet pushed_registers;
1229 if (!IS_A_TEMP(r2)) pushed_registers += r2;
1230 if (!IS_A_TEMP(r5)) pushed_registers += r5;
1231
1232 if (super_klass != r0 || UseCompressedOops) {
1233 if (!IS_A_TEMP(r0)) pushed_registers += r0;
1234 }
1235
1236 push(pushed_registers, sp);
1237
1238 // Get super_klass value into r0 (even if it was in r5 or r2).
1239 if (super_klass != r0) {
1240 mov(r0, super_klass);
1241 }
1242
1243 #ifndef PRODUCT
1244 mov(rscratch2, (address)&SharedRuntime::_partial_subtype_ctr);
1245 Address pst_counter_addr(rscratch2);
1246 ldr(rscratch1, pst_counter_addr);
1247 add(rscratch1, rscratch1, 1);
1248 str(rscratch1, pst_counter_addr);
1249 #endif //PRODUCT
1250
1251 // We will consult the secondary-super array.
1252 ldr(r5, secondary_supers_addr);
1253 // Load the array length.
1254 ldrw(r2, Address(r5, Array<Klass*>::length_offset_in_bytes()));
1255 // Skip to start of data.
1256 add(r5, r5, Array<Klass*>::base_offset_in_bytes());
1257
1258 cmp(sp, zr); // Clear Z flag; SP is never zero
1259 // Scan R2 words at [R5] for an occurrence of R0.
1260 // Set NZ/Z based on last compare.
1261 repne_scan(r5, r0, r2, rscratch1);
1262
1263 // Unspill the temp. registers:
1264 pop(pushed_registers, sp);
1265
1266 br(Assembler::NE, *L_failure);
1267
1268 // Success. Cache the super we found and proceed in triumph.
1269 str(super_klass, super_cache_addr);
1270
1271 if (L_success != &L_fallthrough) {
1272 b(*L_success);
1273 }
1274
1275 #undef IS_A_TEMP
1276
1277 bind(L_fallthrough);
1278 }
1279
1280
1281 void MacroAssembler::verify_oop(Register reg, const char* s) {
1282 if (!VerifyOops) return;
1283
1284 // Pass register number to verify_oop_subroutine
1285 const char* b = NULL;
1286 {
1287 ResourceMark rm;
1288 stringStream ss;
1289 ss.print("verify_oop: %s: %s", reg->name(), s);
1290 b = code_string(ss.as_string());
1291 }
1292 BLOCK_COMMENT("verify_oop {");
1293
1294 stp(r0, rscratch1, Address(pre(sp, -2 * wordSize)));
1295 stp(rscratch2, lr, Address(pre(sp, -2 * wordSize)));
1296
1297 mov(r0, reg);
1298 mov(rscratch1, (address)b);
1299
1300 // call indirectly to solve generation ordering problem
1301 lea(rscratch2, ExternalAddress(StubRoutines::verify_oop_subroutine_entry_address()));
1302 ldr(rscratch2, Address(rscratch2));
1303 blr(rscratch2);
1304
1305 ldp(rscratch2, lr, Address(post(sp, 2 * wordSize)));
1306 ldp(r0, rscratch1, Address(post(sp, 2 * wordSize)));
1307
1308 BLOCK_COMMENT("} verify_oop");
1309 }
1310
1311 void MacroAssembler::verify_oop_addr(Address addr, const char* s) {
1312 if (!VerifyOops) return;
1313
1314 const char* b = NULL;
1315 {
1316 ResourceMark rm;
1317 stringStream ss;
1318 ss.print("verify_oop_addr: %s", s);
1319 b = code_string(ss.as_string());
1320 }
1321 BLOCK_COMMENT("verify_oop_addr {");
1322
1323 stp(r0, rscratch1, Address(pre(sp, -2 * wordSize)));
1324 stp(rscratch2, lr, Address(pre(sp, -2 * wordSize)));
1325
1326 // addr may contain sp so we will have to adjust it based on the
1327 // pushes that we just did.
1328 if (addr.uses(sp)) {
1329 lea(r0, addr);
1330 ldr(r0, Address(r0, 4 * wordSize));
1331 } else {
1332 ldr(r0, addr);
1333 }
1334 mov(rscratch1, (address)b);
1335
1336 // call indirectly to solve generation ordering problem
1337 lea(rscratch2, ExternalAddress(StubRoutines::verify_oop_subroutine_entry_address()));
1338 ldr(rscratch2, Address(rscratch2));
1339 blr(rscratch2);
1340
1341 ldp(rscratch2, lr, Address(post(sp, 2 * wordSize)));
1342 ldp(r0, rscratch1, Address(post(sp, 2 * wordSize)));
1343
1344 BLOCK_COMMENT("} verify_oop_addr");
1345 }
1346
1347 Address MacroAssembler::argument_address(RegisterOrConstant arg_slot,
1348 int extra_slot_offset) {
1349 // cf. TemplateTable::prepare_invoke(), if (load_receiver).
1350 int stackElementSize = Interpreter::stackElementSize;
1351 int offset = Interpreter::expr_offset_in_bytes(extra_slot_offset+0);
1352 #ifdef ASSERT
1353 int offset1 = Interpreter::expr_offset_in_bytes(extra_slot_offset+1);
1354 assert(offset1 - offset == stackElementSize, "correct arithmetic");
1355 #endif
1356 if (arg_slot.is_constant()) {
1357 return Address(esp, arg_slot.as_constant() * stackElementSize
1358 + offset);
1359 } else {
1360 add(rscratch1, esp, arg_slot.as_register(),
1361 ext::uxtx, exact_log2(stackElementSize));
1362 return Address(rscratch1, offset);
1363 }
1364 }
1365
1366 void MacroAssembler::call_VM_leaf_base(address entry_point,
1367 int number_of_arguments,
1368 Label *retaddr) {
1369 call_VM_leaf_base1(entry_point, number_of_arguments, 0, ret_type_integral, retaddr);
1370 }
1371
1372 void MacroAssembler::call_VM_leaf_base1(address entry_point,
1373 int number_of_gp_arguments,
1374 int number_of_fp_arguments,
1375 ret_type type,
1376 Label *retaddr) {
1377 Label E, L;
1378
1379 stp(rscratch1, rmethod, Address(pre(sp, -2 * wordSize)));
1380
1381 // We add 1 to number_of_arguments because the thread in arg0 is
1382 // not counted
1383 mov(rscratch1, entry_point);
1384 blrt(rscratch1, number_of_gp_arguments + 1, number_of_fp_arguments, type);
1385 if (retaddr)
1386 bind(*retaddr);
1387
1388 ldp(rscratch1, rmethod, Address(post(sp, 2 * wordSize)));
1389 maybe_isb();
1390 }
1391
1392 void MacroAssembler::call_VM_leaf(address entry_point, int number_of_arguments) {
1393 call_VM_leaf_base(entry_point, number_of_arguments);
1394 }
1395
1396 void MacroAssembler::call_VM_leaf(address entry_point, Register arg_0) {
1397 pass_arg0(this, arg_0);
1398 call_VM_leaf_base(entry_point, 1);
1399 }
1400
1401 void MacroAssembler::call_VM_leaf(address entry_point, Register arg_0, Register arg_1) {
1402 pass_arg0(this, arg_0);
1403 pass_arg1(this, arg_1);
1404 call_VM_leaf_base(entry_point, 2);
1405 }
1406
1407 void MacroAssembler::call_VM_leaf(address entry_point, Register arg_0,
1408 Register arg_1, Register arg_2) {
1409 pass_arg0(this, arg_0);
1410 pass_arg1(this, arg_1);
1411 pass_arg2(this, arg_2);
1412 call_VM_leaf_base(entry_point, 3);
1413 }
1414
1415 void MacroAssembler::super_call_VM_leaf(address entry_point, Register arg_0) {
1416 pass_arg0(this, arg_0);
1417 MacroAssembler::call_VM_leaf_base(entry_point, 1);
1418 }
1419
1420 void MacroAssembler::super_call_VM_leaf(address entry_point, Register arg_0, Register arg_1) {
1421
1422 assert(arg_0 != c_rarg1, "smashed arg");
1423 pass_arg1(this, arg_1);
1424 pass_arg0(this, arg_0);
1425 MacroAssembler::call_VM_leaf_base(entry_point, 2);
1426 }
1427
1428 void MacroAssembler::super_call_VM_leaf(address entry_point, Register arg_0, Register arg_1, Register arg_2) {
1429 assert(arg_0 != c_rarg2, "smashed arg");
1430 assert(arg_1 != c_rarg2, "smashed arg");
1431 pass_arg2(this, arg_2);
1432 assert(arg_0 != c_rarg1, "smashed arg");
1433 pass_arg1(this, arg_1);
1434 pass_arg0(this, arg_0);
1435 MacroAssembler::call_VM_leaf_base(entry_point, 3);
1436 }
1437
1438 void MacroAssembler::super_call_VM_leaf(address entry_point, Register arg_0, Register arg_1, Register arg_2, Register arg_3) {
1439 assert(arg_0 != c_rarg3, "smashed arg");
1440 assert(arg_1 != c_rarg3, "smashed arg");
1441 assert(arg_2 != c_rarg3, "smashed arg");
1442 pass_arg3(this, arg_3);
1443 assert(arg_0 != c_rarg2, "smashed arg");
1444 assert(arg_1 != c_rarg2, "smashed arg");
1445 pass_arg2(this, arg_2);
1446 assert(arg_0 != c_rarg1, "smashed arg");
1447 pass_arg1(this, arg_1);
1448 pass_arg0(this, arg_0);
1449 MacroAssembler::call_VM_leaf_base(entry_point, 4);
1450 }
1451
1452 void MacroAssembler::null_check(Register reg, int offset) {
1453 if (needs_explicit_null_check(offset)) {
1454 // provoke OS NULL exception if reg = NULL by
1455 // accessing M[reg] w/o changing any registers
1456 // NOTE: this is plenty to provoke a segv
1457 ldr(zr, Address(reg));
1458 } else {
1459 // nothing to do, (later) access of M[reg + offset]
1460 // will provoke OS NULL exception if reg = NULL
1461 }
1462 }
1463
1464 // MacroAssembler protected routines needed to implement
1465 // public methods
1466
1467 void MacroAssembler::mov(Register r, Address dest) {
1468 code_section()->relocate(pc(), dest.rspec());
1469 u_int64_t imm64 = (u_int64_t)dest.target();
1470 movptr(r, imm64);
1471 }
1472
1473 // Move a constant pointer into r. In AArch64 mode the virtual
1474 // address space is 48 bits in size, so we only need three
1475 // instructions to create a patchable instruction sequence that can
1476 // reach anywhere.
1477 void MacroAssembler::movptr(Register r, uintptr_t imm64) {
1478 #ifndef PRODUCT
1479 {
1480 char buffer[64];
1481 snprintf(buffer, sizeof(buffer), "0x%"PRIX64, imm64);
1482 block_comment(buffer);
1483 }
1484 #endif
1485 assert(imm64 < (1ul << 48), "48-bit overflow in address constant");
1486 movz(r, imm64 & 0xffff);
1487 imm64 >>= 16;
1488 movk(r, imm64 & 0xffff, 16);
1489 imm64 >>= 16;
1490 movk(r, imm64 & 0xffff, 32);
1491 }
1492
1493 // Macro to mov replicated immediate to vector register.
1494 // Vd will get the following values for different arrangements in T
1495 // imm32 == hex 000000gh T8B: Vd = ghghghghghghghgh
1496 // imm32 == hex 000000gh T16B: Vd = ghghghghghghghghghghghghghghghgh
1497 // imm32 == hex 0000efgh T4H: Vd = efghefghefghefgh
1498 // imm32 == hex 0000efgh T8H: Vd = efghefghefghefghefghefghefghefgh
1499 // imm32 == hex abcdefgh T2S: Vd = abcdefghabcdefgh
1500 // imm32 == hex abcdefgh T4S: Vd = abcdefghabcdefghabcdefghabcdefgh
1501 // T1D/T2D: invalid
1502 void MacroAssembler::mov(FloatRegister Vd, SIMD_Arrangement T, u_int32_t imm32) {
1503 assert(T != T1D && T != T2D, "invalid arrangement");
1504 if (T == T8B || T == T16B) {
1505 assert((imm32 & ~0xff) == 0, "extraneous bits in unsigned imm32 (T8B/T16B)");
1506 movi(Vd, T, imm32 & 0xff, 0);
1507 return;
1508 }
1509 u_int32_t nimm32 = ~imm32;
1510 if (T == T4H || T == T8H) {
1511 assert((imm32 & ~0xffff) == 0, "extraneous bits in unsigned imm32 (T4H/T8H)");
1512 imm32 &= 0xffff;
1513 nimm32 &= 0xffff;
1514 }
1515 u_int32_t x = imm32;
1516 int movi_cnt = 0;
1517 int movn_cnt = 0;
1518 while (x) { if (x & 0xff) movi_cnt++; x >>= 8; }
1519 x = nimm32;
1520 while (x) { if (x & 0xff) movn_cnt++; x >>= 8; }
1521 if (movn_cnt < movi_cnt) imm32 = nimm32;
1522 unsigned lsl = 0;
1523 while (imm32 && (imm32 & 0xff) == 0) { lsl += 8; imm32 >>= 8; }
1524 if (movn_cnt < movi_cnt)
1525 mvni(Vd, T, imm32 & 0xff, lsl);
1526 else
1527 movi(Vd, T, imm32 & 0xff, lsl);
1528 imm32 >>= 8; lsl += 8;
1529 while (imm32) {
1530 while ((imm32 & 0xff) == 0) { lsl += 8; imm32 >>= 8; }
1531 if (movn_cnt < movi_cnt)
1532 bici(Vd, T, imm32 & 0xff, lsl);
1533 else
1534 orri(Vd, T, imm32 & 0xff, lsl);
1535 lsl += 8; imm32 >>= 8;
1536 }
1537 }
1538
1539 void MacroAssembler::mov_immediate64(Register dst, u_int64_t imm64)
1540 {
1541 #ifndef PRODUCT
1542 {
1543 char buffer[64];
1544 snprintf(buffer, sizeof(buffer), "0x%"PRIX64, imm64);
1545 block_comment(buffer);
1546 }
1547 #endif
1548 if (operand_valid_for_logical_immediate(false, imm64)) {
1549 orr(dst, zr, imm64);
1550 } else {
1551 // we can use a combination of MOVZ or MOVN with
1552 // MOVK to build up the constant
1553 u_int64_t imm_h[4];
1554 int zero_count = 0;
1555 int neg_count = 0;
1556 int i;
1557 for (i = 0; i < 4; i++) {
1558 imm_h[i] = ((imm64 >> (i * 16)) & 0xffffL);
1559 if (imm_h[i] == 0) {
1560 zero_count++;
1561 } else if (imm_h[i] == 0xffffL) {
1562 neg_count++;
1563 }
1564 }
1565 if (zero_count == 4) {
1566 // one MOVZ will do
1567 movz(dst, 0);
1568 } else if (neg_count == 4) {
1569 // one MOVN will do
1570 movn(dst, 0);
1571 } else if (zero_count == 3) {
1572 for (i = 0; i < 4; i++) {
1573 if (imm_h[i] != 0L) {
1574 movz(dst, (u_int32_t)imm_h[i], (i << 4));
1575 break;
1576 }
1577 }
1578 } else if (neg_count == 3) {
1579 // one MOVN will do
1580 for (int i = 0; i < 4; i++) {
1581 if (imm_h[i] != 0xffffL) {
1582 movn(dst, (u_int32_t)imm_h[i] ^ 0xffffL, (i << 4));
1583 break;
1584 }
1585 }
1586 } else if (zero_count == 2) {
1587 // one MOVZ and one MOVK will do
1588 for (i = 0; i < 3; i++) {
1589 if (imm_h[i] != 0L) {
1590 movz(dst, (u_int32_t)imm_h[i], (i << 4));
1591 i++;
1592 break;
1593 }
1594 }
1595 for (;i < 4; i++) {
1596 if (imm_h[i] != 0L) {
1597 movk(dst, (u_int32_t)imm_h[i], (i << 4));
1598 }
1599 }
1600 } else if (neg_count == 2) {
1601 // one MOVN and one MOVK will do
1602 for (i = 0; i < 4; i++) {
1603 if (imm_h[i] != 0xffffL) {
1604 movn(dst, (u_int32_t)imm_h[i] ^ 0xffffL, (i << 4));
1605 i++;
1606 break;
1607 }
1608 }
1609 for (;i < 4; i++) {
1610 if (imm_h[i] != 0xffffL) {
1611 movk(dst, (u_int32_t)imm_h[i], (i << 4));
1612 }
1613 }
1614 } else if (zero_count == 1) {
1615 // one MOVZ and two MOVKs will do
1616 for (i = 0; i < 4; i++) {
1617 if (imm_h[i] != 0L) {
1618 movz(dst, (u_int32_t)imm_h[i], (i << 4));
1619 i++;
1620 break;
1621 }
1622 }
1623 for (;i < 4; i++) {
1624 if (imm_h[i] != 0x0L) {
1625 movk(dst, (u_int32_t)imm_h[i], (i << 4));
1626 }
1627 }
1628 } else if (neg_count == 1) {
1629 // one MOVN and two MOVKs will do
1630 for (i = 0; i < 4; i++) {
1631 if (imm_h[i] != 0xffffL) {
1632 movn(dst, (u_int32_t)imm_h[i] ^ 0xffffL, (i << 4));
1633 i++;
1634 break;
1635 }
1636 }
1637 for (;i < 4; i++) {
1638 if (imm_h[i] != 0xffffL) {
1639 movk(dst, (u_int32_t)imm_h[i], (i << 4));
1640 }
1641 }
1642 } else {
1643 // use a MOVZ and 3 MOVKs (makes it easier to debug)
1644 movz(dst, (u_int32_t)imm_h[0], 0);
1645 for (i = 1; i < 4; i++) {
1646 movk(dst, (u_int32_t)imm_h[i], (i << 4));
1647 }
1648 }
1649 }
1650 }
1651
1652 void MacroAssembler::mov_immediate32(Register dst, u_int32_t imm32)
1653 {
1654 #ifndef PRODUCT
1655 {
1656 char buffer[64];
1657 snprintf(buffer, sizeof(buffer), "0x%"PRIX32, imm32);
1658 block_comment(buffer);
1659 }
1660 #endif
1661 if (operand_valid_for_logical_immediate(true, imm32)) {
1662 orrw(dst, zr, imm32);
1663 } else {
1664 // we can use MOVZ, MOVN or two calls to MOVK to build up the
1665 // constant
1666 u_int32_t imm_h[2];
1667 imm_h[0] = imm32 & 0xffff;
1668 imm_h[1] = ((imm32 >> 16) & 0xffff);
1669 if (imm_h[0] == 0) {
1670 movzw(dst, imm_h[1], 16);
1671 } else if (imm_h[0] == 0xffff) {
1672 movnw(dst, imm_h[1] ^ 0xffff, 16);
1673 } else if (imm_h[1] == 0) {
1674 movzw(dst, imm_h[0], 0);
1675 } else if (imm_h[1] == 0xffff) {
1676 movnw(dst, imm_h[0] ^ 0xffff, 0);
1677 } else {
1678 // use a MOVZ and MOVK (makes it easier to debug)
1679 movzw(dst, imm_h[0], 0);
1680 movkw(dst, imm_h[1], 16);
1681 }
1682 }
1683 }
1684
1685 // Form an address from base + offset in Rd. Rd may or may
1686 // not actually be used: you must use the Address that is returned.
1687 // It is up to you to ensure that the shift provided matches the size
1688 // of your data.
1689 Address MacroAssembler::form_address(Register Rd, Register base, long byte_offset, int shift) {
1690 if (Address::offset_ok_for_immed(byte_offset, shift))
1691 // It fits; no need for any heroics
1692 return Address(base, byte_offset);
1693
1694 // Don't do anything clever with negative or misaligned offsets
1695 unsigned mask = (1 << shift) - 1;
1696 if (byte_offset < 0 || byte_offset & mask) {
1697 mov(Rd, byte_offset);
1698 add(Rd, base, Rd);
1699 return Address(Rd);
1700 }
1701
1702 // See if we can do this with two 12-bit offsets
1703 {
1704 unsigned long word_offset = byte_offset >> shift;
1705 unsigned long masked_offset = word_offset & 0xfff000;
1706 if (Address::offset_ok_for_immed(word_offset - masked_offset)
1707 && Assembler::operand_valid_for_add_sub_immediate(masked_offset << shift)) {
1708 add(Rd, base, masked_offset << shift);
1709 word_offset -= masked_offset;
1710 return Address(Rd, word_offset << shift);
1711 }
1712 }
1713
1714 // Do it the hard way
1715 mov(Rd, byte_offset);
1716 add(Rd, base, Rd);
1717 return Address(Rd);
1718 }
1719
1720 void MacroAssembler::atomic_incw(Register counter_addr, Register tmp, Register tmp2) {
1721 if (UseLSE) {
1722 mov(tmp, 1);
1723 ldadd(Assembler::word, tmp, zr, counter_addr);
1724 return;
1725 }
1726 Label retry_load;
1727 if ((VM_Version::features() & VM_Version::CPU_STXR_PREFETCH))
1728 prfm(Address(counter_addr), PSTL1STRM);
1729 bind(retry_load);
1730 // flush and load exclusive from the memory location
1731 ldxrw(tmp, counter_addr);
1732 addw(tmp, tmp, 1);
1733 // if we store+flush with no intervening write tmp wil be zero
1734 stxrw(tmp2, tmp, counter_addr);
1735 cbnzw(tmp2, retry_load);
1736 }
1737
1738
1739 int MacroAssembler::corrected_idivl(Register result, Register ra, Register rb,
1740 bool want_remainder, Register scratch)
1741 {
1742 // Full implementation of Java idiv and irem. The function
1743 // returns the (pc) offset of the div instruction - may be needed
1744 // for implicit exceptions.
1745 //
1746 // constraint : ra/rb =/= scratch
1747 // normal case
1748 //
1749 // input : ra: dividend
1750 // rb: divisor
1751 //
1752 // result: either
1753 // quotient (= ra idiv rb)
1754 // remainder (= ra irem rb)
1755
1756 assert(ra != scratch && rb != scratch, "reg cannot be scratch");
1757
1758 int idivl_offset = offset();
1759 if (! want_remainder) {
1760 sdivw(result, ra, rb);
1761 } else {
1762 sdivw(scratch, ra, rb);
1763 Assembler::msubw(result, scratch, rb, ra);
1764 }
1765
1766 return idivl_offset;
1767 }
1768
1769 int MacroAssembler::corrected_idivq(Register result, Register ra, Register rb,
1770 bool want_remainder, Register scratch)
1771 {
1772 // Full implementation of Java ldiv and lrem. The function
1773 // returns the (pc) offset of the div instruction - may be needed
1774 // for implicit exceptions.
1775 //
1776 // constraint : ra/rb =/= scratch
1777 // normal case
1778 //
1779 // input : ra: dividend
1780 // rb: divisor
1781 //
1782 // result: either
1783 // quotient (= ra idiv rb)
1784 // remainder (= ra irem rb)
1785
1786 assert(ra != scratch && rb != scratch, "reg cannot be scratch");
1787
1788 int idivq_offset = offset();
1789 if (! want_remainder) {
1790 sdiv(result, ra, rb);
1791 } else {
1792 sdiv(scratch, ra, rb);
1793 Assembler::msub(result, scratch, rb, ra);
1794 }
1795
1796 return idivq_offset;
1797 }
1798
1799 void MacroAssembler::membar(Membar_mask_bits order_constraint) {
1800 address prev = pc() - NativeMembar::instruction_size;
1801 address last = code()->last_insn();
1802 if (last != NULL && nativeInstruction_at(last)->is_Membar() && prev == last) {
1803 NativeMembar *bar = NativeMembar_at(prev);
1804 // We are merging two memory barrier instructions. On AArch64 we
1805 // can do this simply by ORing them together.
1806 bar->set_kind(bar->get_kind() | order_constraint);
1807 BLOCK_COMMENT("merged membar");
1808 } else {
1809 code()->set_last_insn(pc());
1810 dmb(Assembler::barrier(order_constraint));
1811 }
1812 }
1813
1814 bool MacroAssembler::try_merge_ldst(Register rt, const Address &adr, size_t size_in_bytes, bool is_store) {
1815 if (ldst_can_merge(rt, adr, size_in_bytes, is_store)) {
1816 merge_ldst(rt, adr, size_in_bytes, is_store);
1817 code()->clear_last_insn();
1818 return true;
1819 } else {
1820 assert(size_in_bytes == 8 || size_in_bytes == 4, "only 8 bytes or 4 bytes load/store is supported.");
1821 const unsigned mask = size_in_bytes - 1;
1822 if (adr.getMode() == Address::base_plus_offset &&
1823 (adr.offset() & mask) == 0) { // only supports base_plus_offset.
1824 code()->set_last_insn(pc());
1825 }
1826 return false;
1827 }
1828 }
1829
1830 void MacroAssembler::ldr(Register Rx, const Address &adr) {
1831 // We always try to merge two adjacent loads into one ldp.
1832 if (!try_merge_ldst(Rx, adr, 8, false)) {
1833 Assembler::ldr(Rx, adr);
1834 }
1835 }
1836
1837 void MacroAssembler::ldrw(Register Rw, const Address &adr) {
1838 // We always try to merge two adjacent loads into one ldp.
1839 if (!try_merge_ldst(Rw, adr, 4, false)) {
1840 Assembler::ldrw(Rw, adr);
1841 }
1842 }
1843
1844 void MacroAssembler::str(Register Rx, const Address &adr) {
1845 // We always try to merge two adjacent stores into one stp.
1846 if (!try_merge_ldst(Rx, adr, 8, true)) {
1847 Assembler::str(Rx, adr);
1848 }
1849 }
1850
1851 void MacroAssembler::strw(Register Rw, const Address &adr) {
1852 // We always try to merge two adjacent stores into one stp.
1853 if (!try_merge_ldst(Rw, adr, 4, true)) {
1854 Assembler::strw(Rw, adr);
1855 }
1856 }
1857
1858 // MacroAssembler routines found actually to be needed
1859
1860 void MacroAssembler::push(Register src)
1861 {
1862 str(src, Address(pre(esp, -1 * wordSize)));
1863 }
1864
1865 void MacroAssembler::pop(Register dst)
1866 {
1867 ldr(dst, Address(post(esp, 1 * wordSize)));
1868 }
1869
1870 // Note: load_unsigned_short used to be called load_unsigned_word.
1871 int MacroAssembler::load_unsigned_short(Register dst, Address src) {
1872 int off = offset();
1873 ldrh(dst, src);
1874 return off;
1875 }
1876
1877 int MacroAssembler::load_unsigned_byte(Register dst, Address src) {
1878 int off = offset();
1879 ldrb(dst, src);
1880 return off;
1881 }
1882
1883 int MacroAssembler::load_signed_short(Register dst, Address src) {
1884 int off = offset();
1885 ldrsh(dst, src);
1886 return off;
1887 }
1888
1889 int MacroAssembler::load_signed_byte(Register dst, Address src) {
1890 int off = offset();
1891 ldrsb(dst, src);
1892 return off;
1893 }
1894
1895 int MacroAssembler::load_signed_short32(Register dst, Address src) {
1896 int off = offset();
1897 ldrshw(dst, src);
1898 return off;
1899 }
1900
1901 int MacroAssembler::load_signed_byte32(Register dst, Address src) {
1902 int off = offset();
1903 ldrsbw(dst, src);
1904 return off;
1905 }
1906
1907 void MacroAssembler::load_sized_value(Register dst, Address src, size_t size_in_bytes, bool is_signed, Register dst2) {
1908 switch (size_in_bytes) {
1909 case 8: ldr(dst, src); break;
1910 case 4: ldrw(dst, src); break;
1911 case 2: is_signed ? load_signed_short(dst, src) : load_unsigned_short(dst, src); break;
1912 case 1: is_signed ? load_signed_byte( dst, src) : load_unsigned_byte( dst, src); break;
1913 default: ShouldNotReachHere();
1914 }
1915 }
1916
1917 void MacroAssembler::store_sized_value(Address dst, Register src, size_t size_in_bytes, Register src2) {
1918 switch (size_in_bytes) {
1919 case 8: str(src, dst); break;
1920 case 4: strw(src, dst); break;
1921 case 2: strh(src, dst); break;
1922 case 1: strb(src, dst); break;
1923 default: ShouldNotReachHere();
1924 }
1925 }
1926
1927 void MacroAssembler::decrementw(Register reg, int value)
1928 {
1929 if (value < 0) { incrementw(reg, -value); return; }
1930 if (value == 0) { return; }
1931 if (value < (1 << 12)) { subw(reg, reg, value); return; }
1932 /* else */ {
1933 guarantee(reg != rscratch2, "invalid dst for register decrement");
1934 movw(rscratch2, (unsigned)value);
1935 subw(reg, reg, rscratch2);
1936 }
1937 }
1938
1939 void MacroAssembler::decrement(Register reg, int value)
1940 {
1941 if (value < 0) { increment(reg, -value); return; }
1942 if (value == 0) { return; }
1943 if (value < (1 << 12)) { sub(reg, reg, value); return; }
1944 /* else */ {
1945 assert(reg != rscratch2, "invalid dst for register decrement");
1946 mov(rscratch2, (unsigned long)value);
1947 sub(reg, reg, rscratch2);
1948 }
1949 }
1950
1951 void MacroAssembler::decrementw(Address dst, int value)
1952 {
1953 assert(!dst.uses(rscratch1), "invalid dst for address decrement");
1954 if (dst.getMode() == Address::literal) {
1955 assert(abs(value) < (1 << 12), "invalid value and address mode combination");
1956 lea(rscratch2, dst);
1957 dst = Address(rscratch2);
1958 }
1959 ldrw(rscratch1, dst);
1960 decrementw(rscratch1, value);
1961 strw(rscratch1, dst);
1962 }
1963
1964 void MacroAssembler::decrement(Address dst, int value)
1965 {
1966 assert(!dst.uses(rscratch1), "invalid address for decrement");
1967 if (dst.getMode() == Address::literal) {
1968 assert(abs(value) < (1 << 12), "invalid value and address mode combination");
1969 lea(rscratch2, dst);
1970 dst = Address(rscratch2);
1971 }
1972 ldr(rscratch1, dst);
1973 decrement(rscratch1, value);
1974 str(rscratch1, dst);
1975 }
1976
1977 void MacroAssembler::incrementw(Register reg, int value)
1978 {
1979 if (value < 0) { decrementw(reg, -value); return; }
1980 if (value == 0) { return; }
1981 if (value < (1 << 12)) { addw(reg, reg, value); return; }
1982 /* else */ {
1983 assert(reg != rscratch2, "invalid dst for register increment");
1984 movw(rscratch2, (unsigned)value);
1985 addw(reg, reg, rscratch2);
1986 }
1987 }
1988
1989 void MacroAssembler::increment(Register reg, int value)
1990 {
1991 if (value < 0) { decrement(reg, -value); return; }
1992 if (value == 0) { return; }
1993 if (value < (1 << 12)) { add(reg, reg, value); return; }
1994 /* else */ {
1995 assert(reg != rscratch2, "invalid dst for register increment");
1996 movw(rscratch2, (unsigned)value);
1997 add(reg, reg, rscratch2);
1998 }
1999 }
2000
2001 void MacroAssembler::incrementw(Address dst, int value)
2002 {
2003 assert(!dst.uses(rscratch1), "invalid dst for address increment");
2004 if (dst.getMode() == Address::literal) {
2005 assert(abs(value) < (1 << 12), "invalid value and address mode combination");
2006 lea(rscratch2, dst);
2007 dst = Address(rscratch2);
2008 }
2009 ldrw(rscratch1, dst);
2010 incrementw(rscratch1, value);
2011 strw(rscratch1, dst);
2012 }
2013
2014 void MacroAssembler::increment(Address dst, int value)
2015 {
2016 assert(!dst.uses(rscratch1), "invalid dst for address increment");
2017 if (dst.getMode() == Address::literal) {
2018 assert(abs(value) < (1 << 12), "invalid value and address mode combination");
2019 lea(rscratch2, dst);
2020 dst = Address(rscratch2);
2021 }
2022 ldr(rscratch1, dst);
2023 increment(rscratch1, value);
2024 str(rscratch1, dst);
2025 }
2026
2027
2028 void MacroAssembler::pusha() {
2029 push(0x7fffffff, sp);
2030 }
2031
2032 void MacroAssembler::popa() {
2033 pop(0x7fffffff, sp);
2034 }
2035
2036 // Push lots of registers in the bit set supplied. Don't push sp.
2037 // Return the number of words pushed
2038 int MacroAssembler::push(unsigned int bitset, Register stack) {
2039 int words_pushed = 0;
2040
2041 // Scan bitset to accumulate register pairs
2042 unsigned char regs[32];
2043 int count = 0;
2044 for (int reg = 0; reg <= 30; reg++) {
2045 if (1 & bitset)
2046 regs[count++] = reg;
2047 bitset >>= 1;
2048 }
2049 regs[count++] = zr->encoding_nocheck();
2050 count &= ~1; // Only push an even nuber of regs
2051
2052 if (count) {
2053 stp(as_Register(regs[0]), as_Register(regs[1]),
2054 Address(pre(stack, -count * wordSize)));
2055 words_pushed += 2;
2056 }
2057 for (int i = 2; i < count; i += 2) {
2058 stp(as_Register(regs[i]), as_Register(regs[i+1]),
2059 Address(stack, i * wordSize));
2060 words_pushed += 2;
2061 }
2062
2063 assert(words_pushed == count, "oops, pushed != count");
2064
2065 return count;
2066 }
2067
2068 int MacroAssembler::pop(unsigned int bitset, Register stack) {
2069 int words_pushed = 0;
2070
2071 // Scan bitset to accumulate register pairs
2072 unsigned char regs[32];
2073 int count = 0;
2074 for (int reg = 0; reg <= 30; reg++) {
2075 if (1 & bitset)
2076 regs[count++] = reg;
2077 bitset >>= 1;
2078 }
2079 regs[count++] = zr->encoding_nocheck();
2080 count &= ~1;
2081
2082 for (int i = 2; i < count; i += 2) {
2083 ldp(as_Register(regs[i]), as_Register(regs[i+1]),
2084 Address(stack, i * wordSize));
2085 words_pushed += 2;
2086 }
2087 if (count) {
2088 ldp(as_Register(regs[0]), as_Register(regs[1]),
2089 Address(post(stack, count * wordSize)));
2090 words_pushed += 2;
2091 }
2092
2093 assert(words_pushed == count, "oops, pushed != count");
2094
2095 return count;
2096 }
2097 #ifdef ASSERT
2098 void MacroAssembler::verify_heapbase(const char* msg) {
2099 #if 0
2100 assert (UseCompressedOops || UseCompressedClassPointers, "should be compressed");
2101 assert (Universe::heap() != NULL, "java heap should be initialized");
2102 if (CheckCompressedOops) {
2103 Label ok;
2104 push(1 << rscratch1->encoding(), sp); // cmpptr trashes rscratch1
2105 cmpptr(rheapbase, ExternalAddress((address)Universe::narrow_ptrs_base_addr()));
2106 br(Assembler::EQ, ok);
2107 stop(msg);
2108 bind(ok);
2109 pop(1 << rscratch1->encoding(), sp);
2110 }
2111 #endif
2112 }
2113 #endif
2114
2115 void MacroAssembler::resolve_jobject(Register value, Register thread, Register tmp) {
2116 Label done, not_weak;
2117 cbz(value, done); // Use NULL as-is.
2118
2119 STATIC_ASSERT(JNIHandles::weak_tag_mask == 1u);
2120 tbz(r0, 0, not_weak); // Test for jweak tag.
2121
2122 // Resolve jweak.
2123 access_load_at(T_OBJECT, IN_NATIVE | ON_PHANTOM_OOP_REF, value,
2124 Address(value, -JNIHandles::weak_tag_value), tmp, thread);
2125 verify_oop(value);
2126 b(done);
2127
2128 bind(not_weak);
2129 // Resolve (untagged) jobject.
2130 access_load_at(T_OBJECT, IN_CONCURRENT_ROOT, value, Address(value, 0), tmp,
2131 thread);
2132 verify_oop(value);
2133 bind(done);
2134 }
2135
2136 void MacroAssembler::stop(const char* msg) {
2137 address ip = pc();
2138 pusha();
2139 mov(c_rarg0, (address)msg);
2140 mov(c_rarg1, (address)ip);
2141 mov(c_rarg2, sp);
2142 mov(c_rarg3, CAST_FROM_FN_PTR(address, MacroAssembler::debug64));
2143 // call(c_rarg3);
2144 blrt(c_rarg3, 3, 0, 1);
2145 hlt(0);
2146 }
2147
2148 void MacroAssembler::unimplemented(const char* what) {
2149 const char* buf = NULL;
2150 {
2151 ResourceMark rm;
2152 stringStream ss;
2153 ss.print("unimplemented: %s", what);
2154 buf = code_string(ss.as_string());
2155 }
2156 stop(buf);
2157 }
2158
2159 // If a constant does not fit in an immediate field, generate some
2160 // number of MOV instructions and then perform the operation.
2161 void MacroAssembler::wrap_add_sub_imm_insn(Register Rd, Register Rn, unsigned imm,
2162 add_sub_imm_insn insn1,
2163 add_sub_reg_insn insn2) {
2164 assert(Rd != zr, "Rd = zr and not setting flags?");
2165 if (operand_valid_for_add_sub_immediate((int)imm)) {
2166 (this->*insn1)(Rd, Rn, imm);
2167 } else {
2168 if (uabs(imm) < (1 << 24)) {
2169 (this->*insn1)(Rd, Rn, imm & -(1 << 12));
2170 (this->*insn1)(Rd, Rd, imm & ((1 << 12)-1));
2171 } else {
2172 assert_different_registers(Rd, Rn);
2173 mov(Rd, (uint64_t)imm);
2174 (this->*insn2)(Rd, Rn, Rd, LSL, 0);
2175 }
2176 }
2177 }
2178
2179 // Seperate vsn which sets the flags. Optimisations are more restricted
2180 // because we must set the flags correctly.
2181 void MacroAssembler::wrap_adds_subs_imm_insn(Register Rd, Register Rn, unsigned imm,
2182 add_sub_imm_insn insn1,
2183 add_sub_reg_insn insn2) {
2184 if (operand_valid_for_add_sub_immediate((int)imm)) {
2185 (this->*insn1)(Rd, Rn, imm);
2186 } else {
2187 assert_different_registers(Rd, Rn);
2188 assert(Rd != zr, "overflow in immediate operand");
2189 mov(Rd, (uint64_t)imm);
2190 (this->*insn2)(Rd, Rn, Rd, LSL, 0);
2191 }
2192 }
2193
2194
2195 void MacroAssembler::add(Register Rd, Register Rn, RegisterOrConstant increment) {
2196 if (increment.is_register()) {
2197 add(Rd, Rn, increment.as_register());
2198 } else {
2199 add(Rd, Rn, increment.as_constant());
2200 }
2201 }
2202
2203 void MacroAssembler::addw(Register Rd, Register Rn, RegisterOrConstant increment) {
2204 if (increment.is_register()) {
2205 addw(Rd, Rn, increment.as_register());
2206 } else {
2207 addw(Rd, Rn, increment.as_constant());
2208 }
2209 }
2210
2211 void MacroAssembler::sub(Register Rd, Register Rn, RegisterOrConstant decrement) {
2212 if (decrement.is_register()) {
2213 sub(Rd, Rn, decrement.as_register());
2214 } else {
2215 sub(Rd, Rn, decrement.as_constant());
2216 }
2217 }
2218
2219 void MacroAssembler::subw(Register Rd, Register Rn, RegisterOrConstant decrement) {
2220 if (decrement.is_register()) {
2221 subw(Rd, Rn, decrement.as_register());
2222 } else {
2223 subw(Rd, Rn, decrement.as_constant());
2224 }
2225 }
2226
2227 void MacroAssembler::reinit_heapbase()
2228 {
2229 if (UseCompressedOops) {
2230 if (Universe::is_fully_initialized()) {
2231 mov(rheapbase, Universe::narrow_ptrs_base());
2232 } else {
2233 lea(rheapbase, ExternalAddress((address)Universe::narrow_ptrs_base_addr()));
2234 ldr(rheapbase, Address(rheapbase));
2235 }
2236 }
2237 }
2238
2239 // this simulates the behaviour of the x86 cmpxchg instruction using a
2240 // load linked/store conditional pair. we use the acquire/release
2241 // versions of these instructions so that we flush pending writes as
2242 // per Java semantics.
2243
2244 // n.b the x86 version assumes the old value to be compared against is
2245 // in rax and updates rax with the value located in memory if the
2246 // cmpxchg fails. we supply a register for the old value explicitly
2247
2248 // the aarch64 load linked/store conditional instructions do not
2249 // accept an offset. so, unlike x86, we must provide a plain register
2250 // to identify the memory word to be compared/exchanged rather than a
2251 // register+offset Address.
2252
2253 void MacroAssembler::cmpxchgptr(Register oldv, Register newv, Register addr, Register tmp,
2254 Label &succeed, Label *fail) {
2255 // oldv holds comparison value
2256 // newv holds value to write in exchange
2257 // addr identifies memory word to compare against/update
2258 if (UseLSE) {
2259 mov(tmp, oldv);
2260 casal(Assembler::xword, oldv, newv, addr);
2261 cmp(tmp, oldv);
2262 br(Assembler::EQ, succeed);
2263 membar(AnyAny);
2264 } else {
2265 Label retry_load, nope;
2266 if ((VM_Version::features() & VM_Version::CPU_STXR_PREFETCH))
2267 prfm(Address(addr), PSTL1STRM);
2268 bind(retry_load);
2269 // flush and load exclusive from the memory location
2270 // and fail if it is not what we expect
2271 ldaxr(tmp, addr);
2272 cmp(tmp, oldv);
2273 br(Assembler::NE, nope);
2274 // if we store+flush with no intervening write tmp wil be zero
2275 stlxr(tmp, newv, addr);
2276 cbzw(tmp, succeed);
2277 // retry so we only ever return after a load fails to compare
2278 // ensures we don't return a stale value after a failed write.
2279 b(retry_load);
2280 // if the memory word differs we return it in oldv and signal a fail
2281 bind(nope);
2282 membar(AnyAny);
2283 mov(oldv, tmp);
2284 }
2285 if (fail)
2286 b(*fail);
2287 }
2288
2289 void MacroAssembler::cmpxchg_obj_header(Register oldv, Register newv, Register obj, Register tmp,
2290 Label &succeed, Label *fail) {
2291 assert(oopDesc::mark_offset_in_bytes() == 0, "assumption");
2292 cmpxchgptr(oldv, newv, obj, tmp, succeed, fail);
2293 }
2294
2295 void MacroAssembler::cmpxchgw(Register oldv, Register newv, Register addr, Register tmp,
2296 Label &succeed, Label *fail) {
2297 // oldv holds comparison value
2298 // newv holds value to write in exchange
2299 // addr identifies memory word to compare against/update
2300 // tmp returns 0/1 for success/failure
2301 if (UseLSE) {
2302 mov(tmp, oldv);
2303 casal(Assembler::word, oldv, newv, addr);
2304 cmp(tmp, oldv);
2305 br(Assembler::EQ, succeed);
2306 membar(AnyAny);
2307 } else {
2308 Label retry_load, nope;
2309 if ((VM_Version::features() & VM_Version::CPU_STXR_PREFETCH))
2310 prfm(Address(addr), PSTL1STRM);
2311 bind(retry_load);
2312 // flush and load exclusive from the memory location
2313 // and fail if it is not what we expect
2314 ldaxrw(tmp, addr);
2315 cmp(tmp, oldv);
2316 br(Assembler::NE, nope);
2317 // if we store+flush with no intervening write tmp wil be zero
2318 stlxrw(tmp, newv, addr);
2319 cbzw(tmp, succeed);
2320 // retry so we only ever return after a load fails to compare
2321 // ensures we don't return a stale value after a failed write.
2322 b(retry_load);
2323 // if the memory word differs we return it in oldv and signal a fail
2324 bind(nope);
2325 membar(AnyAny);
2326 mov(oldv, tmp);
2327 }
2328 if (fail)
2329 b(*fail);
2330 }
2331
2332 // A generic CAS; success or failure is in the EQ flag. A weak CAS
2333 // doesn't retry and may fail spuriously. If the oldval is wanted,
2334 // Pass a register for the result, otherwise pass noreg.
2335
2336 // Clobbers rscratch1
2337 void MacroAssembler::cmpxchg(Register addr, Register expected,
2338 Register new_val,
2339 enum operand_size size,
2340 bool acquire, bool release,
2341 bool weak,
2342 Register result) {
2343 if (result == noreg) result = rscratch1;
2344 if (UseLSE) {
2345 mov(result, expected);
2346 lse_cas(result, new_val, addr, size, acquire, release, /*not_pair*/ true);
2347 cmp(result, expected);
2348 } else {
2349 BLOCK_COMMENT("cmpxchg {");
2350 Label retry_load, done;
2351 if ((VM_Version::features() & VM_Version::CPU_STXR_PREFETCH))
2352 prfm(Address(addr), PSTL1STRM);
2353 bind(retry_load);
2354 load_exclusive(result, addr, size, acquire);
2355 if (size == xword)
2356 cmp(result, expected);
2357 else
2358 cmpw(result, expected);
2359 br(Assembler::NE, done);
2360 store_exclusive(rscratch1, new_val, addr, size, release);
2361 if (weak) {
2362 cmpw(rscratch1, 0u); // If the store fails, return NE to our caller.
2363 } else {
2364 cbnzw(rscratch1, retry_load);
2365 }
2366 bind(done);
2367 BLOCK_COMMENT("} cmpxchg");
2368 }
2369 }
2370
2371 static bool different(Register a, RegisterOrConstant b, Register c) {
2372 if (b.is_constant())
2373 return a != c;
2374 else
2375 return a != b.as_register() && a != c && b.as_register() != c;
2376 }
2377
2378 #define ATOMIC_OP(NAME, LDXR, OP, IOP, AOP, STXR, sz) \
2379 void MacroAssembler::atomic_##NAME(Register prev, RegisterOrConstant incr, Register addr) { \
2380 if (UseLSE) { \
2381 prev = prev->is_valid() ? prev : zr; \
2382 if (incr.is_register()) { \
2383 AOP(sz, incr.as_register(), prev, addr); \
2384 } else { \
2385 mov(rscratch2, incr.as_constant()); \
2386 AOP(sz, rscratch2, prev, addr); \
2387 } \
2388 return; \
2389 } \
2390 Register result = rscratch2; \
2391 if (prev->is_valid()) \
2392 result = different(prev, incr, addr) ? prev : rscratch2; \
2393 \
2394 Label retry_load; \
2395 if ((VM_Version::features() & VM_Version::CPU_STXR_PREFETCH)) \
2396 prfm(Address(addr), PSTL1STRM); \
2397 bind(retry_load); \
2398 LDXR(result, addr); \
2399 OP(rscratch1, result, incr); \
2400 STXR(rscratch2, rscratch1, addr); \
2401 cbnzw(rscratch2, retry_load); \
2402 if (prev->is_valid() && prev != result) { \
2403 IOP(prev, rscratch1, incr); \
2404 } \
2405 }
2406
2407 ATOMIC_OP(add, ldxr, add, sub, ldadd, stxr, Assembler::xword)
2408 ATOMIC_OP(addw, ldxrw, addw, subw, ldadd, stxrw, Assembler::word)
2409 ATOMIC_OP(addal, ldaxr, add, sub, ldaddal, stlxr, Assembler::xword)
2410 ATOMIC_OP(addalw, ldaxrw, addw, subw, ldaddal, stlxrw, Assembler::word)
2411
2412 #undef ATOMIC_OP
2413
2414 #define ATOMIC_XCHG(OP, AOP, LDXR, STXR, sz) \
2415 void MacroAssembler::atomic_##OP(Register prev, Register newv, Register addr) { \
2416 if (UseLSE) { \
2417 prev = prev->is_valid() ? prev : zr; \
2418 AOP(sz, newv, prev, addr); \
2419 return; \
2420 } \
2421 Register result = rscratch2; \
2422 if (prev->is_valid()) \
2423 result = different(prev, newv, addr) ? prev : rscratch2; \
2424 \
2425 Label retry_load; \
2426 if ((VM_Version::features() & VM_Version::CPU_STXR_PREFETCH)) \
2427 prfm(Address(addr), PSTL1STRM); \
2428 bind(retry_load); \
2429 LDXR(result, addr); \
2430 STXR(rscratch1, newv, addr); \
2431 cbnzw(rscratch1, retry_load); \
2432 if (prev->is_valid() && prev != result) \
2433 mov(prev, result); \
2434 }
2435
2436 ATOMIC_XCHG(xchg, swp, ldxr, stxr, Assembler::xword)
2437 ATOMIC_XCHG(xchgw, swp, ldxrw, stxrw, Assembler::word)
2438 ATOMIC_XCHG(xchgal, swpal, ldaxr, stlxr, Assembler::xword)
2439 ATOMIC_XCHG(xchgalw, swpal, ldaxrw, stlxrw, Assembler::word)
2440
2441 #undef ATOMIC_XCHG
2442
2443 void MacroAssembler::incr_allocated_bytes(Register thread,
2444 Register var_size_in_bytes,
2445 int con_size_in_bytes,
2446 Register t1) {
2447 if (!thread->is_valid()) {
2448 thread = rthread;
2449 }
2450 assert(t1->is_valid(), "need temp reg");
2451
2452 ldr(t1, Address(thread, in_bytes(JavaThread::allocated_bytes_offset())));
2453 if (var_size_in_bytes->is_valid()) {
2454 add(t1, t1, var_size_in_bytes);
2455 } else {
2456 add(t1, t1, con_size_in_bytes);
2457 }
2458 str(t1, Address(thread, in_bytes(JavaThread::allocated_bytes_offset())));
2459 }
2460
2461 #ifndef PRODUCT
2462 extern "C" void findpc(intptr_t x);
2463 #endif
2464
2465 void MacroAssembler::debug64(char* msg, int64_t pc, int64_t regs[])
2466 {
2467 // In order to get locks to work, we need to fake a in_VM state
2468 if (ShowMessageBoxOnError ) {
2469 JavaThread* thread = JavaThread::current();
2470 JavaThreadState saved_state = thread->thread_state();
2471 thread->set_thread_state(_thread_in_vm);
2472 #ifndef PRODUCT
2473 if (CountBytecodes || TraceBytecodes || StopInterpreterAt) {
2474 ttyLocker ttyl;
2475 BytecodeCounter::print();
2476 }
2477 #endif
2478 if (os::message_box(msg, "Execution stopped, print registers?")) {
2479 ttyLocker ttyl;
2480 tty->print_cr(" pc = 0x%016lx", pc);
2481 #ifndef PRODUCT
2482 tty->cr();
2483 findpc(pc);
2484 tty->cr();
2485 #endif
2486 tty->print_cr(" r0 = 0x%016lx", regs[0]);
2487 tty->print_cr(" r1 = 0x%016lx", regs[1]);
2488 tty->print_cr(" r2 = 0x%016lx", regs[2]);
2489 tty->print_cr(" r3 = 0x%016lx", regs[3]);
2490 tty->print_cr(" r4 = 0x%016lx", regs[4]);
2491 tty->print_cr(" r5 = 0x%016lx", regs[5]);
2492 tty->print_cr(" r6 = 0x%016lx", regs[6]);
2493 tty->print_cr(" r7 = 0x%016lx", regs[7]);
2494 tty->print_cr(" r8 = 0x%016lx", regs[8]);
2495 tty->print_cr(" r9 = 0x%016lx", regs[9]);
2496 tty->print_cr("r10 = 0x%016lx", regs[10]);
2497 tty->print_cr("r11 = 0x%016lx", regs[11]);
2498 tty->print_cr("r12 = 0x%016lx", regs[12]);
2499 tty->print_cr("r13 = 0x%016lx", regs[13]);
2500 tty->print_cr("r14 = 0x%016lx", regs[14]);
2501 tty->print_cr("r15 = 0x%016lx", regs[15]);
2502 tty->print_cr("r16 = 0x%016lx", regs[16]);
2503 tty->print_cr("r17 = 0x%016lx", regs[17]);
2504 tty->print_cr("r18 = 0x%016lx", regs[18]);
2505 tty->print_cr("r19 = 0x%016lx", regs[19]);
2506 tty->print_cr("r20 = 0x%016lx", regs[20]);
2507 tty->print_cr("r21 = 0x%016lx", regs[21]);
2508 tty->print_cr("r22 = 0x%016lx", regs[22]);
2509 tty->print_cr("r23 = 0x%016lx", regs[23]);
2510 tty->print_cr("r24 = 0x%016lx", regs[24]);
2511 tty->print_cr("r25 = 0x%016lx", regs[25]);
2512 tty->print_cr("r26 = 0x%016lx", regs[26]);
2513 tty->print_cr("r27 = 0x%016lx", regs[27]);
2514 tty->print_cr("r28 = 0x%016lx", regs[28]);
2515 tty->print_cr("r30 = 0x%016lx", regs[30]);
2516 tty->print_cr("r31 = 0x%016lx", regs[31]);
2517 BREAKPOINT;
2518 }
2519 ThreadStateTransition::transition(thread, _thread_in_vm, saved_state);
2520 } else {
2521 ttyLocker ttyl;
2522 ::tty->print_cr("=============== DEBUG MESSAGE: %s ================\n",
2523 msg);
2524 assert(false, "DEBUG MESSAGE: %s", msg);
2525 }
2526 }
2527
2528 #ifdef BUILTIN_SIM
2529 // routine to generate an x86 prolog for a stub function which
2530 // bootstraps into the generated ARM code which directly follows the
2531 // stub
2532 //
2533 // the argument encodes the number of general and fp registers
2534 // passed by the caller and the callng convention (currently just
2535 // the number of general registers and assumes C argument passing)
2536
2537 extern "C" {
2538 int aarch64_stub_prolog_size();
2539 void aarch64_stub_prolog();
2540 void aarch64_prolog();
2541 }
2542
2543 void MacroAssembler::c_stub_prolog(int gp_arg_count, int fp_arg_count, int ret_type,
2544 address *prolog_ptr)
2545 {
2546 int calltype = (((ret_type & 0x3) << 8) |
2547 ((fp_arg_count & 0xf) << 4) |
2548 (gp_arg_count & 0xf));
2549
2550 // the addresses for the x86 to ARM entry code we need to use
2551 address start = pc();
2552 // printf("start = %lx\n", start);
2553 int byteCount = aarch64_stub_prolog_size();
2554 // printf("byteCount = %x\n", byteCount);
2555 int instructionCount = (byteCount + 3)/ 4;
2556 // printf("instructionCount = %x\n", instructionCount);
2557 for (int i = 0; i < instructionCount; i++) {
2558 nop();
2559 }
2560
2561 memcpy(start, (void*)aarch64_stub_prolog, byteCount);
2562
2563 // write the address of the setup routine and the call format at the
2564 // end of into the copied code
2565 u_int64_t *patch_end = (u_int64_t *)(start + byteCount);
2566 if (prolog_ptr)
2567 patch_end[-2] = (u_int64_t)prolog_ptr;
2568 patch_end[-1] = calltype;
2569 }
2570 #endif
2571
2572 void MacroAssembler::push_call_clobbered_registers() {
2573 push(RegSet::range(r0, r18) - RegSet::of(rscratch1, rscratch2), sp);
2574
2575 // Push v0-v7, v16-v31.
2576 for (int i = 30; i >= 0; i -= 2) {
2577 if (i <= v7->encoding() || i >= v16->encoding()) {
2578 stpd(as_FloatRegister(i), as_FloatRegister(i+1),
2579 Address(pre(sp, -2 * wordSize)));
2580 }
2581 }
2582 }
2583
2584 void MacroAssembler::pop_call_clobbered_registers() {
2585
2586 for (int i = 0; i < 32; i += 2) {
2587 if (i <= v7->encoding() || i >= v16->encoding()) {
2588 ldpd(as_FloatRegister(i), as_FloatRegister(i+1),
2589 Address(post(sp, 2 * wordSize)));
2590 }
2591 }
2592
2593 pop(RegSet::range(r0, r18) - RegSet::of(rscratch1, rscratch2), sp);
2594 }
2595
2596 void MacroAssembler::push_CPU_state(bool save_vectors) {
2597 push(0x3fffffff, sp); // integer registers except lr & sp
2598
2599 if (!save_vectors) {
2600 for (int i = 30; i >= 0; i -= 2)
2601 stpd(as_FloatRegister(i), as_FloatRegister(i+1),
2602 Address(pre(sp, -2 * wordSize)));
2603 } else {
2604 for (int i = 30; i >= 0; i -= 2)
2605 stpq(as_FloatRegister(i), as_FloatRegister(i+1),
2606 Address(pre(sp, -4 * wordSize)));
2607 }
2608 }
2609
2610 void MacroAssembler::pop_CPU_state(bool restore_vectors) {
2611 if (!restore_vectors) {
2612 for (int i = 0; i < 32; i += 2)
2613 ldpd(as_FloatRegister(i), as_FloatRegister(i+1),
2614 Address(post(sp, 2 * wordSize)));
2615 } else {
2616 for (int i = 0; i < 32; i += 2)
2617 ldpq(as_FloatRegister(i), as_FloatRegister(i+1),
2618 Address(post(sp, 4 * wordSize)));
2619 }
2620
2621 pop(0x3fffffff, sp); // integer registers except lr & sp
2622 }
2623
2624 /**
2625 * Helpers for multiply_to_len().
2626 */
2627 void MacroAssembler::add2_with_carry(Register final_dest_hi, Register dest_hi, Register dest_lo,
2628 Register src1, Register src2) {
2629 adds(dest_lo, dest_lo, src1);
2630 adc(dest_hi, dest_hi, zr);
2631 adds(dest_lo, dest_lo, src2);
2632 adc(final_dest_hi, dest_hi, zr);
2633 }
2634
2635 // Generate an address from (r + r1 extend offset). "size" is the
2636 // size of the operand. The result may be in rscratch2.
2637 Address MacroAssembler::offsetted_address(Register r, Register r1,
2638 Address::extend ext, int offset, int size) {
2639 if (offset || (ext.shift() % size != 0)) {
2640 lea(rscratch2, Address(r, r1, ext));
2641 return Address(rscratch2, offset);
2642 } else {
2643 return Address(r, r1, ext);
2644 }
2645 }
2646
2647 Address MacroAssembler::spill_address(int size, int offset, Register tmp)
2648 {
2649 assert(offset >= 0, "spill to negative address?");
2650 // Offset reachable ?
2651 // Not aligned - 9 bits signed offset
2652 // Aligned - 12 bits unsigned offset shifted
2653 Register base = sp;
2654 if ((offset & (size-1)) && offset >= (1<<8)) {
2655 add(tmp, base, offset & ((1<<12)-1));
2656 base = tmp;
2657 offset &= -1<<12;
2658 }
2659
2660 if (offset >= (1<<12) * size) {
2661 add(tmp, base, offset & (((1<<12)-1)<<12));
2662 base = tmp;
2663 offset &= ~(((1<<12)-1)<<12);
2664 }
2665
2666 return Address(base, offset);
2667 }
2668
2669 // Checks whether offset is aligned.
2670 // Returns true if it is, else false.
2671 bool MacroAssembler::merge_alignment_check(Register base,
2672 size_t size,
2673 long cur_offset,
2674 long prev_offset) const {
2675 if (AvoidUnalignedAccesses) {
2676 if (base == sp) {
2677 // Checks whether low offset if aligned to pair of registers.
2678 long pair_mask = size * 2 - 1;
2679 long offset = prev_offset > cur_offset ? cur_offset : prev_offset;
2680 return (offset & pair_mask) == 0;
2681 } else { // If base is not sp, we can't guarantee the access is aligned.
2682 return false;
2683 }
2684 } else {
2685 long mask = size - 1;
2686 // Load/store pair instruction only supports element size aligned offset.
2687 return (cur_offset & mask) == 0 && (prev_offset & mask) == 0;
2688 }
2689 }
2690
2691 // Checks whether current and previous loads/stores can be merged.
2692 // Returns true if it can be merged, else false.
2693 bool MacroAssembler::ldst_can_merge(Register rt,
2694 const Address &adr,
2695 size_t cur_size_in_bytes,
2696 bool is_store) const {
2697 address prev = pc() - NativeInstruction::instruction_size;
2698 address last = code()->last_insn();
2699
2700 if (last == NULL || !nativeInstruction_at(last)->is_Imm_LdSt()) {
2701 return false;
2702 }
2703
2704 if (adr.getMode() != Address::base_plus_offset || prev != last) {
2705 return false;
2706 }
2707
2708 NativeLdSt* prev_ldst = NativeLdSt_at(prev);
2709 size_t prev_size_in_bytes = prev_ldst->size_in_bytes();
2710
2711 assert(prev_size_in_bytes == 4 || prev_size_in_bytes == 8, "only supports 64/32bit merging.");
2712 assert(cur_size_in_bytes == 4 || cur_size_in_bytes == 8, "only supports 64/32bit merging.");
2713
2714 if (cur_size_in_bytes != prev_size_in_bytes || is_store != prev_ldst->is_store()) {
2715 return false;
2716 }
2717
2718 long max_offset = 63 * prev_size_in_bytes;
2719 long min_offset = -64 * prev_size_in_bytes;
2720
2721 assert(prev_ldst->is_not_pre_post_index(), "pre-index or post-index is not supported to be merged.");
2722
2723 // Only same base can be merged.
2724 if (adr.base() != prev_ldst->base()) {
2725 return false;
2726 }
2727
2728 long cur_offset = adr.offset();
2729 long prev_offset = prev_ldst->offset();
2730 size_t diff = abs(cur_offset - prev_offset);
2731 if (diff != prev_size_in_bytes) {
2732 return false;
2733 }
2734
2735 // Following cases can not be merged:
2736 // ldr x2, [x2, #8]
2737 // ldr x3, [x2, #16]
2738 // or:
2739 // ldr x2, [x3, #8]
2740 // ldr x2, [x3, #16]
2741 // If t1 and t2 is the same in "ldp t1, t2, [xn, #imm]", we'll get SIGILL.
2742 if (!is_store && (adr.base() == prev_ldst->target() || rt == prev_ldst->target())) {
2743 return false;
2744 }
2745
2746 long low_offset = prev_offset > cur_offset ? cur_offset : prev_offset;
2747 // Offset range must be in ldp/stp instruction's range.
2748 if (low_offset > max_offset || low_offset < min_offset) {
2749 return false;
2750 }
2751
2752 if (merge_alignment_check(adr.base(), prev_size_in_bytes, cur_offset, prev_offset)) {
2753 return true;
2754 }
2755
2756 return false;
2757 }
2758
2759 // Merge current load/store with previous load/store into ldp/stp.
2760 void MacroAssembler::merge_ldst(Register rt,
2761 const Address &adr,
2762 size_t cur_size_in_bytes,
2763 bool is_store) {
2764
2765 assert(ldst_can_merge(rt, adr, cur_size_in_bytes, is_store) == true, "cur and prev must be able to be merged.");
2766
2767 Register rt_low, rt_high;
2768 address prev = pc() - NativeInstruction::instruction_size;
2769 NativeLdSt* prev_ldst = NativeLdSt_at(prev);
2770
2771 long offset;
2772
2773 if (adr.offset() < prev_ldst->offset()) {
2774 offset = adr.offset();
2775 rt_low = rt;
2776 rt_high = prev_ldst->target();
2777 } else {
2778 offset = prev_ldst->offset();
2779 rt_low = prev_ldst->target();
2780 rt_high = rt;
2781 }
2782
2783 Address adr_p = Address(prev_ldst->base(), offset);
2784 // Overwrite previous generated binary.
2785 code_section()->set_end(prev);
2786
2787 const int sz = prev_ldst->size_in_bytes();
2788 assert(sz == 8 || sz == 4, "only supports 64/32bit merging.");
2789 if (!is_store) {
2790 BLOCK_COMMENT("merged ldr pair");
2791 if (sz == 8) {
2792 ldp(rt_low, rt_high, adr_p);
2793 } else {
2794 ldpw(rt_low, rt_high, adr_p);
2795 }
2796 } else {
2797 BLOCK_COMMENT("merged str pair");
2798 if (sz == 8) {
2799 stp(rt_low, rt_high, adr_p);
2800 } else {
2801 stpw(rt_low, rt_high, adr_p);
2802 }
2803 }
2804 }
2805
2806 /**
2807 * Multiply 64 bit by 64 bit first loop.
2808 */
2809 void MacroAssembler::multiply_64_x_64_loop(Register x, Register xstart, Register x_xstart,
2810 Register y, Register y_idx, Register z,
2811 Register carry, Register product,
2812 Register idx, Register kdx) {
2813 //
2814 // jlong carry, x[], y[], z[];
2815 // for (int idx=ystart, kdx=ystart+1+xstart; idx >= 0; idx-, kdx--) {
2816 // huge_128 product = y[idx] * x[xstart] + carry;
2817 // z[kdx] = (jlong)product;
2818 // carry = (jlong)(product >>> 64);
2819 // }
2820 // z[xstart] = carry;
2821 //
2822
2823 Label L_first_loop, L_first_loop_exit;
2824 Label L_one_x, L_one_y, L_multiply;
2825
2826 subsw(xstart, xstart, 1);
2827 br(Assembler::MI, L_one_x);
2828
2829 lea(rscratch1, Address(x, xstart, Address::lsl(LogBytesPerInt)));
2830 ldr(x_xstart, Address(rscratch1));
2831 ror(x_xstart, x_xstart, 32); // convert big-endian to little-endian
2832
2833 bind(L_first_loop);
2834 subsw(idx, idx, 1);
2835 br(Assembler::MI, L_first_loop_exit);
2836 subsw(idx, idx, 1);
2837 br(Assembler::MI, L_one_y);
2838 lea(rscratch1, Address(y, idx, Address::uxtw(LogBytesPerInt)));
2839 ldr(y_idx, Address(rscratch1));
2840 ror(y_idx, y_idx, 32); // convert big-endian to little-endian
2841 bind(L_multiply);
2842
2843 // AArch64 has a multiply-accumulate instruction that we can't use
2844 // here because it has no way to process carries, so we have to use
2845 // separate add and adc instructions. Bah.
2846 umulh(rscratch1, x_xstart, y_idx); // x_xstart * y_idx -> rscratch1:product
2847 mul(product, x_xstart, y_idx);
2848 adds(product, product, carry);
2849 adc(carry, rscratch1, zr); // x_xstart * y_idx + carry -> carry:product
2850
2851 subw(kdx, kdx, 2);
2852 ror(product, product, 32); // back to big-endian
2853 str(product, offsetted_address(z, kdx, Address::uxtw(LogBytesPerInt), 0, BytesPerLong));
2854
2855 b(L_first_loop);
2856
2857 bind(L_one_y);
2858 ldrw(y_idx, Address(y, 0));
2859 b(L_multiply);
2860
2861 bind(L_one_x);
2862 ldrw(x_xstart, Address(x, 0));
2863 b(L_first_loop);
2864
2865 bind(L_first_loop_exit);
2866 }
2867
2868 /**
2869 * Multiply 128 bit by 128. Unrolled inner loop.
2870 *
2871 */
2872 void MacroAssembler::multiply_128_x_128_loop(Register y, Register z,
2873 Register carry, Register carry2,
2874 Register idx, Register jdx,
2875 Register yz_idx1, Register yz_idx2,
2876 Register tmp, Register tmp3, Register tmp4,
2877 Register tmp6, Register product_hi) {
2878
2879 // jlong carry, x[], y[], z[];
2880 // int kdx = ystart+1;
2881 // for (int idx=ystart-2; idx >= 0; idx -= 2) { // Third loop
2882 // huge_128 tmp3 = (y[idx+1] * product_hi) + z[kdx+idx+1] + carry;
2883 // jlong carry2 = (jlong)(tmp3 >>> 64);
2884 // huge_128 tmp4 = (y[idx] * product_hi) + z[kdx+idx] + carry2;
2885 // carry = (jlong)(tmp4 >>> 64);
2886 // z[kdx+idx+1] = (jlong)tmp3;
2887 // z[kdx+idx] = (jlong)tmp4;
2888 // }
2889 // idx += 2;
2890 // if (idx > 0) {
2891 // yz_idx1 = (y[idx] * product_hi) + z[kdx+idx] + carry;
2892 // z[kdx+idx] = (jlong)yz_idx1;
2893 // carry = (jlong)(yz_idx1 >>> 64);
2894 // }
2895 //
2896
2897 Label L_third_loop, L_third_loop_exit, L_post_third_loop_done;
2898
2899 lsrw(jdx, idx, 2);
2900
2901 bind(L_third_loop);
2902
2903 subsw(jdx, jdx, 1);
2904 br(Assembler::MI, L_third_loop_exit);
2905 subw(idx, idx, 4);
2906
2907 lea(rscratch1, Address(y, idx, Address::uxtw(LogBytesPerInt)));
2908
2909 ldp(yz_idx2, yz_idx1, Address(rscratch1, 0));
2910
2911 lea(tmp6, Address(z, idx, Address::uxtw(LogBytesPerInt)));
2912
2913 ror(yz_idx1, yz_idx1, 32); // convert big-endian to little-endian
2914 ror(yz_idx2, yz_idx2, 32);
2915
2916 ldp(rscratch2, rscratch1, Address(tmp6, 0));
2917
2918 mul(tmp3, product_hi, yz_idx1); // yz_idx1 * product_hi -> tmp4:tmp3
2919 umulh(tmp4, product_hi, yz_idx1);
2920
2921 ror(rscratch1, rscratch1, 32); // convert big-endian to little-endian
2922 ror(rscratch2, rscratch2, 32);
2923
2924 mul(tmp, product_hi, yz_idx2); // yz_idx2 * product_hi -> carry2:tmp
2925 umulh(carry2, product_hi, yz_idx2);
2926
2927 // propagate sum of both multiplications into carry:tmp4:tmp3
2928 adds(tmp3, tmp3, carry);
2929 adc(tmp4, tmp4, zr);
2930 adds(tmp3, tmp3, rscratch1);
2931 adcs(tmp4, tmp4, tmp);
2932 adc(carry, carry2, zr);
2933 adds(tmp4, tmp4, rscratch2);
2934 adc(carry, carry, zr);
2935
2936 ror(tmp3, tmp3, 32); // convert little-endian to big-endian
2937 ror(tmp4, tmp4, 32);
2938 stp(tmp4, tmp3, Address(tmp6, 0));
2939
2940 b(L_third_loop);
2941 bind (L_third_loop_exit);
2942
2943 andw (idx, idx, 0x3);
2944 cbz(idx, L_post_third_loop_done);
2945
2946 Label L_check_1;
2947 subsw(idx, idx, 2);
2948 br(Assembler::MI, L_check_1);
2949
2950 lea(rscratch1, Address(y, idx, Address::uxtw(LogBytesPerInt)));
2951 ldr(yz_idx1, Address(rscratch1, 0));
2952 ror(yz_idx1, yz_idx1, 32);
2953 mul(tmp3, product_hi, yz_idx1); // yz_idx1 * product_hi -> tmp4:tmp3
2954 umulh(tmp4, product_hi, yz_idx1);
2955 lea(rscratch1, Address(z, idx, Address::uxtw(LogBytesPerInt)));
2956 ldr(yz_idx2, Address(rscratch1, 0));
2957 ror(yz_idx2, yz_idx2, 32);
2958
2959 add2_with_carry(carry, tmp4, tmp3, carry, yz_idx2);
2960
2961 ror(tmp3, tmp3, 32);
2962 str(tmp3, Address(rscratch1, 0));
2963
2964 bind (L_check_1);
2965
2966 andw (idx, idx, 0x1);
2967 subsw(idx, idx, 1);
2968 br(Assembler::MI, L_post_third_loop_done);
2969 ldrw(tmp4, Address(y, idx, Address::uxtw(LogBytesPerInt)));
2970 mul(tmp3, tmp4, product_hi); // tmp4 * product_hi -> carry2:tmp3
2971 umulh(carry2, tmp4, product_hi);
2972 ldrw(tmp4, Address(z, idx, Address::uxtw(LogBytesPerInt)));
2973
2974 add2_with_carry(carry2, tmp3, tmp4, carry);
2975
2976 strw(tmp3, Address(z, idx, Address::uxtw(LogBytesPerInt)));
2977 extr(carry, carry2, tmp3, 32);
2978
2979 bind(L_post_third_loop_done);
2980 }
2981
2982 /**
2983 * Code for BigInteger::multiplyToLen() instrinsic.
2984 *
2985 * r0: x
2986 * r1: xlen
2987 * r2: y
2988 * r3: ylen
2989 * r4: z
2990 * r5: zlen
2991 * r10: tmp1
2992 * r11: tmp2
2993 * r12: tmp3
2994 * r13: tmp4
2995 * r14: tmp5
2996 * r15: tmp6
2997 * r16: tmp7
2998 *
2999 */
3000 void MacroAssembler::multiply_to_len(Register x, Register xlen, Register y, Register ylen,
3001 Register z, Register zlen,
3002 Register tmp1, Register tmp2, Register tmp3, Register tmp4,
3003 Register tmp5, Register tmp6, Register product_hi) {
3004
3005 assert_different_registers(x, xlen, y, ylen, z, zlen, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6);
3006
3007 const Register idx = tmp1;
3008 const Register kdx = tmp2;
3009 const Register xstart = tmp3;
3010
3011 const Register y_idx = tmp4;
3012 const Register carry = tmp5;
3013 const Register product = xlen;
3014 const Register x_xstart = zlen; // reuse register
3015
3016 // First Loop.
3017 //
3018 // final static long LONG_MASK = 0xffffffffL;
3019 // int xstart = xlen - 1;
3020 // int ystart = ylen - 1;
3021 // long carry = 0;
3022 // for (int idx=ystart, kdx=ystart+1+xstart; idx >= 0; idx-, kdx--) {
3023 // long product = (y[idx] & LONG_MASK) * (x[xstart] & LONG_MASK) + carry;
3024 // z[kdx] = (int)product;
3025 // carry = product >>> 32;
3026 // }
3027 // z[xstart] = (int)carry;
3028 //
3029
3030 movw(idx, ylen); // idx = ylen;
3031 movw(kdx, zlen); // kdx = xlen+ylen;
3032 mov(carry, zr); // carry = 0;
3033
3034 Label L_done;
3035
3036 movw(xstart, xlen);
3037 subsw(xstart, xstart, 1);
3038 br(Assembler::MI, L_done);
3039
3040 multiply_64_x_64_loop(x, xstart, x_xstart, y, y_idx, z, carry, product, idx, kdx);
3041
3042 Label L_second_loop;
3043 cbzw(kdx, L_second_loop);
3044
3045 Label L_carry;
3046 subw(kdx, kdx, 1);
3047 cbzw(kdx, L_carry);
3048
3049 strw(carry, Address(z, kdx, Address::uxtw(LogBytesPerInt)));
3050 lsr(carry, carry, 32);
3051 subw(kdx, kdx, 1);
3052
3053 bind(L_carry);
3054 strw(carry, Address(z, kdx, Address::uxtw(LogBytesPerInt)));
3055
3056 // Second and third (nested) loops.
3057 //
3058 // for (int i = xstart-1; i >= 0; i--) { // Second loop
3059 // carry = 0;
3060 // for (int jdx=ystart, k=ystart+1+i; jdx >= 0; jdx--, k--) { // Third loop
3061 // long product = (y[jdx] & LONG_MASK) * (x[i] & LONG_MASK) +
3062 // (z[k] & LONG_MASK) + carry;
3063 // z[k] = (int)product;
3064 // carry = product >>> 32;
3065 // }
3066 // z[i] = (int)carry;
3067 // }
3068 //
3069 // i = xlen, j = tmp1, k = tmp2, carry = tmp5, x[i] = product_hi
3070
3071 const Register jdx = tmp1;
3072
3073 bind(L_second_loop);
3074 mov(carry, zr); // carry = 0;
3075 movw(jdx, ylen); // j = ystart+1
3076
3077 subsw(xstart, xstart, 1); // i = xstart-1;
3078 br(Assembler::MI, L_done);
3079
3080 str(z, Address(pre(sp, -4 * wordSize)));
3081
3082 Label L_last_x;
3083 lea(z, offsetted_address(z, xstart, Address::uxtw(LogBytesPerInt), 4, BytesPerInt)); // z = z + k - j
3084 subsw(xstart, xstart, 1); // i = xstart-1;
3085 br(Assembler::MI, L_last_x);
3086
3087 lea(rscratch1, Address(x, xstart, Address::uxtw(LogBytesPerInt)));
3088 ldr(product_hi, Address(rscratch1));
3089 ror(product_hi, product_hi, 32); // convert big-endian to little-endian
3090
3091 Label L_third_loop_prologue;
3092 bind(L_third_loop_prologue);
3093
3094 str(ylen, Address(sp, wordSize));
3095 stp(x, xstart, Address(sp, 2 * wordSize));
3096 multiply_128_x_128_loop(y, z, carry, x, jdx, ylen, product,
3097 tmp2, x_xstart, tmp3, tmp4, tmp6, product_hi);
3098 ldp(z, ylen, Address(post(sp, 2 * wordSize)));
3099 ldp(x, xlen, Address(post(sp, 2 * wordSize))); // copy old xstart -> xlen
3100
3101 addw(tmp3, xlen, 1);
3102 strw(carry, Address(z, tmp3, Address::uxtw(LogBytesPerInt)));
3103 subsw(tmp3, tmp3, 1);
3104 br(Assembler::MI, L_done);
3105
3106 lsr(carry, carry, 32);
3107 strw(carry, Address(z, tmp3, Address::uxtw(LogBytesPerInt)));
3108 b(L_second_loop);
3109
3110 // Next infrequent code is moved outside loops.
3111 bind(L_last_x);
3112 ldrw(product_hi, Address(x, 0));
3113 b(L_third_loop_prologue);
3114
3115 bind(L_done);
3116 }
3117
3118 // Code for BigInteger::mulAdd instrinsic
3119 // out = r0
3120 // in = r1
3121 // offset = r2 (already out.length-offset)
3122 // len = r3
3123 // k = r4
3124 //
3125 // pseudo code from java implementation:
3126 // carry = 0;
3127 // offset = out.length-offset - 1;
3128 // for (int j=len-1; j >= 0; j--) {
3129 // product = (in[j] & LONG_MASK) * kLong + (out[offset] & LONG_MASK) + carry;
3130 // out[offset--] = (int)product;
3131 // carry = product >>> 32;
3132 // }
3133 // return (int)carry;
3134 void MacroAssembler::mul_add(Register out, Register in, Register offset,
3135 Register len, Register k) {
3136 Label LOOP, END;
3137 // pre-loop
3138 cmp(len, zr); // cmp, not cbz/cbnz: to use condition twice => less branches
3139 csel(out, zr, out, Assembler::EQ);
3140 br(Assembler::EQ, END);
3141 add(in, in, len, LSL, 2); // in[j+1] address
3142 add(offset, out, offset, LSL, 2); // out[offset + 1] address
3143 mov(out, zr); // used to keep carry now
3144 BIND(LOOP);
3145 ldrw(rscratch1, Address(pre(in, -4)));
3146 madd(rscratch1, rscratch1, k, out);
3147 ldrw(rscratch2, Address(pre(offset, -4)));
3148 add(rscratch1, rscratch1, rscratch2);
3149 strw(rscratch1, Address(offset));
3150 lsr(out, rscratch1, 32);
3151 subs(len, len, 1);
3152 br(Assembler::NE, LOOP);
3153 BIND(END);
3154 }
3155
3156 /**
3157 * Emits code to update CRC-32 with a byte value according to constants in table
3158 *
3159 * @param [in,out]crc Register containing the crc.
3160 * @param [in]val Register containing the byte to fold into the CRC.
3161 * @param [in]table Register containing the table of crc constants.
3162 *
3163 * uint32_t crc;
3164 * val = crc_table[(val ^ crc) & 0xFF];
3165 * crc = val ^ (crc >> 8);
3166 *
3167 */
3168 void MacroAssembler::update_byte_crc32(Register crc, Register val, Register table) {
3169 eor(val, val, crc);
3170 andr(val, val, 0xff);
3171 ldrw(val, Address(table, val, Address::lsl(2)));
3172 eor(crc, val, crc, Assembler::LSR, 8);
3173 }
3174
3175 /**
3176 * Emits code to update CRC-32 with a 32-bit value according to tables 0 to 3
3177 *
3178 * @param [in,out]crc Register containing the crc.
3179 * @param [in]v Register containing the 32-bit to fold into the CRC.
3180 * @param [in]table0 Register containing table 0 of crc constants.
3181 * @param [in]table1 Register containing table 1 of crc constants.
3182 * @param [in]table2 Register containing table 2 of crc constants.
3183 * @param [in]table3 Register containing table 3 of crc constants.
3184 *
3185 * uint32_t crc;
3186 * v = crc ^ v
3187 * crc = table3[v&0xff]^table2[(v>>8)&0xff]^table1[(v>>16)&0xff]^table0[v>>24]
3188 *
3189 */
3190 void MacroAssembler::update_word_crc32(Register crc, Register v, Register tmp,
3191 Register table0, Register table1, Register table2, Register table3,
3192 bool upper) {
3193 eor(v, crc, v, upper ? LSR:LSL, upper ? 32:0);
3194 uxtb(tmp, v);
3195 ldrw(crc, Address(table3, tmp, Address::lsl(2)));
3196 ubfx(tmp, v, 8, 8);
3197 ldrw(tmp, Address(table2, tmp, Address::lsl(2)));
3198 eor(crc, crc, tmp);
3199 ubfx(tmp, v, 16, 8);
3200 ldrw(tmp, Address(table1, tmp, Address::lsl(2)));
3201 eor(crc, crc, tmp);
3202 ubfx(tmp, v, 24, 8);
3203 ldrw(tmp, Address(table0, tmp, Address::lsl(2)));
3204 eor(crc, crc, tmp);
3205 }
3206
3207 void MacroAssembler::kernel_crc32_using_crc32(Register crc, Register buf,
3208 Register len, Register tmp0, Register tmp1, Register tmp2,
3209 Register tmp3) {
3210 Label CRC_by64_loop, CRC_by4_loop, CRC_by1_loop, CRC_less64, CRC_by64_pre, CRC_by32_loop, CRC_less32, L_exit;
3211 assert_different_registers(crc, buf, len, tmp0, tmp1, tmp2, tmp3);
3212
3213 mvnw(crc, crc);
3214
3215 subs(len, len, 128);
3216 br(Assembler::GE, CRC_by64_pre);
3217 BIND(CRC_less64);
3218 adds(len, len, 128-32);
3219 br(Assembler::GE, CRC_by32_loop);
3220 BIND(CRC_less32);
3221 adds(len, len, 32-4);
3222 br(Assembler::GE, CRC_by4_loop);
3223 adds(len, len, 4);
3224 br(Assembler::GT, CRC_by1_loop);
3225 b(L_exit);
3226
3227 BIND(CRC_by32_loop);
3228 ldp(tmp0, tmp1, Address(post(buf, 16)));
3229 subs(len, len, 32);
3230 crc32x(crc, crc, tmp0);
3231 ldr(tmp2, Address(post(buf, 8)));
3232 crc32x(crc, crc, tmp1);
3233 ldr(tmp3, Address(post(buf, 8)));
3234 crc32x(crc, crc, tmp2);
3235 crc32x(crc, crc, tmp3);
3236 br(Assembler::GE, CRC_by32_loop);
3237 cmn(len, 32);
3238 br(Assembler::NE, CRC_less32);
3239 b(L_exit);
3240
3241 BIND(CRC_by4_loop);
3242 ldrw(tmp0, Address(post(buf, 4)));
3243 subs(len, len, 4);
3244 crc32w(crc, crc, tmp0);
3245 br(Assembler::GE, CRC_by4_loop);
3246 adds(len, len, 4);
3247 br(Assembler::LE, L_exit);
3248 BIND(CRC_by1_loop);
3249 ldrb(tmp0, Address(post(buf, 1)));
3250 subs(len, len, 1);
3251 crc32b(crc, crc, tmp0);
3252 br(Assembler::GT, CRC_by1_loop);
3253 b(L_exit);
3254
3255 BIND(CRC_by64_pre);
3256 sub(buf, buf, 8);
3257 ldp(tmp0, tmp1, Address(buf, 8));
3258 crc32x(crc, crc, tmp0);
3259 ldr(tmp2, Address(buf, 24));
3260 crc32x(crc, crc, tmp1);
3261 ldr(tmp3, Address(buf, 32));
3262 crc32x(crc, crc, tmp2);
3263 ldr(tmp0, Address(buf, 40));
3264 crc32x(crc, crc, tmp3);
3265 ldr(tmp1, Address(buf, 48));
3266 crc32x(crc, crc, tmp0);
3267 ldr(tmp2, Address(buf, 56));
3268 crc32x(crc, crc, tmp1);
3269 ldr(tmp3, Address(pre(buf, 64)));
3270
3271 b(CRC_by64_loop);
3272
3273 align(CodeEntryAlignment);
3274 BIND(CRC_by64_loop);
3275 subs(len, len, 64);
3276 crc32x(crc, crc, tmp2);
3277 ldr(tmp0, Address(buf, 8));
3278 crc32x(crc, crc, tmp3);
3279 ldr(tmp1, Address(buf, 16));
3280 crc32x(crc, crc, tmp0);
3281 ldr(tmp2, Address(buf, 24));
3282 crc32x(crc, crc, tmp1);
3283 ldr(tmp3, Address(buf, 32));
3284 crc32x(crc, crc, tmp2);
3285 ldr(tmp0, Address(buf, 40));
3286 crc32x(crc, crc, tmp3);
3287 ldr(tmp1, Address(buf, 48));
3288 crc32x(crc, crc, tmp0);
3289 ldr(tmp2, Address(buf, 56));
3290 crc32x(crc, crc, tmp1);
3291 ldr(tmp3, Address(pre(buf, 64)));
3292 br(Assembler::GE, CRC_by64_loop);
3293
3294 // post-loop
3295 crc32x(crc, crc, tmp2);
3296 crc32x(crc, crc, tmp3);
3297
3298 sub(len, len, 64);
3299 add(buf, buf, 8);
3300 cmn(len, 128);
3301 br(Assembler::NE, CRC_less64);
3302 BIND(L_exit);
3303 mvnw(crc, crc);
3304 }
3305
3306 /**
3307 * @param crc register containing existing CRC (32-bit)
3308 * @param buf register pointing to input byte buffer (byte*)
3309 * @param len register containing number of bytes
3310 * @param table register that will contain address of CRC table
3311 * @param tmp scratch register
3312 */
3313 void MacroAssembler::kernel_crc32(Register crc, Register buf, Register len,
3314 Register table0, Register table1, Register table2, Register table3,
3315 Register tmp, Register tmp2, Register tmp3) {
3316 Label L_by16, L_by16_loop, L_by4, L_by4_loop, L_by1, L_by1_loop, L_exit;
3317 unsigned long offset;
3318
3319 if (UseCRC32) {
3320 kernel_crc32_using_crc32(crc, buf, len, table0, table1, table2, table3);
3321 return;
3322 }
3323
3324 mvnw(crc, crc);
3325
3326 adrp(table0, ExternalAddress(StubRoutines::crc_table_addr()), offset);
3327 if (offset) add(table0, table0, offset);
3328 add(table1, table0, 1*256*sizeof(juint));
3329 add(table2, table0, 2*256*sizeof(juint));
3330 add(table3, table0, 3*256*sizeof(juint));
3331
3332 if (UseNeon) {
3333 cmp(len, 64);
3334 br(Assembler::LT, L_by16);
3335 eor(v16, T16B, v16, v16);
3336
3337 Label L_fold;
3338
3339 add(tmp, table0, 4*256*sizeof(juint)); // Point at the Neon constants
3340
3341 ld1(v0, v1, T2D, post(buf, 32));
3342 ld1r(v4, T2D, post(tmp, 8));
3343 ld1r(v5, T2D, post(tmp, 8));
3344 ld1r(v6, T2D, post(tmp, 8));
3345 ld1r(v7, T2D, post(tmp, 8));
3346 mov(v16, T4S, 0, crc);
3347
3348 eor(v0, T16B, v0, v16);
3349 sub(len, len, 64);
3350
3351 BIND(L_fold);
3352 pmull(v22, T8H, v0, v5, T8B);
3353 pmull(v20, T8H, v0, v7, T8B);
3354 pmull(v23, T8H, v0, v4, T8B);
3355 pmull(v21, T8H, v0, v6, T8B);
3356
3357 pmull2(v18, T8H, v0, v5, T16B);
3358 pmull2(v16, T8H, v0, v7, T16B);
3359 pmull2(v19, T8H, v0, v4, T16B);
3360 pmull2(v17, T8H, v0, v6, T16B);
3361
3362 uzp1(v24, v20, v22, T8H);
3363 uzp2(v25, v20, v22, T8H);
3364 eor(v20, T16B, v24, v25);
3365
3366 uzp1(v26, v16, v18, T8H);
3367 uzp2(v27, v16, v18, T8H);
3368 eor(v16, T16B, v26, v27);
3369
3370 ushll2(v22, T4S, v20, T8H, 8);
3371 ushll(v20, T4S, v20, T4H, 8);
3372
3373 ushll2(v18, T4S, v16, T8H, 8);
3374 ushll(v16, T4S, v16, T4H, 8);
3375
3376 eor(v22, T16B, v23, v22);
3377 eor(v18, T16B, v19, v18);
3378 eor(v20, T16B, v21, v20);
3379 eor(v16, T16B, v17, v16);
3380
3381 uzp1(v17, v16, v20, T2D);
3382 uzp2(v21, v16, v20, T2D);
3383 eor(v17, T16B, v17, v21);
3384
3385 ushll2(v20, T2D, v17, T4S, 16);
3386 ushll(v16, T2D, v17, T2S, 16);
3387
3388 eor(v20, T16B, v20, v22);
3389 eor(v16, T16B, v16, v18);
3390
3391 uzp1(v17, v20, v16, T2D);
3392 uzp2(v21, v20, v16, T2D);
3393 eor(v28, T16B, v17, v21);
3394
3395 pmull(v22, T8H, v1, v5, T8B);
3396 pmull(v20, T8H, v1, v7, T8B);
3397 pmull(v23, T8H, v1, v4, T8B);
3398 pmull(v21, T8H, v1, v6, T8B);
3399
3400 pmull2(v18, T8H, v1, v5, T16B);
3401 pmull2(v16, T8H, v1, v7, T16B);
3402 pmull2(v19, T8H, v1, v4, T16B);
3403 pmull2(v17, T8H, v1, v6, T16B);
3404
3405 ld1(v0, v1, T2D, post(buf, 32));
3406
3407 uzp1(v24, v20, v22, T8H);
3408 uzp2(v25, v20, v22, T8H);
3409 eor(v20, T16B, v24, v25);
3410
3411 uzp1(v26, v16, v18, T8H);
3412 uzp2(v27, v16, v18, T8H);
3413 eor(v16, T16B, v26, v27);
3414
3415 ushll2(v22, T4S, v20, T8H, 8);
3416 ushll(v20, T4S, v20, T4H, 8);
3417
3418 ushll2(v18, T4S, v16, T8H, 8);
3419 ushll(v16, T4S, v16, T4H, 8);
3420
3421 eor(v22, T16B, v23, v22);
3422 eor(v18, T16B, v19, v18);
3423 eor(v20, T16B, v21, v20);
3424 eor(v16, T16B, v17, v16);
3425
3426 uzp1(v17, v16, v20, T2D);
3427 uzp2(v21, v16, v20, T2D);
3428 eor(v16, T16B, v17, v21);
3429
3430 ushll2(v20, T2D, v16, T4S, 16);
3431 ushll(v16, T2D, v16, T2S, 16);
3432
3433 eor(v20, T16B, v22, v20);
3434 eor(v16, T16B, v16, v18);
3435
3436 uzp1(v17, v20, v16, T2D);
3437 uzp2(v21, v20, v16, T2D);
3438 eor(v20, T16B, v17, v21);
3439
3440 shl(v16, T2D, v28, 1);
3441 shl(v17, T2D, v20, 1);
3442
3443 eor(v0, T16B, v0, v16);
3444 eor(v1, T16B, v1, v17);
3445
3446 subs(len, len, 32);
3447 br(Assembler::GE, L_fold);
3448
3449 mov(crc, 0);
3450 mov(tmp, v0, T1D, 0);
3451 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, false);
3452 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, true);
3453 mov(tmp, v0, T1D, 1);
3454 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, false);
3455 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, true);
3456 mov(tmp, v1, T1D, 0);
3457 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, false);
3458 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, true);
3459 mov(tmp, v1, T1D, 1);
3460 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, false);
3461 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, true);
3462
3463 add(len, len, 32);
3464 }
3465
3466 BIND(L_by16);
3467 subs(len, len, 16);
3468 br(Assembler::GE, L_by16_loop);
3469 adds(len, len, 16-4);
3470 br(Assembler::GE, L_by4_loop);
3471 adds(len, len, 4);
3472 br(Assembler::GT, L_by1_loop);
3473 b(L_exit);
3474
3475 BIND(L_by4_loop);
3476 ldrw(tmp, Address(post(buf, 4)));
3477 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3);
3478 subs(len, len, 4);
3479 br(Assembler::GE, L_by4_loop);
3480 adds(len, len, 4);
3481 br(Assembler::LE, L_exit);
3482 BIND(L_by1_loop);
3483 subs(len, len, 1);
3484 ldrb(tmp, Address(post(buf, 1)));
3485 update_byte_crc32(crc, tmp, table0);
3486 br(Assembler::GT, L_by1_loop);
3487 b(L_exit);
3488
3489 align(CodeEntryAlignment);
3490 BIND(L_by16_loop);
3491 subs(len, len, 16);
3492 ldp(tmp, tmp3, Address(post(buf, 16)));
3493 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, false);
3494 update_word_crc32(crc, tmp, tmp2, table0, table1, table2, table3, true);
3495 update_word_crc32(crc, tmp3, tmp2, table0, table1, table2, table3, false);
3496 update_word_crc32(crc, tmp3, tmp2, table0, table1, table2, table3, true);
3497 br(Assembler::GE, L_by16_loop);
3498 adds(len, len, 16-4);
3499 br(Assembler::GE, L_by4_loop);
3500 adds(len, len, 4);
3501 br(Assembler::GT, L_by1_loop);
3502 BIND(L_exit);
3503 mvnw(crc, crc);
3504 }
3505
3506 void MacroAssembler::kernel_crc32c_using_crc32c(Register crc, Register buf,
3507 Register len, Register tmp0, Register tmp1, Register tmp2,
3508 Register tmp3) {
3509 Label CRC_by64_loop, CRC_by4_loop, CRC_by1_loop, CRC_less64, CRC_by64_pre, CRC_by32_loop, CRC_less32, L_exit;
3510 assert_different_registers(crc, buf, len, tmp0, tmp1, tmp2, tmp3);
3511
3512 subs(len, len, 128);
3513 br(Assembler::GE, CRC_by64_pre);
3514 BIND(CRC_less64);
3515 adds(len, len, 128-32);
3516 br(Assembler::GE, CRC_by32_loop);
3517 BIND(CRC_less32);
3518 adds(len, len, 32-4);
3519 br(Assembler::GE, CRC_by4_loop);
3520 adds(len, len, 4);
3521 br(Assembler::GT, CRC_by1_loop);
3522 b(L_exit);
3523
3524 BIND(CRC_by32_loop);
3525 ldp(tmp0, tmp1, Address(post(buf, 16)));
3526 subs(len, len, 32);
3527 crc32cx(crc, crc, tmp0);
3528 ldr(tmp2, Address(post(buf, 8)));
3529 crc32cx(crc, crc, tmp1);
3530 ldr(tmp3, Address(post(buf, 8)));
3531 crc32cx(crc, crc, tmp2);
3532 crc32cx(crc, crc, tmp3);
3533 br(Assembler::GE, CRC_by32_loop);
3534 cmn(len, 32);
3535 br(Assembler::NE, CRC_less32);
3536 b(L_exit);
3537
3538 BIND(CRC_by4_loop);
3539 ldrw(tmp0, Address(post(buf, 4)));
3540 subs(len, len, 4);
3541 crc32cw(crc, crc, tmp0);
3542 br(Assembler::GE, CRC_by4_loop);
3543 adds(len, len, 4);
3544 br(Assembler::LE, L_exit);
3545 BIND(CRC_by1_loop);
3546 ldrb(tmp0, Address(post(buf, 1)));
3547 subs(len, len, 1);
3548 crc32cb(crc, crc, tmp0);
3549 br(Assembler::GT, CRC_by1_loop);
3550 b(L_exit);
3551
3552 BIND(CRC_by64_pre);
3553 sub(buf, buf, 8);
3554 ldp(tmp0, tmp1, Address(buf, 8));
3555 crc32cx(crc, crc, tmp0);
3556 ldr(tmp2, Address(buf, 24));
3557 crc32cx(crc, crc, tmp1);
3558 ldr(tmp3, Address(buf, 32));
3559 crc32cx(crc, crc, tmp2);
3560 ldr(tmp0, Address(buf, 40));
3561 crc32cx(crc, crc, tmp3);
3562 ldr(tmp1, Address(buf, 48));
3563 crc32cx(crc, crc, tmp0);
3564 ldr(tmp2, Address(buf, 56));
3565 crc32cx(crc, crc, tmp1);
3566 ldr(tmp3, Address(pre(buf, 64)));
3567
3568 b(CRC_by64_loop);
3569
3570 align(CodeEntryAlignment);
3571 BIND(CRC_by64_loop);
3572 subs(len, len, 64);
3573 crc32cx(crc, crc, tmp2);
3574 ldr(tmp0, Address(buf, 8));
3575 crc32cx(crc, crc, tmp3);
3576 ldr(tmp1, Address(buf, 16));
3577 crc32cx(crc, crc, tmp0);
3578 ldr(tmp2, Address(buf, 24));
3579 crc32cx(crc, crc, tmp1);
3580 ldr(tmp3, Address(buf, 32));
3581 crc32cx(crc, crc, tmp2);
3582 ldr(tmp0, Address(buf, 40));
3583 crc32cx(crc, crc, tmp3);
3584 ldr(tmp1, Address(buf, 48));
3585 crc32cx(crc, crc, tmp0);
3586 ldr(tmp2, Address(buf, 56));
3587 crc32cx(crc, crc, tmp1);
3588 ldr(tmp3, Address(pre(buf, 64)));
3589 br(Assembler::GE, CRC_by64_loop);
3590
3591 // post-loop
3592 crc32cx(crc, crc, tmp2);
3593 crc32cx(crc, crc, tmp3);
3594
3595 sub(len, len, 64);
3596 add(buf, buf, 8);
3597 cmn(len, 128);
3598 br(Assembler::NE, CRC_less64);
3599 BIND(L_exit);
3600 }
3601
3602 /**
3603 * @param crc register containing existing CRC (32-bit)
3604 * @param buf register pointing to input byte buffer (byte*)
3605 * @param len register containing number of bytes
3606 * @param table register that will contain address of CRC table
3607 * @param tmp scratch register
3608 */
3609 void MacroAssembler::kernel_crc32c(Register crc, Register buf, Register len,
3610 Register table0, Register table1, Register table2, Register table3,
3611 Register tmp, Register tmp2, Register tmp3) {
3612 kernel_crc32c_using_crc32c(crc, buf, len, table0, table1, table2, table3);
3613 }
3614
3615
3616 SkipIfEqual::SkipIfEqual(
3617 MacroAssembler* masm, const bool* flag_addr, bool value) {
3618 _masm = masm;
3619 unsigned long offset;
3620 _masm->adrp(rscratch1, ExternalAddress((address)flag_addr), offset);
3621 _masm->ldrb(rscratch1, Address(rscratch1, offset));
3622 _masm->cbzw(rscratch1, _label);
3623 }
3624
3625 SkipIfEqual::~SkipIfEqual() {
3626 _masm->bind(_label);
3627 }
3628
3629 void MacroAssembler::addptr(const Address &dst, int32_t src) {
3630 Address adr;
3631 switch(dst.getMode()) {
3632 case Address::base_plus_offset:
3633 // This is the expected mode, although we allow all the other
3634 // forms below.
3635 adr = form_address(rscratch2, dst.base(), dst.offset(), LogBytesPerWord);
3636 break;
3637 default:
3638 lea(rscratch2, dst);
3639 adr = Address(rscratch2);
3640 break;
3641 }
3642 ldr(rscratch1, adr);
3643 add(rscratch1, rscratch1, src);
3644 str(rscratch1, adr);
3645 }
3646
3647 void MacroAssembler::cmpptr(Register src1, Address src2) {
3648 unsigned long offset;
3649 adrp(rscratch1, src2, offset);
3650 ldr(rscratch1, Address(rscratch1, offset));
3651 cmp(src1, rscratch1);
3652 }
3653
3654 void MacroAssembler::load_klass(Register dst, Register src) {
3655 if (UseCompressedClassPointers) {
3656 ldrw(dst, Address(src, oopDesc::klass_offset_in_bytes()));
3657 decode_klass_not_null(dst);
3658 } else {
3659 ldr(dst, Address(src, oopDesc::klass_offset_in_bytes()));
3660 }
3661 }
3662
3663 // ((OopHandle)result).resolve();
3664 void MacroAssembler::resolve_oop_handle(Register result, Register tmp) {
3665 // OopHandle::resolve is an indirection.
3666 access_load_at(T_OBJECT, IN_CONCURRENT_ROOT,
3667 result, Address(result, 0), tmp, noreg);
3668 }
3669
3670 void MacroAssembler::load_mirror(Register dst, Register method, Register tmp) {
3671 const int mirror_offset = in_bytes(Klass::java_mirror_offset());
3672 ldr(dst, Address(rmethod, Method::const_offset()));
3673 ldr(dst, Address(dst, ConstMethod::constants_offset()));
3674 ldr(dst, Address(dst, ConstantPool::pool_holder_offset_in_bytes()));
3675 ldr(dst, Address(dst, mirror_offset));
3676 resolve_oop_handle(dst, tmp);
3677 }
3678
3679 void MacroAssembler::cmp_klass(Register oop, Register trial_klass, Register tmp) {
3680 if (UseCompressedClassPointers) {
3681 ldrw(tmp, Address(oop, oopDesc::klass_offset_in_bytes()));
3682 if (Universe::narrow_klass_base() == NULL) {
3683 cmp(trial_klass, tmp, LSL, Universe::narrow_klass_shift());
3684 return;
3685 } else if (((uint64_t)Universe::narrow_klass_base() & 0xffffffff) == 0
3686 && Universe::narrow_klass_shift() == 0) {
3687 // Only the bottom 32 bits matter
3688 cmpw(trial_klass, tmp);
3689 return;
3690 }
3691 decode_klass_not_null(tmp);
3692 } else {
3693 ldr(tmp, Address(oop, oopDesc::klass_offset_in_bytes()));
3694 }
3695 cmp(trial_klass, tmp);
3696 }
3697
3698 void MacroAssembler::load_prototype_header(Register dst, Register src) {
3699 load_klass(dst, src);
3700 ldr(dst, Address(dst, Klass::prototype_header_offset()));
3701 }
3702
3703 void MacroAssembler::store_klass(Register dst, Register src) {
3704 // FIXME: Should this be a store release? concurrent gcs assumes
3705 // klass length is valid if klass field is not null.
3706 if (UseCompressedClassPointers) {
3707 encode_klass_not_null(src);
3708 strw(src, Address(dst, oopDesc::klass_offset_in_bytes()));
3709 } else {
3710 str(src, Address(dst, oopDesc::klass_offset_in_bytes()));
3711 }
3712 }
3713
3714 void MacroAssembler::store_klass_gap(Register dst, Register src) {
3715 if (UseCompressedClassPointers) {
3716 // Store to klass gap in destination
3717 strw(src, Address(dst, oopDesc::klass_gap_offset_in_bytes()));
3718 }
3719 }
3720
3721 // Algorithm must match CompressedOops::encode.
3722 void MacroAssembler::encode_heap_oop(Register d, Register s) {
3723 #ifdef ASSERT
3724 verify_heapbase("MacroAssembler::encode_heap_oop: heap base corrupted?");
3725 #endif
3726 verify_oop(s, "broken oop in encode_heap_oop");
3727 if (Universe::narrow_oop_base() == NULL) {
3728 if (Universe::narrow_oop_shift() != 0) {
3729 assert (LogMinObjAlignmentInBytes == Universe::narrow_oop_shift(), "decode alg wrong");
3730 lsr(d, s, LogMinObjAlignmentInBytes);
3731 } else {
3732 mov(d, s);
3733 }
3734 } else {
3735 subs(d, s, rheapbase);
3736 csel(d, d, zr, Assembler::HS);
3737 lsr(d, d, LogMinObjAlignmentInBytes);
3738
3739 /* Old algorithm: is this any worse?
3740 Label nonnull;
3741 cbnz(r, nonnull);
3742 sub(r, r, rheapbase);
3743 bind(nonnull);
3744 lsr(r, r, LogMinObjAlignmentInBytes);
3745 */
3746 }
3747 }
3748
3749 void MacroAssembler::encode_heap_oop_not_null(Register r) {
3750 #ifdef ASSERT
3751 verify_heapbase("MacroAssembler::encode_heap_oop_not_null: heap base corrupted?");
3752 if (CheckCompressedOops) {
3753 Label ok;
3754 cbnz(r, ok);
3755 stop("null oop passed to encode_heap_oop_not_null");
3756 bind(ok);
3757 }
3758 #endif
3759 verify_oop(r, "broken oop in encode_heap_oop_not_null");
3760 if (Universe::narrow_oop_base() != NULL) {
3761 sub(r, r, rheapbase);
3762 }
3763 if (Universe::narrow_oop_shift() != 0) {
3764 assert (LogMinObjAlignmentInBytes == Universe::narrow_oop_shift(), "decode alg wrong");
3765 lsr(r, r, LogMinObjAlignmentInBytes);
3766 }
3767 }
3768
3769 void MacroAssembler::encode_heap_oop_not_null(Register dst, Register src) {
3770 #ifdef ASSERT
3771 verify_heapbase("MacroAssembler::encode_heap_oop_not_null2: heap base corrupted?");
3772 if (CheckCompressedOops) {
3773 Label ok;
3774 cbnz(src, ok);
3775 stop("null oop passed to encode_heap_oop_not_null2");
3776 bind(ok);
3777 }
3778 #endif
3779 verify_oop(src, "broken oop in encode_heap_oop_not_null2");
3780
3781 Register data = src;
3782 if (Universe::narrow_oop_base() != NULL) {
3783 sub(dst, src, rheapbase);
3784 data = dst;
3785 }
3786 if (Universe::narrow_oop_shift() != 0) {
3787 assert (LogMinObjAlignmentInBytes == Universe::narrow_oop_shift(), "decode alg wrong");
3788 lsr(dst, data, LogMinObjAlignmentInBytes);
3789 data = dst;
3790 }
3791 if (data == src)
3792 mov(dst, src);
3793 }
3794
3795 void MacroAssembler::decode_heap_oop(Register d, Register s) {
3796 #ifdef ASSERT
3797 verify_heapbase("MacroAssembler::decode_heap_oop: heap base corrupted?");
3798 #endif
3799 if (Universe::narrow_oop_base() == NULL) {
3800 if (Universe::narrow_oop_shift() != 0 || d != s) {
3801 lsl(d, s, Universe::narrow_oop_shift());
3802 }
3803 } else {
3804 Label done;
3805 if (d != s)
3806 mov(d, s);
3807 cbz(s, done);
3808 add(d, rheapbase, s, Assembler::LSL, LogMinObjAlignmentInBytes);
3809 bind(done);
3810 }
3811 verify_oop(d, "broken oop in decode_heap_oop");
3812 }
3813
3814 void MacroAssembler::decode_heap_oop_not_null(Register r) {
3815 assert (UseCompressedOops, "should only be used for compressed headers");
3816 assert (Universe::heap() != NULL, "java heap should be initialized");
3817 // Cannot assert, unverified entry point counts instructions (see .ad file)
3818 // vtableStubs also counts instructions in pd_code_size_limit.
3819 // Also do not verify_oop as this is called by verify_oop.
3820 if (Universe::narrow_oop_shift() != 0) {
3821 assert(LogMinObjAlignmentInBytes == Universe::narrow_oop_shift(), "decode alg wrong");
3822 if (Universe::narrow_oop_base() != NULL) {
3823 add(r, rheapbase, r, Assembler::LSL, LogMinObjAlignmentInBytes);
3824 } else {
3825 add(r, zr, r, Assembler::LSL, LogMinObjAlignmentInBytes);
3826 }
3827 } else {
3828 assert (Universe::narrow_oop_base() == NULL, "sanity");
3829 }
3830 }
3831
3832 void MacroAssembler::decode_heap_oop_not_null(Register dst, Register src) {
3833 assert (UseCompressedOops, "should only be used for compressed headers");
3834 assert (Universe::heap() != NULL, "java heap should be initialized");
3835 // Cannot assert, unverified entry point counts instructions (see .ad file)
3836 // vtableStubs also counts instructions in pd_code_size_limit.
3837 // Also do not verify_oop as this is called by verify_oop.
3838 if (Universe::narrow_oop_shift() != 0) {
3839 assert(LogMinObjAlignmentInBytes == Universe::narrow_oop_shift(), "decode alg wrong");
3840 if (Universe::narrow_oop_base() != NULL) {
3841 add(dst, rheapbase, src, Assembler::LSL, LogMinObjAlignmentInBytes);
3842 } else {
3843 add(dst, zr, src, Assembler::LSL, LogMinObjAlignmentInBytes);
3844 }
3845 } else {
3846 assert (Universe::narrow_oop_base() == NULL, "sanity");
3847 if (dst != src) {
3848 mov(dst, src);
3849 }
3850 }
3851 }
3852
3853 void MacroAssembler::encode_klass_not_null(Register dst, Register src) {
3854 if (Universe::narrow_klass_base() == NULL) {
3855 if (Universe::narrow_klass_shift() != 0) {
3856 assert (LogKlassAlignmentInBytes == Universe::narrow_klass_shift(), "decode alg wrong");
3857 lsr(dst, src, LogKlassAlignmentInBytes);
3858 } else {
3859 if (dst != src) mov(dst, src);
3860 }
3861 return;
3862 }
3863
3864 if (use_XOR_for_compressed_class_base) {
3865 if (Universe::narrow_klass_shift() != 0) {
3866 eor(dst, src, (uint64_t)Universe::narrow_klass_base());
3867 lsr(dst, dst, LogKlassAlignmentInBytes);
3868 } else {
3869 eor(dst, src, (uint64_t)Universe::narrow_klass_base());
3870 }
3871 return;
3872 }
3873
3874 if (((uint64_t)Universe::narrow_klass_base() & 0xffffffff) == 0
3875 && Universe::narrow_klass_shift() == 0) {
3876 movw(dst, src);
3877 return;
3878 }
3879
3880 #ifdef ASSERT
3881 verify_heapbase("MacroAssembler::encode_klass_not_null2: heap base corrupted?");
3882 #endif
3883
3884 Register rbase = dst;
3885 if (dst == src) rbase = rheapbase;
3886 mov(rbase, (uint64_t)Universe::narrow_klass_base());
3887 sub(dst, src, rbase);
3888 if (Universe::narrow_klass_shift() != 0) {
3889 assert (LogKlassAlignmentInBytes == Universe::narrow_klass_shift(), "decode alg wrong");
3890 lsr(dst, dst, LogKlassAlignmentInBytes);
3891 }
3892 if (dst == src) reinit_heapbase();
3893 }
3894
3895 void MacroAssembler::encode_klass_not_null(Register r) {
3896 encode_klass_not_null(r, r);
3897 }
3898
3899 void MacroAssembler::decode_klass_not_null(Register dst, Register src) {
3900 Register rbase = dst;
3901 assert (UseCompressedClassPointers, "should only be used for compressed headers");
3902
3903 if (Universe::narrow_klass_base() == NULL) {
3904 if (Universe::narrow_klass_shift() != 0) {
3905 assert(LogKlassAlignmentInBytes == Universe::narrow_klass_shift(), "decode alg wrong");
3906 lsl(dst, src, LogKlassAlignmentInBytes);
3907 } else {
3908 if (dst != src) mov(dst, src);
3909 }
3910 return;
3911 }
3912
3913 if (use_XOR_for_compressed_class_base) {
3914 if (Universe::narrow_klass_shift() != 0) {
3915 lsl(dst, src, LogKlassAlignmentInBytes);
3916 eor(dst, dst, (uint64_t)Universe::narrow_klass_base());
3917 } else {
3918 eor(dst, src, (uint64_t)Universe::narrow_klass_base());
3919 }
3920 return;
3921 }
3922
3923 if (((uint64_t)Universe::narrow_klass_base() & 0xffffffff) == 0
3924 && Universe::narrow_klass_shift() == 0) {
3925 if (dst != src)
3926 movw(dst, src);
3927 movk(dst, (uint64_t)Universe::narrow_klass_base() >> 32, 32);
3928 return;
3929 }
3930
3931 // Cannot assert, unverified entry point counts instructions (see .ad file)
3932 // vtableStubs also counts instructions in pd_code_size_limit.
3933 // Also do not verify_oop as this is called by verify_oop.
3934 if (dst == src) rbase = rheapbase;
3935 mov(rbase, (uint64_t)Universe::narrow_klass_base());
3936 if (Universe::narrow_klass_shift() != 0) {
3937 assert(LogKlassAlignmentInBytes == Universe::narrow_klass_shift(), "decode alg wrong");
3938 add(dst, rbase, src, Assembler::LSL, LogKlassAlignmentInBytes);
3939 } else {
3940 add(dst, rbase, src);
3941 }
3942 if (dst == src) reinit_heapbase();
3943 }
3944
3945 void MacroAssembler::decode_klass_not_null(Register r) {
3946 decode_klass_not_null(r, r);
3947 }
3948
3949 void MacroAssembler::set_narrow_oop(Register dst, jobject obj) {
3950 #ifdef ASSERT
3951 {
3952 ThreadInVMfromUnknown tiv;
3953 assert (UseCompressedOops, "should only be used for compressed oops");
3954 assert (Universe::heap() != NULL, "java heap should be initialized");
3955 assert (oop_recorder() != NULL, "this assembler needs an OopRecorder");
3956 assert(Universe::heap()->is_in_reserved(JNIHandles::resolve(obj)), "should be real oop");
3957 }
3958 #endif
3959 int oop_index = oop_recorder()->find_index(obj);
3960 InstructionMark im(this);
3961 RelocationHolder rspec = oop_Relocation::spec(oop_index);
3962 code_section()->relocate(inst_mark(), rspec);
3963 movz(dst, 0xDEAD, 16);
3964 movk(dst, 0xBEEF);
3965 }
3966
3967 void MacroAssembler::set_narrow_klass(Register dst, Klass* k) {
3968 assert (UseCompressedClassPointers, "should only be used for compressed headers");
3969 assert (oop_recorder() != NULL, "this assembler needs an OopRecorder");
3970 int index = oop_recorder()->find_index(k);
3971 assert(! Universe::heap()->is_in_reserved(k), "should not be an oop");
3972
3973 InstructionMark im(this);
3974 RelocationHolder rspec = metadata_Relocation::spec(index);
3975 code_section()->relocate(inst_mark(), rspec);
3976 narrowKlass nk = Klass::encode_klass(k);
3977 movz(dst, (nk >> 16), 16);
3978 movk(dst, nk & 0xffff);
3979 }
3980
3981 void MacroAssembler::access_load_at(BasicType type, DecoratorSet decorators,
3982 Register dst, Address src,
3983 Register tmp1, Register thread_tmp) {
3984 BarrierSetAssembler *bs = BarrierSet::barrier_set()->barrier_set_assembler();
3985 decorators = AccessInternal::decorator_fixup(decorators);
3986 bool as_raw = (decorators & AS_RAW) != 0;
3987 if (as_raw) {
3988 bs->BarrierSetAssembler::load_at(this, decorators, type, dst, src, tmp1, thread_tmp);
3989 } else {
3990 bs->load_at(this, decorators, type, dst, src, tmp1, thread_tmp);
3991 }
3992 }
3993
3994 void MacroAssembler::access_store_at(BasicType type, DecoratorSet decorators,
3995 Address dst, Register src,
3996 Register tmp1, Register thread_tmp) {
3997 BarrierSetAssembler *bs = BarrierSet::barrier_set()->barrier_set_assembler();
3998 decorators = AccessInternal::decorator_fixup(decorators);
3999 bool as_raw = (decorators & AS_RAW) != 0;
4000 if (as_raw) {
4001 bs->BarrierSetAssembler::store_at(this, decorators, type, dst, src, tmp1, thread_tmp);
4002 } else {
4003 bs->store_at(this, decorators, type, dst, src, tmp1, thread_tmp);
4004 }
4005 }
4006
4007 void MacroAssembler::load_heap_oop(Register dst, Address src, Register tmp1,
4008 Register thread_tmp, DecoratorSet decorators) {
4009 access_load_at(T_OBJECT, IN_HEAP | decorators, dst, src, tmp1, thread_tmp);
4010 }
4011
4012 void MacroAssembler::load_heap_oop_not_null(Register dst, Address src, Register tmp1,
4013 Register thread_tmp, DecoratorSet decorators) {
4014 access_load_at(T_OBJECT, IN_HEAP | OOP_NOT_NULL | decorators, dst, src, tmp1, thread_tmp);
4015 }
4016
4017 void MacroAssembler::store_heap_oop(Address dst, Register src, Register tmp1,
4018 Register thread_tmp, DecoratorSet decorators) {
4019 access_store_at(T_OBJECT, IN_HEAP | decorators, dst, src, tmp1, thread_tmp);
4020 }
4021
4022 // Used for storing NULLs.
4023 void MacroAssembler::store_heap_oop_null(Address dst) {
4024 access_store_at(T_OBJECT, IN_HEAP, dst, noreg, noreg, noreg);
4025 }
4026
4027 Address MacroAssembler::allocate_metadata_address(Metadata* obj) {
4028 assert(oop_recorder() != NULL, "this assembler needs a Recorder");
4029 int index = oop_recorder()->allocate_metadata_index(obj);
4030 RelocationHolder rspec = metadata_Relocation::spec(index);
4031 return Address((address)obj, rspec);
4032 }
4033
4034 // Move an oop into a register. immediate is true if we want
4035 // immediate instrcutions, i.e. we are not going to patch this
4036 // instruction while the code is being executed by another thread. In
4037 // that case we can use move immediates rather than the constant pool.
4038 void MacroAssembler::movoop(Register dst, jobject obj, bool immediate) {
4039 int oop_index;
4040 if (obj == NULL) {
4041 oop_index = oop_recorder()->allocate_oop_index(obj);
4042 } else {
4043 #ifdef ASSERT
4044 {
4045 ThreadInVMfromUnknown tiv;
4046 assert(Universe::heap()->is_in_reserved(JNIHandles::resolve(obj)), "should be real oop");
4047 }
4048 #endif
4049 oop_index = oop_recorder()->find_index(obj);
4050 }
4051 RelocationHolder rspec = oop_Relocation::spec(oop_index);
4052 if (! immediate) {
4053 address dummy = address(uintptr_t(pc()) & -wordSize); // A nearby aligned address
4054 ldr_constant(dst, Address(dummy, rspec));
4055 } else
4056 mov(dst, Address((address)obj, rspec));
4057 }
4058
4059 // Move a metadata address into a register.
4060 void MacroAssembler::mov_metadata(Register dst, Metadata* obj) {
4061 int oop_index;
4062 if (obj == NULL) {
4063 oop_index = oop_recorder()->allocate_metadata_index(obj);
4064 } else {
4065 oop_index = oop_recorder()->find_index(obj);
4066 }
4067 RelocationHolder rspec = metadata_Relocation::spec(oop_index);
4068 mov(dst, Address((address)obj, rspec));
4069 }
4070
4071 Address MacroAssembler::constant_oop_address(jobject obj) {
4072 #ifdef ASSERT
4073 {
4074 ThreadInVMfromUnknown tiv;
4075 assert(oop_recorder() != NULL, "this assembler needs an OopRecorder");
4076 assert(Universe::heap()->is_in_reserved(JNIHandles::resolve(obj)), "not an oop");
4077 }
4078 #endif
4079 int oop_index = oop_recorder()->find_index(obj);
4080 return Address((address)obj, oop_Relocation::spec(oop_index));
4081 }
4082
4083 // Defines obj, preserves var_size_in_bytes, okay for t2 == var_size_in_bytes.
4084 void MacroAssembler::tlab_allocate(Register obj,
4085 Register var_size_in_bytes,
4086 int con_size_in_bytes,
4087 Register t1,
4088 Register t2,
4089 Label& slow_case) {
4090 assert_different_registers(obj, t2);
4091 assert_different_registers(obj, var_size_in_bytes);
4092 Register end = t2;
4093
4094 // verify_tlab();
4095
4096 ldr(obj, Address(rthread, JavaThread::tlab_top_offset()));
4097 if (var_size_in_bytes == noreg) {
4098 lea(end, Address(obj, con_size_in_bytes));
4099 } else {
4100 lea(end, Address(obj, var_size_in_bytes));
4101 }
4102 ldr(rscratch1, Address(rthread, JavaThread::tlab_end_offset()));
4103 cmp(end, rscratch1);
4104 br(Assembler::HI, slow_case);
4105
4106 // update the tlab top pointer
4107 str(end, Address(rthread, JavaThread::tlab_top_offset()));
4108
4109 // recover var_size_in_bytes if necessary
4110 if (var_size_in_bytes == end) {
4111 sub(var_size_in_bytes, var_size_in_bytes, obj);
4112 }
4113 // verify_tlab();
4114 }
4115
4116 // Zero words; len is in bytes
4117 // Destroys all registers except addr
4118 // len must be a nonzero multiple of wordSize
4119 void MacroAssembler::zero_memory(Register addr, Register len, Register t1) {
4120 assert_different_registers(addr, len, t1, rscratch1, rscratch2);
4121
4122 #ifdef ASSERT
4123 { Label L;
4124 tst(len, BytesPerWord - 1);
4125 br(Assembler::EQ, L);
4126 stop("len is not a multiple of BytesPerWord");
4127 bind(L);
4128 }
4129 #endif
4130
4131 #ifndef PRODUCT
4132 block_comment("zero memory");
4133 #endif
4134
4135 Label loop;
4136 Label entry;
4137
4138 // Algorithm:
4139 //
4140 // scratch1 = cnt & 7;
4141 // cnt -= scratch1;
4142 // p += scratch1;
4143 // switch (scratch1) {
4144 // do {
4145 // cnt -= 8;
4146 // p[-8] = 0;
4147 // case 7:
4148 // p[-7] = 0;
4149 // case 6:
4150 // p[-6] = 0;
4151 // // ...
4152 // case 1:
4153 // p[-1] = 0;
4154 // case 0:
4155 // p += 8;
4156 // } while (cnt);
4157 // }
4158
4159 const int unroll = 8; // Number of str(zr) instructions we'll unroll
4160
4161 lsr(len, len, LogBytesPerWord);
4162 andr(rscratch1, len, unroll - 1); // tmp1 = cnt % unroll
4163 sub(len, len, rscratch1); // cnt -= unroll
4164 // t1 always points to the end of the region we're about to zero
4165 add(t1, addr, rscratch1, Assembler::LSL, LogBytesPerWord);
4166 adr(rscratch2, entry);
4167 sub(rscratch2, rscratch2, rscratch1, Assembler::LSL, 2);
4168 br(rscratch2);
4169 bind(loop);
4170 sub(len, len, unroll);
4171 for (int i = -unroll; i < 0; i++)
4172 Assembler::str(zr, Address(t1, i * wordSize));
4173 bind(entry);
4174 add(t1, t1, unroll * wordSize);
4175 cbnz(len, loop);
4176 }
4177
4178 // Defines obj, preserves var_size_in_bytes
4179 void MacroAssembler::eden_allocate(Register obj,
4180 Register var_size_in_bytes,
4181 int con_size_in_bytes,
4182 Register t1,
4183 Label& slow_case) {
4184 assert_different_registers(obj, var_size_in_bytes, t1);
4185 if (!Universe::heap()->supports_inline_contig_alloc()) {
4186 b(slow_case);
4187 } else {
4188 Register end = t1;
4189 Register heap_end = rscratch2;
4190 Label retry;
4191 bind(retry);
4192 {
4193 unsigned long offset;
4194 adrp(rscratch1, ExternalAddress((address) Universe::heap()->end_addr()), offset);
4195 ldr(heap_end, Address(rscratch1, offset));
4196 }
4197
4198 ExternalAddress heap_top((address) Universe::heap()->top_addr());
4199
4200 // Get the current top of the heap
4201 {
4202 unsigned long offset;
4203 adrp(rscratch1, heap_top, offset);
4204 // Use add() here after ARDP, rather than lea().
4205 // lea() does not generate anything if its offset is zero.
4206 // However, relocs expect to find either an ADD or a load/store
4207 // insn after an ADRP. add() always generates an ADD insn, even
4208 // for add(Rn, Rn, 0).
4209 add(rscratch1, rscratch1, offset);
4210 ldaxr(obj, rscratch1);
4211 }
4212
4213 // Adjust it my the size of our new object
4214 if (var_size_in_bytes == noreg) {
4215 lea(end, Address(obj, con_size_in_bytes));
4216 } else {
4217 lea(end, Address(obj, var_size_in_bytes));
4218 }
4219
4220 // if end < obj then we wrapped around high memory
4221 cmp(end, obj);
4222 br(Assembler::LO, slow_case);
4223
4224 cmp(end, heap_end);
4225 br(Assembler::HI, slow_case);
4226
4227 // If heap_top hasn't been changed by some other thread, update it.
4228 stlxr(rscratch2, end, rscratch1);
4229 cbnzw(rscratch2, retry);
4230 }
4231 }
4232
4233 void MacroAssembler::verify_tlab() {
4234 #ifdef ASSERT
4235 if (UseTLAB && VerifyOops) {
4236 Label next, ok;
4237
4238 stp(rscratch2, rscratch1, Address(pre(sp, -16)));
4239
4240 ldr(rscratch2, Address(rthread, in_bytes(JavaThread::tlab_top_offset())));
4241 ldr(rscratch1, Address(rthread, in_bytes(JavaThread::tlab_start_offset())));
4242 cmp(rscratch2, rscratch1);
4243 br(Assembler::HS, next);
4244 STOP("assert(top >= start)");
4245 should_not_reach_here();
4246
4247 bind(next);
4248 ldr(rscratch2, Address(rthread, in_bytes(JavaThread::tlab_end_offset())));
4249 ldr(rscratch1, Address(rthread, in_bytes(JavaThread::tlab_top_offset())));
4250 cmp(rscratch2, rscratch1);
4251 br(Assembler::HS, ok);
4252 STOP("assert(top <= end)");
4253 should_not_reach_here();
4254
4255 bind(ok);
4256 ldp(rscratch2, rscratch1, Address(post(sp, 16)));
4257 }
4258 #endif
4259 }
4260
4261 // Writes to stack successive pages until offset reached to check for
4262 // stack overflow + shadow pages. This clobbers tmp.
4263 void MacroAssembler::bang_stack_size(Register size, Register tmp) {
4264 assert_different_registers(tmp, size, rscratch1);
4265 mov(tmp, sp);
4266 // Bang stack for total size given plus shadow page size.
4267 // Bang one page at a time because large size can bang beyond yellow and
4268 // red zones.
4269 Label loop;
4270 mov(rscratch1, os::vm_page_size());
4271 bind(loop);
4272 lea(tmp, Address(tmp, -os::vm_page_size()));
4273 subsw(size, size, rscratch1);
4274 str(size, Address(tmp));
4275 br(Assembler::GT, loop);
4276
4277 // Bang down shadow pages too.
4278 // At this point, (tmp-0) is the last address touched, so don't
4279 // touch it again. (It was touched as (tmp-pagesize) but then tmp
4280 // was post-decremented.) Skip this address by starting at i=1, and
4281 // touch a few more pages below. N.B. It is important to touch all
4282 // the way down to and including i=StackShadowPages.
4283 for (int i = 0; i < (int)(JavaThread::stack_shadow_zone_size() / os::vm_page_size()) - 1; i++) {
4284 // this could be any sized move but this is can be a debugging crumb
4285 // so the bigger the better.
4286 lea(tmp, Address(tmp, -os::vm_page_size()));
4287 str(size, Address(tmp));
4288 }
4289 }
4290
4291
4292 // Move the address of the polling page into dest.
4293 void MacroAssembler::get_polling_page(Register dest, address page, relocInfo::relocType rtype) {
4294 if (SafepointMechanism::uses_thread_local_poll()) {
4295 ldr(dest, Address(rthread, Thread::polling_page_offset()));
4296 } else {
4297 unsigned long off;
4298 adrp(dest, Address(page, rtype), off);
4299 assert(off == 0, "polling page must be page aligned");
4300 }
4301 }
4302
4303 // Move the address of the polling page into r, then read the polling
4304 // page.
4305 address MacroAssembler::read_polling_page(Register r, address page, relocInfo::relocType rtype) {
4306 get_polling_page(r, page, rtype);
4307 return read_polling_page(r, rtype);
4308 }
4309
4310 // Read the polling page. The address of the polling page must
4311 // already be in r.
4312 address MacroAssembler::read_polling_page(Register r, relocInfo::relocType rtype) {
4313 InstructionMark im(this);
4314 code_section()->relocate(inst_mark(), rtype);
4315 ldrw(zr, Address(r, 0));
4316 return inst_mark();
4317 }
4318
4319 void MacroAssembler::adrp(Register reg1, const Address &dest, unsigned long &byte_offset) {
4320 relocInfo::relocType rtype = dest.rspec().reloc()->type();
4321 unsigned long low_page = (unsigned long)CodeCache::low_bound() >> 12;
4322 unsigned long high_page = (unsigned long)(CodeCache::high_bound()-1) >> 12;
4323 unsigned long dest_page = (unsigned long)dest.target() >> 12;
4324 long offset_low = dest_page - low_page;
4325 long offset_high = dest_page - high_page;
4326
4327 assert(is_valid_AArch64_address(dest.target()), "bad address");
4328 assert(dest.getMode() == Address::literal, "ADRP must be applied to a literal address");
4329
4330 InstructionMark im(this);
4331 code_section()->relocate(inst_mark(), dest.rspec());
4332 // 8143067: Ensure that the adrp can reach the dest from anywhere within
4333 // the code cache so that if it is relocated we know it will still reach
4334 if (offset_high >= -(1<<20) && offset_low < (1<<20)) {
4335 _adrp(reg1, dest.target());
4336 } else {
4337 unsigned long target = (unsigned long)dest.target();
4338 unsigned long adrp_target
4339 = (target & 0xffffffffUL) | ((unsigned long)pc() & 0xffff00000000UL);
4340
4341 _adrp(reg1, (address)adrp_target);
4342 movk(reg1, target >> 32, 32);
4343 }
4344 byte_offset = (unsigned long)dest.target() & 0xfff;
4345 }
4346
4347 void MacroAssembler::load_byte_map_base(Register reg) {
4348 jbyte *byte_map_base =
4349 ((CardTableBarrierSet*)(BarrierSet::barrier_set()))->card_table()->byte_map_base();
4350
4351 if (is_valid_AArch64_address((address)byte_map_base)) {
4352 // Strictly speaking the byte_map_base isn't an address at all,
4353 // and it might even be negative.
4354 unsigned long offset;
4355 adrp(reg, ExternalAddress((address)byte_map_base), offset);
4356 // We expect offset to be zero with most collectors.
4357 if (offset != 0) {
4358 add(reg, reg, offset);
4359 }
4360 } else {
4361 mov(reg, (uint64_t)byte_map_base);
4362 }
4363 }
4364
4365 void MacroAssembler::build_frame(int framesize) {
4366 assert(framesize > 0, "framesize must be > 0");
4367 if (framesize < ((1 << 9) + 2 * wordSize)) {
4368 sub(sp, sp, framesize);
4369 stp(rfp, lr, Address(sp, framesize - 2 * wordSize));
4370 if (PreserveFramePointer) add(rfp, sp, framesize - 2 * wordSize);
4371 } else {
4372 stp(rfp, lr, Address(pre(sp, -2 * wordSize)));
4373 if (PreserveFramePointer) mov(rfp, sp);
4374 if (framesize < ((1 << 12) + 2 * wordSize))
4375 sub(sp, sp, framesize - 2 * wordSize);
4376 else {
4377 mov(rscratch1, framesize - 2 * wordSize);
4378 sub(sp, sp, rscratch1);
4379 }
4380 }
4381 }
4382
4383 void MacroAssembler::remove_frame(int framesize) {
4384 assert(framesize > 0, "framesize must be > 0");
4385 if (framesize < ((1 << 9) + 2 * wordSize)) {
4386 ldp(rfp, lr, Address(sp, framesize - 2 * wordSize));
4387 add(sp, sp, framesize);
4388 } else {
4389 if (framesize < ((1 << 12) + 2 * wordSize))
4390 add(sp, sp, framesize - 2 * wordSize);
4391 else {
4392 mov(rscratch1, framesize - 2 * wordSize);
4393 add(sp, sp, rscratch1);
4394 }
4395 ldp(rfp, lr, Address(post(sp, 2 * wordSize)));
4396 }
4397 }
4398
4399 typedef void (MacroAssembler::* chr_insn)(Register Rt, const Address &adr);
4400
4401 // Search for str1 in str2 and return index or -1
4402 void MacroAssembler::string_indexof(Register str2, Register str1,
4403 Register cnt2, Register cnt1,
4404 Register tmp1, Register tmp2,
4405 Register tmp3, Register tmp4,
4406 int icnt1, Register result, int ae) {
4407 Label BM, LINEARSEARCH, DONE, NOMATCH, MATCH;
4408
4409 Register ch1 = rscratch1;
4410 Register ch2 = rscratch2;
4411 Register cnt1tmp = tmp1;
4412 Register cnt2tmp = tmp2;
4413 Register cnt1_neg = cnt1;
4414 Register cnt2_neg = cnt2;
4415 Register result_tmp = tmp4;
4416
4417 bool isL = ae == StrIntrinsicNode::LL;
4418
4419 bool str1_isL = ae == StrIntrinsicNode::LL || ae == StrIntrinsicNode::UL;
4420 bool str2_isL = ae == StrIntrinsicNode::LL || ae == StrIntrinsicNode::LU;
4421 int str1_chr_shift = str1_isL ? 0:1;
4422 int str2_chr_shift = str2_isL ? 0:1;
4423 int str1_chr_size = str1_isL ? 1:2;
4424 int str2_chr_size = str2_isL ? 1:2;
4425 chr_insn str1_load_1chr = str1_isL ? (chr_insn)&MacroAssembler::ldrb :
4426 (chr_insn)&MacroAssembler::ldrh;
4427 chr_insn str2_load_1chr = str2_isL ? (chr_insn)&MacroAssembler::ldrb :
4428 (chr_insn)&MacroAssembler::ldrh;
4429 chr_insn load_2chr = isL ? (chr_insn)&MacroAssembler::ldrh : (chr_insn)&MacroAssembler::ldrw;
4430 chr_insn load_4chr = isL ? (chr_insn)&MacroAssembler::ldrw : (chr_insn)&MacroAssembler::ldr;
4431
4432 // Note, inline_string_indexOf() generates checks:
4433 // if (substr.count > string.count) return -1;
4434 // if (substr.count == 0) return 0;
4435
4436 // We have two strings, a source string in str2, cnt2 and a pattern string
4437 // in str1, cnt1. Find the 1st occurence of pattern in source or return -1.
4438
4439 // For larger pattern and source we use a simplified Boyer Moore algorithm.
4440 // With a small pattern and source we use linear scan.
4441
4442 if (icnt1 == -1) {
4443 cmp(cnt1, 256); // Use Linear Scan if cnt1 < 8 || cnt1 >= 256
4444 ccmp(cnt1, 8, 0b0000, LO); // Can't handle skip >= 256 because we use
4445 br(LO, LINEARSEARCH); // a byte array.
4446 cmp(cnt1, cnt2, LSR, 2); // Source must be 4 * pattern for BM
4447 br(HS, LINEARSEARCH);
4448 }
4449
4450 // The Boyer Moore alogorithm is based on the description here:-
4451 //
4452 // http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm
4453 //
4454 // This describes and algorithm with 2 shift rules. The 'Bad Character' rule
4455 // and the 'Good Suffix' rule.
4456 //
4457 // These rules are essentially heuristics for how far we can shift the
4458 // pattern along the search string.
4459 //
4460 // The implementation here uses the 'Bad Character' rule only because of the
4461 // complexity of initialisation for the 'Good Suffix' rule.
4462 //
4463 // This is also known as the Boyer-Moore-Horspool algorithm:-
4464 //
4465 // http://en.wikipedia.org/wiki/Boyer-Moore-Horspool_algorithm
4466 //
4467 // #define ASIZE 128
4468 //
4469 // int bm(unsigned char *x, int m, unsigned char *y, int n) {
4470 // int i, j;
4471 // unsigned c;
4472 // unsigned char bc[ASIZE];
4473 //
4474 // /* Preprocessing */
4475 // for (i = 0; i < ASIZE; ++i)
4476 // bc[i] = 0;
4477 // for (i = 0; i < m - 1; ) {
4478 // c = x[i];
4479 // ++i;
4480 // if (c < ASIZE) bc[c] = i;
4481 // }
4482 //
4483 // /* Searching */
4484 // j = 0;
4485 // while (j <= n - m) {
4486 // c = y[i+j];
4487 // if (x[m-1] == c)
4488 // for (i = m - 2; i >= 0 && x[i] == y[i + j]; --i);
4489 // if (i < 0) return j;
4490 // if (c < ASIZE)
4491 // j = j - bc[y[j+m-1]] + m;
4492 // else
4493 // j += 1; // Advance by 1 only if char >= ASIZE
4494 // }
4495 // }
4496
4497 if (icnt1 == -1) {
4498 BIND(BM);
4499
4500 Label ZLOOP, BCLOOP, BCSKIP, BMLOOPSTR2, BMLOOPSTR1, BMSKIP;
4501 Label BMADV, BMMATCH, BMCHECKEND;
4502
4503 Register cnt1end = tmp2;
4504 Register str2end = cnt2;
4505 Register skipch = tmp2;
4506
4507 // Restrict ASIZE to 128 to reduce stack space/initialisation.
4508 // The presence of chars >= ASIZE in the target string does not affect
4509 // performance, but we must be careful not to initialise them in the stack
4510 // array.
4511 // The presence of chars >= ASIZE in the source string may adversely affect
4512 // performance since we can only advance by one when we encounter one.
4513
4514 stp(zr, zr, pre(sp, -128));
4515 for (int i = 1; i < 8; i++)
4516 stp(zr, zr, Address(sp, i*16));
4517
4518 mov(cnt1tmp, 0);
4519 sub(cnt1end, cnt1, 1);
4520 BIND(BCLOOP);
4521 (this->*str1_load_1chr)(ch1, Address(str1, cnt1tmp, Address::lsl(str1_chr_shift)));
4522 cmp(ch1, 128);
4523 add(cnt1tmp, cnt1tmp, 1);
4524 br(HS, BCSKIP);
4525 strb(cnt1tmp, Address(sp, ch1));
4526 BIND(BCSKIP);
4527 cmp(cnt1tmp, cnt1end);
4528 br(LT, BCLOOP);
4529
4530 mov(result_tmp, str2);
4531
4532 sub(cnt2, cnt2, cnt1);
4533 add(str2end, str2, cnt2, LSL, str2_chr_shift);
4534 BIND(BMLOOPSTR2);
4535 sub(cnt1tmp, cnt1, 1);
4536 (this->*str1_load_1chr)(ch1, Address(str1, cnt1tmp, Address::lsl(str1_chr_shift)));
4537 (this->*str2_load_1chr)(skipch, Address(str2, cnt1tmp, Address::lsl(str2_chr_shift)));
4538 cmp(ch1, skipch);
4539 br(NE, BMSKIP);
4540 subs(cnt1tmp, cnt1tmp, 1);
4541 br(LT, BMMATCH);
4542 BIND(BMLOOPSTR1);
4543 (this->*str1_load_1chr)(ch1, Address(str1, cnt1tmp, Address::lsl(str1_chr_shift)));
4544 (this->*str2_load_1chr)(ch2, Address(str2, cnt1tmp, Address::lsl(str2_chr_shift)));
4545 cmp(ch1, ch2);
4546 br(NE, BMSKIP);
4547 subs(cnt1tmp, cnt1tmp, 1);
4548 br(GE, BMLOOPSTR1);
4549 BIND(BMMATCH);
4550 sub(result, str2, result_tmp);
4551 if (!str2_isL) lsr(result, result, 1);
4552 add(sp, sp, 128);
4553 b(DONE);
4554 BIND(BMADV);
4555 add(str2, str2, str2_chr_size);
4556 b(BMCHECKEND);
4557 BIND(BMSKIP);
4558 cmp(skipch, 128);
4559 br(HS, BMADV);
4560 ldrb(ch2, Address(sp, skipch));
4561 add(str2, str2, cnt1, LSL, str2_chr_shift);
4562 sub(str2, str2, ch2, LSL, str2_chr_shift);
4563 BIND(BMCHECKEND);
4564 cmp(str2, str2end);
4565 br(LE, BMLOOPSTR2);
4566 add(sp, sp, 128);
4567 b(NOMATCH);
4568 }
4569
4570 BIND(LINEARSEARCH);
4571 {
4572 Label DO1, DO2, DO3;
4573
4574 Register str2tmp = tmp2;
4575 Register first = tmp3;
4576
4577 if (icnt1 == -1)
4578 {
4579 Label DOSHORT, FIRST_LOOP, STR2_NEXT, STR1_LOOP, STR1_NEXT;
4580
4581 cmp(cnt1, str1_isL == str2_isL ? 4 : 2);
4582 br(LT, DOSHORT);
4583
4584 sub(cnt2, cnt2, cnt1);
4585 mov(result_tmp, cnt2);
4586
4587 lea(str1, Address(str1, cnt1, Address::lsl(str1_chr_shift)));
4588 lea(str2, Address(str2, cnt2, Address::lsl(str2_chr_shift)));
4589 sub(cnt1_neg, zr, cnt1, LSL, str1_chr_shift);
4590 sub(cnt2_neg, zr, cnt2, LSL, str2_chr_shift);
4591 (this->*str1_load_1chr)(first, Address(str1, cnt1_neg));
4592
4593 BIND(FIRST_LOOP);
4594 (this->*str2_load_1chr)(ch2, Address(str2, cnt2_neg));
4595 cmp(first, ch2);
4596 br(EQ, STR1_LOOP);
4597 BIND(STR2_NEXT);
4598 adds(cnt2_neg, cnt2_neg, str2_chr_size);
4599 br(LE, FIRST_LOOP);
4600 b(NOMATCH);
4601
4602 BIND(STR1_LOOP);
4603 adds(cnt1tmp, cnt1_neg, str1_chr_size);
4604 add(cnt2tmp, cnt2_neg, str2_chr_size);
4605 br(GE, MATCH);
4606
4607 BIND(STR1_NEXT);
4608 (this->*str1_load_1chr)(ch1, Address(str1, cnt1tmp));
4609 (this->*str2_load_1chr)(ch2, Address(str2, cnt2tmp));
4610 cmp(ch1, ch2);
4611 br(NE, STR2_NEXT);
4612 adds(cnt1tmp, cnt1tmp, str1_chr_size);
4613 add(cnt2tmp, cnt2tmp, str2_chr_size);
4614 br(LT, STR1_NEXT);
4615 b(MATCH);
4616
4617 BIND(DOSHORT);
4618 if (str1_isL == str2_isL) {
4619 cmp(cnt1, 2);
4620 br(LT, DO1);
4621 br(GT, DO3);
4622 }
4623 }
4624
4625 if (icnt1 == 4) {
4626 Label CH1_LOOP;
4627
4628 (this->*load_4chr)(ch1, str1);
4629 sub(cnt2, cnt2, 4);
4630 mov(result_tmp, cnt2);
4631 lea(str2, Address(str2, cnt2, Address::lsl(str2_chr_shift)));
4632 sub(cnt2_neg, zr, cnt2, LSL, str2_chr_shift);
4633
4634 BIND(CH1_LOOP);
4635 (this->*load_4chr)(ch2, Address(str2, cnt2_neg));
4636 cmp(ch1, ch2);
4637 br(EQ, MATCH);
4638 adds(cnt2_neg, cnt2_neg, str2_chr_size);
4639 br(LE, CH1_LOOP);
4640 b(NOMATCH);
4641 }
4642
4643 if ((icnt1 == -1 && str1_isL == str2_isL) || icnt1 == 2) {
4644 Label CH1_LOOP;
4645
4646 BIND(DO2);
4647 (this->*load_2chr)(ch1, str1);
4648 sub(cnt2, cnt2, 2);
4649 mov(result_tmp, cnt2);
4650 lea(str2, Address(str2, cnt2, Address::lsl(str2_chr_shift)));
4651 sub(cnt2_neg, zr, cnt2, LSL, str2_chr_shift);
4652
4653 BIND(CH1_LOOP);
4654 (this->*load_2chr)(ch2, Address(str2, cnt2_neg));
4655 cmp(ch1, ch2);
4656 br(EQ, MATCH);
4657 adds(cnt2_neg, cnt2_neg, str2_chr_size);
4658 br(LE, CH1_LOOP);
4659 b(NOMATCH);
4660 }
4661
4662 if ((icnt1 == -1 && str1_isL == str2_isL) || icnt1 == 3) {
4663 Label FIRST_LOOP, STR2_NEXT, STR1_LOOP;
4664
4665 BIND(DO3);
4666 (this->*load_2chr)(first, str1);
4667 (this->*str1_load_1chr)(ch1, Address(str1, 2*str1_chr_size));
4668
4669 sub(cnt2, cnt2, 3);
4670 mov(result_tmp, cnt2);
4671 lea(str2, Address(str2, cnt2, Address::lsl(str2_chr_shift)));
4672 sub(cnt2_neg, zr, cnt2, LSL, str2_chr_shift);
4673
4674 BIND(FIRST_LOOP);
4675 (this->*load_2chr)(ch2, Address(str2, cnt2_neg));
4676 cmpw(first, ch2);
4677 br(EQ, STR1_LOOP);
4678 BIND(STR2_NEXT);
4679 adds(cnt2_neg, cnt2_neg, str2_chr_size);
4680 br(LE, FIRST_LOOP);
4681 b(NOMATCH);
4682
4683 BIND(STR1_LOOP);
4684 add(cnt2tmp, cnt2_neg, 2*str2_chr_size);
4685 (this->*str2_load_1chr)(ch2, Address(str2, cnt2tmp));
4686 cmp(ch1, ch2);
4687 br(NE, STR2_NEXT);
4688 b(MATCH);
4689 }
4690
4691 if (icnt1 == -1 || icnt1 == 1) {
4692 Label CH1_LOOP, HAS_ZERO;
4693 Label DO1_SHORT, DO1_LOOP;
4694
4695 BIND(DO1);
4696 (this->*str1_load_1chr)(ch1, str1);
4697 cmp(cnt2, 8);
4698 br(LT, DO1_SHORT);
4699
4700 if (str2_isL) {
4701 if (!str1_isL) {
4702 tst(ch1, 0xff00);
4703 br(NE, NOMATCH);
4704 }
4705 orr(ch1, ch1, ch1, LSL, 8);
4706 }
4707 orr(ch1, ch1, ch1, LSL, 16);
4708 orr(ch1, ch1, ch1, LSL, 32);
4709
4710 sub(cnt2, cnt2, 8/str2_chr_size);
4711 mov(result_tmp, cnt2);
4712 lea(str2, Address(str2, cnt2, Address::lsl(str2_chr_shift)));
4713 sub(cnt2_neg, zr, cnt2, LSL, str2_chr_shift);
4714
4715 mov(tmp3, str2_isL ? 0x0101010101010101 : 0x0001000100010001);
4716 BIND(CH1_LOOP);
4717 ldr(ch2, Address(str2, cnt2_neg));
4718 eor(ch2, ch1, ch2);
4719 sub(tmp1, ch2, tmp3);
4720 orr(tmp2, ch2, str2_isL ? 0x7f7f7f7f7f7f7f7f : 0x7fff7fff7fff7fff);
4721 bics(tmp1, tmp1, tmp2);
4722 br(NE, HAS_ZERO);
4723 adds(cnt2_neg, cnt2_neg, 8);
4724 br(LT, CH1_LOOP);
4725
4726 cmp(cnt2_neg, 8);
4727 mov(cnt2_neg, 0);
4728 br(LT, CH1_LOOP);
4729 b(NOMATCH);
4730
4731 BIND(HAS_ZERO);
4732 rev(tmp1, tmp1);
4733 clz(tmp1, tmp1);
4734 add(cnt2_neg, cnt2_neg, tmp1, LSR, 3);
4735 b(MATCH);
4736
4737 BIND(DO1_SHORT);
4738 mov(result_tmp, cnt2);
4739 lea(str2, Address(str2, cnt2, Address::lsl(str2_chr_shift)));
4740 sub(cnt2_neg, zr, cnt2, LSL, str2_chr_shift);
4741 BIND(DO1_LOOP);
4742 (this->*str2_load_1chr)(ch2, Address(str2, cnt2_neg));
4743 cmpw(ch1, ch2);
4744 br(EQ, MATCH);
4745 adds(cnt2_neg, cnt2_neg, str2_chr_size);
4746 br(LT, DO1_LOOP);
4747 }
4748 }
4749 BIND(NOMATCH);
4750 mov(result, -1);
4751 b(DONE);
4752 BIND(MATCH);
4753 add(result, result_tmp, cnt2_neg, ASR, str2_chr_shift);
4754 BIND(DONE);
4755 }
4756
4757 typedef void (MacroAssembler::* chr_insn)(Register Rt, const Address &adr);
4758 typedef void (MacroAssembler::* uxt_insn)(Register Rd, Register Rn);
4759
4760 void MacroAssembler::string_indexof_char(Register str1, Register cnt1,
4761 Register ch, Register result,
4762 Register tmp1, Register tmp2, Register tmp3)
4763 {
4764 Label CH1_LOOP, HAS_ZERO, DO1_SHORT, DO1_LOOP, MATCH, NOMATCH, DONE;
4765 Register cnt1_neg = cnt1;
4766 Register ch1 = rscratch1;
4767 Register result_tmp = rscratch2;
4768
4769 cmp(cnt1, 4);
4770 br(LT, DO1_SHORT);
4771
4772 orr(ch, ch, ch, LSL, 16);
4773 orr(ch, ch, ch, LSL, 32);
4774
4775 sub(cnt1, cnt1, 4);
4776 mov(result_tmp, cnt1);
4777 lea(str1, Address(str1, cnt1, Address::uxtw(1)));
4778 sub(cnt1_neg, zr, cnt1, LSL, 1);
4779
4780 mov(tmp3, 0x0001000100010001);
4781
4782 BIND(CH1_LOOP);
4783 ldr(ch1, Address(str1, cnt1_neg));
4784 eor(ch1, ch, ch1);
4785 sub(tmp1, ch1, tmp3);
4786 orr(tmp2, ch1, 0x7fff7fff7fff7fff);
4787 bics(tmp1, tmp1, tmp2);
4788 br(NE, HAS_ZERO);
4789 adds(cnt1_neg, cnt1_neg, 8);
4790 br(LT, CH1_LOOP);
4791
4792 cmp(cnt1_neg, 8);
4793 mov(cnt1_neg, 0);
4794 br(LT, CH1_LOOP);
4795 b(NOMATCH);
4796
4797 BIND(HAS_ZERO);
4798 rev(tmp1, tmp1);
4799 clz(tmp1, tmp1);
4800 add(cnt1_neg, cnt1_neg, tmp1, LSR, 3);
4801 b(MATCH);
4802
4803 BIND(DO1_SHORT);
4804 mov(result_tmp, cnt1);
4805 lea(str1, Address(str1, cnt1, Address::uxtw(1)));
4806 sub(cnt1_neg, zr, cnt1, LSL, 1);
4807 BIND(DO1_LOOP);
4808 ldrh(ch1, Address(str1, cnt1_neg));
4809 cmpw(ch, ch1);
4810 br(EQ, MATCH);
4811 adds(cnt1_neg, cnt1_neg, 2);
4812 br(LT, DO1_LOOP);
4813 BIND(NOMATCH);
4814 mov(result, -1);
4815 b(DONE);
4816 BIND(MATCH);
4817 add(result, result_tmp, cnt1_neg, ASR, 1);
4818 BIND(DONE);
4819 }
4820
4821 // Compare strings.
4822 void MacroAssembler::string_compare(Register str1, Register str2,
4823 Register cnt1, Register cnt2, Register result,
4824 Register tmp1,
4825 FloatRegister vtmp, FloatRegister vtmpZ, int ae) {
4826 Label LENGTH_DIFF, DONE, SHORT_LOOP, SHORT_STRING,
4827 NEXT_WORD, DIFFERENCE;
4828
4829 bool isLL = ae == StrIntrinsicNode::LL;
4830 bool isLU = ae == StrIntrinsicNode::LU;
4831 bool isUL = ae == StrIntrinsicNode::UL;
4832
4833 bool str1_isL = isLL || isLU;
4834 bool str2_isL = isLL || isUL;
4835
4836 int str1_chr_shift = str1_isL ? 0 : 1;
4837 int str2_chr_shift = str2_isL ? 0 : 1;
4838 int str1_chr_size = str1_isL ? 1 : 2;
4839 int str2_chr_size = str2_isL ? 1 : 2;
4840
4841 chr_insn str1_load_chr = str1_isL ? (chr_insn)&MacroAssembler::ldrb :
4842 (chr_insn)&MacroAssembler::ldrh;
4843 chr_insn str2_load_chr = str2_isL ? (chr_insn)&MacroAssembler::ldrb :
4844 (chr_insn)&MacroAssembler::ldrh;
4845 uxt_insn ext_chr = isLL ? (uxt_insn)&MacroAssembler::uxtbw :
4846 (uxt_insn)&MacroAssembler::uxthw;
4847
4848 BLOCK_COMMENT("string_compare {");
4849
4850 // Bizzarely, the counts are passed in bytes, regardless of whether they
4851 // are L or U strings, however the result is always in characters.
4852 if (!str1_isL) asrw(cnt1, cnt1, 1);
4853 if (!str2_isL) asrw(cnt2, cnt2, 1);
4854
4855 // Compute the minimum of the string lengths and save the difference.
4856 subsw(tmp1, cnt1, cnt2);
4857 cselw(cnt2, cnt1, cnt2, Assembler::LE); // min
4858
4859 // A very short string
4860 cmpw(cnt2, isLL ? 8:4);
4861 br(Assembler::LT, SHORT_STRING);
4862
4863 // Check if the strings start at the same location.
4864 cmp(str1, str2);
4865 br(Assembler::EQ, LENGTH_DIFF);
4866
4867 // Compare longwords
4868 {
4869 subw(cnt2, cnt2, isLL ? 8:4); // The last longword is a special case
4870
4871 // Move both string pointers to the last longword of their
4872 // strings, negate the remaining count, and convert it to bytes.
4873 lea(str1, Address(str1, cnt2, Address::uxtw(str1_chr_shift)));
4874 lea(str2, Address(str2, cnt2, Address::uxtw(str2_chr_shift)));
4875 if (isLU || isUL) {
4876 sub(cnt1, zr, cnt2, LSL, str1_chr_shift);
4877 eor(vtmpZ, T16B, vtmpZ, vtmpZ);
4878 }
4879 sub(cnt2, zr, cnt2, LSL, str2_chr_shift);
4880
4881 // Loop, loading longwords and comparing them into rscratch2.
4882 bind(NEXT_WORD);
4883 if (isLU) {
4884 ldrs(vtmp, Address(str1, cnt1));
4885 zip1(vtmp, T8B, vtmp, vtmpZ);
4886 umov(result, vtmp, D, 0);
4887 } else {
4888 ldr(result, Address(str1, isUL ? cnt1:cnt2));
4889 }
4890 if (isUL) {
4891 ldrs(vtmp, Address(str2, cnt2));
4892 zip1(vtmp, T8B, vtmp, vtmpZ);
4893 umov(rscratch1, vtmp, D, 0);
4894 } else {
4895 ldr(rscratch1, Address(str2, cnt2));
4896 }
4897 adds(cnt2, cnt2, isUL ? 4:8);
4898 if (isLU || isUL) add(cnt1, cnt1, isLU ? 4:8);
4899 eor(rscratch2, result, rscratch1);
4900 cbnz(rscratch2, DIFFERENCE);
4901 br(Assembler::LT, NEXT_WORD);
4902
4903 // Last longword. In the case where length == 4 we compare the
4904 // same longword twice, but that's still faster than another
4905 // conditional branch.
4906
4907 if (isLU) {
4908 ldrs(vtmp, Address(str1));
4909 zip1(vtmp, T8B, vtmp, vtmpZ);
4910 umov(result, vtmp, D, 0);
4911 } else {
4912 ldr(result, Address(str1));
4913 }
4914 if (isUL) {
4915 ldrs(vtmp, Address(str2));
4916 zip1(vtmp, T8B, vtmp, vtmpZ);
4917 umov(rscratch1, vtmp, D, 0);
4918 } else {
4919 ldr(rscratch1, Address(str2));
4920 }
4921 eor(rscratch2, result, rscratch1);
4922 cbz(rscratch2, LENGTH_DIFF);
4923
4924 // Find the first different characters in the longwords and
4925 // compute their difference.
4926 bind(DIFFERENCE);
4927 rev(rscratch2, rscratch2);
4928 clz(rscratch2, rscratch2);
4929 andr(rscratch2, rscratch2, isLL ? -8 : -16);
4930 lsrv(result, result, rscratch2);
4931 (this->*ext_chr)(result, result);
4932 lsrv(rscratch1, rscratch1, rscratch2);
4933 (this->*ext_chr)(rscratch1, rscratch1);
4934 subw(result, result, rscratch1);
4935 b(DONE);
4936 }
4937
4938 bind(SHORT_STRING);
4939 // Is the minimum length zero?
4940 cbz(cnt2, LENGTH_DIFF);
4941
4942 bind(SHORT_LOOP);
4943 (this->*str1_load_chr)(result, Address(post(str1, str1_chr_size)));
4944 (this->*str2_load_chr)(cnt1, Address(post(str2, str2_chr_size)));
4945 subw(result, result, cnt1);
4946 cbnz(result, DONE);
4947 sub(cnt2, cnt2, 1);
4948 cbnz(cnt2, SHORT_LOOP);
4949
4950 // Strings are equal up to min length. Return the length difference.
4951 bind(LENGTH_DIFF);
4952 mov(result, tmp1);
4953
4954 // That's it
4955 bind(DONE);
4956
4957 BLOCK_COMMENT("} string_compare");
4958 }
4959
4960 // This method checks if provided byte array contains byte with highest bit set.
4961 void MacroAssembler::has_negatives(Register ary1, Register len, Register result) {
4962 // Simple and most common case of aligned small array which is not at the
4963 // end of memory page is placed here. All other cases are in stub.
4964 Label LOOP, END, STUB, STUB_LONG, SET_RESULT, DONE;
4965 const uint64_t UPPER_BIT_MASK=0x8080808080808080;
4966 assert_different_registers(ary1, len, result);
4967
4968 cmpw(len, 0);
4969 br(LE, SET_RESULT);
4970 cmpw(len, 4 * wordSize);
4971 br(GE, STUB_LONG); // size > 32 then go to stub
4972
4973 int shift = 64 - exact_log2(os::vm_page_size());
4974 lsl(rscratch1, ary1, shift);
4975 mov(rscratch2, (size_t)(4 * wordSize) << shift);
4976 adds(rscratch2, rscratch1, rscratch2); // At end of page?
4977 br(CS, STUB); // at the end of page then go to stub
4978 subs(len, len, wordSize);
4979 br(LT, END);
4980
4981 BIND(LOOP);
4982 ldr(rscratch1, Address(post(ary1, wordSize)));
4983 tst(rscratch1, UPPER_BIT_MASK);
4984 br(NE, SET_RESULT);
4985 subs(len, len, wordSize);
4986 br(GE, LOOP);
4987 cmpw(len, -wordSize);
4988 br(EQ, SET_RESULT);
4989
4990 BIND(END);
4991 ldr(result, Address(ary1));
4992 sub(len, zr, len, LSL, 3); // LSL 3 is to get bits from bytes
4993 lslv(result, result, len);
4994 tst(result, UPPER_BIT_MASK);
4995 b(SET_RESULT);
4996
4997 BIND(STUB);
4998 RuntimeAddress has_neg = RuntimeAddress(StubRoutines::aarch64::has_negatives());
4999 assert(has_neg.target() != NULL, "has_negatives stub has not been generated");
5000 trampoline_call(has_neg);
5001 b(DONE);
5002
5003 BIND(STUB_LONG);
5004 RuntimeAddress has_neg_long = RuntimeAddress(
5005 StubRoutines::aarch64::has_negatives_long());
5006 assert(has_neg_long.target() != NULL, "has_negatives stub has not been generated");
5007 trampoline_call(has_neg_long);
5008 b(DONE);
5009
5010 BIND(SET_RESULT);
5011 cset(result, NE); // set true or false
5012
5013 BIND(DONE);
5014 }
5015
5016 void MacroAssembler::arrays_equals(Register a1, Register a2, Register tmp3,
5017 Register tmp4, Register tmp5, Register result,
5018 Register cnt1, int elem_size)
5019 {
5020 Label DONE;
5021 Register tmp1 = rscratch1;
5022 Register tmp2 = rscratch2;
5023 Register cnt2 = tmp2; // cnt2 only used in array length compare
5024 int elem_per_word = wordSize/elem_size;
5025 int log_elem_size = exact_log2(elem_size);
5026 int length_offset = arrayOopDesc::length_offset_in_bytes();
5027 int base_offset
5028 = arrayOopDesc::base_offset_in_bytes(elem_size == 2 ? T_CHAR : T_BYTE);
5029 int stubBytesThreshold = 3 * 64 + (UseSIMDForArrayEquals ? 0 : 16);
5030
5031 assert(elem_size == 1 || elem_size == 2, "must be char or byte");
5032 assert_different_registers(a1, a2, result, cnt1, rscratch1, rscratch2);
5033
5034 #ifndef PRODUCT
5035 {
5036 const char kind = (elem_size == 2) ? 'U' : 'L';
5037 char comment[64];
5038 snprintf(comment, sizeof comment, "array_equals%c{", kind);
5039 BLOCK_COMMENT(comment);
5040 }
5041 #endif
5042 if (UseSimpleArrayEquals) {
5043 Label NEXT_WORD, SHORT, SAME, TAIL03, TAIL01, A_MIGHT_BE_NULL, A_IS_NOT_NULL;
5044 // if (a1==a2)
5045 // return true;
5046 // if (a==null || a2==null)
5047 // return false;
5048 // a1 & a2 == 0 means (some-pointer is null) or
5049 // (very-rare-or-even-probably-impossible-pointer-values)
5050 // so, we can save one branch in most cases
5051 eor(rscratch1, a1, a2);
5052 tst(a1, a2);
5053 mov(result, false);
5054 cbz(rscratch1, SAME);
5055 br(EQ, A_MIGHT_BE_NULL);
5056 // if (a1.length != a2.length)
5057 // return false;
5058 bind(A_IS_NOT_NULL);
5059 ldrw(cnt1, Address(a1, length_offset));
5060 ldrw(cnt2, Address(a2, length_offset));
5061 eorw(tmp5, cnt1, cnt2);
5062 cbnzw(tmp5, DONE);
5063 lea(a1, Address(a1, base_offset));
5064 lea(a2, Address(a2, base_offset));
5065 // Check for short strings, i.e. smaller than wordSize.
5066 subs(cnt1, cnt1, elem_per_word);
5067 br(Assembler::LT, SHORT);
5068 // Main 8 byte comparison loop.
5069 bind(NEXT_WORD); {
5070 ldr(tmp1, Address(post(a1, wordSize)));
5071 ldr(tmp2, Address(post(a2, wordSize)));
5072 subs(cnt1, cnt1, elem_per_word);
5073 eor(tmp5, tmp1, tmp2);
5074 cbnz(tmp5, DONE);
5075 } br(GT, NEXT_WORD);
5076 // Last longword. In the case where length == 4 we compare the
5077 // same longword twice, but that's still faster than another
5078 // conditional branch.
5079 // cnt1 could be 0, -1, -2, -3, -4 for chars; -4 only happens when
5080 // length == 4.
5081 if (log_elem_size > 0)
5082 lsl(cnt1, cnt1, log_elem_size);
5083 ldr(tmp3, Address(a1, cnt1));
5084 ldr(tmp4, Address(a2, cnt1));
5085 eor(tmp5, tmp3, tmp4);
5086 cbnz(tmp5, DONE);
5087 b(SAME);
5088 bind(A_MIGHT_BE_NULL);
5089 // in case both a1 and a2 are not-null, proceed with loads
5090 cbz(a1, DONE);
5091 cbz(a2, DONE);
5092 b(A_IS_NOT_NULL);
5093 bind(SHORT);
5094
5095 tbz(cnt1, 2 - log_elem_size, TAIL03); // 0-7 bytes left.
5096 {
5097 ldrw(tmp1, Address(post(a1, 4)));
5098 ldrw(tmp2, Address(post(a2, 4)));
5099 eorw(tmp5, tmp1, tmp2);
5100 cbnzw(tmp5, DONE);
5101 }
5102 bind(TAIL03);
5103 tbz(cnt1, 1 - log_elem_size, TAIL01); // 0-3 bytes left.
5104 {
5105 ldrh(tmp3, Address(post(a1, 2)));
5106 ldrh(tmp4, Address(post(a2, 2)));
5107 eorw(tmp5, tmp3, tmp4);
5108 cbnzw(tmp5, DONE);
5109 }
5110 bind(TAIL01);
5111 if (elem_size == 1) { // Only needed when comparing byte arrays.
5112 tbz(cnt1, 0, SAME); // 0-1 bytes left.
5113 {
5114 ldrb(tmp1, a1);
5115 ldrb(tmp2, a2);
5116 eorw(tmp5, tmp1, tmp2);
5117 cbnzw(tmp5, DONE);
5118 }
5119 }
5120 bind(SAME);
5121 mov(result, true);
5122 } else {
5123 Label NEXT_DWORD, A_IS_NULL, SHORT, TAIL, TAIL2, STUB, EARLY_OUT,
5124 CSET_EQ, LAST_CHECK, LEN_IS_ZERO, SAME;
5125 cbz(a1, A_IS_NULL);
5126 ldrw(cnt1, Address(a1, length_offset));
5127 cbz(a2, A_IS_NULL);
5128 ldrw(cnt2, Address(a2, length_offset));
5129 mov(result, false);
5130 // on most CPUs a2 is still "locked"(surprisingly) in ldrw and it's
5131 // faster to perform another branch before comparing a1 and a2
5132 cmp(cnt1, elem_per_word);
5133 br(LE, SHORT); // short or same
5134 cmp(a1, a2);
5135 br(EQ, SAME);
5136 ldr(tmp3, Address(pre(a1, base_offset)));
5137 cmp(cnt1, stubBytesThreshold);
5138 br(GE, STUB);
5139 ldr(tmp4, Address(pre(a2, base_offset)));
5140 sub(tmp5, zr, cnt1, LSL, 3 + log_elem_size);
5141 cmp(cnt2, cnt1);
5142 br(NE, DONE);
5143
5144 // Main 16 byte comparison loop with 2 exits
5145 bind(NEXT_DWORD); {
5146 ldr(tmp1, Address(pre(a1, wordSize)));
5147 ldr(tmp2, Address(pre(a2, wordSize)));
5148 subs(cnt1, cnt1, 2 * elem_per_word);
5149 br(LE, TAIL);
5150 eor(tmp4, tmp3, tmp4);
5151 cbnz(tmp4, DONE);
5152 ldr(tmp3, Address(pre(a1, wordSize)));
5153 ldr(tmp4, Address(pre(a2, wordSize)));
5154 cmp(cnt1, elem_per_word);
5155 br(LE, TAIL2);
5156 cmp(tmp1, tmp2);
5157 } br(EQ, NEXT_DWORD);
5158 b(DONE);
5159
5160 bind(TAIL);
5161 eor(tmp4, tmp3, tmp4);
5162 eor(tmp2, tmp1, tmp2);
5163 lslv(tmp2, tmp2, tmp5);
5164 orr(tmp5, tmp4, tmp2);
5165 cmp(tmp5, zr);
5166 b(CSET_EQ);
5167
5168 bind(TAIL2);
5169 eor(tmp2, tmp1, tmp2);
5170 cbnz(tmp2, DONE);
5171 b(LAST_CHECK);
5172
5173 bind(STUB);
5174 ldr(tmp4, Address(pre(a2, base_offset)));
5175 cmp(cnt2, cnt1);
5176 br(NE, DONE);
5177 if (elem_size == 2) { // convert to byte counter
5178 lsl(cnt1, cnt1, 1);
5179 }
5180 eor(tmp5, tmp3, tmp4);
5181 cbnz(tmp5, DONE);
5182 RuntimeAddress stub = RuntimeAddress(StubRoutines::aarch64::large_array_equals());
5183 assert(stub.target() != NULL, "array_equals_long stub has not been generated");
5184 trampoline_call(stub);
5185 b(DONE);
5186
5187 bind(SAME);
5188 mov(result, true);
5189 b(DONE);
5190 bind(A_IS_NULL);
5191 // a1 or a2 is null. if a2 == a2 then return true. else return false
5192 cmp(a1, a2);
5193 b(CSET_EQ);
5194 bind(EARLY_OUT);
5195 // (a1 != null && a2 == null) || (a1 != null && a2 != null && a1 == a2)
5196 // so, if a2 == null => return false(0), else return true, so we can return a2
5197 mov(result, a2);
5198 b(DONE);
5199 bind(LEN_IS_ZERO);
5200 cmp(cnt2, zr);
5201 b(CSET_EQ);
5202 bind(SHORT);
5203 cbz(cnt1, LEN_IS_ZERO);
5204 sub(tmp5, zr, cnt1, LSL, 3 + log_elem_size);
5205 ldr(tmp3, Address(a1, base_offset));
5206 ldr(tmp4, Address(a2, base_offset));
5207 bind(LAST_CHECK);
5208 eor(tmp4, tmp3, tmp4);
5209 lslv(tmp5, tmp4, tmp5);
5210 cmp(tmp5, zr);
5211 bind(CSET_EQ);
5212 cset(result, EQ);
5213 }
5214
5215 // That's it.
5216 bind(DONE);
5217
5218 BLOCK_COMMENT("} array_equals");
5219 }
5220
5221 // Compare Strings
5222
5223 // For Strings we're passed the address of the first characters in a1
5224 // and a2 and the length in cnt1.
5225 // elem_size is the element size in bytes: either 1 or 2.
5226 // There are two implementations. For arrays >= 8 bytes, all
5227 // comparisons (including the final one, which may overlap) are
5228 // performed 8 bytes at a time. For strings < 8 bytes, we compare a
5229 // halfword, then a short, and then a byte.
5230
5231 void MacroAssembler::string_equals(Register a1, Register a2,
5232 Register result, Register cnt1, int elem_size)
5233 {
5234 Label SAME, DONE, SHORT, NEXT_WORD;
5235 Register tmp1 = rscratch1;
5236 Register tmp2 = rscratch2;
5237 Register cnt2 = tmp2; // cnt2 only used in array length compare
5238
5239 assert(elem_size == 1 || elem_size == 2, "must be 2 or 1 byte");
5240 assert_different_registers(a1, a2, result, cnt1, rscratch1, rscratch2);
5241
5242 #ifndef PRODUCT
5243 {
5244 const char kind = (elem_size == 2) ? 'U' : 'L';
5245 char comment[64];
5246 snprintf(comment, sizeof comment, "{string_equals%c", kind);
5247 BLOCK_COMMENT(comment);
5248 }
5249 #endif
5250
5251 mov(result, false);
5252
5253 // Check for short strings, i.e. smaller than wordSize.
5254 subs(cnt1, cnt1, wordSize);
5255 br(Assembler::LT, SHORT);
5256 // Main 8 byte comparison loop.
5257 bind(NEXT_WORD); {
5258 ldr(tmp1, Address(post(a1, wordSize)));
5259 ldr(tmp2, Address(post(a2, wordSize)));
5260 subs(cnt1, cnt1, wordSize);
5261 eor(tmp1, tmp1, tmp2);
5262 cbnz(tmp1, DONE);
5263 } br(GT, NEXT_WORD);
5264 // Last longword. In the case where length == 4 we compare the
5265 // same longword twice, but that's still faster than another
5266 // conditional branch.
5267 // cnt1 could be 0, -1, -2, -3, -4 for chars; -4 only happens when
5268 // length == 4.
5269 ldr(tmp1, Address(a1, cnt1));
5270 ldr(tmp2, Address(a2, cnt1));
5271 eor(tmp2, tmp1, tmp2);
5272 cbnz(tmp2, DONE);
5273 b(SAME);
5274
5275 bind(SHORT);
5276 Label TAIL03, TAIL01;
5277
5278 tbz(cnt1, 2, TAIL03); // 0-7 bytes left.
5279 {
5280 ldrw(tmp1, Address(post(a1, 4)));
5281 ldrw(tmp2, Address(post(a2, 4)));
5282 eorw(tmp1, tmp1, tmp2);
5283 cbnzw(tmp1, DONE);
5284 }
5285 bind(TAIL03);
5286 tbz(cnt1, 1, TAIL01); // 0-3 bytes left.
5287 {
5288 ldrh(tmp1, Address(post(a1, 2)));
5289 ldrh(tmp2, Address(post(a2, 2)));
5290 eorw(tmp1, tmp1, tmp2);
5291 cbnzw(tmp1, DONE);
5292 }
5293 bind(TAIL01);
5294 if (elem_size == 1) { // Only needed when comparing 1-byte elements
5295 tbz(cnt1, 0, SAME); // 0-1 bytes left.
5296 {
5297 ldrb(tmp1, a1);
5298 ldrb(tmp2, a2);
5299 eorw(tmp1, tmp1, tmp2);
5300 cbnzw(tmp1, DONE);
5301 }
5302 }
5303 // Arrays are equal.
5304 bind(SAME);
5305 mov(result, true);
5306
5307 // That's it.
5308 bind(DONE);
5309 BLOCK_COMMENT("} string_equals");
5310 }
5311
5312
5313 // The size of the blocks erased by the zero_blocks stub. We must
5314 // handle anything smaller than this ourselves in zero_words().
5315 const int MacroAssembler::zero_words_block_size = 8;
5316
5317 // zero_words() is used by C2 ClearArray patterns. It is as small as
5318 // possible, handling small word counts locally and delegating
5319 // anything larger to the zero_blocks stub. It is expanded many times
5320 // in compiled code, so it is important to keep it short.
5321
5322 // ptr: Address of a buffer to be zeroed.
5323 // cnt: Count in HeapWords.
5324 //
5325 // ptr, cnt, rscratch1, and rscratch2 are clobbered.
5326 void MacroAssembler::zero_words(Register ptr, Register cnt)
5327 {
5328 assert(is_power_of_2(zero_words_block_size), "adjust this");
5329 assert(ptr == r10 && cnt == r11, "mismatch in register usage");
5330
5331 BLOCK_COMMENT("zero_words {");
5332 cmp(cnt, zero_words_block_size);
5333 Label around, done, done16;
5334 br(LO, around);
5335 {
5336 RuntimeAddress zero_blocks = RuntimeAddress(StubRoutines::aarch64::zero_blocks());
5337 assert(zero_blocks.target() != NULL, "zero_blocks stub has not been generated");
5338 if (StubRoutines::aarch64::complete()) {
5339 trampoline_call(zero_blocks);
5340 } else {
5341 bl(zero_blocks);
5342 }
5343 }
5344 bind(around);
5345 for (int i = zero_words_block_size >> 1; i > 1; i >>= 1) {
5346 Label l;
5347 tbz(cnt, exact_log2(i), l);
5348 for (int j = 0; j < i; j += 2) {
5349 stp(zr, zr, post(ptr, 16));
5350 }
5351 bind(l);
5352 }
5353 {
5354 Label l;
5355 tbz(cnt, 0, l);
5356 str(zr, Address(ptr));
5357 bind(l);
5358 }
5359 BLOCK_COMMENT("} zero_words");
5360 }
5361
5362 // base: Address of a buffer to be zeroed, 8 bytes aligned.
5363 // cnt: Immediate count in HeapWords.
5364 #define SmallArraySize (18 * BytesPerLong)
5365 void MacroAssembler::zero_words(Register base, u_int64_t cnt)
5366 {
5367 BLOCK_COMMENT("zero_words {");
5368 int i = cnt & 1; // store any odd word to start
5369 if (i) str(zr, Address(base));
5370
5371 if (cnt <= SmallArraySize / BytesPerLong) {
5372 for (; i < (int)cnt; i += 2)
5373 stp(zr, zr, Address(base, i * wordSize));
5374 } else {
5375 const int unroll = 4; // Number of stp(zr, zr) instructions we'll unroll
5376 int remainder = cnt % (2 * unroll);
5377 for (; i < remainder; i += 2)
5378 stp(zr, zr, Address(base, i * wordSize));
5379
5380 Label loop;
5381 Register cnt_reg = rscratch1;
5382 Register loop_base = rscratch2;
5383 cnt = cnt - remainder;
5384 mov(cnt_reg, cnt);
5385 // adjust base and prebias by -2 * wordSize so we can pre-increment
5386 add(loop_base, base, (remainder - 2) * wordSize);
5387 bind(loop);
5388 sub(cnt_reg, cnt_reg, 2 * unroll);
5389 for (i = 1; i < unroll; i++)
5390 stp(zr, zr, Address(loop_base, 2 * i * wordSize));
5391 stp(zr, zr, Address(pre(loop_base, 2 * unroll * wordSize)));
5392 cbnz(cnt_reg, loop);
5393 }
5394 BLOCK_COMMENT("} zero_words");
5395 }
5396
5397 // Zero blocks of memory by using DC ZVA.
5398 //
5399 // Aligns the base address first sufficently for DC ZVA, then uses
5400 // DC ZVA repeatedly for every full block. cnt is the size to be
5401 // zeroed in HeapWords. Returns the count of words left to be zeroed
5402 // in cnt.
5403 //
5404 // NOTE: This is intended to be used in the zero_blocks() stub. If
5405 // you want to use it elsewhere, note that cnt must be >= 2*zva_length.
5406 void MacroAssembler::zero_dcache_blocks(Register base, Register cnt) {
5407 Register tmp = rscratch1;
5408 Register tmp2 = rscratch2;
5409 int zva_length = VM_Version::zva_length();
5410 Label initial_table_end, loop_zva;
5411 Label fini;
5412
5413 // Base must be 16 byte aligned. If not just return and let caller handle it
5414 tst(base, 0x0f);
5415 br(Assembler::NE, fini);
5416 // Align base with ZVA length.
5417 neg(tmp, base);
5418 andr(tmp, tmp, zva_length - 1);
5419
5420 // tmp: the number of bytes to be filled to align the base with ZVA length.
5421 add(base, base, tmp);
5422 sub(cnt, cnt, tmp, Assembler::ASR, 3);
5423 adr(tmp2, initial_table_end);
5424 sub(tmp2, tmp2, tmp, Assembler::LSR, 2);
5425 br(tmp2);
5426
5427 for (int i = -zva_length + 16; i < 0; i += 16)
5428 stp(zr, zr, Address(base, i));
5429 bind(initial_table_end);
5430
5431 sub(cnt, cnt, zva_length >> 3);
5432 bind(loop_zva);
5433 dc(Assembler::ZVA, base);
5434 subs(cnt, cnt, zva_length >> 3);
5435 add(base, base, zva_length);
5436 br(Assembler::GE, loop_zva);
5437 add(cnt, cnt, zva_length >> 3); // count not zeroed by DC ZVA
5438 bind(fini);
5439 }
5440
5441 // base: Address of a buffer to be filled, 8 bytes aligned.
5442 // cnt: Count in 8-byte unit.
5443 // value: Value to be filled with.
5444 // base will point to the end of the buffer after filling.
5445 void MacroAssembler::fill_words(Register base, Register cnt, Register value)
5446 {
5447 // Algorithm:
5448 //
5449 // scratch1 = cnt & 7;
5450 // cnt -= scratch1;
5451 // p += scratch1;
5452 // switch (scratch1) {
5453 // do {
5454 // cnt -= 8;
5455 // p[-8] = v;
5456 // case 7:
5457 // p[-7] = v;
5458 // case 6:
5459 // p[-6] = v;
5460 // // ...
5461 // case 1:
5462 // p[-1] = v;
5463 // case 0:
5464 // p += 8;
5465 // } while (cnt);
5466 // }
5467
5468 assert_different_registers(base, cnt, value, rscratch1, rscratch2);
5469
5470 Label fini, skip, entry, loop;
5471 const int unroll = 8; // Number of stp instructions we'll unroll
5472
5473 cbz(cnt, fini);
5474 tbz(base, 3, skip);
5475 str(value, Address(post(base, 8)));
5476 sub(cnt, cnt, 1);
5477 bind(skip);
5478
5479 andr(rscratch1, cnt, (unroll-1) * 2);
5480 sub(cnt, cnt, rscratch1);
5481 add(base, base, rscratch1, Assembler::LSL, 3);
5482 adr(rscratch2, entry);
5483 sub(rscratch2, rscratch2, rscratch1, Assembler::LSL, 1);
5484 br(rscratch2);
5485
5486 bind(loop);
5487 add(base, base, unroll * 16);
5488 for (int i = -unroll; i < 0; i++)
5489 stp(value, value, Address(base, i * 16));
5490 bind(entry);
5491 subs(cnt, cnt, unroll * 2);
5492 br(Assembler::GE, loop);
5493
5494 tbz(cnt, 0, fini);
5495 str(value, Address(post(base, 8)));
5496 bind(fini);
5497 }
5498
5499 // Intrinsic for sun/nio/cs/ISO_8859_1$Encoder.implEncodeISOArray and
5500 // java/lang/StringUTF16.compress.
5501 void MacroAssembler::encode_iso_array(Register src, Register dst,
5502 Register len, Register result,
5503 FloatRegister Vtmp1, FloatRegister Vtmp2,
5504 FloatRegister Vtmp3, FloatRegister Vtmp4)
5505 {
5506 Label DONE, NEXT_32, LOOP_8, NEXT_8, LOOP_1, NEXT_1;
5507 Register tmp1 = rscratch1;
5508
5509 mov(result, len); // Save initial len
5510
5511 #ifndef BUILTIN_SIM
5512 subs(len, len, 32);
5513 br(LT, LOOP_8);
5514
5515 // The following code uses the SIMD 'uqxtn' and 'uqxtn2' instructions
5516 // to convert chars to bytes. These set the 'QC' bit in the FPSR if
5517 // any char could not fit in a byte, so clear the FPSR so we can test it.
5518 clear_fpsr();
5519
5520 BIND(NEXT_32);
5521 ld1(Vtmp1, Vtmp2, Vtmp3, Vtmp4, T8H, src);
5522 uqxtn(Vtmp1, T8B, Vtmp1, T8H); // uqxtn - write bottom half
5523 uqxtn(Vtmp1, T16B, Vtmp2, T8H); // uqxtn2 - write top half
5524 uqxtn(Vtmp2, T8B, Vtmp3, T8H);
5525 uqxtn(Vtmp2, T16B, Vtmp4, T8H); // uqxtn2
5526 get_fpsr(tmp1);
5527 cbnzw(tmp1, LOOP_8);
5528 st1(Vtmp1, Vtmp2, T16B, post(dst, 32));
5529 subs(len, len, 32);
5530 add(src, src, 64);
5531 br(GE, NEXT_32);
5532
5533 BIND(LOOP_8);
5534 adds(len, len, 32-8);
5535 br(LT, LOOP_1);
5536 clear_fpsr(); // QC may be set from loop above, clear again
5537 BIND(NEXT_8);
5538 ld1(Vtmp1, T8H, src);
5539 uqxtn(Vtmp1, T8B, Vtmp1, T8H);
5540 get_fpsr(tmp1);
5541 cbnzw(tmp1, LOOP_1);
5542 st1(Vtmp1, T8B, post(dst, 8));
5543 subs(len, len, 8);
5544 add(src, src, 16);
5545 br(GE, NEXT_8);
5546
5547 BIND(LOOP_1);
5548 adds(len, len, 8);
5549 br(LE, DONE);
5550 #else
5551 cbz(len, DONE);
5552 #endif
5553 BIND(NEXT_1);
5554 ldrh(tmp1, Address(post(src, 2)));
5555 tst(tmp1, 0xff00);
5556 br(NE, DONE);
5557 strb(tmp1, Address(post(dst, 1)));
5558 subs(len, len, 1);
5559 br(GT, NEXT_1);
5560
5561 BIND(DONE);
5562 sub(result, result, len); // Return index where we stopped
5563 // Return len == 0 if we processed all
5564 // characters
5565 }
5566
5567
5568 // Inflate byte[] array to char[].
5569 void MacroAssembler::byte_array_inflate(Register src, Register dst, Register len,
5570 FloatRegister vtmp1, FloatRegister vtmp2, FloatRegister vtmp3,
5571 Register tmp4) {
5572 Label big, done;
5573
5574 assert_different_registers(src, dst, len, tmp4, rscratch1);
5575
5576 fmovd(vtmp1 , zr);
5577 lsrw(rscratch1, len, 3);
5578
5579 cbnzw(rscratch1, big);
5580
5581 // Short string: less than 8 bytes.
5582 {
5583 Label loop, around, tiny;
5584
5585 subsw(len, len, 4);
5586 andw(len, len, 3);
5587 br(LO, tiny);
5588
5589 // Use SIMD to do 4 bytes.
5590 ldrs(vtmp2, post(src, 4));
5591 zip1(vtmp3, T8B, vtmp2, vtmp1);
5592 strd(vtmp3, post(dst, 8));
5593
5594 cbzw(len, done);
5595
5596 // Do the remaining bytes by steam.
5597 bind(loop);
5598 ldrb(tmp4, post(src, 1));
5599 strh(tmp4, post(dst, 2));
5600 subw(len, len, 1);
5601
5602 bind(tiny);
5603 cbnz(len, loop);
5604
5605 bind(around);
5606 b(done);
5607 }
5608
5609 // Unpack the bytes 8 at a time.
5610 bind(big);
5611 andw(len, len, 7);
5612
5613 {
5614 Label loop, around;
5615
5616 bind(loop);
5617 ldrd(vtmp2, post(src, 8));
5618 sub(rscratch1, rscratch1, 1);
5619 zip1(vtmp3, T16B, vtmp2, vtmp1);
5620 st1(vtmp3, T8H, post(dst, 16));
5621 cbnz(rscratch1, loop);
5622
5623 bind(around);
5624 }
5625
5626 // Do the tail of up to 8 bytes.
5627 sub(src, src, 8);
5628 add(src, src, len, ext::uxtw, 0);
5629 ldrd(vtmp2, Address(src));
5630 sub(dst, dst, 16);
5631 add(dst, dst, len, ext::uxtw, 1);
5632 zip1(vtmp3, T16B, vtmp2, vtmp1);
5633 st1(vtmp3, T8H, Address(dst));
5634
5635 bind(done);
5636 }
5637
5638 // Compress char[] array to byte[].
5639 void MacroAssembler::char_array_compress(Register src, Register dst, Register len,
5640 FloatRegister tmp1Reg, FloatRegister tmp2Reg,
5641 FloatRegister tmp3Reg, FloatRegister tmp4Reg,
5642 Register result) {
5643 encode_iso_array(src, dst, len, result,
5644 tmp1Reg, tmp2Reg, tmp3Reg, tmp4Reg);
5645 cmp(len, zr);
5646 csel(result, result, zr, EQ);
5647 }
5648
5649 // get_thread() can be called anywhere inside generated code so we
5650 // need to save whatever non-callee save context might get clobbered
5651 // by the call to JavaThread::aarch64_get_thread_helper() or, indeed,
5652 // the call setup code.
5653 //
5654 // aarch64_get_thread_helper() clobbers only r0, r1, and flags.
5655 //
5656 void MacroAssembler::get_thread(Register dst) {
5657 RegSet saved_regs = RegSet::range(r0, r1) + lr - dst;
5658 push(saved_regs, sp);
5659
5660 mov(lr, CAST_FROM_FN_PTR(address, JavaThread::aarch64_get_thread_helper));
5661 blrt(lr, 1, 0, 1);
5662 if (dst != c_rarg0) {
5663 mov(dst, c_rarg0);
5664 }
5665
5666 pop(saved_regs, sp);
5667 }