JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
jakobbotsch merged 3 commits into from
Jul 4, 2023
Merged

JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion #88109

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0c9b1c5
JIT: Handle primitive-sized remainders overlapping padding in physica…
jakobbotsch Jun 30, 2023
c304c5b
Add header for CopyRemainder
jakobbotsch Jun 30, 2023
2e7a4d1
Fix bug
jakobbotsch Jul 3, 2023
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
22 changes: 0 additions & 22 deletions src/coreclr/jit/promotion.cpp
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
if (m_segments.size() == 1)
{
*result = m_segments[0];
return true;
}

return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down
1 change: 0 additions & 1 deletion src/coreclr/jit/promotion.h
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
void Add(const Segment& segment);
void Subtract(const Segment& segment);
bool IsEmpty();
bool IsSingleSegment(Segment* result);
bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down
213 changes: 150 additions & 63 deletions src/coreclr/jit/promotiondecomposition.cpp
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

StructSegments::Segment segment;
// See if we can "plug the hole" with a single primitive.
if (remainder.IsSingleSegment(&segment))
if (remainder.CoveringSegment(&segment))
{
var_types primitiveType = TYP_UNDEF;
unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
}
}

// We prefer to do the remainder at the end, if possible, since CQ
// analysis shows that this is best. However, handling the remainder
// may overwrite the destination with stale bits if the source has
// replacements (since handling the remainder copies from the struct,
// and the fresh values are usually in the replacement locals).
bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

GenTree* addr = nullptr;
target_ssize_t addrBaseOffs = 0;
FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

if (m_compiler->fgAddrCouldBeNull(addr))
{
switch (remainderStrategy.Type)
if (handleRemainderFirst)
{
needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
}
else
{
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
{
continue;
}
const Entry& entry = m_entries.BottomRef(i);
assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
break;
continue;
}
const Entry& entry = m_entries.BottomRef(i);
assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
break;
}
}
}

if (needsNullCheck)
{
numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
statements->AddStatement(nullCheck);
}

if (remainderStrategy.Type == RemainderStrategy::FullBlock)
{
// We will reuse the existing block op. Rebase the address off of the new local we created.
if (m_src->OperIs(GT_BLK))
{
m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
}
else if (m_store->OperIs(GT_STORE_BLK))
{
m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
}
}

// If the source involves replacements then do the struct op first --
// we would overwrite the destination with stale bits if we did it last.
// If the source does not involve replacements then CQ analysis shows
// that it's best to do it last.
if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
if (handleRemainderFirst)
{
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
{
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
statements->AddStatement(store);
}

if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
{
statements->AddStatement(m_store);
}

if (remainderStrategy.Type == RemainderStrategy::Primitive)
if (!handleRemainderFirst)
{
var_types primitiveType = remainderStrategy.PrimitiveType;
// The remainder might match a regularly promoted field exactly. If
// it does then use the promoted field's type so we can create a
// direct access.
unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
unsigned storePromField =
storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
{
var_types regPromFieldType =
m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
{
primitiveType = regPromFieldType;
}
}

GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
statements->AddStatement(store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
}

INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
//------------------------------------------------------------------------
// CanSkipEntry:
// Check if the specified entry can be skipped because it is writing to a
// death replacement or because the remainder would handle it anyway.
// dead replacement or because the remainder would handle it anyway.
//
// Parameters:
// entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
return addrNode->IsInvariant();
}

private:
//------------------------------------------------------------------------
// RemainderOverwritesDestinationWithStaleBits:
// Check if handling the remainder is going to write stale bits to the
// destination.
//
// Parameters:
// remainderStrategy - The remainder strategy
// dstDeaths - Destination liveness
//
// Returns:
// True if so.
//
// Remarks:
// We usually prefer to write the remainder last as CQ analysis shows
// that to be most beneficial. However, if we do that we may overwrite
// the destination with stale bits. This occurs if the source has
// replacements. Handling the remainder copies from the source struct
// local, but the up-to-date values may be in its replacement locals. So
// we must take care to write the replacement locals _after_ the
// remainder has been written.
//
bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
const StructDeaths& dstDeaths)
{
if (!m_srcInvolvesReplacements)
{
return false;
}

switch (remainderStrategy.Type)
{
case RemainderStrategy::FullBlock:
return true;
case RemainderStrategy::Primitive:
for (int i = 0; i < m_entries.Height(); i++)
{
const Entry& entry = m_entries.BottomRef(i);
if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
{
// Entry ends before remainder starts
continue;
}

// Remainder ends before entry starts
if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
entry.Offset)
{
continue;
}

// Are we even going to write the entry?
if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
{
// Yep, so we need to be careful.
return true;
}
}

// No entry overlaps.
return false;
default:
return false;
}
}

// Helper class to create derived accesses off of a location: either a
// local, or as indirections off of an address.
class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
return m_indirFlags;
}
};

//------------------------------------------------------------------------
// CopyRemainder:
// Create IR to copy the remainder.
//
// Parameters:
// storeAccess - Helper class to create derived stores
// srcAccess - Helper class to create derived source accesses
// remainderStrategy - The strategy to generate IR for
// statements - List to add IR to.
//
void CopyRemainder(LocationAccess& storeAccess,
LocationAccess& srcAccess,
const RemainderStrategy& remainderStrategy,
DecompositionStatementList* statements)
{
if (remainderStrategy.Type == RemainderStrategy::FullBlock)
{
// We will reuse the existing block op. Rebase the address off of the new local we created.
if (m_src->OperIs(GT_BLK))
{
m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
}
else if (m_store->OperIs(GT_STORE_BLK))
{
m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
}

statements->AddStatement(m_store);
}
else if (remainderStrategy.Type == RemainderStrategy::Primitive)
{
var_types primitiveType = remainderStrategy.PrimitiveType;
// The remainder might match a regularly promoted field exactly. If
// it does then use the promoted field's type so we can create a
// direct access.
unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
unsigned storePromField =
storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
{
var_types regPromFieldType =
m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
{
primitiveType = regPromFieldType;
}
}

GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
statements->AddStatement(store);
}
}
};

