/**
* Get the predecessor block.
*/
-static ir_node *get_block_n(const ir_node *block, int pos) {
+static ir_node *get_block_n(const ir_node *block, int pos)
+{
if (is_Block(block))
return get_Block_cfgpred_block(block, pos);
/* might be a Bad */
{ "dependency", set_irn_dep, 0, get_irn_deps, get_irn_dep }
};
-#define foreach_tgt(irn, i, n, kind) for(i = edge_kind_info[kind].first_idx, n = edge_kind_info[kind].get_arity(irn); i < n; ++i)
+#define foreach_tgt(irn, i, n, kind) for (i = edge_kind_info[kind].first_idx, n = edge_kind_info[kind].get_arity(irn); i < n; ++i)
#define get_n(irn, pos, kind) (edge_kind_info[kind].get_n(irn, pos))
#define get_kind_str(kind) (edge_kind_info[kind].name)
/**
* Returns an ID for the given edge.
*/
-static inline long edge_get_id(const ir_edge_t *e) {
+static inline long edge_get_id(const ir_edge_t *e)
+{
#ifdef DEBUG_libfirm
return e->edge_nr;
#else /* DEBUG_libfirm */
* Each user has to remember his given offset and the size of his private data.
* To be called before FIRM is initialized.
*/
-int edges_register_private_data(size_t n) {
+int edges_register_private_data(size_t n)
+{
int res = edges_private_size;
assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
* The user has to remember his offset and the size of his data!
* Caution: Using wrong values here can destroy other users private data!
*/
-void edges_reset_private_data(ir_graph *irg, int offset, unsigned size) {
+void edges_reset_private_data(ir_graph *irg, int offset, unsigned size)
+{
irg_edge_info_t *info = _get_irg_edge_info(irg, EDGE_KIND_NORMAL);
ir_edge_t *edge;
ir_edgeset_iterator_t iter;
* Initialize the out information for a graph.
* @note Dead node elimination can call this on an already initialized graph.
*/
-void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind) {
+void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind)
+{
if (edges_activated_kind(irg, kind)) {
irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
size_t amount = irg->estimated_node_count * 2;
edges_used = 1;
- if(info->allocated) {
+ if (info->allocated) {
amount = ir_edgeset_size(&info->edges);
ir_edgeset_destroy(&info->edges);
obstack_free(&info->edges_obst, NULL);
* Get the edge object of an outgoing edge at a node.
* Looks for an edge for all kinds.
*/
-const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos) {
+const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos)
+{
const ir_edge_t *edge;
- if((edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_NORMAL)) == NULL)
+ if ((edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_NORMAL)) == NULL)
edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_BLOCK);
return(edge);
}
* @param tgt the edge target
* @param kind the kind of the edge
*/
-static inline void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs) {
+static inline void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs)
+{
irn_edge_info_t *info = _get_irn_edge_info(tgt, kind);
info->out_count += ofs;
* Verify the edge list of a node, ie. ensure it's a loop:
* head -> e_1 -> ... -> e_n -> head
*/
-static inline void vrfy_list_head(ir_node *irn, ir_edge_kind_t kind) {
+static inline void vrfy_list_head(ir_node *irn, ir_edge_kind_t kind)
+{
int err = 0;
int num = 0;
pset *lh_set = pset_new_ptr(16);
assert(err == 0);
}
+#ifdef DEBUG_libfirm
+/**
+ * Helper function to dump the edge set of a graph,
+ * unused in normal code.
+ */
+void edges_dump_kind(ir_graph *irg, ir_edge_kind_t kind)
+{
+ irg_edge_info_t *info;
+ ir_edgeset_t *edges;
+ ir_edgeset_iterator_t iter;
+ ir_edge_t *e;
+
+ if (!edges_activated_kind(irg, kind))
+ return;
+
+ info = _get_irg_edge_info(irg, kind);
+ edges = &info->edges;
+ foreach_ir_edgeset(edges, e, iter) {
+ ir_printf("%+F %d %d\n", e->src, e->pos, e->invalid);
+ }
+}
+#endif
+
/* The edge from (src, pos) -> old_tgt is redirected to tgt */
void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
ir_node *old_tgt, ir_edge_kind_t kind,
/**
* Post-Walker: notify all edges
*/
-static void build_edges_walker(ir_node *irn, void *data) {
+static void build_edges_walker(ir_node *irn, void *data)
+{
struct build_walker *w = data;
int i, n;
ir_edge_kind_t kind = w->kind;
* Pre-Walker: initializes the list-heads and set the out-count
* of all nodes to 0.
*/
-static void init_lh_walker(ir_node *irn, void *data) {
+static void init_lh_walker(ir_node *irn, void *data)
+{
struct build_walker *w = data;
ir_edge_kind_t kind = w->kind;
list_head *head = _get_irn_outs_head(irn, kind);
* b) it might be sufficient to add those stupid NO_REG nodes
* to the anchor
*/
-static void init_lh_walker_dep(ir_node *irn, void *data) {
+static void init_lh_walker_dep(ir_node *irn, void *data)
+{
struct build_walker *w = data;
ir_edge_kind_t kind = w->kind;
list_head *head = _get_irn_outs_head(irn, kind);
* Visitor: initializes the list-heads and set the out-count
* of all nodes to 0 of nodes that are not seen so far.
*/
-static void visitor(ir_node *irn, void *data) {
+static void visitor(ir_node *irn, void *data)
+{
visitor_info_t *info = data;
if (!irn_visited_else_mark(irn)) {
{
set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
- if(set_edge && edges_activated_kind(irg, kind)) {
+ if (set_edge && edges_activated_kind(irg, kind)) {
struct list_head *head = _get_irn_outs_head(from, kind);
DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
templ.pos = i;
e = ir_edgeset_find(edges, &templ);
- if(e != NULL) {
+ if (e != NULL) {
e->present = 1;
} else {
w->problem_found = 1;
/**
* Clear link field of all nodes.
*/
-static void clear_links(ir_node *irn, void *env) {
+static void clear_links(ir_node *irn, void *env)
+{
struct build_walker *w = env;
bitset_t *bs;
/**
* Increases count (stored in link field) for all operands of a node.
*/
-static void count_user(ir_node *irn, void *env) {
+static void count_user(ir_node *irn, void *env)
+{
int i;
int first;
(void) env;
/**
* Verifies if collected count, number of edges in list and stored edge count are in sync.
*/
-static void verify_edge_counter(ir_node *irn, void *env) {
+static void verify_edge_counter(ir_node *irn, void *env)
+{
struct build_walker *w = env;
bitset_t *bs;
int list_cnt;
/**
* Verifies the out edges of an irg.
*/
-int edges_verify(ir_graph *irg) {
+int edges_verify(ir_graph *irg)
+{
struct build_walker w;
int problem_found = 0;
/**
* Wrapper to edges_verify to be run as an ir_graph pass.
*/
-static int edges_verify_wrapper(ir_graph *irg, void *context) {
+static int edges_verify_wrapper(ir_graph *irg, void *context)
+{
struct pass_t *pass = context;
int problems_found = edges_verify(irg);
/* do NOT rerun the pass if verify is ok :-) */
}
/* Creates an ir_graph pass for edges_verify(). */
-ir_graph_pass_t *irg_verify_edges_pass(const char *name, unsigned assert_on_problem) {
+ir_graph_pass_t *irg_verify_edges_pass(const char *name, unsigned assert_on_problem)
+{
struct pass_t *pass = XMALLOCZ(struct pass_t);
def_graph_pass_constructor(
return &pass->pass;
}
-void init_edges(void) {
+void init_edges(void)
+{
FIRM_DBG_REGISTER(dbg, DBG_EDGES);
/* firm_dbg_set_mask(dbg, -1); */
}
-void edges_init_dbg(int do_dbg) {
+void edges_init_dbg(int do_dbg)
+{
edges_dbg = do_dbg;
}
-void edges_activate(ir_graph *irg) {
+void edges_activate(ir_graph *irg)
+{
edges_activate_kind(irg, EDGE_KIND_NORMAL);
edges_activate_kind(irg, EDGE_KIND_BLOCK);
if (get_irg_phase_state(irg) == phase_backend)
edges_activate_kind(irg, EDGE_KIND_DEP);
}
-void edges_deactivate(ir_graph *irg) {
+void edges_deactivate(ir_graph *irg)
+{
if (get_irg_phase_state(irg) == phase_backend)
edges_deactivate_kind(irg, EDGE_KIND_DEP);
edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
return activated;
}
-int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind) {
+int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind)
+{
int activated = edges_activated_kind(irg, kind);
if (!activated)
return activated;
}
-void edges_node_deleted(ir_node *irn, ir_graph *irg) {
+void edges_node_deleted(ir_node *irn, ir_graph *irg)
+{
edges_node_deleted_kind(irn, EDGE_KIND_NORMAL, irg);
edges_node_deleted_kind(irn, EDGE_KIND_BLOCK, irg);
}
-void edges_node_revival(ir_node *irn, ir_graph *irg) {
+void edges_node_revival(ir_node *irn, ir_graph *irg)
+{
edges_node_revival_kind(irn, EDGE_KIND_NORMAL, irg);
edges_node_revival_kind(irn, EDGE_KIND_BLOCK, irg);
}
-const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind) {
+const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind)
+{
return _get_irn_out_edge_first_kind(irn, kind);
}
-const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last) {
+const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last)
+{
return _get_irn_out_edge_next(irn, last);
}
-ir_node *(get_edge_src_irn)(const ir_edge_t *edge) {
+ir_node *(get_edge_src_irn)(const ir_edge_t *edge)
+{
return _get_edge_src_irn(edge);
}
-int (get_edge_src_pos)(const ir_edge_t *edge) {
+int (get_edge_src_pos)(const ir_edge_t *edge)
+{
return _get_edge_src_pos(edge);
}
-int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind) {
+int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind)
+{
return _get_irn_n_edges_kind(irn, kind);
}
-void dump_all_out_edges(ir_node *irn) {
+void dump_all_out_edges(ir_node *irn)
+{
int i;
for (i = 0; i < EDGE_KIND_LAST; ++i) {
const ir_edge_t *edge;
}
}
-static void irg_block_edges_walk2(ir_node *bl,
- irg_walk_func *pre, irg_walk_func *post,
- void *env) {
+static void irg_block_edges_walk2(ir_node *bl, irg_walk_func *pre,
+ irg_walk_func *post, void *env)
+{
const ir_edge_t *edge, *next;
if (!Block_block_visited(bl)) {
}
}
-void irg_block_edges_walk(ir_node *node,
- irg_walk_func *pre, irg_walk_func *post,
- void *env) {
-
+void irg_block_edges_walk(ir_node *node, irg_walk_func *pre,
+ irg_walk_func *post, void *env)
+{
assert(edges_activated(current_ir_graph));
assert(is_Block(node));
projects / libfirm / blobdiff