-
Notifications
You must be signed in to change notification settings - Fork 5.2k
JIT: Unblock Vector###<long> intrinsics on x86 #112728
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.
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
Merged
Changes from all commits
Commits
Show all changes
20 commits
Select commit
Hold shift + click to select a range
3a130c8
unblock long xplat intrinsics on x86
saucecontrol 7f220c2
tidying
saucecontrol 78dc31d
tidying2
saucecontrol 7330c3e
Merge remote-tracking branch 'upstream/main' into createscalar64
saucecontrol 69065ee
remove CreateScalarUnsafe opt for small loads
saucecontrol 86ebdae
skip more redundant casts for CreateScalar of small types
saucecontrol cdb0910
use temp reg for CreateScalar float SSE fallback
saucecontrol 5d6fb3f
formatting patch
saucecontrol bb03516
simplify storeind containment of ToScalar
saucecontrol cba4ab0
don't use temp reg for CreateScalar float SSE fallback
saucecontrol 1f97bd9
Merge remote-tracking branch 'upstream/main' into createscalar64
saucecontrol 71145ab
Merge remote-tracking branch 'upstream/main' into createscalar64
saucecontrol 42a6ab8
skip cast on other memory loads
saucecontrol 1c98e23
use proper containment check
saucecontrol c80c566
Merge remote-tracking branch 'upstream/main' into createscalar64
saucecontrol fb2cf30
Merge remote-tracking branch 'upstream/main' into createscalar64
saucecontrol 3a76030
Merge remote-tracking branch 'upstream/main' into createscalar64
saucecontrol af01862
add more validation, remove CreateSequence restriction
saucecontrol 811e16e
Merge remote-tracking branch 'upstream/main' into createscalar64
saucecontrol aebbf68
use appropriate helpers for decomposing ToScalar
saucecontrol File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -78,19 +78,19 @@ void DecomposeLongs::DecomposeBlock(BasicBlock* block) | |
// Return Value: | ||
// None. | ||
// | ||
void DecomposeLongs::DecomposeRange(Compiler* compiler, LIR::Range& range) | ||
void DecomposeLongs::DecomposeRange(Compiler* compiler, Lowering* lowering, LIR::Range& range) | ||
{ | ||
assert(compiler != nullptr); | ||
|
||
DecomposeLongs decomposer(compiler); | ||
DecomposeLongs decomposer(compiler, lowering); | ||
decomposer.m_range = ⦥ | ||
|
||
decomposer.DecomposeRangeHelper(); | ||
} | ||
|
||
//------------------------------------------------------------------------ | ||
// DecomposeLongs::DecomposeRangeHelper: | ||
// Decompiose each node in the current range. | ||
// Decompose each node in the current range. | ||
// | ||
// Decomposition is done as an execution-order walk. Decomposition of | ||
// a particular node can create new nodes that need to be further | ||
|
@@ -122,44 +122,76 @@ void DecomposeLongs::DecomposeRangeHelper() | |
GenTree* DecomposeLongs::DecomposeNode(GenTree* tree) | ||
{ | ||
// Handle the case where we are implicitly using the lower half of a long lclVar. | ||
if ((tree->TypeGet() == TYP_INT) && tree->OperIsLocal()) | ||
if (tree->TypeIs(TYP_INT) && tree->OperIsLocal()) | ||
{ | ||
LclVarDsc* varDsc = m_compiler->lvaGetDesc(tree->AsLclVarCommon()); | ||
if (varTypeIsLong(varDsc) && varDsc->lvPromoted) | ||
{ | ||
#ifdef DEBUG | ||
if (m_compiler->verbose) | ||
{ | ||
printf("Changing implicit reference to lo half of long lclVar to an explicit reference of its promoted " | ||
"half:\n"); | ||
m_compiler->gtDispTreeRange(Range(), tree); | ||
} | ||
#endif // DEBUG | ||
JITDUMP("Changing implicit reference to lo half of long lclVar to an explicit reference of its promoted " | ||
"half:\n"); | ||
DISPTREERANGE(Range(), tree); | ||
|
||
unsigned loVarNum = varDsc->lvFieldLclStart; | ||
tree->AsLclVarCommon()->SetLclNum(loVarNum); | ||
return tree->gtNext; | ||
} | ||
} | ||
|
||
if (tree->TypeGet() != TYP_LONG) | ||
if (!tree->TypeIs(TYP_LONG)) | ||
{ | ||
return tree->gtNext; | ||
} | ||
|
||
#ifdef DEBUG | ||
if (m_compiler->verbose) | ||
{ | ||
printf("Decomposing TYP_LONG tree. BEFORE:\n"); | ||
m_compiler->gtDispTreeRange(Range(), tree); | ||
} | ||
#endif // DEBUG | ||
|
||
LIR::Use use; | ||
if (!Range().TryGetUse(tree, &use)) | ||
{ | ||
LIR::Use::MakeDummyUse(Range(), tree, &use); | ||
} | ||
|
||
#if defined(FEATURE_HW_INTRINSICS) && defined(TARGET_X86) | ||
if (!use.IsDummyUse()) | ||
{ | ||
// HWIntrinsics can consume/produce a long directly, provided its source/target is memory. | ||
// Here we do a conservative check for specific cases where it is certain the load/store | ||
// can be contained. In those cases, we can skip decomposition. | ||
|
||
GenTree* user = use.User(); | ||
|
||
if (user->OperIsHWIntrinsic()) | ||
{ | ||
if (tree->OperIs(GT_CNS_LNG) || | ||
(tree->OperIs(GT_IND, GT_LCL_FLD) && m_lowering->IsSafeToContainMem(user, tree))) | ||
{ | ||
NamedIntrinsic intrinsicId = user->AsHWIntrinsic()->GetHWIntrinsicId(); | ||
assert(HWIntrinsicInfo::IsVectorCreate(intrinsicId) || | ||
HWIntrinsicInfo::IsVectorCreateScalar(intrinsicId) || | ||
HWIntrinsicInfo::IsVectorCreateScalarUnsafe(intrinsicId)); | ||
|
||
return tree->gtNext; | ||
} | ||
} | ||
else if (user->OperIs(GT_STOREIND) && tree->OperIsHWIntrinsic() && m_compiler->opts.OptimizationEnabled()) | ||
{ | ||
NamedIntrinsic intrinsicId = tree->AsHWIntrinsic()->GetHWIntrinsicId(); | ||
if (HWIntrinsicInfo::IsVectorToScalar(intrinsicId) && m_lowering->IsSafeToContainMem(user, tree)) | ||
{ | ||
return tree->gtNext; | ||
} | ||
} | ||
} | ||
|
||
if (tree->OperIs(GT_STOREIND) && tree->AsStoreInd()->Data()->OperIsHWIntrinsic()) | ||
{ | ||
// We should only get here if we matched the second pattern above. | ||
assert(HWIntrinsicInfo::IsVectorToScalar(tree->AsStoreInd()->Data()->AsHWIntrinsic()->GetHWIntrinsicId())); | ||
|
||
return tree->gtNext; | ||
} | ||
#endif // FEATURE_HW_INTRINSICS && TARGET_X86 | ||
|
||
JITDUMP("Decomposing TYP_LONG tree. BEFORE:\n"); | ||
DISPTREERANGE(Range(), tree); | ||
|
||
GenTree* nextNode = nullptr; | ||
switch (tree->OperGet()) | ||
{ | ||
|
@@ -270,19 +302,14 @@ GenTree* DecomposeLongs::DecomposeNode(GenTree* tree) | |
|
||
// If we replaced the argument to a GT_FIELD_LIST element with a GT_LONG node, split that field list | ||
// element into two elements: one for each half of the GT_LONG. | ||
if ((use.Def()->OperGet() == GT_LONG) && !use.IsDummyUse() && (use.User()->OperGet() == GT_FIELD_LIST)) | ||
if (use.Def()->OperIs(GT_LONG) && !use.IsDummyUse() && use.User()->OperIs(GT_FIELD_LIST)) | ||
{ | ||
DecomposeFieldList(use.User()->AsFieldList(), use.Def()->AsOp()); | ||
} | ||
|
||
#ifdef DEBUG | ||
if (m_compiler->verbose) | ||
{ | ||
// NOTE: st_lcl_var doesn't dump properly afterwards. | ||
printf("Decomposing TYP_LONG tree. AFTER:\n"); | ||
m_compiler->gtDispTreeRange(Range(), use.Def()); | ||
} | ||
#endif | ||
// NOTE: st_lcl_var doesn't dump properly afterwards. | ||
JITDUMP("Decomposing TYP_LONG tree. AFTER:\n"); | ||
DISPTREERANGE(Range(), use.Def()); | ||
|
||
// When casting from a decomposed long to a smaller integer we can discard the high part. | ||
if (m_compiler->opts.OptimizationEnabled() && !use.IsDummyUse() && use.User()->OperIs(GT_CAST) && | ||
|
@@ -1707,6 +1734,13 @@ GenTree* DecomposeLongs::DecomposeHWIntrinsic(LIR::Use& use) | |
return DecomposeHWIntrinsicGetElement(use, hwintrinsicTree); | ||
} | ||
|
||
case NI_Vector128_ToScalar: | ||
case NI_Vector256_ToScalar: | ||
case NI_Vector512_ToScalar: | ||
{ | ||
return DecomposeHWIntrinsicToScalar(use, hwintrinsicTree); | ||
} | ||
|
||
case NI_EVEX_MoveMask: | ||
{ | ||
return DecomposeHWIntrinsicMoveMask(use, hwintrinsicTree); | ||
|
@@ -1751,9 +1785,7 @@ GenTree* DecomposeLongs::DecomposeHWIntrinsicGetElement(LIR::Use& use, GenTreeHW | |
{ | ||
assert(node == use.Def()); | ||
assert(varTypeIsLong(node)); | ||
assert((node->GetHWIntrinsicId() == NI_Vector128_GetElement) || | ||
(node->GetHWIntrinsicId() == NI_Vector256_GetElement) || | ||
(node->GetHWIntrinsicId() == NI_Vector512_GetElement)); | ||
assert(HWIntrinsicInfo::IsVectorGetElement(node->GetHWIntrinsicId())); | ||
|
||
GenTree* op1 = node->Op(1); | ||
GenTree* op2 = node->Op(2); | ||
|
@@ -1835,6 +1867,75 @@ GenTree* DecomposeLongs::DecomposeHWIntrinsicGetElement(LIR::Use& use, GenTreeHW | |
return FinalizeDecomposition(use, loResult, hiResult, hiResult); | ||
} | ||
|
||
//------------------------------------------------------------------------ | ||
// DecomposeHWIntrinsicToScalar: Decompose GT_HWINTRINSIC -- NI_Vector*_ToScalar. | ||
// | ||
// create: | ||
// | ||
// tmp_simd_var = simd_var | ||
// lo_result = GT_HWINTRINSIC{ToScalar}[int](tmp_simd_var) | ||
// hi_result = GT_HWINTRINSIC{GetElement}[int](tmp_simd_var, 1) | ||
// - or - | ||
// GT_HWINTRINSIC{ToScalar}[int](GT_RSZ(tmp_simd_var, 32)) | ||
// return: GT_LONG(lo_result, hi_result) | ||
// | ||
// Arguments: | ||
// use - the LIR::Use object for the def that needs to be decomposed. | ||
// node - the hwintrinsic node to decompose | ||
// | ||
// Return Value: | ||
// The GT_LONG node wrapping the upper and lower halves. | ||
// | ||
GenTree* DecomposeLongs::DecomposeHWIntrinsicToScalar(LIR::Use& use, GenTreeHWIntrinsic* node) | ||
{ | ||
assert(node == use.Def()); | ||
assert(varTypeIsLong(node)); | ||
assert(HWIntrinsicInfo::IsVectorToScalar(node->GetHWIntrinsicId())); | ||
|
||
GenTree* op1 = node->Op(1); | ||
NamedIntrinsic intrinsicId = node->GetHWIntrinsicId(); | ||
var_types simdBaseType = node->GetSimdBaseType(); | ||
unsigned simdSize = node->GetSimdSize(); | ||
|
||
assert(varTypeIsLong(simdBaseType)); | ||
assert(varTypeIsSIMD(op1)); | ||
|
||
GenTree* simdTmpVar = RepresentOpAsLocalVar(op1, node, &node->Op(1)); | ||
unsigned simdTmpVarNum = simdTmpVar->AsLclVarCommon()->GetLclNum(); | ||
JITDUMP("[DecomposeHWIntrinsicToScalar]: Saving op1 tree to a temp var:\n"); | ||
DISPTREERANGE(Range(), simdTmpVar); | ||
|
||
GenTree* loResult = m_compiler->gtNewSimdToScalarNode(TYP_INT, simdTmpVar, CORINFO_TYPE_INT, simdSize); | ||
Range().InsertAfter(simdTmpVar, loResult); | ||
|
||
simdTmpVar = m_compiler->gtNewLclLNode(simdTmpVarNum, simdTmpVar->TypeGet()); | ||
Range().InsertAfter(loResult, simdTmpVar); | ||
|
||
GenTree* hiResult; | ||
if (m_compiler->compOpportunisticallyDependsOn(InstructionSet_SSE41)) | ||
{ | ||
GenTree* one = m_compiler->gtNewIconNode(1); | ||
hiResult = m_compiler->gtNewSimdGetElementNode(TYP_INT, simdTmpVar, one, CORINFO_TYPE_INT, simdSize); | ||
|
||
Range().InsertAfter(simdTmpVar, one, hiResult); | ||
} | ||
else | ||
{ | ||
assert(m_compiler->compIsaSupportedDebugOnly(InstructionSet_SSE2)); | ||
|
||
GenTree* thirtyTwo = m_compiler->gtNewIconNode(32); | ||
GenTree* shift = m_compiler->gtNewSimdBinOpNode(GT_RSZ, op1->TypeGet(), simdTmpVar, thirtyTwo, | ||
node->GetSimdBaseJitType(), simdSize); | ||
hiResult = m_compiler->gtNewSimdToScalarNode(TYP_INT, shift, CORINFO_TYPE_INT, simdSize); | ||
|
||
Range().InsertAfter(simdTmpVar, thirtyTwo, shift, hiResult); | ||
} | ||
|
||
Range().Remove(node); | ||
|
||
return FinalizeDecomposition(use, loResult, hiResult, hiResult); | ||
} | ||
|
||
//------------------------------------------------------------------------ | ||
// DecomposeHWIntrinsicMoveMask: Decompose GT_HWINTRINSIC -- NI_EVEX_MoveMask | ||
// | ||
|
@@ -2262,6 +2363,13 @@ void DecomposeLongs::TryPromoteLongVar(unsigned lclNum) | |
{ | ||
return; | ||
} | ||
#if defined(FEATURE_HW_INTRINSICS) && defined(TARGET_X86) | ||
if (varDsc->lvIsParam) | ||
{ | ||
// Promotion blocks combined read optimizations for SIMD loads of long params | ||
return; | ||
} | ||
Comment on lines
+2367
to
+2371
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. In isolation, this change produced a small number of diffs and was mostly an improvement. A few regressions show up in the SPMI reports, but the overall impact is good, especially considering the places we can load a long to vector with |
||
#endif // FEATURE_HW_INTRINSICS && TARGET_X86 | ||
|
||
varDsc->lvFieldCnt = 2; | ||
varDsc->lvFieldLclStart = m_compiler->lvaCount; | ||
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.