#include "beinfo.h"
#include "bearch.h"
#include "benode.h"
+#include "besched.h"
#include "irgwalk.h"
#include "irnode_t.h"
+#include "irdump_t.h"
#include "error.h"
static copy_attr_func old_phi_copy_attr;
if (is_Proj(node))
return;
- obst = be_get_birg_obst(current_ir_graph);
+ obst = be_get_be_obst(current_ir_graph);
info = OALLOCZ(obst, backend_info_t);
assert(node->backend_info == NULL);
int be_infos_equal(const backend_info_t *info1, const backend_info_t *info2)
{
- int len = ARR_LEN(info1->out_infos);
- int i;
+ int len = ARR_LEN(info1->out_infos);
+ int i;
if (ARR_LEN(info2->out_infos) != len)
return false;
op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
}
+/**
+ * Edge hook to dump the schedule edges.
+ */
+static void sched_edge_hook(FILE *F, ir_node *irn)
+{
+ if (is_Proj(irn))
+ return;
+ if (get_irn_irg(irn)->be_data == NULL)
+ return;
+
+ if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
+ ir_node *prev = sched_prev(irn);
+ fprintf(F, "edge:{sourcename:\"");
+ PRINT_NODEID(irn);
+ fprintf(F, "\" targetname:\"");
+ PRINT_NODEID(prev);
+ fprintf(F, "\" color:magenta}\n");
+ }
+}
+
void be_info_init_irg(ir_graph *irg)
{
irg_walk_anchors(irg, init_walker, NULL, NULL);
+
+ set_dump_node_edge_hook(sched_edge_hook);
}
void be_info_free(void)