*/
static int sched_edge_hook(FILE *F, ir_node *irn)
{
- if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
+ if (is_Proj(irn))
+ return 1;
+ if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
ir_node *prev = sched_prev(irn);
fprintf(F, "edge:{sourcename:\"");
PRINT_NODEID(irn);
static void collect_phis(ir_node *irn, void *data)
{
- if(is_Phi(irn)) {
- ir_node *bl = get_nodes_block(irn);
- set_irn_link(irn, get_irn_link(bl));
- set_irn_link(bl, irn);
- }
+ (void) data;
+ if(is_Phi(irn)) {
+ ir_node *bl = get_nodes_block(irn);
+ set_irn_link(irn, get_irn_link(bl));
+ set_irn_link(bl, irn);
+ }
}
void be_clear_links(ir_graph *irg)
{
+ set_using_irn_link(irg);
irg_walk_graph(irg, firm_clear_link, NULL, NULL);
+ clear_using_irn_link(irg);
}
void be_collect_phis(ir_graph *irg)
irg_walk_graph(irg, collect_phis, NULL, NULL);
}
-static void count_num_reachable_nodes(ir_node *irn, void *env) {
+static void count_num_reachable_nodes(ir_node *irn, void *env)
+{
int *num = env;
(*num)++;
+ (void) irn;
}
unsigned get_num_reachable_nodes(ir_graph *irg) {
edges_node_deleted(irn, irg);
}
-/* FIXME: not used. can be deleted? */
-ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
- ir_node *irn, *idom;
-
- /* search the current block */
- for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn))
- if (pset_find_ptr(accept, irn))
- return irn;
-
- /* FIXME: This is obviously buggy: after the first recursive call idom is a block
- and get_nodes_block will fail.
- Moreover, why not a simple iteration instead of recursion */
- idom = get_Block_idom(get_nodes_block(start_point_exclusive));
-
- if (idom)
- return dom_up_search(accept, idom); /* continue search in idom-block */
- else
- return NULL; /* this was the start block and we did not find an acceptable irn */
-}
-
/**
* Gets the Proj with number pn from irn.
*/