//------------------------------------------------------------------------
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
JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

jakobbotsch
merged 3 commits into

from

Jul 4, 2023
 Merged


JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion
#88109
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
0c9b1c5

JIT: Handle primitive-sized remainders overlapping padding in physica…


jakobbotsch Jun 30, 2023
c304c5b

Add header for CopyRemainder


jakobbotsch Jun 30, 2023
2e7a4d1

Fix bug


jakobbotsch Jul 3, 2023

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


22 changes: 0 additions & 22 deletions
src/coreclr/jit/promotion.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
 return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
 if (m_segments.size() == 1)
 {
 *result = m_segments[0];
 return true;
 }

 return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down

1 change: 0 additions & 1 deletion
src/coreclr/jit/promotion.h

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
 void Add(const Segment& segment);
 void Subtract(const Segment& segment);
 bool IsEmpty();
 bool IsSingleSegment(Segment* result);
 bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down

213 changes: 150 additions & 63 deletions
src/coreclr/jit/promotiondecomposition.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

 StructSegments::Segment segment;
 // See if we can "plug the hole" with a single primitive.
 if (remainder.IsSingleSegment(&segment))
 if (remainder.CoveringSegment(&segment))
 {
 var_types primitiveType = TYP_UNDEF;
 unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
 }
 }

 // We prefer to do the remainder at the end, if possible, since CQ
 // analysis shows that this is best. However, handling the remainder
 // may overwrite the destination with stale bits if the source has
 // replacements (since handling the remainder copies from the struct,
 // and the fresh values are usually in the replacement locals).
 bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

 GenTree* addr = nullptr;
 target_ssize_t addrBaseOffs = 0;
 FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

 if (m_compiler->fgAddrCouldBeNull(addr))
 {
 switch (remainderStrategy.Type)
 if (handleRemainderFirst)
 {
 needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
 m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
 }
 else
 {
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
 needsNullCheck = true;
 // See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 }
 }
 }

 if (needsNullCheck)
 {
 numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
 statements->AddStatement(nullCheck);
 }

 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 }

 // If the source involves replacements then do the struct op first --
 // we would overwrite the destination with stale bits if we did it last.
 // If the source does not involve replacements then CQ analysis shows
 // that it's best to do it last.
 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
 if (handleRemainderFirst)
 {
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

 if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
 {
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
 statements->AddStatement(store);
 }

 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
 {
 statements->AddStatement(m_store);
 }

 if (remainderStrategy.Type == RemainderStrategy::Primitive)
 if (!handleRemainderFirst)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
 }

 INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
 //------------------------------------------------------------------------
 // CanSkipEntry:
 // Check if the specified entry can be skipped because it is writing to a
 // death replacement or because the remainder would handle it anyway.
 // dead replacement or because the remainder would handle it anyway.
 //
 // Parameters:
 // entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
 return addrNode->IsInvariant();
 }

private:
 //------------------------------------------------------------------------
 // RemainderOverwritesDestinationWithStaleBits:
 // Check if handling the remainder is going to write stale bits to the
 // destination.
 //
 // Parameters:
 // remainderStrategy - The remainder strategy
 // dstDeaths - Destination liveness
 //
 // Returns:
 // True if so.
 //
 // Remarks:
 // We usually prefer to write the remainder last as CQ analysis shows
 // that to be most beneficial. However, if we do that we may overwrite
 // the destination with stale bits. This occurs if the source has
 // replacements. Handling the remainder copies from the source struct
 // local, but the up-to-date values may be in its replacement locals. So
 // we must take care to write the replacement locals _after_ the
 // remainder has been written.
 //
 bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
 const StructDeaths& dstDeaths)
 {
 if (!m_srcInvolvesReplacements)
 {
 return false;
 }

 switch (remainderStrategy.Type)
 {
 case RemainderStrategy::FullBlock:
 return true;
 case RemainderStrategy::Primitive:
 for (int i = 0; i < m_entries.Height(); i++)
 {
 const Entry& entry = m_entries.BottomRef(i);
 if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
 {
 // Entry ends before remainder starts
 continue;
 }

 // Remainder ends before entry starts
 if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
 entry.Offset)
 {
 continue;
 }

 // Are we even going to write the entry?
 if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
 {
 // Yep, so we need to be careful.
 return true;
 }
 }

 // No entry overlaps.
 return false;
 default:
 return false;
 }
 }

 // Helper class to create derived accesses off of a location: either a
 // local, or as indirections off of an address.
 class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
 return m_indirFlags;
 }
 };

 //------------------------------------------------------------------------
 // CopyRemainder:
 // Create IR to copy the remainder.
 //
 // Parameters:
 // storeAccess - Helper class to create derived stores
 // srcAccess - Helper class to create derived source accesses
 // remainderStrategy - The strategy to generate IR for
 // statements - List to add IR to.
 //
 void CopyRemainder(LocationAccess& storeAccess,
 LocationAccess& srcAccess,
 const RemainderStrategy& remainderStrategy,
 DecompositionStatementList* statements)
 {
 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
 }

 statements->AddStatement(m_store);
 }
 else if (remainderStrategy.Type == RemainderStrategy::Primitive)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 }
 }
};

//------------------------------------------------------------------------
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
JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

jakobbotsch
merged 3 commits into

from

Jul 4, 2023
 Merged


JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion
#88109
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
0c9b1c5

JIT: Handle primitive-sized remainders overlapping padding in physica…


jakobbotsch Jun 30, 2023
c304c5b

Add header for CopyRemainder


jakobbotsch Jun 30, 2023
2e7a4d1

Fix bug


jakobbotsch Jul 3, 2023

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


