Home
last modified time | relevance | path

Searched refs:pred (Results 1 – 25 of 498) sorted by relevance

12345678910>>...20

/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Drobust_against_cpp20_hostile_iterators.compile.pass.cpp82 Pred pred; in test() local
87 (void) std::all_of(it, it, pred); in test()
88 (void) std::any_of(it, it, pred); in test()
95 (void) std::count_if(it, it, pred); in test()
100 (void) std::equal(it, it, it, pred); in test()
112 (void) std::find_if(it, it, pred); in test()
117 (void) std::for_each(it, it, pred); in test()
119 (void) std::generate(it, it, pred); in test()
127 (void) std::is_heap(it, it, pred); in test()
159 (void) std::none_of(it, it, pred); in test()
[all …]
/llvm-project-15.0.7/llvm/utils/unittest/googletest/include/gtest/
H A Dgtest_pred_impl.h93 Pred pred, in AssertPred1Helper() argument
95 if (pred(v1)) return AssertionSuccess(); in AssertPred1Helper()
111 #define GTEST_PRED1_(pred, v1, on_failure)\ argument
120 #define EXPECT_PRED1(pred, v1) \ argument
124 #define ASSERT_PRED1(pred, v1) \ argument
137 Pred pred, in AssertPred2Helper() argument
169 #define EXPECT_PRED2(pred, v1, v2) \ argument
173 #define ASSERT_PRED2(pred, v1, v2) \ argument
188 Pred pred, in AssertPred3Helper() argument
224 #define EXPECT_PRED3(pred, v1, v2, v3) \ argument
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/NVPTX/
H A Dvote.ll6 define i1 @vote_all(i1 %pred) {
7 ; CHECK: vote.all.pred
8 %val = call i1 @llvm.nvvm.vote.all(i1 %pred)
14 define i1 @vote_any(i1 %pred) {
15 ; CHECK: vote.any.pred
22 define i1 @vote_uni(i1 %pred) {
23 ; CHECK: vote.uni.pred
30 define i32 @vote_ballot(i1 %pred) {
39 ; CHECK: vote.sync.all.pred
47 ; CHECK: vote.sync.any.pred
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dis_partitioned.pass.cpp44 std::ref(pred))); in main()
45 assert(static_cast<std::ptrdiff_t>(pred.count()) <= in main()
53 std::ref(pred))); in main()
54 assert(static_cast<std::ptrdiff_t>(pred.count()) <= in main()
62 std::ref(pred))); in main()
63 assert(static_cast<std::ptrdiff_t>(pred.count()) <= in main()
71 std::ref(pred))); in main()
72 assert(static_cast<std::ptrdiff_t>(pred.count()) <= in main()
80 std::ref(pred))); in main()
81 assert(static_cast<std::ptrdiff_t>(pred.count()) <= in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.filter/
H A Dbegin.pass.cpp58 auto pred = [](int) { return true; }; in general_tests() local
59 std::ranges::filter_view view(range, pred); in general_tests()
67 auto pred = [](int) { return true; }; in general_tests() local
68 std::ranges::filter_view view(range, pred); in general_tests()
78 auto pred = [](int i) { return i == 1; }; in general_tests() local
85 auto pred = [](int) { return false; }; in general_tests() local
97 auto pred = [](int i) { return i == 1; }; in general_tests() local
104 auto pred = [](int i) { return i == 2; }; in general_tests() local
111 auto pred = [](int) { return false; }; in general_tests() local
130 auto pred = [](int) { return false; }; in general_tests() local
[all …]
H A Dend.pass.cpp50 auto pred = [](int) { return true; }; in test() local
51 std::ranges::filter_view view(range, pred); in test()
59 auto pred = [](int) { return true; }; in test() local
60 std::ranges::filter_view view(range, pred); in test()
68 auto pred = [](int) { return true; }; in test() local
69 std::ranges::filter_view view(range, pred); in test()
78 auto pred = [](int) { return true; }; in test() local
79 std::ranges::filter_view view(range, pred); in test()
89 auto pred = [=](int i) { return i == k; }; in test() local
90 std::ranges::filter_view view(range, pred); in test()
[all …]
H A Dpred.pass.cpp34 Pred pred{42}; in test() local
35 std::ranges::filter_view<Range, Pred> const view(Range{}, pred); in test()
36 std::same_as<Pred const&> decltype(auto) result = view.pred(); in test()
40 std::same_as<Pred const&> decltype(auto) result2 = view.pred(); in test()
46 Pred pred{42}; in test() local
47 std::ranges::filter_view<Range, Pred> view(Range{}, pred); in test()
48 std::same_as<Pred const&> decltype(auto) result = view.pred(); in test()
52 std::same_as<Pred const&> decltype(auto) result2 = view.pred(); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
H A Dranges_remove_copy_if.pass.cpp49 requires(I&& iter, S&& sent, O&& out, Pred&& pred) {
135 auto pred = [](int i) { return i == 2; }; in testImpl() local
143 auto pred = [](int i) { return i == 3; }; in testImpl() local
151 auto pred = [](int) { return false; }; in testImpl() local
159 auto pred = [](int) { return true; }; in testImpl() local
167 auto pred = [](int i) { return i < 2; }; in testImpl() local
175 auto pred = [](int i) { return i > 3; }; in testImpl() local
183 auto pred = [](int i) { return i < 6; }; in testImpl() local
191 auto pred = [](int) { return false; }; in testImpl() local
199 auto pred = [](int i) { return i == 1; }; in testImpl() local
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ARM/
H A Dmve-v2i2v.ll6 declare i32 @llvm.arm.mve.pred.v2i.v2i1(<2 x i1>)
7 declare i32 @llvm.arm.mve.pred.v2i.v4i1(<4 x i1>)
8 declare i32 @llvm.arm.mve.pred.v2i.v8i1(<8 x i1>)
9 declare i32 @llvm.arm.mve.pred.v2i.v16i1(<16 x i1>)
11 declare <2 x i1> @llvm.arm.mve.pred.i2v.v2i1(i32)
12 declare <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32)
13 declare <8 x i1> @llvm.arm.mve.pred.i2v.v8i1(i32)
14 declare <16 x i1> @llvm.arm.mve.pred.i2v.v16i1(i32)
25 %int = call i32 @llvm.arm.mve.pred.v2i.v2i1(<2 x i1> %vin)
26 %vout = call <2 x i1> @llvm.arm.mve.pred.i2v.v2i1(i32 %int)
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dvplan-sink-scalars-and-merge.ll35 ; CHECK-NEXT: Successor(s): pred.store.if, pred.store.continue
99 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
118 ; CHECK-NEXT: Successor(s): pred.store.if, pred.store.continue
178 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
198 ; CHECK-NEXT: Successor(s): pred.store.if, pred.store.continue
268 ; CHECK-NEXT: Successor(s): pred.store.if, pred.store.continue
340 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
366 ; CHECK-NEXT: Successor(s): pred.store.if, pred.store.continue
442 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
557 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
[all …]
H A Dfirst-order-recurrence-sink-replicate-region.ll34 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
36 ; CHECK-NEXT: pred.load.if:
55 ; CHECK-NEXT: Successor(s): pred.srem.if, pred.srem.continue
57 ; CHECK-NEXT: pred.srem.if:
127 ; CHECK-NEXT: Successor(s): pred.store.if, pred.store.continue
199 ; CHECK-NEXT: Successor(s): pred.srem.if, pred.srem.continue
275 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
298 ; CHECK-NEXT: Successor(s): pred.load.if, pred.load.continue
375 ; CHECK-NEXT: Successor(s): pred.srem.if, pred.srem.continue
393 ; CHECK-NEXT: Successor(s): pred.store.if, pred.store.continue
[all …]
H A Dselect-cmp-predicated.ll11 ; CHECK-VF2IC1-NEXT: br i1 [[TMP5]], label %pred.load.if, label %pred.load.continue
12 ; CHECK-VF2IC1: pred.load.if:
17 ; CHECK-VF2IC1: pred.load.continue:
20 ; CHECK-VF2IC1-NEXT: br i1 [[TMP10]], label %pred.load.if1, label %pred.load.continue2
21 ; CHECK-VF2IC1: pred.load.if1:
26 ; CHECK-VF2IC1: pred.load.continue2:
67 ; CHECK-VF1IC2-NEXT: br i1 [[TMP4]], label %pred.load.if, label %pred.load.continue
68 ; CHECK-VF1IC2: pred.load.if:
74 ; CHECK-VF1IC2-NEXT: br i1 [[TMP5]], label %pred.load.if3, label %pred.load.continue4
75 ; CHECK-VF1IC2: pred.load.if3:
[all …]
/llvm-project-15.0.7/clang/test/Analysis/
H A Dunix-fns.c104 dispatch_once_t pred = 0; in test_dispatch_once() local
108 static dispatch_once_t pred = 0; in test_dispatch_once_neg() local
109 …do { if (__builtin_expect(*(&pred), ~0l) != ~0l) dispatch_once((&pred), (^(void) {})); } while (0)… in test_dispatch_once_neg()
115 pthread_once_t pred = {0x30B1BCBA, {0}}; in test_pthread_once() local
119 static pthread_once_t pred = {0x30B1BCBA, {0}}; in test_pthread_once_neg() local
120 pthread_once(&pred, test_pthread_once_aux); // no-warning in test_pthread_once_neg()
216 dispatch_once_t pred = 0; in test_dispatch_once_in_macro() local
232 static dispatch_once_t pred; in test_inline_dispatch_once() local
234 dispatch_once(&pred, ^(void) { in test_inline_dispatch_once()
241 static dispatch_once_t pred; in test_inline_dispatch_once_reachable() local
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dsve-intrinsics-loads.ll8 define <vscale x 16 x i8> @ld1rqb_i8(<vscale x 16 x i1> %pred, i8* %addr) {
17 define <vscale x 16 x i8> @ld1rqb_i8_imm(<vscale x 16 x i1> %pred, i8* %addr) {
73 define <vscale x 8 x i16> @ld1rqh_i16(<vscale x 8 x i1> %pred, i16* %addr) {
134 define <vscale x 4 x i32> @ld1rqw_i32(<vscale x 4 x i1> %pred, i32* %addr) {
218 define <vscale x 16 x i8> @ldnt1b_i8(<vscale x 16 x i1> %pred, i8* %addr) {
314 define <vscale x 32 x i8> @ld2b_i8(<vscale x 16 x i1> %pred, i8* %addr) {
358 define <vscale x 8 x i32> @ld2w_i32(<vscale x 4 x i1> %pred, i32* %addr) {
380 define <vscale x 4 x i64> @ld2d_i64(<vscale x 2 x i1> %pred, i64* %addr) {
402 define <vscale x 48 x i8> @ld3b_i8(<vscale x 16 x i1> %pred, i8* %addr) {
468 define <vscale x 6 x i64> @ld3d_i64(<vscale x 2 x i1> %pred, i64* %addr) {
[all …]
H A Dsve-intrinsics-ld1.ll9 define <vscale x 16 x i8> @ld1b_i8(<vscale x 16 x i1> %pred, i8* %addr) {
18 define <vscale x 8 x i16> @ld1b_h(<vscale x 8 x i1> %pred, i8* %addr) {
28 define <vscale x 8 x i16> @ld1sb_h(<vscale x 8 x i1> %pred, i8* %addr) {
38 define <vscale x 4 x i32> @ld1b_s(<vscale x 4 x i1> %pred, i8* %addr) {
48 define <vscale x 4 x i32> @ld1sb_s(<vscale x 4 x i1> %pred, i8* %addr) {
58 define <vscale x 2 x i64> @ld1b_d(<vscale x 2 x i1> %pred, i8* %addr) {
68 define <vscale x 2 x i64> @ld1sb_d(<vscale x 2 x i1> %pred, i8* %addr) {
82 define <vscale x 8 x i16> @ld1h_i16(<vscale x 8 x i1> %pred, i16* %addr) {
109 define <vscale x 4 x i32> @ld1h_s(<vscale x 4 x i1> %pred, i16* %addr) {
129 define <vscale x 2 x i64> @ld1h_d(<vscale x 2 x i1> %pred, i16* %addr) {
[all …]
H A Dsve-extract-vector-to-predicate-store.ll5 define void @pred_store_v2i8(<vscale x 16 x i1> %pred, <2 x i8>* %addr) #0 {
8 ; CHECK-NEXT: store <vscale x 16 x i1> %pred, <vscale x 16 x i1>* [[TMP1]]
10 %bitcast = bitcast <vscale x 16 x i1> %pred to <vscale x 2 x i8>
16 define void @pred_store_v4i8(<vscale x 16 x i1> %pred, <4 x i8>* %addr) #1 {
19 ; CHECK-NEXT: store <vscale x 16 x i1> %pred, <vscale x 16 x i1>* [[TMP1]]
21 %bitcast = bitcast <vscale x 16 x i1> %pred to <vscale x 2 x i8>
32 %bitcast = bitcast <vscale x 16 x i1> %pred to <vscale x 2 x i8>
43 %bitcast = bitcast <vscale x 16 x i1> %pred to <vscale x 2 x i8>
53 %bitcast = bitcast <vscale x 16 x i1> %pred to <vscale x 2 x i8>
63 %bitcast = bitcast <vscale x 16 x i1> %pred to <vscale x 2 x i8>
[all …]
H A Dsve-intrinsics-st1.ll17 <vscale x 16 x i1> %pred,
29 <vscale x 8 x i1> %pred,
41 <vscale x 4 x i1> %pred,
53 <vscale x 2 x i1> %pred,
68 <vscale x 8 x i1> %pred,
79 <vscale x 8 x i1> %pred,
90 <vscale x 8 x i1> %pred,
102 <vscale x 4 x i1> %pred,
114 <vscale x 2 x i1> %pred,
129 <vscale x 4 x i1> %pred,
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LCSSA/
H A Dremove-phis.ll15 br i1 undef, label %gazonk, label %infinite.loop.pred
24 br i1 undef, label %qqq, label %foo.pred
26 foo.pred:
30 br i1 undef, label %bar, label %exit1.pred
33 br i1 undef, label %foo, label %exit2.pred
36 br i1 undef, label %foo, label %exit2.pred
38 exit1.pred:
44 exit2.pred:
50 infinite.loop.pred:
54 %dead = phi i16 [ %value, %infinite.loop.pred ], [ 0, %infinite.loop ]
/llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/mve-intrinsics/
H A Dv2i1-upgrade.ll5 declare <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32)
6 declare i32 @llvm.arm.mve.pred.v2i.v4i1(<4 x i1>)
36 %1 = call i32 @llvm.arm.mve.pred.v2i.v4i1(<4 x i1> %0)
56 %1 = call <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32 %0)
59 %4 = call i32 @llvm.arm.mve.pred.v2i.v4i1(<4 x i1> %3)
93 %1 = call <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32 %0)
110 %1 = call <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32 %0)
132 %2 = call <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32 %1)
152 %1 = call <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32 %0)
169 %1 = call <4 x i1> @llvm.arm.mve.pred.i2v.v4i1(i32 %0)
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/CodeGenPrepare/AMDGPU/
H A Dsink-addrspacecast.ll9 br i1 %pred, label %l1, label %l2
26 br i1 %pred, label %l1, label %l2
44 br i1 %pred, label %l1, label %l2
59 define i64 @sink_flat_to_global(i1 %pred, i64* %ptr) {
61 br i1 %pred, label %l1, label %l2
76 define i64 @sink_flat_to_constant(i1 %pred, i64* %ptr) {
78 br i1 %pred, label %l1, label %l2
93 define i64 @sink_flat_to_local(i1 %pred, i64* %ptr) {
95 br i1 %pred, label %l1, label %l2
110 define i64 @sink_flat_to_private(i1 %pred, i64* %ptr) {
[all …]
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/
H A Dfind_if.pass.cpp28 operator()(pstl::execution::unsequenced_policy, Iterator first, Iterator last, Predicate pred, in operator ()()
34 …ator()(pstl::execution::parallel_unsequenced_policy, Iterator first, Iterator last, Predicate pred, in operator ()()
42 operator()(Policy&& exec, Iterator first, Iterator last, Predicate pred, NotPredicate not_pred) in operator ()()
44 auto i = std::find_if(first, last, pred); in operator ()()
45 auto j = find_if(exec, first, last, pred); in operator ()()
54 test(Predicate pred, Hit hit, Miss miss) in test() argument
56 auto not_pred = [pred](T x) { return !pred(x); }; in test()
68 invoke_on_all_policies(test_find_if(), in.begin(), in.end(), pred, not_pred); in test()
69 invoke_on_all_policies(test_find_if(), in.cbegin(), in.cend(), pred, not_pred); in test()
/llvm-project-15.0.7/clang/include/clang/Basic/
H A Darm_mve.td216 $addend, $m1, $m2_s, $pred)>;
398 $pred,
685 top, $pred)>,
704 $a, $pred, $inactive)>;
810 def _m: Intrinsic<pred, (args u32:$val, pred:$inpred),
951 $addr, $offset, $pred)>;
1291 0, $pred):$pair,
1329 $pred)>;
1449 defvar predArg = !if(pred, (args Predicate:$pred), (args));
1450 defvar intrinsic = !if(pred,
[all …]
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dis_partitioned.pass.cpp28 … operator()(pstl::execution::unsequenced_policy, Iterator1 begin1, Iterator1 end1, Predicate pred) in operator ()()
33 …r()(pstl::execution::parallel_unsequenced_policy, Iterator1 begin1, Iterator1 end1, Predicate pred) in operator ()()
40 operator()(ExecutionPolicy&& exec, Iterator1 begin1, Iterator1 end1, Predicate pred) in operator ()()
42 const bool expected = std::is_partitioned(begin1, end1, pred); in operator ()()
43 const bool actual = std::is_partitioned(exec, begin1, end1, pred); in operator ()()
50 test(Predicate pred) in test() argument
58 invoke_on_all_policies(test_one_policy(), in.begin(), in.begin() + n1, pred); in test()
59 std::partition(in.begin(), in.begin() + n1, pred); in test()
60 invoke_on_all_policies(test_one_policy(), in.cbegin(), in.cbegin() + n1, pred); in test()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dlexicographical_compare.pass.cpp28 Predicate pred) in operator ()()
30 const bool expected = std::lexicographical_compare(begin1, end1, begin2, end2, pred); in operator ()()
31 const bool actual = std::lexicographical_compare(exec, begin1, end1, begin2, end2, pred); in operator ()()
47 test(Predicate pred) in test() argument
63 pred); in test()
65 in2.begin() + 3 * max_n2, pred); in test()
70 pred); in test()
76 …ll_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() + n2, pred); in test()
82 …ll_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() + n2, pred); in test()
95 test_string(Predicate pred) in test_string() argument
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/
H A Dswitch_ub.ll21 br i1 %cond, label %bb, label %pred
23 pred:
29 %phi = phi i32* [null, %pred], [null, %pred], [null, %pred], [%p, %entry]
49 br i1 %cond, label %bb, label %pred
51 pred:
69 ; CHECK: pred:
97 br i1 %cond, label %bb, label %pred
99 pred:
132 ; CHECK: pred:
157 pred:
[all …]

12345678910>>...20