Home
last modified time | relevance | path

Searched refs:Distance (Results 1 – 25 of 28) sorted by relevance

12

/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonBranchRelaxation.cpp156 unsigned Distance = 0; in isJumpOutOfRange() local
175 Distance = std::abs((long long)InstOffset - BlockToInstOffset[TBB]) in isJumpOutOfRange()
177 return !HII->isJumpWithinBranchRange(*FirstTerm, Distance); in isJumpOutOfRange()
188 Distance = std::abs((long long)InstOffset - BlockToInstOffset[FBB]) in isJumpOutOfRange()
190 return !HII->isJumpWithinBranchRange(*SecondTerm, Distance); in isJumpOutOfRange()
/freebsd-12.1/contrib/llvm/tools/clang/lib/AST/
H A DASTTypeTraits.cpp43 bool ASTNodeKind::isBaseOf(ASTNodeKind Other, unsigned *Distance) const { in isBaseOf()
44 return isBaseOf(KindId, Other.KindId, Distance); in isBaseOf()
48 unsigned *Distance) { in isBaseOf() argument
55 if (Distance) in isBaseOf()
56 *Distance = Dist; in isBaseOf()
/freebsd-12.1/contrib/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_stacktrace.cc123 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; } in Distance() function
128 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i; in LocatePcInTrace()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h102 const SCEV *Distance; // NULL implies no distance available. member
104 PeelLast(false), Splitable(false), Distance(nullptr) { } in DVEntry()
382 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator
397 bool isDistance() const { return Kind == Distance; } in isDistance()
402 bool isLine() const { return Kind == Line || Kind == Distance; } in isLine()
H A DLoopAccessAnalysis.h325 bool couldPreventStoreLoadForward(uint64_t Distance, uint64_t TypeByteSize);
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp265 return DV[Level - 1].Distance; in getDistance()
381 Kind = Distance; in setDistance()
601 if (Distance) in dump()
602 OS << *Distance; in dump()
1191 Result.DV[Level].Distance = SE->getConstant(Distance); in strongSIVtest()
1193 if (Distance.sgt(0)) in strongSIVtest()
1195 else if (Distance.slt(0)) in strongSIVtest()
1203 Result.DV[Level].Distance = Delta; in strongSIVtest()
1381 Remainder = Distance.srem(Two); in weakCrossingSIVtest()
3225 Level.Distance = nullptr; in updateDirection()
[all …]
H A DLoopAccessAnalysis.cpp1302 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward()
1310 dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward()
1403 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent()
1406 if (Distance % TypeByteSize) in areStridedAccessesIndependent()
1409 uint64_t ScaledDist = Distance / TypeByteSize; in areStridedAccessesIndependent()
1500 int64_t Distance = Val.getSExtValue(); in isDependent() local
1503 if (std::abs(Distance) > 0 && Stride > 1 && ATy == BTy && in isDependent()
1578 if (MinDistanceNeeded > static_cast<uint64_t>(Distance)) { in isDependent()
1580 << Distance << '\n'); in isDependent()
1608 std::min(static_cast<uint64_t>(Distance), MaxSafeDepDistBytes); in isDependent()
[all …]
H A DScalarEvolution.cpp8698 const SCEV *Distance = CountDown ? Start : getNegativeSCEV(Start); in howFarToZero() local
8704 APInt MaxBECount = getUnsignedRangeMax(Distance); in howFarToZero()
8713 const SCEV *Zero = getZero(Distance->getType()); in howFarToZero()
8714 const SCEV *One = getOne(Distance->getType()); in howFarToZero()
8715 const SCEV *DistancePlusOne = getAddExpr(Distance, One); in howFarToZero()
8722 return ExitLimit(Distance, getConstant(MaxBECount), false, Predicates); in howFarToZero()
8733 getUDivExpr(Distance, CountDown ? getNegativeSCEV(Step) : Step); in howFarToZero()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Basic/
H A DDiagnosticIDs.cpp601 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); in getNearestOption() local
602 if (Distance > BestDistance) in getNearestOption()
610 if (Distance == BestDistance) { in getNearestOption()
613 } else if (Distance < BestDistance) { in getNearestOption()
616 BestDistance = Distance; in getNearestOption()
/freebsd-12.1/contrib/llvm/tools/clang/lib/ASTMatchers/Dynamic/
H A DVariantValue.cpp47 unsigned Distance; in isConvertibleTo() local
48 if (!MatcherKind.isBaseOf(To.MatcherKind, &Distance)) in isConvertibleTo()
52 *Specificity = 100 - Distance; in isConvertibleTo()
/freebsd-12.1/contrib/llvm/lib/Option/
H A DOptTable.cpp302 unsigned Distance = in findNearest() local
305 if (Distance < BestDistance) { in findNearest()
306 BestDistance = Distance; in findNearest()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMIRCanonicalizerPass.cpp239 unsigned Distance = ~0U; in rescheduleCanonically() local
254 if (Delta < Distance) { in rescheduleCanonically()
255 Distance = Delta; in rescheduleCanonically()
H A DMachinePipeliner.cpp882 unsigned Distance = 1; in calculateRecMII() local
885 unsigned CurMII = (Delay + Distance - 1) / Distance; in calculateRecMII()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/
H A DASTTypeTraits.h75 bool isBaseOf(ASTNodeKind Other, unsigned *Distance = nullptr) const;
150 static bool isBaseOf(NodeKindId Base, NodeKindId Derived, unsigned *Distance);
/freebsd-12.1/contrib/llvm/tools/lld/ELF/Arch/
H A DARM.cpp375 uint64_t Distance = (Src > Dst) ? Src - Dst : Dst - Src; in inBranchRange() local
376 return Distance <= Range; in inBranchRange()
/freebsd-12.1/contrib/libc++/include/
H A Diterator40 template<class Category, class T, class Distance = ptrdiff_t,
45 typedef Distance difference_type;
281 template <class T, class charT = char, class traits = char_traits<charT>, class Distance = ptrdiff_…
283 : public iterator<input_iterator_tag, T, Distance, const T*, const T&>
301 template <class T, class charT, class traits, class Distance>
302 bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
303 const istream_iterator<T,charT,traits,Distance>& y);
304 template <class T, class charT, class traits, class Distance>
305 bool operator!=(const istream_iterator<T,charT,traits,Distance>& x,
306 const istream_iterator<T,charT,traits,Distance>& y);
/freebsd-12.1/contrib/llvm/lib/Support/
H A DYAMLParser.cpp398 void skip(uint32_t Distance);
950 void Scanner::skip(uint32_t Distance) { in skip() argument
951 Current += Distance; in skip()
952 Column += Distance; in skip()
H A DCommandLine.cpp491 unsigned Distance = StringRef(Name).edit_distance( in LookupNearestOption() local
493 if (!Best || Distance < BestDistance) { in LookupNearestOption()
495 BestDistance = Distance; in LookupNearestOption()
H A DFileCheck.cpp457 unsigned Distance = ComputeMatchDistance(Buffer.substr(i), VariableTable); in PrintFuzzyMatch() local
458 double Quality = Distance + (NumLinesForward / 100.); in PrintFuzzyMatch()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp136 const SCEV *Distance = D->getDistance(II); in populateDependencyMatrix() local
138 dyn_cast_or_null<SCEVConstant>(Distance); in populateDependencyMatrix()
/freebsd-12.1/sys/contrib/zlib/doc/
H A Drfc1951.txt642 Code Bits Dist Code Bits Dist Code Bits Distance
685 Distance codes 0-31 are represented by (fixed-length) 5-bit
725 5 Bits: HDIST, # of Distance codes - 1 (1 - 32)
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DIteratorChecker.cpp251 const SVal &Distance) const;
1558 const SVal &Distance) const { in advancePosition()
1567 if (const auto IntDist = Distance.getAs<nonloc::ConcreteInt>()) { in advancePosition()
/freebsd-12.1/contrib/libxo/doc/
H A Dfield-roles.rst241 xo_emit("{Lwc:Distance}{:distance/%u}{Uw:miles}\n", miles);
/freebsd-12.1/contrib/googletest/googlemock/docs/
H A DCheatSheet.md400 double Distance(Unused, double x, double y) { return sqrt(x*x + y*y); }
402 EXPECT_CALL(mock, Foo("Hi", _, _)).WillOnce(Invoke(Distance));
/freebsd-12.1/contrib/gcc/
H A Dc.opt737 -ftabstop=<number> Distance between tab stops for column reporting

12