Home
last modified time | relevance | path

Searched refs:succ (Results 1 – 25 of 41) sorted by relevance

12

/freebsd-9-stable/contrib/ntp/sntp/libopts/
Dreset.c80 tSuccess succ; in optionResetOpt() local
108 succ = opt_find_short(pOpts, (uint8_t)*pzArg, &opt_state); in optionResetOpt()
109 if (! SUCCESSFUL(succ)) { in optionResetOpt()
116 succ = opt_find_long(pOpts, pzArg, &opt_state); in optionResetOpt()
117 if (! SUCCESSFUL(succ)) { in optionResetOpt()
/freebsd-9-stable/contrib/gcc/
Dtree-cfgcleanup.c263 edge e, succ; in tree_forwarder_block_p() local
321 succ = single_succ_edge (bb); in tree_forwarder_block_p()
322 dest = succ->dest; in tree_forwarder_block_p()
383 edge succ = single_succ_edge (bb), e, s; in remove_forwarder_block() local
384 basic_block dest = succ->dest; in remove_forwarder_block()
436 if (!phi_alternatives_equal (dest, succ, s)) in remove_forwarder_block()
458 add_phi_arg (phi, PHI_ARG_DEF (phi, succ->dest_idx), s); in remove_forwarder_block()
634 edge succ = single_succ_edge (bb); in remove_forwarder_block_with_phi() local
635 basic_block dest = succ->dest; in remove_forwarder_block_with_phi()
665 if (phi_alternatives_equal (dest, s, succ)) in remove_forwarder_block_with_phi()
[all …]
Dlcm.c186 basic_block pred, succ; in compute_earliest() local
196 succ = INDEX_EDGE_SUCC_BB (edge_list, x); in compute_earliest()
198 sbitmap_copy (earliest[x], antin[succ->index]); in compute_earliest()
201 if (succ == EXIT_BLOCK_PTR) in compute_earliest()
205 sbitmap_difference (difference, antin[succ->index], in compute_earliest()
566 basic_block pred, succ; in compute_farthest() local
576 succ = INDEX_EDGE_SUCC_BB (edge_list, x); in compute_farthest()
577 if (succ == EXIT_BLOCK_PTR) in compute_farthest()
586 st_antin[succ->index]); in compute_farthest()
587 sbitmap_not (temp_bitmap, st_avin[succ->index]); in compute_farthest()
[all …]
Dcfganal.c418 int pred, succ, index; in verify_edge_list() local
428 succ = e->dest->index; in verify_edge_list()
432 fprintf (f, "*p* No index for edge from %d to %d\n", pred, succ); in verify_edge_list()
439 if (INDEX_EDGE_SUCC_BB (elist, index)->index != succ) in verify_edge_list()
441 index, succ, INDEX_EDGE_SUCC_BB (elist, index)->index); in verify_edge_list()
482 find_edge (basic_block pred, basic_block succ) in find_edge() argument
487 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
490 if (e->dest == succ) in find_edge()
495 FOR_EACH_EDGE (e, ei, succ->preds) in find_edge()
507 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ) in find_edge_index() argument
[all …]
Dcfgloopanal.c67 struct edge *pred, *succ; member
96 && !g->vertices[i].succ) in dump_graph()
105 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
138 e->succ_next = g->vertices[f].succ; in add_edge()
139 g->vertices[f].succ = e; in add_edge()
159 #define FST_EDGE(V) (forward ? g->vertices[(V)].succ : g->vertices[(V)].pred) in dfs()
234 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
247 for (e = g->vertices[i].succ; e; e = n) in free_graph()
Dgcov.c118 arc_t *succ; member
596 for (arc = block->succ; arc; arc = arc_n) in release_structures()
796 if (src >= fn->num_blocks || fn->blocks[src].succ) in read_graph_file()
818 arc->succ_next = fn->blocks[src].succ; in read_graph_file()
819 fn->blocks[src].succ = arc; in read_graph_file()
935 for (arc_p = NULL, arc = fn->blocks[ix].succ; arc; in read_graph_file()
941 fn->blocks[ix].succ = arc_p; in read_graph_file()
1108 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()
1129 for (arc = blk->succ; arc; arc = arc->succ_next) in solve_flow_graph()
1151 arc_t *start = blk->succ; in solve_flow_graph()
[all …]
Dddg.c786 find_successors (sbitmap succ, ddg_ptr g, sbitmap ops) in find_successors() argument
794 sbitmap_a_or_b (succ, succ, node_succ); in find_successors()
798 sbitmap_difference (succ, succ, ops); in find_successors()
Dglobal.c2337 basic_block bb, succ; in calculate_reg_pav() local
2384 succ = e->dest; in calculate_reg_pav()
2385 if (succ->index != EXIT_BLOCK in calculate_reg_pav()
2386 && !TEST_BIT (wset, succ->index)) in calculate_reg_pav()
2388 SET_BIT (wset, succ->index); in calculate_reg_pav()
2389 VEC_quick_push (basic_block, new_bbs, succ); in calculate_reg_pav()
Dcfgloop.c63 edge succ; in flow_loops_cfg_dump() local
67 FOR_EACH_EDGE (succ, ei, bb->succs) in flow_loops_cfg_dump()
68 fprintf (file, "%d ", succ->dest->index); in flow_loops_cfg_dump()
/freebsd-9-stable/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp105 const ExplodedNode *succ = *(node->succ_begin()); in shouldCollect() local
106 if (succ->pred_size() != 1) in shouldCollect()
151 const ProgramPoint SuccLoc = succ->getLocation(); in shouldCollect()
166 ExplodedNode *succ = *(node->succ_begin()); in collectNode() local
167 pred->replaceSuccessor(succ); in collectNode()
168 succ->replacePredecessor(pred); in collectNode()
DCoreEngine.cpp376 if (const CFGBlock *succ = *it) { in HandleBlockExit() local
377 generateNode(BlockEdge(B, succ, Pred->getLocationContext()), in HandleBlockExit()
/freebsd-9-stable/usr.bin/make/
Dmake.c463 GNode *succ = Lst_Datum(ln); in Make_Update() local
465 if (succ->make && succ->unmade == 0 && succ->made == UNMADE && in Make_Update()
466 Lst_Member(&toBeMade, succ) == NULL) { in Make_Update()
467 Lst_EnQueue(&toBeMade, succ); in Make_Update()
/freebsd-9-stable/contrib/libpcap/
Doptimize.c266 if (ep->succ) { in propedom()
267 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords); in propedom()
268 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords); in propedom()
1251 use_conflict(struct block *b, struct block *succ) in use_conflict() argument
1254 atomset use = succ->out_use; in use_conflict()
1261 if (b->val[atom] != succ->val[atom]) in use_conflict()
1324 if (JT(ep->succ) == 0) in opt_j()
1327 if (JT(ep->succ) == JF(ep->succ)) { in opt_j()
1332 if (!use_conflict(ep->pred, ep->succ->et.succ)) { in opt_j()
1334 ep->succ = JT(ep->succ); in opt_j()
[all …]
Dgencode.h233 struct block *succ; member
340 #define JT(b) ((b)->et.succ)
341 #define JF(b) ((b)->ef.succ)
/freebsd-9-stable/bin/ed/
Ded.h160 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred) argument
/freebsd-9-stable/contrib/llvm/include/llvm/Analysis/
DRegionIterator.h70 RegionNode *succ; in getISucc() local
71 succ = getNode()->getParent()->getNode(BB); in getISucc()
72 assert(succ && "BB not in Region or entered subregion!"); in getISucc()
73 return succ; in getISucc()
DDependenceAnalysis.h196 void setNextSuccessor(const Dependence *succ) { in setNextSuccessor() argument
197 NextSuccessor = succ; in setNextSuccessor()
/freebsd-9-stable/contrib/llvm/lib/Transforms/Scalar/
DSink.cpp206 Loop *succ = LI->getLoopFor(SuccToSinkTo); in IsAcceptableTarget() local
208 if (succ != 0 && succ != cur) in IsAcceptableTarget()
/freebsd-9-stable/contrib/llvm/lib/CodeGen/
DUnreachableBlockElim.cpp148 MachineBasicBlock* succ = *BB->succ_begin(); in runOnMachineFunction() local
150 MachineBasicBlock::iterator start = succ->begin(); in runOnMachineFunction()
151 while (start != succ->end() && start->isPHI()) { in runOnMachineFunction()
DMachineBasicBlock.cpp482 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { in addSuccessor() argument
492 Successors.push_back(succ); in addSuccessor()
493 succ->addPredecessor(this); in addSuccessor()
496 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { in removeSuccessor() argument
497 succ->removePredecessor(this); in removeSuccessor()
498 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); in removeSuccessor()
/freebsd-9-stable/sys/contrib/ngatm/netnatm/api/
Dcc_user.c1617 struct atm_add_party_success *succ; in cc_user_sig_handle() local
1622 succ = CCZALLOC(sizeof(*succ)); in cc_user_sig_handle()
1623 if (succ == NULL) in cc_user_sig_handle()
1626 succ->leaf_ident = leaf_ident; in cc_user_sig_handle()
1628 succ, sizeof(*succ)); in cc_user_sig_handle()
1630 CCFREE(succ); in cc_user_sig_handle()
/freebsd-9-stable/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
DDeadStoresChecker.cpp97 if (const CFGBlock *succ = *i) in computeReachableBlocks() local
98 worklist.push_back(succ); in computeReachableBlocks()
/freebsd-9-stable/contrib/wpa/wpa_supplicant/dbus/
Ddbus_new.c121 dbus_bool_t succ; in wpas_dbus_signal_scan_done() local
135 succ = success ? TRUE : FALSE; in wpas_dbus_signal_scan_done()
136 if (dbus_message_append_args(msg, DBUS_TYPE_BOOLEAN, &succ, in wpas_dbus_signal_scan_done()
/freebsd-9-stable/contrib/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h364 void addSuccessor(MachineBasicBlock *succ, uint32_t weight = 0);
369 void removeSuccessor(MachineBasicBlock *succ);
/freebsd-9-stable/contrib/llvm/tools/clang/lib/Analysis/
DLiveVariables.cpp562 if (const CFGBlock *succ = *it) { in computeLiveness() local
563 val = LV->merge(val, LV->blocksBeginToLiveness[succ]); in computeLiveness()

12