Home
last modified time | relevance | path

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

12345

/freebsd/contrib/googletest/googletest/include/gtest/
H A Dgtest_pred_impl.h88 Pred pred, const T1& v1) { in AssertPred1Helper() argument
89 if (pred(v1)) return AssertionSuccess(); in AssertPred1Helper()
104 #define GTEST_PRED1_(pred, v1, on_failure) \ argument
105 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, #v1, pred, v1), on_failure)
110 #define EXPECT_PRED1(pred, v1) GTEST_PRED1_(pred, v1, GTEST_NONFATAL_FAILURE_) argument
113 #define ASSERT_PRED1(pred, v1) GTEST_PRED1_(pred, v1, GTEST_FATAL_FAILURE_) argument
119 const char* e2, Pred pred, const T1& v1, in AssertPred2Helper() argument
121 if (pred(v1, v2)) return AssertionSuccess(); in AssertPred2Helper()
138 #define GTEST_PRED2_(pred, v1, v2, on_failure) \ argument
139 GTEST_ASSERT_(::testing::AssertPred2Helper(#pred, #v1, #v2, pred, v1, v2), \
[all …]
/freebsd/crypto/openssh/regress/unittests/test_helper/
H A Dtest_helper.c52 #define TEST_CHECK_INT(r, pred) do { \ argument
53 switch (pred) { \
83 #define TEST_CHECK(x1, x2, pred) do { \ argument
84 switch (pred) { \
342 const char *name, enum test_predicate pred) in test_header() argument
348 name, pred_name(pred), a1, in test_header()
355 const BIGNUM *aa1, const BIGNUM *aa2, enum test_predicate pred) in assert_bignum() argument
359 TEST_CHECK_INT(r, pred); in assert_bignum()
360 test_header(file, line, a1, a2, "BIGNUM", pred); in assert_bignum()
369 const char *aa1, const char *aa2, enum test_predicate pred) in assert_string() argument
[all …]
H A Dtest_helper.h58 const BIGNUM *aa1, const BIGNUM *aa2, enum test_predicate pred);
62 const char *aa1, const char *aa2, enum test_predicate pred);
65 const void *aa1, const void *aa2, size_t l, enum test_predicate pred);
68 const void *aa1, u_char v, size_t l, enum test_predicate pred);
71 int aa1, int aa2, enum test_predicate pred);
74 size_t aa1, size_t aa2, enum test_predicate pred);
77 u_int aa1, u_int aa2, enum test_predicate pred);
80 long aa1, long aa2, enum test_predicate pred);
83 long long aa1, long long aa2, enum test_predicate pred);
86 char aa1, char aa2, enum test_predicate pred);
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A Darm_mve.td172 $m1, m2_cg, $addend, $pred);
178 Predicate:$pred), pred_cg>;
191 Predicate:$pred),
195 Predicate:$pred),
214 Vector, (args Vector:$addend, Vector:$m1, Scalar:$m2_s, Predicate:$pred),
216 $addend, $m1, $m2_s, $pred)>;
218 Vector, (args Vector:$m1, Vector:$m2, Scalar:$addend_s, Predicate:$pred),
220 $m1, $m2, $addend_s, $pred)>;
232 Vector, (args Vector:$addend, Vector:$m1, Scalar:$m2_s, Predicate:$pred),
234 $addend, $m1, $m2_s, $pred)>;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/
H A DTargetMacroFusion.td31 class FusionPredicateWithCode<code pred> : FusionPredicate<both_fusion_target> {
32 code Predicate = pred;
36 class FusionPredicateWithMCInstPredicate<FusionTarget target, MCInstPredicate pred>
38 MCInstPredicate Predicate = pred;
40 class FirstFusionPredicateWithMCInstPredicate<MCInstPredicate pred>
41 : FusionPredicateWithMCInstPredicate<first_fusion_target, pred>;
42 class SecondFusionPredicateWithMCInstPredicate<MCInstPredicate pred>
43 : FusionPredicateWithMCInstPredicate<second_fusion_target, pred>;
44 // The pred will be applied on both firstMI and secondMI.
45 class BothFusionPredicateWithMCInstPredicate<MCInstPredicate pred>
[all …]
H A DTargetSelectionDAG.td899 class PatFrags<dag ops, list<dag> frags, code pred = [{}],
903 code PredicateCode = pred;
919 // They will be tested prior to the code in pred and must not be used in
994 class PatFrag<dag ops, dag frag, code pred = [{}],
996 : PatFrags<ops, [frag], pred, xform>;
1006 class PatLeaf<dag frag, code pred = [{}], SDNodeXForm xform = NOOP_SDNodeXForm>
1007 : PatFrag<(ops), frag, pred, xform>;
1023 class ImmLeaf<ValueType vt, code pred, SDNodeXForm xform = NOOP_SDNodeXForm,
1026 let ImmediateCode = pred;
1038 class TImmLeaf<ValueType vt, code pred, SDNodeXForm xform = NOOP_SDNodeXForm,
[all …]
/freebsd/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_sugar.c143 dt_node_t *pred, int condid, int newcond) in dt_sugar_new_condition_impl() argument
160 value = dt_node_op2(DT_TOK_LAND, dt_node_int(1), pred); in dt_sugar_new_condition_impl()
164 dt_sugar_new_condition_var(condid), pred); in dt_sugar_new_condition_impl()
180 dt_sugar_new_condition(dt_sugar_parse_t *dp, dt_node_t *pred, int condid) in dt_sugar_new_condition() argument
184 pred, condid, dp->dtsp_num_conditions)); in dt_sugar_new_condition()
344 dt_node_t *pred = in dt_sugar_do_if() local
347 dt_sugar_new_condition(dp, pred, precondition)); in dt_sugar_do_if()
364 dt_node_t *pred = NULL; in dt_sugar_new_basic_block() local
373 pred = dt_node_op1(DT_TOK_LNEG, in dt_sugar_new_basic_block()
377 pred = dt_node_op2(DT_TOK_LAND, in dt_sugar_new_basic_block()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMInstrThumb2.td412 // pred operand excluding AL
782 t2_so_imm:$imm, pred:$p,
786 rGPR:$Rm, pred:$p,
790 t2_so_reg:$shift, pred:$p,
802 (!cast<Instruction>(NAME#"ri") rGPR:$Rd, rGPR:$Rn, t2_so_imm:$imm, pred:$p,
806 (!cast<Instruction>(NAME#"rr") rGPR:$Rd, rGPR:$Rn, rGPR:$Rm, pred:$p,
810 pred:$p, cc_out:$s)>;
815 pred:$p, cc_out:$s)>;
817 (!cast<Instruction>(NAME#"rr") rGPR:$Rdn, rGPR:$Rdn, rGPR:$Rm, pred:$p,
821 pred:$p, cc_out:$s)>;
[all …]
H A DARMInstrMVE.td243 ValueType pred, ValueType dblpred,
257 ValueType Pred = pred;
704 def : Pat<(i32 (vecreduce_add (VTI.Vec (vselect (VTI.Pred VCCR:$pred),
707 (i32 (InstN $vec, ARMVCCThen, $pred, zero_reg))>;
710 def : Pat<(i32 (ARMVADDVpu (VTI.Vec MQPR:$vec), (VTI.Pred VCCR:$pred))),
711 (i32 (InstN $vec, ARMVCCThen, $pred, zero_reg))>;
715 def : Pat<(i32 (add (i32 (vecreduce_add (VTI.Vec (vselect (VTI.Pred VCCR:$pred),
719 (i32 (InstA $acc, $vec, ARMVCCThen, $pred, zero_reg))>;
723 def : Pat<(i32 (add (i32 (ARMVADDVpu (VTI.Vec MQPR:$vec), (VTI.Pred VCCR:$pred))),
725 (i32 (InstA $acc, $vec, ARMVCCThen, $pred, zero_re
[all...]
H A DARMInstrNEON.td5223 (VACGTfd DPR:$Vd, DPR:$Vm, DPR:$Vn, pred:$p)>;
5225 (VACGTfq QPR:$Vd, QPR:$Vm, QPR:$Vn, pred:$p)>;
5227 (VACGEfd DPR:$Vd, DPR:$Vm, DPR:$Vn, pred:$p)>;
5229 (VACGEfq QPR:$Vd, QPR:$Vm, QPR:$Vn, pred:$p)>;
5232 (VACGThd DPR:$Vd, DPR:$Vm, DPR:$Vn, pred:$p)>;
5234 (VACGThq QPR:$Vd, QPR:$Vm, QPR:$Vn, pred:$p)>;
5236 (VACGEhd DPR:$Vd, DPR:$Vm, DPR:$Vn, pred:$p)>;
5238 (VACGEhq QPR:$Vd, QPR:$Vm, QPR:$Vn, pred:$p)>;
5290 (VACGTfd DPR:$Vd, DPR:$Vm, DPR:$Vd, pred:$p)>;
5292 (VACGTfq QPR:$Vd, QPR:$Vm, QPR:$Vd, pred:$p)>;
[all …]
H A DARMInstrThumb.td335 def : tHintAlias<"nop$p", (tHINT 0, pred:$p), 1>; // A8.6.110
336 def : tHintAlias<"yield$p", (tHINT 1, pred:$p), 1>; // A8.6.410
337 def : tHintAlias<"wfe$p", (tHINT 2, pred:$p), 1>; // A8.6.408
338 def : tHintAlias<"wfi$p", (tHINT 3, pred:$p), 1>; // A8.6.409
339 def : tHintAlias<"sev$p", (tHINT 4, pred:$p), 1>; // A8.6.157
340 def : tInstAlias<"sevl$p", (tHINT 5, pred:$p), 1> {
444 (tSUBspi SP, t_imm0_508s4_neg:$imm, pred:$p)>;
446 (tSUBspi SP, t_imm0_508s4_neg:$imm, pred:$p)>;
450 (tADDspi SP, t_imm0_508s4:$imm, pred:$p)>;
452 (tSUBspi SP, t_imm0_508s4:$imm, pred:$p)>;
[all …]
/freebsd/sys/contrib/ck/src/
H A Dck_ec.c131 int (*pred)(const struct ck_ec_wait_state *state, in exponential_backoff()
179 if (pred != NULL) { in exponential_backoff()
180 int r = pred(wait_state, &partial_deadline); in exponential_backoff()
315 #define WAIT_SLOW_BODY(W, ec, ops, pred, data, deadline_ptr, \ argument
369 pred, &deadline); \
387 int (*pred)(const struct ck_ec_wait_state *state, in ck_ec32_wait_pred_slow()
399 WAIT_SLOW_BODY(32, ec, ops, pred, data, deadline_ptr, in ck_ec32_wait_pred_slow()
408 int (*pred)(const struct ck_ec_wait_state *state, in ck_ec64_wait_pred_slow()
420 WAIT_SLOW_BODY(64, ec, ops, pred, data, deadline_ptr, in ck_ec64_wait_pred_slow()
/freebsd/cddl/contrib/opensolaris/cmd/lockstat/
H A Dlockstat.c590 predicate_add(char **pred, char *what, char *cmp, uintptr_t value) in predicate_add() argument
598 if (*pred == NULL) { in predicate_add()
599 *pred = malloc(1); in predicate_add()
600 *pred[0] = '\0'; in predicate_add()
603 len = strlen(*pred); in predicate_add()
607 if (*pred[0] != '\0') { in predicate_add()
610 *pred, what, cmp, (void *)value); in predicate_add()
612 (void) sprintf(new, "(%s) && (%s)", *pred, what); in predicate_add()
623 free(*pred); in predicate_add()
624 *pred = new; in predicate_add()
[all …]
/freebsd/bin/ed/
H A Ded.h157 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred) argument
160 #define INSQUE(elem, pred) \ argument
162 REQUE((elem), (pred)->q_forw); \
163 REQUE((pred), elem); \
/freebsd/sys/dev/vmm/
H A Dvmm_stat.h49 vmm_stat_func_pred_t pred; /* predicate to check during registration */ member
61 .pred = _pred, \
66 #define VMM_STAT_DEFINE(type, nelems, desc, pred) \ argument
67 VMM_STAT_FDEFINE(type, nelems, desc, NULL, pred)
/freebsd/contrib/llvm-project/libcxx/include/
H A Dalgorithm71 …mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2…
77 …mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) …
89 …constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); …
94 …find_if(R&& r, Pred pred, Proj proj = {}); …
98 …constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); …
103 …find_if_not(R&& r, Pred pred, Proj proj = {}); …
116 …constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); …
120 …constexpr borrowed_subrange_t<R> find_last_if(R&& r, Pred pred, Proj proj = {}); …
124 …constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); …
128 …constexpr borrowed_subrange_t<R> find_last_if_not(R&& r, Pred pred, Proj proj = {}); …
[all …]
H A Dcondition_variable35 void wait(unique_lock<mutex>& lock, Predicate pred);
46 Predicate pred);
57 Predicate pred);
80 void wait(Lock& lock, Predicate pred);
91 Predicate pred);
102 Predicate pred);
106 …bool wait(Lock& lock, stop_token stoken, Predicate pred); // since C…
110 … const chrono::time_point<Clock, Duration>& abs_time, Predicate pred); // since C++20
114 … const chrono::duration<Rep, Period>& rel_time, Predicate pred); // since C++20
/freebsd/sys/contrib/ck/include/
H A Dck_ec.h573 int (*pred)(const struct ck_ec_wait_state *,
584 int (*pred)(const struct ck_ec_wait_state *,
783 int (*pred)(const struct ck_ec_wait_state *state,
792 int (*pred)(const struct ck_ec_wait_state *state, in ck_ec32_wait_pred()
802 pred, data, deadline); in ck_ec32_wait_pred()
922 int (*pred)(const struct ck_ec_wait_state *state,
932 int (*pred)(const struct ck_ec_wait_state *state, in ck_ec64_wait_pred()
942 pred, data, deadline); in ck_ec64_wait_pred()
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A D__clang_cuda_intrinsics.h198 inline __device__ int __all_sync(unsigned int mask, int pred) { in __all_sync() argument
199 return __nvvm_vote_all_sync(mask, pred); in __all_sync()
202 inline __device__ int __any_sync(unsigned int mask, int pred) { in __any_sync() argument
203 return __nvvm_vote_any_sync(mask, pred); in __any_sync()
206 inline __device__ int __uni_sync(unsigned int mask, int pred) { in __uni_sync() argument
207 return __nvvm_vote_uni_sync(mask, pred); in __uni_sync()
210 inline __device__ unsigned int __ballot_sync(unsigned int mask, int pred) { in __ballot_sync() argument
211 return __nvvm_vote_ballot_sync(mask, pred); in __ballot_sync()
241 __match32_all_sync(unsigned int mask, unsigned int value, int *pred) { in __match32_all_sync() argument
242 return __nvvm_match_all_sync_i32p(mask, value, pred); in __match32_all_sync()
[all …]
/freebsd/sys/dev/qat/qat_api/common/crypto/sym/
H A Dlac_sym_compile_check.c27 #define COMPILE_TIME_ASSERT(pred) \ argument
30 case pred:; \
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp91 const ExplodedNode *pred = *(node->pred_begin()); in shouldCollect() local
92 if (pred->succ_size() != 1) in shouldCollect()
115 ProgramStateRef pred_state = pred->getState(); in shouldCollect()
117 progPoint.getLocationContext() != pred->getLocationContext()) in shouldCollect()
159 ExplodedNode *pred = *(node->pred_begin()); in collectNode() local
161 pred->replaceSuccessor(succ); in collectNode()
162 succ->replacePredecessor(pred); in collectNode()
/freebsd/contrib/llvm-project/llvm/lib/ProfileData/
H A DGCOV.cpp372 void GCOVFunction::propagateCounts(const GCOVBlock &v, GCOVArc *pred) { in propagateCounts() argument
375 GCOVArc *pred; in propagateCounts() member
382 stack.push_back({v, pred, false}); in propagateCounts()
393 if (u.i < u.v.pred.size()) { in propagateCounts()
394 GCOVArc *e = u.v.pred[u.i++]; in propagateCounts()
395 if (e != u.pred) { in propagateCounts()
401 } else if (u.i < u.v.pred.size() + u.v.succ.size()) { in propagateCounts()
402 GCOVArc *e = u.v.succ[u.i++ - u.v.pred.size()]; in propagateCounts()
403 if (e != u.pred) { in propagateCounts()
413 if (u.pred) in propagateCounts()
[all …]
/freebsd/sys/kern/
H A Dsubr_rangeset.c125 rs_pred_t pred) in rangeset_remove_pred() argument
150 if (pred(rs->rs_data_ctx, r)) in rangeset_remove_pred()
160 if (pred(rs->rs_data_ctx, r)) { in rangeset_remove_pred()
173 if (pred(rs->rs_data_ctx, r)) { in rangeset_remove_pred()
195 if (pred(rs->rs_data_ctx, r)) { in rangeset_remove_pred()
/freebsd/cddl/usr.sbin/dtrace/tests/common/clauses/
H A DMakefile13 err.D_IDENT_UNDEF.pred.d \
15 tst.pred.d \
/freebsd/lib/libc/stdlib/
H A Dinsque.c18 insque(void *element, void *pred) in insque() argument
23 prev = (struct que_elem *)pred; in insque()

12345