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

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
ScalarEvolutionDivision.h 28 // Computes the Quotient and Remainder of the division of Numerator by
30 static void divide(ScalarEvolution &SE, const SCEV *Numerator,
36 void visitPtrToIntExpr(const SCEVPtrToIntExpr *Numerator) {}
37 void visitTruncateExpr(const SCEVTruncateExpr *Numerator) {}
38 void visitZeroExtendExpr(const SCEVZeroExtendExpr *Numerator) {}
39 void visitSignExtendExpr(const SCEVSignExtendExpr *Numerator) {}
40 void visitUDivExpr(const SCEVUDivExpr *Numerator) {}
41 void visitSMaxExpr(const SCEVSMaxExpr *Numerator) {}
42 void visitUMaxExpr(const SCEVUMaxExpr *Numerator) {}
43 void visitSMinExpr(const SCEVSMinExpr *Numerator) {}
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolutionDivision.cpp 55 // Computes the Quotient and Remainder of the division of Numerator by
57 void SCEVDivision::divide(ScalarEvolution &SE, const SCEV *Numerator,
60 assert(Numerator && Denominator && "Uninitialized SCEV");
62 SCEVDivision D(SE, Numerator, Denominator);
66 if (Numerator == Denominator) {
72 if (Numerator->isZero()) {
80 *Quotient = Numerator;
88 *Quotient = Numerator;
93 // Bail out when the Numerator is not divisible by one of the terms of
97 *Remainder = Numerator;
    [all...]
LoopCacheAnalysis.cpp 301 const SCEV *Numerator = SE.getMulExpr(Stride, TripCount);
302 RefCost = SE.getUDivExpr(Numerator, CacheLineSize);
ValueTracking.cpp 2905 // Calculate the incoming numerator bits.
2908 // Add floor(log(C)) bits to the numerator bits.
2929 // 1. The numerator is positive. The result range is [0,C) and
2932 // 2. The numerator is negative. Then the result range is (-C,0] and
4568 const APInt *Numerator, *Denominator;
4578 // long we know that the numerator is not INT_MIN.
4579 if (match(Inst->getOperand(0), m_APInt(Numerator)))
4580 return !Numerator->isMinSignedValue();
4581 // The numerator *might* be MinSignedValue.
ScalarEvolution.cpp 11009 // then a SCEV for the numerator already exists and matches with FoundLHS.
11010 auto *Numerator = getExistingSCEV(LL);
11011 if (!Numerator || Numerator->getType() != FoundLHS->getType())
11014 // Make sure that the numerator matches with FoundLHS and the denominator
11016 if (!HasSameValue(Numerator, FoundLHS) || !isKnownPositive(Denominator))
  /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) {}
60 return (Denominator == 1) ? Numerator : (double)Numerator / Denominator;
63 unsigned getNumerator() const { return Numerator; }
67 // the final value here, we keep track of the numerator and denominator
  /src/external/apache2/llvm/dist/llvm/lib/Support/
BranchProbability.cpp 39 BranchProbability::BranchProbability(uint32_t Numerator, uint32_t Denominator) {
41 assert(Numerator <= Denominator && "Probability cannot be bigger than 1!");
43 N = Numerator;
46 (Numerator * static_cast<uint64_t>(D) + Denominator / 2) / Denominator;
52 BranchProbability::getBranchProbability(uint64_t Numerator,
54 assert(Numerator <= Denominator && "Probability cannot be bigger than 1!");
61 return BranchProbability(Numerator >> Scale, Denominator);
  /src/external/apache2/llvm/dist/llvm/lib/MCA/
Support.cpp 25 Numerator += RHS.Numerator;
31 unsigned LHSNumerator = Numerator * (LCM / Denominator);
32 unsigned RHSNumerator = RHS.Numerator * (LCM / RHS.Denominator);
33 Numerator = LHSNumerator + RHSNumerator;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
BranchProbability.h 31 // Numerator
38 // Construct a BranchProbability with only numerator assuming the denominator
44 BranchProbability(uint32_t Numerator, uint32_t Denominator);
52 // Create a BranchProbability object with the given numerator and 1<<31
56 static BranchProbability getBranchProbability(uint64_t Numerator,
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/llvm/lib/ProfileData/
GCOV.cpp 519 static uint32_t branchDiv(uint64_t Numerator, uint64_t Divisor) {
520 if (!Numerator)
522 if (Numerator == Divisor)
525 uint8_t Res = (Numerator * 100 + Divisor / 2) / Divisor;
  /src/external/apache2/llvm/dist/llvm/tools/llvm-profdata/
llvm-profdata.cpp 444 uint64_t Numerator = HotInstrThreshold * MultiplyFactor;
446 ProfRecord->scale(Numerator, Denominator, [&](instrprof_error E) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp 10870 uint32_t Numerator = CaseProb.getNumerator();
10872 return BranchProbability(Numerator, std::max(Numerator, Denominator));
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIISelLowering.cpp 6599 SDValue Numerator = Op.getOperand(1);
6603 // which is s0.f = Quotient, s1.f = Denominator, s2.f = Numerator. The
6604 // intrinsic has the numerator as the first operand to match a normal
6607 SDValue Src0 = Param->isAllOnesValue() ? Numerator : Denominator;
6610 Denominator, Numerator);

Completed in 90 milliseconds