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

12

/freebsd-11-stable/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-11-stable/contrib/netbsd-tests/net/icmp/
H A Dt_ping.c151 int loop, succ; local
179 succ = 0;
191 succ++;
199 return succ;
208 int succ; local
227 succ = doping("1.1.1.10", LOOPS, 56);
228 printf("got %d/%d\n", succ, LOOPS);
244 int succ; local
255 succ = doping("1.1.1.20", LOOPS, 56);
259 succ
277 int succ, i; local
[all...]
/freebsd-11-stable/contrib/netbsd-tests/rump/kernspace/
H A Dalloc.c83 int succ, i; local
108 for (succ = 0;; succ++) {
109 if (succ * 1024 > thelimit)
/freebsd-11-stable/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 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 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 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
H A Dbasic-block.h566 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
569 block which is either the pred or succ end of the indexed edge. */
H A Dbb-reorder.c1691 edge succ;
1700 succ = EDGE_SUCC (cur_bb, 0);
1706 && (succ->flags & EDGE_CROSSING))
1690 edge succ; local
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp97 const ExplodedNode *succ = *(node->succ_begin()); local
98 if (succ->pred_size() != 1)
143 const ProgramPoint SuccLoc = succ->getLocation();
162 ExplodedNode *succ = *(node->succ_begin()); local
163 pred->replaceSuccessor(succ);
164 succ->replacePredecessor(pred);
H A DCoreEngine.cpp334 if (const CFGBlock *succ = *it) {
335 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionIterator.h83 NodeRef succ; local
84 succ = getNode()->getParent()->getNode(BB);
85 assert(succ && "BB not in Region or entered subregion!");
86 return succ;
H A DDependenceAnalysis.h194 void setNextSuccessor(const Dependence *succ) { NextSuccessor = succ; } argument
/freebsd-11-stable/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-11-stable/contrib/libpcap/
H A Dgencode.h238 struct block *succ; member in struct:edge
387 #define JT(b) ((b)->et.succ)
388 #define JF(b) ((b)->ef.succ)
H A Doptimize.c435 if (ep->succ) {
436 SET_INTERSECT(ep->succ->et.edom, ep->edom, opt_state->edgewords);
437 SET_INTERSECT(ep->succ->ef.edom, ep->edom, opt_state->edgewords);
1467 * Return true if any register that is used on exit from 'succ', has
1472 use_conflict(struct block *b, struct block *succ) argument
1475 atomset use = succ->out_use;
1482 if (b->val[atom] != succ->val[atom])
1545 if (JT(ep->succ) == 0)
1548 if (JT(ep->succ) == JF(ep->succ)) {
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp131 MachineBasicBlock* succ = *BB->succ_begin(); local
133 MachineBasicBlock::iterator start = succ->begin();
134 while (start != succ->end() && start->isPHI()) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSink.cpp126 Loop *succ = LI.getLoopFor(SuccToSinkTo);
128 if (succ != nullptr && succ != cur)
/freebsd-11-stable/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-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp97 if (const CFGBlock *succ = *i)
98 worklist.push_back(succ);
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DLiveVariables.cpp596 if (const CFGBlock *succ = *it) {
597 val = LV->merge(val, LV->blocksBeginToLiveness[succ]);

Completed in 316 milliseconds

12