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

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 106 DitheringDistributer(Distribution &Dist, const BlockMass &Mass);
113 DitheringDistributer::DitheringDistributer(Distribution &Dist,
115 Dist.normalize();
116 RemWeight = Dist.Total;
298 bool BlockFrequencyInfoImplBase::addToDist(Distribution &Dist,
327 Dist.addBackedge(Resolved, Weight);
333 Dist.addExit(Resolved, Weight);
356 Dist.addLocal(Resolved, Weight);
361 const LoopData *OuterLoop, LoopData &Loop, Distribution &Dist) {
362 // Copy the exit map into Dist
    [all...]
LoopAccessAnalysis.cpp 1179 int Dist = Val / Size;
1183 if (!StrictCheck || Dist * Size == Val)
1184 return Dist;
1349 /// Given a non-constant (unknown) dependence-distance \p Dist between two
1363 const SCEV &Dist, uint64_t Stride,
1367 // (**) |Dist| > BackedgeTakenCount * Step
1372 // We basically want to check if the absolute distance (|Dist/Step|)
1387 const SCEV *CastedDist = &Dist;
1389 uint64_t DistTypeSize = DL.getTypeAllocSize(Dist.getType());
1392 // The dependence distance can be positive/negative, so we sign extend Dist;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
TwoAddressInstructionPass.cpp 123 bool noUseAfterLastDef(Register Reg, unsigned Dist, unsigned &LastDef);
126 MachineInstr *MI, unsigned Dist);
129 unsigned RegBIdx, unsigned RegCIdx, unsigned Dist);
135 Register RegB, unsigned Dist);
137 bool isDefTooClose(Register Reg, unsigned Dist, MachineInstr *MI);
147 unsigned Dist, bool shouldOnlyCommute);
153 unsigned Dist);
162 void processTiedPairs(MachineInstr *MI, TiedPairList&, unsigned &Dist);
244 bool TwoAddressInstructionPass::noUseAfterLastDef(Register Reg, unsigned Dist,
247 unsigned LastUse = Dist;
    [all...]
LiveVariables.cpp 200 unsigned Dist = DistanceMap[Def];
201 if (Dist > LastDefDist) {
204 LastDefDist = Dist;
294 unsigned Dist = DistanceMap[Def];
295 if (Dist > LastPartDefDist)
296 LastPartDefDist = Dist;
298 unsigned Dist = DistanceMap[Use];
299 if (Dist > LastRefOrPartRefDist) {
300 LastRefOrPartRefDist = Dist;
343 unsigned Dist = DistanceMap[Def]
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/
ASTTypeTraits.cpp 56 unsigned Dist = 0;
59 ++Dist;
62 *Distance = Dist;
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
BitTracker.h 75 UseQueueType() : Uses(Dist) {}
95 Dist.clear();
99 Cmp(DenseMap<const MachineInstr*,unsigned> &Map) : Dist(Map) {}
101 DenseMap<const MachineInstr*,unsigned> &Dist;
105 DenseMap<const MachineInstr*,unsigned> Dist;
HexagonHardwareLoops.cpp 782 int64_t Dist = EndV - StartV;
783 if (Dist == 0)
786 bool Exact = (Dist % IVBump) == 0;
791 if ((Dist < 0) ^ (IVBump < 0))
798 Dist = Dist > 0 ? Dist+1 : Dist-1;
800 // For the loop to iterate, CmpLess should imply Dist > 0. Similarly,
801 // CmpGreater should imply Dist < 0. These conditions could actuall
    [all...]
BitTracker.cpp 782 auto F = Dist.find(MI);
783 if (F != Dist.end())
788 Dist.insert(std::make_pair(MI, D));
HexagonLoopIdiomRecognition.cpp 2227 Value *Dist = Builder.CreateSub(LowA, HighA);
2228 Value *CmpD = Builder.CreateICmpSLE(NumBytes, Dist);
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86OptimizeLEAs.cpp 269 /// \p AddrDispShift and \p Dist.
272 int64_t &AddrDispShift, int &Dist);
343 MachineInstr *&BestLEA, int64_t &AddrDispShift, int &Dist) {
385 Dist = DistTemp;
531 int Dist;
532 if (!chooseBestLEA(Insns->second, MI, DefMI, AddrDispShift, Dist))
541 if (Dist < 0) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 435 /// Adds all edges from LocalLoopHead to Dist. Calls addToDist() to add each
440 Distribution &Dist);
444 /// Adds an edge to Succ to Dist. If \c LoopHead.isValid(), then whether the
449 bool addToDist(Distribution &Dist, const LoopData *OuterLoop,
479 /// Distributes the mass in Source according to Dist. If LoopHead.isValid(),
484 Distribution &Dist);
499 void distributeIrrLoopHeaderMass(Distribution &Dist);
1220 Distribution Dist;
1244 Dist.addLocal(HeaderNode, HeaderWeightValue);
1263 Dist.addLocal(HeaderNode, MinWeight)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopLoadElimination.cpp 125 auto *Dist = cast<SCEVConstant>(
127 const APInt &Val = Dist->getAPInt();
  /src/external/apache2/llvm/dist/llvm/tools/verify-uselistorder/
verify-uselistorder.cpp 406 std::uniform_int_distribution<short> Dist(10, 99);
412 auto I = Dist(Gen);
  /src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/
Cuda.cpp 172 Distro Dist(FS, llvm::Triple(llvm::sys::getProcessTriple()));
173 if (Dist.IsDebian() || Dist.IsUbuntu())
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SILoadStoreOptimizer.cpp 1926 int64_t Dist = MAddr.Offset - MAddrNext.Offset;
1929 AM.BaseOffs = Dist;
1931 (uint32_t)std::abs(Dist) > MaxDist) {
1932 MaxDist = std::abs(Dist);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoadStoreVectorizer.cpp 377 const SCEV *Dist = SE.getMinusSCEV(PtrSCEVB, PtrSCEVA);
378 if (C == Dist)
SLPVectorizer.cpp 986 Optional<int> Dist =
989 return (Dist && *Dist == 1) ? VLOperands::ScoreConsecutiveLoads
3245 Optional<int> Dist = getPointersDiff(Ptr0, PtrN, *DL, *SE);
3247 if (static_cast<unsigned>(*Dist) == VL.size() - 1) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMBaseInstrInfo.cpp 4099 unsigned &DefIdx, unsigned &Dist) {
4100 Dist = 0;
4112 ++Dist;
4122 unsigned &UseIdx, unsigned &Dist) {
4123 Dist = 0;
4136 ++Dist;
4141 Dist = 0;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 5628 APInt Dist = Val - PrevVal;
5630 DistToPrev = Dist;
5631 } else if (Dist != DistToPrev) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
SelectionDAG.h 1869 /// 'Bytes' bytes from a location that is 'Dist' units away from the
1872 unsigned Bytes, int Dist) const;
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CFG.cpp 1740 int Dist = B.distance(P);
1741 if (Dist <= 0)
1775 int dist = B.distance(P); local
1776 if (dist <= 0)
1782 DeclsTrivial.reserve(dist);
1783 DeclsNonTrivial.reserve(dist);
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCISelLowering.cpp 12732 unsigned Bytes, int Dist,
12747 return MFI.getObjectOffset(FI) == (MFI.getObjectOffset(BFI) + Dist*Bytes);
12754 if (Base1 == Base2 && Offset1 == (Offset2 + Dist * Bytes))
12765 return Offset1 == (Offset2 + Dist*Bytes);
12772 unsigned Bytes, int Dist,
12777 return isConsecutiveLSLoc(Loc, VT, Base, Bytes, Dist, DAG);
12805 return isConsecutiveLSLoc(N->getOperand(2), VT, Base, Bytes, Dist, DAG);
12837 return isConsecutiveLSLoc(N->getOperand(3), VT, Base, Bytes, Dist, DAG);
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaOpenMP.cpp 5258 Expr *Dist;
5284 Dist = AssertSuccess(Actions.ActOnConditionalOp(
5321 Dist = AssertSuccess(
5326 Dist = AssertSuccess(
5327 Actions.ActOnConditionalOp({}, {}, HasAnyIteration, Dist, Zero));
5332 Actions.getCurScope(), {}, BO_Assign, DistRef, Dist));
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAG.cpp 10039 int Dist) const {
10058 return (Dist * Bytes == Offset);

Completed in 94 milliseconds