Searched refs:predecessors (Results 1 – 19 of 19) sorted by relevance
| /trueos/contrib/gcc/ |
| HD | ddg.h | 47 #define NODE_PREDECESSORS(x) ((x)->predecessors) 73 sbitmap predecessors; member
|
| HD | ddg.c | 501 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg() 502 sbitmap_zero (g->nodes[i].predecessors); in create_ddg() 539 sbitmap_free (g->nodes[i].predecessors); in free_ddg() 650 gcc_assert (src->successors && dest->predecessors); in add_edge_to_ddg() 653 SET_BIT (dest->predecessors, src->cuid); in add_edge_to_ddg()
|
| HD | modulo-sched.c | 1908 sbitmap predecessors = sbitmap_alloc (num_nodes); in order_nodes_in_scc() local 1911 sbitmap_zero (predecessors); in order_nodes_in_scc() 1912 find_predecessors (predecessors, g, nodes_ordered); in order_nodes_in_scc() 1918 if (sbitmap_a_and_b_cg (tmp, predecessors, scc)) in order_nodes_in_scc() 1963 sbitmap_zero (predecessors); in order_nodes_in_scc() 1964 find_predecessors (predecessors, g, nodes_ordered); in order_nodes_in_scc() 1965 sbitmap_a_and_b (workset, predecessors, scc); in order_nodes_in_scc() 1992 sbitmap_free (predecessors); in order_nodes_in_scc()
|
| HD | reg-stack.c | 217 int predecessors; /* Number of predecessors that need member 2990 BLOCK_INFO (e->dest)->predecessors--; in convert_regs_2() 2991 if (!BLOCK_INFO (e->dest)->predecessors) in convert_regs_2() 3103 bi->predecessors++; in reg_to_stack()
|
| HD | ChangeLog.gcc43 | 213 predecessors at head rather than tail.
|
| HD | ChangeLog.tree-ssa | 6987 * tree-dfa.c (create_phi_node): Get the number of predecessors from 8645 later has other predecessors. 10437 COND_EXPR's that are necessary, check each BB's predecessors only once.
|
| HD | ChangeLog-2003 | 4317 if the block has no predecessors. 8135 to initialize the predecessors count. 32352 destination block with multiple predecessors. 32705 successors with multiple predecessors.
|
| HD | ChangeLog-2001 | 15901 * reg-stack.c (block_info_def): Add predecessors counter and stack_out. 15902 (reg_to_stack): Call mark_dfs_back_edges; count the predecessors. 15906 Do updating of the predecessors counts.
|
| HD | ChangeLog-1999 | 10086 intersection of predecessors with the new flow graph structures. 10090 predecessors with the new flow graph structures.
|
| HD | ChangeLog-2006 | 9934 (merge_ranges): Use them to compute predecessors and successors of
|
| HD | ChangeLog-2005 | 8944 successors and predecessors. 17096 one of its predecessors.
|
| HD | ChangeLog-2004 | 23001 remove_fake_successors; iterate over predecessors.
|
| /trueos/contrib/top/ |
| HD | INSTALL | 131 of its predecessors), use the module "sunos4".
|
| /trueos/contrib/subversion/subversion/libsvn_fs_base/notes/ |
| HD | fs-history | 157 can inherit the copy IDs of their predecessors (in the trivial cloning
|
| HD | structure | 134 * PRED-COUNT, if present, indicates the number of predecessors the
|
| /trueos/contrib/jemalloc/ |
| HD | ChangeLog | 468 predecessors.
|
| /trueos/sys/boot/ficl/softwords/ |
| HD | oo.fr | 50 \ their predecessors. Ficl has no way of enforcing this, either.
|
| /trueos/contrib/gcc/doc/ |
| HD | cfg.texi | 149 type point to type-safe vectors of edges to the predecessors and
|
| /trueos/sys/contrib/dev/acpica/ |
| HD | changes.txt | 8460 code than their predecessors. The new macros ACPI_ERROR, ACPI_EXCEPTION,
|