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 *nw)
24 cdep *cdep = find_cdep(nw);
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;
58 typedef struct cdep_env {
64 * Pre-block-walker: calculate the control dependence
66 static void cdep_pre(ir_node *node, void *ctx)
73 * start and end block have no control dependency
75 if (node == env->start_block) return;
76 if (node == env->end_block) return;
78 n = get_Block_n_cfgpreds(node);
79 for (i = 0; i < n; i++) {
80 ir_node *pred = get_Block_cfgpred_block(node, i);
84 if (is_Bad(pred)) continue;
86 pdom = get_Block_ipostdom(pred);
87 for (dependee = node; dependee != pdom; dependee = get_Block_ipostdom(dependee)) {
88 assert(!is_Bad(pdom));
89 add_cdep(dependee, pred);
98 * A block edge hook: add all cdep edges of block.
100 static int cdep_edge_hook(FILE *F, ir_node *block)
105 ir_node *pdom = get_Block_ipostdom(block);
109 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" color:gold}\n",
110 get_irn_node_nr(pdom), get_irn_node_nr(block)
115 for (cd = find_cdep(block); cd != NULL; cd = cd->next) {
118 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" "
119 "linestyle:dashed color:gold}\n",
120 get_irn_node_nr(block), get_irn_node_nr(cd->node)
128 void compute_cdep(ir_graph *irg)
130 ir_node *start_block, *rem;
133 cdep_map = pmap_create();
135 assure_postdoms(irg);
137 /* we must temporary change the post dominator relation */
138 start_block = get_irg_start_block(irg);
139 rem = get_Block_ipostdom(start_block);
140 set_Block_ipostdom(start_block, get_irg_end_block(irg));
142 env.start_block = get_irg_start_block(irg);
143 env.end_block = get_irg_end_block(irg);
144 irg_block_walk_graph(irg, cdep_pre, NULL, &env);
147 set_dump_block_edge_hook(cdep_edge_hook);
148 dump_ir_block_graph(irg, "_cdep");
149 set_dump_block_edge_hook(NULL);
151 (void) cdep_edge_hook;
154 /* restore the post dominator relation */
155 set_Block_ipostdom(start_block, rem);
159 void free_cdep(ir_graph *irg)
161 // TODO atm leaking more memory than a small memory leaking animal
165 int is_cdep_on(const ir_node *dependee, const ir_node *candidate)
169 for (dep = find_cdep(dependee); dep != NULL; dep = dep->next) {
170 if (dep->node == candidate) return 1;
176 int is_iterated_cdep_on(ir_node *dependee, ir_node *candidate)
180 while ((dep = find_cdep(dependee)) != NULL) {
181 if (dep->next != NULL) return 0;
182 if (dep->node == candidate) return 1;
183 dependee = dep->node;
189 ir_node *get_unique_cdep(const ir_node *block)
191 cdep *cdep = find_cdep(block);
193 return cdep != NULL && cdep->next == NULL ? cdep->node : NULL;
197 int has_multiple_cdep(const ir_node *block)
199 cdep *cdep = find_cdep(block);
201 return cdep != NULL && cdep->next != NULL;