Home
last modified time | relevance | path

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

12

/freebsd-12-stable/contrib/llvm-project/clang/lib/ASTMatchers/Dynamic/
DMarshallers.cpp29 unsigned Distance = Item.edit_distance(Search); in getBestGuess() local
30 if (Distance < MaxEditDistance) { in getBestGuess()
31 MaxEditDistance = Distance; in getBestGuess()
50 unsigned Distance = NoPrefix.edit_distance(Search); in getBestGuess() local
51 if (Distance < MaxEditDistance) { in getBestGuess()
52 MaxEditDistance = Distance; in getBestGuess()
DVariantValue.cpp48 unsigned Distance; in isConvertibleTo() local
49 if (!NodeKind.isBaseOf(To.NodeKind, &Distance)) in isConvertibleTo()
53 *Specificity = 100 - Distance; in isConvertibleTo()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
DHexagonBranchRelaxation.cpp154 unsigned Distance = 0; in isJumpOutOfRange() local
173 Distance = std::abs((long long)InstOffset - BlockToInstOffset[TBB]) in isJumpOutOfRange()
175 return !HII->isJumpWithinBranchRange(*FirstTerm, Distance); in isJumpOutOfRange()
186 Distance = std::abs((long long)InstOffset - BlockToInstOffset[FBB]) in isJumpOutOfRange()
188 return !HII->isJumpWithinBranchRange(*SecondTerm, Distance); in isJumpOutOfRange()
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/
DASTTypeTraits.cpp49 bool ASTNodeKind::isBaseOf(ASTNodeKind Other, unsigned *Distance) const { in isBaseOf()
50 return isBaseOf(KindId, Other.KindId, Distance); in isBaseOf()
54 unsigned *Distance) { in isBaseOf() argument
61 if (Distance) in isBaseOf()
62 *Distance = Dist; in isBaseOf()
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
Dsanitizer_stacktrace.cpp157 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; } in Distance() function
162 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i; in LocatePcInTrace()
/freebsd-12-stable/contrib/llvm-project/libcxx/include/
Diterator147 template<class Category, class T, class Distance = ptrdiff_t,
152 typedef Distance difference_type;
165 template <class InputIterator, class Distance> // constexpr in C++17
166 constexpr void advance(InputIterator& i, Distance n);
413 template <class T, class charT = char, class traits = char_traits<charT>, class Distance = ptrdiff_…
415 : public iterator<input_iterator_tag, T, Distance, const T*, const T&> // until C++17
420 typedef Distance difference_type;
439 template <class T, class charT, class traits, class Distance>
440 bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
441 const istream_iterator<T,charT,traits,Distance>& y);
[all …]
Dalgorithm295 class Distance, class UniformRandomBitGenerator>
297 SampleIterator out, Distance n,
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
DLoopAccessAnalysis.cpp1319 bool MemoryDepChecker::couldPreventStoreLoadForward(uint64_t Distance, in couldPreventStoreLoadForward() argument
1343 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward()
1351 dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward()
1440 static bool areStridedAccessesIndependent(uint64_t Distance, uint64_t Stride, in areStridedAccessesIndependent() argument
1444 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent()
1447 if (Distance % TypeByteSize) in areStridedAccessesIndependent()
1450 uint64_t ScaledDist = Distance / TypeByteSize; in areStridedAccessesIndependent()
1542 int64_t Distance = Val.getSExtValue(); in isDependent() local
1545 if (std::abs(Distance) > 0 && Stride > 1 && ATy == BTy && in isDependent()
1546 areStridedAccessesIndependent(std::abs(Distance), Stride, TypeByteSize)) { in isDependent()
[all …]
DDependenceAnalysis.cpp278 return DV[Level - 1].Distance; in getDistance()
336 assert((Kind == Line || Kind == Distance) && in getA()
345 assert((Kind == Line || Kind == Distance) && in getB()
354 assert((Kind == Line || Kind == Distance) && in getC()
363 assert(Kind == Distance && "Kind should be Distance"); in getD()
370 assert((Kind == Distance || Kind == Line || Kind == Point) && in getAssociatedLoop()
394 Kind = Distance; in setDistance()
613 const SCEV *Distance = getDistance(II); in dump() local
614 if (Distance) in dump()
615 OS << *Distance; in dump()
[all …]
DLoopCacheAnalysis.cpp235 const SCEV *Distance = D->getDistance(Level); in hasTemporalReuse() local
236 const SCEVConstant *SCEVConst = dyn_cast_or_null<SCEVConstant>(Distance); in hasTemporalReuse()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
DDependenceAnalysis.h102 const SCEV *Distance; // NULL implies no distance available. member
104 PeelLast(false), Splitable(false), Distance(nullptr) { } in DVEntry()
386 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator
401 bool isDistance() const { return Kind == Distance; } in isDistance()
406 bool isLine() const { return Kind == Line || Kind == Distance; } in isLine()
DLoopAccessAnalysis.h328 bool couldPreventStoreLoadForward(uint64_t Distance, uint64_t TypeByteSize);
/freebsd-12-stable/contrib/llvm-project/clang/lib/Basic/
DDiagnosticIDs.cpp695 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); in getNearestOption() local
696 if (Distance > BestDistance) in getNearestOption()
704 if (Distance == BestDistance) { in getNearestOption()
707 } else if (Distance < BestDistance) { in getNearestOption()
710 BestDistance = Distance; in getNearestOption()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DMIRCanonicalizerPass.cpp216 unsigned Distance = ~0U; in rescheduleCanonically() local
231 if (Delta < Distance) { in rescheduleCanonically()
232 Distance = Delta; in rescheduleCanonically()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Option/
DOptTable.cpp304 unsigned Distance = in findNearest() local
314 ++Distance; in findNearest()
316 if (Distance < BestDistance) { in findNearest()
317 BestDistance = Distance; in findNearest()
/freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
DIterator.cpp226 const SVal &Distance) { in advancePosition() argument
239 const auto IntDistOp = Distance.getAs<nonloc::ConcreteInt>(); in advancePosition()
DIterator.h179 const SVal &Distance);
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/AST/
DASTTypeTraits.h82 bool isBaseOf(ASTNodeKind Other, unsigned *Distance = nullptr) const;
165 static bool isBaseOf(NodeKindId Base, NodeKindId Derived, unsigned *Distance);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Support/
DYAMLParser.cpp390 void skip(uint32_t Distance);
1025 void Scanner::skip(uint32_t Distance) { in skip() argument
1026 Current += Distance; in skip()
1027 Column += Distance; in skip()
DCommandLine.cpp603 unsigned Distance = StringRef(Name).edit_distance( in LookupNearestOption() local
605 if (!Best || Distance < BestDistance) { in LookupNearestOption()
607 BestDistance = Distance; in LookupNearestOption()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Object/
DXCOFFObjectFile.cpp88 uint32_t Distance) { in getAdvancedSymbolEntryAddress() argument
89 return getWithOffset(CurrentAddress, Distance * XCOFF::SymbolTableEntrySize); in getAdvancedSymbolEntryAddress()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Object/
DXCOFFObjectFile.h433 uint32_t Distance);
/freebsd-12-stable/sys/contrib/zlib/doc/
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-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
DLoopInterchange.cpp139 const SCEV *Distance = D->getDistance(II); in populateDependencyMatrix() local
141 dyn_cast_or_null<SCEVConstant>(Distance); in populateDependencyMatrix()
/freebsd-12-stable/contrib/llvm-project/llvm/tools/llvm-objdump/
DObjdumpOpts.td198 HelpText<"Distance to indent the source-level variable display, "

12