Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/libcxx/test/std/iterators/iterator.primitives/iterator.operations/
H A Dadvance.pass.cpp40 template <class Distance, class It>
42 void check_advance(It it, Distance n, It result) in check_advance()
55 typedef std::iterator_traits<const char*>::difference_type Distance; in tests() typedef
56 …check_advance<Distance>(cpp17_input_iterator<const char*>(s), 10, cpp17_input_iterator<const char*… in tests()
57 …check_advance<Distance>(forward_iterator<const char*>(s), 10, forward_iterator<const char*>(s+10)); in tests()
62 check_advance<Distance>(s+5, 5, s+10); in tests()
63 check_advance<Distance>(s+5, -5, s); in tests()
68 typedef int Distance; in tests() typedef
70 …check_advance<Distance>(forward_iterator<const char*>(s), 10, forward_iterator<const char*>(s+10)); in tests()
77 typedef std::size_t Distance; in tests() typedef
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp228 Node.Distance = INF; in findAugmentingPath()
236 Nodes[Source].Distance = 0; in findAugmentingPath()
258 if (Nodes[Src].Distance > Nodes[Target].Distance) in findAugmentingPath()
500 if (Nodes[Src].Distance > Nodes[Target].Distance) in identifyShortestEdges()
507 Nodes[Dst].Distance <= Nodes[Target].Distance && in identifyShortestEdges()
508 Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost && in identifyShortestEdges()
518 int64_t Distance; member
681 Distance[Source] = 0; in findShortestPath()
697 if (Distance[Dst] > Distance[Src] + JumpDist) { in findShortestPath()
700 Distance[Dst] = Distance[Src] + JumpDist; in findShortestPath()
[all …]
/llvm-project-15.0.7/clang/unittests/AST/
H A DASTTypeTraitsTest.cpp55 unsigned Distance = 1; in TEST() local
56 EXPECT_TRUE(DNT<Expr>().isBaseOf(DNT<Expr>(), &Distance)); in TEST()
57 EXPECT_EQ(0u, Distance); in TEST()
59 EXPECT_TRUE(DNT<Stmt>().isBaseOf(DNT<IfStmt>(), &Distance)); in TEST()
60 EXPECT_EQ(1u, Distance); in TEST()
62 Distance = 3; in TEST()
63 EXPECT_TRUE(DNT<DeclaratorDecl>().isBaseOf(DNT<ParmVarDecl>(), &Distance)); in TEST()
64 EXPECT_EQ(2u, Distance); in TEST()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/lib/Support/
H A DUnicodeNameToCodepoint.cpp432 auto Insert = [&](const Node &Node, uint32_t Distance, in nearestMatchesForCodepointName()
434 if (Distance > LargestEditDistance) { in nearestMatchesForCodepointName()
437 LargestEditDistance = Distance; in nearestMatchesForCodepointName()
449 Matches.begin(), Matches.end(), Distance, in nearestMatchesForCodepointName()
450 [&](const MatchForCodepointName &a, std::size_t Distance) { in nearestMatchesForCodepointName() argument
451 if (Distance == a.Distance) in nearestMatchesForCodepointName()
453 return a.Distance < Distance; in nearestMatchesForCodepointName()
458 MatchForCodepointName M{GetName(), Distance, Value}; in nearestMatchesForCodepointName()
/llvm-project-15.0.7/polly/lib/Analysis/
H A DDependenceInfo.cpp713 isl_set *Deltas, *Distance; in isParallel() local
733 Distance = isl_set_universe(isl_set_get_space(Deltas)); in isParallel()
737 Distance = isl_set_fix_si(Distance, isl_dim_set, i, 0); in isParallel()
739 Distance = isl_set_lower_bound_si(Distance, isl_dim_set, Dimension, 1); in isParallel()
740 Distance = isl_set_intersect(Distance, Deltas); in isParallel()
742 IsParallel = isl_set_is_empty(Distance); in isParallel()
744 isl_set_free(Distance); in isParallel()
748 Distance = isl_set_project_out(Distance, isl_dim_set, 0, Dimension); in isParallel()
749 Distance = isl_set_coalesce(Distance); in isParallel()
754 *MinDistancePtr = isl_pw_aff_coalesce(isl_set_dim_min(Distance, 0)); in isParallel()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/clang-tools-extra/clangd/unittests/
H A DHeadersTests.cpp149 MATCHER_P2(Distance, File, D, "") {
169 UnorderedElementsAre(Distance(getID(MainFile, Includes), 0u), in TEST_F()
170 Distance(getID(BarHeader, Includes), 1u))); in TEST_F()
188 UnorderedElementsAre(Distance(getID(MainFile, Includes), 0u), in TEST_F()
189 Distance(getID(BarHeader, Includes), 1u), in TEST_F()
190 Distance(getID(BazHeader, Includes), 2u))); in TEST_F()
193 UnorderedElementsAre(Distance(getID(BarHeader, Includes), 0u), in TEST_F()
194 Distance(getID(BazHeader, Includes), 1u))); in TEST_F()
/llvm-project-15.0.7/clang/test/CodeGen/
H A Dfp-floatcontrol-pragma.cpp170 struct Distance {}; struct
171 Distance operator+(Distance, Distance);
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/bugprone/
H A Dargument-comment.rst153 void foo(double Distance);
163 void foo(double Distance);
167 foo(/*Distance=*/402.0_km);
/llvm-project-15.0.7/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);
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 …]
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/
H A DClangTidyCheck.cpp174 unsigned Distance = in getEnumInt() local
176 if (Distance < EditDistance) { in getEnumInt()
177 EditDistance = Distance; in getEnumInt()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp280 return DV[Level - 1].Distance; in getDistance()
396 Kind = Distance; in setDistance()
616 if (Distance) in dump()
617 OS << *Distance; in dump()
1219 Result.DV[Level].Distance = SE->getConstant(Distance); in strongSIVtest()
1221 if (Distance.sgt(0)) in strongSIVtest()
1223 else if (Distance.slt(0)) in strongSIVtest()
1231 Result.DV[Level].Distance = Delta; in strongSIVtest()
1409 Remainder = Distance.srem(Two); in weakCrossingSIVtest()
3255 Level.Distance = nullptr; in updateDirection()
[all …]
H A DLoopAccessAnalysis.cpp1647 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward()
1655 dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward()
1748 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent()
1751 if (Distance % TypeByteSize) in areStridedAccessesIndependent()
1754 uint64_t ScaledDist = Distance / TypeByteSize; in areStridedAccessesIndependent()
1850 int64_t Distance = Val.getSExtValue(); in isDependent() local
1853 if (std::abs(Distance) > 0 && Stride > 1 && HasSameSize && in isDependent()
1926 if (MinDistanceNeeded > static_cast<uint64_t>(Distance)) { in isDependent()
1928 << Distance << '\n'); in isDependent()
1956 std::min(static_cast<uint64_t>(Distance), MaxSafeDepDistBytes); in isDependent()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h98 const SCEV *Distance = nullptr; // NULL implies no distance available. member
383 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator
398 bool isDistance() const { return Kind == Distance; } in isDistance()
403 bool isLine() const { return Kind == Line || Kind == Distance; } in isLine()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMIRCanonicalizerPass.cpp206 unsigned Distance = ~0U; in rescheduleCanonically() local
221 if (Delta < Distance) { in rescheduleCanonically()
222 Distance = Delta; in rescheduleCanonically()
/llvm-project-15.0.7/llvm/unittests/Support/
H A DUnicodeTest.cpp328 return a.Name == b.Name && a.Distance == b.Distance && a.Value == b.Value; in operator ==()
349 EXPECT_EQ(StringRef(A).edit_distance(B, true), r.Distance); in TEST()
/llvm-project-15.0.7/clang/lib/Basic/
H A DDiagnosticIDs.cpp728 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); in getNearestOption() local
729 if (Distance > BestDistance) in getNearestOption()
737 if (Distance == BestDistance) { in getNearestOption()
740 } else if (Distance < BestDistance) { in getNearestOption()
743 BestDistance = Distance; in getNearestOption()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DUnicode.h81 uint32_t Distance = 0; member
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/clang-tools-extra/clangd/
H A DFileDistance.cpp216 : Distance(createScopeFileDistance(QueryScopes)) {} in ScopeDistance()
219 return Distance.distance(scopeToPath(SymbolScope).first); in distance()
H A DFileDistance.h120 FileDistance Distance;

123