22 changes: 0 additions & 22 deletions
src/coreclr/jit/promotion.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
 return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
 if (m_segments.size() == 1)
 {
 *result = m_segments[0];
 return true;
 }

 return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down

1 change: 0 additions & 1 deletion
src/coreclr/jit/promotion.h

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
 void Add(const Segment& segment);
 void Subtract(const Segment& segment);
 bool IsEmpty();
 bool IsSingleSegment(Segment* result);
 bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down

213 changes: 150 additions & 63 deletions
src/coreclr/jit/promotiondecomposition.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

 StructSegments::Segment segment;
 // See if we can "plug the hole" with a single primitive.
 if (remainder.IsSingleSegment(&segment))
 if (remainder.CoveringSegment(&segment))
 {
 var_types primitiveType = TYP_UNDEF;
 unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
 }
 }

 // We prefer to do the remainder at the end, if possible, since CQ
 // analysis shows that this is best. However, handling the remainder
 // may overwrite the destination with stale bits if the source has
 // replacements (since handling the remainder copies from the struct,
 // and the fresh values are usually in the replacement locals).
 bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

 GenTree* addr = nullptr;
 target_ssize_t addrBaseOffs = 0;
 FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

 if (m_compiler->fgAddrCouldBeNull(addr))
 {
 switch (remainderStrategy.Type)
 if (handleRemainderFirst)
 {
 needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
 m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
 }
 else
 {
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
 needsNullCheck = true;
 // See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 }
 }
 }

 if (needsNullCheck)
 {
 numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
 statements->AddStatement(nullCheck);
 }

 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 }

 // If the source involves replacements then do the struct op first --
 // we would overwrite the destination with stale bits if we did it last.
 // If the source does not involve replacements then CQ analysis shows
 // that it's best to do it last.
 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
 if (handleRemainderFirst)
 {
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

 if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
 {
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
 statements->AddStatement(store);
 }

 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
 {
 statements->AddStatement(m_store);
 }

 if (remainderStrategy.Type == RemainderStrategy::Primitive)
 if (!handleRemainderFirst)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
 }

 INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
 //------------------------------------------------------------------------
 // CanSkipEntry:
 // Check if the specified entry can be skipped because it is writing to a
 // death replacement or because the remainder would handle it anyway.
 // dead replacement or because the remainder would handle it anyway.
 //
 // Parameters:
 // entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
 return addrNode->IsInvariant();
 }

private:
 //------------------------------------------------------------------------
 // RemainderOverwritesDestinationWithStaleBits:
 // Check if handling the remainder is going to write stale bits to the
 // destination.
 //
 // Parameters:
 // remainderStrategy - The remainder strategy
 // dstDeaths - Destination liveness
 //
 // Returns:
 // True if so.
 //
 // Remarks:
 // We usually prefer to write the remainder last as CQ analysis shows
 // that to be most beneficial. However, if we do that we may overwrite
 // the destination with stale bits. This occurs if the source has
 // replacements. Handling the remainder copies from the source struct
 // local, but the up-to-date values may be in its replacement locals. So
 // we must take care to write the replacement locals _after_ the
 // remainder has been written.
 //
 bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
 const StructDeaths& dstDeaths)
 {
 if (!m_srcInvolvesReplacements)
 {
 return false;
 }

 switch (remainderStrategy.Type)
 {
 case RemainderStrategy::FullBlock:
 return true;
 case RemainderStrategy::Primitive:
 for (int i = 0; i < m_entries.Height(); i++)
 {
 const Entry& entry = m_entries.BottomRef(i);
 if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
 {
 // Entry ends before remainder starts
 continue;
 }

 // Remainder ends before entry starts
 if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
 entry.Offset)
 {
 continue;
 }

 // Are we even going to write the entry?
 if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
 {
 // Yep, so we need to be careful.
 return true;
 }
 }

 // No entry overlaps.
 return false;
 default:
 return false;
 }
 }

 // Helper class to create derived accesses off of a location: either a
 // local, or as indirections off of an address.
 class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
 return m_indirFlags;
 }
 };

 //------------------------------------------------------------------------
 // CopyRemainder:
 // Create IR to copy the remainder.
 //
 // Parameters:
 // storeAccess - Helper class to create derived stores
 // srcAccess - Helper class to create derived source accesses
 // remainderStrategy - The strategy to generate IR for
 // statements - List to add IR to.
 //
 void CopyRemainder(LocationAccess& storeAccess,
 LocationAccess& srcAccess,
 const RemainderStrategy& remainderStrategy,
 DecompositionStatementList* statements)
 {
 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
 }

 statements->AddStatement(m_store);
 }
 else if (remainderStrategy.Type == RemainderStrategy::Primitive)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 }
 }
};

//------------------------------------------------------------------------
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
JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

jakobbotsch
merged 3 commits into

from

Jul 4, 2023
 Merged


JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion
#88109
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
0c9b1c5

JIT: Handle primitive-sized remainders overlapping padding in physica…


jakobbotsch Jun 30, 2023
c304c5b

Add header for CopyRemainder


jakobbotsch Jun 30, 2023
2e7a4d1

Fix bug


jakobbotsch Jul 3, 2023

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


22 changes: 0 additions & 22 deletions
src/coreclr/jit/promotion.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
 return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
 if (m_segments.size() == 1)
 {
 *result = m_segments[0];
 return true;
 }

 return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down

1 change: 0 additions & 1 deletion
src/coreclr/jit/promotion.h

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
 void Add(const Segment& segment);
 void Subtract(const Segment& segment);
 bool IsEmpty();
 bool IsSingleSegment(Segment* result);
 bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down

