12 typedef unsigned int uint;
14 static pmap* cdep_map;
16 cdep* find_cdep(const ir_node* block)
18 return pmap_get(cdep_map, (void*)block);
22 void exchange_cdep(ir_node* old, const ir_node* new)
24 cdep* cdep = find_cdep(new);
26 pmap_insert(cdep_map, old, cdep);
30 static void add_cdep(ir_node* node, ir_node* dep_on)
32 cdep* dep = find_cdep(node);
34 ir_fprintf(stderr, "Adding cdep of %+F on %+F\n", node, dep_on);
38 cdep* newdep = xmalloc(sizeof(*newdep));
40 newdep->node = dep_on;
42 pmap_insert(cdep_map, node, newdep);
47 if (dep->node == dep_on) return;
48 if (dep->next == NULL) break;
51 newdep = xmalloc(sizeof(*newdep));
52 newdep->node = dep_on;
59 static void cdep_pre(ir_node* node, void* env)
65 * start and end block have no control depency
67 if (node == get_irg_start_block(get_irn_irg(node))) return;
68 if (node == get_irg_end_block(get_irn_irg(node))) return;
70 n = get_Block_n_cfgpreds(node);
71 for (i = 0; i < n; i++) {
72 ir_node* pred = get_Block_cfgpred_block(node, i);
76 if (is_Bad(pred)) continue;
78 pdom = get_Block_ipostdom(pred);
79 for (dependee = node; dependee != pdom; dependee = get_Block_ipostdom(dependee)) {
80 assert(!is_Bad(pdom));
81 add_cdep(dependee, pred);
90 static int cdep_edge_hook(FILE* F, ir_node* block)
98 pdom = get_Block_ipostdom(block);
102 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" color:gold}\n",
103 get_irn_node_nr(pdom), get_irn_node_nr(block)
108 for (cd = find_cdep(block); cd != NULL; cd = cd->next) {
111 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" "
112 "linestyle:dashed color:gold}\n",
113 get_irn_node_nr(block), get_irn_node_nr(cd->node)
121 void compute_cdep(ir_graph* irg)
123 cdep_map = pmap_create();
125 compute_postdoms(irg);
126 set_Block_ipostdom(get_irg_start_block(irg), get_irg_end_block(irg));
128 irg_block_walk_graph(irg, cdep_pre, NULL, NULL);
131 set_dump_block_edge_hook(cdep_edge_hook);
132 dump_ir_block_graph(irg, "_cdep");
133 set_dump_block_edge_hook(NULL);
140 void free_cdep(ir_graph* irg)
142 // TODO atm leaking more memory than a small memory leaking animal
146 int is_cdep_on(const ir_node* dependee, const ir_node* candidate)
150 for (dep = find_cdep(dependee); dep != NULL; dep = dep->next) {
151 if (dep->node == candidate) return 1;
157 int is_iterated_cdep_on(ir_node* dependee, ir_node* candidate)
161 while ((dep = find_cdep(dependee)) != NULL) {
162 if (dep->next != NULL) return 0;
163 if (dep->node == candidate) return 1;
164 dependee = dep->node;
170 ir_node* get_unique_cdep(const ir_node* block)
172 cdep* cdep = find_cdep(block);
174 return cdep != NULL && cdep->next == NULL ? cdep->node : NULL;
178 int has_multiple_cdep(const ir_node* block)
180 cdep* cdep = find_cdep(block);
182 return cdep != NULL && cdep->next != NULL;