| /src/external/ibm-public/postfix/dist/src/util/ |
| ring.c | 83 ring->pred = ring->succ = ring;
91 entry->pred = ring;
92 ring->succ->pred = entry;
100 entry->pred = ring->pred;
102 ring->pred->succ = entry;
103 ring->pred = entry;
111 RING *pred = entry->pred; local
113 pred->succ = succ
[all...] |
| ring.h | 23 RING *pred; /* predecessor */ member in struct:RING
32 #define ring_pred(c) ((c)->pred)
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| 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)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
|
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| 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)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
|
| /src/external/gpl3/gcc/dist/libiberty/ |
| 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)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
|
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| 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)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
|
| /src/external/gpl3/gdb/dist/libiberty/ |
| 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)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
|
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| 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)
39 elem -> q_forw = pred -> q_forw;
40 pred -> q_forw -> q_back = elem;
41 elem -> q_back = pred;
42 pred -> q_forw = elem;
|
| /src/external/gpl3/gcc/dist/gcc/cp/ |
| type-utils.h | 23 /* Returns the first tree within T that is directly matched by PRED. T may be a
25 until a match is found. NULL is returned if PRED does not match any
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);
|
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| type-utils.h | 23 /* Returns the first tree within T that is directly matched by PRED. T may be a
25 until a match is found. NULL is returned if PRED does not match any
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);
|
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/ |
| 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,
85 template <typename Pred,
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, \
[all...] |
| /src/external/apache2/llvm/dist/clang/docs/analyzer/checkers/ |
| unix_api_example.c | 12 pthread_once_t pred = {0x30B1BCBA, {0}}; local
13 pthread_once(&pred, f);
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| 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);
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| 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);
|
| /src/lib/libc/stdlib/ |
| insque.c | 43 insque(void *entry, void *pred)
46 struct qelem *p = (struct qelem *) pred;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| split_join_fn_imps.hpp | 44 template<typename Pred>
47 split(Pred pred, PB_DS_CLASS_C_DEC& other)
54 base_type::split(pred, other);
|
| erase_fn_imps.hpp | 88 template<typename Pred>
91 erase_if(Pred pred)
94 const size_type ersd = base_type::erase_if(pred);
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| split_join_fn_imps.hpp | 44 template<typename Pred>
47 split(Pred pred, PB_DS_CLASS_C_DEC& other)
54 base_type::split(pred, other);
|
| erase_fn_imps.hpp | 88 template<typename Pred>
91 erase_if(Pred pred)
94 const size_type ersd = base_type::erase_if(pred);
|
| /src/external/gpl3/gdb.old/dist/gdb/guile/lib/gdb/ |
| iterator.scm | 64 (define-public (iterator-filter pred iter)
65 "Return the elements that satify predicate PRED."
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)
|
| /src/external/gpl3/gdb/dist/gdb/guile/lib/gdb/ |
| iterator.scm | 64 (define-public (iterator-filter pred iter)
65 "Return the elements that satisfy predicate PRED."
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)
|
| /src/external/gpl3/gdb.old/dist/gdbserver/ |
| dll.cc | 59 auto pred = [&] (const dll_info &dll) local
72 pred);
|
| /src/external/gpl3/gdb/dist/gdbserver/ |
| dll.cc | 59 auto pred = [&] (const dll_info &dll) local
72 pred);
|
| /src/external/gpl3/gcc/dist/gcc/config/arm/ |
| arm_cde.h | 159 #define __arm_vcx1q_m(coproc, inactive, imm, pred) \
160 __builtin_arm_vcx1q_p_v16qi(coproc, inactive, imm, pred)
161 #define __arm_vcx1qa_m(coproc, acc, imm, pred) \
162 __builtin_arm_vcx1qa_p_v16qi(coproc, acc, imm, pred)
164 #define __arm_vcx2q_m(coproc, inactive, n, imm, pred) \
165 __builtin_arm_vcx2q_p_v16qi(coproc, inactive, n, imm, pred)
166 #define __arm_vcx2qa_m(coproc, acc, n, imm, pred) \
167 __builtin_arm_vcx2qa_p_v16qi(coproc, acc, n, imm, pred)
169 #define __arm_vcx3q_m(coproc, inactive, n, m, imm, pred) \
170 __builtin_arm_vcx3q_p_v16qi(coproc, inactive, n, m, imm, pred)
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/ |
| erase_fn_imps.hpp | 58 template<typename Pred>
61 erase_if(Pred pred)
66 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
77 if (pred(p_e->m_p_next->m_value))
|
