mirror of
https://github.com/openjdk/jdk.git
synced 2026-04-28 15:51:02 +00:00
8254072: AArch64: Get rid of --disable-warnings-as-errors on Windows+ARM64 build
Reviewed-by: ihse, aph
This commit is contained in:
parent
120aec7054
commit
d2812f780e
@ -95,7 +95,7 @@ DISABLED_WARNINGS_clang := tautological-compare \
|
||||
|
||||
DISABLED_WARNINGS_xlc := tautological-compare shift-negative-value
|
||||
|
||||
DISABLED_WARNINGS_microsoft := 4100 4127 4201 4244 4291 4351 \
|
||||
DISABLED_WARNINGS_microsoft := 4100 4127 4146 4201 4244 4291 4351 \
|
||||
4511 4512 4514 4624 4996
|
||||
|
||||
################################################################################
|
||||
|
||||
@ -217,7 +217,7 @@ public:
|
||||
|
||||
static void patch(address a, int msb, int lsb, uint64_t val) {
|
||||
int nbits = msb - lsb + 1;
|
||||
guarantee(val < (1U << nbits), "Field too big for insn");
|
||||
guarantee(val < (1ULL << nbits), "Field too big for insn");
|
||||
assert_cond(msb >= lsb);
|
||||
unsigned mask = (1U << nbits) - 1;
|
||||
val <<= lsb;
|
||||
@ -445,8 +445,8 @@ class Address {
|
||||
}
|
||||
|
||||
Register base() const {
|
||||
guarantee((_mode == base_plus_offset | _mode == base_plus_offset_reg
|
||||
| _mode == post | _mode == post_reg),
|
||||
guarantee((_mode == base_plus_offset || _mode == base_plus_offset_reg
|
||||
|| _mode == post || _mode == post_reg),
|
||||
"wrong mode");
|
||||
return _base;
|
||||
}
|
||||
|
||||
@ -662,11 +662,12 @@ intptr_t* frame::real_fp() const {
|
||||
|
||||
#undef DESCRIBE_FP_OFFSET
|
||||
|
||||
#define DESCRIBE_FP_OFFSET(name) \
|
||||
{ \
|
||||
uintptr_t *p = (uintptr_t *)fp; \
|
||||
printf("0x%016lx 0x%016lx %s\n", (uintptr_t)(p + frame::name##_offset), \
|
||||
p[frame::name##_offset], #name); \
|
||||
#define DESCRIBE_FP_OFFSET(name) \
|
||||
{ \
|
||||
uintptr_t *p = (uintptr_t *)fp; \
|
||||
printf(INTPTR_FORMAT " " INTPTR_FORMAT " %s\n", \
|
||||
(uintptr_t)(p + frame::name##_offset), \
|
||||
p[frame::name##_offset], #name); \
|
||||
}
|
||||
|
||||
static THREAD_LOCAL uintptr_t nextfp;
|
||||
|
||||
@ -1830,7 +1830,7 @@ bool MacroAssembler::try_merge_ldst(Register rt, const Address &adr, size_t size
|
||||
return true;
|
||||
} else {
|
||||
assert(size_in_bytes == 8 || size_in_bytes == 4, "only 8 bytes or 4 bytes load/store is supported.");
|
||||
const unsigned mask = size_in_bytes - 1;
|
||||
const uint64_t mask = size_in_bytes - 1;
|
||||
if (adr.getMode() == Address::base_plus_offset &&
|
||||
(adr.offset() & mask) == 0) { // only supports base_plus_offset.
|
||||
code()->set_last_insn(pc());
|
||||
@ -2894,7 +2894,7 @@ void MacroAssembler::merge_ldst(Register rt,
|
||||
// Overwrite previous generated binary.
|
||||
code_section()->set_end(prev);
|
||||
|
||||
const int sz = prev_ldst->size_in_bytes();
|
||||
const size_t sz = prev_ldst->size_in_bytes();
|
||||
assert(sz == 8 || sz == 4, "only supports 64/32bit merging.");
|
||||
if (!is_store) {
|
||||
BLOCK_COMMENT("merged ldr pair");
|
||||
|
||||
@ -655,7 +655,7 @@ public:
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
size_t size_in_bytes() { return 1 << size(); }
|
||||
size_t size_in_bytes() { return 1ULL << size(); }
|
||||
bool is_not_pre_post_index() { return (is_ldst_ur() || is_ldst_unsigned_offset()); }
|
||||
bool is_load() {
|
||||
assert(Instruction_aarch64::extract(uint_at(0), 23, 22) == 0b01 ||
|
||||
|
||||
@ -1498,7 +1498,8 @@ nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm,
|
||||
|
||||
// Generate stack overflow check
|
||||
if (UseStackBanging) {
|
||||
__ bang_stack_with_offset(StackOverflow::stack_shadow_zone_size());
|
||||
assert(StackOverflow::stack_shadow_zone_size() == (int)StackOverflow::stack_shadow_zone_size(), "must be same");
|
||||
__ bang_stack_with_offset((int)StackOverflow::stack_shadow_zone_size());
|
||||
} else {
|
||||
Unimplemented();
|
||||
}
|
||||
@ -2445,7 +2446,7 @@ void SharedRuntime::generate_deopt_blob() {
|
||||
__ sub(sp, sp, r19);
|
||||
|
||||
// Push interpreter frames in a loop
|
||||
__ mov(rscratch1, (address)0xDEADDEAD); // Make a recognizable pattern
|
||||
__ mov(rscratch1, (uint64_t)0xDEADDEAD); // Make a recognizable pattern
|
||||
__ mov(rscratch2, rscratch1);
|
||||
Label loop;
|
||||
__ bind(loop);
|
||||
|
||||
@ -1305,14 +1305,14 @@ class StubGenerator: public StubCodeGenerator {
|
||||
|
||||
// Scan over array at a for count oops, verifying each one.
|
||||
// Preserves a and count, clobbers rscratch1 and rscratch2.
|
||||
void verify_oop_array (size_t size, Register a, Register count, Register temp) {
|
||||
void verify_oop_array (int size, Register a, Register count, Register temp) {
|
||||
Label loop, end;
|
||||
__ mov(rscratch1, a);
|
||||
__ mov(rscratch2, zr);
|
||||
__ bind(loop);
|
||||
__ cmp(rscratch2, count);
|
||||
__ br(Assembler::HS, end);
|
||||
if (size == (size_t)wordSize) {
|
||||
if (size == wordSize) {
|
||||
__ ldr(temp, Address(a, rscratch2, Address::lsl(exact_log2(size))));
|
||||
__ verify_oop(temp);
|
||||
} else {
|
||||
@ -1343,7 +1343,7 @@ class StubGenerator: public StubCodeGenerator {
|
||||
// disjoint_int_copy_entry is set to the no-overlap entry point
|
||||
// used by generate_conjoint_int_oop_copy().
|
||||
//
|
||||
address generate_disjoint_copy(size_t size, bool aligned, bool is_oop, address *entry,
|
||||
address generate_disjoint_copy(int size, bool aligned, bool is_oop, address *entry,
|
||||
const char *name, bool dest_uninitialized = false) {
|
||||
Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
|
||||
RegSet saved_reg = RegSet::of(s, d, count);
|
||||
@ -1409,7 +1409,7 @@ class StubGenerator: public StubCodeGenerator {
|
||||
// the hardware handle it. The two dwords within qwords that span
|
||||
// cache line boundaries will still be loaded and stored atomicly.
|
||||
//
|
||||
address generate_conjoint_copy(size_t size, bool aligned, bool is_oop, address nooverlap_target,
|
||||
address generate_conjoint_copy(int size, bool aligned, bool is_oop, address nooverlap_target,
|
||||
address *entry, const char *name,
|
||||
bool dest_uninitialized = false) {
|
||||
Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
|
||||
@ -1660,7 +1660,7 @@ class StubGenerator: public StubCodeGenerator {
|
||||
address generate_disjoint_oop_copy(bool aligned, address *entry,
|
||||
const char *name, bool dest_uninitialized) {
|
||||
const bool is_oop = true;
|
||||
const size_t size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
|
||||
const int size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
|
||||
return generate_disjoint_copy(size, aligned, is_oop, entry, name, dest_uninitialized);
|
||||
}
|
||||
|
||||
@ -1678,7 +1678,7 @@ class StubGenerator: public StubCodeGenerator {
|
||||
address nooverlap_target, address *entry,
|
||||
const char *name, bool dest_uninitialized) {
|
||||
const bool is_oop = true;
|
||||
const size_t size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
|
||||
const int size = UseCompressedOops ? sizeof (jint) : sizeof (jlong);
|
||||
return generate_conjoint_copy(size, aligned, is_oop, nooverlap_target, entry,
|
||||
name, dest_uninitialized);
|
||||
}
|
||||
|
||||
@ -1120,7 +1120,7 @@ void TemplateInterpreterGenerator::bang_stack_shadow_pages(bool native_call) {
|
||||
// an interpreter frame with greater than a page of locals, so each page
|
||||
// needs to be checked. Only true for non-native.
|
||||
if (UseStackBanging) {
|
||||
const int n_shadow_pages = StackOverflow::stack_shadow_zone_size() / os::vm_page_size();
|
||||
const int n_shadow_pages = (int)(StackOverflow::stack_shadow_zone_size() / os::vm_page_size());
|
||||
const int start_page = native_call ? n_shadow_pages : 1;
|
||||
const int page_size = os::vm_page_size();
|
||||
for (int pages = start_page; pages <= n_shadow_pages ; pages++) {
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user