diff options
| author | Brian Sullivan <briansul@microsoft.com> | 2016-07-27 17:39:15 -0700 |
|---|---|---|
| committer | Brian Sullivan <briansul@microsoft.com> | 2016-08-04 18:04:49 -0700 |
| commit | 6b19180ca62a81cf60434bc4e976630c91365aea (patch) | |
| tree | d4b09966fe060161cfa4cc30209183d5d0d99528 /src/jit/optcse.cpp | |
| parent | 400ea0243af9b83d2d506b58effd9cf49176fe23 (diff) | |
| download | coreclr-6b19180ca62a81cf60434bc4e976630c91365aea.tar.gz coreclr-6b19180ca62a81cf60434bc4e976630c91365aea.tar.bz2 coreclr-6b19180ca62a81cf60434bc4e976630c91365aea.zip | |
Followup work from codereview feedback
For PR #6467 - Enable multireg returns on Arm64
Diffstat (limited to 'src/jit/optcse.cpp')
| -rw-r--r-- | src/jit/optcse.cpp | 10 |
1 files changed, 6 insertions, 4 deletions
diff --git a/src/jit/optcse.cpp b/src/jit/optcse.cpp index b93930b8ae..424939d9a2 100644 --- a/src/jit/optcse.cpp +++ b/src/jit/optcse.cpp @@ -381,7 +381,8 @@ bool Compiler::optCSE_canSwap(GenTreePtr tree) /***************************************************************************** * - * Compare function passed to qsort() by optLexicalOptimizeCSEs(). + * Compare function passed to qsort() by CSE_Heuristic::SortCandidates + * when (CodeOptKind() != Compiler::SMALL_CODE) */ /* static */ @@ -412,13 +413,14 @@ int __cdecl Compiler::optCSEcostCmpEx(const void *op1, const void *op2) if (diff != 0) return diff; - // In order to ensure that we have a stable sort the lower csdIndex towards to the top + // In order to ensure that we have a stable sort, we break ties using the csdIndex return (int) (dsc1->csdIndex - dsc2->csdIndex); } /***************************************************************************** * - * Compare function passed to qsort() by optLexicalOptimizeCSEs(). + * Compare function passed to qsort() by CSE_Heuristic::SortCandidates + * when (CodeOptKind() == Compiler::SMALL_CODE) */ /* static */ @@ -449,7 +451,7 @@ int __cdecl Compiler::optCSEcostCmpSz(const void *op1, const void *op2) if (diff != 0) return diff; - // In order to ensure that we have a stable sort the lower csdIndex towards to the top + // In order to ensure that we have a stable sort, we break ties using the csdIndex return (int)(dsc1->csdIndex - dsc2->csdIndex); } |