2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief parallelizing Load/Store optimisation
23 * @author Christoph Mallon
27 #include "iroptimize.h"
38 #include "irnodeset.h"
45 typedef struct parallelize_info
47 ir_node *origin_block;
50 ir_nodeset_t this_mem;
51 ir_nodeset_t user_mem;
54 static void parallelize_load(parallelize_info *pi, ir_node *irn)
56 /* There is no point in investigating the same subgraph twice */
57 if (ir_nodeset_contains(&pi->user_mem, irn))
60 if (get_nodes_block(irn) == pi->origin_block) {
62 ir_node *pred = get_Proj_pred(irn);
64 get_Load_volatility(pred) == volatility_non_volatile) {
65 ir_node *mem = get_Load_mem(pred);
66 //ir_nodeset_insert(&pi->this_mem, mem);
67 ir_nodeset_insert(&pi->user_mem, irn);
68 parallelize_load(pi, mem);
70 } else if (is_Store(pred) &&
71 get_Store_volatility(pred) == volatility_non_volatile) {
72 ir_mode *org_mode = pi->origin_mode;
73 ir_node *org_ptr = pi->origin_ptr;
74 ir_mode *store_mode = get_irn_mode(get_Store_value(pred));
75 ir_node *store_ptr = get_Store_ptr(pred);
76 if (get_alias_relation(org_ptr, org_mode, store_ptr, store_mode) == ir_no_alias) {
77 ir_node *mem = get_Store_mem(pred);
78 ir_nodeset_insert(&pi->user_mem, irn);
79 parallelize_load(pi, mem);
83 } else if (is_Sync(irn)) {
84 int n = get_Sync_n_preds(irn);
87 for (i = 0; i < n; ++i) {
88 ir_node *sync_pred = get_Sync_pred(irn, i);
89 parallelize_load(pi, sync_pred);
94 ir_nodeset_insert(&pi->this_mem, irn);
97 static void parallelize_store(parallelize_info *pi, ir_node *irn)
99 /* There is no point in investigating the same subgraph twice */
100 if (ir_nodeset_contains(&pi->user_mem, irn))
103 //ir_fprintf(stderr, "considering %+F\n", irn);
104 if (get_nodes_block(irn) == pi->origin_block) {
106 ir_node *pred = get_Proj_pred(irn);
108 get_Load_volatility(pred) == volatility_non_volatile) {
109 ir_mode *org_mode = pi->origin_mode;
110 ir_node *org_ptr = pi->origin_ptr;
111 ir_mode *load_mode = get_Load_mode(pred);
112 ir_node *load_ptr = get_Load_ptr(pred);
113 if (get_alias_relation(org_ptr, org_mode, load_ptr, load_mode) == ir_no_alias) {
114 ir_node *mem = get_Load_mem(pred);
115 ir_nodeset_insert(&pi->user_mem, irn);
116 parallelize_store(pi, mem);
119 } else if (is_Store(pred) &&
120 get_Store_volatility(pred) == volatility_non_volatile) {
121 ir_mode *org_mode = pi->origin_mode;
122 ir_node *org_ptr = pi->origin_ptr;
123 ir_mode *store_mode = get_irn_mode(get_Store_value(pred));
124 ir_node *store_ptr = get_Store_ptr(pred);
125 if (get_alias_relation(org_ptr, org_mode, store_ptr, store_mode) == ir_no_alias) {
128 ir_nodeset_insert(&pi->user_mem, irn);
129 mem = get_Store_mem(pred);
130 parallelize_store(pi, mem);
134 } else if (is_Sync(irn)) {
135 int n = get_Sync_n_preds(irn);
138 for (i = 0; i < n; ++i) {
139 ir_node *sync_pred = get_Sync_pred(irn, i);
140 parallelize_store(pi, sync_pred);
145 ir_nodeset_insert(&pi->this_mem, irn);
148 static void walker(ir_node *proj, void *env)
158 if (!is_Proj(proj)) return;
159 if (get_irn_mode(proj) != mode_M) return;
161 mem_op = get_Proj_pred(proj);
162 if (is_Load(mem_op)) {
163 if (get_Load_volatility(mem_op) != volatility_non_volatile) return;
165 block = get_nodes_block(mem_op);
166 pred = get_Load_mem(mem_op);
168 pi.origin_block = block,
169 pi.origin_ptr = get_Load_ptr(mem_op);
170 pi.origin_mode = get_Load_mode(mem_op);
171 ir_nodeset_init(&pi.this_mem);
172 ir_nodeset_init(&pi.user_mem);
174 parallelize_load(&pi, pred);
175 } else if (is_Store(mem_op)) {
176 if (get_Store_volatility(mem_op) != volatility_non_volatile) return;
178 block = get_nodes_block(mem_op);
179 pred = get_Store_mem(mem_op);
181 pi.origin_block = block,
182 pi.origin_ptr = get_Store_ptr(mem_op);
183 pi.origin_mode = get_irn_mode(get_Store_value(mem_op));
184 ir_nodeset_init(&pi.this_mem);
185 ir_nodeset_init(&pi.user_mem);
187 parallelize_store(&pi, pred);
192 n = ir_nodeset_size(&pi.user_mem);
193 if (n != 0) { /* nothing happened otherwise */
194 ir_graph *irg = get_irn_irg(block);
197 ir_nodeset_iterator_t iter;
201 NEW_ARR_A(ir_node*, in, n);
203 in[i++] = new_r_Unknown(irg, mode_M);
204 ir_nodeset_iterator_init(&iter, &pi.user_mem);
206 ir_node* p = ir_nodeset_iterator_next(&iter);
207 if (p == NULL) break;
211 sync = new_r_Sync(block, n, in);
212 exchange(proj, sync);
214 assert((long)pn_Load_M == (long)pn_Store_M);
215 proj = new_r_Proj(mem_op, mode_M, pn_Load_M);
216 set_Sync_pred(sync, 0, proj);
218 n = ir_nodeset_size(&pi.this_mem);
219 ir_nodeset_iterator_init(&iter, &pi.this_mem);
221 sync = ir_nodeset_iterator_next(&iter);
223 NEW_ARR_A(ir_node*, in, n);
226 ir_node* p = ir_nodeset_iterator_next(&iter);
227 if (p == NULL) break;
231 sync = new_r_Sync(block, n, in);
233 set_memop_mem(mem_op, sync);
236 ir_nodeset_destroy(&pi.this_mem);
237 ir_nodeset_destroy(&pi.user_mem);
240 void opt_parallelize_mem(ir_graph *irg)
242 irg_walk_graph(irg, NULL, walker, NULL);
243 confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_CONTROL_FLOW);
246 ir_graph_pass_t *opt_parallelize_mem_pass(const char *name)
248 return def_graph_pass(name ? name : "parallelize-mem", opt_parallelize_mem);