213 changes: 150 additions & 63 deletions
src/coreclr/jit/promotiondecomposition.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

 StructSegments::Segment segment;
 // See if we can "plug the hole" with a single primitive.
 if (remainder.IsSingleSegment(&segment))
 if (remainder.CoveringSegment(&segment))
 {
 var_types primitiveType = TYP_UNDEF;
 unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
 }
 }

 // We prefer to do the remainder at the end, if possible, since CQ
 // analysis shows that this is best. However, handling the remainder
 // may overwrite the destination with stale bits if the source has
 // replacements (since handling the remainder copies from the struct,
 // and the fresh values are usually in the replacement locals).
 bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

 GenTree* addr = nullptr;
 target_ssize_t addrBaseOffs = 0;
 FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

 if (m_compiler->fgAddrCouldBeNull(addr))
 {
 switch (remainderStrategy.Type)
 if (handleRemainderFirst)
 {
 needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
 m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
 }
 else
 {
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
 needsNullCheck = true;
 // See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 }
 }
 }

 if (needsNullCheck)
 {
 numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
 statements->AddStatement(nullCheck);
 }

 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 }

 // If the source involves replacements then do the struct op first --
 // we would overwrite the destination with stale bits if we did it last.
 // If the source does not involve replacements then CQ analysis shows
 // that it's best to do it last.
 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
 if (handleRemainderFirst)
 {
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

 if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
 {
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
 statements->AddStatement(store);
 }

 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
 {
 statements->AddStatement(m_store);
 }

 if (remainderStrategy.Type == RemainderStrategy::Primitive)
 if (!handleRemainderFirst)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
 }

 INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
 //------------------------------------------------------------------------
 // CanSkipEntry:
 // Check if the specified entry can be skipped because it is writing to a
 // death replacement or because the remainder would handle it anyway.
 // dead replacement or because the remainder would handle it anyway.
 //
 // Parameters:
 // entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
 return addrNode->IsInvariant();
 }

private:
 //------------------------------------------------------------------------
 // RemainderOverwritesDestinationWithStaleBits:
 // Check if handling the remainder is going to write stale bits to the
 // destination.
 //
 // Parameters:
 // remainderStrategy - The remainder strategy
 // dstDeaths - Destination liveness
 //
 // Returns:
 // True if so.
 //
 // Remarks:
 // We usually prefer to write the remainder last as CQ analysis shows
 // that to be most beneficial. However, if we do that we may overwrite
 // the destination with stale bits. This occurs if the source has
 // replacements. Handling the remainder copies from the source struct
 // local, but the up-to-date values may be in its replacement locals. So
 // we must take care to write the replacement locals _after_ the
 // remainder has been written.
 //
 bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
 const StructDeaths& dstDeaths)
 {
 if (!m_srcInvolvesReplacements)
 {
 return false;
 }

 switch (remainderStrategy.Type)
 {
 case RemainderStrategy::FullBlock:
 return true;
 case RemainderStrategy::Primitive:
 for (int i = 0; i < m_entries.Height(); i++)
 {
 const Entry& entry = m_entries.BottomRef(i);
 if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
 {
 // Entry ends before remainder starts
 continue;
 }

 // Remainder ends before entry starts
 if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
 entry.Offset)
 {
 continue;
 }

 // Are we even going to write the entry?
 if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
 {
 // Yep, so we need to be careful.
 return true;
 }
 }

 // No entry overlaps.
 return false;
 default:
 return false;
 }
 }

 // Helper class to create derived accesses off of a location: either a
 // local, or as indirections off of an address.
 class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
 return m_indirFlags;
 }
 };

 //------------------------------------------------------------------------
 // CopyRemainder:
 // Create IR to copy the remainder.
 //
 // Parameters:
 // storeAccess - Helper class to create derived stores
 // srcAccess - Helper class to create derived source accesses
 // remainderStrategy - The strategy to generate IR for
 // statements - List to add IR to.
 //
 void CopyRemainder(LocationAccess& storeAccess,
 LocationAccess& srcAccess,
 const RemainderStrategy& remainderStrategy,
 DecompositionStatementList* statements)
 {
 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
 }

 statements->AddStatement(m_store);
 }
 else if (remainderStrategy.Type == RemainderStrategy::Primitive)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 }
 }
};

//------------------------------------------------------------------------
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
JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

jakobbotsch
merged 3 commits into

from

Jul 4, 2023
 Merged


JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion
#88109
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
0c9b1c5

JIT: Handle primitive-sized remainders overlapping padding in physica…


jakobbotsch Jun 30, 2023
c304c5b

Add header for CopyRemainder


jakobbotsch Jun 30, 2023
2e7a4d1

Fix bug


jakobbotsch Jul 3, 2023

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


22 changes: 0 additions & 22 deletions
src/coreclr/jit/promotion.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
 return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
 if (m_segments.size() == 1)
 {
 *result = m_segments[0];
 return true;
 }

 return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down

1 change: 0 additions & 1 deletion
src/coreclr/jit/promotion.h

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
 void Add(const Segment& segment);
 void Subtract(const Segment& segment);
 bool IsEmpty();
 bool IsSingleSegment(Segment* result);
 bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down

213 changes: 150 additions & 63 deletions
src/coreclr/jit/promotiondecomposition.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

 StructSegments::Segment segment;
 // See if we can "plug the hole" with a single primitive.
 if (remainder.IsSingleSegment(&segment))
 if (remainder.CoveringSegment(&segment))
 {
 var_types primitiveType = TYP_UNDEF;
 unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
 }
 }

 // We prefer to do the remainder at the end, if possible, since CQ
 // analysis shows that this is best. However, handling the remainder
 // may overwrite the destination with stale bits if the source has
 // replacements (since handling the remainder copies from the struct,
 // and the fresh values are usually in the replacement locals).
 bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

 GenTree* addr = nullptr;
 target_ssize_t addrBaseOffs = 0;
 FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

 if (m_compiler->fgAddrCouldBeNull(addr))
 {
 switch (remainderStrategy.Type)
 if (handleRemainderFirst)
 {
 needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
 m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
 }
 else
 {
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
 needsNullCheck = true;
 // See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 }
 }
 }

 if (needsNullCheck)
 {
 numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
 statements->AddStatement(nullCheck);
 }

 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 }

 // If the source involves replacements then do the struct op first --
 // we would overwrite the destination with stale bits if we did it last.
 // If the source does not involve replacements then CQ analysis shows
 // that it's best to do it last.
 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
 if (handleRemainderFirst)
 {
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

 if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
 {
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
 statements->AddStatement(store);
 }

 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
 {
 statements->AddStatement(m_store);
 }

 if (remainderStrategy.Type == RemainderStrategy::Primitive)
 if (!handleRemainderFirst)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
 }

 INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
 //------------------------------------------------------------------------
 // CanSkipEntry:
 // Check if the specified entry can be skipped because it is writing to a
 // death replacement or because the remainder would handle it anyway.
 // dead replacement or because the remainder would handle it anyway.
 //
 // Parameters:
 // entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
 return addrNode->IsInvariant();
 }

