Searched refs:succ (Results 1 - 25 of 34) sorted by relevance

12

/freebsd-9.3-release/contrib/ntp/sntp/libopts/
H A Dreset.c80 tSuccess succ; local
108 succ = opt_find_short(pOpts, (uint8_t)*pzArg, &opt_state);
109 if (! SUCCESSFUL(succ)) {
116 succ = opt_find_long(pOpts, pzArg, &opt_state);
117 if (! SUCCESSFUL(succ)) {
/freebsd-9.3-release/contrib/gcc/
H A Dtree-cfgcleanup.c263 edge e, succ; local
321 succ = single_succ_edge (bb);
322 dest = succ->dest;
383 edge succ = single_succ_edge (bb), e, s; local
384 basic_block dest = succ->dest;
436 if (!phi_alternatives_equal (dest, succ, s))
458 add_phi_arg (phi, PHI_ARG_DEF (phi, succ->dest_idx), s);
634 edge succ = single_succ_edge (bb); local
635 basic_block dest = succ->dest;
665 if (phi_alternatives_equal (dest, s, succ))
[all...]
H A Dcfgloopanal.c67 struct edge *pred, *succ; member in struct:vertex
96 && !g->vertices[i].succ)
105 for (e = g->vertices[i].succ; e; e = e->succ_next)
138 e->succ_next = g->vertices[f].succ;
139 g->vertices[f].succ = e;
159 #define FST_EDGE(V) (forward ? g->vertices[(V)].succ : g->vertices[(V)].pred)
234 for (e = g->vertices[i].succ; e; e = e->succ_next)
247 for (e = g->vertices[i].succ; e; e = n)
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;
431 succ = e->dest->index;
435 fprintf (f, "*p* No index for edge from %d to %d\n", pred, succ);
442 if (INDEX_EDGE_SUCC_BB (elist, index)->index != succ)
444 index, succ, INDEX_EDGE_SUCC_BB (elist, index)->index);
485 find_edge (basic_block pred, basic_block succ)
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;
197 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
199 sbitmap_copy (earliest[x], antin[succ->index]);
202 if (succ == EXIT_BLOCK_PTR)
206 sbitmap_difference (difference, antin[succ->index],
567 basic_block pred, succ;
577 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
578 if (succ == EXIT_BLOCK_PTR)
587 st_antin[succ
186 basic_block pred, succ; local
566 basic_block pred, succ; local
[all...]
H A Dgcov.c118 arc_t *succ; member in struct:block_info
597 for (arc = block->succ; arc; arc = arc_n)
797 if (src >= fn->num_blocks || fn->blocks[src].succ)
819 arc->succ_next = fn->blocks[src].succ;
820 fn->blocks[src].succ = arc;
936 for (arc_p = NULL, arc = fn->blocks[ix].succ; arc;
942 fn->blocks[ix].succ = arc_p;
1109 for (arc = blk->succ; arc; arc = arc->succ_next)
1130 for (arc = blk->succ; arc; arc = arc->succ_next)
1152 arc_t *start = blk->succ;
[all...]
H A Dddg.c789 find_successors (sbitmap succ, ddg_ptr g, sbitmap ops)
797 sbitmap_a_or_b (succ, succ, node_succ);
801 sbitmap_difference (succ, succ, ops);
786 find_successors(sbitmap succ, ddg_ptr g, sbitmap ops) argument
H A Dglobal.c2352 basic_block bb, succ;
2399 succ = e->dest;
2400 if (succ->index != EXIT_BLOCK
2401 && !TEST_BIT (wset, succ->index))
2403 SET_BIT (wset, succ->index);
2404 VEC_quick_push (basic_block, new_bbs, succ);
2337 basic_block bb, succ; local
H A Dcfgloop.c64 edge succ;
68 FOR_EACH_EDGE (succ, ei, bb->succs)
69 fprintf (file, "%d ", succ->dest->index);
63 edge succ; local
/freebsd-9.3-release/contrib/libpcap/
H A Dgencode.h233 struct block *succ; member in struct:edge
340 #define JT(b) ((b)->et.succ)
341 #define JF(b) ((b)->ef.succ)
H A Doptimize.c266 if (ep->succ) {
267 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);
268 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
1246 * Return true if any register that is used on exit from 'succ', has
1251 use_conflict(struct block *b, struct block *succ) argument
1254 atomset use = succ->out_use;
1261 if (b->val[atom] != succ->val[atom])
1324 if (JT(ep->succ) == 0)
1327 if (JT(ep->succ) == JF(ep->succ)) {
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp105 const ExplodedNode *succ = *(node->succ_begin()); local
106 if (succ->pred_size() != 1)
151 const ProgramPoint SuccLoc = succ->getLocation();
166 ExplodedNode *succ = *(node->succ_begin()); local
167 pred->replaceSuccessor(succ);
168 succ->replacePredecessor(pred);
H A DCoreEngine.cpp376 if (const CFGBlock *succ = *it) {
377 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
/freebsd-9.3-release/usr.bin/make/
H A Dmake.c463 GNode *succ = Lst_Datum(ln); local
465 if (succ->make && succ->unmade == 0 && succ->made == UNMADE &&
466 Lst_Member(&toBeMade, succ) == NULL) {
467 Lst_EnQueue(&toBeMade, succ);
/freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/
H A DRegionIterator.h70 RegionNode *succ; local
71 succ = getNode()->getParent()->getNode(BB);
72 assert(succ && "BB not in Region or entered subregion!");
73 return succ;
H A DDependenceAnalysis.h196 void setNextSuccessor(const Dependence *succ) { argument
197 NextSuccessor = succ;
/freebsd-9.3-release/bin/ed/
H A Ded.h159 /* REQUE: link pred before succ */
160 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred)
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp148 MachineBasicBlock* succ = *BB->succ_begin(); local
150 MachineBasicBlock::iterator start = succ->begin();
151 while (start != succ->end() && start->isPHI()) {
H A DMachineBasicBlock.cpp482 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { argument
492 Successors.push_back(succ);
493 succ->addPredecessor(this);
496 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { argument
497 succ->removePredecessor(this);
498 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DSink.cpp206 Loop *succ = LI->getLoopFor(SuccToSinkTo);
208 if (succ != 0 && succ != cur)
/freebsd-9.3-release/sys/contrib/ngatm/netnatm/api/
H A Dcc_user.c1617 struct atm_add_party_success *succ; local
1622 succ = CCZALLOC(sizeof(*succ));
1623 if (succ == NULL)
1626 succ->leaf_ident = leaf_ident;
1628 succ, sizeof(*succ));
1630 CCFREE(succ);
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp97 if (const CFGBlock *succ = *i)
98 worklist.push_back(succ);
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h357 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
358 /// The Predecessors list of succ is automatically updated. WEIGHT
364 void addSuccessor(MachineBasicBlock *succ, uint32_t weight = 0);
367 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
369 void removeSuccessor(MachineBasicBlock *succ);
372 /// this MachineBasicBlock. The Predecessors list of succ is automatically
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Analysis/
H A DLiveVariables.cpp562 if (const CFGBlock *succ = *it) {
563 val = LV->merge(val, LV->blocksBeginToLiveness[succ]);
/freebsd-9.3-release/contrib/wpa/wpa_supplicant/dbus/
H A Ddbus_new.c121 dbus_bool_t succ; local
135 succ = success ? TRUE : FALSE;
136 if (dbus_message_append_args(msg, DBUS_TYPE_BOOLEAN, &succ,

Completed in 202 milliseconds

12