/haiku-buildtools/binutils/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
|
H A D | dv-imply.s | 6 .pred.rel.imply p1, p2 13 .pred.rel.imply p1, p2 36 .pred.rel.imply p1,p3
|
/haiku-buildtools/legacy/binutils/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
|
H A D | dv-imply.s | 6 .pred.rel.imply p1, p2 13 .pred.rel.imply p1, p2 36 .pred.rel.imply p1,p3
|
/haiku-buildtools/legacy/gcc/libiberty/ |
H A D | insque.c | 15 void insque (struct qelem *elem, struct qelem *pred) 33 insque (elem, pred) 35 struct qelem *pred; 37 elem -> q_forw = pred -> q_forw; 38 pred -> q_forw -> q_back = elem; 39 elem -> q_back = pred; 40 pred -> q_forw = elem;
|
/haiku-buildtools/binutils/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;
|
/haiku-buildtools/gcc/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;
|
/haiku-buildtools/legacy/binutils/libiberty/ |
H A D | insque.c | 6 @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;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr8781.C | 8 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);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr59350-2.c | 13 extern int pred (ZVALUE); 21 return pred (z) ? -1 : 0;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | 20031022-1.c | 10 edge pred; member in struct:basic_block_def 19 e = (&entry_exit_blocks[1])->pred; 24 e = (&entry_exit_blocks[1])->pred; 28 /* There should be one load from entry_exit_blocks[1].pred. */ 29 /* { dg-final { scan-tree-dump-times "entry_exit_blocks.1..pred" 1 "dom1"} } */
|
/haiku-buildtools/gcc/gcc/cp/ |
H A D | type-utils.h | 34 find_type_usage (tree t, bool (*pred) (const_tree)) 37 if (pred (t)) 46 return find_type_usage (TREE_TYPE (t), pred); 50 (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (t)), pred);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partition/ |
H A D | 1.cc | 46 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 D | moveable.cc | 66 Pred pred; local 68 VERIFY(partition(fcon.begin(), fcon.end(), pred).ptr - farray == N/2); 70 VERIFY(pred(*i)); 73 VERIFY(!pred(*i)); 75 VERIFY(partition(bcon.begin(), bcon.end(), pred).ptr - barray == N/2); 78 VERIFY(pred(*i)); 80 VERIFY(!pred(*i));
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr63209.c | 13 const unsigned pred = Select(top[1], left, top[0]); local 14 return pred; 20 const unsigned pred = Predictor(left, top /*+ 1*/); local 21 if (pred == left)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/ |
H A D | median.cc | 23 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);
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | split_join_fn_imps.hpp | 45 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument 52 base_type::split(pred, other);
|
H A D | erase_fn_imps.hpp | 89 erase_if(Pred pred) argument 92 const size_type ersd = base_type::erase_if(pred);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/replace_copy_if/ |
H A D | 1.cc | 33 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);
|
/haiku-buildtools/gcc/contrib/ |
H A D | analyze_brprob | 103 pred=$0 104 sub (/^ .* heuristics: /,"",pred) 105 sub (/. exec [0-9]* hit [0-9]* (.*.)$/,"",pred) 113 if (int(pred) < 50.0)
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | erase_fn_imps.hpp | 59 erase_if(Pred pred) argument 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 75 if (pred(p_e->m_p_next->m_value))
|