| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 236 Node.Distance = INF; in findAugmentingPath() 244 Nodes[Source].Distance = 0; in findAugmentingPath() 266 if (Nodes[Src].Distance > Nodes[Target].Distance) in findAugmentingPath() 508 if (Nodes[Src].Distance > Nodes[Target].Distance) in identifyShortestEdges() 515 Nodes[Dst].Distance <= Nodes[Target].Distance && in identifyShortestEdges() 516 Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost && in identifyShortestEdges() 529 int64_t Distance; member 693 Distance[Source] = 0; in findShortestPath() 709 if (Distance[Dst] > Distance[Src] + JumpDist) { in findShortestPath() 712 Distance[Dst] = Distance[Src] + JumpDist; in findShortestPath() [all …]
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/ASTMatchers/Dynamic/ |
| H A D | Marshallers.cpp | 29 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 D | VariantValue.cpp | 49 unsigned Distance; in isConvertibleTo() local 50 if (!NodeKind.isBaseOf(To.NodeKind, &Distance)) in isConvertibleTo() 54 *Specificity = 100 - Distance; in isConvertibleTo()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonBranchRelaxation.cpp | 155 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()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Support/ |
| H A D | UnicodeNameToCodepoint.cpp | 428 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() argument 447 if (Distance == a.Distance) in nearestMatchesForCodepointName() 449 return a.Distance < Distance; in nearestMatchesForCodepointName() 454 MatchForCodepointName M{GetName(), Distance, Value}; in nearestMatchesForCodepointName()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/AST/ |
| H A D | ASTTypeTraits.cpp | 65 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-14.2/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_stacktrace.cpp | 159 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-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 322 DV[Level - 1].Distance = in normalize() 343 return DV[Level - 1].Distance; in getDistance() 459 Kind = Distance; in setDistance() 679 if (Distance) in dump() 680 OS << *Distance; in dump() 1282 Result.DV[Level].Distance = SE->getConstant(Distance); in strongSIVtest() 1284 if (Distance.sgt(0)) in strongSIVtest() 1286 else if (Distance.slt(0)) in strongSIVtest() 1472 Remainder = Distance.srem(Two); in weakCrossingSIVtest() 3318 Level.Distance = nullptr; in updateDirection() [all …]
|
| H A D | LoopAccessAnalysis.cpp | 1782 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward() 1790 dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward() 1883 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent() 1886 if (Distance % TypeByteSize) in areStridedAccessesIndependent() 1889 uint64_t ScaledDist = Distance / TypeByteSize; in areStridedAccessesIndependent() 2033 int64_t Distance = Val.getSExtValue(); in isDependent() local 2036 if (std::abs(Distance) > 0 && Stride > 1 && HasSameSize && in isDependent() 2112 if (MinDistanceNeeded > static_cast<uint64_t>(Distance)) { in isDependent() 2114 << Distance << '\n'); in isDependent() 2143 std::min(static_cast<uint64_t>(Distance), MinDepDistBytes); in isDependent() [all …]
|
| H A D | LoopCacheAnalysis.cpp | 245 const SCEV *Distance = D->getDistance(Level); in hasTemporalReuse() local 246 const SCEVConstant *SCEVConst = dyn_cast_or_null<SCEVConstant>(Distance); in hasTemporalReuse()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/ |
| H A D | iterator | 172 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); 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); 541 template <class T, class charT, class traits, class Distance> 542 bool operator!=(const istream_iterator<T,charT,traits,Distance>& x, [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 100 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()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MIRCanonicalizerPass.cpp | 206 unsigned Distance = ~0U; in rescheduleCanonically() local 221 if (Delta < Distance) { in rescheduleCanonically() 222 Distance = Delta; in rescheduleCanonically()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/Basic/ |
| H A D | DiagnosticIDs.cpp | 714 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); in getNearestOption() local 715 if (Distance > BestDistance) in getNearestOption() 723 if (Distance == BestDistance) { in getNearestOption() 726 } else if (Distance < BestDistance) { in getNearestOption() 729 BestDistance = Distance; in getNearestOption()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | Unicode.h | 81 uint32_t Distance = 0; member
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/Lex/ |
| H A D | LiteralSupport.cpp | 564 unsigned Distance = 0; in DiagnoseInvalidUnicodeCharacterName() local 570 if (Distance == 0) in DiagnoseInvalidUnicodeCharacterName() 571 Distance = Match.Distance; in DiagnoseInvalidUnicodeCharacterName() 572 if (std::max(Distance, Match.Distance) - in DiagnoseInvalidUnicodeCharacterName() 573 std::min(Distance, Match.Distance) > in DiagnoseInvalidUnicodeCharacterName() 576 Distance = Match.Distance; in DiagnoseInvalidUnicodeCharacterName()
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/ |
| H A D | property-units.txt | 22 Distance
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Option/ |
| H A D | OptTable.cpp | 320 unsigned Distance = StringRef(Candidate).edit_distance( in internalFindNearest() local 330 ++Distance; in internalFindNearest() 332 if (Distance < BestDistance) { in internalFindNearest() 333 BestDistance = Distance; in internalFindNearest()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | Iterator.cpp | 224 OverloadedOperatorKind Op, SVal Distance) { in advancePosition() argument 237 const auto IntDistOp = Distance.getAs<nonloc::ConcreteInt>(); in advancePosition()
|
| H A D | Iterator.h | 172 OverloadedOperatorKind Op, SVal Distance);
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/iio/light/ |
| H A D | cm3605.txt | 2 Ambient Light and Short Distance Proximity Sensor
|
| H A D | capella,cm3605.yaml | 8 Capella Microsystems CM3605 Ambient Light and Short Distance Proximity Sensor
|
| /freebsd-14.2/contrib/googletest/docs/reference/ |
| H A D | actions.md | 58 double Distance(Unused, double x, double y) { return sqrt(x*x + y*y); } 60 EXPECT_CALL(mock, Foo("Hi", _, _)).WillOnce(Invoke(Distance));
|
| /freebsd-14.2/contrib/llvm-project/clang/include/clang/AST/ |
| H A D | ASTTypeTraits.h | 86 bool isBaseOf(ASTNodeKind Other, unsigned *Distance) const; 181 static bool isBaseOf(NodeKindId Base, NodeKindId Derived, unsigned *Distance);
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUIGroupLP.cpp | 1053 unsigned Distance = 1; member in __anon114cba190111::MFMASmallGemmSingleWaveOpt::SharesPredWithPrevNthGroup 1065 if ((unsigned)PipeSG.getSGID() == SGID - Distance) { in apply() 1095 SharesPredWithPrevNthGroup(unsigned Distance, const SIInstrInfo *TII, in SharesPredWithPrevNthGroup() argument 1097 : InstructionRule(TII, SGID, NeedsCache), Distance(Distance) {} in SharesPredWithPrevNthGroup()
|