Home
last modified time | relevance | path

Searched refs:set2 (Results 1 – 25 of 32) sorted by relevance

12

/llvm-project/polly/lib/External/isl/
H A Disl_test_list_templ.c22 SET *set, *set2; in FN() local
28 set2 = FN(SET,empty)(FN(SET,get_space)(set)); in FN()
34 set2 = FN(SET,union)(set2, FN(FN(SET,from),EL_BASE)(el)); in FN()
37 equal = FN(SET,is_equal)(set, set2); in FN()
40 FN(SET,free)(set2); in FN()
H A Disl_test_cpp-checked-conversion.cc68 isl::set set2; in check_conversion_equal() local
72 set2 = isl::uncheck(checked_set); in check_conversion_equal()
74 if (!set.is_equal(set2)) in check_conversion_equal()
H A Disl_test.c1698 isl_set *set1, *set2; in test_convex_hull_algo() local
1702 set2 = isl_set_read_from_str(ctx, convex_hull_tests[i].hull); in test_convex_hull_algo()
1704 equal = isl_set_is_equal(set1, set2); in test_convex_hull_algo()
1706 isl_set_free(set2); in test_convex_hull_algo()
1971 isl_set *set1, *set2, *copy, *context; in test_gist() local
1977 set2 = isl_set_read_from_str(ctx, gist_tests[i].gist); in test_gist()
1978 equal = isl_set_is_equal(set1, set2); in test_gist()
1984 set2 = isl_set_intersect(set2, context); in test_gist()
1985 equal_intersection = isl_set_is_equal(set1, set2); in test_gist()
1986 isl_set_free(set2); in test_gist()
[all …]
H A Disl_map_subtract.c589 __isl_take isl_set *set2) in isl_set_subtract() argument
592 set_to_map(set2))); in isl_set_subtract()
883 isl_bool isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2) in isl_set_is_subset() argument
885 return isl_map_is_subset(set_to_map(set1), set_to_map(set2)); in isl_set_is_subset()
H A Disl_map.c3966 __isl_take isl_set *set2) in isl_set_intersect() argument
3969 set_to_map(set2))); in isl_set_intersect()
4936 __isl_take isl_set *set2) in isl_set_sum() argument
4938 return set_from_map(isl_map_sum(set_to_map(set1), set_to_map(set2))); in isl_set_sum()
5424 __isl_take isl_set *set2) in isl_set_lex_le_set() argument
5429 map = isl_map_intersect_range(map, set2); in isl_set_lex_le_set()
5434 __isl_take isl_set *set2) in isl_set_lex_lt_set() argument
5439 map = isl_map_intersect_range(map, set2); in isl_set_lex_lt_set()
5444 __isl_take isl_set *set2) in isl_set_lex_ge_set() argument
5449 map = isl_map_intersect_range(map, set2); in isl_set_lex_ge_set()
[all …]
H A Disl_union_map.c1345 __isl_take isl_map *set2) in lex_le_set() argument
1347 return isl_set_lex_le_set(set_from_map(set1), set_from_map(set2)); in lex_le_set()
1351 __isl_take isl_map *set2) in lex_lt_set() argument
1353 return isl_set_lex_lt_set(set_from_map(set1), set_from_map(set2)); in lex_lt_set()
1782 isl_set *set2 = *entry; in set_product_entry() local
1784 set2 = isl_set_product(isl_set_copy(data->map), isl_set_copy(set2)); in set_product_entry()
1786 data->res = isl_union_set_add_set(data->res, set2); in set_product_entry()
H A Disl_map_simplify.c4078 __isl_keep isl_set *set2) in isl_set_plain_is_disjoint() argument
4080 return isl_map_plain_is_disjoint(set_to_map(set1), set_to_map(set2)); in isl_set_plain_is_disjoint()
4085 isl_bool isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2) in isl_set_is_disjoint() argument
4087 return isl_map_is_disjoint(set1, set2); in isl_set_is_disjoint()
/llvm-project/polly/lib/External/isl/include/isl/
H A Dset.h241 __isl_keep isl_set *set2, int pos);
313 __isl_take isl_set *set1, __isl_take isl_set *set2);
317 __isl_take isl_set *set2);
320 __isl_take isl_set *set2);
324 __isl_take isl_set *set2);
328 __isl_take isl_set *set2);
339 __isl_take isl_set *set2);
441 isl_bool isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
444 __isl_keep isl_set *set2);
446 isl_bool isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2);
[all …]
H A Disl-noexceptions.h1737 inline boolean has_equal_space(const isl::set &set2) const;
1744 inline isl::set intersect(const isl::set &set2) const;
1753 inline boolean is_disjoint(const isl::set &set2) const;
1757 inline boolean is_equal(const isl::set &set2) const;
1762 inline boolean is_strict_subset(const isl::set &set2) const;
1765 inline boolean is_subset(const isl::set &set2) const;
1792 inline isl::set product(const isl::set &set2) const;
1815 inline isl::set subtract(const isl::set &set2) const;
1827 inline isl::set unite(const isl::set &set2) const;
2910 inline boolean has_equal_space(const isl::set &set2) const;
[all …]
/llvm-project/clang-tools-extra/test/clang-tidy/checkers/modernize/
H A Duse-transparent-functors.cpp60 class set2 {}; class
104 std::set2<int> control; in main()
107 struct ImplicitTypeLoc : std::set2<std::less<int>> {
/llvm-project/mlir/test/python/ir/
H A Dinteger_set.py46 set2 = set0.get_replaced([d0, AffineSymbolExpr.get(1)], [s0], 1, 2)
47 print(set2)
/llvm-project/llvm/test/Transforms/GlobalOpt/
H A Dinteger-bool-dwarf.ll19 define void @set2() #0 !dbg !16 {
54 !16 = distinct !DISubprogram(name: "set2", scope: !3, file: !3, line: 8, type: !12, isLocal: false,…
H A Dinteger-bool.ll15 define void @set2() {
/llvm-project/llvm/unittests/ADT/
H A DDenseSetTest.cpp144 TypeParam set2({4, 3, 2, 1}); in TYPED_TEST() local
147 EXPECT_EQ(set1, set2); in TYPED_TEST()
/llvm-project/llvm/test/CodeGen/SystemZ/
H A Dalias-01.ll19 !2 = !{ !"set2", !0 }
H A Dmemcpy-02.ll392 !4 = !{ !"set2", !0 }
H A Dand-08.ll391 !2 = !{ !"set2", !0 }
/llvm-project/mlir/test/IR/
H A Daffine-set.mlir10 #set2 = affine_set<(i) : (i >= 0)>
68 "testset2"() {set = #set2} : () -> ()
H A Dparser.mlir43 #set2 = affine_set<(d0) : (d0 - 1 == 0)>
400 // CHECK: "foo"() {set2 = #set{{[0-9]*}}}
401 "foo"() {set2 = affine_set<(d0, d1, d2) : (d0 >= 0, d1 >= 0, d2 - d1 == 0)>} : () -> ()
404 "foo"() {set12 = [#set1, #set2]} : () -> ()
/llvm-project/llvm/test/CodeGen/PowerPC/
H A Daa-tbaa.ll40 !2 = !{ !"set2", !0 }
/llvm-project/mlir/unittests/Analysis/Presburger/
H A DPresburgerSetTest.cpp862 PresburgerSet set2 = parsePresburgerSet({"(i) : (i - 5 >= 0)"}); in TEST() local
866 PresburgerSet result = set1.subtract(set2); in TEST()
/llvm-project/clang/test/Misc/
H A Ddiag-template-diffing-cxx11.cpp71 void set2(I2<int, int>) {}; in set2() function
73 set2(I2<double, int, int>()); in test2()
75 // CHECK-ELIDE-NOTREE: no matching function for call to 'set2'
77 // CHECK-NOELIDE-NOTREE: no matching function for call to 'set2'
79 // CHECK-ELIDE-TREE: no matching function for call to 'set2'
85 // CHECK-NOELIDE-TREE: no matching function for call to 'set2'
/llvm-project/mlir/test/Conversion/AffineToStandard/
H A Dlower-affine.mlir153 #set2 = affine_set<(d0) : (d0 - 10 >= 0)>
231 affine.if #set2(%i) {
235 affine.if #set2(%i) {
261 %1 = affine.if #set2(%i) -> (i64) {
336 affine.if #set2(%j) {
355 affine.if #set2(%k) {
/llvm-project/mlir/test/Dialect/Affine/
H A Dmemref-dependence-check.mlir969 #set2 = affine_set<(d0): (- d0 + 75 >= 0)>
984 affine.if #set2(%i0) {
1000 #set2 = affine_set<(d0, d1): (d0 - 75 >= 0, d1 - 50 >= 0)>
1018 affine.if #set2(%i0, %i1) {
1038 #set2 = affine_set<(d0): (- d0 + 51 >= 0)>
1056 affine.if #set2(%i0) {
/llvm-project/clang-tools-extra/docs/clang-tidy/checks/readability/
H A Dsuspicious-call-argument.rst134 `#(set1) + #(set2)`, where `#()` is the cardinality function of sets.

12