private:
 //------------------------------------------------------------------------
 // RemainderOverwritesDestinationWithStaleBits:
 // Check if handling the remainder is going to write stale bits to the
 // destination.
 //
 // Parameters:
 // remainderStrategy - The remainder strategy
 // dstDeaths - Destination liveness
 //
 // Returns:
 // True if so.
 //
 // Remarks:
 // We usually prefer to write the remainder last as CQ analysis shows
 // that to be most beneficial. However, if we do that we may overwrite
 // the destination with stale bits. This occurs if the source has
 // replacements. Handling the remainder copies from the source struct
 // local, but the up-to-date values may be in its replacement locals. So
 // we must take care to write the replacement locals _after_ the
 // remainder has been written.
 //
 bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
 const StructDeaths& dstDeaths)
 {
 if (!m_srcInvolvesReplacements)
 {
 return false;
 }

 switch (remainderStrategy.Type)
 {
 case RemainderStrategy::FullBlock:
 return true;
 case RemainderStrategy::Primitive:
 for (int i = 0; i < m_entries.Height(); i++)
 {
 const Entry& entry = m_entries.BottomRef(i);
 if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
 {
 // Entry ends before remainder starts
 continue;
 }

 // Remainder ends before entry starts
 if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
 entry.Offset)
 {
 continue;
 }

 // Are we even going to write the entry?
 if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
 {
 // Yep, so we need to be careful.
 return true;
 }
 }

 // No entry overlaps.
 return false;
 default:
 return false;
 }
 }

 // Helper class to create derived accesses off of a location: either a
 // local, or as indirections off of an address.
 class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
 return m_indirFlags;
 }
 };

 //------------------------------------------------------------------------
 // CopyRemainder:
 // Create IR to copy the remainder.
 //
 // Parameters:
 // storeAccess - Helper class to create derived stores
 // srcAccess - Helper class to create derived source accesses
 // remainderStrategy - The strategy to generate IR for
 // statements - List to add IR to.
 //
 void CopyRemainder(LocationAccess& storeAccess,
 LocationAccess& srcAccess,
 const RemainderStrategy& remainderStrategy,
 DecompositionStatementList* statements)
 {
 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
 }

 statements->AddStatement(m_store);
 }
 else if (remainderStrategy.Type == RemainderStrategy::Primitive)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 }
 }
};

//------------------------------------------------------------------------
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
JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

jakobbotsch
merged 3 commits into

from

Jul 4, 2023
 Merged


JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion
#88109
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
0c9b1c5

JIT: Handle primitive-sized remainders overlapping padding in physica…


jakobbotsch Jun 30, 2023
c304c5b

Add header for CopyRemainder


jakobbotsch Jun 30, 2023
2e7a4d1

Fix bug


jakobbotsch Jul 3, 2023

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


22 changes: 0 additions & 22 deletions
src/coreclr/jit/promotion.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
 return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
 if (m_segments.size() == 1)
 {
 *result = m_segments[0];
 return true;
 }

 return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down

1 change: 0 additions & 1 deletion
src/coreclr/jit/promotion.h

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
 void Add(const Segment& segment);
 void Subtract(const Segment& segment);
 bool IsEmpty();
 bool IsSingleSegment(Segment* result);
 bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down

213 changes: 150 additions & 63 deletions
src/coreclr/jit/promotiondecomposition.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

 StructSegments::Segment segment;
 // See if we can "plug the hole" with a single primitive.
 if (remainder.IsSingleSegment(&segment))
 if (remainder.CoveringSegment(&segment))
 {
 var_types primitiveType = TYP_UNDEF;
 unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
 }
 }

 // We prefer to do the remainder at the end, if possible, since CQ
 // analysis shows that this is best. However, handling the remainder
 // may overwrite the destination with stale bits if the source has
 // replacements (since handling the remainder copies from the struct,
 // and the fresh values are usually in the replacement locals).
 bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

 GenTree* addr = nullptr;
 target_ssize_t addrBaseOffs = 0;
 FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

 if (m_compiler->fgAddrCouldBeNull(addr))
 {
 switch (remainderStrategy.Type)
 if (handleRemainderFirst)
 {
 needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
 m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
 }
 else
 {
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
 needsNullCheck = true;
 // See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 }
 }
 }

 if (needsNullCheck)
 {
 numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
 statements->AddStatement(nullCheck);
 }

 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 }

 // If the source involves replacements then do the struct op first --
 // we would overwrite the destination with stale bits if we did it last.
 // If the source does not involve replacements then CQ analysis shows
 // that it's best to do it last.
 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
 if (handleRemainderFirst)
 {
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

 if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
 {
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
 statements->AddStatement(store);
 }

 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
 {
 statements->AddStatement(m_store);
 }

 if (remainderStrategy.Type == RemainderStrategy::Primitive)
 if (!handleRemainderFirst)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
 }

 INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
 //------------------------------------------------------------------------
 // CanSkipEntry:
 // Check if the specified entry can be skipped because it is writing to a
 // death replacement or because the remainder would handle it anyway.
 // dead replacement or because the remainder would handle it anyway.
 //
 // Parameters:
 // entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
 return addrNode->IsInvariant();
 }

