2 * Copyright 2012 INRIA Paris-Rocquencourt
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Tobias Grosser, INRIA Paris-Rocquencourt,
7 * Domaine de Voluceau, Rocquenqourt, B.P. 105,
8 * 78153 Le Chesnay Cedex France
17 #include <isl/ast_build.h>
22 #include "pet_printer.h"
26 /* Representation of a statement inside a generated AST.
28 * "stmt" refers to the original statement.
29 * "n_access" is the number of accesses in the statement.
30 * "access" is the list of accesses transformed to refer to the iterators
31 * in the generated AST.
34 struct pet_stmt
*stmt
;
37 isl_ast_expr_list
**access
;
40 static void ppcg_stmt_free(void *user
)
42 struct ppcg_stmt
*stmt
= user
;
48 for (i
= 0; i
< stmt
->n_access
; ++i
)
49 isl_ast_expr_list_free(stmt
->access
[i
]);
55 /* Derive the output file name from the input file name.
56 * 'input' is the entire path of the input file. The output
57 * is the file name plus the additional extension.
59 * We will basically replace everything after the last point
60 * with '.ppcg.c'. This means file.c becomes file.ppcg.c
62 static FILE *get_output_file(const char *input
, const char *output
)
67 const char ppcg_marker
[] = ".ppcg";
70 base
= strrchr(input
, '/');
75 ext
= strrchr(base
, '.');
76 len
= ext
? ext
- base
: strlen(base
);
78 memcpy(name
, base
, len
);
79 strcpy(name
+ len
, ppcg_marker
);
80 strcpy(name
+ len
+ sizeof(ppcg_marker
) - 1, ext
);
85 return fopen(output
, "w");
88 /* Print a memory access 'access' to the printer 'p'.
90 * "expr" refers to the original access.
91 * "access" is the list of index expressions transformed to refer
92 * to the iterators of the generated AST.
94 * In case the original access is unnamed (and presumably single-dimensional),
95 * we assume this is not a memory access, but just an expression.
97 static __isl_give isl_printer
*print_access(__isl_take isl_printer
*p
,
98 struct pet_expr
*expr
, __isl_keep isl_ast_expr_list
*access
)
104 n_index
= isl_ast_expr_list_n_ast_expr(access
);
105 name
= isl_map_get_tuple_name(expr
->acc
.access
, isl_dim_out
);
109 index
= isl_ast_expr_list_get_ast_expr(access
, 0);
110 p
= isl_printer_print_str(p
, "(");
111 p
= isl_printer_print_ast_expr(p
, index
);
112 p
= isl_printer_print_str(p
, ")");
113 isl_ast_expr_free(index
);
117 p
= isl_printer_print_str(p
, name
);
119 for (i
= 0; i
< n_index
; ++i
) {
122 index
= isl_ast_expr_list_get_ast_expr(access
, i
);
124 p
= isl_printer_print_str(p
, "[");
125 p
= isl_printer_print_ast_expr(p
, index
);
126 p
= isl_printer_print_str(p
, "]");
127 isl_ast_expr_free(index
);
133 /* Find the element in scop->stmts that has the given "id".
135 static struct pet_stmt
*find_stmt(struct ppcg_scop
*scop
, __isl_keep isl_id
*id
)
139 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
140 struct pet_stmt
*stmt
= scop
->stmts
[i
];
143 id_i
= isl_set_get_tuple_id(stmt
->domain
);
150 isl_die(isl_id_get_ctx(id
), isl_error_internal
,
151 "statement not found", return NULL
);
154 /* To print the transformed accesses we walk the list of transformed accesses
155 * simultaneously with the pet printer. This means that whenever
156 * the pet printer prints a pet access expression we have
157 * the corresponding transformed access available for printing.
159 static __isl_give isl_printer
*print_access_expr(__isl_take isl_printer
*p
,
160 struct pet_expr
*expr
, void *user
)
162 isl_ast_expr_list
***access
= user
;
164 p
= print_access(p
, expr
, **access
);
170 /* Print a user statement in the generated AST.
171 * The ppcg_stmt has been attached to the node in at_each_domain.
173 static __isl_give isl_printer
*print_user(__isl_take isl_printer
*p
,
174 __isl_keep isl_ast_node
*node
, void *user
)
176 struct ppcg_stmt
*stmt
;
177 isl_ast_expr_list
**access
;
180 id
= isl_ast_node_get_annotation(node
);
181 stmt
= isl_id_get_user(id
);
184 access
= stmt
->access
;
186 p
= isl_printer_start_line(p
);
187 p
= print_pet_expr(p
, stmt
->stmt
->body
, &print_access_expr
, &access
);
188 p
= isl_printer_print_str(p
, ";");
189 p
= isl_printer_end_line(p
);
194 /* Call "fn" on each access expression in "expr".
196 static int foreach_access_expr(struct pet_expr
*expr
,
197 int (*fn
)(struct pet_expr
*expr
, void *user
), void *user
)
204 if (expr
->type
== pet_expr_access
)
205 return fn(expr
, user
);
207 for (i
= 0; i
< expr
->n_arg
; ++i
)
208 if (foreach_access_expr(expr
->args
[i
], fn
, user
) < 0)
214 static int inc_n_access(struct pet_expr
*expr
, void *user
)
216 struct ppcg_stmt
*stmt
= user
;
221 /* Internal data for add_access.
223 * "stmt" is the statement to which an access needs to be added.
224 * "build" is the current AST build.
225 * "map" maps the AST loop iterators to the iteration domain of the statement.
227 struct ppcg_add_access_data
{
228 struct ppcg_stmt
*stmt
;
229 isl_ast_build
*build
;
233 /* Given an access expression, add it to data->stmt after
234 * transforming it to refer to the AST loop iterators.
236 static int add_access(struct pet_expr
*expr
, void *user
)
241 isl_pw_multi_aff
*pma
;
242 struct ppcg_add_access_data
*data
= user
;
243 isl_ast_expr_list
*index
;
245 ctx
= isl_map_get_ctx(expr
->acc
.access
);
246 n
= isl_map_dim(expr
->acc
.access
, isl_dim_out
);
247 access
= isl_map_copy(expr
->acc
.access
);
248 access
= isl_map_apply_range(isl_map_copy(data
->map
), access
);
249 pma
= isl_pw_multi_aff_from_map(access
);
250 pma
= isl_pw_multi_aff_coalesce(pma
);
252 index
= isl_ast_expr_list_alloc(ctx
, n
);
253 for (i
= 0; i
< n
; ++i
) {
257 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
258 expr
= isl_ast_build_expr_from_pw_aff(data
->build
, pa
);
259 index
= isl_ast_expr_list_add(index
, expr
);
261 isl_pw_multi_aff_free(pma
);
263 data
->stmt
->access
[data
->stmt
->n_access
] = index
;
264 data
->stmt
->n_access
++;
268 /* Transform the accesses in the statement associated to the domain
269 * called by "node" to refer to the AST loop iterators,
270 * collect them in a ppcg_stmt and annotate the node with the ppcg_stmt.
272 static __isl_give isl_ast_node
*at_each_domain(__isl_take isl_ast_node
*node
,
273 __isl_keep isl_ast_build
*build
, void *user
)
275 struct ppcg_scop
*scop
= user
;
276 isl_ast_expr
*expr
, *arg
;
280 struct ppcg_stmt
*stmt
;
281 struct ppcg_add_access_data data
;
283 ctx
= isl_ast_node_get_ctx(node
);
284 stmt
= isl_calloc_type(ctx
, struct ppcg_stmt
);
288 expr
= isl_ast_node_user_get_expr(node
);
289 arg
= isl_ast_expr_get_op_arg(expr
, 0);
290 isl_ast_expr_free(expr
);
291 id
= isl_ast_expr_get_id(arg
);
292 isl_ast_expr_free(arg
);
293 stmt
->stmt
= find_stmt(scop
, id
);
299 if (foreach_access_expr(stmt
->stmt
->body
, &inc_n_access
, stmt
) < 0)
302 stmt
->access
= isl_calloc_array(ctx
, isl_ast_expr_list
*,
307 map
= isl_map_from_union_map(isl_ast_build_get_schedule(build
));
308 map
= isl_map_reverse(map
);
314 if (foreach_access_expr(stmt
->stmt
->body
, &add_access
, &data
) < 0)
315 node
= isl_ast_node_free(node
);
319 id
= isl_id_alloc(isl_ast_node_get_ctx(node
), NULL
, stmt
);
320 id
= isl_id_set_free_user(id
, &ppcg_stmt_free
);
321 return isl_ast_node_set_annotation(node
, id
);
323 ppcg_stmt_free(stmt
);
324 return isl_ast_node_free(node
);
327 /* Code generate the scop 'scop' and print the corresponding C code to 'p'.
329 static __isl_give isl_printer
*print_scop(isl_ctx
*ctx
, struct ppcg_scop
*scop
,
330 __isl_take isl_printer
*p
)
333 isl_union_set
*domain_set
;
334 isl_union_map
*schedule_map
;
335 isl_ast_build
*build
;
336 isl_ast_print_options
*print_options
;
339 context
= isl_set_copy(scop
->context
);
340 domain_set
= isl_union_set_copy(scop
->domain
);
341 schedule_map
= isl_union_map_copy(scop
->schedule
);
342 schedule_map
= isl_union_map_intersect_domain(schedule_map
, domain_set
);
344 build
= isl_ast_build_from_context(context
);
345 build
= isl_ast_build_set_at_each_domain(build
, &at_each_domain
, scop
);
346 tree
= isl_ast_build_ast_from_schedule(build
, schedule_map
);
347 isl_ast_build_free(build
);
349 print_options
= isl_ast_print_options_alloc(ctx
);
350 print_options
= isl_ast_print_options_set_print_user(print_options
,
353 p
= isl_ast_node_print_macros(tree
, p
);
354 p
= isl_ast_node_print(tree
, p
, print_options
);
356 isl_ast_print_options_free(print_options
);
358 isl_ast_node_free(tree
);
363 /* Does "scop" refer to any arrays that are declared, but not
364 * exposed to the code after the scop?
366 static int any_hidden_declarations(struct ppcg_scop
*scop
)
373 for (i
= 0; i
< scop
->n_array
; ++i
)
374 if (scop
->arrays
[i
]->declared
&& !scop
->arrays
[i
]->exposed
)
380 int generate_cpu(isl_ctx
*ctx
, struct ppcg_scop
*ps
,
381 struct ppcg_options
*options
, const char *input
, const char *output
)
391 input_file
= fopen(input
, "r");
392 output_file
= get_output_file(input
, output
);
394 copy_before_scop(input_file
, output_file
);
395 fprintf(output_file
, "/* ppcg generated CPU code */\n\n");
396 p
= isl_printer_to_file(ctx
, output_file
);
397 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
398 p
= ppcg_print_exposed_declarations(p
, ps
);
399 hidden
= any_hidden_declarations(ps
);
401 p
= ppcg_start_block(p
);
402 p
= ppcg_print_hidden_declarations(p
, ps
);
404 p
= print_scop(ctx
, ps
, p
);
406 p
= ppcg_end_block(p
);
408 copy_after_scop(input_file
, output_file
);