Searched refs:successors (Results 1 - 9 of 9) sorted by relevance

/freebsd-10.1-release/share/mk/
H A Dversion_gen.awk33 # successors[] - array index by version name, contains successor
60 successors[symver] = "";
82 successors[symver] = v;
212 if (successors[v] != "")
213 print_version(successors[v]);
231 if (successors[v] == "")
234 printf("} %s;\n", successors[v]);
/freebsd-10.1-release/contrib/gcc/
H A Dddg.h43 /* The following two macros enables direct access to the successors and
46 #define NODE_SUCCESSORS(x) ((x)->successors)
72 sbitmap successors; member in struct:ddg_node
H A Dddg.c423 if (! TEST_BIT (dest_node->successors, j))
501 g->nodes[i].successors = sbitmap_alloc (num_nodes);
502 sbitmap_zero (g->nodes[i].successors);
540 sbitmap_free (g->nodes[i].successors);
652 gcc_assert (src->successors && dest->predecessors);
654 SET_BIT (src->successors, dest->cuid);
785 /* Given a set OPS of nodes in the DDG, find the set of their successors
990 /* Updates the counts of U_NODE's successors (that belong to NODES) to be
H A Dmodulo-sched.c68 predecessors _or_ after all its successors.
1285 'PSS' previously scheduled successors.
1357 such cases we want to unschedule some of the predecessors/successors
1913 sbitmap successors = sbitmap_alloc (num_nodes);
1918 sbitmap_zero (successors);
1919 find_successors (successors, g, nodes_ordered);
1927 else if (sbitmap_a_and_b_cg (tmp, successors, scc))
1960 /* Don't consider the already ordered successors again. */
1988 sbitmap_zero (successors);
1989 find_successors (successors,
1909 sbitmap successors = sbitmap_alloc (num_nodes); local
[all...]
/freebsd-10.1-release/usr.bin/make/
H A DGNode.h194 Lst successors; member in struct:GNode
H A Dtarg.c147 Lst_Init(&gn->successors);
H A Dmake.c462 for (ln = Lst_First(&cgn->successors); ln != NULL; ln = Lst_Succ(ln)) {
H A Dparse.c591 Lst_AtEnd(&predecessor->successors, gn);
657 Lst_AtEnd(&p->successors, gn);
/freebsd-10.1-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp449 if (int successors = TI->getNumSuccessors()) {
450 for (int i = 0; i != successors; ++i) {
617 // All edges with successors that aren't branches are "complex", because it

Completed in 47 milliseconds