private:
 //------------------------------------------------------------------------
 // RemainderOverwritesDestinationWithStaleBits:
 // Check if handling the remainder is going to write stale bits to the
 // destination.
 //
 // Parameters:
 // remainderStrategy - The remainder strategy
 // dstDeaths - Destination liveness
 //
 // Returns:
 // True if so.
 //
 // Remarks:
 // We usually prefer to write the remainder last as CQ analysis shows
 // that to be most beneficial. However, if we do that we may overwrite
 // the destination with stale bits. This occurs if the source has
 // replacements. Handling the remainder copies from the source struct
 // local, but the up-to-date values may be in its replacement locals. So
 // we must take care to write the replacement locals _after_ the
 // remainder has been written.
 //
 bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
 const StructDeaths& dstDeaths)
 {
 if (!m_srcInvolvesReplacements)
 {
 return false;
 }

 switch (remainderStrategy.Type)
 {
 case RemainderStrategy::FullBlock:
 return true;
 case RemainderStrategy::Primitive:
 for (int i = 0; i < m_entries.Height(); i++)
 {
 const Entry& entry = m_entries.BottomRef(i);
 if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
 {
 // Entry ends before remainder starts
 continue;
 }

 // Remainder ends before entry starts
 if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
 entry.Offset)
 {
 continue;
 }

 // Are we even going to write the entry?
 if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
 {
 // Yep, so we need to be careful.
 return true;
 }
 }

 // No entry overlaps.
 return false;
 default:
 return false;
 }
 }

 // Helper class to create derived accesses off of a location: either a
 // local, or as indirections off of an address.
 class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
 return m_indirFlags;
 }
 };

 //------------------------------------------------------------------------
 // CopyRemainder:
 // Create IR to copy the remainder.
 //
 // Parameters:
 // storeAccess - Helper class to create derived stores
 // srcAccess - Helper class to create derived source accesses
 // remainderStrategy - The strategy to generate IR for
 // statements - List to add IR to.
 //
 void CopyRemainder(LocationAccess& storeAccess,
 LocationAccess& srcAccess,
 const RemainderStrategy& remainderStrategy,
 DecompositionStatementList* statements)
 {
 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
 }

 statements->AddStatement(m_store);
 }
 else if (remainderStrategy.Type == RemainderStrategy::Primitive)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 }
 }
};

//------------------------------------------------------------------------
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
JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

jakobbotsch
merged 3 commits into

from

Jul 4, 2023
 Merged


JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion
#88109
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
0c9b1c5

JIT: Handle primitive-sized remainders overlapping padding in physica…


jakobbotsch Jun 30, 2023
c304c5b

Add header for CopyRemainder


jakobbotsch Jun 30, 2023
2e7a4d1

Fix bug


jakobbotsch Jul 3, 2023

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


22 changes: 0 additions & 22 deletions
src/coreclr/jit/promotion.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
 return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
 if (m_segments.size() == 1)
 {
 *result = m_segments[0];
 return true;
 }

 return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down

1 change: 0 additions & 1 deletion
src/coreclr/jit/promotion.h

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
 void Add(const Segment& segment);
 void Subtract(const Segment& segment);
 bool IsEmpty();
 bool IsSingleSegment(Segment* result);
 bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down

213 changes: 150 additions & 63 deletions
src/coreclr/jit/promotiondecomposition.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

 StructSegments::Segment segment;
 // See if we can "plug the hole" with a single primitive.
 if (remainder.IsSingleSegment(&segment))
 if (remainder.CoveringSegment(&segment))
 {
 var_types primitiveType = TYP_UNDEF;
 unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
 }
 }

 // We prefer to do the remainder at the end, if possible, since CQ
 // analysis shows that this is best. However, handling the remainder
 // may overwrite the destination with stale bits if the source has
 // replacements (since handling the remainder copies from the struct,
 // and the fresh values are usually in the replacement locals).
 bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

 GenTree* addr = nullptr;
 target_ssize_t addrBaseOffs = 0;
 FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

 if (m_compiler->fgAddrCouldBeNull(addr))
 {
 switch (remainderStrategy.Type)
 if (handleRemainderFirst)
 {
 needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
 m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
 }
 else
 {
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
 needsNullCheck = true;
 // See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 }
 }
 }

 if (needsNullCheck)
 {
 numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
 statements->AddStatement(nullCheck);
 }

 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 }

 // If the source involves replacements then do the struct op first --
 // we would overwrite the destination with stale bits if we did it last.
 // If the source does not involve replacements then CQ analysis shows
 // that it's best to do it last.
 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
 if (handleRemainderFirst)
 {
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

 if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
 {
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
 statements->AddStatement(store);
 }

 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
 {
 statements->AddStatement(m_store);
 }

 if (remainderStrategy.Type == RemainderStrategy::Primitive)
 if (!handleRemainderFirst)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
 }

 INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
 //------------------------------------------------------------------------
 // CanSkipEntry:
 // Check if the specified entry can be skipped because it is writing to a
 // death replacement or because the remainder would handle it anyway.
 // dead replacement or because the remainder would handle it anyway.
 //
 // Parameters:
 // entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
 return addrNode->IsInvariant();
 }

