diff options
| author | Sanjay Patel <spatel@rotateright.com> | 2019-08-15 12:43:15 +0000 |
|---|---|---|
| committer | Sanjay Patel <spatel@rotateright.com> | 2019-08-15 12:43:15 +0000 |
| commit | 57d459309dbbf252dfee7d235f9b17936abca3ad (patch) | |
| tree | da0abd02f3011bfd198d6fe0ae4b4157504458d7 /llvm/lib/Analysis/ModuleSummaryAnalysis.cpp | |
| parent | 7aa0dbb664ea05e233c503c009052f8682fc0f62 (diff) | |
| download | llvm-57d459309dbbf252dfee7d235f9b17936abca3ad.zip llvm-57d459309dbbf252dfee7d235f9b17936abca3ad.tar.gz llvm-57d459309dbbf252dfee7d235f9b17936abca3ad.tar.bz2 | |
[SDAG][x86] check for relaxed math when matching an FP reduction
If the last step in an FP add reduction allows reassociation and doesn't care
about -0.0, then we are free to recognize that computation as a reduction
that may reorder the intermediate steps.
This is requested directly by PR42705:
https://bugs.llvm.org/show_bug.cgi?id=42705
and solves PR42947 (if horizontal math instructions are actually faster than
the alternative):
https://bugs.llvm.org/show_bug.cgi?id=42947
Differential Revision: https://reviews.llvm.org/D66236
llvm-svn: 368995
Diffstat (limited to 'llvm/lib/Analysis/ModuleSummaryAnalysis.cpp')
0 files changed, 0 insertions, 0 deletions