Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp236 Node.Distance = INF; in findAugmentingPath()
244 Nodes[Source].Distance = 0; in findAugmentingPath()
264 if (!Params.EvenFlowDistribution && Nodes[Target].Distance == 0) in findAugmentingPath()
266 if (Nodes[Src].Distance > Nodes[Target].Distance) in findAugmentingPath()
274 int64_t NewDistance = Nodes[Src].Distance + Edge.Cost; in findAugmentingPath()
275 if (Nodes[Dst].Distance > NewDistance) { in findAugmentingPath()
277 Nodes[Dst].Distance = NewDistance; in findAugmentingPath()
290 return Nodes[Target].Distance != INF; in findAugmentingPath()
508 if (Nodes[Src].Distance > Nodes[Target].Distance) in identifyShortestEdges()
515 Nodes[Dst].Distance <= Nodes[Target].Distance && in identifyShortestEdges()
[all …]
/freebsd/contrib/llvm-project/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.cpp48 unsigned Distance; in isConvertibleTo() local
49 if (!NodeKind.isBaseOf(To.NodeKind, &Distance)) in isConvertibleTo()
53 *Specificity = 100 - Distance; in isConvertibleTo()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonBranchRelaxation.cpp146 unsigned Distance = 0; in isJumpOutOfRange() local
165 Distance = std::abs((long long)InstOffset - BlockToInstOffset[TBB]) in isJumpOutOfRange()
167 return !HII->isJumpWithinBranchRange(*FirstTerm, Distance); in isJumpOutOfRange()
178 Distance = std::abs((long long)InstOffset - BlockToInstOffset[FBB]) in isJumpOutOfRange()
180 return !HII->isJumpWithinBranchRange(*SecondTerm, Distance); in isJumpOutOfRange()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DUnicodeNameToCodepoint.cpp428 auto Insert = [&](const Node &Node, uint32_t Distance, in nearestMatchesForCodepointName()
430 if (Distance > LargestEditDistance) { in nearestMatchesForCodepointName()
433 LargestEditDistance = Distance; in nearestMatchesForCodepointName()
445 Matches, Distance, in nearestMatchesForCodepointName()
446 [&](const MatchForCodepointName &a, std::size_t Distance) { in nearestMatchesForCodepointName()
447 if (Distance == a.Distance) in nearestMatchesForCodepointName()
449 return a.Distance < Distance; in nearestMatchesForCodepointName() argument
454 MatchForCodepointName M{GetName(), Distance, Valu in nearestMatchesForCodepointName()
432 __anonef2277cc0302(const Node &Node, uint32_t Distance, char32_t Value) nearestMatchesForCodepointName() argument
[all...]
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DASTTypeTraits.cpp65 bool ASTNodeKind::isBaseOf(ASTNodeKind Other, unsigned *Distance) const { in isBaseOf()
66 return isBaseOf(KindId, Other.KindId, Distance); in isBaseOf()
79 unsigned *Distance) { in isBaseOf() argument
86 if (Distance) in isBaseOf()
87 *Distance = Dist; in isBaseOf()
/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp195 const SCEV *Distance = D->getDistance(Level); in dumpExampleDependence() local
196 bool IsDistanceZero = Distance && Distance->isZero(); in dumpExampleDependence()
340 if (DV[Level - 1].Distance != nullptr) in normalize()
341 DV[Level - 1].Distance = in normalize()
342 SE->getNegativeSCEV(DV[Level - 1].Distance); in normalize()
362 return DV[Level - 1].Distance; in getDistance()
420 assert((Kind == Line || Kind == Distance) && in getA()
429 assert((Kind == Line || Kind == Distance) && in getB()
438 assert((Kind == Line || Kind == Distance) && in getC()
447 assert(Kind == Distance && "Kind should be Distance"); in getD()
[all …]
H A DLoopAccessAnalysis.cpp1803 bool MemoryDepChecker::couldPreventStoreLoadForward(uint64_t Distance, in couldPreventStoreLoadForward() argument
1829 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward()
1837 dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward()
1928 static bool areStridedAccessesIndependent(uint64_t Distance, uint64_t Stride, in areStridedAccessesIndependent() argument
1932 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent()
1935 if (Distance % TypeByteSize) in areStridedAccessesIndependent()
1954 return Distance % Stride; in areStridedAccessesIndependent()
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()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
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);
515 template <class T, class charT = char, class traits = char_traits<charT>, class Distance = ptrdiff_…
517 : public iterator<input_iterator_tag, T, Distance, const T*, const T&> // until C++17
522 typedef Distance difference_type;
543 template <class T, class charT, class traits, class Distance>
544 bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
545 const istream_iterator<T,charT,traits,Distance>& y);
[all …]
/freebsd/contrib/llvm-project/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);
515 template <class T, class charT = char, class traits = char_traits<charT>, class Distance = ptrdiff_…
517 : public iterator<input_iterator_tag, T, Distance, const T*, const T&> // until C++17
522 typedef Distance difference_type;
543 template <class T, class charT, class traits, class Distance>
544 bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
545 const istream_iterator<T,charT,traits,Distance>& y);
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h101 const SCEV *Distance = nullptr; // NULL implies no distance available. member
421 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator
436 bool isDistance() const { return Kind == Distance; } in isDistance()
441 bool isLine() const { return Kind == Line || Kind == Distance; } in isLine()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMIRCanonicalizerPass.cpp207 unsigned Distance = ~0U; in rescheduleCanonically() local
222 if (Delta < Distance) { in rescheduleCanonically()
223 Distance = Delta; in rescheduleCanonically()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DUnicode.h83 uint32_t Distance = 0; member
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h122 unsigned Distance = 0; variable
132 : Dst(PredOrSucc), Pred(Dep), Distance(0u), in SwingSchedulerDDGEdge()
143 Distance = 1; in SwingSchedulerDDGEdge()
163 unsigned getDistance() const { return Distance; } in getDistance()
166 void setDistance(unsigned D) { Distance = D; } in setDistance()
/freebsd/contrib/llvm-project/clang/lib/Basic/
H A DDiagnosticIDs.cpp759 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); in getNearestOption() local
760 if (Distance > BestDistance) in getNearestOption()
768 if (Distance == BestDistance) { in getNearestOption()
771 } else if (Distance < BestDistance) { in getNearestOption()
774 BestDistance = Distance; in getNearestOption()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUIGroupLP.cpp1153 unsigned Distance = 1; member in __anon5d856e630111::MFMAExpInterleaveOpt::IsSuccOfPrevNthGroup
1163 if ((unsigned)PipeSG.getSGID() == SGID - Distance) in apply()
1181 IsSuccOfPrevNthGroup(unsigned Distance, const SIInstrInfo *TII, in IsSuccOfPrevNthGroup() argument
1183 : InstructionRule(TII, SGID, NeedsCache), Distance(Distance) {} in IsSuccOfPrevNthGroup()
1190 unsigned Distance = 1; member in __anon5d856e630111::MFMAExpInterleaveOpt::IsReachableFromPrevNthGroup
1200 if ((unsigned)PipeSG.getSGID() == SGID - Distance) in apply()
1217 IsReachableFromPrevNthGroup(unsigned Distance, const SIInstrInfo *TII, in IsReachableFromPrevNthGroup() argument
1219 : InstructionRule(TII, SGID, NeedsCache), Distance(Distance) {} in IsReachableFromPrevNthGroup()
1998 unsigned Distance = 1; member in __anon5d856e630111::MFMASmallGemmSingleWaveOpt::SharesPredWithPrevNthGroup
2010 if ((unsigned)PipeSG.getSGID() == SGID - Distance) { in apply()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Lex/
H A DLiteralSupport.cpp565 unsigned Distance = 0; in DiagnoseInvalidUnicodeCharacterName() local
571 if (Distance == 0) in DiagnoseInvalidUnicodeCharacterName()
572 Distance = Match.Distance; in DiagnoseInvalidUnicodeCharacterName()
573 if (std::max(Distance, Match.Distance) - in DiagnoseInvalidUnicodeCharacterName()
574 std::min(Distance, Match.Distance) > in DiagnoseInvalidUnicodeCharacterName()
577 Distance = Match.Distance; in DiagnoseInvalidUnicodeCharacterName()
/freebsd/sys/contrib/device-tree/Bindings/
H A Dproperty-units.txt22 Distance
/freebsd/contrib/llvm-project/llvm/lib/Option/
H A DOptTable.cpp326 unsigned Distance = StringRef(Candidate).edit_distance( in internalFindNearest() local
336 ++Distance; in internalFindNearest()
338 if (Distance < BestDistance) { in internalFindNearest()
339 BestDistance = Distance; in internalFindNearest()
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DIterator.cpp225 OverloadedOperatorKind Op, SVal Distance) { in advancePosition() argument
238 const auto IntDistOp = Distance.getAs<nonloc::ConcreteInt>(); in advancePosition()
H A DIterator.h173 OverloadedOperatorKind Op, SVal Distance);
/freebsd/sys/contrib/device-tree/Bindings/iio/light/
H A Dcm3605.txt2 Ambient Light and Short Distance Proximity Sensor
/freebsd/contrib/googletest/docs/reference/
H A Dactions.md59 double Distance(Unused, double x, double y) { return sqrt(x*x + y*y); }
61 EXPECT_CALL(mock, Foo("Hi", _, _)).WillOnce(Invoke(Distance));

123