| /llvm-project-15.0.7/libcxx/test/std/localization/locales/locale/locale.operators/ |
| H A D | eq.pass.cpp | 34 assert(cloc != n2); in main()
42 assert(copy != n2); in main()
50 assert(n1 == n2); in main()
55 assert(n2 != cloc); in main()
56 assert(n2 != copy); in main()
57 assert(n2 == n1); in main()
58 assert(n2 == n2); in main()
59 assert(n2 != noname1); in main()
60 assert(n2 != nonamec); in main()
61 assert(n2 != noname2); in main()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/ |
| H A D | partial_sort_copy.pass.cpp | 139 std::size_t n2; in test_partial_sort_copy() local
144 n2 = n1; in test_partial_sort_copy()
146 …test_one_policy<iterator_type>(out.begin(), out.begin() + n2, exp.begin(), exp.begin() + n2), in.b… in test_partial_sort_copy()
147 in.begin() + n1, n1, n2, trash, compare); in test_partial_sort_copy()
150 n2 = n1 / 3; in test_partial_sort_copy()
152 …test_one_policy<iterator_type>(out.begin(), out.begin() + n2, exp.begin(), exp.begin() + n2), in.b… in test_partial_sort_copy()
153 in.begin() + n1, n1, n2, trash, compare); in test_partial_sort_copy()
156 n2 = 2 * n1; in test_partial_sort_copy()
158 …test_one_policy<iterator_type>(out.begin(), out.begin() + n2, exp.begin(), exp.begin() + n2), in.b… in test_partial_sort_copy()
163 n2 = 2 * n1; in test_partial_sort_copy()
[all …]
|
| /llvm-project-15.0.7/llvm/test/Analysis/DependenceAnalysis/ |
| H A D | SymbolicRDIV.ll | 34 %cmp21 = icmp eq i64 %n2, 0
73 ;; A[2*i + 5*n2] = i;
75 ;; *B++ = A[3*j + 2*n2];
107 %mul1 = mul i64 %n2, 5
119 %mul7 = shl i64 %n2, 1
138 ;; A[2*i - n2] = i;
201 ;; A[-i + n2] = i;
324 ;; A[-i + n2] = i;
367 %mul = shl i64 %n2, 1
388 ;; *B++ = A[2*n2];
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | lexicographical_compare.pass.cpp | 54 std::size_t n2; in test() local
75 n2 = n1; in test()
76 …ll_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() + n2, pred); in test()
78 n2 = n1; in test()
82 …ll_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() + n2, pred); in test()
88 …_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.cbegin(), in2.cbegin() + n2, pred); in test()
111 std::size_t n2; in test_string() local
116 n2 = n1; in test_string()
117 …ll_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() + n2, pred); in test_string()
119 n2 = n1; in test_string()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/ |
| H A D | find_first_of.pass.cpp | 66 for (const auto n2 : sub_n) in test() local
68 …_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.data(), in2.data() + n2, pred); in test()
70 in2[n2 / 2] = T(1); in test()
71 …ke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + n1, in2.data(), in2.data() + n2, in test()
74 if (n2 >= 3) in test()
76 in2[2 * n2 / 3] = T(1); in test()
78 in2.begin() + n2, pred); in test()
79 in2[2 * n2 / 3] = T(0); in test()
81 in2[n2 / 2] = T(0); in test()
|
| H A D | search_n.pass.cpp | 63 for (auto n2 : sub_n) in test() local
66 if (n2 == 0) in test()
74 for (; i < n1 && isub < n2; ++i, ++isub) in test()
77 …invoke_on_all_policies(test_one_policy(), in.begin(), in.begin() + n1, n2, value, std::equal_to<T>… in test()
78 …invoke_on_all_policies(test_one_policy(), in.cbegin(), in.cbegin() + n1, n2, value, std::equal_to<… in test()
|
| H A D | find_end.pass.cpp | 79 for (auto n2 : sub_n) in test() local
84 for (; i < n1 && isub < n2; ++i, ++isub) in test()
86 …voke_on_all_policies(test_one_policy(), in.begin(), in.begin() + n1, sub.begin(), sub.begin() + n2, in test()
89 sub.cbegin() + n2, std::equal_to<T>()); in test()
|
| /llvm-project-15.0.7/flang/test/Semantics/ |
| H A D | allocate04.f90 | 30 class(C), allocatable :: n1, n2(:) local
42 allocate(n2(2)%whatever)
58 allocate(C:: n1%whatever, n2(2)%whatever)
65 allocate(n1%whatever, MOLD = n2(1))
72 allocate(n1%whatever, SOURCE = n2(1))
77 allocate(n1, n2(2))
|
| H A D | offsets01.f90 | 45 type :: t2(n1, n2)
47 integer, len :: n2 component
48 real :: b(n1, n2)
|
| H A D | modfile17.f90 | 15 type :: defaulted(n1,n2,n4,n8)
17 integer(kind=2), kind :: n2 = n1 * 2 component
18 integer(kind=4), kind :: n4 = 2 * n2
20 type(capture(n1,n2,n4,n8)) :: cap
73 type(extension(8,n8=1,k5=2,n2=4,n4=8)) :: x84812
|
| H A D | modfile25.f90 | 21 subroutine subr(x,n1,n2) argument
23 integer, intent(in) :: n1(3), n2(:) local
29 a = reshape(x,n2(10:30:9)) ! fails if we can't figure out triplet shape
|
| H A D | resolve103.f90 | 17 real a(n2)
19 double precision n2 local
|
| H A D | resolve49.f90 | 14 type t1(n1,n2)
15 integer,kind :: n1,n2 component
|
| H A D | assign08.f90 | 9 integer :: n2 component
23 integer :: n2 component
|
| /llvm-project-15.0.7/flang/test/Lower/ |
| H A D | alternate-return.f90 | 31 call s(n1, *5, n2, *7)
44 if (n1 < n2) return 1
45 if (n1 > n2) return 2
|
| H A D | entry-statement.f90 | 73 integer n17, n2 local
84 n2 = ny + 20
114 rr = rr + n2
360 if (n2 == 2) return
|
| H A D | select-case-statement.f90 | 40 n2 = 0
55 n2 = 1
113 print*, n1, n2, n3, n4, n5, n6, n7, n8
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| H A D | splice_after_flist.pass.cpp | 35 for (int n2 = 0; n2 < l; ++n2, ++i) in testd() local
36 assert(*i == t2[n2]); in testd()
|
| H A D | splice_after_one.pass.cpp | 35 for (int n2 = f; n2 < f+1; ++n2, ++i) in testd() local
36 assert(*i == t2[n2]); in testd()
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/ |
| H A D | sanitizer_deadlock_detector_test.cpp | 77 uptr n2 = d.newNode(2); in RunBasicTest() local
79 EXPECT_FALSE(d.onLock(&dtls, n2)); in RunBasicTest()
80 d.onUnlock(&dtls, n2); in RunBasicTest()
89 EXPECT_EQ(path[1], n2); in RunBasicTest()
91 EXPECT_EQ(d.getData(n2), 2U); in RunBasicTest()
93 d.onUnlock(&dtls, n2); in RunBasicTest()
101 uptr n2 = d.newNode(2); in RunBasicTest() local
106 d.onUnlock(&dtls, n2); in RunBasicTest()
112 d.onUnlock(&dtls, n2); in RunBasicTest()
119 EXPECT_EQ(path[1], n2); in RunBasicTest()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.set.operations/ |
| H A D | set.pass.cpp | 65 auto n2 = std::distance(first2, last2); in operator ()() local
66 auto n = n1 + n2; in operator ()()
95 auto n2 = std::distance(first2, last2); in operator ()() local
96 auto n = n1 + n2; in operator ()()
125 auto n2 = std::distance(first2, last2); in operator ()() local
126 auto n = n1 + n2; in operator ()()
155 auto n2 = std::distance(first2, last2); in operator ()() local
156 auto n = n1 + n2; in operator ()()
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_fold.c | 671 isl_size n1, n2; in merge_lists() local
706 n2--; in merge_lists()
808 isl_size n1, n2; in isl_qpolynomial_fold_add_on_domain() local
837 if (n2 == 1) { in isl_qpolynomial_fold_add_on_domain()
1292 isl_size n1, n2; in isl_qpolynomial_fold_plain_cmp() local
1303 if (n2 < 0) in isl_qpolynomial_fold_plain_cmp()
1306 if (n1 != n2) in isl_qpolynomial_fold_plain_cmp()
1307 return n1 - n2; in isl_qpolynomial_fold_plain_cmp()
1359 isl_size n1, n2; in isl_qpolynomial_fold_plain_is_equal() local
1369 if (n1 != n2) in isl_qpolynomial_fold_plain_is_equal()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.scoped/ |
| H A D | mutex.fail.cpp | 28 M n0, n1, n2; in main() local
50 test_conversion<LG>({n0, n1, n2}); // expected-error{{no matching function for call}} in main()
|
| /llvm-project-15.0.7/mlir/lib/Transforms/ |
| H A D | ViewOpGraph.cpp | 168 void emitEdgeStmt(Node n1, Node n2, std::string label, StringRef style) { in emitEdgeStmt() argument
174 if (!n1.clusterId && !n2.clusterId) in emitEdgeStmt()
179 if (n2.clusterId) in emitEdgeStmt()
180 attrs["lhead"] = "cluster_" + std::to_string(*n2.clusterId); in emitEdgeStmt()
183 os << llvm::format("v%i -> v%i ", n1.id, n2.id); in emitEdgeStmt()
|
| /llvm-project-15.0.7/polly/test/CodeGen/OpenMP/ |
| H A D | recomputed-srem.ll | 12 define void @dmxpy(i32 %n1, float* %y, i32 %n2, float* %x) #0 {
14 %rem96 = srem i32 %n2, 16
38 %cmp193 = icmp slt i32 %add364, %n2
|