Home
last modified time | relevance | path

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

123

/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp235 Node.Distance = INF; in findAugmentingPath()
243 Nodes[Source].Distance = 0; in findAugmentingPath()
263 if (!Params.EvenFlowDistribution && Nodes[Target].Distance == 0) in findAugmentingPath()
265 if (Nodes[Src].Distance > Nodes[Target].Distance) in findAugmentingPath()
273 int64_t NewDistance = Nodes[Src].Distance + Edge.Cost; in findAugmentingPath()
274 if (Nodes[Dst].Distance > NewDistance) { in findAugmentingPath()
276 Nodes[Dst].Distance = NewDistance; in findAugmentingPath()
289 return Nodes[Target].Distance != INF; in findAugmentingPath()
507 if (Nodes[Src].Distance > Nodes[Target].Distance) in identifyShortestEdges()
514 Nodes[Dst].Distance <= Nodes[Target].Distance && in identifyShortestEdges()
[all …]
/openbsd-src/gnu/llvm/clang/lib/ASTMatchers/Dynamic/
H A 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()
H A DVariantValue.cpp49 unsigned Distance; in isConvertibleTo() local
50 if (!NodeKind.isBaseOf(To.NodeKind, &Distance)) in isConvertibleTo()
54 *Specificity = 100 - Distance; in isConvertibleTo()
/openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonBranchRelaxation.cpp155 unsigned Distance = 0; in isJumpOutOfRange() local
174 Distance = std::abs((long long)InstOffset - BlockToInstOffset[TBB]) in isJumpOutOfRange()
176 return !HII->isJumpWithinBranchRange(*FirstTerm, Distance); in isJumpOutOfRange()
187 Distance = std::abs((long long)InstOffset - BlockToInstOffset[FBB]) in isJumpOutOfRange()
189 return !HII->isJumpWithinBranchRange(*SecondTerm, Distance); in isJumpOutOfRange()
/openbsd-src/gnu/llvm/llvm/lib/Support/
H A DUnicodeNameToCodepoint.cpp431 auto Insert = [&](const Node &Node, uint32_t Distance, in nearestMatchesForCodepointName()
433 if (Distance > LargestEditDistance) { in nearestMatchesForCodepointName()
436 LargestEditDistance = Distance; in nearestMatchesForCodepointName()
448 Matches, Distance, in nearestMatchesForCodepointName()
449 [&](const MatchForCodepointName &a, std::size_t Distance) { in nearestMatchesForCodepointName() argument
450 if (Distance == a.Distance) in nearestMatchesForCodepointName()
452 return a.Distance < Distance; in nearestMatchesForCodepointName()
457 MatchForCodepointName M{GetName(), Distance, Value}; in nearestMatchesForCodepointName()
H A DYAMLParser.cpp389 void skip(uint32_t Distance);
1039 void Scanner::skip(uint32_t Distance) { in skip() argument
1040 Current += Distance; in skip()
1041 Column += Distance; in skip()
/openbsd-src/gnu/llvm/clang/lib/AST/
H A DASTTypeTraits.cpp59 bool ASTNodeKind::isBaseOf(ASTNodeKind Other, unsigned *Distance) const { in isBaseOf()
60 return isBaseOf(KindId, Other.KindId, Distance); in isBaseOf()
64 unsigned *Distance) { in isBaseOf() argument
71 if (Distance) in isBaseOf()
72 *Distance = Dist; in isBaseOf()
/openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_stacktrace.cpp159 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; } in Distance() function
164 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i; in LocatePcInTrace()
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp321 if (DV[Level - 1].Distance != nullptr) in normalize()
322 DV[Level - 1].Distance = in normalize()
323 SE->getNegativeSCEV(DV[Level - 1].Distance); in normalize()
343 return DV[Level - 1].Distance; in getDistance()
401 assert((Kind == Line || Kind == Distance) && in getA()
410 assert((Kind == Line || Kind == Distance) && in getB()
419 assert((Kind == Line || Kind == Distance) && in getC()
428 assert(Kind == Distance && "Kind should be Distance"); in getD()
435 assert((Kind == Distance || Kind == Line || Kind == Point) && in getAssociatedLoop()
459 Kind = Distance; in setDistance()
[all …]
H A DLoopAccessAnalysis.cpp1678 bool MemoryDepChecker::couldPreventStoreLoadForward(uint64_t Distance, in couldPreventStoreLoadForward() argument
1702 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward()
1710 dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward()
1799 static bool areStridedAccessesIndependent(uint64_t Distance, uint64_t Stride, in areStridedAccessesIndependent() argument
1803 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent()
1806 if (Distance % TypeByteSize) in areStridedAccessesIndependent()
1809 uint64_t ScaledDist = Distance / TypeByteSize; in areStridedAccessesIndependent()
1904 int64_t Distance = Val.getSExtValue(); in isDependent() local
1907 if (std::abs(Distance) > 0 && Stride > 1 && HasSameSize && in isDependent()
1908 areStridedAccessesIndependent(std::abs(Distance), Stride, TypeByteSize)) { in isDependent()
[all …]
H A DLoopCacheAnalysis.cpp245 const SCEV *Distance = D->getDistance(Level); in hasTemporalReuse() local
246 const SCEVConstant *SCEVConst = dyn_cast_or_null<SCEVConstant>(Distance); in hasTemporalReuse()
/openbsd-src/gnu/llvm/libcxx/include/
H A Diterator172 template<class Category, class T, class Distance = ptrdiff_t,
177 typedef Distance difference_type;
191 template <class InputIterator, class Distance> // constexpr in C++17
192 constexpr void advance(InputIterator& i, Distance n);
510 template <class T, class charT = char, class traits = char_traits<charT>, class Distance = ptrdiff_…
512 : public iterator<input_iterator_tag, T, Distance, const T*, const T&> // until C++17
517 typedef Distance difference_type;
538 template <class T, class charT, class traits, class Distance>
539 bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
540 const istream_iterator<T,charT,traits,Distance>& y);
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h100 const SCEV *Distance = nullptr; // NULL implies no distance available. member
407 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator
422 bool isDistance() const { return Kind == Distance; } in isDistance()
427 bool isLine() const { return Kind == Line || Kind == Distance; } in isLine()
H A DLoopAccessAnalysis.h326 bool couldPreventStoreLoadForward(uint64_t Distance, uint64_t TypeByteSize);
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DMIRCanonicalizerPass.cpp206 unsigned Distance = ~0U; in rescheduleCanonically() local
221 if (Delta < Distance) { in rescheduleCanonically()
222 Distance = Delta; in rescheduleCanonically()
/openbsd-src/gnu/llvm/clang/lib/Basic/
H A DDiagnosticIDs.cpp729 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); in getNearestOption() local
730 if (Distance > BestDistance) in getNearestOption()
738 if (Distance == BestDistance) { in getNearestOption()
741 } else if (Distance < BestDistance) { in getNearestOption()
744 BestDistance = Distance; in getNearestOption()
/openbsd-src/gnu/llvm/llvm/include/llvm/Support/
H A DUnicode.h81 uint32_t Distance = 0; member
/openbsd-src/gnu/llvm/clang/lib/Lex/
H A DLiteralSupport.cpp502 unsigned Distance = 0; in DiagnoseInvalidUnicodeCharacterName() local
508 if (Distance == 0) in DiagnoseInvalidUnicodeCharacterName()
509 Distance = Match.Distance; in DiagnoseInvalidUnicodeCharacterName()
510 if (std::max(Distance, Match.Distance) - in DiagnoseInvalidUnicodeCharacterName()
511 std::min(Distance, Match.Distance) > in DiagnoseInvalidUnicodeCharacterName()
514 Distance = Match.Distance; in DiagnoseInvalidUnicodeCharacterName()
H A DTokenLexer.cpp1002 auto Distance = Loc.getRawEncoding() - Last.getRawEncoding(); in updateConsecutiveMacroArgTokens() local
1004 return Distance <= MaxDistance; in updateConsecutiveMacroArgTokens()
/openbsd-src/gnu/llvm/llvm/lib/Option/
H A DOptTable.cpp295 unsigned Distance = StringRef(Candidate).edit_distance( in findNearest() local
305 ++Distance; in findNearest()
307 if (Distance < BestDistance) { in findNearest()
308 BestDistance = Distance; in findNearest()
/openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DIterator.cpp226 const SVal &Distance) { in advancePosition() argument
239 const auto IntDistOp = Distance.getAs<nonloc::ConcreteInt>(); in advancePosition()
H A DIterator.h175 const SVal &Distance);
/openbsd-src/gnu/llvm/clang/include/clang/AST/
H A DASTTypeTraits.h83 bool isBaseOf(ASTNodeKind Other, unsigned *Distance = nullptr) const;
173 static bool isBaseOf(NodeKindId Base, NodeKindId Derived, unsigned *Distance);
/openbsd-src/gnu/llvm/llvm/lib/MC/
H A DMCWin64EH.cpp312 uint32_t Distance = (uint32_t)*MaybeDistance; in checkARM64Instructions() local
329 if (Distance != InstructionBytes) { in checkARM64Instructions()
332 Twine(Distance) + in checkARM64Instructions()
1559 uint32_t Distance = (uint32_t)*MaybeDistance; in checkARMInstructions() local
1564 if (Distance != InstructionBytes) { in checkARMInstructions()
1567 Twine(Distance) + in checkARMInstructions()
/openbsd-src/share/misc/
H A Dusb_hid_usages1432 0x101 Minimum Tracking Distance
1433 0x102 Optimum Tracking Distance
1434 0x103 Maximum Tracking Distance
1604 0x87 Orientation: Distance 1D
1605 0x88 Orientation: Distance 2D
1606 0x89 Orientation: Distance 3D
1610 0x8D Orientation: Distance
1766 0x479 Data Field: Distance
1767 0x47A Data Field: Distance X Axis
1768 0x47B Data Field: Distance Y Axis
[all …]

123