mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 11:13:28 +01:00
Test commit. Comment changes. NFC.
llvm-svn: 288100
This commit is contained in:
parent
73ec8f79de
commit
61eb446384
@ -2376,8 +2376,8 @@ SDValue DAGCombiner::visitSDIV(SDNode *N) {
|
||||
return Op;
|
||||
|
||||
// sdiv, srem -> sdivrem
|
||||
// If the divisor is constant, then return DIVREM only if isIntDivCheap() is true.
|
||||
// Otherwise, we break the simplification logic in visitREM().
|
||||
// If the divisor is constant, then return DIVREM only if isIntDivCheap() is
|
||||
// true. Otherwise, we break the simplification logic in visitREM().
|
||||
if (!N1C || TLI.isIntDivCheap(N->getValueType(0), Attr))
|
||||
if (SDValue DivRem = useDivRem(N))
|
||||
return DivRem;
|
||||
@ -2441,8 +2441,8 @@ SDValue DAGCombiner::visitUDIV(SDNode *N) {
|
||||
return Op;
|
||||
|
||||
// sdiv, srem -> sdivrem
|
||||
// If the divisor is constant, then return DIVREM only if isIntDivCheap() is true.
|
||||
// Otherwise, we break the simplification logic in visitREM().
|
||||
// If the divisor is constant, then return DIVREM only if isIntDivCheap() is
|
||||
// true. Otherwise, we break the simplification logic in visitREM().
|
||||
if (!N1C || TLI.isIntDivCheap(N->getValueType(0), Attr))
|
||||
if (SDValue DivRem = useDivRem(N))
|
||||
return DivRem;
|
||||
@ -8885,7 +8885,7 @@ SDValue DAGCombiner::visitFMA(SDNode *N) {
|
||||
// Combine multiple FDIVs with the same divisor into multiple FMULs by the
|
||||
// reciprocal.
|
||||
// E.g., (a / D; b / D;) -> (recip = 1.0 / D; a * recip; b * recip)
|
||||
// Notice that this is not always beneficial. One reason is different target
|
||||
// Notice that this is not always beneficial. One reason is different targets
|
||||
// may have different costs for FDIV and FMUL, so sometimes the cost of two
|
||||
// FDIVs may be lower than the cost of one FDIV and two FMULs. Another reason
|
||||
// is the critical path is increased from "one FDIV" to "one FDIV + one FMUL".
|
||||
|
Loading…
Reference in New Issue
Block a user