Home
last modified time | relevance | path

Searched refs:Relation (Results 1 – 25 of 44) sorted by relevance

12

/llvm-project-15.0.7/clang-tools-extra/clangd/index/
H A DRelation.h32 struct Relation { struct
37 bool operator==(const Relation &Other) const { argument
42 bool operator<(const Relation &Other) const {
48 llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, const Relation &R);
52 using value_type = Relation;
78 void insert(const Relation &R) { Relations.push_back(R); } in insert()
84 std::vector<Relation> Relations;
88 RelationSlab(std::vector<Relation> Relations) in RelationSlab()
91 std::vector<Relation> Relations;
H A DYAMLSerialization.cpp41 llvm::Optional<clang::clangd::Relation> Relation; member
64 using clang::clangd::Relation;
292 template <> struct MappingTraits<Relation> {
293 static void mapping(IO &IO, Relation &Relation) { in mapping()
295 IO, Relation.Predicate); in mapping()
367 Variant.Relation.emplace(); in mapping()
368 MappingTraits<Relation>::mapping(IO, *Variant.Relation); in mapping()
404 Entry.Relation = R; in writeYAML()
446 if (Variant.Relation) in readYAML()
447 Relations.insert(*Variant.Relation); in readYAML()
[all …]
H A DRelation.cpp26 llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, const Relation &R) { in operator <<()
33 Relation{Subject, Predicate, SymbolID{}}, in lookup()
34 [](const Relation &A, const Relation &B) { in lookup()
H A DSerialization.cpp408 void writeRelation(const Relation &R, llvm::raw_ostream &OS) { in writeRelation()
414 Relation readRelation(Reader &Data) { in readRelation()
597 std::vector<Relation> Relations; in writeRIFF()
599 for (const auto &Relation : *Data.Relations) { in writeRIFF()
600 Relations.emplace_back(Relation); in writeRIFF()
645 for (const auto &Relation : Relations) in writeRIFF() local
646 writeRelation(Relation, RelationOS); in writeRIFF()
H A DSerialization.h79 std::string toYAML(const Relation &);
H A DFileIndex.h191 llvm::DenseSet<const Relation *> Relations;
H A DMemIndex.h30 for (const Relation &R : Relations) in MemIndex()
/llvm-project-15.0.7/flang/include/flang/Evaluate/
H A Dcommon.h82 return Relation::Less; in RelationFromOrdering()
84 return Relation::Greater; in RelationFromOrdering()
86 return Relation::Equal; in RelationFromOrdering()
90 static constexpr Relation Reverse(Relation relation) { in Reverse()
91 if (relation == Relation::Less) { in Reverse()
92 return Relation::Greater; in Reverse()
94 return Relation::Less; in Reverse()
117 case Relation::Less: in Satisfies()
119 case Relation::Equal: in Satisfies()
121 case Relation::Greater: in Satisfies()
[all …]
H A Dcomplex.h44 return re_.Compare(that.re_) == Relation::Equal && in Equals()
45 im_.Compare(that.im_) == Relation::Equal; in Equals()
/llvm-project-15.0.7/flang/unittests/Evaluate/
H A Dreal.cpp64 TEST(zero.Compare(zero) == Relation::Equal)(desc); in basicTests()
76 TEST(zero.Compare(minusZero) == Relation::Equal)(desc); in basicTests()
89 TEST(zero.Compare(nan) == Relation::Unordered)(desc); in basicTests()
91 TEST(nan.Compare(zero) == Relation::Unordered)(desc); in basicTests()
93 TEST(nan.Compare(nan) == Relation::Unordered)(desc); in basicTests()
105 TEST(zero.Compare(inf) == Relation::Less)(desc); in basicTests()
106 TEST(minusZero.Compare(inf) == Relation::Less)(desc); in basicTests()
107 TEST(nan.Compare(inf) == Relation::Unordered)(desc); in basicTests()
108 TEST(inf.Compare(inf) == Relation::Equal)(desc); in basicTests()
122 TEST(zero.Compare(negInf) == Relation::Greater)(desc); in basicTests()
[all …]
/llvm-project-15.0.7/flang/lib/Evaluate/
H A Dreal.cpp19 template <typename W, int P> Relation Real<W, P>::Compare(const Real &y) const { in Compare()
21 return Relation::Unordered; in Compare()
25 return y.IsNegative() ? Relation::Equal : Relation::Less; in Compare()
27 return y.IsNegative() ? Relation::Greater : Relation::Equal; in Compare()
30 return IsNegative() ? Relation::Less : Relation::Greater; in Compare()
33 return y.IsNegative() ? Relation::Greater : Relation::Less; in Compare()
38 return Relation::Equal; // +/-0.0 == -/+0.0 in Compare()
40 return isNegative ? Relation::Less : Relation::Greater; in Compare()
381 } else if (ABS().Compare(y.ABS()) == Relation::Less) { in HYPOT()
457 } else if (Compare(y) == Relation::Greater) { in DIM()
H A Dfold-real.cpp288 case Relation::Unordered: in FoldIntrinsicFunction()
292 case Relation::Equal: in FoldIntrinsicFunction()
294 case Relation::Less: in FoldIntrinsicFunction()
297 case Relation::Greater: in FoldIntrinsicFunction()
H A Dcomplex.cpp55 bool cGEd{that.re_.ABS().Compare(that.im_.ABS()) != Relation::Less}; in Divide()
/llvm-project-15.0.7/clang-tools-extra/clangd/unittests/
H A DIndexTests.cpp87 Builder.insert(Relation{A, RelationKind::BaseOf, B}); in TEST()
88 Builder.insert(Relation{A, RelationKind::BaseOf, C}); in TEST()
89 Builder.insert(Relation{B, RelationKind::BaseOf, D}); in TEST()
90 Builder.insert(Relation{C, RelationKind::BaseOf, D}); in TEST()
94 UnorderedElementsAre(Relation{A, RelationKind::BaseOf, B}, in TEST()
95 Relation{A, RelationKind::BaseOf, C})); in TEST()
104 Builder.insert(Relation{A, RelationKind::BaseOf, B}); in TEST()
105 Builder.insert(Relation{A, RelationKind::BaseOf, C}); in TEST()
106 Builder.insert(Relation{A, RelationKind::BaseOf, B}); in TEST()
109 EXPECT_THAT(Slab, UnorderedElementsAre(Relation{A, RelationKind::BaseOf, B}, in TEST()
[all …]
H A DFileIndexTests.cpp94 std::unique_ptr<RelationSlab> relSlab(llvm::ArrayRef<const Relation> Rels) { in relSlab()
605 B.insert(Relation{Sym1.ID, RelationKind::BaseOf, Sym2.ID}); in TEST()
607 B.insert(Relation{Sym2.ID, RelationKind::BaseOf, Sym1.ID}); in TEST()
610 B.insert(Relation{Sym3.ID, RelationKind::BaseOf, Sym1.ID}); in TEST()
648 UnorderedElementsAre(Relation{Sym1.ID, RelationKind::BaseOf, Sym2.ID}, in TEST()
649 Relation{Sym2.ID, RelationKind::BaseOf, Sym1.ID}, in TEST()
650 Relation{Sym3.ID, RelationKind::BaseOf, Sym1.ID})); in TEST()
662 UnorderedElementsAre(Relation{Sym1.ID, RelationKind::BaseOf, Sym2.ID}, in TEST()
663 Relation{Sym2.ID, RelationKind::BaseOf, Sym1.ID})); in TEST()
H A DSymbolCollectorTests.cpp103 return arg == Relation{Subject.ID, RelationKind::OverriddenBy, Object.ID};
1173 Contains(Relation{Base.ID, RelationKind::BaseOf, Derived.ID})); in TEST_F()
1202 std::vector<Relation> Result; in TEST_F()
1203 for (const Relation &R : Relations) in TEST_F()
1238 std::vector<Relation> Result; in TEST_F()
1239 for (const Relation &R : Relations) in TEST_F()
/llvm-project-15.0.7/libcxx/benchmarks/
H A Dstring.bench.cpp395 enum class Relation { Eq, Less, Compare }; enum
396 struct AllRelations : EnumValuesAsTuple<AllRelations, Relation, 3> {
409 case Relation::Eq: in run()
412 case Relation::Less: in run()
415 case Relation::Compare: in run()
424 if (Rel() == Relation::Eq && LHLength() > RHLength()) in skip()
453 case Relation::Eq: in run()
456 case Relation::Less: in run()
459 case Relation::Compare: in run()
/llvm-project-15.0.7/polly/lib/Analysis/
H A DDependenceInfo.cpp87 static __isl_give isl_map *tag(__isl_take isl_map *Relation, in tag() argument
89 isl_space *Space = isl_map_get_space(Relation); in tag()
91 isl_map_dim(Relation, isl_dim_out)); in tag()
94 Relation = isl_map_preimage_domain_multi_aff(Relation, Tag); in tag()
95 return Relation; in tag()
100 static __isl_give isl_map *tag(__isl_take isl_map *Relation, MemoryAccess *MA, in tag() argument
103 return tag(Relation, MA->getArrayId().release()); in tag()
106 return tag(Relation, MA->getId().release()); in tag()
109 return Relation; in tag()
/llvm-project-15.0.7/clang-tools-extra/clangd/index/remote/
H A DIndex.proto122 Relation stream_result = 1;
127 // This struct does not mirror clangd::Relation but rather the arguments of
129 message Relation { message
/llvm-project-15.0.7/clang-tools-extra/clangd/index/remote/marshalling/
H A DMarshalling.h44 fromProtobuf(const Relation &Message);
65 llvm::Expected<Relation> toProtobuf(const clangd::SymbolID &Subject,
H A DMarshalling.cpp196 Marshaller::fromProtobuf(const Relation &Message) { in fromProtobuf()
302 llvm::Expected<Relation> Marshaller::toProtobuf(const clangd::SymbolID &Subject, in toProtobuf()
304 Relation Result; in toProtobuf()
/llvm-project-15.0.7/clang-tools-extra/clangd/index/dex/dexp/
H A DDexp.cpp277 llvm::cl::opt<RelationKind> Relation{ member in clang::clangd::__anona16f5ff30111::Relations
287 if (ID.getNumOccurrences() == 0 || Relation.getNumOccurrences() == 0) { in run()
301 Req.Predicate = Relation.getValue(); in run()
/llvm-project-15.0.7/polly/lib/Support/
H A DISLTools.cpp309 isl::map Relation; in computeReachingWrite() local
311 Relation = InclPrevDef ? isl::map::lex_lt(ScatterSpace) in computeReachingWrite()
314 Relation = InclNextDef ? isl::map::lex_gt(ScatterSpace) in computeReachingWrite()
318 isl::map RelationMap = Relation.range_map().reverse(); in computeReachingWrite()
/llvm-project-15.0.7/llvm/utils/gn/secondary/clang-tools-extra/clangd/
H A DBUILD.gn137 "index/Relation.cpp",
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCFLGraph.h404 for (auto &Relation : RetParamRelations) { in tryInterproceduralAnalysis()
405 auto IRelation = instantiateExternalRelation(Relation, Call); in tryInterproceduralAnalysis()

12