private:
 //------------------------------------------------------------------------
 // RemainderOverwritesDestinationWithStaleBits:
 // Check if handling the remainder is going to write stale bits to the
 // destination.
 //
 // Parameters:
 // remainderStrategy - The remainder strategy
 // dstDeaths - Destination liveness
 //
 // Returns:
 // True if so.
 //
 // Remarks:
 // We usually prefer to write the remainder last as CQ analysis shows
 // that to be most beneficial. However, if we do that we may overwrite
 // the destination with stale bits. This occurs if the source has
 // replacements. Handling the remainder copies from the source struct
 // local, but the up-to-date values may be in its replacement locals. So
 // we must take care to write the replacement locals _after_ the
 // remainder has been written.
 //
 bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
 const StructDeaths& dstDeaths)
 {
 if (!m_srcInvolvesReplacements)
 {
 return false;
 }

 switch (remainderStrategy.Type)
 {
 case RemainderStrategy::FullBlock:
 return true;
 case RemainderStrategy::Primitive:
 for (int i = 0; i < m_entries.Height(); i++)
 {
 const Entry& entry = m_entries.BottomRef(i);
 if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
 {
 // Entry ends before remainder starts
 continue;
 }

 // Remainder ends before entry starts
 if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
 entry.Offset)
 {
 continue;
 }

 // Are we even going to write the entry?
 if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
 {
 // Yep, so we need to be careful.
 return true;
 }
 }

 // No entry overlaps.
 return false;
 default:
 return false;
 }
 }

 // Helper class to create derived accesses off of a location: either a
 // local, or as indirections off of an address.
 class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
 return m_indirFlags;
 }
 };

 //------------------------------------------------------------------------
 // CopyRemainder:
 // Create IR to copy the remainder.
 //
 // Parameters:
 // storeAccess - Helper class to create derived stores
 // srcAccess - Helper class to create derived source accesses
 // remainderStrategy - The strategy to generate IR for
 // statements - List to add IR to.
 //
 void CopyRemainder(LocationAccess& storeAccess,
 LocationAccess& srcAccess,
 const RemainderStrategy& remainderStrategy,
 DecompositionStatementList* statements)
 {
 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
 }

 statements->AddStatement(m_store);
 }
 else if (remainderStrategy.Type == RemainderStrategy::Primitive)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 }
 }
};

//------------------------------------------------------------------------
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
JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion#88109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

jakobbotsch
merged 3 commits into

from

Jul 4, 2023
 Merged


JIT: Handle primitive-sized remainders overlapping padding/promotions in physical promotion
#88109
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
0c9b1c5

JIT: Handle primitive-sized remainders overlapping padding in physica…


jakobbotsch Jun 30, 2023
c304c5b

Add header for CopyRemainder


jakobbotsch Jun 30, 2023
2e7a4d1

Fix bug


jakobbotsch Jul 3, 2023

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


22 changes: 0 additions & 22 deletions
src/coreclr/jit/promotion.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -1626,28 +1626,6 @@ bool StructSegments::IsEmpty()
 return m_segments.size() == 0;
}

//------------------------------------------------------------------------
// IsSingleSegment:
// Check if the segment tree contains only a single segment, and return
// it if so.
//
// Parameters:
// result - [out] The single segment. Only valid if the method returns true.
//
// Returns:
// True if so.
//
bool StructSegments::IsSingleSegment(Segment* result)
{
 if (m_segments.size() == 1)
 {
 *result = m_segments[0];
 return true;
 }

 return false;
}

//------------------------------------------------------------------------
// CoveringSegment:
// Compute a segment that covers all contained segments in this segment tree.
Expand Down

1 change: 0 additions & 1 deletion
src/coreclr/jit/promotion.h

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -75,7 +75,6 @@ class StructSegments
 void Add(const Segment& segment);
 void Subtract(const Segment& segment);
 bool IsEmpty();
 bool IsSingleSegment(Segment* result);
 bool CoveringSegment(Segment* result);

#ifdef DEBUG
Expand Down

213 changes: 150 additions & 63 deletions
src/coreclr/jit/promotiondecomposition.cpp

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -308,7 +308,7 @@ class DecompositionPlan

 StructSegments::Segment segment;
 // See if we can "plug the hole" with a single primitive.
 if (remainder.IsSingleSegment(&segment))
 if (remainder.CoveringSegment(&segment))
 {
 var_types primitiveType = TYP_UNDEF;
 unsigned size = segment.End - segment.Start;
Expand DownExpand Up@@ -487,6 +487,13 @@ class DecompositionPlan
 }
 }

 // We prefer to do the remainder at the end, if possible, since CQ
 // analysis shows that this is best. However, handling the remainder
 // may overwrite the destination with stale bits if the source has
 // replacements (since handling the remainder copies from the struct,
 // and the fresh values are usually in the replacement locals).
 bool handleRemainderFirst = RemainderOverwritesDestinationWithStaleBits(remainderStrategy, dstDeaths);

 GenTree* addr = nullptr;
 target_ssize_t addrBaseOffs = 0;
 FieldSeq* addrBaseOffsFldSeq = nullptr;
Expand DownExpand Up@@ -525,26 +532,29 @@ class DecompositionPlan

 if (m_compiler->fgAddrCouldBeNull(addr))
 {
 switch (remainderStrategy.Type)
 if (handleRemainderFirst)
 {
 needsNullCheck = (remainderStrategy.Type == RemainderStrategy::Primitive) &&
 m_compiler->fgIsBigOffset(remainderStrategy.PrimitiveOffset);
 }
 else
 {
case RemainderStrategy::NoRemainder:
case RemainderStrategy::Primitive:
 needsNullCheck = true;
 // See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
needsNullCheck = true;
// See if our first indirection will subsume the null check (usual case).
for (int i = 0; i < m_entries.Height(); i++)
{
if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 if (CanSkipEntry(m_entries.BottomRef(i), dstDeaths, remainderStrategy))
 {
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 continue;
 }
 const Entry& entry = m_entries.BottomRef(i);
 assert((entry.FromReplacement == nullptr) || (entry.ToReplacement == nullptr));
 needsNullCheck = m_compiler->fgIsBigOffset(entry.Offset);
 break;
 }
 }
 }

 if (needsNullCheck)
 {
 numAddrUses++;
Expand DownExpand Up@@ -606,26 +616,9 @@ class DecompositionPlan
 statements->AddStatement(nullCheck);
 }

 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = indirAccess->GrabAddress(0, m_compiler);
 }
 }

 // If the source involves replacements then do the struct op first --
 // we would overwrite the destination with stale bits if we did it last.
 // If the source does not involve replacements then CQ analysis shows
 // that it's best to do it last.
 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && m_srcInvolvesReplacements)
 if (handleRemainderFirst)
 {
statements->AddStatement(m_store);
CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);

 if (m_src->OperIs(GT_LCL_VAR, GT_LCL_FLD))
 {
Expand DownExpand Up@@ -693,34 +686,9 @@ class DecompositionPlan
 statements->AddStatement(store);
 }

 if ((remainderStrategy.Type == RemainderStrategy::FullBlock) && !m_srcInvolvesReplacements)
 {
 statements->AddStatement(m_store);
 }

 if (remainderStrategy.Type == RemainderStrategy::Primitive)
 if (!handleRemainderFirst)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 CopyRemainder(storeAccess, srcAccess, remainderStrategy, statements);
 }

 INDEBUG(storeAccess.CheckFullyUsed());
