* tree-ssa.c (ssa_remove_edge): Call remove_phi_args instead
of remove_phi_arg.
+ * cfg.c (unchecked_make_edge): Call execute_on_growing_pred
+ after making an edge.
+ (remove_edge): Call execute_on_shrinking_pred before removing
+ an edge.
+ (redirect_edge_succ): Call execute_on_growing_pred and
+ execute_on_shrinking_pred.
+ * cfghooks.c (execute_on_growing_pred): New.
+ (execute_on_shrinking_pred): Likewise.
+ * cfghooks.h (cfg_hooks): Add execute_on_growing_pred and
+ execute_on_shrinking_pred.
+ Add prototypes for execute_on_growing_pred and
+ execute_on_shrinking_pred.
+ * cfgrtl.c (rtl_cfg_hooks): Add NULL hooks to
+ execute_on_growing_pred and execute_on_shrinking_pred.
+ (cfg_layout_rtl_cfg_hook): Likewise.
+ * tree-cfg.c (tree_cfg_hooks): Likewise.
+
2004-11-23 Ben Elliston <bje@au.ibm.com>
* doc/cfg.texi (Maintaining the CFG): Use @ftable instead of
e->flags = flags;
e->dest_idx = EDGE_COUNT (dst->preds) - 1;
+ execute_on_growing_pred (e);
+
return e;
}
bool found = false;
edge_iterator ei;
+ execute_on_shrinking_pred (e);
+
src = e->src;
dest = e->dest;
dest_idx = e->dest_idx;
basic_block dest = e->dest;
unsigned int dest_idx = e->dest_idx;
+ execute_on_shrinking_pred (e);
+
VEC_unordered_remove (edge, dest->preds, dest_idx);
/* If we removed an edge in the middle of the edge vector, we need
VEC_safe_push (edge, new_succ->preds, e);
e->dest = new_succ;
e->dest_idx = EDGE_COUNT (new_succ->preds) - 1;
+ execute_on_growing_pred (e);
}
/* Like previous but avoid possible duplicate edge. */
return (cfg_hooks->flow_call_edges_add) (blocks);
}
+
+/* This function is called immediately after edge E is added to the
+ edge vector E->dest->preds. */
+
+void
+execute_on_growing_pred (edge e)
+{
+ if (cfg_hooks->execute_on_growing_pred)
+ cfg_hooks->execute_on_growing_pred (e);
+}
+
+/* This function is called immediately before edge E is removed from
+ the edge vector E->dest->preds. */
+
+void
+execute_on_shrinking_pred (edge e)
+{
+ if (cfg_hooks->execute_on_shrinking_pred)
+ cfg_hooks->execute_on_shrinking_pred (e);
+}
The goal is to expose cases in which entering a basic block does not imply
that all subsequent instructions must be executed. */
int (*flow_call_edges_add) (sbitmap);
+
+ /* This function is called immediately after edge E is added to the
+ edge vector E->dest->preds. */
+ void (*execute_on_growing_pred) (edge);
+
+ /* This function is called immediately before edge E is removed from
+ the edge vector E->dest->preds. */
+ void (*execute_on_shrinking_pred) (edge);
};
extern void verify_flow_info (void);
extern bool block_ends_with_call_p (basic_block bb);
extern bool block_ends_with_condjump_p (basic_block bb);
extern int flow_call_edges_add (sbitmap);
+extern void execute_on_growing_pred (edge);
+extern void execute_on_shrinking_pred (edge);
/* Hooks containers. */
extern struct cfg_hooks tree_cfg_hooks;
rtl_tidy_fallthru_edge,
rtl_block_ends_with_call_p,
rtl_block_ends_with_condjump_p,
- rtl_flow_call_edges_add
+ rtl_flow_call_edges_add,
+ NULL, /* execute_on_growing_pred */
+ NULL /* execute_on_shrinking_pred */
};
/* Implementation of CFG manipulation for cfg layout RTL, where
NULL,
rtl_block_ends_with_call_p,
rtl_block_ends_with_condjump_p,
- rtl_flow_call_edges_add
+ rtl_flow_call_edges_add,
+ NULL, /* execute_on_growing_pred */
+ NULL /* execute_on_shrinking_pred */
};
NULL, /* tidy_fallthru_edge */
tree_block_ends_with_call_p, /* block_ends_with_call_p */
tree_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
- tree_flow_call_edges_add /* flow_call_edges_add */
+ tree_flow_call_edges_add, /* flow_call_edges_add */
+ NULL, /* execute_on_growing_pred */
+ NULL, /* execute_on_shrinking_pred */
};