Searched refs:pred (Results 26 - 50 of 108) sorted by relevance

12345

/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp101 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-9.3-release/contrib/gcc/
H A Dgenrecog.c106 } pred; member in union:decision_test::__anon1167
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...]
H A Dpredict.c528 struct edge_prediction *pred; local
565 for (pred = bb->predictions; pred; pred = pred->ep_next)
567 int predictor = pred->ep_predictor;
568 int probability = pred->ep_probability;
570 if (pred->ep_edge != first)
611 for (pred = bb->predictions; pred; pre
1195 enum br_predictor pred; local
1473 predict_paths_leading_to(basic_block bb, int *heads, enum br_predictor pred, enum prediction taken) argument
[all...]
H A Dcfganal.c330 pred and succ that edge represents can be determined, or
331 given a pred and a succ, its index number can be returned.
333 represent the normally full matrix of edge (pred,succ) with a
334 single indexed vector, edge (EDGE_INDEX (pred, succ)), with no
421 int pred, succ, index;
430 pred = e->src->index;
435 fprintf (f, "*p* No index for edge from %d to %d\n", pred, succ);
439 if (INDEX_EDGE_PRED_BB (elist, index)->index != pred)
441 index, pred, INDEX_EDGE_PRED_BB (elist, index)->index);
485 find_edge (basic_block pred, basic_bloc
418 int pred, succ, index; local
482 find_edge(basic_block pred, basic_block succ) argument
507 find_edge_index(struct edge_list *edge_list, basic_block pred, basic_block succ) argument
[all...]
H A Dlcm.c95 This is done based on the flow graph, and not on the pred-succ lists.
187 basic_block pred, succ;
196 pred = INDEX_EDGE_PRED_BB (edge_list, x);
198 if (pred == ENTRY_BLOCK_PTR)
207 avout[pred->index]);
208 sbitmap_not (temp_bitmap, antout[pred->index]);
210 kill[pred->index], temp_bitmap);
567 basic_block pred, succ;
576 pred = INDEX_EDGE_PRED_BB (edge_list, x);
579 sbitmap_copy (farthest[x], st_avout[pred
186 basic_block pred, succ; local
566 basic_block pred, succ; local
[all...]
H A Dcfgloop.c100 && loop->pred[outer->depth] == outer);
114 return loop->pred[depth];
183 if (loop->pred)
184 free (loop->pred);
338 if (loop->pred)
339 free (loop->pred);
340 loop->pred = XNEWVEC (struct loop *, loop->depth);
341 memcpy (loop->pred, father->pred, sizeof (struct loop *) * father->depth);
342 loop->pred[fathe
[all...]
H A Dcfgloopanal.c67 struct edge *pred, *succ; member in struct:vertex
95 if (!g->vertices[i].pred
100 for (e = g->vertices[i].pred; e; e = e->pred_next)
135 e->pred_next = g->vertices[t].pred;
136 g->vertices[t].pred = e;
159 #define FST_EDGE(V) (forward ? g->vertices[(V)].succ : g->vertices[(V)].pred)
325 cloop = act->loop_father->pred[depth];
H A Dtree-ssa-pre.c352 /* A three tuple {e, pred, v} used to cache phi translations in the
361 basic_block pred; member in struct:expr_pred_trans_d
370 /* The hashcode for the expression, pred pair. This is cached for
392 basic_block b1 = ve1->pred;
393 basic_block b2 = ve2->pred;
429 phi_trans_lookup (tree e, basic_block pred, VEC (tree, gc) *vuses) argument
435 ept.pred = pred;
437 ept.hashcode = vn_compute (e, (unsigned long) pred);
451 phi_trans_add (tree e, tree v, basic_block pred, VE argument
1032 phi_translate(tree expr, value_set_t set, basic_block pred, basic_block phiblock) argument
1395 phi_translate_set(value_set_t dest, value_set_t set, basic_block pred, basic_block phiblock) argument
2489 edge pred; local
2690 edge pred; local
[all...]
H A Dcfgloopmanip.c203 basic_block pred = e->src; local
209 if (TEST_BIT (in_queue, pred->index))
215 nca = find_common_loop (pred->loop_father, base_loop);
216 if (pred->loop_father != base_loop
218 || nca != pred->loop_father))
219 pred = pred->loop_father->header;
220 else if (!flow_loop_nested_p (from->loop_father, pred->loop_father))
226 if (TEST_BIT (in_queue, pred->index))
230 *qend = pred;
[all...]
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/
H A Derase_fn_imps.hpp140 erase_if(Pred pred) argument
153 node_pointer p_out = base_type::prune(pred);
H A Dbinomial_heap_base_.hpp165 erase_if(Pred pred);
169 split(Pred pred, PB_DS_CLASS_C_DEC& other);
H A Dsplit_join_fn_imps.hpp51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument
68 node_pointer p_out = base_type::prune(pred);
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/
H A Dpairing_heap_.hpp171 erase_if(Pred pred);
175 split(Pred pred, PB_DS_CLASS_C_DEC& other);
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Drc_binomial_heap_.hpp147 erase_if(Pred pred);
151 split(Pred pred, PB_DS_CLASS_C_DEC& other);
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp93 erase_if(Pred pred) argument
100 if (pred(*it))
/freebsd-9.3-release/usr.sbin/mount_portalfs/
H A Dconf.c71 * just after (pred)
73 static void ins_que(qelem *elem, qelem *pred) argument
75 qelem *p = pred->q_forw;
76 elem->q_back = pred;
78 pred->q_forw = elem;
/freebsd-9.3-release/contrib/libpcap/
H A Doptimize.c1179 memcpy((char *)b->val, (char *)p->pred->val, sizeof(b->val));
1190 if (b->val[i] != p->pred->val[i])
1284 aval1 = ep->pred->val[A_ATOM];
1285 oval1 = ep->pred->oval;
1332 if (!use_conflict(ep->pred, ep->succ->et.succ)) {
1358 if (target != 0 && !use_conflict(ep->pred, target)) {
1389 val = ep->pred->val[A_ATOM];
1391 if (val != ep->pred->val[A_ATOM])
1394 if (JT(b->in_edges->pred) == b)
1395 diffp = &JT(b->in_edges->pred);
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/
H A DCloneFunction.cpp436 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
437 Value *V = VMap[PN->getIncomingBlock(pred)];
439 Value *InVal = MapValue(PN->getIncomingValue(pred),
443 PN->setIncomingValue(pred, InVal);
444 PN->setIncomingBlock(pred, MappedBlock);
446 PN->removeIncomingValue(pred, false);
447 --pred, --e; // Revisit the next entry.
557 // Move all the instructions in the succ to the pred
[all...]
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/
H A Dsplit_join_fn_imps.hpp51 split(Pred pred, PB_DS_CLASS_C_DEC& other) argument
63 const size_type left = partition(pred_t(pred));
H A Dbinary_heap_.hpp228 erase_if(Pred pred);
253 split(Pred pred, PB_DS_CLASS_C_DEC& other);
315 partition(Pred pred);
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/
H A Derase_fn_imps.hpp243 erase_if(Pred pred) argument
256 node_pointer p_out = base_type::prune(pred);
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DCheckerContext.h89 ExplodedNode *pred,
93 Pred(pred),
87 CheckerContext(NodeBuilder &builder, ExprEngine &eng, ExplodedNode *pred, const ProgramPoint &loc, bool wasInlined = false) argument
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/
H A Dilist.h599 template<class Pr1> void erase_if(Pr1 pred) { argument
602 if (pred(*I)) erase(I);
607 template<class Pr2> void unique(Pr2 pred) { argument
610 if (pred(*I))
619 template<class Pr3> void merge(iplist &right, Pr3 pred) { argument
623 if (pred(*first2, *first1)) {
634 template<class Pr3> void sort(Pr3 pred);
/freebsd-9.3-release/contrib/llvm/lib/IR/
H A DAsmWriter.cpp683 const char * pred = "unknown"; local
685 case FCmpInst::FCMP_FALSE: pred = "false"; break;
686 case FCmpInst::FCMP_OEQ: pred = "oeq"; break;
687 case FCmpInst::FCMP_OGT: pred = "ogt"; break;
688 case FCmpInst::FCMP_OGE: pred = "oge"; break;
689 case FCmpInst::FCMP_OLT: pred = "olt"; break;
690 case FCmpInst::FCMP_OLE: pred = "ole"; break;
691 case FCmpInst::FCMP_ONE: pred = "one"; break;
692 case FCmpInst::FCMP_ORD: pred = "ord"; break;
693 case FCmpInst::FCMP_UNO: pred
[all...]
/freebsd-9.3-release/contrib/amd/fsinfo/
H A Dfsi_util.c659 ins_que(qelem *elem, qelem *pred) argument
663 p = pred->q_forw;
664 elem->q_back = pred;
666 pred->q_forw = elem;

Completed in 300 milliseconds

12345