Home
last modified time | relevance | path

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

12345678910

/openbsd-src/regress/sbin/iked/test_helper/
H A Dtest_helper.c37 #define TEST_CHECK_INT(r, pred) do { \ argument
38 switch (pred) { \
68 #define TEST_CHECK(x1, x2, pred) do { \ argument
69 switch (pred) { \
225 const char *name, enum test_predicate pred) in test_header() argument
230 name, pred_name(pred), a1, in test_header()
236 const char *aa1, const char *aa2, enum test_predicate pred) in assert_string() argument
240 TEST_CHECK_INT(r, pred); in assert_string()
241 test_header(file, line, a1, a2, "STRING", pred); in assert_string()
266 const void *aa1, const void *aa2, size_t l, enum test_predicate pred) in assert_mem() argument
[all …]
H A Dtest_helper.h45 const char *aa1, const char *aa2, enum test_predicate pred);
48 const void *aa1, const void *aa2, size_t l, enum test_predicate pred);
51 const void *aa1, u_char v, size_t l, enum test_predicate pred);
54 int aa1, int aa2, enum test_predicate pred);
57 size_t aa1, size_t aa2, enum test_predicate pred);
60 u_int aa1, u_int aa2, enum test_predicate pred);
63 long long aa1, long long aa2, enum test_predicate pred);
66 char aa1, char aa2, enum test_predicate pred);
69 const void *aa1, const void *aa2, enum test_predicate pred);
72 uint8_t aa1, uint8_t aa2, enum test_predicate pred);
[all …]
/openbsd-src/regress/usr.bin/ssh/unittests/test_helper/
H A Dtest_helper.c42 #define TEST_CHECK_INT(r, pred) do { \ argument
43 switch (pred) { \
73 #define TEST_CHECK(x1, x2, pred) do { \ argument
74 switch (pred) { \
309 const char *name, enum test_predicate pred) in test_header() argument
315 name, pred_name(pred), a1, in test_header()
321 const BIGNUM *aa1, const BIGNUM *aa2, enum test_predicate pred) in assert_bignum() argument
325 TEST_CHECK_INT(r, pred); in assert_bignum()
326 test_header(file, line, a1, a2, "BIGNUM", pred); in assert_bignum()
334 const char *aa1, const char *aa2, enum test_predicate pred) in assert_string() argument
[all …]
H A Dtest_helper.h51 const BIGNUM *aa1, const BIGNUM *aa2, enum test_predicate pred);
54 const char *aa1, const char *aa2, enum test_predicate pred);
57 const void *aa1, const void *aa2, size_t l, enum test_predicate pred);
60 const void *aa1, u_char v, size_t l, enum test_predicate pred);
63 int aa1, int aa2, enum test_predicate pred);
66 size_t aa1, size_t aa2, enum test_predicate pred);
69 u_int aa1, u_int aa2, enum test_predicate pred);
72 long aa1, long aa2, enum test_predicate pred);
75 long long aa1, long long aa2, enum test_predicate pred);
78 char aa1, char aa2, enum test_predicate pred);
[all …]
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/gcc/gcc/
H A Dpostreload-gcse.c133 edge pred; member
970 edge pred; in bb_has_well_behaved_predecessors() local
976 FOR_EACH_EDGE (pred, ei, bb->preds) in bb_has_well_behaved_predecessors()
978 if ((pred->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (pred)) in bb_has_well_behaved_predecessors()
981 if (JUMP_TABLE_DATA_P (BB_END (pred->src))) in bb_has_well_behaved_predecessors()
1017 edge pred; in eliminate_partially_redundant_load() local
1044 FOR_EACH_EDGE (pred, ei, bb->preds) in eliminate_partially_redundant_load()
1050 pred_bb = pred->src; in eliminate_partially_redundant_load()
1065 || reg_killed_on_edge (avail_reg, pred) in eliminate_partially_redundant_load()
1066 || reg_used_on_edge (dest, pred)) in eliminate_partially_redundant_load()
[all …]
H A Dgensupport.c783 rtx pred, insn, pattern, split; in process_one_cond_exec() local
802 pred = copy_rtx (XVECEXP (ce_elem->data, 0, 0)); in process_one_cond_exec()
803 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()
1304 add_predicate (struct pred_data *pred) in add_predicate() argument
1306 void **slot = htab_find_slot (predicate_table, pred, INSERT); in add_predicate()
1309 error ("duplicate predicate definition for '%s'", pred->name); in add_predicate()
[all …]
H A Dgenrecog.c106 } pred; member
369 struct pred_data *pred = xcalloc (sizeof (struct pred_data), 1); in process_define_predicate() local
374 pred->name = XSTR (desc, 0); in process_define_predicate()
376 pred->special = 1; in process_define_predicate()
383 pred->codes[i] = true; in process_define_predicate()
385 pred->allows_non_const = true; in process_define_predicate()
392 pred->allows_non_lvalue = true; in process_define_predicate()
395 pred->singleton = UNKNOWN; in process_define_predicate()
398 pred->singleton = i; in process_define_predicate()
402 add_predicate (pred); in process_define_predicate()
[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
392 basic_block b1 = ve1->pred; in expr_pred_trans_eq()
393 basic_block b2 = ve2->pred; in expr_pred_trans_eq()
429 phi_trans_lookup (tree e, basic_block pred, VEC (tree, gc) *vuses) in phi_trans_lookup() argument
435 ept.pred = pred; in phi_trans_lookup()
437 ept.hashcode = vn_compute (e, (unsigned long) pred); in phi_trans_lookup()
451 phi_trans_add (tree e, tree v, basic_block pred, VEC (tree, gc) *vuses) in phi_trans_add() argument
456 new_pair->pred = pred; in phi_trans_add()
459 new_pair->hashcode = vn_compute (e, (unsigned long) pred); in phi_trans_add()
1032 phi_translate (tree expr, value_set_t set, basic_block pred, in phi_translate() argument
[all …]
H A Dcfgloop.c99 && loop->pred[outer->depth] == outer); in flow_loop_nested_p()
113 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()
339 loop->pred = XNEWVEC (struct loop *, loop->depth); in establish_preds()
340 memcpy (loop->pred, father->pred, sizeof (struct loop *) * father->depth); in establish_preds()
341 loop->pred[father->depth] = father; in establish_preds()
381 free (loop->pred); in flow_loop_tree_node_remove()
[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()
616 if (pred->ep_edge != EDGE_SUCC (bb, 0)) in combine_predictions_for_bb()
1195 enum br_predictor pred; in apply_return_prediction() local
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dcfgloop.c101 && loop->pred[outer->depth] == outer;
194 if (loop->pred)
195 free (loop->pred);
247 for (e = loop->header->pred; e; e = e->pred_next)
259 for (e = loop->header->pred; e; e = e->pred_next)
356 for (e = node->pred; e; e = e->pred_next)
397 for (num = 1; ebb->pred->src != ENTRY_BLOCK_PTR && ! ebb->pred->pred_next;
399 ebb = ebb->pred->src;
407 for (e = loop->entry_edges[0]; num; e = e->src->pred)
426 for (e = header->pred; e; e = e->pred_next)
[all …]
H A Dcfgcleanup.c150 if (jump_block->pred->pred_next
867 for (tmp_edge = b->pred; tmp_edge; tmp_edge = tmp_edge->pred_next)
1360 if (src1->pred
1361 && !src1->pred->pred_next
1363 e1 = src1->pred, src1 = e1->src;
1365 if (src2->pred
1366 && !src2->pred->pred_next
1368 e2 = src2->pred, src2 = e2->src;
1387 if (!src1->pred || !src2->pred)
1508 if (!bb->pred || !bb->pred->pred_next)
[all …]
H A Dcfg.c192 bb->pred = NULL; in clear_edges()
204 EXIT_BLOCK_PTR->pred = NULL; in clear_edges()
315 e->pred_next = dst->pred;
321 dst->pred = e;
422 for (tmp = dest->pred; tmp && tmp != e; tmp = tmp->pred_next)
430 dest->pred = e->pred_next;
445 for (pe = &e->dest->pred; *pe != e; pe = &(*pe)->pred_next)
450 e->pred_next = new_succ->pred;
451 new_succ->pred = e;
589 for (e = bb->pred; e; e = e->pred_next)
[all …]
H A Dlcm.c139 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
170 for (e = bb->pred; e; e = e->pred_next)
196 basic_block pred, succ; local
205 pred = INDEX_EDGE_PRED_BB (edge_list, x);
207 if (pred == ENTRY_BLOCK_PTR)
216 avout[pred->index]);
217 sbitmap_not (temp_bitmap, antout[pred->index]);
219 kill[pred->index], temp_bitmap);
324 for (e = bb->pred; e != NULL; e = e->pred_next)
349 for (e = EXIT_BLOCK_PTR->pred; e != NULL; e = e->pred_next)
[all …]
/openbsd-src/gnu/lib/libiberty/src/
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()
/openbsd-src/bin/ed/
H A Ded.h125 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred) argument
128 #define INSQUE(elem, pred) \ argument
130 REQUE((elem), (pred)->q_forw); \
131 REQUE((pred), elem); \
/openbsd-src/gnu/llvm/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_reg))>;
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/testsuite/25_algorithms/
H A Dpartition.cc47 Pred pred; in test01() local
48 int* m = partition(s1, s1 + N, pred); in test01()
49 for (const int* i = s1; i < m; ++i) VERIFY(pred(*i)); in test01()
50 for (const int* i = m; i < s1 + N; ++i) VERIFY(!pred(*i)); in test01()
/openbsd-src/gnu/usr.bin/gcc/contrib/
H A Danalyze_brprob103 pred=$0
104 sub (/^ .* heuristics: /,"",pred)
105 sub (/. exec [0-9]* hit [0-9]* (.*.)$/,"",pred)
113 if (int(pred) < 50.0)
/openbsd-src/gnu/gcc/libstdc++-v3/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()
/openbsd-src/gnu/llvm/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()
243 __match32_all_sync(unsigned int mask, unsigned int value, int *pred) { in __match32_all_sync() argument
244 return __nvvm_match_all_sync_i32p(mask, value, pred); in __match32_all_sync()
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/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()

12345678910