/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/ia64/ |
H A D | pred-rel.s | 1 // Make sure all forms of .pred.rel are accepted 3 .pred.rel "mutex", p1, p2 4 .pred.rel "imply", p2, p3 5 .pred.rel "clear", p1, p2, p3 7 .pred.rel "mutex" p1, p2 8 .pred.rel "imply" p2, p3 9 .pred.rel "clear" p1, p2, p3 11 .pred.rel.mutex p1, p2 12 .pred.rel.imply p2, p3 13 .pred [all...] |
H A D | dv-safe.s | 7 .pred.safe_across_calls p1-p4 8 .pred.safe_across_calls p1,p2,p3,p4 9 .pred.safe_across_calls p1-p2,p3-p4 10 .pred.safe_across_calls p1-p3,p4
|
H A D | dv-mutex-err.s | 11 .pred.rel.mutex p1, p2 17 .pred.rel.mutex p1, p2 23 .pred.rel.mutex p1, p2 29 .pred.rel.mutex p1, p2
|
/netbsd-current/external/ibm-public/postfix/dist/src/util/ |
H A D | ring.c | 84 ring->pred = ring->succ = ring; 94 entry->pred = ring; 95 ring->succ->pred = entry; 105 entry->pred = ring->pred; 107 ring->pred->succ = entry; 108 ring->pred = entry; 117 RING *pred = entry->pred; local 119 pred [all...] |
H A D | ring.h | 23 RING *pred; /* predecessor */ member in struct:RING 32 #define ring_pred(c) ((c)->pred)
|
/netbsd-current/external/gpl3/gcc/dist/libiberty/ |
H A D | insque.c | 7 struct qelem *@var{pred}) 12 after @var{pred}. The @code{remque} routine removes @var{elem} from 37 insque (struct qelem *elem, struct qelem *pred) argument 39 elem -> q_forw = pred -> q_forw; 40 pred -> q_forw -> q_back = elem; 41 elem -> q_back = pred; 42 pred -> q_forw = elem;
|
/netbsd-current/external/gpl3/binutils/dist/libiberty/ |
H A D | insque.c | 7 struct qelem *@var{pred}) 12 after @var{pred}. The @code{remque} routine removes @var{elem} from 37 insque (struct qelem *elem, struct qelem *pred) argument 39 elem -> q_forw = pred -> q_forw; 40 pred -> q_forw -> q_back = elem; 41 elem -> q_back = pred; 42 pred -> q_forw = elem;
|
/netbsd-current/external/gpl3/gdb/dist/libiberty/ |
H A D | insque.c | 7 struct qelem *@var{pred}) 12 after @var{pred}. The @code{remque} routine removes @var{elem} from 37 insque (struct qelem *elem, struct qelem *pred) argument 39 elem -> q_forw = pred -> q_forw; 40 pred -> q_forw -> q_back = elem; 41 elem -> q_back = pred; 42 pred -> q_forw = elem;
|
/netbsd-current/external/gpl3/gdb.old/dist/libiberty/ |
H A D | insque.c | 7 struct qelem *@var{pred}) 12 after @var{pred}. The @code{remque} routine removes @var{elem} from 37 insque (struct qelem *elem, struct qelem *pred) argument 39 elem -> q_forw = pred -> q_forw; 40 pred -> q_forw -> q_back = elem; 41 elem -> q_back = pred; 42 pred -> q_forw = elem;
|
/netbsd-current/external/gpl3/binutils.old/dist/libiberty/ |
H A D | insque.c | 7 struct qelem *@var{pred}) 12 after @var{pred}. The @code{remque} routine removes @var{elem} from 37 insque (struct qelem *elem, struct qelem *pred) argument 39 elem -> q_forw = pred -> q_forw; 40 pred -> q_forw -> q_back = elem; 41 elem -> q_back = pred; 42 pred -> q_forw = elem;
|
/netbsd-current/external/gpl3/gcc.old/dist/libiberty/ |
H A D | insque.c | 7 struct qelem *@var{pred}) 12 after @var{pred}. The @code{remque} routine removes @var{elem} from 37 insque (struct qelem *elem, struct qelem *pred) argument 39 elem -> q_forw = pred -> q_forw; 40 pred -> q_forw -> q_back = elem; 41 elem -> q_back = pred; 42 pred -> q_forw = elem;
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/cp/ |
H A D | type-utils.h | 34 find_type_usage (tree t, bool (*pred) (const_tree)) 36 if (pred (t)) 45 return find_type_usage (TREE_TYPE (t), pred); 49 (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (t)), pred);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/cp/ |
H A D | type-utils.h | 34 find_type_usage (tree t, bool (*pred) (const_tree)) 36 if (pred (t)) 45 return find_type_usage (TREE_TYPE (t), pred); 49 (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (t)), pred);
|
/netbsd-current/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/ |
H A D | gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 107 #define GTEST_PRED1_(pred, v1, on_failure)\ 108 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 110 pred, \ 116 #define EXPECT_PRED1(pred, v1) \ 117 GTEST_PRED1_(pred, v 87 AssertPred1Helper(const char* pred_text, const char* e1, Pred pred, const T1& v1) argument 130 AssertPred2Helper(const char* pred_text, const char* e1, const char* e2, Pred pred, const T1& v1, const T2& v2) argument 180 AssertPred3Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, Pred pred, const T1& v1, const T2& v2, const T3& v3) argument 236 AssertPred4Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4) argument 298 AssertPred5Helper(const char* pred_text, const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, Pred pred, const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5) argument [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/docs/analyzer/checkers/ |
H A D | unix_api_example.c | 12 pthread_once_t pred = {0x30B1BCBA, {0}}; local 13 pthread_once(&pred, f);
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/analyzer/ |
H A D | reachability.h | 50 edge_t *pred; local 51 FOR_EACH_VEC_ELT (next->m_preds, i, pred) 53 if (!reachable_from_p (pred->m_src)) 55 worklist.safe_push (pred->m_src); 56 bitmap_set_bit (m_indices, pred->m_src->m_index);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/analyzer/ |
H A D | reachability.h | 50 edge_t *pred; local 51 FOR_EACH_VEC_ELT (next->m_preds, i, pred) 53 if (!reachable_from_p (pred->m_src)) 55 worklist.safe_push (pred->m_src); 56 bitmap_set_bit (m_indices, pred->m_src->m_index);
|
/netbsd-current/lib/libc/stdlib/ |
H A D | insque.c | 43 insque(void *entry, void *pred) argument 46 struct qelem *p = (struct qelem *) pred;
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | split_join_fn_imps.hpp | 47 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument 54 base_type::split(pred, other);
|
H A D | erase_fn_imps.hpp | 91 erase_if(Pred pred) argument 94 const size_type ersd = base_type::erase_if(pred);
|
/netbsd-current/external/gpl3/gdb.old/dist/gdbserver/ |
H A D | dll.cc | 43 auto pred = [&] (const dll_info &dll) local 55 auto iter = std::find_if (all_dlls.begin (), all_dlls.end (), pred);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | split_join_fn_imps.hpp | 47 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument 54 base_type::split(pred, other);
|
H A D | erase_fn_imps.hpp | 91 erase_if(Pred pred) argument 94 const size_type ersd = base_type::erase_if(pred);
|
/netbsd-current/external/gpl3/gdb.old/dist/gdb/guile/lib/gdb/ |
H A D | iterator.scm | 64 (define-public (iterator-filter pred iter) 69 ((pred next) (loop (cons next result))) 72 (define-public (iterator-until pred iter) 73 "Run the iterator until the result of (pred element) is true. 76 The result of the first (pred element) call that returns true, 80 ((pred next) => identity)
|
/netbsd-current/external/gpl3/gdb/dist/gdb/guile/lib/gdb/ |
H A D | iterator.scm | 64 (define-public (iterator-filter pred iter) 69 ((pred next) (loop (cons next result))) 72 (define-public (iterator-until pred iter) 73 "Run the iterator until the result of (pred element) is true. 76 The result of the first (pred element) call that returns true, 80 ((pred next) => identity)
|