Home
last modified time | relevance | path

Searched refs:ic (Results 1 – 25 of 105) sorted by relevance

12345

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dfind_first_of.pass.cpp26 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local
31 …urn (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(i… in test_constexpr()
32 …&& (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)))… in test_constexpr()
33 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)))… in test_constexpr()
34 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)))… in test_constexpr()
35 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)))… in test_constexpr()
36 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)))… in test_constexpr()
52 int ic[] = {7}; in main() local
55 forward_iterator<const int*>(ic), in main()
60 forward_iterator<const int*>(ic), in main()
[all …]
H A Dfind_first_of_pred.pass.cpp28 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local
33 …n (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
34 … (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), e… in test_constexpr()
35 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)),… in test_constexpr()
36 … (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), e… in test_constexpr()
37 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)),… in test_constexpr()
38 … (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), e… in test_constexpr()
55 int ic[] = {7}; in main() local
58 forward_iterator<const int*>(ic), in main()
64 forward_iterator<const int*>(ic), in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate.pass.cpp54 const int sc = static_cast<int>(sizeof(ic)/sizeof(ic[0])); in test()
55 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test()
57 assert(ic[0] == 0); in test()
60 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test()
65 r = std::rotate(Iter(ic), Iter(ic+2), Iter(ic+sc)); in test()
70 r = std::rotate(Iter(ic), Iter(ic+sc), Iter(ic+sc)); in test()
254 const int sc = static_cast<int>(sizeof(ic)/sizeof(ic[0])); in test1()
257 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test1()
262 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test1()
267 r = std::rotate(Iter(ic), Iter(ic+2), Iter(ic+sc)); in test1()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
H A Dfind_end.pass.cpp26 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local
31 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
32 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == F… in test_constexpr()
33 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr()
34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr()
35 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == R… in test_constexpr()
36 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == R… in test_constexpr()
H A Dfind_end_pred.pass.cpp36 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local
41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
42 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) … in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
44 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) … in test_constexpr()
45 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) … in test_constexpr()
46 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) … in test_constexpr()
/llvm-project-15.0.7/clang/test/CXX/expr/expr.prim/expr.prim.lambda/
H A Dp7.cpp13 void test_capture_constness(int i, const int ic) { in test_capture_constness() argument
14 (void)[i,ic] ()->void { in test_capture_constness()
16 float &fr2 = check_const_int(ic); in test_capture_constness()
21 float &fr2 = check_const_int(ic); in test_capture_constness()
24 (void)[i,ic] () mutable ->void { in test_capture_constness()
26 float &fr = check_const_int(ic); in test_capture_constness()
31 float &fr = check_const_int(ic); in test_capture_constness()
34 (void)[&i,&ic] ()->void { in test_capture_constness()
36 float &fr = check_const_int(ic); in test_capture_constness()
41 float &fr = check_const_int(ic); in test_capture_constness()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/
H A Dmismatch.pass.cpp30 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
34 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic)); in test_constexpr()
35 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr()
38 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)); in test_constexpr()
39 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr()
43 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
46 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); in test_constexpr()
47 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
51 if (p5.first != II(ib+2) || p5.second != II(ic+2)) in test_constexpr()
53 …uto p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))); in test_constexpr()
[all …]
H A Dmismatch_pred.pass.cpp35 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
39 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), eq); in test_constexpr()
40 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr()
43 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq); in test_constexpr()
44 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr()
48 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
51 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); in test_constexpr()
52 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
56 if (p5.first != II(ib+2) || p5.second != II(ic+2)) in test_constexpr()
58 …p6 = std::mismatch(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq); in test_constexpr()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch_n.pass.cpp70 int ic[] = {0, 0, 0}; in test() local
71 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
72 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); in test()
73 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); in test()
74 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); in test()
75 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); in test()
76 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); in test()
79 (void)std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0); in test()
H A Dsearch_n_pred.pass.cpp138 int ic[] = {0, 0, 0}; in test() local
139 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
140 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic)); in test()
143 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic)); in test()
146 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic)); in test()
149 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0, count_equal()) == Iter(ic)); in test()
152 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0, count_equal()) == Iter(ic+sc)); in test()
157 …TEST_IGNORE_NODISCARD std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(4), 0, co… in test()
H A Dsearch.pass.cpp39 int ic[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test_constexpr() local
40 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia)) == ic+3) in test_constexpr()
41 … && (std::search(std::begin(ic), std::end(ic), std::begin(ib), std::end(ib)) == std::end(ic)) in test_constexpr()
42 && (std::search(std::begin(ic), std::end(ic), MySearcherC()) == std::begin(ic)) in test_constexpr()
92 int ic[] = {1}; in test() local
93 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); in test()
H A Dsearch_pred.pass.cpp28 int ic[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test_constexpr() local
29 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia), eq) == ic+3) in test_constexpr()
30 … && (std::search(std::begin(ic), std::end(ic), std::begin(ib), std::end(ib), eq) == std::end(ic)) in test_constexpr()
90 int ic[] = {1}; in test() local
91 …assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1)); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/
H A Dreverse.pass.cpp39 int ic[] = {0, 1, 2}; in test() local
40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
41 std::reverse(Iter(ic), Iter(ic+sc)); in test()
42 assert(ic[0] == 2); in test()
43 assert(ic[1] == 1); in test()
44 assert(ic[2] == 0); in test()
H A Dreverse_copy.pass.cpp55 const int ic[] = {0, 1, 2}; in test() local
56 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
58 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc)); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/
H A Dequal.pass.cpp31 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
35 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic)) in test_constexpr()
36 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)) in test_constexpr()
37 && std::equal(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
38 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
40 && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))) in test_constexpr()
41 && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))) in test_constexpr()
H A Dequal_pred.pass.cpp38 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
42 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic) , eq) in test_constexpr()
43 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq) in test_constexpr()
44 && std::equal(std::begin(ib), std::end(ib), std::begin(ic) , eq) in test_constexpr()
45 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq) in test_constexpr()
47 … && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)) , eq) in test_constexpr()
48 … && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq) in test_constexpr()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
H A Dunique.pass.cpp54 int ic[] = {0, 0}; in test() local
55 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
56 r = std::unique(Iter(ic), Iter(ic+sc)); in test()
57 assert(base(r) == ic + 1); in test()
58 assert(ic[0] == 0); in test()
127 Ptr ic[2]; in test1() local
128 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1()
129 r = std::unique(Iter(ic), Iter(ic+sc)); in test1()
130 assert(base(r) == ic + 1); in test1()
131 assert(ic[0] == 0); in test1()
H A Dunique_pred.pass.cpp68 int ic[] = {0, 0}; in test() local
69 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
71 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test()
72 assert(base(r) == ic + 1); in test()
73 assert(ic[0] == 0); in test()
157 Ptr ic[2]; in test1() local
158 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1()
160 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test1()
161 assert(base(r) == ic + 1); in test1()
162 assert(ic[0] == 0); in test1()
/llvm-project-15.0.7/openmp/runtime/test/atomic/
H A Dkmp_atomic_cas.c54 int ic = 0; in main() local
127 ic = __kmpc_atomic_val_4_cas(NULL, 0, &io, i0, i1); // no-op in main()
130 if (ic != i2) { in main()
131 ret++; printf("Error val_4_cas no-op ret: %d != %d\n", ic, i2); } in main()
132 ic = __kmpc_atomic_val_4_cas(NULL, 0, &io, i2, i1); in main()
135 if (ic != i2) { in main()
136 ret++; printf("Error val_4_cas ret: %d != %d\n", ic, i2); } in main()
153 #pragma omp parallel num_threads(2) private(i2, ic, r) in main()
159 ic = __kmpc_atomic_val_4_cas(NULL, 0, &i0, i2, i2 + 1); in main()
160 while(ic != i2) { in main()
[all …]
H A Dkmp_atomic_cas_cpt.c62 int ic = 0; in main() local
154 ic = __kmpc_atomic_val_4_cas_cpt(NULL, 0, &io, i0, i1, &iv); // no-op in main()
159 if (ic != i2) { in main()
160 ret++; printf("Error val_4_cas_cpt no-op ret: %d != %d\n", ic, i2); } in main()
161 ic = __kmpc_atomic_val_4_cas_cpt(NULL, 0, &io, i2, i1, &iv); in main()
164 if (ic != i2) { ret++; printf("Error val_4_cas_cpt ret: %d != %d\n", ic, i2); } in main()
184 #pragma omp parallel num_threads(2) private(i2, ic, r, iv) in main()
190 ic = __kmpc_atomic_val_4_cas_cpt(NULL, 0, &i0, i2, i2 + 1, &iv); in main()
191 while(ic != i2) { in main()
192 if (iv != ic) { in main()
[all …]
/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dtemp_func_order.cpp61 void test_f4(int i, const int ic) { in test_f4() argument
63 float &fr1 = f4(ic); in test_f4()
72 void test_f5(int i, const int ic) { in test_f5() argument
82 void test_f6(int i, const int ic) { in test_f6() argument
84 float &fr = f6(ic, ic); in test_f6()
/llvm-project-15.0.7/cross-project-tests/debuginfo-tests/dexter/dex/debugger/DebuggerControllers/
H A DConditionalController.py101 for ic in finish_commands:
103 ic.expression,
104 ic.path,
105 ic.on_line,
106 ic.on_line,
107 ic.values,
108 ic.hit_count + 1,
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
H A Dincludes.pass.cpp31 int ic[] = {1, 2}; in test() local
32 const unsigned sc = sizeof(ic)/sizeof(ic[0]); ((void)sc); in test()
44 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2))); in test()
/llvm-project-15.0.7/clang/test/Frontend/
H A Dfixed_point_unknown_conversions.c10 int _Complex ic; in func() local
26 …accum = ic; // expected-error{{conversion between fixed point and '_Complex int' is not yet s… in func()
32 …ic = accum; // expected-error{{conversion between fixed point and '_Complex int' is not yet s… in func()
/llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/
H A Dinsert-01.ll10 ; CHECK: ic %r2, 0(%r3)
23 ; CHECK: ic %r2, 0(%r3)
37 ; CHECK: ic %r2, 0(%r3)
50 ; CHECK: ic %r2, 0(%r3)
63 ; CHECK: ic %r2, 0(%r3)
76 ; CHECK: ic %r2, 0(%r3)
89 ; CHECK: ic %r2, 0(%r3)
101 ; CHECK: ic %r2, 0(%r3)
112 ; CHECK: ic %r2, 4095(%r3)
153 ; CHECK: ic %r2, 0(%r3)
[all …]

12345