Expand All@@ -730,7 +698,7 @@ class DecompositionPlan
 //------------------------------------------------------------------------
 // CanSkipEntry:
 // Check if the specified entry can be skipped because it is writing to a
 // death replacement or because the remainder would handle it anyway.
 // dead replacement or because the remainder would handle it anyway.
 //
 // Parameters:
 // entry - The init/copy entry
Expand DownExpand Up@@ -861,7 +829,71 @@ class DecompositionPlan
 return addrNode->IsInvariant();
 }

private:
 //------------------------------------------------------------------------
 // RemainderOverwritesDestinationWithStaleBits:
 // Check if handling the remainder is going to write stale bits to the
 // destination.
 //
 // Parameters:
 // remainderStrategy - The remainder strategy
 // dstDeaths - Destination liveness
 //
 // Returns:
 // True if so.
 //
 // Remarks:
 // We usually prefer to write the remainder last as CQ analysis shows
 // that to be most beneficial. However, if we do that we may overwrite
 // the destination with stale bits. This occurs if the source has
 // replacements. Handling the remainder copies from the source struct
 // local, but the up-to-date values may be in its replacement locals. So
 // we must take care to write the replacement locals _after_ the
 // remainder has been written.
 //
 bool RemainderOverwritesDestinationWithStaleBits(const RemainderStrategy& remainderStrategy,
 const StructDeaths& dstDeaths)
 {
 if (!m_srcInvolvesReplacements)
 {
 return false;
 }

 switch (remainderStrategy.Type)
 {
 case RemainderStrategy::FullBlock:
 return true;
 case RemainderStrategy::Primitive:
 for (int i = 0; i < m_entries.Height(); i++)
 {
 const Entry& entry = m_entries.BottomRef(i);
 if (entry.Offset + genTypeSize(entry.Type) <= remainderStrategy.PrimitiveOffset)
 {
 // Entry ends before remainder starts
 continue;
 }

 // Remainder ends before entry starts
 if (remainderStrategy.PrimitiveOffset + genTypeSize(remainderStrategy.PrimitiveType) <=
 entry.Offset)
 {
 continue;
 }

 // Are we even going to write the entry?
 if (!CanSkipEntry(entry, dstDeaths, remainderStrategy))
 {
 // Yep, so we need to be careful.
 return true;
 }
 }

 // No entry overlaps.
 return false;
 default:
 return false;
 }
 }

 // Helper class to create derived accesses off of a location: either a
 // local, or as indirections off of an address.
 class LocationAccess
Expand DownExpand Up@@ -1080,6 +1112,61 @@ class DecompositionPlan
 return m_indirFlags;
 }
 };

 //------------------------------------------------------------------------
 // CopyRemainder:
 // Create IR to copy the remainder.
 //
 // Parameters:
 // storeAccess - Helper class to create derived stores
 // srcAccess - Helper class to create derived source accesses
 // remainderStrategy - The strategy to generate IR for
 // statements - List to add IR to.
 //
 void CopyRemainder(LocationAccess& storeAccess,
 LocationAccess& srcAccess,
 const RemainderStrategy& remainderStrategy,
 DecompositionStatementList* statements)
 {
 if (remainderStrategy.Type == RemainderStrategy::FullBlock)
 {
 // We will reuse the existing block op. Rebase the address off of the new local we created.
 if (m_src->OperIs(GT_BLK))
 {
 m_src->AsIndir()->Addr() = srcAccess.GrabAddress(0, m_compiler);
 }
 else if (m_store->OperIs(GT_STORE_BLK))
 {
 m_store->AsIndir()->Addr() = storeAccess.GrabAddress(0, m_compiler);
 }

 statements->AddStatement(m_store);
 }
 else if (remainderStrategy.Type == RemainderStrategy::Primitive)
 {
 var_types primitiveType = remainderStrategy.PrimitiveType;
 // The remainder might match a regularly promoted field exactly. If
 // it does then use the promoted field's type so we can create a
 // direct access.
 unsigned srcPromField = srcAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);
 unsigned storePromField =
 storeAccess.FindRegularlyPromotedField(remainderStrategy.PrimitiveOffset, m_compiler);

 if ((srcPromField != BAD_VAR_NUM) || (storePromField != BAD_VAR_NUM))
 {
 var_types regPromFieldType =
 m_compiler->lvaGetDesc(srcPromField != BAD_VAR_NUM ? srcPromField : storePromField)->TypeGet();
 if (genTypeSize(regPromFieldType) == genTypeSize(primitiveType))
 {
 primitiveType = regPromFieldType;
 }
 }

 GenTree* src = srcAccess.CreateRead(remainderStrategy.PrimitiveOffset, primitiveType, m_compiler);
 GenTree* store = storeAccess.CreateStore(remainderStrategy.PrimitiveOffset, primitiveType, src, m_compiler);
 statements->AddStatement(store);
 }
 }
};

//------------------------------------------------------------------------
Expand Down