/freebsd-10.2-release/contrib/gcclibs/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;
|
/freebsd-10.2-release/contrib/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;
|
/freebsd-10.2-release/tools/regression/ia64/emulated/ |
H A D | brl.t | 40 local ($nr, $type, $pred, $var) = @_; 41 local $test = "${type}_${pred}_${var}"; 45 $st = system("cc -o $tmpfile -DTYPE=$type -DPRED=$pred -DVAR=$var -Wall -O1 -g $srcdir/test.c"); 92 foreach $pred (@preds) { 94 run ++$nr, $type, $pred, $var;
|
H A D | test.c | 107 assemble_brl_cond(union bundle *b, int pred, unsigned long tgt) argument 113 mc_patch(b, pred ? 1 : 0, 18, 1); 137 test_cond(int pred, union bundle *src, union bundle *dst) argument 139 assemble_epilogue(dst, pred ? 0 : 2); 140 assemble_brl_cond(src, pred ? 1 : 0, (unsigned long)dst); 141 assemble_epilogue(src + 1, !pred ? 0 : 2);
|
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | split_join_fn_imps.hpp | 51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument 59 base_type::split(pred, other);
|
H A D | erase_fn_imps.hpp | 95 erase_if(Pred pred) argument 98 const size_type ersd = base_type::erase_if(pred);
|
/freebsd-10.2-release/lib/libc/stdlib/ |
H A D | insque.c | 21 insque(void *element, void *pred) argument 26 prev = (struct que_elem *)pred;
|
/freebsd-10.2-release/sys/netinet/ |
H A D | sctp_bsd_addr.h | 63 void sctp_add_or_del_interfaces(int (*pred) (struct ifnet *), int add);
|
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | erase_fn_imps.hpp | 65 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-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | erase_fn_imps.hpp | 88 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-10.2-release/contrib/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 1018 // cmp pred ^ true -> cmp !pred 1020 CmpInst::Predicate pred = (CmpInst::Predicate)CE1->getPredicate(); local 1021 pred = CmpInst::getInversePredicate(pred); 1022 return ConstantExpr::getCompare(pred, CE1->getOperand(0), 1350 ICmpInst::Predicate pred = ICmpInst::ICMP_EQ; local 1351 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2)); 1353 return pred; 1354 pred 1572 ConstantFoldCompareInstruction(unsigned short pred, Constant *C1, Constant *C2) argument [all...] |
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | erase_fn_imps.hpp | 79 erase_if(Pred pred) argument 87 if (pred(p_e->m_value))
|
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | split_join_fn_imps.hpp | 51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument 68 node_pointer p_out = base_type::prune(pred);
|
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | erase_fn_imps.hpp | 117 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-10.2-release/contrib/gcc/ |
H A D | postreload-gcse.c | 134 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 D | web.c | 74 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 D | gensupport.c | 786 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 D | genrecog.c | 106 } pred; member in union:decision_test::__anon1149 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-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | erase_fn_imps.hpp | 75 erase_if(Pred pred) argument 87 if (!pred(*source_it)) 104 if (!pred(*source_it))
|
/freebsd-10.2-release/contrib/amd/amd/ |
H A D | sched.c | 73 ins_que(qelem *elem, qelem *pred) argument 75 qelem *p = pred->q_forw; 77 elem->q_back = pred; 79 pred->q_forw = elem;
|
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | erase_fn_imps.hpp | 117 prune(Pred pred) argument 125 if (pred(p_cur->m_value))
|
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | split_join_fn_imps.hpp | 51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument 68 node_pointer p_out = base_type::prune(pred);
|
/freebsd-10.2-release/bin/ed/ |
H A D | ed.h | 159 /* 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-10.2-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | ExplodedGraph.cpp | 101 const ExplodedNode *pred = *(node->pred_begin()); local 102 if (pred->succ_size() != 1) 125 ProgramStateRef pred_state = pred->getState(); 127 progPoint.getLocationContext() != pred->getLocationContext()) 165 ExplodedNode *pred = *(node->pred_begin()); local 167 pred->replaceSuccessor(succ); 168 succ->replacePredecessor(pred);
|
/freebsd-10.2-release/cddl/contrib/opensolaris/cmd/lockstat/ |
H A D | lockstat.c | 558 predicate_add(char **pred, char *what, char *cmp, uintptr_t value) argument 566 if (*pred == NULL) { 567 *pred = malloc(1); 568 *pred[0] = '\0'; 571 len = strlen(*pred); 575 if (*pred[0] != '\0') { 578 *pred, what, cmp, (void *)value); 580 (void) sprintf(new, "(%s) && (%s)", *pred, what); 591 free(*pred); 592 *pred 596 predicate_destroy(char **pred) argument 673 char *pred = NULL; local [all...] |