HomeSort by: relevance | last modified time | path
    Searched refs:Denominator (Results 1 - 13 of 13) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/
Support.h 51 unsigned Numerator, Denominator;
54 ResourceCycles() : Numerator(0), Denominator(1) {}
56 : Numerator(Cycles), Denominator(ResourceUnits) {}
59 assert(Denominator && "Invalid denominator (must be non-zero).");
60 return (Denominator == 1) ? Numerator : (double)Numerator / Denominator;
64 unsigned getDenominator() const { return Denominator; }
67 // the final value here, we keep track of the numerator and denominator
  /src/external/apache2/llvm/dist/llvm/lib/MCA/
Support.cpp 24 if (Denominator == RHS.Denominator)
27 // Create a common denominator for LHS and RHS by calculating the least
29 unsigned GCD = GreatestCommonDivisor64(Denominator, RHS.Denominator);
30 unsigned LCM = (Denominator * RHS.Denominator) / GCD;
31 unsigned LHSNumerator = Numerator * (LCM / Denominator);
32 unsigned RHSNumerator = RHS.Numerator * (LCM / RHS.Denominator);
34 Denominator = LCM
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
BranchProbability.cpp 39 BranchProbability::BranchProbability(uint32_t Numerator, uint32_t Denominator) {
40 assert(Denominator > 0 && "Denominator cannot be 0!");
41 assert(Numerator <= Denominator && "Probability cannot be bigger than 1!");
42 if (Denominator == D)
46 (Numerator * static_cast<uint64_t>(D) + Denominator / 2) / Denominator;
53 uint64_t Denominator) {
54 assert(Numerator <= Denominator && "Probability cannot be bigger than 1!");
55 // Scale down Denominator to fit in a 32-bit integer
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolutionDivision.cpp 56 // Denominator.
58 const SCEV *Denominator, const SCEV **Quotient,
60 assert(Numerator && Denominator && "Uninitialized SCEV");
62 SCEVDivision D(SE, Numerator, Denominator);
66 if (Numerator == Denominator) {
79 if (Denominator->isOne()) {
85 // Split the Denominator when it is a product.
86 if (const SCEVMulExpr *T = dyn_cast<SCEVMulExpr>(Denominator)) {
94 // the Denominator.
111 if (const SCEVConstant *D = dyn_cast<SCEVConstant>(Denominator)) {
    [all...]
ValueTracking.cpp 2897 const APInt *Denominator;
2899 if (match(U->getOperand(1), m_APInt(Denominator))) {
2901 // Ignore non-positive denominator.
2902 if (!Denominator->isStrictlyPositive())
2909 return std::min(TyBits, NumBits + Denominator->logBase2());
2917 const APInt *Denominator;
2921 if (match(U->getOperand(1), m_APInt(Denominator))) {
2923 // Ignore non-positive denominator.
2924 if (Denominator->isStrictlyPositive()) {
2926 // denominator. Given that the denominator is positive, there are tw
    [all...]
ScalarEvolution.cpp 2787 // (k-n)th term of the denominator. This division will always produce an
3139 // If the denominator is zero, the result of the udiv is undefined. Don't
10996 // We are going to perform some comparisons with Denominator and its
11002 // So we bail if Denominator is not a constant.
11006 auto *Denominator = cast<SCEVConstant>(getSCEV(LR));
11008 // We want to make sure that LHS = FoundLHS / Denominator. If it is so,
11014 // Make sure that the numerator matches with FoundLHS and the denominator
11016 if (!HasSameValue(Numerator, FoundLHS) || !isKnownPositive(Denominator))
11019 auto *DTy = Denominator->getType();
11029 // FoundLHS > FoundRHS, LHS = FoundLHS / Denominator, Denominator > 0
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
ScalarEvolutionDivision.h 29 // Denominator.
31 const SCEV *Denominator, const SCEV **Quotient,
35 // Expr by Denominator for the following functions with empty implementation.
58 const SCEV *Denominator);
65 const SCEV *Denominator, *Quotient, *Remainder, *Zero, *One;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
BranchProbability.h 28 // denominator is always a constant value (here we use 1<<31 for maximum
34 // Denominator, which is a constant value.
38 // Construct a BranchProbability with only numerator assuming the denominator
44 BranchProbability(uint32_t Numerator, uint32_t Denominator);
53 // as denominator.
57 uint64_t Denominator);
MathExtras.h 741 /// Returns the integer ceil(Numerator / Denominator).
742 inline uint64_t divideCeil(uint64_t Numerator, uint64_t Denominator) {
743 return alignTo(Numerator, Denominator) / Denominator;
746 /// Returns the integer nearest(Numerator / Denominator).
747 inline uint64_t divideNearest(uint64_t Numerator, uint64_t Denominator) {
748 return (Numerator + (Denominator / 2)) / Denominator;
  /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
ASTDiff.cpp 807 double Denominator = T1.getNumberOfDescendants(Id1) - 1 +
810 assert(Denominator >= 0 && "Expected non-negative denominator.");
811 if (Denominator == 0)
813 return CommonDescendants / Denominator;
  /src/external/apache2/llvm/dist/llvm/tools/llvm-profdata/
llvm-profdata.cpp 445 uint64_t Denominator = IFE.MaxCount;
446 ProfRecord->scale(Numerator, Denominator, [&](instrprof_error E) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIISelLowering.cpp 6600 SDValue Denominator = Op.getOperand(2);
6603 // which is s0.f = Quotient, s1.f = Denominator, s2.f = Numerator. The
6607 SDValue Src0 = Param->isAllOnesValue() ? Numerator : Denominator;
6610 Denominator, Numerator);
8435 // Denominator is scaled to not be denormal, so using rcp is ok.
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp 10871 uint32_t Denominator = SwitchProb.scale(CaseProb.getDenominator());
10872 return BranchProbability(Numerator, std::max(Numerator, Denominator));

Completed in 129 milliseconds