2 * Always available outs.
3 * @author Sebastian Hack
19 #include "iredges_t.h"
27 static firm_dbg_module_t *dbg;
29 #if FIRM_EDGES_INPLACE
32 * This flag is set to 1, if the edges get initialized for an irg.
33 * Then register additional data is forbidden.
35 static int edges_used = 0;
37 static int edges_private_size = 0;
39 int edges_register_private_data(size_t n)
41 int res = edges_private_size;
43 assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
45 edges_private_size += n;
49 #define TIMES37(x) (((x) << 5) + ((x) << 2) + (x))
51 #define get_irn_out_list_head(irn) (&get_irn_out_info(irn)->outs)
53 static int edge_cmp(const void *p1, const void *p2, size_t len)
55 const ir_edge_t *e1 = p1;
56 const ir_edge_t *e2 = p2;
57 int res = e1->src == e2->src && e1->pos == e2->pos;
62 #define edge_hash(edge) (TIMES37((edge)->pos) + HASH_PTR((edge)->src))
65 * Initialize the out information for a graph.
66 * @note Dead node elim can call this on an already initialized graph.
68 void edges_init_graph(ir_graph *irg)
70 if(edges_activated(irg)) {
71 irg_edge_info_t *info = _get_irg_edge_info(irg);
77 amount = set_count(info->edges);
81 info->edges = new_set(edge_cmp, amount);
85 #define EDGE_SIZE(src) \
86 (edges_private_size + (is_Block(src) ? sizeof(ir_block_edge_t) : sizeof(ir_edge_t)))
90 * Get the edge object of an outgoing edge at a node.
91 * @param irg The graph, the node is in.
92 * @param src The node at which the edge originates.
93 * @param pos The position of the edge.
94 * @return The corresponding edge object or NULL,
95 * if no such edge exists.
97 const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos)
99 if(edges_activated(irg)) {
100 irg_edge_info_t *info = _get_irg_edge_info(irg);
101 size_t size = EDGE_SIZE(src);
102 ir_edge_t *templ = alloca(size);
104 memset(templ, 0, size);
105 templ->src = (ir_node *) src;
107 return set_find(info->edges, templ, size, edge_hash(templ));
113 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg)
115 const char *msg = "";
117 if(!edges_activated(irg))
121 assert(node_is_in_irgs_storage(irg, src) && "source not in irg");
125 * Only do something, if the old and new target differ.
128 int is_block_edge = is_Block(src);
129 set *edges = _get_irg_edge_info(irg)->edges;
133 * This is scray, but:
134 * If two entries in a set do not have the same size, they are
135 * treated as unequal, ignoring the comparison function.
136 * So, edges from blocks have extra storage (they are
137 * ir_block_edge_t's).
139 * Also add the amount of registered private data to the
142 size_t size = EDGE_SIZE(src);
143 ir_edge_t *templ = alloca(size);
145 /* Initialize the edge template to search in the set. */
146 memset(templ, 0, size);
148 templ->src_nr = get_irn_node_nr(src);
156 * If the target is NULL, the edge shall be deleted.
159 /* search the edge in the set. */
160 edge = set_find(edges, templ, size, edge_hash(templ));
162 /* mark the edge invalid if it was found */
164 ir_block_edge_t *block_edge = (ir_block_edge_t *) edge;
167 list_del(&edge->list);
173 * If the edge is a cf edge, we delete it also
174 * from the list of all block successor edges.
177 list_del(&block_edge->succ_list);
180 /* If the edge was not found issue a warning on the debug stream */
182 msg = "edge to delete not found!\n";
187 * The target is not NULL and the old target differs
188 * from the new target, the edge shall be moved (if the
189 * old target was != NULL) or added (if the old target was
193 struct list_head *head = _get_irn_outs_head(tgt);
196 * The list head in the block of the edges target.
197 * Therein all control flow edges directed at that block
200 struct list_head *succ_head =
201 is_block_edge ? _get_block_succ_head(get_nodes_block(tgt)) : NULL;
203 ir_block_edge_t *block_edge;
206 if(!node_is_in_irgs_storage(irg, tgt))
209 assert(head->next && head->prev &&
210 "target list head must have been initialized");
213 * insert the edge, if it is not yet in the set or return
214 * the instance in the set.
216 edge = set_insert(edges, templ, size, edge_hash(templ));
217 block_edge = (ir_block_edge_t *) edge;
220 assert(!edge->invalid && "Invalid edge encountered");
223 /* If the old target is not null, the edge is moved. */
226 list_move(&edge->list, head);
228 /* If the edge is a cf edge, move it from the successor list. */
230 list_move(&block_edge->succ_list, succ_head);
232 _get_irn_edge_info(old_tgt)->out_count -= 1;
235 /* The old target was null, thus, the edge is newly created. */
238 list_add(&edge->list, head);
241 * If the edge is cf edge, enter it into the successor list
242 * of the target node's block.
245 list_add(&block_edge->succ_list, succ_head);
248 _get_irn_edge_info(tgt)->out_count += 1;
252 /* If the target and the old target are equal, nothing is done. */
253 DBG((dbg, LEVEL_5, "announce out edge: %n[%p] %d-> %n[%p](%n[%p]): %s\n",
254 src, src, pos, tgt, tgt, old_tgt, old_tgt, msg));
257 void edges_node_deleted(ir_node *old, ir_graph *irg)
259 if(edges_activated(irg)) {
260 int not_a_block = !is_Block(old);
265 DBG((dbg, LEVEL_5, "node deleted: %n\n", old));
267 /* Change to get_irn_n */
268 for(i = -not_a_block, n = get_irn_arity(old); i < n; ++i) {
269 ir_node *old_tgt = get_irn_n(old, i);
270 DBG((dbg, LEVEL_5, "\tdelete to old target %n\n", old_tgt));
271 edges_notify_edge(old, i, NULL, old_tgt, irg);
277 void edges_invalidate(ir_node *irn, ir_graph *irg)
279 edges_node_deleted(irn, irg);
282 static void build_edges_walker(ir_node *irn, void *data)
284 ir_graph *irg = data;
285 int not_a_block = !is_Block(irn);
288 for(i = -not_a_block, n = get_irn_arity(irn); i < n; ++i)
289 edges_notify_edge(irn, i, get_irn_n(irn, i), NULL, irg);
292 static void init_lh_walker(ir_node *irn, void *data)
294 INIT_LIST_HEAD(_get_irn_outs_head(irn));
296 INIT_LIST_HEAD(_get_block_succ_head(irn));
299 void edges_activate(ir_graph *irg)
301 irg_edge_info_t *info = _get_irg_edge_info(irg);
304 edges_init_graph(irg);
305 irg_walk_graph(irg, init_lh_walker, build_edges_walker, irg);
308 void edges_deactivate(ir_graph *irg)
310 irg_edge_info_t *info = _get_irg_edge_info(irg);
314 del_set(info->edges);
319 int (edges_activated)(const ir_graph *irg)
321 return _edges_activated(irg);
326 * Reroute all use-edges from a node to another.
327 * @param from The node whose use-edges shall be withdrawn.
328 * @param to The node to which all the use-edges of @p from shall be
331 void edges_reroute(ir_node *from, ir_node *to, ir_graph *irg)
333 if(edges_activated(irg)) {
334 struct list_head *head = _get_irn_outs_head(from);
337 "reroute from %n to %n\n", from, to));
339 while(head != head->next) {
340 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
341 // DBG((dbg, LEVEL_5, "\t%n %d\n", edge->src, edge->pos));
342 assert(edge->pos >= -1);
343 set_irn_n(edge->src, edge->pos, to);
348 static void verify_set_presence(ir_node *irn, void *data)
350 ir_graph *irg = data;
351 set *edges = _get_irg_edge_info(irg)->edges;
352 int not_a_block = !is_Block(irn);
355 for(i = 0, n = get_irn_arity(irn) + not_a_block; i < n; ++i) {
356 ir_block_edge_t space;
357 ir_edge_t *templ = (ir_edge_t *) &space;
359 size_t size = not_a_block ? sizeof(ir_edge_t) : sizeof(ir_block_edge_t);
362 templ->pos = i - not_a_block;
364 e = set_find(edges, templ, size, edge_hash(templ));
368 DBG((dbg, LEVEL_DEFAULT, "edge %n,%d is missing\n", irn, templ->pos));
372 static void verify_list_presence(ir_node *irn, void *data)
376 foreach_out_edge(irn, e) {
377 ir_node *tgt = get_irn_n(e->src, e->pos);
379 DBG((dbg, LEVEL_DEFAULT, "edge %n,%d is no out edge of %n but of %n\n",
380 e->src, e->pos, irn, tgt));
385 void edges_verify(ir_graph *irg)
387 set *edges = _get_irg_edge_info(irg)->edges;
390 /* Clear the present bit in all edges available. */
391 for(e = set_first(edges); e; e = set_next(edges))
394 irg_walk_graph(irg, verify_set_presence, verify_list_presence, irg);
397 * Dump all edges which are not invalid and not present.
398 * These edges are superfluous and their presence in the
401 for(e = set_first(edges); e; e = set_next(edges)) {
402 if(!e->invalid && !e->present)
403 DBG((dbg, LEVEL_DEFAULT, "edge %n,%d is superfluous\n", e->src, e->pos));
407 void init_edges(void)
409 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
410 /* firm_dbg_set_mask(dbg, -1); */
414 const ir_edge_t *(get_irn_out_edge_first)(const ir_node *irn)
416 return _get_irn_out_edge_first(irn);
419 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last)
421 return _get_irn_out_edge_next(irn, last);
424 ir_node *(get_edge_src_irn)(const ir_edge_t *edge)
426 return _get_edge_src_irn(edge);
429 int (get_edge_src_pos)(const ir_edge_t *edge)
431 return _get_edge_src_pos(edge);
434 int (get_irn_n_edges)(const ir_node *irn)
436 return _get_irn_n_edges(irn);
440 #endif /* FIRM_EDGES_INPLACE */