Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + '
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Universal Dark Mode - works on any site (function() { var enabled = true; function applyDarkMode() { if (!enabled) return; // Create style element if it doesn't exist var style = document.getElementById('universal-dark-mode-style'); if (!style) { style = document.createElement('style'); style.id = 'universal-dark-mode-style'; document.head.appendChild(style); } // Dark mode CSS - inverts colors but preserves images/video style.textContent = ' /* Invert everything except media */ html { filter: invert(1) hue-rotate(180deg) !important; background: #1a1a2e !important; } /* Restore images, videos, iframes, canvas */ img, video, iframe, canvas, svg, picture, [style*="background-image"] { filter: invert(1) hue-rotate(180deg) !important; } /* Preserve specific elements that should not be inverted */ .no-dark-mode, .no-dark-mode *, [data-theme="light"], [data-theme="light"], .ace_editor, .ace_editor *, .CodeMirror, .CodeMirror *, .monaco-editor, .monaco-editor *, .markdown-body pre, .markdown-body pre *, .highlight, .highlight *, pre code, pre code * { filter: none !important; } /* Fix common UI elements */ .modal, .popup, .dropdown-menu, .tooltip, .popover { filter: invert(1) hue-rotate(180deg) !important; background: #2d2d44 !important; border-color: #444 !important; } /* Scrollbars */ ::-webkit-scrollbar { background: #1a1a2e !important; } ::-webkit-scrollbar-thumb { background: #444 !important; } ::-webkit-scrollbar-thumb:hover { background: #555 !important; } /* Selection */ ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; } ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; } '; } function removeDarkMode() { var style = document.getElementById('universal-dark-mode-style'); if (style) style.remove(); } // Toggle with Alt+Shift+D document.addEventListener('keydown', function(e) { if (e.altKey && e.shiftKey && e.key === 'D') { e.preventDefault(); enabled = !enabled; if (enabled) { applyDarkMode(); console.log('[Universal Dark Mode] Enabled'); } else { removeDarkMode(); console.log('[Universal Dark Mode] Disabled'); } } }); // Apply on load applyDarkMode(); // Re-apply on dynamic content var observer = new MutationObserver(function(mutations) { if (enabled && !document.getElementById('universal-dark-mode-style')) { applyDarkMode(); } }); observer.observe(document.head, { childList: true }); console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle'); })(); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })();
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions src/coreclr/jit/codegen.h
Original file line numberDiff line numberDiff line change
Expand Up@@ -1235,6 +1235,10 @@ XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#else
instruction genGetInsForOper(genTreeOps oper, var_types type);
#endif
instruction genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier);
bool genEmitOptimizedGCWriteBarrier(GCInfo::WriteBarrierForm writeBarrierForm, GenTree* addr, GenTree* data);
GenTree* getCallTarget(const GenTreeCall* call, CORINFO_METHOD_HANDLE* methHnd);
regNumber getCallIndirectionCellReg(GenTreeCall* call);
Expand Down
18 changes: 3 additions & 15 deletions src/coreclr/jit/codegenarm64.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -4207,22 +4207,10 @@ void CodeGen::genCodeForStoreInd(GenTreeStoreInd* tree)

if (tree->IsVolatile())
{
bool addrIsInReg = addr->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);
bool needsBarrier = true;
ins = genGetVolatileLdStIns(ins, dataReg, tree, &needsBarrier);

if ((ins == INS_strb) && addrIsInReg)
{
ins = INS_stlrb;
}
else if ((ins == INS_strh) && addrIsInReg && addrIsAligned)
{
ins = INS_stlrh;
}
else if ((ins == INS_str) && genIsValidIntReg(dataReg) && addrIsInReg && addrIsAligned)
{
ins = INS_stlr;
}
else
if (needsBarrier)
{
// issue a full memory barrier before a volatile StInd
// Note: We cannot issue store barrier ishst because it is a weaker barrier.
Expand Down
181 changes: 130 additions & 51 deletions src/coreclr/jit/codegenarmarch.cpp
Original file line numberDiff line numberDiff line change
Expand Up@@ -1728,6 +1728,134 @@ void CodeGen::genCodeForIndexAddr(GenTreeIndexAddr* node)
genProduceReg(node);
}

//------------------------------------------------------------------------
// genGetVolatileLdStIns: Determine the most efficient instruction to perform a
// volatile load or store and whether an explicit barrier is required or not.
//
// Arguments:
// currentIns - the current instruction to perform load/store
// targetReg - the target register
// indir - the indirection node representing the volatile load/store
// needsBarrier - OUT parameter. Set to true if an explicit memory barrier is required.
//
// Return Value:
// instruction to perform the volatile load/store with.
//
instruction CodeGen::genGetVolatileLdStIns(instruction currentIns,
regNumber targetReg,
GenTreeIndir* indir,
bool* needsBarrier)
{
assert(indir->IsVolatile());

if (!genIsValidIntReg(targetReg))
{
// We don't have special instructions to perform volatile loads/stores for non-integer registers.
*needsBarrier = true;
return currentIns;
}

assert(!varTypeIsFloating(indir));
assert(!varTypeIsSIMD(indir));

#ifdef TARGET_ARM64
*needsBarrier = false;

if (indir->IsUnaligned() && (currentIns != INS_ldrb) && (currentIns != INS_strb))
{
// We have to use a normal load/store + explicit memory barrier
// to avoid unaligned access exceptions.
*needsBarrier = true;
return currentIns;
}

const bool addrIsInReg = indir->Addr()->isUsedFromReg();

// With RCPC2 (arm64 v8.4+) we can work with simple addressing modes like [reg + simm9]
const bool shouldUseRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2) && !addrIsInReg &&
indir->Addr()->OperIs(GT_LEA) && !indir->HasIndex() && (indir->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(indir->Offset());

if (shouldUseRcpc2)
{
assert(!addrIsInReg);
switch (currentIns)
{
// Loads

case INS_ldrb:
return INS_ldapurb;

case INS_ldrh:
return INS_ldapurh;

case INS_ldr:
return INS_ldapur;

// Stores

case INS_strb:
return INS_stlurb;

case INS_strh:
return INS_stlurh;

case INS_str:
return INS_stlur;

default:
*needsBarrier = true;
return currentIns;
}
}

// Only RCPC2 (arm64 v8.4+) allows us to deal with contained addresses.
// In other cases we'll have to emit a normal load/store + explicit memory barrier.
// It means that lower should generally avoid generating contained addresses for volatile loads/stores
// so we can use cheaper instructions.
if (!addrIsInReg)
{
*needsBarrier = true;
return currentIns;
}

// RCPC1 (arm64 v8.3+) offers a bit more relaxed memory ordering than ldar. Which is sufficient for
// .NET memory model's requirements, see https://github.com/dotnet/runtime/issues/67374
const bool hasRcpc1 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);
switch (currentIns)
{
// Loads

case INS_ldrb:
return hasRcpc1 ? INS_ldaprb : INS_ldarb;

case INS_ldrh:
return hasRcpc1 ? INS_ldaprh : INS_ldarh;

case INS_ldr:
return hasRcpc1 ? INS_ldapr : INS_ldar;

// Stores

case INS_strb:
return INS_stlrb;

case INS_strh:
return INS_stlrh;

case INS_str:
return INS_stlr;

default:
*needsBarrier = true;
return currentIns;
}
#else // TARGET_ARM64
*needsBarrier = true;
return currentIns;
#endif // !TARGET_ARM64
}

//------------------------------------------------------------------------
// genCodeForIndir: Produce code for a GT_IND node.
//
Expand DownExpand Up@@ -1755,58 +1883,9 @@ void CodeGen::genCodeForIndir(GenTreeIndir* tree)

bool emitBarrier = false;

if ((tree->gtFlags & GTF_IND_VOLATILE) != 0)
if (tree->IsVolatile())
{
#ifdef TARGET_ARM64
bool addrIsInReg = tree->Addr()->isUsedFromReg();
bool addrIsAligned = ((tree->gtFlags & GTF_IND_UNALIGNED) == 0);

// On arm64-v8.3+ we can use ldap* instructions with acquire/release semantics to avoid
// full memory barriers if mixed with STLR
bool hasRcpc = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc);

// On arm64-v8.4+ we can use ldapur* instructions with acquire/release semantics to
// avoid full memory barriers if address is contained and unscaled
bool hasRcpc2 = compiler->compOpportunisticallyDependsOn(InstructionSet_Rcpc2);

bool handledWithLdapur = false;
if (hasRcpc2 && !addrIsInReg && tree->Addr()->OperIs(GT_LEA) && !tree->HasIndex() && (tree->Scale() == 1) &&
emitter::emitIns_valid_imm_for_unscaled_ldst_offset(tree->Offset()))
{
if (ins == INS_ldrb)
{
ins = INS_ldapurb;
handledWithLdapur = true;
}
else if ((ins == INS_ldrh) && addrIsAligned)
{
ins = INS_ldapurh;
handledWithLdapur = true;
}
else if ((ins == INS_ldr) && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = INS_ldapur;
handledWithLdapur = true;
}
}

if ((ins == INS_ldrb) && addrIsInReg)
{
ins = hasRcpc ? INS_ldaprb : INS_ldarb;
}
else if ((ins == INS_ldrh) && addrIsInReg && addrIsAligned)
{
ins = hasRcpc ? INS_ldaprh : INS_ldarh;
}
else if ((ins == INS_ldr) && addrIsInReg && addrIsAligned && genIsValidIntReg(targetReg))
{
ins = hasRcpc ? INS_ldapr : INS_ldar;
}
else if (!handledWithLdapur)
#endif // TARGET_ARM64
{
emitBarrier = true;
}
ins = genGetVolatileLdStIns(ins, targetReg, tree, &emitBarrier);
}

GetEmitter()->emitInsLoadStoreOp(ins, emitActualTypeSize(type), targetReg, tree);
Expand Down