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

12345

/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dinsque.c6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, struct qelem *@var{pred})
11 after @var{pred}. The @code{remque} routine removes @var{elem} from
36 insque (struct qelem *elem, struct qelem *pred) argument
38 elem -> q_forw = pred -> q_forw;
39 pred -> q_forw -> q_back = elem;
40 elem -> q_back = pred;
41 pred -> q_forw = elem;
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dinsque.c6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, struct qelem *@var{pred})
11 after @var{pred}. The @code{remque} routine removes @var{elem} from
36 insque (struct qelem *elem, struct qelem *pred) argument
38 elem -> q_forw = pred -> q_forw;
39 pred -> q_forw -> q_back = elem;
40 elem -> q_back = pred;
41 pred -> q_forw = elem;
/freebsd-11-stable/crypto/openssh/regress/unittests/test_helper/
H A Dtest_helper.c46 #define TEST_CHECK_INT(r, pred) do { \
47 switch (pred) { \
77 #define TEST_CHECK(x1, x2, pred) do { \
78 switch (pred) { \
295 const char *name, enum test_predicate pred)
301 name, pred_name(pred), a1,
307 const BIGNUM *aa1, const BIGNUM *aa2, enum test_predicate pred)
311 TEST_CHECK_INT(r, pred);
312 test_header(file, line, a1, a2, "BIGNUM", pred);
320 const char *aa1, const char *aa2, enum test_predicate pred)
294 test_header(const char *file, int line, const char *a1, const char *a2, const char *name, enum test_predicate pred) argument
306 assert_bignum(const char *file, int line, const char *a1, const char *a2, const BIGNUM *aa1, const BIGNUM *aa2, enum test_predicate pred) argument
319 assert_string(const char *file, int line, const char *a1, const char *a2, const char *aa1, const char *aa2, enum test_predicate pred) argument
354 assert_mem(const char *file, int line, const char *a1, const char *a2, const void *aa1, const void *aa2, size_t l, enum test_predicate pred) argument
388 assert_mem_filled(const char *file, int line, const char *a1, const void *aa1, u_char v, size_t l, enum test_predicate pred) argument
412 assert_int(const char *file, int line, const char *a1, const char *a2, int aa1, int aa2, enum test_predicate pred) argument
423 assert_size_t(const char *file, int line, const char *a1, const char *a2, size_t aa1, size_t aa2, enum test_predicate pred) argument
434 assert_u_int(const char *file, int line, const char *a1, const char *a2, u_int aa1, u_int aa2, enum test_predicate pred) argument
445 assert_long(const char *file, int line, const char *a1, const char *a2, long aa1, long aa2, enum test_predicate pred) argument
456 assert_long_long(const char *file, int line, const char *a1, const char *a2, long long aa1, long long aa2, enum test_predicate pred) argument
467 assert_char(const char *file, int line, const char *a1, const char *a2, char aa1, char aa2, enum test_predicate pred) argument
482 assert_u8(const char *file, int line, const char *a1, const char *a2, u_int8_t aa1, u_int8_t aa2, enum test_predicate pred) argument
493 assert_u16(const char *file, int line, const char *a1, const char *a2, u_int16_t aa1, u_int16_t aa2, enum test_predicate pred) argument
504 assert_u32(const char *file, int line, const char *a1, const char *a2, u_int32_t aa1, u_int32_t aa2, enum test_predicate pred) argument
515 assert_u64(const char *file, int line, const char *a1, const char *a2, u_int64_t aa1, u_int64_t aa2, enum test_predicate pred) argument
528 assert_ptr(const char *file, int line, const char *a1, const char *a2, const void *aa1, const void *aa2, enum test_predicate pred) 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...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dsplit_join_fn_imps.hpp51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument
59 base_type::split(pred, other);
H A Derase_fn_imps.hpp95 erase_if(Pred pred) argument
98 const size_type ersd = base_type::erase_if(pred);
/freebsd-11-stable/cddl/usr.sbin/dtrace/tests/common/clauses/
H A DMakefile15 err.D_IDENT_UNDEF.pred.d \
17 tst.pred.d \
/freebsd-11-stable/lib/libc/stdlib/
H A Dinsque.c21 insque(void *element, void *pred) argument
26 prev = (struct que_elem *)pred;
/freebsd-11-stable/sys/netinet/
H A Dsctp_bsd_addr.h62 void sctp_add_or_del_interfaces(int (*pred) (struct ifnet *), int add);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/
H A Derase_fn_imps.hpp65 erase_if(Pred pred) argument
70 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value))
81 if (pred(p_e->m_p_next->m_value))
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/
H A Derase_fn_imps.hpp88 erase_if(Pred pred) argument
92 while (m_p_l != NULL && pred(m_p_l->m_value))
106 if (pred(p_l->m_p_next->m_value))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DConstantFold.cpp1222 // cmp pred ^ true -> cmp !pred
1224 CmpInst::Predicate pred = (CmpInst::Predicate)CE1->getPredicate(); local
1225 pred = CmpInst::getInversePredicate(pred);
1226 return ConstantExpr::getCompare(pred, CE1->getOperand(0),
1573 ICmpInst::Predicate pred = ICmpInst::ICMP_EQ; local
1574 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
1576 return pred;
1577 pred
1810 ConstantFoldCompareInstruction(unsigned short pred, Constant *C1, Constant *C2) argument
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/
H A Derase_fn_imps.hpp79 erase_if(Pred pred) argument
87 if (pred(p_e->m_value))
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
H A Dsplit_join_fn_imps.hpp51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument
68 node_pointer p_out = base_type::prune(pred);
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/
H A Derase_fn_imps.hpp117 erase_if(Pred pred) argument
129 const size_type left = partition(pred_t(pred));
226 partition(Pred pred) argument
235 if (!pred(m_a_entries[left]))
237 else if (pred(m_a_entries[right]))
/freebsd-11-stable/contrib/gcc/
H A Dpostreload-gcse.c134 edge pred;
921 edge pred;
927 FOR_EACH_EDGE (pred, ei, bb->preds)
929 if ((pred->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (pred))
932 if (JUMP_TABLE_DATA_P (BB_END (pred->src)))
968 edge pred;
996 FOR_EACH_EDGE (pred, ei, bb->preds)
1002 pred_bb = pred->src;
1017 || reg_killed_on_edge (avail_reg, pred)
133 edge pred; member in struct:unoccr
905 edge pred; local
952 edge pred; local
[all...]
H A Dweb.c74 while (element->pred)
75 element = element->pred;
76 while (element1->pred)
78 element2 = element1->pred;
79 element1->pred = element;
96 second->pred = first;
H A Dgensupport.c786 rtx pred, insn, pattern, split;
805 pred = copy_rtx (XVECEXP (ce_elem->data, 0, 0));
806 pred = alter_predicate_for_insn (pred, alternatives, max_operand,
808 if (pred == NULL)
815 XEXP (pattern, 0) = pred;
859 XEXP (pattern, 0) = pred;
877 XEXP (pattern, 0) = pred;
1309 add_predicate (struct pred_data *pred)
1311 void **slot = htab_find_slot (predicate_table, pred, INSER
783 rtx pred, insn, pattern, split; local
1304 add_predicate(struct pred_data *pred) argument
1360 struct pred_data *pred; local
[all...]
H A Dgenrecog.c106 } pred; member in union:decision_test::__anon1329
370 struct pred_data *pred = xcalloc (sizeof (struct pred_data), 1);
375 pred->name = XSTR (desc, 0);
377 pred->special = 1;
384 pred->codes[i] = true;
386 pred->allows_non_const = true;
393 pred->allows_non_lvalue = true;
396 pred->singleton = UNKNOWN;
399 pred->singleton = i;
403 add_predicate (pred);
369 struct pred_data *pred = xcalloc (sizeof (struct pred_data), 1); local
664 const struct pred_data *pred; local
996 const struct pred_data *pred; local
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
H A Derase_fn_imps.hpp75 erase_if(Pred pred) argument
87 if (!pred(*source_it))
104 if (!pred(*source_it))
/freebsd-11-stable/contrib/amd/amd/
H A Dsched.c69 ins_que(qelem *elem, qelem *pred) argument
71 qelem *p = pred->q_forw;
73 elem->q_back = pred;
75 pred->q_forw = elem;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/
H A Derase_fn_imps.hpp117 prune(Pred pred) argument
125 if (pred(p_cur->m_value))
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/
H A Dsplit_join_fn_imps.hpp51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument
68 node_pointer p_out = base_type::prune(pred);
/freebsd-11-stable/bin/ed/
H A Ded.h159 /* REQUE: link pred before succ */
160 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred)
162 /* INSQUE: insert elem in circular queue after pred */
163 #define INSQUE(elem, pred) \
165 REQUE((elem), (pred)->q_forw); \
166 REQUE((pred), elem); \
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/lockstat/
H A Dlockstat.c582 predicate_add(char **pred, char *what, char *cmp, uintptr_t value) argument
590 if (*pred == NULL) {
591 *pred = malloc(1);
592 *pred[0] = '\0';
595 len = strlen(*pred);
599 if (*pred[0] != '\0') {
602 *pred, what, cmp, (void *)value);
604 (void) sprintf(new, "(%s) && (%s)", *pred, what);
615 free(*pred);
616 *pred
620 predicate_destroy(char **pred) argument
697 char *pred = NULL; local
[all...]

Completed in 248 milliseconds

12345