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

1234567

/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/ia64/
H A Dpred-rel.s1 // 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 Ddv-safe.s7 .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 Ddv-mutex-err.s11 .pred.rel.mutex p1, p2
17 .pred.rel.mutex p1, p2
23 .pred.rel.mutex p1, p2
29 .pred.rel.mutex p1, p2
H A Ddv-imply.s6 .pred.rel.imply p1, p2
13 .pred.rel.imply p1, p2
36 .pred.rel.imply p1,p3
/netbsd-6-1-5-RELEASE/external/ibm-public/postfix/dist/src/util/
H A Dring.c84 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 Dring.h23 RING *pred; /* predecessor */ member in struct:RING
32 #define ring_pred(c) ((c)->pred)
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/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;
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/tree-ssa/
H A Dpr8781.C8 const predicate &pred; member in class:noop_t
10 explicit noop_t(const predicate &p) : pred(p) {}
12 int operator()() const { return pred(); }
16 inline noop_t<predicate> noop(const predicate pred) { argument
17 return noop_t<predicate>(pred);
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/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;
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/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;
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/libiberty/
H A Dinsque.c7 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-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/tree-ssa/
H A D20031022-1.c10 edge pred; member in struct:basic_block_def
17 e = (&entry_exit_blocks[1])->pred;
22 e = (&entry_exit_blocks[1])->pred;
26 /* There should be one load from entry_exit_blocks[1].pred. */
27 /* { dg-final { scan-tree-dump-times "entry_exit_blocks.1..pred" 1 "dom1"} } */
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.dg/tree-ssa/
H A D20031022-1.c10 edge pred; member in struct:basic_block_def
17 e = (&entry_exit_blocks[1])->pred;
22 e = (&entry_exit_blocks[1])->pred;
26 /* There should be one load from entry_exit_blocks[1].pred. */
27 /* { dg-final { scan-tree-dump-times "entry_exit_blocks.1..pred" 1 "dom1"} } */
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/partition/
H A D1.cc46 Pred pred; local
47 int* m = partition(s1, s1 + N, pred);
48 for (const int* i = s1; i < m; ++i) VERIFY(pred(*i));
49 for (const int* i = m; i < s1 + N; ++i) VERIFY(!pred(*i));
H A Dmoveable.cc71 Pred pred; local
73 VERIFY(partition(fcon.begin(), fcon.end(), pred).ptr - farray == N/2);
75 VERIFY(pred(*i));
78 VERIFY(!pred(*i));
80 VERIFY(partition(bcon.begin(), bcon.end(), pred).ptr - barray == N/2);
83 VERIFY(pred(*i));
85 VERIFY(!pred(*i));
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/
H A Derase_fn_imps.hpp65 erase_if(Pred pred) argument
67 return (my_base::erase_if(pred));
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/ext/
H A Dmedian.cc23 bool pred(const int& l, const int& r) function
35 VERIFY(__median(i, j, k) == j && __median(i, j, k, pred) == j);
36 VERIFY(__median(i, k, j) == j && __median(i, k, j, pred) == j);
37 VERIFY(__median(j, i, k) == j && __median(j, i, k, pred) == j);
38 VERIFY(__median(j, k, i) == j && __median(j, k, i, pred) == j);
39 VERIFY(__median(k, i, j) == j && __median(k, i, j, pred) == j);
40 VERIFY(__median(k, j, i) == j && __median(k, j, i, pred) == j);
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/ext/
H A Dmedian.cc24 bool pred(const int& l, const int& r) function
36 VERIFY(__median(i, j, k) == j && __median(i, j, k, pred) == j);
37 VERIFY(__median(i, k, j) == j && __median(i, k, j, pred) == j);
38 VERIFY(__median(j, i, k) == j && __median(j, i, k, pred) == j);
39 VERIFY(__median(j, k, i) == j && __median(j, k, i, pred) == j);
40 VERIFY(__median(k, i, j) == j && __median(k, i, j, pred) == j);
41 VERIFY(__median(k, j, i) == j && __median(k, j, i, pred) == j);
/netbsd-6-1-5-RELEASE/lib/libc/stdlib/
H A Dinsque.c43 insque(entry, pred)
45 void *pred;
48 struct qelem *p = (struct qelem *) pred;
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/partition/
H A Dpartition.cc47 Pred pred; local
48 int* m = partition(s1, s1 + N, pred);
49 for (const int* i = s1; i < m; ++i) VERIFY(pred(*i));
50 for (const int* i = m; i < s1 + N; ++i) VERIFY(!pred(*i));
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Dsplit_join_fn_imps.hpp45 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument
53 base_type::split(pred, other);
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/replace_copy_if/
H A D1.cc33 pred(int i) function
43 out_con.begin(), pred, 1).ptr == out);
53 out_con.begin(), pred, 2).ptr == out + 1);
64 out_con.begin(), pred, 2).ptr == out + 6);
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/replace_copy_if/
H A D1.cc34 pred(int i) function
44 out_con.begin(), pred, 1).ptr == out);
54 out_con.begin(), pred, 2).ptr == out + 1);
65 out_con.begin(), pred, 2).ptr == out + 6);
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/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)
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/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)

Completed in 178 milliseconds

1234567