@@ -1299,14 +1299,14 @@ class StubGenerator: public StubCodeGenerator {
1299
1299
1300
1300
// Scan over array at a for count oops, verifying each one.
1301
1301
// Preserves a and count, clobbers rscratch1 and rscratch2.
1302
- void verify_oop_array (size_t size, Register a, Register count, Register temp) {
1302
+ void verify_oop_array (int size, Register a, Register count, Register temp) {
1303
1303
Label loop, end;
1304
1304
__ mov(rscratch1, a);
1305
1305
__ mov(rscratch2, zr);
1306
1306
__ bind(loop);
1307
1307
__ cmp(rscratch2, count);
1308
1308
__ br(Assembler::HS, end);
1309
- if (size == (size_t) wordSize) {
1309
+ if (size == wordSize) {
1310
1310
__ ldr(temp, Address(a, rscratch2, Address::lsl(exact_log2(size))));
1311
1311
__ verify_oop(temp);
1312
1312
} else {
@@ -1338,7 +1338,7 @@ class StubGenerator: public StubCodeGenerator {
1338
1338
// used by generate_conjoint_int_oop_copy().
1339
1339
//
1340
1340
address generate_disjoint_copy(size_t size, bool aligned, bool is_oop, address *entry,
1341
- const char *name, bool dest_uninitialized = false) {
1341
+ const char *name, bool dest_uninitialized = false) {
1342
1342
Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
1343
1343
RegSet saved_reg = RegSet::of(s, d, count);
1344
1344
__ align(CodeEntryAlignment);
@@ -1367,12 +1367,12 @@ class StubGenerator: public StubCodeGenerator {
1367
1367
// save regs before copy_memory
1368
1368
__ push(RegSet::of(d, count), sp);
1369
1369
}
1370
- copy_memory(aligned, s, d, count, rscratch1, size);
1370
+ copy_memory(aligned, s, d, count, rscratch1, checked_cast<int>( size) );
1371
1371
1372
1372
if (is_oop) {
1373
1373
__ pop(RegSet::of(d, count), sp);
1374
1374
if (VerifyOops)
1375
- verify_oop_array(size, d, count, r16);
1375
+ verify_oop_array(checked_cast<int>( size) , d, count, r16);
1376
1376
}
1377
1377
1378
1378
bs->arraycopy_epilogue(_masm, decorators, is_oop, d, count, rscratch1, RegSet());
@@ -1398,7 +1398,7 @@ class StubGenerator: public StubCodeGenerator {
1398
1398
// the hardware handle it. The two dwords within qwords that span
1399
1399
// cache line boundaries will still be loaded and stored atomically.
1400
1400
//
1401
- address generate_conjoint_copy(size_t size, bool aligned, bool is_oop, address nooverlap_target,
1401
+ address generate_conjoint_copy(int size, bool aligned, bool is_oop, address nooverlap_target,
1402
1402
address *entry, const char *name,
1403
1403
bool dest_uninitialized = false) {
1404
1404
Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
@@ -1644,7 +1644,7 @@ class StubGenerator: public StubCodeGenerator {
1644
1644
address generate_disjoint_oop_copy(bool aligned, address *entry,
1645
1645
const char *name, bool dest_uninitialized) {
1646
1646
const bool is_oop = true;
1647
- const size_t size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
1647
+ const int size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
1648
1648
return generate_disjoint_copy(size, aligned, is_oop, entry, name, dest_uninitialized);
1649
1649
}
1650
1650
@@ -1662,7 +1662,7 @@ class StubGenerator: public StubCodeGenerator {
1662
1662
address nooverlap_target, address *entry,
1663
1663
const char *name, bool dest_uninitialized) {
1664
1664
const bool is_oop = true;
1665
- const size_t size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
1665
+ const int size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
1666
1666
return generate_conjoint_copy(size, aligned, is_oop, nooverlap_target, entry,
1667
1667
name, dest_uninitialized);
1668
1668
}
0 commit comments