11 typedef unsigned int uint;
13 static pmap* cdep_map;
15 cdep* find_cdep(const ir_node* block)
17 return pmap_get(cdep_map, (void*)block);
21 static void add_cdep(ir_node* node, ir_node* dep_on)
23 cdep* dep = find_cdep(node);
25 ir_fprintf(stderr, "Adding cdep of %+F on %+F\n", node, dep_on);
29 cdep* newdep = malloc(sizeof(*newdep));
31 newdep->node = dep_on;
33 pmap_insert(cdep_map, node, newdep);
38 if (dep->node == dep_on) return;
39 if (dep->next == NULL) break;
42 newdep = malloc(sizeof(*newdep));
43 newdep->node = dep_on;
50 static void cdep_pre(ir_node* node, void* env)
56 * start and end block have no control depency
58 if (node == get_irg_start_block(get_irn_irg(node))) return;
59 if (node == get_irg_end_block(get_irn_irg(node))) return;
61 n = get_Block_n_cfgpreds(node);
62 for (i = 0; i < n; i++) {
63 ir_node* pred = get_Block_cfgpred_block(node, i);
67 if (is_Bad(pred)) continue;
69 pdom = get_Block_ipostdom(pred);
70 for (dependee = node; dependee != pdom; dependee = get_Block_ipostdom(dependee)) {
71 assert(!is_Bad(pdom));
72 add_cdep(dependee, pred);
81 static int cdep_edge_hook(FILE* F, ir_node* block)
89 pdom = get_Block_ipostdom(block);
93 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" color:gold}\n",
94 get_irn_node_nr(pdom), get_irn_node_nr(block)
99 for (cd = find_cdep(block); cd != NULL; cd = cd->next) {
102 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" "
103 "linestyle:dashed color:gold}\n",
104 get_irn_node_nr(block), get_irn_node_nr(cd->node)
112 void compute_cdep(ir_graph* irg)
114 cdep_map = pmap_create();
116 compute_postdoms(irg);
117 set_Block_ipostdom(get_irg_start_block(irg), get_irg_end_block(irg));
119 irg_block_walk_graph(irg, cdep_pre, NULL, NULL);
122 set_dump_block_edge_hook(cdep_edge_hook);
123 dump_ir_block_graph(irg, "_cdep");
124 set_dump_block_edge_hook(NULL);
131 void free_cdep(ir_graph* irg)
133 // TODO atm leaking more memory than a small memory leaking animal
137 int is_iterated_cdep_on(ir_node* dependee, ir_node* candidate)
141 while ((dep = find_cdep(dependee)) != NULL) {
142 if (dep->next != NULL) return 0;
143 if (dep->node == candidate) return 1;
144 dependee = dep->node;
150 ir_node* get_unique_cdep(const ir_node* block)
152 cdep* cdep = find_cdep(block);
154 return cdep != NULL && cdep->next == NULL ? cdep->node : NULL;
158 int has_multiple_cdep(const ir_node* block)
160 cdep* cdep = find_cdep(block);
162 return cdep != NULL && cdep->next != NULL;