6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-14 11:32:34 +00:00
Code Issues Projects Releases Wiki Activity

Use the target-specified iteration count to opt out of any further refinement of an estimate. NFC.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@218700 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Sanjay Patel 2014-09-30 20:44:23 +00:00
parent cafc85bf1e
commit 73a335f7f6
1 changed files with 60 additions and 58 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

118
lib/CodeGen/SelectionDAG/DAGCombiner.cpp
View File

@ -11778,35 +11778,36 @@ SDValue DAGCombiner::BuildReciprocalEstimate(SDValue Op) {
// Expose the DAG combiner to the target combiner implementations. // Expose the DAG combiner to the target combiner implementations.
TargetLowering::DAGCombinerInfo DCI(DAG, Level, false, this); TargetLowering::DAGCombinerInfo DCI(DAG, Level, false, this);
unsigned Iterations; unsigned Iterations = 0;
if (SDValue Est = TLI.getRecipEstimate(Op, DCI, Iterations)) { if (SDValue Est = TLI.getRecipEstimate(Op, DCI, Iterations)) {
// Newton iteration for a function: F(X) is X_{i+1} = X_i - F(X_i)/F'(X_i) if (Iterations) {
// For the reciprocal, we need to find the zero of the function: // Newton iteration for a function: F(X) is X_{i+1} = X_i - F(X_i)/F'(X_i)
// F(X) = A X - 1 [which has a zero at X = 1/A] // For the reciprocal, we need to find the zero of the function:
// => // F(X) = A X - 1 [which has a zero at X = 1/A]
// X_{i+1} = X_i (2 - A X_i) = X_i + X_i (1 - A X_i) [this second form // =>
// does not require additional intermediate precision] // X_{i+1} = X_i (2 - A X_i) = X_i + X_i (1 - A X_i) [this second form
EVT VT = Op.getValueType(); // does not require additional intermediate precision]
SDLoc DL(Op); EVT VT = Op.getValueType();
SDValue FPOne = DAG.getConstantFP(1.0, VT); SDLoc DL(Op);
SDValue FPOne = DAG.getConstantFP(1.0, VT);
AddToWorklist(Est.getNode());
// Newton iterations: Est = Est + Est (1 - Arg * Est)
for (unsigned i = 0; i < Iterations; ++i) {
SDValue NewEst = DAG.getNode(ISD::FMUL, DL, VT, Op, Est);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FSUB, DL, VT, FPOne, NewEst);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FMUL, DL, VT, Est, NewEst);
AddToWorklist(NewEst.getNode());
Est = DAG.getNode(ISD::FADD, DL, VT, Est, NewEst);
AddToWorklist(Est.getNode()); AddToWorklist(Est.getNode());
}
// Newton iterations: Est = Est + Est (1 - Arg * Est)
for (unsigned i = 0; i < Iterations; ++i) {
SDValue NewEst = DAG.getNode(ISD::FMUL, DL, VT, Op, Est);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FSUB, DL, VT, FPOne, NewEst);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FMUL, DL, VT, Est, NewEst);
AddToWorklist(NewEst.getNode());
Est = DAG.getNode(ISD::FADD, DL, VT, Est, NewEst);
AddToWorklist(Est.getNode());
}
}
return Est; return Est;
} }
@ -11819,43 +11820,44 @@ SDValue DAGCombiner::BuildRsqrtEstimate(SDValue Op) {
// Expose the DAG combiner to the target combiner implementations. // Expose the DAG combiner to the target combiner implementations.
TargetLowering::DAGCombinerInfo DCI(DAG, Level, false, this); TargetLowering::DAGCombinerInfo DCI(DAG, Level, false, this);
unsigned Iterations; unsigned Iterations = 0;
if (SDValue Est = TLI.getRsqrtEstimate(Op, DCI, Iterations)) { if (SDValue Est = TLI.getRsqrtEstimate(Op, DCI, Iterations)) {
// Newton iteration for a function: F(X) is X_{i+1} = X_i - F(X_i)/F'(X_i) if (Iterations) {
// For the reciprocal sqrt, we need to find the zero of the function: // Newton iteration for a function: F(X) is X_{i+1} = X_i - F(X_i)/F'(X_i)
// F(X) = 1/X^2 - A [which has a zero at X = 1/sqrt(A)] // For the reciprocal sqrt, we need to find the zero of the function:
// => // F(X) = 1/X^2 - A [which has a zero at X = 1/sqrt(A)]
// X_{i+1} = X_i (1.5 - A X_i^2 / 2) // =>
// As a result, we precompute A/2 prior to the iteration loop. // X_{i+1} = X_i (1.5 - A X_i^2 / 2)
EVT VT = Op.getValueType(); // As a result, we precompute A/2 prior to the iteration loop.
SDLoc DL(Op); EVT VT = Op.getValueType();
SDValue FPThreeHalves = DAG.getConstantFP(1.5, VT); SDLoc DL(Op);
SDValue FPThreeHalves = DAG.getConstantFP(1.5, VT);
AddToWorklist(Est.getNode());
// We now need 0.5 * Arg which we can write as (1.5 * Arg - Arg) so that
// this entire sequence requires only one FP constant.
SDValue HalfArg = DAG.getNode(ISD::FMUL, DL, VT, FPThreeHalves, Op);
AddToWorklist(HalfArg.getNode());
HalfArg = DAG.getNode(ISD::FSUB, DL, VT, HalfArg, Op);
AddToWorklist(HalfArg.getNode());
// Newton iterations: Est = Est * (1.5 - HalfArg * Est * Est)
for (unsigned i = 0; i < Iterations; ++i) {
SDValue NewEst = DAG.getNode(ISD::FMUL, DL, VT, Est, Est);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FMUL, DL, VT, HalfArg, NewEst);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FSUB, DL, VT, FPThreeHalves, NewEst);
AddToWorklist(NewEst.getNode());
Est = DAG.getNode(ISD::FMUL, DL, VT, Est, NewEst);
AddToWorklist(Est.getNode()); AddToWorklist(Est.getNode());
}
// We now need 0.5 * Arg which we can write as (1.5 * Arg - Arg) so that
// this entire sequence requires only one FP constant.
SDValue HalfArg = DAG.getNode(ISD::FMUL, DL, VT, FPThreeHalves, Op);
AddToWorklist(HalfArg.getNode());
HalfArg = DAG.getNode(ISD::FSUB, DL, VT, HalfArg, Op);
AddToWorklist(HalfArg.getNode());
// Newton iterations: Est = Est * (1.5 - HalfArg * Est * Est)
for (unsigned i = 0; i < Iterations; ++i) {
SDValue NewEst = DAG.getNode(ISD::FMUL, DL, VT, Est, Est);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FMUL, DL, VT, HalfArg, NewEst);
AddToWorklist(NewEst.getNode());
NewEst = DAG.getNode(ISD::FSUB, DL, VT, FPThreeHalves, NewEst);
AddToWorklist(NewEst.getNode());
Est = DAG.getNode(ISD::FMUL, DL, VT, Est, NewEst);
AddToWorklist(Est.getNode());
}
}
return Est; return Est;
} }