Home
last modified time | relevance | path

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

1234567

/freebsd-12.1/contrib/googletest/googletest/include/gtest/
H A Dgtest_pred_impl.h88 Pred pred, in AssertPred1Helper() argument
90 if (pred(v1)) return AssertionSuccess(); in AssertPred1Helper()
105 #define GTEST_PRED1_(pred, v1, on_failure)\ argument
114 #define EXPECT_PRED1(pred, v1) \ argument
118 #define ASSERT_PRED1(pred, v1) \ argument
131 Pred pred, in AssertPred2Helper() argument
162 #define EXPECT_PRED2(pred, v1, v2) \ argument
166 #define ASSERT_PRED2(pred, v1, v2) \ argument
181 Pred pred, in AssertPred3Helper() argument
217 #define EXPECT_PRED3(pred, v1, v2, v3) \ argument
[all …]
/freebsd-12.1/crypto/openssh/regress/unittests/test_helper/
H A Dtest_helper.c47 switch (pred) { \
78 switch (pred) { \
323 TEST_CHECK_INT(r, pred); in assert_bignum()
341 TEST_CHECK_INT(r, pred); in assert_string()
378 TEST_CHECK_INT(r, pred); in assert_mem()
413 TEST_CHECK_INT(r, pred); in assert_mem_filled()
427 TEST_CHECK(aa1, aa2, pred); in assert_int()
438 TEST_CHECK(aa1, aa2, pred); in assert_size_t()
449 TEST_CHECK(aa1, aa2, pred); in assert_u_int()
460 TEST_CHECK(aa1, aa2, pred); in assert_long()
[all …]
H A Dtest_helper.h56 const char *aa1, const char *aa2, enum test_predicate pred);
65 int aa1, int aa2, enum test_predicate pred);
68 size_t aa1, size_t aa2, enum test_predicate pred);
71 u_int aa1, u_int aa2, enum test_predicate pred);
74 long aa1, long aa2, enum test_predicate pred);
77 long long aa1, long long aa2, enum test_predicate pred);
80 char aa1, char aa2, enum test_predicate pred);
86 u_int8_t aa1, u_int8_t aa2, enum test_predicate pred);
89 u_int16_t aa1, u_int16_t aa2, enum test_predicate pred);
92 u_int32_t aa1, u_int32_t aa2, enum test_predicate pred);
[all …]
/freebsd-12.1/contrib/gcc/
H A Dpostreload-gcse.c133 edge pred; member
905 edge pred; in bb_has_well_behaved_predecessors() local
913 if ((pred->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (pred)) in bb_has_well_behaved_predecessors()
952 edge pred; in eliminate_partially_redundant_load() local
1033 occr->pred = pred; in eliminate_partially_redundant_load()
1048 unoccr->pred = pred; in eliminate_partially_redundant_load()
1078 pred = occr->pred; in eliminate_partially_redundant_load()
1086 pred); in eliminate_partially_redundant_load()
1094 pred->src->index, in eliminate_partially_redundant_load()
1095 pred->dest->index); in eliminate_partially_redundant_load()
[all …]
H A Dgensupport.c803 pred = alter_predicate_for_insn (pred, alternatives, max_operand, in process_one_cond_exec()
805 if (pred == NULL) in process_one_cond_exec()
812 XEXP (pattern, 0) = pred; in process_one_cond_exec()
856 XEXP (pattern, 0) = pred; in process_one_cond_exec()
874 XEXP (pattern, 0) = pred; in process_one_cond_exec()
1312 *slot = pred; in add_predicate()
1313 *last_predicate = pred; in add_predicate()
1314 last_predicate = &pred->next; in add_predicate()
1360 struct pred_data *pred; in init_predicate_table() local
1376 pred->codes[code] = true; in init_predicate_table()
[all …]
H A Dgenrecog.c106 } pred; member
675 if (!pred) in validate_pattern()
681 pred = 0; in validate_pattern()
734 if (set && pred && pred->allows_non_lvalue) in validate_pattern()
751 && pred in validate_pattern()
1010 if (pred) in add_to_sequence()
1012 test->u.pred.data = pred; in add_to_sequence()
1268 if (d1->u.pred.data->codes[c] && d2->u.pred.data->codes[c]) in maybe_both_true_2()
1408 return (d1->u.pred.mode == d2->u.pred.mode in nodes_identical_1()
1409 && strcmp (d1->u.pred.name, d2->u.pred.name) == 0); in nodes_identical_1()
[all …]
H A Dweb.c74 while (element->pred) in unionfind_root()
75 element = element->pred; in unionfind_root()
76 while (element1->pred) in unionfind_root()
78 element2 = element1->pred; in unionfind_root()
79 element1->pred = element; in unionfind_root()
96 second->pred = first; in unionfind_union()
H A Dtree-ssa-pre.c361 basic_block pred; member
435 ept.pred = pred; in phi_trans_lookup()
456 new_pair->pred = pred; in phi_trans_add()
1216 set, pred, phiblock); in phi_translate()
1300 set, pred, phiblock); in phi_translate()
1304 set, pred, phiblock); in phi_translate()
1338 set, pred, phiblock); in phi_translate()
2489 edge pred; in insert_into_preds_of_block() local
2595 add_phi_arg (temp, avail[pred->src->index], pred); in insert_into_preds_of_block()
2690 edge pred; in insert_aux() local
[all …]
H A Dcfgloop.c113 return loop->pred[depth]; in superloop_at_depth()
182 if (loop->pred) in flow_loop_free()
183 free (loop->pred); in flow_loop_free()
337 if (loop->pred) in establish_preds()
338 free (loop->pred); in establish_preds()
340 memcpy (loop->pred, father->pred, sizeof (struct loop *) * father->depth); in establish_preds()
381 free (loop->pred); in flow_loop_tree_node_remove()
382 loop->pred = NULL; in flow_loop_tree_node_remove()
677 loops->parray[0]->pred = NULL; in flow_loops_find()
976 loop->pred[i]->num_nodes++; in add_bb_to_loop()
[all …]
H A Dpredict.c528 struct edge_prediction *pred; in combine_predictions_for_bb() local
565 for (pred = bb->predictions; pred; pred = pred->ep_next) in combine_predictions_for_bb()
567 int predictor = pred->ep_predictor; in combine_predictions_for_bb()
568 int probability = pred->ep_probability; in combine_predictions_for_bb()
570 if (pred->ep_edge != first) in combine_predictions_for_bb()
611 for (pred = bb->predictions; pred; pred = pred->ep_next) in combine_predictions_for_bb()
613 int predictor = pred->ep_predictor; in combine_predictions_for_bb()
614 int probability = pred->ep_probability; in combine_predictions_for_bb()
1195 enum br_predictor pred; in apply_return_prediction() local
1234 if (pred != PRED_NO_PREDICTION) in apply_return_prediction()
[all …]
H A Dlcm.c186 basic_block pred, succ; in compute_earliest() local
195 pred = INDEX_EDGE_PRED_BB (edge_list, x); in compute_earliest()
197 if (pred == ENTRY_BLOCK_PTR) in compute_earliest()
206 avout[pred->index]); in compute_earliest()
207 sbitmap_not (temp_bitmap, antout[pred->index]); in compute_earliest()
209 kill[pred->index], temp_bitmap); in compute_earliest()
566 basic_block pred, succ; in compute_farthest() local
575 pred = INDEX_EDGE_PRED_BB (edge_list, x); in compute_farthest()
578 sbitmap_copy (farthest[x], st_avout[pred->index]); in compute_farthest()
581 if (pred == ENTRY_BLOCK_PTR) in compute_farthest()
[all …]
H A Dcfganal.c418 int pred, succ, index; in verify_edge_list() local
427 pred = e->src->index; in verify_edge_list()
432 fprintf (f, "*p* No index for edge from %d to %d\n", pred, succ); in verify_edge_list()
436 if (INDEX_EDGE_PRED_BB (elist, index)->index != pred) in verify_edge_list()
438 index, pred, INDEX_EDGE_PRED_BB (elist, index)->index); in verify_edge_list()
482 find_edge (basic_block pred, basic_block succ) in find_edge() argument
487 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
489 FOR_EACH_EDGE (e, ei, pred->succs) in find_edge()
496 if (e->src == pred) in find_edge()
507 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ) in find_edge_index() argument
[all …]
/freebsd-12.1/contrib/llvm/lib/IR/
H A DConstantFold.cpp1113 pred = CmpInst::getInversePredicate(pred); in ConstantFoldBinaryInstruction()
1463 return pred; in evaluateICmpRelation()
1467 return pred; in evaluateICmpRelation()
1471 return pred; in evaluateICmpRelation()
1761 switch(pred) { in ConstantFoldCompareInstruction()
1776 switch (pred) { in ConstantFoldCompareInstruction()
1793 switch (pred) { in ConstantFoldCompareInstruction()
1886 if (pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT) in ConstantFoldCompareInstruction()
1893 if (pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT) in ConstantFoldCompareInstruction()
1900 if (pred == FCmpInst::FCMP_OEQ || pred == FCmpInst::FCMP_UEQ) in ConstantFoldCompareInstruction()
[all …]
/freebsd-12.1/contrib/gcclibs/libiberty/
H A Dinsque.c36 insque (struct qelem *elem, struct qelem *pred) in insque() argument
38 elem -> q_forw = pred -> q_forw; in insque()
39 pred -> q_forw -> q_back = elem; in insque()
40 elem -> q_back = pred; in insque()
41 pred -> q_forw = elem; in insque()
/freebsd-12.1/contrib/binutils/libiberty/
H A Dinsque.c36 insque (struct qelem *elem, struct qelem *pred) in insque() argument
38 elem -> q_forw = pred -> q_forw; in insque()
39 pred -> q_forw -> q_back = elem; in insque()
40 elem -> q_back = pred; in insque()
41 pred -> q_forw = elem; in insque()
/freebsd-12.1/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-12.1/contrib/llvm/lib/Target/ARM/
H A DARMInstrThumb2.td1207 (ins t2adrlabel:$addr, pred:$p),
4468 pred:$p, cc_out:$s)>;
4475 pred:$p, cc_out:$s)>;
4487 pred:$p, cc_out:$s)>;
4497 pred:$p, cc_out:$s)>;
4532 pred:$p, cc_out:$s)>;
4544 pred:$p, cc_out:$s)>;
4765 pred:$p, cc_out:$s)>;
4768 pred:$p, cc_out:$s)>;
4771 pred:$p, cc_out:$s)>;
[all …]
H A DARMInstrNEON.td8267 pred:$p)>;
8270 pred:$p)>;
8273 pred:$p)>;
8276 pred:$p)>;
8279 pred:$p)>;
8282 pred:$p)>;
8287 pred:$p)>;
8291 pred:$p)>;
8295 pred:$p)>;
8299 pred:$p)>;
[all …]
H A DARMInstrThumb.td319 def : tHintAlias<"nop$p", (tHINT 0, pred:$p), 1>; // A8.6.110
321 def : tHintAlias<"wfe$p", (tHINT 2, pred:$p), 1>; // A8.6.408
322 def : tHintAlias<"wfi$p", (tHINT 3, pred:$p), 1>; // A8.6.409
324 def : tInstAlias<"sevl$p", (tHINT 5, pred:$p), 1> {
434 (tADDspi SP, t_imm0_508s4:$imm, pred:$p)>;
436 (tSUBspi SP, t_imm0_508s4:$imm, pred:$p)>;
530 def tBLXr : TI<(outs), (ins pred:$p, GPR:$func), IIC_Br,
616 (ins t_brtarget:$dst, pred:$p),
618 (tB t_brtarget:$dst, pred:$p)>,
1214 pred:$p)>;
[all …]
/freebsd-12.1/cddl/contrib/opensolaris/cmd/lockstat/
H A Dlockstat.c598 if (*pred == NULL) { in predicate_add()
599 *pred = malloc(1); in predicate_add()
600 *pred[0] = '\0'; in predicate_add()
623 free(*pred); in predicate_add()
624 *pred = new; in predicate_add()
630 free(*pred); in predicate_destroy()
631 *pred = NULL; in predicate_destroy()
705 char *pred = NULL; in dprog_addevent() local
763 if (pred != NULL) in dprog_addevent()
782 pred = NULL; in dprog_addevent()
[all …]
/freebsd-12.1/bin/ed/
H A Ded.h160 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred) argument
163 #define INSQUE(elem, pred) \ argument
165 REQUE((elem), (pred)->q_forw); \
166 REQUE((pred), elem); \
/freebsd-12.1/contrib/llvm/tools/clang/lib/Headers/
H A D__clang_cuda_intrinsics.h212 inline __device__ int __all_sync(unsigned int mask, int pred) { in __all_sync() argument
213 return __nvvm_vote_all_sync(mask, pred); in __all_sync()
216 inline __device__ int __any_sync(unsigned int mask, int pred) { in __any_sync() argument
217 return __nvvm_vote_any_sync(mask, pred); in __any_sync()
220 inline __device__ int __uni_sync(unsigned int mask, int pred) { in __uni_sync() argument
221 return __nvvm_vote_uni_sync(mask, pred); in __uni_sync()
224 inline __device__ unsigned int __ballot_sync(unsigned int mask, int pred) { in __ballot_sync() argument
225 return __nvvm_vote_ballot_sync(mask, pred); in __ballot_sync()
249 __match32_all_sync(unsigned int mask, unsigned int value, int *pred) { in __match32_all_sync() argument
250 return __nvvm_match_all_sync_i32p(mask, value, pred); in __match32_all_sync()
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/
H A Derase_fn_imps.hpp117 erase_if(Pred pred) in erase_if() argument
129 const size_type left = partition(pred_t(pred)); in erase_if()
226 partition(Pred pred) in partition() argument
235 if (!pred(m_a_entries[left])) in partition()
237 else if (pred(m_a_entries[right])) in partition()
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Derase_fn_imps.hpp65 erase_if(Pred pred) in erase_if() argument
70 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) in erase_if()
81 if (pred(p_e->m_p_next->m_value)) in erase_if()
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp93 const ExplodedNode *pred = *(node->pred_begin()); in shouldCollect() local
94 if (pred->succ_size() != 1) in shouldCollect()
117 ProgramStateRef pred_state = pred->getState(); in shouldCollect()
119 progPoint.getLocationContext() != pred->getLocationContext()) in shouldCollect()
161 ExplodedNode *pred = *(node->pred_begin()); in collectNode() local
163 pred->replaceSuccessor(succ); in collectNode()
164 succ->replacePredecessor(pred); in collectNode()

1234567