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 void exchange_cdep(ir_node* old, const ir_node* new)
23 cdep* cdep = find_cdep(new);
25 pmap_insert(cdep_map, old, cdep);
29 static void add_cdep(ir_node* node, ir_node* dep_on)
31 cdep* dep = find_cdep(node);
33 ir_fprintf(stderr, "Adding cdep of %+F on %+F\n", node, dep_on);
37 cdep* newdep = malloc(sizeof(*newdep));
39 newdep->node = dep_on;
41 pmap_insert(cdep_map, node, newdep);
46 if (dep->node == dep_on) return;
47 if (dep->next == NULL) break;
50 newdep = malloc(sizeof(*newdep));
51 newdep->node = dep_on;
58 static void cdep_pre(ir_node* node, void* env)
64 * start and end block have no control depency
66 if (node == get_irg_start_block(get_irn_irg(node))) return;
67 if (node == get_irg_end_block(get_irn_irg(node))) return;
69 n = get_Block_n_cfgpreds(node);
70 for (i = 0; i < n; i++) {
71 ir_node* pred = get_Block_cfgpred_block(node, i);
75 if (is_Bad(pred)) continue;
77 pdom = get_Block_ipostdom(pred);
78 for (dependee = node; dependee != pdom; dependee = get_Block_ipostdom(dependee)) {
79 assert(!is_Bad(pdom));
80 add_cdep(dependee, pred);
89 static int cdep_edge_hook(FILE* F, ir_node* block)
97 pdom = get_Block_ipostdom(block);
101 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" color:gold}\n",
102 get_irn_node_nr(pdom), get_irn_node_nr(block)
107 for (cd = find_cdep(block); cd != NULL; cd = cd->next) {
110 "edge:{sourcename:\"n%ld\" targetname:\"n%ld\" "
111 "linestyle:dashed color:gold}\n",
112 get_irn_node_nr(block), get_irn_node_nr(cd->node)
120 void compute_cdep(ir_graph* irg)
122 cdep_map = pmap_create();
124 compute_postdoms(irg);
125 set_Block_ipostdom(get_irg_start_block(irg), get_irg_end_block(irg));
127 irg_block_walk_graph(irg, cdep_pre, NULL, NULL);
130 set_dump_block_edge_hook(cdep_edge_hook);
131 dump_ir_block_graph(irg, "_cdep");
132 set_dump_block_edge_hook(NULL);
139 void free_cdep(ir_graph* irg)
141 // TODO atm leaking more memory than a small memory leaking animal
145 int is_cdep_on(const ir_node* dependee, const ir_node* candidate)
149 for (dep = find_cdep(dependee); dep != NULL; dep = dep->next) {
150 if (dep->node == candidate) return 1;
156 int is_iterated_cdep_on(ir_node* dependee, ir_node* candidate)
160 while ((dep = find_cdep(dependee)) != NULL) {
161 if (dep->next != NULL) return 0;
162 if (dep->node == candidate) return 1;
163 dependee = dep->node;
169 ir_node* get_unique_cdep(const ir_node* block)
171 cdep* cdep = find_cdep(block);
173 return cdep != NULL && cdep->next == NULL ? cdep->node : NULL;
177 int has_multiple_cdep(const ir_node* block)
179 cdep* cdep = find_cdep(block);
181 return cdep != NULL && cdep->next != NULL;