12 static pmap *cdep_map;
14 cdep *find_cdep(const ir_node *block)
16 return pmap_get(cdep_map, (void *)block);
20 void exchange_cdep(ir_node *old, const ir_node *nw)
22 cdep *cdep = find_cdep(nw);
24 pmap_insert(cdep_map, old, cdep);
28 static void add_cdep(ir_node* node, ir_node* dep_on)
30 cdep *dep = find_cdep(node);
32 ir_fprintf(stderr, "Adding cdep of %+F on %+F\n", node, dep_on);
36 cdep *newdep = xmalloc(sizeof(*newdep));
38 newdep->node = dep_on;
40 pmap_insert(cdep_map, node, newdep);
45 if (dep->node == dep_on) return;
46 if (dep->next == NULL) break;
49 newdep = xmalloc(sizeof(*newdep));
50 newdep->node = dep_on;
56 typedef struct cdep_env {
62 * Pre-block-walker: calculate the control dependence
64 static void cdep_pre(ir_node *node, void *ctx)
71 * start and end block have no control dependency
73 if (node == env->start_block) return;
74 if (node == env->end_block) return;
76 n = get_Block_n_cfgpreds(node);
77 for (i = 0; i < n; i++) {
78 ir_node *pred = get_Block_cfgpred_block(node, i);
82 if (is_Bad(pred)) continue;
84 pdom = get_Block_ipostdom(pred);
85 for (dependee = node; dependee != pdom; dependee = get_Block_ipostdom(dependee)) {
86 assert(!is_Bad(pdom));
87 add_cdep(dependee, pred);
96 * A block edge hook: add all cdep edges of block.
98 static int cdep_edge_hook(FILE *F, ir_node *block)
103 ir_node *pdom = get_Block_ipostdom(block);
107 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" color:gold}\n",
108 get_irn_node_nr(pdom), get_irn_node_nr(block)
113 for (cd = find_cdep(block); cd != NULL; cd = cd->next) {
116 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" "
117 "linestyle:dashed color:gold}\n",
118 get_irn_node_nr(block), get_irn_node_nr(cd->node)
126 void compute_cdep(ir_graph *irg)
128 ir_node *start_block, *rem;
131 cdep_map = pmap_create();
133 assure_postdoms(irg);
135 /* we must temporary change the post dominator relation */
136 start_block = get_irg_start_block(irg);
137 rem = get_Block_ipostdom(start_block);
138 set_Block_ipostdom(start_block, get_irg_end_block(irg));
140 env.start_block = get_irg_start_block(irg);
141 env.end_block = get_irg_end_block(irg);
142 irg_block_walk_graph(irg, cdep_pre, NULL, &env);
145 set_dump_block_edge_hook(cdep_edge_hook);
146 dump_ir_block_graph(irg, "_cdep");
147 set_dump_block_edge_hook(NULL);
149 (void) cdep_edge_hook;
152 /* restore the post dominator relation */
153 set_Block_ipostdom(start_block, rem);
157 void free_cdep(ir_graph *irg)
159 // TODO atm leaking more memory than a small memory leaking animal
163 int is_cdep_on(const ir_node *dependee, const ir_node *candidate)
167 for (dep = find_cdep(dependee); dep != NULL; dep = dep->next) {
168 if (dep->node == candidate) return 1;
174 int is_iterated_cdep_on(ir_node *dependee, ir_node *candidate)
178 while ((dep = find_cdep(dependee)) != NULL) {
179 if (dep->next != NULL) return 0;
180 if (dep->node == candidate) return 1;
181 dependee = dep->node;
187 ir_node *get_unique_cdep(const ir_node *block)
189 cdep *cdep = find_cdep(block);
191 return cdep != NULL && cdep->next == NULL ? cdep->node : NULL;
195 int has_multiple_cdep(const ir_node *block)
197 cdep *cdep = find_cdep(block);
199 return cdep != NULL && cdep->next != NULL;