2 * Copyright 2010-2011 INRIA Saclay
3 * Copyright 2012-2013 Ecole Normale Superieure
5 * Use of this software is governed by the MIT license
7 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
8 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
10 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
17 #include <isl/polynomial.h>
18 #include <isl/union_set.h>
22 #include <isl/schedule.h>
23 #include <isl/schedule_node.h>
24 #include <isl/options.h>
25 #include <isl/ast_build.h>
29 #include "gpu_array_tile.h"
30 #include "gpu_group.h"
33 #include "ppcg_options.h"
36 struct gpu_array_info
;
38 /* Collect all references to the given array and store pointers to them
41 * If the array contains structures, then there is no need to collect
42 * the references since we will not be computing any reference groups.
44 static void collect_references(struct gpu_prog
*prog
,
45 struct gpu_array_info
*array
)
50 if (array
->has_compound_element
)
54 for (i
= 0; i
< prog
->n_stmts
; ++i
) {
55 struct gpu_stmt
*stmt
= &prog
->stmts
[i
];
56 struct gpu_stmt_access
*access
;
58 for (access
= stmt
->accesses
; access
; access
= access
->next
) {
60 name
= isl_map_get_tuple_name(access
->access
,
62 if (name
&& !strcmp(array
->name
, name
))
68 array
->refs
= isl_alloc_array(prog
->ctx
, struct gpu_stmt_access
*, n
);
72 for (i
= 0; i
< prog
->n_stmts
; ++i
) {
73 struct gpu_stmt
*stmt
= &prog
->stmts
[i
];
74 struct gpu_stmt_access
*access
;
76 for (access
= stmt
->accesses
; access
; access
= access
->next
) {
78 name
= isl_map_get_tuple_name(access
->access
,
80 if (!name
|| strcmp(array
->name
, name
))
83 array
->refs
[n
++] = access
;
88 /* Compute and return the extent of "array", taking into account the set of
91 * In particular, the extent in the outer dimension is taken
92 * from "accessed", while the extents in the remaining dimensions
93 * are taken from array->extent.
95 * The extent in the outer dimension cannot be taken from array->extent
96 * because that may be unbounded. Furthermore, even if it is bounded,
97 * it may be larger than the piece of the array that is being accessed.
99 static __isl_give isl_set
*compute_extent(struct pet_array
*array
,
100 __isl_keep isl_set
*accessed
)
107 extent
= isl_set_copy(array
->extent
);
109 n_index
= isl_set_dim(accessed
, isl_dim_set
);
113 extent
= isl_set_project_out(extent
, isl_dim_set
, 0, 1);
114 outer
= isl_set_copy(accessed
);
115 outer
= isl_set_project_out(outer
, isl_dim_set
, 1, n_index
- 1);
116 extent
= isl_set_flat_product(outer
, extent
);
117 id
= isl_set_get_tuple_id(accessed
);
118 extent
= isl_set_set_tuple_id(extent
, id
);
123 /* Is the array "array" being extracted a read-only scalar?
125 * That is, is "array" a scalar that is never possibly written to.
126 * An array containing structures is never considered to be a scalar.
128 static int is_read_only_scalar(struct gpu_array_info
*array
,
129 struct gpu_prog
*prog
)
132 isl_union_map
*write
;
135 if (array
->has_compound_element
)
137 if (array
->n_index
!= 0)
140 write
= isl_union_map_copy(prog
->may_write
);
141 space
= isl_set_universe(isl_space_copy(array
->space
));
142 write
= isl_union_map_intersect_range(write
,
143 isl_union_set_from_set(space
));
144 empty
= isl_union_map_is_empty(write
);
145 isl_union_map_free(write
);
150 /* Compute bounds on the host array "pa" based on the corresponding
151 * accessed elements in "arrays"
152 * and collect all references to the array.
153 * Store the results in "info".
155 * If the array is zero-dimensional and does not contain structures,
156 * i.e., if the array is a scalar, we check whether it is read-only.
157 * We also check whether the array is accessed at all.
159 static int extract_array_info(struct gpu_prog
*prog
,
160 struct gpu_array_info
*info
, struct pet_array
*pa
,
161 __isl_keep isl_union_set
*arrays
)
167 isl_set
*accessed
, *extent
;
169 n_index
= isl_set_dim(pa
->extent
, isl_dim_set
);
170 name
= isl_set_get_tuple_name(pa
->extent
);
171 bounds
= isl_alloc_array(prog
->ctx
, isl_pw_aff
*, n_index
);
175 info
->space
= isl_set_get_space(pa
->extent
);
176 info
->name
= strdup(name
);
177 info
->n_index
= n_index
;
178 info
->bound
= bounds
;
179 info
->linearize
= prog
->scop
->options
->linearize_device_arrays
;
181 info
->type
= strdup(pa
->element_type
);
182 info
->size
= pa
->element_size
;
183 info
->local
= pa
->declared
&& !pa
->exposed
;
184 info
->has_compound_element
= pa
->element_is_record
;
185 info
->read_only_scalar
= is_read_only_scalar(info
, prog
);
187 accessed
= isl_union_set_extract_set(arrays
,
188 isl_space_copy(info
->space
));
189 empty
= isl_set_is_empty(accessed
);
190 extent
= compute_extent(pa
, accessed
);
191 isl_set_free(accessed
);
192 info
->extent
= extent
;
195 info
->accessed
= !empty
;
196 for (i
= 0; i
< n_index
; ++i
) {
202 dom
= isl_set_copy(extent
);
203 dom
= isl_set_project_out(dom
, isl_dim_set
, i
+ 1,
205 dom
= isl_set_project_out(dom
, isl_dim_set
, 0, i
);
206 if (!isl_set_dim_has_upper_bound(dom
, isl_dim_set
, 0)) {
207 fprintf(stderr
, "unable to determine extent of '%s' "
208 "in dimension %d\n", info
->name
, i
);
209 dom
= isl_set_free(dom
);
211 bound
= isl_set_dim_max(dom
, 0);
212 dom
= isl_pw_aff_domain(isl_pw_aff_copy(bound
));
213 ls
= isl_local_space_from_space(isl_set_get_space(dom
));
214 one
= isl_aff_zero_on_domain(ls
);
215 one
= isl_aff_add_constant_si(one
, 1);
216 bound
= isl_pw_aff_add(bound
, isl_pw_aff_alloc(dom
, one
));
217 bound
= isl_pw_aff_gist(bound
, isl_set_copy(prog
->context
));
220 if (!isl_pw_aff_is_cst(bound
))
224 collect_references(prog
, info
);
229 /* Remove independence from the order constraints "order" on array "array".
230 * Since the pairs of iterations in the filter relation of an independence
231 * are guaranteed to be completely independent by the user, there is
232 * no need to ensure that live ranges are ordered along thong pairs.
233 * We make an exception for local variables, though, as the independence
234 * guarantee does not apply to those.
236 * The order constraints are used in two places.
237 * Those on scalars are used in check_scalar_live_ranges to check if
238 * we need to force the scalar to be private. Any non-local scalar
239 * should not be forced scalar if it only appears in independent loops.
240 * Those on non-scalars are added to the coincidence constraints
241 * in compute_schedule because we do not support any array expansion.
242 * Accesses to non-local arrays should not prevent a loop from being
243 * considered coincident so we should indeed remove those constraints
244 * from the order constraints.
246 static __isl_give isl_union_map
*remove_independences(struct gpu_prog
*prog
,
247 struct gpu_array_info
*array
, __isl_take isl_union_map
*order
)
251 for (i
= 0; i
< prog
->scop
->pet
->n_independence
; ++i
) {
252 struct pet_independence
*pi
= prog
->scop
->pet
->independences
[i
];
253 if (isl_union_set_contains(pi
->local
, array
->space
))
256 order
= isl_union_map_subtract(order
,
257 isl_union_map_copy(pi
->filter
));
263 /* For each array in "prog", store the (untagged) order dependences
264 * derived from the array in array->dep_order.
265 * In particular, consider all references that access the given array
266 * and take the order dependences that have one of these references
267 * as source. (Since an order dependence relates two references to
268 * the same array, the target of these order dependences will also
269 * be one of these references.)
270 * Additionally, store the union of these array->dep_order relations
271 * for all non-scalar arrays in prog->array_order.
273 void collect_order_dependences(struct gpu_prog
*prog
)
277 isl_union_map
*accesses
;
279 space
= isl_union_map_get_space(prog
->read
);
280 prog
->array_order
= isl_union_map_empty(space
);
282 accesses
= isl_union_map_copy(prog
->scop
->tagged_reads
);
283 accesses
= isl_union_map_union(accesses
,
284 isl_union_map_copy(prog
->scop
->tagged_may_writes
));
285 accesses
= isl_union_map_universe(accesses
);
286 accesses
= isl_union_map_apply_range(accesses
,
287 isl_union_map_copy(prog
->to_outer
));
289 for (i
= 0; i
< prog
->n_array
; ++i
) {
290 struct gpu_array_info
*array
= &prog
->array
[i
];
293 isl_union_map
*order
;
295 set
= isl_set_universe(isl_space_copy(array
->space
));
296 uset
= isl_union_set_from_set(set
);
297 uset
= isl_union_map_domain(
298 isl_union_map_intersect_range(isl_union_map_copy(accesses
),
300 order
= isl_union_map_copy(prog
->scop
->tagged_dep_order
);
301 order
= isl_union_map_intersect_domain(order
, uset
);
302 order
= isl_union_map_zip(order
);
303 order
= isl_union_set_unwrap(isl_union_map_domain(order
));
304 order
= remove_independences(prog
, array
, order
);
305 array
->dep_order
= order
;
307 if (gpu_array_is_scalar(array
) && !array
->has_compound_element
)
310 prog
->array_order
= isl_union_map_union(prog
->array_order
,
311 isl_union_map_copy(array
->dep_order
));
314 isl_union_map_free(accesses
);
317 /* Construct a gpu_array_info for each array referenced by prog->scop and
318 * collect them in prog->array.
320 * The sizes are based on the extents and the set of possibly accessed
321 * elements by "prog".
322 * If there are any member accesses involved, then they are first mapped
323 * to the outer arrays of structs.
325 * If we are allowing live range reordering, then also set
326 * the dep_order field. Otherwise leave it NULL.
328 static int collect_array_info(struct gpu_prog
*prog
)
332 isl_union_set
*arrays
;
334 arrays
= isl_union_map_range(isl_union_map_copy(prog
->read
));
335 arrays
= isl_union_set_union(arrays
,
336 isl_union_map_range(isl_union_map_copy(prog
->may_write
)));
338 arrays
= isl_union_set_apply(arrays
,
339 isl_union_map_copy(prog
->to_outer
));
341 arrays
= isl_union_set_coalesce(arrays
);
343 prog
->n_array
= prog
->scop
->pet
->n_array
;
344 prog
->array
= isl_calloc_array(prog
->ctx
,
345 struct gpu_array_info
, prog
->n_array
);
347 for (i
= 0; i
< prog
->scop
->pet
->n_array
; ++i
)
348 if (extract_array_info(prog
, &prog
->array
[i
],
349 prog
->scop
->pet
->arrays
[i
], arrays
) < 0)
352 isl_union_set_free(arrays
);
354 if (prog
->scop
->options
->live_range_reordering
)
355 collect_order_dependences(prog
);
360 static void free_array_info(struct gpu_prog
*prog
)
364 for (i
= 0; i
< prog
->n_array
; ++i
) {
365 int n_index
= prog
->array
[i
].n_index
;
366 free(prog
->array
[i
].type
);
367 free(prog
->array
[i
].name
);
368 for (j
= 0; j
< n_index
; ++j
)
369 isl_pw_aff_free(prog
->array
[i
].bound
[j
]);
370 isl_space_free(prog
->array
[i
].space
);
371 isl_set_free(prog
->array
[i
].extent
);
372 free(prog
->array
[i
].bound
);
373 free(prog
->array
[i
].refs
);
374 isl_union_map_free(prog
->array
[i
].dep_order
);
379 /* Check if a gpu array is a scalar. A scalar is a value that is not stored
380 * as an array or through a pointer reference, but as a single data element.
381 * At the moment, scalars are represented as zero-dimensional arrays.
382 * Note that the single data element may be an entire structure.
384 int gpu_array_is_scalar(struct gpu_array_info
*array
)
386 return array
->n_index
== 0;
389 /* Is "array" a read-only scalar?
391 int gpu_array_is_read_only_scalar(struct gpu_array_info
*array
)
393 return array
->read_only_scalar
;
396 /* Return the set of parameter values for which the array has a positive
397 * size in all dimensions.
398 * If the sizes are only valid for some parameter values, then those
399 * constraints are also taken into account.
401 __isl_give isl_set
*gpu_array_positive_size_guard(struct gpu_array_info
*array
)
407 space
= isl_space_params(isl_space_copy(array
->space
));
408 guard
= isl_set_universe(space
);
410 for (i
= 0; i
< array
->n_index
; ++i
) {
412 isl_set
*guard_i
, *zero
;
414 bound
= isl_pw_aff_copy(array
->bound
[i
]);
415 guard_i
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(bound
));
416 zero
= isl_pw_aff_zero_set(bound
);
417 guard_i
= isl_set_subtract(guard_i
, zero
);
418 guard
= isl_set_intersect(guard
, guard_i
);
424 /* Internal data structure for extract_size_of_type.
425 * "type" specifies the name of the space that we want to extract.
426 * "res" is used to store the subset of that space.
428 struct ppcg_extract_size_data
{
433 /* This function is called for each set in a union_set.
434 * If the name of the set matches data->type, we store the
437 static int extract_size_of_type(__isl_take isl_set
*size
, void *user
)
439 struct ppcg_extract_size_data
*data
= user
;
442 name
= isl_set_get_tuple_name(size
);
443 if (name
&& !strcmp(name
, data
->type
)) {
452 /* Given a union map { kernel[i] -> *[...] },
453 * return the range in the space called "type" for the kernel with
454 * sequence number "id".
456 static __isl_give isl_set
*extract_sizes(__isl_keep isl_union_map
*sizes
,
457 const char *type
, int id
)
461 isl_union_set
*local_sizes
;
462 struct ppcg_extract_size_data data
= { type
, NULL
};
467 space
= isl_union_map_get_space(sizes
);
468 space
= isl_space_set_from_params(space
);
469 space
= isl_space_add_dims(space
, isl_dim_set
, 1);
470 space
= isl_space_set_tuple_name(space
, isl_dim_set
, "kernel");
471 dom
= isl_set_universe(space
);
472 dom
= isl_set_fix_si(dom
, isl_dim_set
, 0, id
);
474 local_sizes
= isl_union_set_apply(isl_union_set_from_set(dom
),
475 isl_union_map_copy(sizes
));
476 isl_union_set_foreach_set(local_sizes
, &extract_size_of_type
, &data
);
477 isl_union_set_free(local_sizes
);
481 /* Given a singleton set, extract the first (at most *len) elements
482 * of the single integer tuple into *sizes and update *len if needed.
484 static void read_sizes_from_set(__isl_take isl_set
*set
, int *sizes
, int *len
)
492 dim
= isl_set_dim(set
, isl_dim_set
);
496 for (i
= 0; i
< *len
; ++i
) {
499 v
= isl_set_plain_get_val_if_fixed(set
, isl_dim_set
, i
);
502 sizes
[i
] = isl_val_get_num_si(v
);
509 /* Add the map { kernel[id] -> type[sizes] } to gen->used_sizes,
510 * if the option debug->dump_sizes is set.
512 static void set_used_sizes(struct gpu_gen
*gen
, const char *type
, int id
,
519 if (!gen
->options
->debug
->dump_sizes
)
522 space
= isl_union_map_get_space(gen
->used_sizes
);
523 space
= isl_space_set_from_params(space
);
524 space
= isl_space_add_dims(space
, isl_dim_set
, 1);
525 space
= isl_space_set_tuple_name(space
, isl_dim_set
, "kernel");
526 space
= isl_space_from_domain(space
);
527 space
= isl_space_add_dims(space
, isl_dim_out
, len
);
528 space
= isl_space_set_tuple_name(space
, isl_dim_out
, type
);
530 map
= isl_map_universe(space
);
531 map
= isl_map_fix_si(map
, isl_dim_in
, 0, id
);
532 for (i
= 0; i
< len
; ++i
)
533 map
= isl_map_fix_si(map
, isl_dim_out
, i
, sizes
[i
]);
535 gen
->used_sizes
= isl_union_map_add_map(gen
->used_sizes
, map
);
538 /* Extract user specified "tile" sizes from the "sizes" command line option,
539 * defaulting to option->tile_size in each dimension.
540 * *tile_len contains the maximum number of tile sizes needed.
541 * Update *tile_len to the number of specified tile sizes, if any, and
542 * return a pointer to the tile sizes (or NULL on error).
543 * Add the effectively used sizes to gen->used_sizes.
545 static int *read_tile_sizes(struct gpu_gen
*gen
, int *tile_len
)
551 tile_size
= isl_alloc_array(gen
->ctx
, int, *tile_len
);
554 for (n
= 0; n
< *tile_len
; ++n
)
555 tile_size
[n
] = gen
->options
->tile_size
;
557 size
= extract_sizes(gen
->sizes
, "tile", gen
->kernel_id
);
558 read_sizes_from_set(size
, tile_size
, tile_len
);
559 set_used_sizes(gen
, "tile", gen
->kernel_id
, tile_size
, *tile_len
);
564 /* Extract user specified "block" sizes from the "sizes" command line option,
565 * after filling in some potentially useful defaults.
567 static void read_block_sizes(struct ppcg_kernel
*kernel
,
568 __isl_keep isl_union_map
*sizes
)
572 if (kernel
->n_block
> 3)
574 switch (kernel
->n_block
) {
576 kernel
->block_dim
[0] = 512;
579 kernel
->block_dim
[0] = 32;
580 kernel
->block_dim
[1] = 16;
583 kernel
->block_dim
[0] = 32;
584 kernel
->block_dim
[1] = 4;
585 kernel
->block_dim
[2] = 4;
589 size
= extract_sizes(sizes
, "block", kernel
->id
);
590 read_sizes_from_set(size
, kernel
->block_dim
, &kernel
->n_block
);
593 /* Extract user specified "grid" sizes from the "sizes" command line option,
594 * after filling in some potentially useful defaults.
596 static void read_grid_sizes(struct ppcg_kernel
*kernel
,
597 __isl_keep isl_union_map
*sizes
)
601 if (kernel
->n_grid
> 2)
603 switch (kernel
->n_grid
) {
605 kernel
->grid_dim
[0] = 32768;
608 kernel
->grid_dim
[0] = 256;
609 kernel
->grid_dim
[1] = 256;
613 size
= extract_sizes(sizes
, "grid", kernel
->id
);
614 read_sizes_from_set(size
, kernel
->grid_dim
, &kernel
->n_grid
);
617 /* Extract user specified grid and block sizes from the gen->sizes
618 * command line option after filling in some potentially useful defaults.
619 * Store the extracted sizes in "kernel".
620 * Add the effectively used sizes to gen->used_sizes.
622 static void read_grid_and_block_sizes(struct ppcg_kernel
*kernel
,
625 read_block_sizes(kernel
, gen
->sizes
);
626 read_grid_sizes(kernel
, gen
->sizes
);
627 set_used_sizes(gen
, "block", kernel
->id
,
628 kernel
->block_dim
, kernel
->n_block
);
629 set_used_sizes(gen
, "grid", kernel
->id
,
630 kernel
->grid_dim
, kernel
->n_grid
);
633 static void *free_stmts(struct gpu_stmt
*stmts
, int n
)
640 for (i
= 0; i
< n
; ++i
) {
641 struct gpu_stmt_access
*access
, *next
;
643 for (access
= stmts
[i
].accesses
; access
; access
= next
) {
645 isl_id_free(access
->ref_id
);
646 isl_map_free(access
->access
);
647 isl_map_free(access
->tagged_access
);
651 isl_id_free(stmts
[i
].id
);
658 /* Construct a map from a domain of dimensionality "len"
659 * to a domain of dimensionality "len" + "tile_len" that tiles
660 * the "tile_len" coordinates starting at "first".
661 * In particular, [s_i] -> [s_i / tile_size[i], s_i % tile_size[i]].
662 * "dim" prescribes the parameters.
664 static __isl_give isl_map
*tile(__isl_take isl_space
*dim
, int len
,
665 int first
, int tile_len
, int *tile_size
)
672 dim
= isl_space_add_dims(dim
, isl_dim_in
, len
);
673 dim
= isl_space_add_dims(dim
, isl_dim_out
, len
+ tile_len
);
674 bmap
= isl_basic_map_universe(isl_space_copy(dim
));
675 ls
= isl_local_space_from_space(dim
);
677 for (i
= 0; i
< len
- tile_len
; ++i
) {
678 int j
= i
< first
? i
: i
+ tile_len
;
679 int k
= i
< first
? i
: i
+ 2 * tile_len
;
681 c
= isl_equality_alloc(isl_local_space_copy(ls
));
682 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
, j
, -1);
683 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, k
, 1);
684 bmap
= isl_basic_map_add_constraint(bmap
, c
);
687 for (i
= 0; i
< tile_len
; ++i
) {
688 c
= isl_equality_alloc(isl_local_space_copy(ls
));
689 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
,
691 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
692 first
+ i
, tile_size
[i
]);
693 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
694 first
+ i
+ tile_len
, 1);
695 bmap
= isl_basic_map_add_constraint(bmap
, c
);
697 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
698 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
699 first
+ i
+ tile_len
, 1);
700 bmap
= isl_basic_map_add_constraint(bmap
, c
);
702 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
703 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
704 first
+ i
+ tile_len
, -1);
705 c
= isl_constraint_set_constant_si(c
, tile_size
[i
] - 1);
706 bmap
= isl_basic_map_add_constraint(bmap
, c
);
709 isl_local_space_free(ls
);
711 return isl_map_from_basic_map(bmap
);
714 /* Construct a map from a domain of dimensionality "len"
715 * to a domain of dimensionality "len" + "wrap_len" that "wraps"
716 * the "wrap_len" coordinates starting at "first" according to "wrap_size".
717 * In particular, [s_i] -> [s_i, s_i % wrap_size[i]].
718 * To do so, we need extra variables corresponding to [s_i / wrap_size[i]],
719 * that are projected out at the end.
720 * "dim" prescribes the parameters.
722 static __isl_give isl_map
*wrap(__isl_take isl_space
*dim
, int len
,
723 int first
, int wrap_len
, int *wrap_size
)
730 dim
= isl_space_add_dims(dim
, isl_dim_in
, len
);
731 dim
= isl_space_add_dims(dim
, isl_dim_out
, len
+ 2 * wrap_len
);
732 bmap
= isl_basic_map_universe(isl_space_copy(dim
));
733 ls
= isl_local_space_from_space(dim
);
735 for (i
= 0; i
< len
; ++i
) {
736 int k
= i
< first
+ wrap_len
? i
: i
+ 2 * wrap_len
;
738 c
= isl_equality_alloc(isl_local_space_copy(ls
));
739 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
, i
, -1);
740 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, k
, 1);
741 bmap
= isl_basic_map_add_constraint(bmap
, c
);
744 for (i
= 0; i
< wrap_len
; ++i
) {
745 c
= isl_equality_alloc(isl_local_space_copy(ls
));
746 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
748 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
749 first
+ wrap_len
+ i
, 1);
750 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
751 first
+ 2 * wrap_len
+ i
, wrap_size
[i
]);
752 bmap
= isl_basic_map_add_constraint(bmap
, c
);
754 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
755 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
756 first
+ wrap_len
+ i
, 1);
757 bmap
= isl_basic_map_add_constraint(bmap
, c
);
759 c
= isl_inequality_alloc(isl_local_space_copy(ls
));
760 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
,
761 first
+ wrap_len
+ i
, -1);
762 c
= isl_constraint_set_constant_si(c
, wrap_size
[i
] - 1);
763 bmap
= isl_basic_map_add_constraint(bmap
, c
);
766 isl_local_space_free(ls
);
768 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
,
769 first
+ 2 * wrap_len
, wrap_len
);
771 return isl_map_from_basic_map(bmap
);
774 /* Tile the B loops over the tile sizes and then tile/wrap
775 * the T1 loops over the blocks.
777 static __isl_give isl_union_map
*tile_schedule(struct gpu_gen
*gen
,
778 __isl_take isl_union_map
*sched
)
780 struct ppcg_kernel
*kernel
= gen
->kernel
;
782 isl_map
*tiling
, *block_tiling
;
784 dim
= isl_union_map_get_space(sched
);
785 tiling
= tile(isl_space_copy(dim
), gen
->untiled_len
,
786 gen
->tile_first
, kernel
->tile_len
, kernel
->tile_size
);
788 if (gen
->options
->wrap
)
789 block_tiling
= wrap(dim
, gen
->untiled_len
+ kernel
->tile_len
,
790 gen
->tile_first
, kernel
->n_grid
, kernel
->grid_dim
);
792 block_tiling
= tile(dim
, gen
->untiled_len
+ kernel
->tile_len
,
793 gen
->tile_first
, kernel
->n_grid
, kernel
->grid_dim
);
795 gen
->tiled_len
= gen
->untiled_len
+ kernel
->tile_len
+ kernel
->n_grid
;
797 tiling
= isl_map_apply_range(tiling
, block_tiling
);
799 sched
= isl_union_map_apply_range(sched
,
800 isl_union_map_from_map(tiling
));
802 gen
->shared_len
= gen
->tile_first
+ kernel
->tile_len
+ kernel
->n_grid
;
807 /* Equate the "T1P" iterators in the tiled schedule "sched"
808 * to the block dimensions.
810 static __isl_give isl_union_map
*parametrize_tiled_schedule(
811 struct gpu_gen
*gen
, __isl_take isl_union_map
*sched
)
813 struct ppcg_kernel
*kernel
= gen
->kernel
;
817 dim
= isl_union_map_get_space(sched
);
818 par
= parametrization(dim
, gen
->tiled_len
,
819 gen
->tile_first
+ kernel
->n_grid
, kernel
->block_ids
);
820 sched
= isl_union_map_intersect_range(sched
,
821 isl_union_set_from_set(par
));
826 /* Tile/wrap the P1 loops over the threads.
828 static __isl_give isl_union_map
*thread_tile_schedule(struct gpu_gen
*gen
,
829 __isl_take isl_union_map
*sched
)
831 struct ppcg_kernel
*kernel
= gen
->kernel
;
836 dim
= isl_union_map_get_space(sched
);
838 if (gen
->options
->wrap
)
839 tiling
= wrap(isl_space_copy(dim
), gen
->tiled_len
,
840 gen
->shared_len
, kernel
->n_block
, kernel
->block_dim
);
842 tiling
= tile(isl_space_copy(dim
), gen
->tiled_len
,
843 gen
->shared_len
, kernel
->n_block
, kernel
->block_dim
);
844 gen
->thread_tiled_len
= gen
->tiled_len
+ kernel
->n_block
;
846 sched
= isl_union_map_apply_range(sched
,
847 isl_union_map_from_map(tiling
));
849 par
= parametrization(dim
, gen
->thread_tiled_len
,
850 gen
->tile_first
+ kernel
->tile_len
+
851 kernel
->n_grid
+ kernel
->n_block
, kernel
->thread_ids
);
852 sched
= isl_union_map_intersect_range(sched
,
853 isl_union_set_from_set(par
));
855 gen
->shared_len
= gen
->tile_first
+ kernel
->tile_len
+ kernel
->n_grid
;
860 /* If the user asked for it, scale the shared memory tile loops
861 * (T1T and T2) of "sched" by kernel->tile_size[i].
862 * If we are not performing "wrapping", then additionally scale the T1P
863 * loops by kernel->grid_dim[i].
865 static __isl_give isl_union_map
*scale_tile_loops(struct gpu_gen
*gen
,
866 __isl_take isl_union_map
*sched
)
868 struct ppcg_kernel
*kernel
= gen
->kernel
;
871 isl_basic_map
*scale
;
875 if (!gen
->options
->scale_tile_loops
)
878 dim
= isl_union_map_get_space(sched
);
879 dim
= isl_space_add_dims(dim
, isl_dim_in
, gen
->tiled_len
);
880 dim
= isl_space_add_dims(dim
, isl_dim_out
, gen
->tiled_len
);
881 scale
= isl_basic_map_universe(isl_space_copy(dim
));
882 ls
= isl_local_space_from_space(dim
);
884 for (i
= 0; i
< gen
->tiled_len
; ++i
) {
887 if (i
>= gen
->tile_first
&&
888 i
< gen
->tile_first
+ kernel
->n_grid
) {
889 f
= kernel
->tile_size
[i
- gen
->tile_first
];
890 if (!gen
->options
->wrap
)
891 f
*= kernel
->grid_dim
[i
- gen
->tile_first
];
892 } else if (i
>= gen
->tile_first
+ kernel
->n_grid
&&
893 i
< gen
->tile_first
+ kernel
->n_grid
+
895 f
= kernel
->tile_size
[i
-
896 (gen
->tile_first
+ kernel
->n_grid
)];
899 c
= isl_equality_alloc(isl_local_space_copy(ls
));
900 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
, i
, f
);
901 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, i
, -1);
902 scale
= isl_basic_map_add_constraint(scale
, c
);
905 isl_local_space_free(ls
);
907 sched
= isl_union_map_apply_range(sched
,
908 isl_union_map_from_map(isl_map_from_basic_map(scale
)));
913 /* If we are not performing "wrapping" and if the user asked for it,
914 * scale the thread tile loops (P1T) of "sched" by kernel->block_dim[i].
916 static __isl_give isl_union_map
*scale_thread_tile_loops(struct gpu_gen
*gen
,
917 __isl_take isl_union_map
*sched
)
921 isl_basic_map
*scale
;
925 if (gen
->options
->wrap
)
927 if (!gen
->options
->scale_tile_loops
)
930 dim
= isl_union_map_get_space(sched
);
931 dim
= isl_space_add_dims(dim
, isl_dim_in
, gen
->thread_tiled_len
);
932 dim
= isl_space_add_dims(dim
, isl_dim_out
, gen
->thread_tiled_len
);
933 scale
= isl_basic_map_universe(isl_space_copy(dim
));
934 ls
= isl_local_space_from_space(dim
);
936 for (i
= 0; i
< gen
->thread_tiled_len
; ++i
) {
939 if (i
>= gen
->shared_len
&&
940 i
< gen
->shared_len
+ gen
->kernel
->n_block
)
941 f
= gen
->kernel
->block_dim
[i
- gen
->shared_len
];
943 c
= isl_equality_alloc(isl_local_space_copy(ls
));
944 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
, i
, f
);
945 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, i
, -1);
946 scale
= isl_basic_map_add_constraint(scale
, c
);
949 isl_local_space_free(ls
);
951 sched
= isl_union_map_apply_range(sched
,
952 isl_union_map_from_map(isl_map_from_basic_map(scale
)));
957 /* If we are not performing "wrapping" and if the user asked for it,
958 * scale the "n_tile" loops starting at "first" of "sched" by gen->block_dim[i].
960 static __isl_give isl_union_map
*scale_access_tile_loops(struct gpu_gen
*gen
,
961 __isl_take isl_union_map
*sched
, int len
, int first
, int n_tile
)
965 isl_basic_map
*scale
;
969 if (gen
->options
->wrap
)
971 if (!gen
->options
->scale_tile_loops
)
974 dim
= isl_union_map_get_space(sched
);
975 dim
= isl_space_add_dims(dim
, isl_dim_in
, len
);
976 dim
= isl_space_add_dims(dim
, isl_dim_out
, len
);
977 scale
= isl_basic_map_universe(isl_space_copy(dim
));
978 ls
= isl_local_space_from_space(dim
);
980 for (i
= 0; i
< len
; ++i
) {
983 if (i
>= first
&& i
< first
+ n_tile
)
984 f
= gen
->kernel
->block_dim
[i
- first
];
986 c
= isl_equality_alloc(isl_local_space_copy(ls
));
987 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
, i
, f
);
988 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, i
, -1);
989 scale
= isl_basic_map_add_constraint(scale
, c
);
992 isl_local_space_free(ls
);
994 sched
= isl_union_map_apply_range(sched
,
995 isl_union_map_from_map(isl_map_from_basic_map(scale
)));
1000 /* Add parameters p[i] with identifiers "ids" to "set",
1001 * with bounds to 0 <= p[i] < size[i].
1003 __isl_give isl_set
*add_bounded_parameters(__isl_take isl_set
*set
,
1004 int *size
, __isl_keep isl_id_list
*ids
)
1009 len
= isl_id_list_n_id(ids
);
1010 nparam
= isl_set_dim(set
, isl_dim_param
);
1011 set
= isl_set_add_dims(set
, isl_dim_param
, len
);
1013 for (i
= 0; i
< len
; ++i
) {
1016 id
= isl_id_list_get_id(ids
, i
);
1017 set
= isl_set_set_dim_id(set
, isl_dim_param
, nparam
+ i
, id
);
1018 set
= isl_set_lower_bound_si(set
, isl_dim_param
, nparam
+ i
, 0);
1019 set
= isl_set_upper_bound_si(set
, isl_dim_param
,
1020 nparam
+ i
, size
[i
] - 1);
1026 /* Add "len" parameters p[i] with identifiers "ids" and intersect "set"
1029 * { : 0 <= p[i] < size[i] }
1031 * or an overapproximation.
1033 static __isl_give isl_set
*add_bounded_parameters_dynamic(
1034 __isl_take isl_set
*set
, __isl_keep isl_multi_pw_aff
*size
,
1035 __isl_keep isl_id_list
*ids
)
1040 isl_local_space
*ls
;
1042 len
= isl_multi_pw_aff_dim(size
, isl_dim_out
);
1043 nparam
= isl_set_dim(set
, isl_dim_param
);
1044 set
= isl_set_add_dims(set
, isl_dim_param
, len
);
1046 for (i
= 0; i
< len
; ++i
) {
1049 id
= isl_id_list_get_id(ids
, i
);
1050 set
= isl_set_set_dim_id(set
, isl_dim_param
, nparam
+ i
, id
);
1053 space
= isl_space_params(isl_set_get_space(set
));
1054 ls
= isl_local_space_from_space(space
);
1055 for (i
= 0; i
< len
; ++i
) {
1056 isl_pw_aff
*param
, *size_i
, *zero
;
1059 param
= isl_pw_aff_var_on_domain(isl_local_space_copy(ls
),
1060 isl_dim_param
, nparam
+ i
);
1062 size_i
= isl_multi_pw_aff_get_pw_aff(size
, i
);
1063 bound
= isl_pw_aff_lt_set(isl_pw_aff_copy(param
), size_i
);
1064 bound
= isl_set_from_basic_set(isl_set_simple_hull(bound
));
1065 set
= isl_set_intersect_params(set
, bound
);
1067 zero
= isl_pw_aff_zero_on_domain(isl_local_space_copy(ls
));
1068 bound
= isl_pw_aff_ge_set(param
, zero
);
1069 set
= isl_set_intersect_params(set
, bound
);
1071 isl_local_space_free(ls
);
1076 /* Construct a map from an access to group->array to the corresponding
1077 * shared/private memory tile.
1078 * The map is of the form
1080 * { [D[i] -> A[a]] -> T[t] }
1082 * where D represents the initial shared_len dimensions
1083 * of the computed schedule.
1085 static __isl_give isl_map
*shift_access(struct gpu_array_ref_group
*group
)
1087 struct gpu_array_tile
*tile
;
1088 isl_multi_aff
*tiling
;
1090 tile
= group
->private_tile
;
1092 tile
= group
->shared_tile
;
1094 tiling
= isl_multi_aff_copy(tile
->tiling
);
1096 return isl_map_from_multi_aff(tiling
);
1099 /* Given a schedule that iterates over all elements in a piece of an array,
1100 * perform tiling/wrapping over the threads.
1102 * In particular, we tile the final iterators so that the final thread
1103 * dimension runs over the final array dimension.
1104 * However, if those final iterators have only a single iteration,
1105 * we try to tile earlier iterators instead.
1107 static __isl_give isl_map
*tile_access_schedule(struct gpu_gen
*gen
,
1108 __isl_take isl_map
*sched
)
1111 isl_union_map
*usched
;
1114 unsigned nvar
= isl_map_dim(sched
, isl_dim_out
);
1118 n_tile
= gen
->kernel
->n_block
;
1119 if (n_tile
> nvar
) {
1121 sched
= isl_map_insert_dims(sched
,
1122 isl_dim_out
, 0, n_tile
- nvar
);
1123 for (i
= 0; i
< n_tile
- nvar
; ++i
)
1124 sched
= isl_map_fix_si(sched
, isl_dim_out
, i
, 0);
1128 first
= nvar
- n_tile
;
1130 for (; first
> 0; first
--)
1131 if (!map_plain_is_fixed(sched
, isl_dim_out
, first
+ n_tile
- 1))
1134 dim
= isl_map_get_space(sched
);
1135 dim
= isl_space_params(dim
);
1136 if (gen
->options
->wrap
)
1137 tiling
= wrap(isl_space_copy(dim
), nvar
, first
,
1138 n_tile
, gen
->kernel
->block_dim
);
1140 tiling
= tile(isl_space_copy(dim
), nvar
, first
,
1141 n_tile
, gen
->kernel
->block_dim
);
1142 sched
= isl_map_apply_range(sched
, tiling
);
1144 par
= parametrization(dim
, nvar
+ n_tile
, first
+ n_tile
,
1145 gen
->kernel
->thread_ids
);
1146 sched
= isl_map_intersect_range(sched
, par
);
1148 usched
= isl_union_map_from_map(sched
);
1149 usched
= scale_access_tile_loops(gen
, usched
, nvar
+ n_tile
,
1151 sched
= isl_map_from_union_map(usched
);
1156 /* Return the union of all tagged access relations in the group.
1158 static __isl_give isl_union_map
*group_tagged_access_relation(
1159 struct gpu_array_ref_group
*group
)
1162 isl_union_map
*access
;
1164 access
= isl_union_map_empty(isl_map_get_space(group
->access
));
1165 for (i
= 0; i
< group
->n_ref
; ++i
) {
1168 map_i
= isl_map_copy(group
->refs
[i
]->tagged_access
);
1169 access
= isl_union_map_union(access
,
1170 isl_union_map_from_map(map_i
));
1176 /* Return the extent of "array", recomputed from the bounds.
1177 * The recomputed extent may be simpler than the original extent.
1179 static __isl_give isl_set
*array_extent(struct gpu_array_info
*array
)
1184 isl_local_space
*ls
;
1187 id
= isl_set_get_tuple_id(array
->extent
);
1188 space
= isl_set_get_space(array
->extent
);
1189 extent
= isl_set_universe(isl_space_copy(space
));
1190 ls
= isl_local_space_from_space(space
);
1191 for (i
= 0; i
< array
->n_index
; ++i
) {
1197 extent
= isl_set_lower_bound_si(extent
, isl_dim_set
, i
, 0);
1199 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
1201 index
= isl_pw_aff_from_aff(aff
);
1202 bound
= isl_pw_aff_copy(array
->bound
[i
]);
1203 bound
= isl_pw_aff_from_range(bound
);
1204 bound
= isl_pw_aff_add_dims(bound
, isl_dim_in
, array
->n_index
);
1205 bound
= isl_pw_aff_set_tuple_id(bound
, isl_dim_in
,
1207 lt
= isl_pw_aff_lt_set(index
, bound
);
1208 extent
= isl_set_intersect(extent
, lt
);
1210 isl_local_space_free(ls
);
1216 /* Return a map from the first shared_len dimensions of the computed
1217 * schedule to the array tile in
1218 * global memory that corresponds to the shared memory copy.
1220 * In particular, return a map
1226 * tile_offset(i) <= a <= tile_offset(i) + tile_size - 1 (1)
1230 * 0 <= a <= array_size - 1 (2)
1232 * Note that if some stride has been detected (i.e., when
1233 * group->shared_tile->bound[i].shift is set), then a in (1) refers
1234 * to the shifted and scaled down version.
1236 * Constraints (1) are obtained by mapping the size constraints on the
1237 * shared/private memory tile back to the access relation.
1238 * Constraints (2) are obtained from the (recomputed) extent.
1240 static __isl_give isl_map
*group_tile(struct gpu_array_ref_group
*group
)
1243 int n_index
= group
->array
->n_index
;
1249 space
= isl_multi_aff_get_space(group
->shared_tile
->tiling
);
1250 space
= isl_space_range(space
);
1251 local
= isl_set_universe(space
);
1252 for (i
= 0; i
< n_index
; ++i
) {
1255 local
= isl_set_lower_bound_si(local
, isl_dim_set
, i
, 0);
1256 bound
= isl_val_copy(group
->shared_tile
->bound
[i
].size
);
1257 bound
= isl_val_sub_ui(bound
, 1);
1258 local
= isl_set_upper_bound_val(local
, isl_dim_set
, i
, bound
);
1260 local
= isl_set_preimage_multi_aff(local
,
1261 isl_multi_aff_copy(group
->shared_tile
->tiling
));
1262 tile
= isl_set_unwrap(local
);
1263 extent
= array_extent(group
->array
);
1264 tile
= isl_map_intersect_range(tile
, extent
);
1269 /* Given a mapping "iterator_map" from the AST schedule to a domain,
1270 * return the corresponding mapping from the AST schedule to
1271 * to the first shared_len dimensions of the schedule computed by PPCG.
1273 static __isl_give isl_pw_multi_aff
*compute_sched_to_shared(struct gpu_gen
*gen
,
1274 __isl_take isl_pw_multi_aff
*iterator_map
)
1276 isl_union_map
*umap
;
1278 isl_map
*map
, *sched
;;
1280 space
= isl_space_range(isl_pw_multi_aff_get_space(iterator_map
));
1281 space
= isl_space_from_domain(space
);
1282 space
= isl_space_add_dims(space
, isl_dim_out
, gen
->shared_len
);
1284 umap
= isl_union_map_copy(gen
->shared_sched
);
1285 umap
= isl_union_map_apply_range(umap
,
1286 isl_union_map_copy(gen
->shared_proj
));
1287 map
= isl_union_map_extract_map(umap
, space
);
1288 isl_union_map_free(umap
);
1290 sched
= isl_map_preimage_domain_pw_multi_aff(map
, iterator_map
);
1291 sched
= isl_map_detect_equalities(sched
);
1293 return isl_pw_multi_aff_from_map(sched
);
1296 /* Set unroll[j] if the input dimension j is involved in
1297 * the index expression represented by ma.
1299 static int check_unroll(__isl_take isl_set
*set
, __isl_take isl_multi_aff
*ma
,
1303 int n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
1304 int n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
1307 for (i
= 0; i
< n_out
; ++i
) {
1310 aff
= isl_multi_aff_get_aff(ma
, i
);
1311 for (j
= 0; j
< n_in
; ++j
)
1312 if (isl_aff_involves_dims(aff
, isl_dim_in
, j
, 1))
1318 isl_multi_aff_free(ma
);
1322 /* Given an array pos mapping input dimensions to the corresponding
1323 * output dimension, construct the corresponding map.
1325 static __isl_give isl_map
*permutation(__isl_take isl_space
*dim
,
1330 isl_basic_map
*bmap
;
1331 isl_local_space
*ls
;
1333 dim
= isl_space_add_dims(dim
, isl_dim_in
, len
);
1334 dim
= isl_space_add_dims(dim
, isl_dim_out
, len
);
1335 bmap
= isl_basic_map_universe(isl_space_copy(dim
));
1336 ls
= isl_local_space_from_space(dim
);
1338 for (i
= 0; i
< len
; ++i
) {
1339 c
= isl_equality_alloc(isl_local_space_copy(ls
));
1340 c
= isl_constraint_set_coefficient_si(c
, isl_dim_in
, i
,
1342 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, pos
[i
],
1344 bmap
= isl_basic_map_add_constraint(bmap
, c
);
1346 isl_local_space_free(ls
);
1348 return isl_map_from_basic_map(bmap
);
1351 /* Remove the private tiles from all array reference groups,
1352 * except for the groups of arrays that are marked force_private.
1354 static void remove_private_tiles(struct gpu_gen
*gen
)
1358 for (i
= 0; i
< gen
->kernel
->n_array
; ++i
) {
1359 struct gpu_local_array_info
*local
= &gen
->kernel
->array
[i
];
1361 if (local
->force_private
)
1364 for (j
= 0; j
< local
->n_group
; ++j
) {
1365 struct gpu_array_ref_group
*group
= local
->groups
[j
];
1367 group
->private_tile
=
1368 gpu_array_tile_free(group
->private_tile
);
1373 /* Find all loops involved in any of the index expressions for any of
1374 * the private accesses, move them innermost and then mark them as
1375 * requiring unrolling by setting gen->first_unroll.
1376 * The loops involved should all be parallel because of the checks
1377 * we performed in check_private_group_access. Moving them innermost
1378 * is therefore a valid transformation.
1380 * If any of the arrays are marked force_private, however, then
1381 * those loops may not be parallel with respect to the marked arrays.
1382 * If any of the loops would have to be moved innermost for the
1383 * (non forced) private accesses and if there are any force_private
1384 * arrays, then we revert the decision to map the selected arrays
1385 * to private memory. An alternative solution would be to expand
1386 * the force_private arrays.
1388 * Loops up to gen->shared_len are generated before the mapping to
1389 * threads is applied. They should therefore be ignored.
1391 * We compute the hidden equalities of the schedule first
1392 * since we will need them in our calls to isl_pw_multi_aff_from_map
1393 * and because we want to make sure that the same equalities
1394 * are also available to the code generator.
1396 static __isl_give isl_union_map
*interchange_for_unroll(struct gpu_gen
*gen
,
1397 __isl_take isl_union_map
*sched
)
1399 struct ppcg_kernel
*kernel
= gen
->kernel
;
1401 int unroll
[gen
->thread_tiled_len
];
1402 int perm
[gen
->thread_tiled_len
];
1405 int len
= gen
->shared_len
+ kernel
->n_parallel
+ kernel
->n_block
;
1407 gen
->first_unroll
= -1;
1409 sched
= isl_union_map_detect_equalities(sched
);
1410 for (i
= 0; i
< gen
->thread_tiled_len
; ++i
)
1412 for (i
= 0; i
< kernel
->n_array
; ++i
) {
1413 struct gpu_local_array_info
*array
= &kernel
->array
[i
];
1415 for (j
= 0; j
< array
->n_group
; ++j
) {
1416 isl_union_map
*access
;
1418 isl_pw_multi_aff
*pma
;
1420 if (!array
->groups
[j
]->private_tile
)
1423 access
= gpu_array_ref_group_access_relation(
1424 array
->groups
[j
], 1, 1);
1425 access
= isl_union_map_apply_domain(access
,
1426 isl_union_map_copy(sched
));
1428 acc
= isl_map_from_union_map(access
);
1429 pma
= isl_pw_multi_aff_from_map(acc
);
1430 isl_pw_multi_aff_foreach_piece(pma
,
1431 &check_unroll
, unroll
);
1433 isl_pw_multi_aff_free(pma
);
1437 for (i
= gen
->shared_len
; i
< len
; ++i
)
1444 for (i
= len
; i
< gen
->thread_tiled_len
; ++i
)
1448 if (kernel
->any_force_private
) {
1449 remove_private_tiles(gen
);
1454 for (i
= 0; i
< gen
->shared_len
; ++i
)
1456 for (i
= gen
->shared_len
; i
< gen
->thread_tiled_len
; ++i
)
1459 gen
->first_unroll
= j
- gen
->shared_len
;
1460 for (i
= gen
->shared_len
; i
< len
; ++i
)
1464 dim
= isl_union_map_get_space(sched
);
1465 permute
= permutation(dim
, perm
, gen
->thread_tiled_len
);
1466 sched
= isl_union_map_apply_range(sched
,
1467 isl_union_map_from_map(permute
));
1472 /* Construct a map with input the shared tile loops and the loops that
1473 * will be wrapped around the threads that relates these later loops
1474 * to the thread indices and then projects them out.
1476 static __isl_give isl_map
*compute_privatization(struct gpu_gen
*gen
)
1478 struct ppcg_kernel
*kernel
= gen
->kernel
;
1485 dim
= isl_union_map_get_space(gen
->shared_sched
);
1487 if (gen
->options
->wrap
)
1488 tiling
= wrap(isl_space_copy(dim
),
1489 gen
->shared_len
+ kernel
->n_block
,
1490 gen
->shared_len
, kernel
->n_block
, kernel
->block_dim
);
1492 tiling
= tile(isl_space_copy(dim
),
1493 gen
->shared_len
+ kernel
->n_block
,
1494 gen
->shared_len
, kernel
->n_block
, kernel
->block_dim
);
1498 par
= parametrization(dim
, gen
->shared_len
+ 2 * kernel
->n_block
,
1499 gen
->tile_first
+ kernel
->tile_len
+
1500 kernel
->n_grid
+ kernel
->n_block
, kernel
->thread_ids
);
1502 priv
= isl_map_align_params(priv
, isl_set_get_space(par
));
1503 priv
= isl_map_intersect_range(priv
, par
);
1505 dim
= isl_map_get_space(priv
);
1506 dim
= isl_space_drop_dims(dim
, isl_dim_in
, 0, isl_space_dim(dim
, isl_dim_in
));
1507 dim
= isl_space_drop_dims(dim
, isl_dim_out
, 0, isl_space_dim(dim
, isl_dim_out
));
1508 proj
= projection(dim
, gen
->shared_len
+ 2 * kernel
->n_block
,
1511 priv
= isl_map_apply_range(priv
, proj
);
1516 /* If max_shared_memory is not set to infinity (-1), then make
1517 * sure that the total amount of shared memory required by the
1518 * array reference groups mapped to shared memory is no larger
1519 * than this maximum.
1521 * We apply a greedy approach and discard (keep in global memory)
1522 * those groups that would result in a total memory size that
1523 * is larger than the maximum.
1525 * This function should be called after any function that may
1526 * affect the decision on whether to place a reference group
1527 * in private, shared or global memory.
1529 static void check_shared_memory_bound(struct gpu_gen
*gen
)
1532 isl_val
*left
, *size
;
1534 if (gen
->options
->max_shared_memory
< 0)
1537 left
= isl_val_int_from_si(gen
->ctx
, gen
->options
->max_shared_memory
);
1539 for (i
= 0; i
< gen
->kernel
->n_array
; ++i
) {
1540 struct gpu_local_array_info
*local
= &gen
->kernel
->array
[i
];
1542 for (j
= 0; j
< local
->n_group
; ++j
) {
1543 struct gpu_array_ref_group
*group
;
1545 group
= local
->groups
[j
];
1546 if (group
->private_tile
)
1548 if (!group
->shared_tile
)
1551 size
= gpu_array_tile_size(group
->shared_tile
);
1552 size
= isl_val_mul_ui(size
, local
->array
->size
);
1554 if (isl_val_le(size
, left
)) {
1555 left
= isl_val_sub(left
, size
);
1560 group
->shared_tile
=
1561 gpu_array_tile_free(group
->shared_tile
);
1568 /* Compute a tiling for all the array reference groups.
1570 static void compute_group_tilings(struct gpu_gen
*gen
)
1574 for (i
= 0; i
< gen
->kernel
->n_array
; ++i
) {
1575 struct gpu_local_array_info
*array
= &gen
->kernel
->array
[i
];
1577 for (j
= 0; j
< array
->n_group
; ++j
)
1578 gpu_array_ref_group_compute_tiling(array
->groups
[j
]);
1582 /* Take tiled_sched, project it onto the shared tile loops and
1583 * the loops that will be wrapped over the threads and
1584 * store the result in gen->shared_sched.
1585 * Also compute a projection that projects out the loops that will be
1586 * wrapped over the threads and store this projection in gen->shared_proj.
1588 static void compute_shared_sched(struct gpu_gen
*gen
)
1593 isl_union_map
*sched
;
1595 sched
= isl_union_map_copy(gen
->tiled_sched
);
1597 dim
= isl_union_map_get_space(sched
);
1598 proj
= projection(dim
, gen
->tiled_len
,
1599 gen
->shared_len
+ gen
->kernel
->n_block
);
1600 sched
= isl_union_map_apply_range(sched
, isl_union_map_from_map(proj
));
1602 dim
= isl_union_map_get_space(sched
);
1603 proj
= projection(dim
, gen
->shared_len
+ gen
->kernel
->n_block
,
1606 gen
->shared_sched
= sched
;
1607 gen
->shared_proj
= isl_union_map_from_map(proj
);
1610 /* Compute the size of a bounding box around the origin and "set",
1611 * where "set" is assumed to contain only non-negative elements.
1612 * In particular, compute the maximal value of "set" in each direction
1615 static __isl_give isl_multi_pw_aff
*extract_size(__isl_take isl_set
*set
,
1616 __isl_take isl_set
*context
)
1619 isl_multi_pw_aff
*mpa
;
1621 context
= isl_set_params(context
);
1622 n
= isl_set_dim(set
, isl_dim_set
);
1623 mpa
= isl_multi_pw_aff_zero(isl_set_get_space(set
));
1624 for (i
= 0; i
< n
; ++i
) {
1629 bound
= isl_set_dim_max(isl_set_copy(set
), i
);
1630 bound
= isl_pw_aff_coalesce(bound
);
1631 bound
= isl_pw_aff_gist(bound
, isl_set_copy(context
));
1633 space
= isl_pw_aff_get_domain_space(bound
);
1634 one
= isl_aff_zero_on_domain(isl_local_space_from_space(space
));
1635 one
= isl_aff_add_constant_si(one
, 1);
1636 bound
= isl_pw_aff_add(bound
, isl_pw_aff_from_aff(one
));
1637 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, bound
);
1640 isl_set_free(context
);
1645 /* Compute the effective grid size as a list of the sizes in each dimension.
1647 * The grid size specified by the user or set by default
1648 * in read_grid_sizes() and applied in tile_schedule(),
1649 * may be too large for the given code in the sense that
1650 * it may contain blocks that don't need to execute anything.
1651 * We therefore don't return this grid size, but instead the
1652 * smallest grid size that ensures that all blocks that actually
1653 * execute code are included in the grid.
1655 * We first extract a description of the grid, i.e., the possible values
1656 * of the block ids, from gen->tiled_sched.
1657 * The block ids are parameters in gen->tiled_sched.
1658 * We simply need to change them into set dimensions.
1660 * Then, for each block dimension, we compute the maximal value of the block id
1663 static __isl_give isl_multi_pw_aff
*extract_grid_size(struct gpu_gen
*gen
,
1664 struct ppcg_kernel
*kernel
)
1669 grid
= isl_union_map_params(isl_union_map_copy(gen
->tiled_sched
));
1670 grid
= isl_set_from_params(grid
);
1671 grid
= isl_set_add_dims(grid
, isl_dim_set
, kernel
->n_grid
);
1672 for (i
= 0; i
< kernel
->n_grid
; ++i
) {
1676 id
= isl_id_list_get_id(kernel
->block_ids
, i
);
1677 pos
= isl_set_find_dim_by_id(grid
, isl_dim_param
, id
);
1680 grid
= isl_set_equate(grid
, isl_dim_param
, pos
, isl_dim_set
, i
);
1681 grid
= isl_set_project_out(grid
, isl_dim_param
, pos
, 1);
1684 return extract_size(grid
, isl_set_copy(kernel
->context
));
1687 /* Compute the size of a fixed bounding box around the origin and "set",
1688 * where "set" is assumed to contain only non-negative elements,
1689 * and store the results in "size".
1690 * In particular, compute the maximal value of "set" in each direction
1693 static void extract_fixed_size(__isl_take isl_set
*set
, int *size
)
1696 isl_local_space
*ls
;
1699 n
= isl_set_dim(set
, isl_dim_set
);
1700 ls
= isl_local_space_from_space(isl_set_get_space(set
));
1701 obj
= isl_aff_zero_on_domain(ls
);
1702 for (i
= 0; i
< n
; ++i
) {
1705 obj
= isl_aff_set_coefficient_si(obj
, isl_dim_in
, i
, 1);
1706 max
= isl_set_max_val(set
, obj
);
1707 size
[i
] = isl_val_get_num_si(max
) + 1;
1709 obj
= isl_aff_set_coefficient_si(obj
, isl_dim_in
, i
, 0);
1715 /* Compute the effective block size as a list of the sizes in each dimension
1716 * and store the sizes in kernel->block_dim.
1718 * The block size specified by the user or set by default
1719 * in read_block_sizes() and applied in thread_tile_schedule(),
1720 * may be too large for the given code in the sense that
1721 * it may contain threads that don't need to execute anything.
1722 * We therefore update this block size in kernel->block_dim
1723 * to the smallest block size that ensures that all threads
1724 * that actually execute code are included in the block.
1726 * The current implementation eliminates all parameters, ensuring
1727 * that the size is a fixed constant in each dimension.
1728 * In principle we could also compute parametric sizes.
1729 * We would have to make sure to project out all b%d and t%d parameters,
1732 static void extract_block_size(struct gpu_gen
*gen
, struct ppcg_kernel
*kernel
)
1737 isl_multi_pw_aff
*mpa
;
1739 block
= isl_union_map_params(isl_union_map_copy(gen
->local_sched
));
1740 block
= isl_set_from_params(block
);
1741 block
= isl_set_add_dims(block
, isl_dim_set
, kernel
->n_block
);
1742 for (i
= 0; i
< kernel
->n_block
; ++i
) {
1746 id
= isl_id_list_get_id(kernel
->thread_ids
, i
);
1747 pos
= isl_set_find_dim_by_id(block
, isl_dim_param
, id
);
1750 block
= isl_set_equate(block
, isl_dim_param
, pos
,
1753 nparam
= isl_set_dim(block
, isl_dim_param
);
1754 block
= isl_set_project_out(block
, isl_dim_param
, 0, nparam
);
1756 extract_fixed_size(block
, kernel
->block_dim
);
1759 struct ppcg_kernel
*ppcg_kernel_free(struct ppcg_kernel
*kernel
)
1766 isl_id_list_free(kernel
->block_ids
);
1767 isl_id_list_free(kernel
->thread_ids
);
1768 isl_multi_pw_aff_free(kernel
->grid_size
);
1769 isl_set_free(kernel
->context
);
1770 isl_union_set_free(kernel
->core
);
1771 isl_union_set_free(kernel
->arrays
);
1772 isl_space_free(kernel
->space
);
1773 isl_ast_node_free(kernel
->tree
);
1775 for (i
= 0; i
< kernel
->n_array
; ++i
) {
1776 struct gpu_local_array_info
*array
= &kernel
->array
[i
];
1778 for (j
= 0; j
< array
->n_group
; ++j
)
1779 gpu_array_ref_group_free(array
->groups
[j
]);
1780 free(array
->groups
);
1782 isl_pw_aff_list_free(array
->bound
);
1784 free(kernel
->array
);
1786 for (i
= 0; i
< kernel
->n_var
; ++i
) {
1787 free(kernel
->var
[i
].name
);
1788 isl_vec_free(kernel
->var
[i
].size
);
1791 free(kernel
->tile_size
);
1798 /* Wrapper around ppcg_kernel_free for use as a isl_id_set_free_user callback.
1800 static void ppcg_kernel_free_wrap(void *user
)
1802 struct ppcg_kernel
*kernel
= user
;
1804 ppcg_kernel_free(kernel
);
1807 static void create_kernel_var(isl_ctx
*ctx
, struct gpu_array_ref_group
*group
,
1808 struct ppcg_kernel_var
*var
)
1811 struct gpu_array_tile
*tile
;
1815 var
->array
= group
->array
;
1817 tile
= group
->private_tile
;
1818 var
->type
= ppcg_access_private
;
1820 tile
= group
->shared_tile
;
1821 var
->type
= ppcg_access_shared
;
1824 p
= isl_printer_to_str(ctx
);
1825 p
= gpu_array_ref_group_print_name(group
, p
);
1826 var
->name
= isl_printer_get_str(p
);
1827 isl_printer_free(p
);
1829 var
->size
= isl_vec_alloc(ctx
, group
->array
->n_index
);
1831 for (j
= 0; j
< group
->array
->n_index
; ++j
)
1832 var
->size
= isl_vec_set_element_val(var
->size
, j
,
1833 isl_val_copy(tile
->bound
[j
].size
));
1836 static void create_kernel_vars(struct gpu_gen
*gen
, struct ppcg_kernel
*kernel
)
1841 for (i
= 0; i
< kernel
->n_array
; ++i
) {
1842 struct gpu_local_array_info
*array
= &kernel
->array
[i
];
1844 for (j
= 0; j
< array
->n_group
; ++j
) {
1845 struct gpu_array_ref_group
*group
= array
->groups
[j
];
1846 if (group
->private_tile
|| group
->shared_tile
)
1852 kernel
->var
= isl_calloc_array(gen
->ctx
, struct ppcg_kernel_var
, n
);
1853 assert(kernel
->var
);
1856 for (i
= 0; i
< kernel
->n_array
; ++i
) {
1857 struct gpu_local_array_info
*array
= &kernel
->array
[i
];
1859 for (j
= 0; j
< array
->n_group
; ++j
) {
1860 struct gpu_array_ref_group
*group
= array
->groups
[j
];
1861 if (!group
->private_tile
&& !group
->shared_tile
)
1863 create_kernel_var(gen
->ctx
, group
, &kernel
->var
[n
]);
1869 /* Replace "pa" by the zero function defined over the universe domain
1870 * in the space of "pa".
1872 static __isl_give isl_pw_aff
*set_universally_zero(__isl_take isl_pw_aff
*pa
)
1877 space
= isl_space_domain(isl_pw_aff_get_space(pa
));
1878 isl_pw_aff_free(pa
);
1879 zero
= isl_aff_zero_on_domain(isl_local_space_from_space(space
));
1881 return isl_pw_aff_from_aff(zero
);
1884 /* The sizes of the arrays on the host that have been computed by
1885 * extract_array_info may depend on the parameters. Use the extra
1886 * constraints on the parameters that are valid at "host_domain"
1887 * to simplify these expressions and store the results in kernel->array.
1889 * We only need these localized bounds for arrays that are accessed
1890 * by the current kernel. If we have found at least one reference group
1891 * then the array is accessed by the kernel. If the array has compound
1892 * elements then we skipped the construction of array reference groups.
1894 * The resulting sizes may be functions that are nowhere defined
1895 * in case the access function cannot possibly access anything inside
1896 * the kernel for some reason. If so, they are replaced by the zero
1897 * function. Since the access function cannot actually access anything,
1898 * there is no harm in printing the array sizes as zero.
1900 static void localize_bounds(struct gpu_gen
*gen
, struct ppcg_kernel
*kernel
,
1901 __isl_keep isl_set
*host_domain
)
1906 context
= isl_set_copy(host_domain
);
1907 context
= isl_set_params(context
);
1909 for (i
= 0; i
< kernel
->n_array
; ++i
) {
1910 struct gpu_local_array_info
*local
= &kernel
->array
[i
];
1911 isl_pw_aff_list
*bound
;
1914 if (local
->n_group
== 0 && !local
->array
->has_compound_element
)
1917 n_index
= local
->array
->n_index
;
1918 bound
= isl_pw_aff_list_alloc(gen
->ctx
, n_index
);
1920 for (j
= 0; j
< n_index
; ++j
) {
1924 pwaff
= isl_pw_aff_copy(local
->array
->bound
[j
]);
1925 pwaff
= isl_pw_aff_gist(pwaff
, isl_set_copy(context
));
1926 empty
= isl_pw_aff_is_empty(pwaff
);
1928 pwaff
= isl_pw_aff_free(pwaff
);
1930 pwaff
= set_universally_zero(pwaff
);
1931 bound
= isl_pw_aff_list_add(bound
, pwaff
);
1934 local
->n_index
= n_index
;
1935 local
->bound
= bound
;
1937 isl_set_free(context
);
1940 /* Create the array of gpu_local_array_info structures "array"
1941 * inside "kernel". The number of elements in this array is
1942 * the same as the number of arrays in "prog".
1943 * Initialize the "array" field of each local array to point
1944 * to the corresponding array in "prog".
1946 static struct ppcg_kernel
*ppcg_kernel_create_local_arrays(
1947 struct ppcg_kernel
*kernel
, struct gpu_prog
*prog
)
1952 ctx
= isl_set_get_ctx(prog
->context
);
1953 kernel
->array
= isl_calloc_array(ctx
,
1954 struct gpu_local_array_info
, prog
->n_array
);
1956 return ppcg_kernel_free(kernel
);
1957 kernel
->n_array
= prog
->n_array
;
1959 for (i
= 0; i
< prog
->n_array
; ++i
)
1960 kernel
->array
[i
].array
= &prog
->array
[i
];
1965 /* Find the element in gen->stmt that has the given "id".
1966 * Return NULL if no such gpu_stmt can be found.
1968 static struct gpu_stmt
*find_stmt(struct gpu_prog
*prog
, __isl_keep isl_id
*id
)
1972 for (i
= 0; i
< prog
->n_stmts
; ++i
) {
1973 if (id
== prog
->stmts
[i
].id
)
1977 return i
< prog
->n_stmts
? &prog
->stmts
[i
] : NULL
;
1980 void ppcg_kernel_stmt_free(void *user
)
1983 struct ppcg_kernel_stmt
*stmt
= user
;
1988 switch (stmt
->type
) {
1989 case ppcg_kernel_copy
:
1990 isl_ast_expr_free(stmt
->u
.c
.index
);
1991 isl_ast_expr_free(stmt
->u
.c
.local_index
);
1993 case ppcg_kernel_domain
:
1994 isl_id_to_ast_expr_free(stmt
->u
.d
.ref2expr
);
1996 case ppcg_kernel_sync
:
2003 /* Set the options of "context" to
2005 * { space -> [x] : x >= first }
2007 static __isl_give isl_ast_build
*set_unroll(
2008 __isl_take isl_ast_build
*build
, __isl_take isl_space
*space
,
2015 ctx
= isl_ast_build_get_ctx(build
);
2017 space
= isl_space_from_domain(space
);
2018 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
2019 space
= isl_space_set_tuple_name(space
, isl_dim_out
, "unroll");
2020 unroll
= isl_map_universe(space
);
2021 unroll
= isl_map_lower_bound_si(unroll
, isl_dim_out
, 0, first
);
2022 opt
= isl_union_map_from_map(unroll
);
2024 build
= isl_ast_build_set_options(build
, opt
);
2029 /* Extend the schedule "schedule" with the part of "extension"
2030 * starting at "first" up to "len".
2032 static __isl_give isl_union_map
*extend_schedule(
2033 __isl_take isl_union_map
*schedule
,
2034 __isl_take isl_union_map
*extension
, int first
, int len
)
2038 isl_union_map
*umap
;
2041 space
= isl_union_map_get_space(schedule
);
2042 space
= isl_space_set_from_params(space
);
2043 space
= isl_space_add_dims(space
, isl_dim_set
, len
);
2044 proj
= isl_set_identity(isl_set_universe(space
));
2045 proj
= isl_map_project_out(proj
, isl_dim_out
, 0, first
);
2046 extension
= isl_union_map_apply_range(extension
,
2047 isl_union_map_from_map(proj
));
2049 schedule
= isl_union_map_range_product(schedule
, extension
);
2054 /* Return the gpu_stmt_access in the list "accesses" that corresponds
2057 static struct gpu_stmt_access
*find_access(struct gpu_stmt_access
*accesses
,
2058 __isl_keep isl_id
*ref_id
)
2060 struct gpu_stmt_access
*access
;
2062 for (access
= accesses
; access
; access
= access
->next
)
2063 if (access
->ref_id
== ref_id
)
2069 /* Return the index of the array called "name" in the list of arrays.
2071 static int find_array_index(struct gpu_gen
*gen
, const char *name
)
2075 for (i
= 0; i
< gen
->prog
->n_array
; ++i
)
2076 if (!strcmp(name
, gen
->prog
->array
[i
].name
))
2082 /* Internal data structure for the index and AST expression transformation
2083 * callbacks for pet_stmt_build_ast_exprs.
2085 * "accesses" is the list of gpu_stmt_access in the statement.
2086 * "iterator_map" expresses the statement iterators in terms of
2087 * the AST loop iterators.
2088 * "sched2shared" expresses the first shared_len dimensions of
2089 * the computed schedule in terms of the AST loop iterators.
2091 * The following fields are set in transform_index and used in transform_expr.
2092 * "array" is the array that is being accessed.
2093 * "global" is set if the global array is accessed (rather than
2094 * shared/private memory).
2095 * "local_array" refers to information on the array specialized
2096 * to the current kernel.
2098 struct ppcg_transform_data
{
2099 struct gpu_gen
*gen
;
2100 struct gpu_stmt_access
*accesses
;
2101 isl_pw_multi_aff
*iterator_map
;
2102 isl_pw_multi_aff
*sched2shared
;
2104 struct gpu_array_info
*array
;
2106 struct gpu_local_array_info
*local_array
;
2109 /* Return the name of the outer array (of structs) accessed by "access".
2111 static const char *get_outer_array_name(__isl_keep isl_map
*access
)
2116 space
= isl_space_range(isl_map_get_space(access
));
2117 while (space
&& isl_space_is_wrapping(space
))
2118 space
= isl_space_domain(isl_space_unwrap(space
));
2119 name
= isl_space_get_tuple_name(space
, isl_dim_set
);
2120 isl_space_free(space
);
2125 /* Return a pointer to the gpu_array_ref_group in "local"
2126 * that contains the reference "access".
2127 * Return NULL if no such group can be found.
2129 static struct gpu_array_ref_group
*find_ref_group(
2130 struct gpu_local_array_info
*local
, struct gpu_stmt_access
*access
)
2134 for (i
= 0; i
< local
->n_group
; ++i
) {
2135 struct gpu_array_ref_group
*group
= local
->groups
[i
];
2137 for (j
= 0; j
< group
->n_ref
; ++j
)
2138 if (group
->refs
[j
] == access
)
2145 /* Index transformation callback for pet_stmt_build_ast_exprs.
2147 * "index" expresses the array indices in terms of statement iterators
2149 * We first reformulate "index" in terms of the AST loop iterators.
2150 * Then we check if we are accessing the global array or
2151 * a shared/private copy. In the former case, we simply return
2152 * the updated index. If "index" is an affine expression rather
2153 * than an array access, then we also return the updated index here.
2155 * If no reference groups have been computed for the array,
2156 * then we can only be accessing the global array.
2158 * Otherwise, we apply the tiling to the index.
2159 * This tiling is of the form
2163 * The index is of the form
2167 * We update the tiling to refer to the AST loop iterators
2171 * and modify index to keep track of those iterators
2175 * Combining these two yields a tiled index expression in terms
2176 * of the AST loop iterators
2180 static __isl_give isl_multi_pw_aff
*transform_index(
2181 __isl_take isl_multi_pw_aff
*index
, __isl_keep isl_id
*ref_id
,
2184 struct ppcg_transform_data
*data
= user
;
2185 struct gpu_stmt_access
*access
;
2186 struct gpu_array_ref_group
*group
;
2187 struct gpu_array_tile
*tile
;
2188 isl_pw_multi_aff
*iterator_map
;
2192 isl_multi_pw_aff
*tiling
;
2193 isl_pw_multi_aff
*pma
;
2194 isl_multi_pw_aff
*mpa
;
2198 iterator_map
= isl_pw_multi_aff_copy(data
->iterator_map
);
2199 index
= isl_multi_pw_aff_pullback_pw_multi_aff(index
, iterator_map
);
2201 access
= find_access(data
->accesses
, ref_id
);
2204 if (!isl_map_has_tuple_name(access
->access
, isl_dim_out
))
2207 name
= get_outer_array_name(access
->access
);
2208 i
= find_array_index(data
->gen
, name
);
2210 isl_die(isl_multi_pw_aff_get_ctx(index
), isl_error_internal
,
2211 "cannot find array",
2212 return isl_multi_pw_aff_free(index
));
2213 data
->array
= &data
->gen
->prog
->array
[i
];
2214 data
->local_array
= &data
->gen
->kernel
->array
[i
];
2216 group
= find_ref_group(data
->local_array
, access
);
2222 tile
= group
->private_tile
;
2224 tile
= group
->shared_tile
;
2225 data
->global
= !tile
;
2229 space
= isl_space_range(isl_multi_pw_aff_get_space(index
));
2230 space
= isl_space_map_from_set(space
);
2231 pma
= isl_pw_multi_aff_identity(space
);
2232 pma
= isl_pw_multi_aff_product(
2233 isl_pw_multi_aff_copy(data
->sched2shared
), pma
);
2234 tiling
= isl_multi_pw_aff_from_multi_aff(
2235 isl_multi_aff_copy(tile
->tiling
));
2236 tiling
= isl_multi_pw_aff_pullback_pw_multi_aff(tiling
, pma
);
2238 space
= isl_space_domain(isl_multi_pw_aff_get_space(index
));
2239 space
= isl_space_map_from_set(space
);
2240 mpa
= isl_multi_pw_aff_identity(space
);
2241 index
= isl_multi_pw_aff_range_product(mpa
, index
);
2242 index
= isl_multi_pw_aff_pullback_multi_pw_aff(tiling
, index
);
2247 /* Dereference "expr" by adding an index [0].
2248 * The original "expr" is assumed not to have any indices.
2250 * If "expr" is a member access, then the dereferencing needs
2251 * to be applied to the structure argument of this member access.
2253 static __isl_give isl_ast_expr
*dereference(__isl_take isl_ast_expr
*expr
)
2256 isl_ast_expr
*arg0
, *res
;
2257 isl_ast_expr_list
*list
;
2259 arg0
= isl_ast_expr_get_op_arg(expr
, 0);
2261 return isl_ast_expr_free(expr
);
2262 if (isl_ast_expr_get_type(arg0
) == isl_ast_expr_op
&&
2263 isl_ast_expr_get_op_type(arg0
) == isl_ast_op_member
) {
2266 arg
= isl_ast_expr_get_op_arg(arg0
, 0);
2267 arg
= dereference(arg
);
2268 arg0
= isl_ast_expr_set_op_arg(arg0
, 0, arg
);
2269 expr
= isl_ast_expr_set_op_arg(expr
, 0, arg0
);
2273 isl_ast_expr_free(arg0
);
2275 ctx
= isl_ast_expr_get_ctx(expr
);
2276 res
= isl_ast_expr_from_val(isl_val_zero(ctx
));
2277 list
= isl_ast_expr_list_from_ast_expr(res
);
2278 res
= isl_ast_expr_get_op_arg(expr
, 0);
2279 res
= isl_ast_expr_access(res
, list
);
2280 isl_ast_expr_free(expr
);
2285 /* Linearize the index expression "expr" based on the array bounds
2288 * That is, transform expression
2290 * A[i_0][i_1]...[i_n]
2294 * A[(..((i_0 * b_1 + i_1) ... ) * b_n + i_n]
2296 * where b_0, b_1, ..., b_n are the bounds on the array.
2298 * If the base of "expr" is a member access, then the linearization needs
2299 * to be applied to the structure argument of this member access.
2301 * In the base case, if "expr" has no arguments (other than the name of
2302 * the array), then we are passing an entire array to a function.
2303 * In this case, there is nothing to linearize.
2304 * Note that at this point an expression with no arguments can
2305 * only be an entire array because the scalar case and
2306 * the case of single struct are handled by the caller.
2308 * If the number of specified index expressions in "expr"
2309 * is smaller than the dimension of the accessed array,
2310 * then the missing i_j also do not appear in the linearized expression.
2311 * Furthermore, since such an expression does not refer to a single
2312 * element while the default linearized expression would refer to
2313 * a single element, we return the expression
2315 * A + (..((i_0 * b_1 + i_1) ... ) * b_n]
2317 * instead. Note that because of the special case handling above,
2318 * we can assume here that here that there is at least one index expression.
2320 __isl_give isl_ast_expr
*gpu_local_array_info_linearize_index(
2321 struct gpu_local_array_info
*array
, __isl_take isl_ast_expr
*expr
)
2328 isl_ast_expr_list
*list
;
2329 isl_ast_build
*build
;
2331 arg0
= isl_ast_expr_get_op_arg(expr
, 0);
2332 if (isl_ast_expr_get_type(arg0
) == isl_ast_expr_op
&&
2333 isl_ast_expr_get_op_type(arg0
) == isl_ast_op_member
) {
2336 arg
= isl_ast_expr_get_op_arg(arg0
, 0);
2337 arg
= gpu_local_array_info_linearize_index(array
, arg
);
2338 arg0
= isl_ast_expr_set_op_arg(arg0
, 0, arg
);
2339 expr
= isl_ast_expr_set_op_arg(expr
, 0, arg0
);
2343 isl_ast_expr_free(arg0
);
2345 if (isl_ast_expr_get_op_n_arg(expr
) == 1)
2348 ctx
= isl_ast_expr_get_ctx(expr
);
2349 context
= isl_set_universe(isl_space_params_alloc(ctx
, 0));
2350 build
= isl_ast_build_from_context(context
);
2352 n
= isl_ast_expr_get_op_n_arg(expr
);
2353 res
= isl_ast_expr_get_op_arg(expr
, 1);
2354 for (i
= 1; i
< array
->n_index
; ++i
) {
2355 isl_pw_aff
*bound_i
;
2356 isl_ast_expr
*expr_i
;
2358 bound_i
= isl_pw_aff_list_get_pw_aff(array
->bound
, i
);
2359 expr_i
= isl_ast_build_expr_from_pw_aff(build
, bound_i
);
2360 res
= isl_ast_expr_mul(res
, expr_i
);
2364 expr_i
= isl_ast_expr_get_op_arg(expr
, i
+ 1);
2365 res
= isl_ast_expr_add(res
, expr_i
);
2368 isl_ast_build_free(build
);
2370 if (1 + array
->n_index
> n
) {
2371 res
= isl_ast_expr_add(isl_ast_expr_get_op_arg(expr
, 0), res
);
2373 list
= isl_ast_expr_list_from_ast_expr(res
);
2374 res
= isl_ast_expr_get_op_arg(expr
, 0);
2375 res
= isl_ast_expr_access(res
, list
);
2378 isl_ast_expr_free(expr
);
2383 /* AST expression transformation callback for pet_stmt_build_ast_exprs.
2385 * If the AST expression refers to an array that is not accessed
2386 * at all, then this means the value of the expression is not used,
2387 * so we might as well print zero (NULL pointer) instead.
2389 * If the AST expression refers to a global scalar that is not
2390 * a read-only scalar, then its address was passed to the kernel and
2391 * we need to dereference it.
2393 * If the AST expression refers to an access to a global array,
2394 * then we linearize the access exploiting the bounds in data->local_array.
2396 static __isl_give isl_ast_expr
*transform_expr(__isl_take isl_ast_expr
*expr
,
2397 __isl_keep isl_id
*id
, void *user
)
2399 struct ppcg_transform_data
*data
= user
;
2403 if (!data
->array
->accessed
) {
2406 ctx
= isl_ast_expr_get_ctx(expr
);
2407 isl_ast_expr_free(expr
);
2408 return isl_ast_expr_from_val(isl_val_zero(ctx
));
2410 if (gpu_array_is_read_only_scalar(data
->array
))
2414 if (data
->array
->n_index
== 0)
2415 return dereference(expr
);
2416 if (!data
->array
->linearize
)
2419 return gpu_local_array_info_linearize_index(data
->local_array
, expr
);
2422 /* This function is called for each instance of a user statement
2425 * We attach a struct ppcg_kernel_stmt to the "node", containing
2426 * a computed AST expression for each access.
2427 * These AST expressions are computed from iterator_map,
2428 * which expresses the domain
2429 * elements in terms of the generated loops, and sched2shared,
2430 * which expresses the first shared_len dimensions of the schedule
2431 * computed by PPCG in terms of the generated loops.
2433 static __isl_give isl_ast_node
*at_each_domain(__isl_take isl_ast_node
*node
,
2434 __isl_keep isl_ast_build
*build
, void *user
)
2436 struct ppcg_transform_data data
;
2437 struct gpu_gen
*gen
= (struct gpu_gen
*) user
;
2438 struct ppcg_kernel_stmt
*stmt
;
2440 isl_pw_multi_aff
*sched2shared
;
2442 isl_pw_multi_aff
*iterator_map
;
2443 isl_ast_expr
*expr
, *arg
;
2444 isl_union_map
*schedule
;
2446 stmt
= isl_calloc_type(gen
->ctx
, struct ppcg_kernel_stmt
);
2448 return isl_ast_node_free(node
);
2450 expr
= isl_ast_node_user_get_expr(node
);
2451 arg
= isl_ast_expr_get_op_arg(expr
, 0);
2452 id
= isl_ast_expr_get_id(arg
);
2454 schedule
= isl_ast_build_get_schedule(build
);
2455 map
= isl_map_reverse(isl_map_from_union_map(schedule
));
2456 iterator_map
= isl_pw_multi_aff_from_map(map
);
2457 sched2shared
= compute_sched_to_shared(gen
,
2458 isl_pw_multi_aff_copy(iterator_map
));
2460 stmt
->type
= ppcg_kernel_domain
;
2461 stmt
->u
.d
.stmt
= find_stmt(gen
->prog
, id
);
2462 if (!stmt
->u
.d
.stmt
)
2463 isl_die(gen
->ctx
, isl_error_internal
,
2464 "statement not found", goto error
);
2467 data
.accesses
= stmt
->u
.d
.stmt
->accesses
;
2468 data
.iterator_map
= iterator_map
;
2469 data
.sched2shared
= sched2shared
;
2470 stmt
->u
.d
.ref2expr
= pet_stmt_build_ast_exprs(stmt
->u
.d
.stmt
->stmt
,
2471 build
, &transform_index
, &data
,
2472 &transform_expr
, &data
);
2475 isl_pw_multi_aff_free(iterator_map
);
2476 isl_pw_multi_aff_free(sched2shared
);
2477 isl_ast_expr_free(arg
);
2478 isl_ast_expr_free(expr
);
2480 id
= isl_id_alloc(gen
->ctx
, NULL
, stmt
);
2481 id
= isl_id_set_free_user(id
, &ppcg_kernel_stmt_free
);
2482 return isl_ast_node_set_annotation(node
, id
);
2485 isl_pw_multi_aff_free(iterator_map
);
2486 ppcg_kernel_stmt_free(stmt
);
2487 isl_pw_multi_aff_free(sched2shared
);
2488 return isl_ast_node_free(node
);
2491 /* This function is called when code has been generated for the shared
2492 * tile loops. The "schedule" refers only to the original statements.
2494 * We extend the schedule with that part of gen->local_sched that hasn't
2495 * been taken into account yet. This introduces parameters referring
2496 * to thread ids in the schedule, so we add them (with the appropriate
2497 * bounds to the context as well).
2498 * Finally, we set the appropriate unrolling options
2499 * if gen->first_unroll is set.
2501 static __isl_give isl_ast_node
*create_domain_leaf(
2502 __isl_take isl_union_map
*schedule
, __isl_take isl_ast_build
*build
,
2505 struct gpu_gen
*gen
= (struct gpu_gen
*) user
;
2507 isl_union_map
*sched
;
2510 isl_id_list
*iterators
;
2513 schedule
= extend_schedule(schedule
,
2514 isl_union_map_copy(gen
->local_sched
),
2515 gen
->shared_len
, gen
->thread_tiled_len
);
2517 space
= isl_ast_build_get_schedule_space(build
);
2518 set
= isl_set_universe(space
);
2519 set
= add_bounded_parameters(set
, gen
->kernel
->block_dim
,
2520 gen
->kernel
->thread_ids
);
2521 build
= isl_ast_build_restrict(build
, set
);
2523 n
= gen
->thread_tiled_len
- gen
->shared_len
;
2525 if (gen
->first_unroll
>= 0) {
2526 space
= isl_space_set_alloc(gen
->ctx
, 0, n
);
2527 build
= set_unroll(build
, space
, gen
->first_unroll
);
2529 iterators
= ppcg_scop_generate_names(gen
->prog
->scop
, n
, "c");
2530 build
= isl_ast_build_set_iterators(build
, iterators
);
2531 build
= isl_ast_build_set_at_each_domain(build
, &at_each_domain
, gen
);
2532 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
2533 isl_ast_build_free(build
);
2538 /* This function is called for each statement node in the AST of the code
2539 * for copying to or from shared/private memory.
2540 * Attach a pointer to a ppcg_kernel_stmt representing the copy
2541 * statement to the node.
2542 * The statement name is "read" or "write", depending on whether we are
2543 * reading from global memory or writing to global memory.
2544 * The name of the T space is {shared,private}_<array>.
2546 * The schedule is of the form
2550 * where A refers to a piece of an array and T to the corresponding
2551 * shifted tile. We split this schedule into mappings L -> A and L -> T
2552 * and store the corresponding expressions in stmt->index and stmt->local_index,
2553 * where stmt points to the ppcg_kernel_stmt that is attached to the node.
2555 static __isl_give isl_ast_node
*attach_copy_stmt(__isl_take isl_ast_node
*node
,
2556 __isl_keep isl_ast_build
*build
, void *user
)
2558 struct gpu_gen
*gen
= (struct gpu_gen
*) user
;
2559 struct ppcg_kernel_stmt
*stmt
;
2563 isl_map
*access
, *local_access
, *map
;
2564 isl_pw_multi_aff
*pma
;
2568 stmt
= isl_calloc_type(gen
->ctx
, struct ppcg_kernel_stmt
);
2570 return isl_ast_node_free(node
);
2572 access
= isl_map_from_union_map(isl_ast_build_get_schedule(build
));
2573 type
= isl_map_get_tuple_name(access
, isl_dim_in
);
2574 stmt
->u
.c
.read
= !strcmp(type
, "read");
2575 access
= isl_map_reverse(access
);
2576 space
= isl_space_unwrap(isl_space_range(isl_map_get_space(access
)));
2577 local_access
= isl_map_copy(access
);
2579 map
= isl_map_domain_map(isl_map_universe(isl_space_copy(space
)));
2580 id
= isl_map_get_tuple_id(access
, isl_dim_out
);
2581 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
2582 access
= isl_map_apply_range(access
, map
);
2583 pma
= isl_pw_multi_aff_from_map(access
);
2584 expr
= isl_ast_build_access_from_pw_multi_aff(build
, pma
);
2585 stmt
->u
.c
.index
= expr
;
2587 map
= isl_map_range_map(isl_map_universe(space
));
2588 id
= isl_map_get_tuple_id(local_access
, isl_dim_out
);
2589 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
2590 local_access
= isl_map_apply_range(local_access
, map
);
2591 pma
= isl_pw_multi_aff_from_map(local_access
);
2592 expr
= isl_ast_build_access_from_pw_multi_aff(build
, pma
);
2593 stmt
->u
.c
.local_index
= expr
;
2595 stmt
->u
.c
.array
= gen
->copy_group
->array
;
2596 array_index
= stmt
->u
.c
.array
- gen
->prog
->array
;
2597 stmt
->u
.c
.local_array
= &gen
->kernel
->array
[array_index
];
2598 stmt
->type
= ppcg_kernel_copy
;
2600 id
= isl_id_alloc(gen
->ctx
, NULL
, stmt
);
2601 id
= isl_id_set_free_user(id
, &ppcg_kernel_stmt_free
);
2602 return isl_ast_node_set_annotation(node
, id
);
2605 /* Given a schedule of the form
2609 * (with S the first shared_len dimensions of the computed schedule,
2610 * A the array and L the schedule correponding to the generated loops),
2611 * indicating where to copy the array elements that need to be copied,
2612 * construct code for performing the copying.
2614 * "group" is the array reference group that is being copied
2615 * "type" is either "read" or "write"
2616 * private is set if copying needs to be performed to/from registers
2618 * We first construct a mapping to a shifted tile of the array,
2620 * [S -> A] -> T(S,A) (1)
2622 * If private is set, then we also use this mapping as a schedule
2623 * (which is already thread-specific and will be completely unrolled).
2624 * Otherwise, we wrap/tile the range over the threads.
2627 * [S -> A] -> T'(S,A)
2629 * Combined with the given schedule, we have
2631 * [S -> A] -> [L -> T'(S,A)] (2)
2633 * From the shifted tile mapping, we construct a mapping
2635 * [S -> A] -> [A -> T(S,A)]
2637 * and apply it to the schedule (2), obtaining
2639 * [A -> T(S(L),A)] -> [L -> T'(S(L),A)]
2641 * Note that we can project out S because it is uniquely defined by L.
2643 static __isl_give isl_ast_node
*copy_access(struct gpu_gen
*gen
,
2644 __isl_take isl_map
*sched
,
2645 const char *type
, struct gpu_array_ref_group
*group
,
2646 __isl_take isl_ast_build
*build
, int private)
2650 isl_map
*schedule
, *shift
, *map
;
2652 isl_id_list
*iterators
;
2655 shift
= shift_access(group
);
2657 schedule
= isl_map_copy(shift
);
2658 schedule
= isl_map_reset_tuple_id(schedule
, isl_dim_out
);
2660 schedule
= tile_access_schedule(gen
, schedule
);
2662 n
= isl_map_dim(schedule
, isl_dim_out
);
2663 set
= isl_set_universe(isl_ast_build_get_schedule_space(build
));
2664 set
= add_bounded_parameters(set
, gen
->kernel
->block_dim
,
2665 gen
->kernel
->thread_ids
);
2667 schedule
= isl_map_range_product(sched
, schedule
);
2669 space
= isl_space_domain(isl_map_get_space(shift
));
2670 map
= isl_map_range_map(isl_map_universe(isl_space_unwrap(space
)));
2671 map
= isl_map_range_product(map
, shift
);
2673 schedule
= isl_map_apply_domain(schedule
, map
);
2675 schedule
= isl_map_set_tuple_name(schedule
, isl_dim_in
, type
);
2677 build
= isl_ast_build_restrict(build
, set
);
2679 gen
->copy_group
= group
;
2682 space
= isl_space_range(isl_map_get_space(schedule
));
2683 space
= isl_space_range(isl_space_unwrap(space
));
2684 build
= set_unroll(build
, space
, 0);
2686 iterators
= ppcg_scop_generate_names(gen
->prog
->scop
, n
, "c");
2687 build
= isl_ast_build_set_iterators(build
, iterators
);
2688 build
= isl_ast_build_set_at_each_domain(build
, &attach_copy_stmt
, gen
);
2689 tree
= isl_ast_build_node_from_schedule_map(build
,
2690 isl_union_map_from_map(schedule
));
2691 isl_ast_build_free(build
);
2696 /* Return code for reading into or writing from shared memory
2697 * the given array reference group.
2699 * If we are performing a read from global memory to shared memory and
2700 * if the array involved is not a scalar, then we copy
2701 * the entire tile to shared memory. This may result in some extra
2702 * elements getting copied, but it should lead to simpler code
2703 * (which means that fewer registers may be needed) and less divergence.
2705 * Otherwise, we only copy the elements that will be read or have been written
2709 * The input "sched" is of the form.
2713 * with S the first shared_len dimensions of the computed schedule,
2714 * A the array and L the schedule correponding to the generated loops.
2716 * We first drop "type",
2720 * If the above conditions are satisfied, we project out A,
2725 * and then introduce the group tile [S -> T], resulting in
2729 static __isl_give isl_ast_node
*copy_group_shared_accesses(
2730 struct gpu_gen
*gen
, struct gpu_array_ref_group
*group
,
2731 __isl_take isl_map
*sched
, __isl_take isl_ast_build
*build
)
2735 isl_union_map
*access
;
2737 type
= isl_map_get_tuple_name(sched
, isl_dim_in
);
2738 read
= !strcmp(type
, "read");
2740 sched
= isl_map_reset_tuple_id(sched
, isl_dim_in
);
2742 if (read
&& !gpu_array_is_scalar(group
->array
)) {
2746 space
= isl_space_domain(isl_map_get_space(sched
));
2747 space
= isl_space_unwrap(space
);
2748 map
= isl_map_domain_map(isl_map_universe(space
));
2749 sched
= isl_map_apply_domain(sched
, map
);
2751 map
= group_tile(group
);
2752 map
= isl_map_reverse(isl_map_domain_map(map
));
2753 sched
= isl_map_apply_domain(sched
, map
);
2756 return copy_access(gen
, sched
, type
, group
, build
, 0);
2759 /* Return code for reading into or writing from private memory
2760 * the given array reference group.
2762 * Let S be the first shared_len dimensions of the computed schedule,
2763 * D the iteration domains, A the array and L the schedule correponding
2764 * to the generated loops.
2765 * "sched" is of the form
2769 * where type is either "read" or "write".
2770 * We apply the privatization D -> S(t), with t the thread ids,
2771 * to the access relation D -> A to obtain the privatized access relation
2775 * We drop the type from "sched" and intersect with the privatized access
2776 * relation to obtain
2780 static __isl_give isl_ast_node
*copy_group_private_accesses(
2781 struct gpu_gen
*gen
, struct gpu_array_ref_group
*group
,
2782 __isl_take isl_map
*sched
, __isl_take isl_ast_build
*build
)
2786 isl_union_map
*priv
;
2787 isl_union_map
*access
;
2788 isl_map
*access_map
;
2790 type
= isl_map_get_tuple_name(sched
, isl_dim_in
);
2791 read
= !strcmp(type
, "read");
2793 priv
= isl_union_map_from_map(isl_map_copy(gen
->privatization
));
2794 priv
= isl_union_map_apply_range(isl_union_map_copy(gen
->shared_sched
),
2797 access
= gpu_array_ref_group_access_relation(group
, read
, !read
);
2798 access
= isl_union_map_apply_domain(access
, priv
);
2799 access_map
= isl_map_from_union_map(access
);
2801 sched
= isl_map_reset_tuple_id(sched
, isl_dim_in
);
2802 sched
= isl_map_intersect_domain(sched
, isl_map_wrap(access_map
));
2804 return copy_access(gen
, sched
, type
, group
, build
, 1);
2807 /* Return code for reading into or writing from shared or private memory.
2809 * "schedule" is of the form
2813 * with S be the first shared_len dimensions of the computed schedule,
2814 * A the array and L the schedule correponding to the generated loops.
2815 * The array reference group is attached to "type".
2817 static __isl_give isl_ast_node
*create_access_leaf(
2818 struct gpu_gen
*gen
, __isl_take isl_map
*schedule
,
2819 __isl_take isl_ast_build
*build
)
2821 struct gpu_array_ref_group
*group
;
2824 id
= isl_map_get_tuple_id(schedule
, isl_dim_in
);
2825 group
= isl_id_get_user(id
);
2828 if (group
->private_tile
)
2829 return copy_group_private_accesses(gen
, group
, schedule
,
2832 return copy_group_shared_accesses(gen
, group
, schedule
,
2836 /* Create a domain node representing a synchronization.
2838 static __isl_give isl_ast_node
*create_sync_leaf(
2839 struct gpu_gen
*gen
, __isl_take isl_map
*schedule
,
2840 __isl_take isl_ast_build
*build
)
2842 struct ppcg_kernel_stmt
*stmt
;
2848 isl_map_free(schedule
);
2850 stmt
= isl_calloc_type(gen
->ctx
, struct ppcg_kernel_stmt
);
2854 stmt
->type
= ppcg_kernel_sync
;
2856 space
= isl_ast_build_get_schedule_space(build
);
2857 space
= isl_space_from_domain(space
);
2858 space
= isl_space_set_tuple_name(space
, isl_dim_out
, "sync");
2859 expr
= isl_ast_build_call_from_pw_multi_aff(build
,
2860 isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
)));
2861 node
= isl_ast_node_alloc_user(expr
);
2862 isl_ast_build_free(build
);
2864 id
= isl_id_alloc(gen
->ctx
, NULL
, stmt
);
2865 id
= isl_id_set_free_user(id
, &ppcg_kernel_stmt_free
);
2866 return isl_ast_node_set_annotation(node
, id
);
2869 /* This function is called during the code generation at the point
2870 * where the schedule domain element is completely determined by
2871 * the generated code. The input schedule contains the original
2872 * statements as well as synchronization and copy "statements".
2873 * The latter are scheduled at different points than any of the original
2874 * statements, so they will only arrive here in isolation.
2876 * If the current schedule only refers to a single statement,
2877 * we check if it is a copy or synchronization statement and
2878 * call the appropriate functions.
2879 * Otherwise, we assume we are dealing with the original statements
2880 * and we call create_domain_leaf.
2882 static __isl_give isl_ast_node
*create_kernel_leaf(
2883 __isl_take isl_ast_build
*build
, void *user
)
2885 struct gpu_gen
*gen
= (struct gpu_gen
*) user
;
2887 isl_union_map
*schedule
;
2890 schedule
= isl_ast_build_get_schedule(build
);
2892 if (isl_union_map_n_map(schedule
) != 1)
2893 return create_domain_leaf(schedule
, build
, user
);
2895 map
= isl_map_from_union_map(schedule
);
2896 name
= isl_map_get_tuple_name(map
, isl_dim_in
);
2897 if (!strcmp(name
, "read") || !strcmp(name
, "write"))
2898 return create_access_leaf(gen
, map
, build
);
2899 if (!strcmp(name
, "sync"))
2900 return create_sync_leaf(gen
, map
, build
);
2902 return create_domain_leaf(isl_union_map_from_map(map
), build
, user
);
2905 /* Mark all odd schedule dimensions as "atomic" (when the even dimensions
2906 * have value 0) and all even schedule dimensions as "unroll".
2908 * That is, the options look as follows
2910 * { [0, b, 0, d, ..., 0] -> atomic[i] : exists a : i = 2 a + 1;
2911 * [a, b, c, d, ..., z] -> unroll[i] : exists a : i = 2 a }
2913 * The even positions are used to be able to schedule copying blocks
2914 * and synchronization before or after each level of the shared memory
2915 * tile loops and we want to make sure that code for these is generated
2916 * separately (within each level).
2918 static __isl_give isl_ast_build
*set_atomic_and_unroll(
2919 __isl_take isl_ast_build
*build
,
2920 __isl_take isl_space
*space
, int sched_len
)
2926 isl_local_space
*ls
;
2929 ctx
= isl_ast_build_get_ctx(build
);
2931 space
= isl_space_params(space
);
2932 space
= isl_space_add_dims(space
, isl_dim_set
, sched_len
);
2933 space
= isl_space_from_domain(space
);
2934 space
= isl_space_add_dims(space
, isl_dim_out
, 2);
2935 map
= isl_map_universe(isl_space_copy(space
));
2936 for (i
= 0; i
< sched_len
; i
+= 2)
2937 map
= isl_map_fix_si(map
, isl_dim_in
, i
, 0);
2938 ls
= isl_local_space_from_space(isl_map_get_space(map
));
2939 c
= isl_equality_alloc(ls
);
2940 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, 0, 1);
2941 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, 1, 2);
2942 c
= isl_constraint_set_constant_si(c
, 1);
2943 map
= isl_map_add_constraint(map
, c
);
2944 map
= isl_map_project_out(map
, isl_dim_out
, 1, 1);
2945 map
= isl_map_set_tuple_name(map
, isl_dim_out
, "atomic");
2946 opt
= isl_union_map_from_map(map
);
2948 map
= isl_map_universe(space
);
2949 ls
= isl_local_space_from_space(isl_map_get_space(map
));
2950 c
= isl_equality_alloc(ls
);
2951 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, 0, 1);
2952 c
= isl_constraint_set_coefficient_si(c
, isl_dim_out
, 1, 2);
2953 map
= isl_map_add_constraint(map
, c
);
2954 map
= isl_map_project_out(map
, isl_dim_out
, 1, 1);
2955 map
= isl_map_set_tuple_name(map
, isl_dim_out
, "unroll");
2956 opt
= isl_union_map_add_map(opt
, map
);
2958 build
= isl_ast_build_set_options(build
, opt
);
2963 /* Return a map that maps a space of dimension gen->shared_len
2964 * to its last dimensions starting at gen->tile_first.
2965 * The range is of dimension
2967 * 2 * (gen->shared_len - gen->tile_first) + 1
2969 * The input dimensions are mapped to the odd dimensions in the output,
2970 * while the even dimensions (except 2*pos) are fixed to 0.
2971 * Output dimension 2*pos (if pos >= 0) is fixed to "val".
2972 * If pos >= 0, then only the pos first dimensions starting at gen->tile_first
2973 * are mapped to the output. The remaining input dimensions are projected
2974 * out and the corresponding output dimensions are fixed to 0.
2976 static __isl_give isl_map
*insert_even(struct gpu_gen
*gen
,
2977 __isl_take isl_space
*space
, int pos
, int val
)
2982 space
= isl_space_set_from_params(space
);
2983 space
= isl_space_add_dims(space
, isl_dim_set
, gen
->shared_len
);
2984 space
= isl_space_map_from_set(space
);
2985 proj
= isl_map_identity(space
);
2986 proj
= isl_map_project_out(proj
, isl_dim_out
, 0, gen
->tile_first
);
2987 n
= gen
->shared_len
- gen
->tile_first
;
2988 for (i
= 0; i
<= n
; ++i
) {
2989 proj
= isl_map_insert_dims(proj
, isl_dim_out
, 2 * i
, 1);
2991 proj
= isl_map_fix_si(proj
, isl_dim_out
, 2 * i
, val
);
2993 proj
= isl_map_fix_si(proj
, isl_dim_out
, 2 * i
, 0);
2999 proj
= isl_map_eliminate(proj
, isl_dim_in
, gen
->tile_first
+ pos
,
3000 gen
->shared_len
- (gen
->tile_first
+ pos
));
3001 for (i
= pos
; i
< n
; ++i
)
3002 proj
= isl_map_fix_si(proj
, isl_dim_out
, 2 * i
+ 1, 0);
3007 /* Given the AST context schedule "schedule" and the mapping from
3008 * domains to the shared tile loops "shared_sched", add a schedule
3009 * for a synchronization operation at position "val" of loop level "pos".
3011 * schedule is of the form
3015 * (with D the iteration domains and L the already generated loops),
3016 * while shared_sched is of the form
3020 * We combine them into
3026 * [s_0,...] -> [0,s_{tile_first},0,..., val, 0, 0, ... 0]
3028 * and use the result as a schedule for "sync".
3030 static __isl_give isl_union_map
*add_sync_schedule(struct gpu_gen
*gen
,
3031 __isl_take isl_union_map
*res
, __isl_keep isl_union_map
*schedule
,
3032 __isl_keep isl_union_map
*shared_sched
, int pos
, int val
)
3035 isl_map
*proj
, *map
;
3037 shared_sched
= isl_union_map_copy(shared_sched
);
3038 schedule
= isl_union_map_copy(schedule
);
3040 space
= isl_union_map_get_space(shared_sched
);
3041 schedule
= isl_union_map_apply_domain(shared_sched
, schedule
);
3042 map
= isl_map_from_union_map(schedule
);
3044 proj
= insert_even(gen
, space
, pos
, val
);
3045 map
= isl_map_apply_range(map
, proj
);
3046 map
= isl_map_from_range(isl_map_wrap(map
));
3047 map
= isl_map_set_tuple_name(map
, isl_dim_in
, "sync");
3049 res
= isl_union_map_add_map(res
, map
);
3054 /* Given a set of wrapped references "ref", return the corresponding
3055 * access relations based on the tagged access relations "tagged".
3057 * The elements of "ref" are of the form
3061 * with D an iteration domains and R a reference.
3062 * The elements of "tagged" are of the form
3068 * Extend "tagged" to include the iteration domain in the range, i.e.,
3070 * [D -> R] -> [D -> A]
3072 * apply the result to "ref" and then unwrap the resulting set
3073 * to obtain relations of the form
3077 static __isl_give isl_union_map
*wrapped_reference_to_access(
3078 __isl_take isl_union_set
*ref
, __isl_take isl_union_map
*tagged
)
3080 isl_union_map
*tag2access
;
3082 tag2access
= isl_union_map_copy(tagged
);
3083 tag2access
= isl_union_map_universe(tag2access
);
3084 tag2access
= isl_union_set_unwrap(isl_union_map_domain(tag2access
));
3085 tag2access
= isl_union_map_domain_map(tag2access
);
3086 tag2access
= isl_union_map_range_product(tag2access
, tagged
);
3088 ref
= isl_union_set_coalesce(ref
);
3089 ref
= isl_union_set_apply(ref
, tag2access
);
3091 return isl_union_set_unwrap(ref
);
3094 /* Given an access relation "access" from "group", remove those reads
3095 * if ("read" is 1) or writes (if "read" is 0) that are only needed to
3096 * communicate data within the same iteration of the last_shared dimension
3099 * If the access is a read then it is either an element of
3101 * live_in union (range flow)
3103 * where live_in and flow may be overapproximations, or
3104 * it reads an uninitialized value (that is not live-in because
3105 * there is an intermediate kill) or it reads a value that was
3106 * written within the same (compound) statement instance.
3107 * If the access is a write then it is either an element of
3109 * live_out union (domain flow)
3111 * or it writes a value that is never read (and is not live-out
3112 * because of an intermediate kill) or only
3113 * within the same (compound) statement instance.
3114 * In both cases, the access relation is also a subset of
3115 * the group access relation.
3117 * The cases where an uninitialized value is read or a value is written
3118 * that is never read or where the dataflow occurs within a statement
3119 * instance are also considered local and may also be removed.
3121 * Essentially, we compute the intersection of "access" with either
3123 * live_in union (range non-local-flow)
3127 * live_out union (domain non-local-flow)
3129 * We first construct a relation "local"
3131 * [[D -> R] -> [D' -> R']]
3133 * of pairs of domain iterations accessing the reference group
3134 * and references in the group that are scheduled to the same iteration
3135 * of the last_shared dimension.
3137 * If this relation does not intersect the dataflow dependences,
3138 * then there is nothing we can possibly remove, unless the dataflow
3139 * dependences themselves only relate a subset of the accesses.
3140 * In particular, the accesses may not be involved in any dataflow
3141 * dependences, either because they are uninitialized reads/dead writes
3142 * or because the dataflow occurs inside a statement instance.
3144 * Since the computation below may break up the access relation
3145 * into smaller pieces, we only perform the intersection with
3146 * the non-local dependent accesses if the local pairs
3147 * intersect the dataflow dependences. Otherwise, we intersect
3148 * with the universe of the non-local dependent accesses.
3149 * This should at least remove accesses from statements that
3150 * do not participate in any dependences.
3152 * In particular, we remove the "local" dataflow dependences from
3153 * the set of all dataflow dependences.
3154 * Note that if the potential dataflow dependences are an overapproximation
3155 * of the actual dataflow dependences, then the result remains an
3156 * overapproximation of the non-local dataflow dependences.
3157 * Copying to/from global memory is only needed for the references
3158 * in the domain/range of the result or for accesses that are live out/in
3159 * for the entire scop.
3161 * We therefore map the domain/range of the "external" relation
3162 * to the corresponding access relation and take the union with
3163 * the live out/in relation.
3165 static __isl_give isl_union_map
*remove_local_accesses(struct gpu_gen
*gen
,
3166 struct gpu_array_ref_group
*group
, __isl_take isl_union_map
*access
,
3170 isl_union_pw_multi_aff
*tagger
;
3171 isl_union_set
*domain
;
3173 isl_union_map
*sched
, *local
, *tagged
, *external
;
3174 isl_union_set
*tag_set
;
3177 if (isl_union_map_is_empty(access
))
3180 tagged
= group_tagged_access_relation(group
);
3182 sched
= isl_union_map_copy(gen
->sched
);
3184 space
= isl_union_map_get_space(sched
);
3185 proj
= projection(space
, gen
->untiled_len
, group
->last_shared
+ 1);
3186 sched
= isl_union_map_apply_range(sched
, isl_union_map_from_map(proj
));
3188 tagger
= isl_union_pw_multi_aff_copy(gen
->prog
->scop
->tagger
);
3189 domain
= isl_union_map_domain(isl_union_map_copy(tagged
));
3190 tagger
= isl_union_pw_multi_aff_intersect_domain(tagger
, domain
);
3191 sched
= isl_union_map_preimage_domain_union_pw_multi_aff(sched
, tagger
);
3193 local
= isl_union_map_apply_range(sched
,
3194 isl_union_map_reverse(isl_union_map_copy(sched
)));
3195 local
= isl_union_map_intersect(local
,
3196 isl_union_map_copy(gen
->prog
->scop
->tagged_dep_flow
));
3198 empty
= isl_union_map_is_empty(local
);
3200 external
= isl_union_map_copy(gen
->prog
->scop
->tagged_dep_flow
);
3201 external
= isl_union_map_intersect_params(external
,
3202 isl_set_copy(gen
->prog
->scop
->context
));
3203 external
= isl_union_map_subtract(external
, local
);
3206 tag_set
= isl_union_map_range(external
);
3207 external
= wrapped_reference_to_access(tag_set
, tagged
);
3208 external
= isl_union_map_union(external
,
3209 isl_union_map_copy(gen
->prog
->scop
->live_in
));
3211 tag_set
= isl_union_map_domain(external
);
3212 external
= wrapped_reference_to_access(tag_set
, tagged
);
3213 external
= isl_union_map_union(external
,
3214 isl_union_map_copy(gen
->prog
->scop
->live_out
));
3218 external
= isl_union_map_free(external
);
3220 external
= isl_union_map_universe(external
);
3222 access
= isl_union_map_intersect(access
, external
);
3227 /* Given the AST context schedule "schedule" and the mapping from
3228 * domains to the shared tile loops "shared_sched", add a schedule
3229 * for copying an array reference group to/from shared/private memory.
3230 * "read" is set if data should be copied from global memory
3231 * to shared/private memory.
3232 * "k" represents the current group
3233 * "s" is the total number of groups
3235 * We schedule an operation before or after the innermost loop
3236 * of "shared_sched" that affects the tile of the array reference group.
3238 * schedule is of the form
3242 * (with D the iteration domains and L the already generated loops),
3243 * while shared_sched is of the form
3247 * We first compute the access relation for the reference group
3251 * and remove from this access relation those reads or writes
3252 * that only needed to communicate data within the same iteration
3253 * of the last_shared dimension of the group.
3254 * We then combine what is left with shared_sched into
3258 * If this results in an empty relation, no copying needs to be performed
3260 * Otherwise, we invert the relation and combine it with "schedule" into
3264 * The actual additional piece of the schedule is obtained from combining
3270 * [s_0,...] -> [0,s_{tile_first},0,..., val, 0, 0, ... 0]
3272 * The position of "val" corresponds to the innermost loop that affects
3273 * the tile and the value indicates where the copying is scheduled
3274 * with respect to the actual kernel code (at value 0).
3275 * Reads are schedule before the code, writes to global memory from
3276 * private memory are scheduled at values 1 to s, writes to global
3277 * memory from shared memory are scheduled at values s + 2 to 2 * s + 1.
3279 * If we are scheduling a read from global memory to shared memory,
3280 * we insert a synchronization before the kernel code (at the innermost
3282 * If we are scheduling a write to global memory, then we add
3283 * a synchronization after all writes (at value 2 *s + 2).
3284 * However, there is no need for a synchronization after the outermost loop.
3285 * A write to global memory from private memory at the innermost level
3286 * does not require a synchronization, because it is covered by
3287 * the synchronization after the kernel inserted by body_schedule.
3289 static __isl_give isl_union_map
*add_group_schedule(struct gpu_gen
*gen
,
3290 __isl_take isl_union_map
*res
, __isl_keep isl_union_map
*schedule
,
3291 __isl_keep isl_union_map
*shared_sched
,
3292 struct gpu_array_ref_group
*group
, int read
, int k
, int s
)
3297 isl_union_map
*access
;
3298 isl_map
*map
, *proj
, *access_map
;
3301 access
= gpu_array_ref_group_access_relation(group
, read
, !read
);
3302 access
= remove_local_accesses(gen
, group
, access
, read
);
3303 access
= isl_union_map_range_product(isl_union_map_copy(shared_sched
),
3306 if (isl_union_map_is_empty(access
)) {
3307 isl_union_map_free(access
);
3311 access
= isl_union_map_reverse(access
);
3312 access
= isl_union_map_apply_range(access
,
3313 isl_union_map_copy(schedule
));
3314 access_map
= isl_map_from_union_map(access
);
3316 space
= isl_space_copy(group
->array
->space
);
3317 space
= isl_space_from_range(space
);
3318 space
= isl_space_add_dims(space
, isl_dim_in
, gen
->shared_len
);
3319 map
= isl_map_domain_map(isl_map_universe(space
));
3321 space
= isl_union_map_get_space(schedule
);
3322 pos
= group
->last_shared
+ 1 - gen
->tile_first
;
3326 else if (group
->private_tile
)
3329 val
= 1 + s
+ 1 + k
;
3330 proj
= insert_even(gen
, space
, pos
, val
);
3331 map
= isl_map_apply_range(map
, proj
);
3333 access_map
= isl_map_range_product(access_map
, map
);
3335 id
= isl_id_alloc(gen
->ctx
, read
? "read" : "write", group
);
3336 access_map
= isl_map_set_tuple_id(access_map
, isl_dim_in
, id
);
3338 res
= isl_union_map_add_map(res
, access_map
);
3340 n
= gen
->shared_len
- gen
->tile_first
;
3342 if (!group
->private_tile
)
3343 res
= add_sync_schedule(gen
, res
, schedule
,
3344 shared_sched
, n
, -1);
3348 if (pos
== n
&& group
->private_tile
)
3350 res
= add_sync_schedule(gen
, res
, schedule
, shared_sched
,
3357 /* Return a schedule for the shared tile loops based on the current
3358 * AST context schedule.
3360 * We create a "shared_sched" that maps the domains to the first
3361 * shared_len dimensions of the computed schedule, project out the
3362 * first tile_first dimensions (as these are already covered by
3363 * the host code) and insert "statement-level" dimensions at even
3364 * positions so that we can schedule copy blocks and synchronization
3365 * before/after each level.
3367 * In particular, copy blocks are inserted inside the innermost
3368 * level that affect the tile. For the copying to global memory,
3369 * those from private memory are scheduled before those from shared
3370 * memory such that synchronization can be inserted between the two
3371 * at the innermost level.
3372 * Synchronization is inserted at the innermost level before the
3373 * actual kernel code if there is any copying from global memory
3374 * to shared memory. It is inserted unconditionally at the innermost
3375 * level after the actual kernel code and the copying to global memory
3376 * from private memory (if any). Finally, it is inserted after
3377 * any copying to global memory, except at the outermost level
3378 * and at the innermost level if there is no copying from shared
3379 * memory. The copying from private memory is covered by the unconditional
3380 * synchronization at the innermost level.
3382 static __isl_give isl_union_map
*body_schedule(struct gpu_gen
*gen
,
3383 __isl_take isl_union_map
*schedule
)
3387 isl_union_map
*shared_sched
;
3388 isl_union_map
*sched
;
3389 isl_map
*proj
, *map
;
3392 shared_sched
= isl_union_map_copy(gen
->tiled_sched
);
3393 proj
= projection(isl_union_map_get_space(shared_sched
),
3394 gen
->tiled_len
, gen
->shared_len
);
3395 shared_sched
= isl_union_map_apply_range(shared_sched
,
3396 isl_union_map_from_map(proj
));
3397 space
= isl_union_map_get_space(shared_sched
);
3398 proj
= insert_even(gen
, space
, -1, 0);
3399 sched
= isl_union_map_apply_range(isl_union_map_copy(shared_sched
),
3400 isl_union_map_from_map(proj
));
3402 res
= isl_union_map_range_product(isl_union_map_copy(schedule
), sched
);
3405 for (i
= 0; i
< gen
->kernel
->n_array
; ++i
)
3406 s
+= gen
->kernel
->array
[i
].n_group
;
3409 for (i
= 0; i
< gen
->kernel
->n_array
; ++i
) {
3410 struct gpu_local_array_info
*array
= &gen
->kernel
->array
[i
];
3412 for (j
= 0; j
< array
->n_group
; ++j
) {
3413 struct gpu_array_ref_group
*group
;
3415 group
= array
->groups
[j
];
3416 if (!group
->private_tile
&& !group
->shared_tile
)
3418 res
= add_group_schedule(gen
, res
, schedule
,
3419 shared_sched
, group
, 0, k
, s
);
3420 res
= add_group_schedule(gen
, res
, schedule
,
3421 shared_sched
, group
, 1, k
, s
);
3426 res
= add_sync_schedule(gen
, res
, schedule
, shared_sched
,
3427 gen
->shared_len
- gen
->tile_first
, 1 + s
);
3429 isl_union_map_free(shared_sched
);
3430 isl_union_map_free(schedule
);
3435 /* Generate code for "kernel" in the given "context".
3437 * We first generate code for the shared tile loops (T1T, T1P and T2)
3438 * in a context that includes the block ids.
3439 * Within each iteration of these loops an additional code generation
3440 * is performed (within create_kernel_leaf) for the rest of the schedule
3441 * in a context that includes the thread ids.
3443 static __isl_give isl_ast_node
*generate_kernel(struct gpu_gen
*gen
,
3444 __isl_keep isl_ast_build
*build
, __isl_keep isl_set
*host_domain
,
3445 __isl_keep isl_multi_pw_aff
*grid_size
)
3449 isl_id_list
*iterators
;
3450 isl_union_map
*schedule
;
3454 schedule
= isl_ast_build_get_schedule(build
);
3456 build
= isl_ast_build_copy(build
);
3457 build
= isl_ast_build_restrict(build
, isl_set_copy(host_domain
));
3458 space
= isl_ast_build_get_schedule_space(build
);
3459 set
= isl_set_universe(isl_space_copy(space
));
3460 set
= add_bounded_parameters_dynamic(set
, grid_size
,
3461 gen
->kernel
->block_ids
);
3462 build
= isl_ast_build_restrict(build
, set
);
3464 schedule
= body_schedule(gen
, schedule
);
3466 sched_len
= 2 * (gen
->shared_len
- gen
->tile_first
) + 1;
3468 build
= set_atomic_and_unroll(build
, space
, sched_len
);
3469 iterators
= ppcg_scop_generate_names(gen
->prog
->scop
, sched_len
, "g");
3470 build
= isl_ast_build_set_iterators(build
, iterators
);
3471 build
= isl_ast_build_set_create_leaf(build
, &create_kernel_leaf
, gen
);
3472 tree
= isl_ast_build_node_from_schedule_map(build
, schedule
);
3473 isl_ast_build_free(build
);
3478 /* Attach "id" to the given node.
3480 static __isl_give isl_ast_node
*attach_id(__isl_take isl_ast_node
*node
,
3481 __isl_keep isl_ast_build
*build
, void *user
)
3485 node
= isl_ast_node_set_annotation(node
, id
);
3490 /* Construct an AST node for performing a kernel launch and attach
3491 * the information about the kernel to that node.
3492 * "kernel_id" has name "kernel" and contains a pointer
3493 * to the ppcg_kernel structure.
3495 * The kernel AST has been constructed in the context of the range
3496 * of "schedule". In particular, the grid size has been computed
3497 * in the context. We therefore still need to make sure that these
3498 * constraints are expressed in the code. We do this by creating a schedule
3500 * kernel[] -> [S -> []]
3502 * where S is the schedule domain, i.e., the range of "schedule".
3503 * The AST generation will then create a single call surrounded by
3504 * all the condition in "S" that have not been expressed yet.
3506 * The kernel information is attached to this node in attach_id.
3508 static __isl_give isl_ast_node
*construct_launch(
3509 __isl_take isl_ast_build
*build
, __isl_take isl_union_map
*schedule
,
3510 __isl_take isl_id
*kernel_id
)
3513 isl_union_set
*domain
;
3518 ctx
= isl_ast_build_get_ctx(build
);
3520 domain
= isl_union_map_range(schedule
);
3521 set
= isl_set_from_union_set(domain
);
3522 map
= isl_map_from_domain(set
);
3523 map
= isl_map_from_range(isl_map_wrap(map
));
3524 map
= isl_map_set_tuple_name(map
, isl_dim_in
, "kernel");
3525 schedule
= isl_union_map_from_map(map
);
3527 build
= isl_ast_build_set_at_each_domain(build
, &attach_id
, kernel_id
);
3528 node
= isl_ast_build_node_from_schedule_map(build
, schedule
);
3529 isl_ast_build_free(build
);
3534 /* This function is called for each leaf in the AST of the host code.
3535 * We first specialize the schedule to the site of the leaf, compute
3536 * the size of shared memory and then construct the body of the host code
3537 * and the associated kernel.
3539 * The necessary information for printing the kernel launch is
3540 * stored in the struct ppcg_kernel that was created in create_kernel and
3541 * attached to an outer mark node in the schedule tree.
3542 * Note that this assumes that a kernel is only launched once.
3543 * The kernel pointer itself is stored in gen->kernel by before_mark,
3544 * while the isl_id containing this pointer is stored in gen->kernel_mark.
3545 * The latter is attached to the leaf AST node created to represent the launch.
3547 static __isl_give isl_ast_node
*create_host_leaf(
3548 __isl_take isl_ast_build
*build
, void *user
)
3550 struct gpu_gen
*gen
= (struct gpu_gen
*) user
;
3553 struct ppcg_kernel
*kernel
;
3554 isl_set
*host_domain
;
3555 isl_union_map
*schedule
;
3556 isl_union_map
*local_sched
;
3557 isl_union_set
*domain
;
3560 schedule
= isl_ast_build_get_schedule(build
);
3562 kernel
= gen
->kernel
;
3566 domain
= isl_union_map_domain(isl_union_map_copy(schedule
));
3568 local_sched
= isl_union_map_copy(gen
->sched
);
3569 local_sched
= isl_union_map_intersect_domain(local_sched
, domain
);
3571 kernel
->block_ids
= ppcg_scop_generate_names(gen
->prog
->scop
,
3572 kernel
->n_grid
, "b");
3573 kernel
->thread_ids
= ppcg_scop_generate_names(gen
->prog
->scop
,
3574 kernel
->n_block
, "t");
3576 gen
->tiled_sched
= tile_schedule(gen
, local_sched
);
3577 gen
->tiled_sched
= parametrize_tiled_schedule(gen
, gen
->tiled_sched
);
3578 gen
->tiled_sched
= scale_tile_loops(gen
, gen
->tiled_sched
);
3580 gen
->local_sched
= isl_union_map_copy(gen
->tiled_sched
);
3581 gen
->local_sched
= thread_tile_schedule(gen
, gen
->local_sched
);
3582 gen
->local_sched
= scale_thread_tile_loops(gen
, gen
->local_sched
);
3584 kernel
->grid_size
= extract_grid_size(gen
, kernel
);
3585 extract_block_size(gen
, kernel
);
3586 kernel
->space
= isl_ast_build_get_schedule_space(build
);
3588 compute_shared_sched(gen
);
3589 gen
->privatization
= compute_privatization(gen
);
3590 if (gpu_group_references(gen
) < 0)
3591 schedule
= isl_union_map_free(schedule
);
3592 host_domain
= isl_set_from_union_set(isl_union_map_range(
3593 isl_union_map_copy(schedule
)));
3594 localize_bounds(gen
, kernel
, host_domain
);
3596 gen
->local_sched
= interchange_for_unroll(gen
, gen
->local_sched
);
3597 check_shared_memory_bound(gen
);
3598 compute_group_tilings(gen
);
3600 kernel
->tree
= generate_kernel(gen
, build
, host_domain
,
3602 create_kernel_vars(gen
, kernel
);
3604 isl_map_free(gen
->privatization
);
3605 isl_union_map_free(gen
->local_sched
);
3606 isl_union_map_free(gen
->tiled_sched
);
3607 isl_union_map_free(gen
->shared_sched
);
3608 isl_union_map_free(gen
->shared_proj
);
3609 isl_set_free(host_domain
);
3611 node
= construct_launch(build
, schedule
, isl_id_copy(gen
->kernel_mark
));
3615 isl_union_map_free(schedule
);
3619 /* This function is called before the AST generator starts traversing
3620 * the schedule subtree of a node with mark "mark".
3622 * If the mark is called "kernel", store the mark itself in gen->kernel_mark
3623 * and the kernel pointer in gen->kernel for use in create_host_leaf.
3625 static int before_mark(__isl_keep isl_id
*mark
,
3626 __isl_keep isl_ast_build
*build
, void *user
)
3628 struct gpu_gen
*gen
= user
;
3632 if (!strcmp(isl_id_get_name(mark
), "kernel")) {
3633 gen
->kernel_mark
= isl_id_copy(mark
);
3634 gen
->kernel
= isl_id_get_user(mark
);
3639 /* This function is called after the AST generator has finished traversing
3640 * the schedule subtree of a mark node. "node" points to the corresponding
3643 * If the mark is called "kernel", then clear kernel and gen->kernel_mark.
3645 static __isl_give isl_ast_node
*after_mark(__isl_take isl_ast_node
*node
,
3646 __isl_keep isl_ast_build
*build
, void *user
)
3648 struct gpu_gen
*gen
= user
;
3651 id
= isl_ast_node_mark_get_id(node
);
3653 return isl_ast_node_free(node
);
3654 if (!strcmp(isl_id_get_name(id
), "kernel") && gen
->kernel
) {
3655 gen
->kernel_mark
= isl_id_free(gen
->kernel_mark
);
3663 /* Use isl to generate host code from gen->host_schedule, which corresponds to
3664 * the outer gen->tile_first loops of the global schedule in gen->sched.
3665 * Within each iteration of this partial schedule, i.e., for each kernel
3666 * launch, create_host_leaf takes care of generating the kernel code.
3667 * The ppcg_kernel objects are stored in mark nodes in the schedule
3668 * tree and are extracted in before_mark.
3670 static __isl_give isl_ast_node
*generate_host_code(struct gpu_gen
*gen
)
3672 isl_ast_build
*build
;
3674 isl_schedule
*schedule
;
3675 isl_id_list
*iterators
;
3677 isl_options_set_ast_build_group_coscheduled(gen
->ctx
, 1);
3678 build
= isl_ast_build_from_context(isl_set_copy(gen
->prog
->context
));
3679 iterators
= ppcg_scop_generate_names(gen
->prog
->scop
,
3680 gen
->tile_first
, "h");
3681 build
= isl_ast_build_set_iterators(build
, iterators
);
3682 build
= isl_ast_build_set_create_leaf(build
, &create_host_leaf
, gen
);
3683 build
= isl_ast_build_set_before_each_mark(build
, &before_mark
, gen
);
3684 build
= isl_ast_build_set_after_each_mark(build
, &after_mark
, gen
);
3685 schedule
= isl_schedule_copy(gen
->host_schedule
);
3686 tree
= isl_ast_build_node_from_schedule(build
, schedule
);
3687 isl_ast_build_free(build
);
3692 __isl_give isl_union_map
*extract_sizes_from_str(isl_ctx
*ctx
, const char *str
)
3696 return isl_union_map_read_from_str(ctx
, str
);
3699 /* Information about the outermost tilable bands in the forest of bands.
3701 * prefix is the (padded) schedule leading up to the outermost tilable bands.
3703 * tile_first is the number of schedule dimensions in prefix.
3705 * suffix is the schedule of the outermost tilable bands and their descendants.
3708 struct gpu_gen
*gen
;
3710 isl_union_map
*prefix
;
3711 isl_union_map
*suffix
;
3714 /* Construct an isl_multi_val for use as tile sizes for tiling "node"
3715 * from the elements in "tile_size".
3717 static __isl_give isl_multi_val
*construct_band_tiles_sizes(
3718 __isl_keep isl_schedule_node
*node
, int *tile_size
)
3728 ctx
= isl_schedule_node_get_ctx(node
);
3729 space
= isl_schedule_node_band_get_space(node
);
3730 n
= isl_schedule_node_band_n_member(node
);
3731 mv
= isl_multi_val_zero(space
);
3732 for (i
= 0; i
< n
; ++i
) {
3735 v
= isl_val_int_from_si(ctx
, tile_size
[i
]);
3736 mv
= isl_multi_val_set_val(mv
, i
, v
);
3742 /* Tile "band" with tile size specified by "sizes".
3744 * Since the tile loops will be mapped to block ids, we forcibly
3745 * turn off tile loop scaling. We may want to enable tile loop scaling
3746 * at some later point, but then we would have to support the detection
3747 * of strides during the mapping to block ids.
3748 * Similarly, since the point loops will be mapped to thread ids,
3749 * we forcibly shift the point loops so that they start at zero.
3751 static __isl_give isl_schedule_node
*tile_band(
3752 __isl_take isl_schedule_node
*node
, __isl_take isl_multi_val
*sizes
)
3754 isl_ctx
*ctx
= isl_schedule_node_get_ctx(node
);
3758 scale_tile
= isl_options_get_tile_scale_tile_loops(ctx
);
3759 isl_options_set_tile_scale_tile_loops(ctx
, 0);
3760 shift_point
= isl_options_get_tile_shift_point_loops(ctx
);
3761 isl_options_set_tile_shift_point_loops(ctx
, 1);
3763 node
= isl_schedule_node_band_tile(node
, sizes
);
3765 isl_options_set_tile_scale_tile_loops(ctx
, scale_tile
);
3766 isl_options_set_tile_shift_point_loops(ctx
, shift_point
);
3771 /* Extract the set of parameter values and outer schedule dimensions
3772 * for which any statement instance
3773 * in the kernel inserted at "node" needs to be executed.
3774 * Intersect the set of parameter values derived from the host schedule
3775 * relation with the context of "prog".
3777 static __isl_give isl_set
*extract_context(__isl_keep isl_schedule_node
*node
,
3778 struct gpu_prog
*prog
)
3780 isl_union_map
*schedule
;
3781 isl_union_set
*schedule_domain
;
3785 schedule
= isl_schedule_node_get_prefix_schedule_relation(node
);
3786 schedule_domain
= isl_union_map_range(schedule
);
3787 empty
= isl_union_set_is_empty(schedule_domain
);
3789 isl_union_set_free(schedule_domain
);
3796 space
= isl_union_set_get_space(schedule_domain
);
3797 isl_union_set_free(schedule_domain
);
3798 space
= isl_space_set_from_params(space
);
3799 depth
= isl_schedule_node_get_schedule_depth(node
);
3800 space
= isl_space_add_dims(space
, isl_dim_set
, depth
);
3801 context
= isl_set_empty(space
);
3803 context
= isl_set_from_union_set(schedule_domain
);
3805 context
= isl_set_intersect_params(context
,
3806 isl_set_copy(prog
->context
));
3811 /* Return the set of outer array elements accessed by
3812 * by the statement instance in "domain" in "prog".
3814 static __isl_give isl_union_set
*accessed_by_domain(
3815 __isl_take isl_union_set
*domain
, struct gpu_prog
*prog
)
3817 isl_union_map
*access
;
3818 isl_union_set
*arrays
;
3820 access
= isl_union_map_union(isl_union_map_copy(prog
->read
),
3821 isl_union_map_copy(prog
->may_write
));
3822 access
= isl_union_map_intersect_domain(access
, domain
);
3823 arrays
= isl_union_map_range(access
);
3824 arrays
= isl_union_set_apply(arrays
,
3825 isl_union_map_copy(prog
->to_outer
));
3830 /* Return the number of outer band members of the band node "node"
3831 * that are marked coincident.
3833 static int n_outer_coincidence(__isl_keep isl_schedule_node
*node
)
3837 n
= isl_schedule_node_band_n_member(node
);
3839 for (i
= 0; i
< n
; ++i
)
3840 if (!isl_schedule_node_band_member_get_coincident(node
, i
))
3846 /* Mark all dimensions in the current band node atomic.
3848 static __isl_give isl_schedule_node
*atomic(__isl_take isl_schedule_node
*node
)
3852 n
= isl_schedule_node_band_n_member(node
);
3853 for (i
= 0; i
< n
; ++i
)
3854 node
= isl_schedule_node_band_member_set_ast_loop_type(node
, i
,
3855 isl_ast_loop_atomic
);
3860 /* Mark "node" atomic, if it is a band node.
3861 * Do the same for all ancestors.
3862 * Return a pointer to "node" (in the updated schedule tree).
3864 static __isl_give isl_schedule_node
*atomic_ancestors(
3865 __isl_take isl_schedule_node
*node
)
3871 if (!isl_schedule_node_has_parent(node
))
3874 pos
= isl_schedule_node_get_child_position(node
);
3875 node
= isl_schedule_node_parent(node
);
3876 if (isl_schedule_node_get_type(node
) == isl_schedule_node_band
)
3877 node
= atomic(node
);
3878 node
= atomic_ancestors(node
);
3879 node
= isl_schedule_node_child(node
, pos
);
3884 /* Group the domain elements into a single space, named kernelX,
3885 * with X the kernel sequence number "kernel_id".
3887 static __isl_give isl_schedule_node
*group_statements(
3888 __isl_take isl_schedule_node
*node
, int kernel_id
)
3896 snprintf(buffer
, sizeof(buffer
), "kernel%d", kernel_id
);
3897 id
= isl_id_alloc(isl_schedule_node_get_ctx(node
), buffer
, NULL
);
3898 return isl_schedule_node_group(node
, id
);
3901 /* Create a ppcg_kernel representing the domain instances that reach "node"
3902 * and replace the subtree at "node" by a mark node pointing
3903 * to the ppcg_kernel.
3904 * The band that "node" points to is the band that needs to be mapped
3905 * to block identifiers. The band that needs to be mapped to thread
3906 * identifiers should be marked by a "thread" mark by the caller.
3907 * If "scale" is set, then the band that "node" points to is scaled
3910 * Mark all outer band nodes as atomic to ensure each kernel is only
3912 * If the domain elements that reach "node" live in more than one space,
3913 * then group the domain elements into a single space, named kernelX,
3914 * with X the kernel sequence number.
3916 * Store a pointer to the created ppcg_kernel in gen->kernel.
3918 * We keep a copy of the isl_id that points to the kernel to ensure
3919 * that the kernel does not get destroyed if the schedule node
3920 * is freed due to some error condition.
3922 static __isl_give isl_schedule_node
*create_kernel(struct gpu_gen
*gen
,
3923 __isl_take isl_schedule_node
*node
, int scale
,
3924 __isl_keep isl_multi_val
*sizes
)
3926 struct ppcg_kernel
*kernel
;
3928 isl_schedule_node
*node_thread
;
3929 isl_union_set
*domain
;
3930 int single_statement
;
3932 kernel
= isl_calloc_type(gen
->ctx
, struct ppcg_kernel
);
3933 kernel
= ppcg_kernel_create_local_arrays(kernel
, gen
->prog
);
3935 return isl_schedule_node_free(node
);
3937 domain
= isl_schedule_node_get_domain(node
);
3938 single_statement
= isl_union_set_n_set(domain
) == 1;
3940 kernel
->ctx
= gen
->ctx
;
3941 kernel
->options
= gen
->options
;
3942 kernel
->context
= extract_context(node
, gen
->prog
);
3943 kernel
->core
= isl_union_set_universe(isl_union_set_copy(domain
));
3944 kernel
->arrays
= accessed_by_domain(domain
, gen
->prog
);
3945 kernel
->tile_len
= isl_schedule_node_band_n_member(node
);
3946 kernel
->n_parallel
= n_outer_coincidence(node
);
3947 kernel
->n_grid
= kernel
->n_parallel
;
3948 node_thread
= isl_schedule_node_copy(node
);
3949 node_thread
= gpu_tree_move_down_to_thread(node_thread
, kernel
->core
);
3950 node_thread
= isl_schedule_node_child(node_thread
, 0);
3951 kernel
->n_block
= n_outer_coincidence(node_thread
);
3952 isl_schedule_node_free(node_thread
);
3953 kernel
->id
= gen
->kernel_id
++;
3954 read_grid_and_block_sizes(kernel
, gen
);
3956 gen
->kernel
= kernel
;
3958 node
= atomic_ancestors(node
);
3960 id
= isl_id_alloc(gen
->ctx
, "kernel", kernel
);
3961 id
= isl_id_set_free_user(id
, &ppcg_kernel_free_wrap
);
3962 node
= isl_schedule_node_insert_mark(node
, isl_id_copy(id
));
3964 if (!single_statement
)
3965 node
= group_statements(node
, kernel
->id
);
3967 node
= isl_schedule_node_child(node
, 0);
3969 node
= isl_schedule_node_band_scale(node
,
3970 isl_multi_val_copy(sizes
));
3972 node
= isl_schedule_node_cut(node
);
3973 node
= isl_schedule_node_parent(node
);
3975 if (!single_statement
)
3976 node
= isl_schedule_node_parent(node
);
3982 /* Insert a zero-dimensional permutable band at "node".
3984 static __isl_give isl_schedule_node
*insert_empty_permutable_band(
3985 __isl_take isl_schedule_node
*node
)
3988 isl_schedule
*schedule
;
3989 isl_union_set
*domain
;
3990 isl_multi_union_pw_aff
*mupa
;
3992 schedule
= isl_schedule_node_get_schedule(node
);
3993 domain
= isl_schedule_get_domain(schedule
);
3994 space
= isl_union_set_get_space(domain
);
3995 isl_union_set_free(domain
);
3996 isl_schedule_free(schedule
);
3998 space
= isl_space_set_from_params(space
);
3999 mupa
= isl_multi_union_pw_aff_zero(space
);
4000 node
= isl_schedule_node_insert_partial_schedule(node
, mupa
);
4001 node
= isl_schedule_node_band_set_permutable(node
, 1);
4006 /* Mark "node" as outer permutable.
4008 * If "node" originally points to a leaf, then insert a zero-dimensional
4009 * permutable band such that we can assume that "node" always
4010 * points to a band node.
4012 * Tile "node" using user specified tile sizes, after splitting the band
4013 * if the number of specified tile sizes is smaller than the dimension
4014 * of the band. Mark the point band of this tiling as the band that
4015 * needs to be mapped to threads.
4016 * Create a kernel representing the domain instances that reach "node" and
4017 * replace the band node with a mark node pointing to the kernel.
4019 static __isl_give isl_schedule_node
*mark_outer_permutable(
4020 struct gpu_gen
*gen
, __isl_take isl_schedule_node
*node
)
4022 struct ppcg_kernel
*kernel
;
4027 isl_multi_val
*sizes
;
4029 if (isl_schedule_node_get_type(node
) == isl_schedule_node_leaf
)
4030 node
= insert_empty_permutable_band(node
);
4032 tile_len
= isl_schedule_node_band_n_member(node
);
4033 tile_size
= read_tile_sizes(gen
, &tile_len
);
4035 return isl_schedule_node_free(node
);
4036 if (tile_len
< isl_schedule_node_band_n_member(node
))
4037 node
= isl_schedule_node_band_split(node
, tile_len
);
4038 sizes
= construct_band_tiles_sizes(node
, tile_size
);
4039 node
= tile_band(node
, isl_multi_val_copy(sizes
));
4040 node
= isl_schedule_node_child(node
, 0);
4041 id
= isl_id_alloc(gen
->ctx
, "thread", NULL
);
4042 node
= isl_schedule_node_insert_mark(node
, id
);
4043 node
= isl_schedule_node_parent(node
);
4045 scale
= gen
->options
->scale_tile_loops
;
4046 node
= create_kernel(gen
, node
, scale
, sizes
);
4047 isl_multi_val_free(sizes
);
4050 kernel
= gen
->kernel
;
4051 kernel
->tile_len
= tile_len
;
4052 kernel
->tile_size
= tile_size
;
4057 static __isl_give isl_schedule_node
*select_outer_band(struct gpu_gen
*gen
,
4058 __isl_take isl_schedule_node
*node
, int pos
, struct band_info
*info
);
4060 /* Check if this band node is tilable and has any parallel loops. If so,
4061 * take it as the outermost tilable band. If not, continue looking for the
4062 * outermost tilable band in the children of the current band.
4063 * Return a pointer to the same node in a tree where all outermost tilable
4064 * bands in the current subtree have been replaced by mark nodes
4065 * containing a pointer to a ppcg_kernel object.
4067 static __isl_give isl_schedule_node
*band_select_outer_band(struct gpu_gen
*gen
,
4068 __isl_take isl_schedule_node
*node
, int pos
, struct band_info
*info
)
4070 int n
= isl_schedule_node_band_n_member(node
);
4073 n_parallel
= n_outer_coincidence(node
);
4075 if (!isl_schedule_node_band_get_permutable(node
) || n_parallel
== 0) {
4076 node
= isl_schedule_node_child(node
, 0);
4077 node
= select_outer_band(gen
, node
, pos
+ n
, info
);
4078 return isl_schedule_node_parent(node
);
4081 gen
->any_parallelism
= 1;
4083 info
->tile_first
= pos
;
4084 info
->prefix
= isl_schedule_node_get_prefix_schedule_union_map(node
);
4085 info
->suffix
= isl_schedule_node_get_subtree_schedule_union_map(node
);
4087 node
= mark_outer_permutable(gen
, node
);
4092 /* Extend "umap" with coordinates with fixed value "val"
4093 * to a total length of "dst_len", assuming the original dimension is "src_len".
4095 static __isl_give isl_union_map
*extend_range(
4096 __isl_take isl_union_map
*umap
, int src_len
, int dst_len
, int val
)
4102 dim
= isl_union_map_get_space(umap
);
4103 map
= isl_map_reverse(projection(dim
, dst_len
, src_len
));
4104 for (i
= src_len
; i
< dst_len
; ++i
)
4105 map
= isl_map_fix_si(map
, isl_dim_out
, i
, val
);
4107 umap
= isl_union_map_apply_range(umap
, isl_union_map_from_map(map
));
4112 /* Select the outermost bands in the elements of the sequence or set
4113 * node "node", align their prefix schedules and combine the resulting
4114 * prefix and suffix schedules into a single pair of prefix and
4115 * suffix schedules for the entire list.
4116 * Return a pointer to the same node in a tree where all outermost tilable
4117 * bands in the current subtree have been replaced by mark nodes
4118 * containing a pointer to a ppcg_kernel object.
4120 static __isl_give isl_schedule_node
*list_select_outer_band(
4121 struct gpu_gen
*gen
, __isl_take isl_schedule_node
*node
, int pos
,
4122 struct band_info
*list_info
)
4125 int n
= isl_schedule_node_n_children(node
);
4126 isl_ctx
*ctx
= isl_schedule_node_get_ctx(node
);
4127 struct band_info
*info
;
4129 isl_union_map
*prefix
;
4130 isl_union_map
*suffix
;
4133 info
= isl_calloc_array(ctx
, struct band_info
, n
);
4137 for (i
= 0; i
< n
; ++i
) {
4138 node
= isl_schedule_node_child(node
, i
);
4139 node
= select_outer_band(gen
, node
, pos
, &info
[i
]);
4140 if (info
[i
].tile_first
> max_tile_first
)
4141 max_tile_first
= info
[i
].tile_first
;
4142 node
= isl_schedule_node_parent(node
);
4145 for (i
= 0; i
< n
; ++i
) {
4146 if (info
[i
].tile_first
== max_tile_first
)
4148 info
[i
].prefix
= extend_range(info
[i
].prefix
,
4149 info
[i
].tile_first
, max_tile_first
, 0);
4150 info
[i
].tile_first
= max_tile_first
;
4153 prefix
= info
[0].prefix
;
4154 suffix
= info
[0].suffix
;
4156 for (i
= 1; i
< n
; ++i
) {
4157 prefix
= isl_union_map_union(prefix
, info
[i
].prefix
);
4158 suffix
= isl_union_map_union(suffix
, info
[i
].suffix
);
4161 list_info
->tile_first
= info
[0].tile_first
;
4162 list_info
->prefix
= prefix
;
4163 list_info
->suffix
= suffix
;
4169 /* If we reach a leaf node, then we have not found any outer tilable
4170 * band with parallel loops, so consider the leaf node as the outermost
4172 * Return a pointer to a mark node containing a pointer
4173 * to a ppcg_kernel object inserted at the original leaf node.
4175 static __isl_give isl_schedule_node
*leaf_select_outer_band(struct gpu_gen
*gen
,
4176 __isl_take isl_schedule_node
*node
, int pos
, struct band_info
*info
)
4179 info
->tile_first
= pos
;
4180 info
->prefix
= isl_schedule_node_get_prefix_schedule_union_map(node
);
4181 info
->suffix
= isl_schedule_node_get_subtree_schedule_union_map(node
);
4183 node
= mark_outer_permutable(gen
, node
);
4188 /* Select the outermost tilable band in the subtree that "node" points to and
4189 * return a pointer to the same node in a tree where all outermost tilable
4190 * bands in the current subtree have been replaced by mark nodes
4191 * containing a pointer to a ppcg_kernel object.
4193 static __isl_give isl_schedule_node
*select_outer_band(struct gpu_gen
*gen
,
4194 __isl_take isl_schedule_node
*node
, int pos
, struct band_info
*info
)
4196 enum isl_schedule_node_type type
;
4198 type
= isl_schedule_node_get_type(node
);
4200 case isl_schedule_node_domain
:
4201 case isl_schedule_node_filter
:
4202 node
= isl_schedule_node_child(node
, 0);
4203 node
= select_outer_band(gen
, node
, pos
, info
);
4204 return isl_schedule_node_parent(node
);
4205 case isl_schedule_node_leaf
:
4206 return leaf_select_outer_band(gen
, node
, pos
, info
);
4207 case isl_schedule_node_band
:
4208 return band_select_outer_band(gen
, node
, pos
, info
);
4209 case isl_schedule_node_set
:
4210 case isl_schedule_node_sequence
:
4211 return list_select_outer_band(gen
, node
, pos
, info
);
4213 isl_die(isl_schedule_node_get_ctx(node
),
4214 isl_error_unsupported
, "unhandled schedule node type",
4216 case isl_schedule_node_error
:
4217 info
->prefix
= NULL
;
4218 info
->suffix
= NULL
;
4222 return isl_schedule_node_free(node
);
4225 /* Select the outermost tilable band that (by construction)
4226 * has at least one parallel loop.
4227 * The starting position of the aligned band is stored in the pair
4229 * The sizes and number of parallel loops may be different in different
4230 * parts of the band forest and are therefore stored in the gpu_stmts.
4232 * Return the complete schedule, with the tilable bands aligned
4233 * at gen->tile_first and padded with zero, if needed.
4234 * Store a schedule tree corresponding to the outer gen->tile_first
4235 * dimensions, with mark nodes containing pointers to ppcg_kernel objects,
4236 * in gen->host_schedule.
4238 static __isl_give isl_union_map
*select_outer_tilable_band(struct gpu_gen
*gen
,
4239 __isl_keep isl_schedule
*schedule
)
4241 isl_schedule_node
*node
;
4242 struct band_info info
;
4244 node
= isl_schedule_get_root(schedule
);
4245 node
= select_outer_band(gen
, node
, 0, &info
);
4246 gen
->host_schedule
= isl_schedule_node_get_schedule(node
);
4247 isl_schedule_node_free(node
);
4249 gen
->tile_first
= info
.tile_first
;
4250 info
.suffix
= align_range(info
.suffix
);
4252 return isl_union_map_flat_range_product(info
.prefix
, info
.suffix
);
4255 /* Set gen->untiled_len to the number of scheduling dimensions
4256 * for the schedule of the first domain.
4257 * We assume here that this number is the same for all domains.
4259 static int set_untiled_len(__isl_take isl_map
*map
, void *user
)
4261 unsigned *untiled_len
= user
;
4263 *untiled_len
= isl_map_dim(map
, isl_dim_out
);
4269 /* Compute an appropriate schedule based on the accesses in
4270 * gen->read and gen->write.
4272 * We use the dependences in gen->prog->scop to compute
4273 * a schedule that has a parallel loop in each tilable band.
4274 * Finally, we select the outermost tilable band.
4276 * If live range reordering is allowed, then we need to make sure
4277 * that live ranges on arrays are not run in parallel since doing
4278 * so would require array expansion. We therefore add the array
4279 * order dependences to the coincidence dependences. Non-zero array
4280 * order dependences will then prevent a schedule dimension from being
4281 * considered parallel.
4282 * Live ranges derived from scalars are allowed to be run in parallel
4283 * since we force the scalars to be mapped to private memory in
4284 * check_scalar_live_ranges.
4285 * If live range reordering is allowed, then the false dependences
4286 * are not added to the validity constraints as that would prevent
4287 * reordering. Instead, the external false dependences that enforce that reads
4288 * from potentially live-in data precede any later write and
4289 * that writes of potentially live-out data follow any other earlier write
4290 * are added to the validity and the coincidence constraints.
4291 * The false dependences are still added to the proximity constraints
4292 * for consistency with the case where live range reordering is not allowed.
4293 * The coincidence constraints then consist of flow dependences,
4294 * external false dependences and array order dependences.
4295 * The independences can be filtered out from the first two sets.
4296 * They have already been filtered out from the array order dependences
4297 * on a per array basis in collect_order_dependences.
4298 * There is no need for a per array handling of the other two sets
4299 * as there should be no flow or external false dependence on local
4300 * variables that can be filtered out.
4302 static void compute_schedule(struct gpu_gen
*gen
)
4304 isl_union_set
*domain
;
4305 isl_union_map
*dep_raw
, *dep
;
4306 isl_union_map
*validity
, *proximity
, *coincidence
;
4307 isl_union_map
*sched
;
4308 isl_schedule_constraints
*sc
;
4309 isl_schedule
*schedule
;
4311 domain
= isl_union_set_copy(gen
->prog
->scop
->domain
);
4312 sc
= isl_schedule_constraints_on_domain(isl_union_set_copy(domain
));
4313 sc
= isl_schedule_constraints_set_context(sc
,
4314 isl_set_copy(gen
->prog
->scop
->context
));
4315 if (gen
->options
->live_range_reordering
) {
4316 sc
= isl_schedule_constraints_set_conditional_validity(sc
,
4317 isl_union_map_copy(gen
->prog
->scop
->tagged_dep_flow
),
4318 isl_union_map_copy(gen
->prog
->scop
->tagged_dep_order
));
4319 proximity
= isl_union_map_copy(gen
->prog
->scop
->dep_flow
);
4320 validity
= isl_union_map_copy(proximity
);
4321 validity
= isl_union_map_union(validity
,
4322 isl_union_map_copy(gen
->prog
->scop
->dep_forced
));
4323 proximity
= isl_union_map_union(proximity
,
4324 isl_union_map_copy(gen
->prog
->scop
->dep_false
));
4325 coincidence
= isl_union_map_copy(validity
);
4326 coincidence
= isl_union_map_subtract(coincidence
,
4327 isl_union_map_copy(gen
->prog
->scop
->independence
));
4328 coincidence
= isl_union_map_union(coincidence
,
4329 isl_union_map_copy(gen
->prog
->array_order
));
4331 dep_raw
= isl_union_map_copy(gen
->prog
->scop
->dep_flow
);
4332 dep
= isl_union_map_copy(gen
->prog
->scop
->dep_false
);
4333 dep
= isl_union_map_union(dep
, dep_raw
);
4334 dep
= isl_union_map_coalesce(dep
);
4335 proximity
= isl_union_map_copy(dep
);
4336 coincidence
= isl_union_map_copy(dep
);
4339 sc
= isl_schedule_constraints_set_validity(sc
, validity
);
4340 sc
= isl_schedule_constraints_set_coincidence(sc
, coincidence
);
4341 sc
= isl_schedule_constraints_set_proximity(sc
, proximity
);
4343 if (gen
->options
->debug
->dump_schedule_constraints
)
4344 isl_schedule_constraints_dump(sc
);
4345 schedule
= isl_schedule_constraints_compute_schedule(sc
);
4346 if (gen
->options
->debug
->dump_schedule
)
4347 isl_schedule_dump(schedule
);
4349 sched
= select_outer_tilable_band(gen
, schedule
);
4351 isl_union_map_foreach_map(sched
, &set_untiled_len
, &gen
->untiled_len
);
4352 sched
= isl_union_map_intersect_domain(sched
, domain
);
4355 isl_schedule_free(schedule
);
4358 /* Compute the sets of outer array elements that need to be copied in and out.
4360 * In particular, for each array that is possibly written anywhere in
4361 * gen->prog and that is visible outside the corresponding scop,
4362 * we copy out its entire extent.
4364 * Any array elements that is read without first being written needs
4365 * to be copied in. Furthermore, if there are any array elements that
4366 * are copied out, but that may not be written inside gen->prog, then
4367 * they also need to be copied in to ensure that the value after execution
4368 * is the same as the value before execution, at least for those array
4369 * elements that may have their values preserved by the scop.
4370 * In case the array elements are structures, we need to take into
4371 * account that all members of the structures need to be written
4372 * by gen->prog before we can avoid copying the data structure in.
4374 * While computing the set of array elements that are copied out but
4375 * not necessarily written, we intersect both sets with the context.
4376 * This helps in those cases where the arrays are declared with a fixed size,
4377 * while the accesses are parametric and the context assigns a fixed value
4378 * to the parameters.
4380 * If an element from a local array is read without first being written,
4381 * then there is no point in copying it in since it cannot have been
4382 * written prior to the scop. Warn about the uninitialized read instead.
4384 static void compute_copy_in_and_out(struct gpu_gen
*gen
)
4387 isl_union_set
*local
;
4388 isl_union_set
*may_write
, *must_write
;
4389 isl_union_set
*copy_in
, *copy_out
;
4390 isl_union_set
*not_written
;
4391 isl_union_map
*uninitialized
;
4392 isl_union_map
*local_uninitialized
;
4394 must_write
= isl_union_map_range(
4395 isl_union_map_copy(gen
->prog
->must_write
));
4396 must_write
= isl_union_set_intersect_params(must_write
,
4397 isl_set_copy(gen
->prog
->context
));
4398 may_write
= isl_union_map_range(
4399 isl_union_map_copy(gen
->prog
->may_write
));
4400 may_write
= isl_union_set_intersect_params(may_write
,
4401 isl_set_copy(gen
->prog
->context
));
4402 may_write
= isl_union_set_universe(may_write
);
4403 may_write
= isl_union_set_apply(may_write
,
4404 isl_union_map_copy(gen
->prog
->to_outer
));
4405 copy_out
= isl_union_set_empty(isl_union_set_get_space(may_write
));
4406 local
= isl_union_set_copy(copy_out
);
4408 for (i
= 0; i
< gen
->prog
->n_array
; ++i
) {
4413 space
= isl_space_copy(gen
->prog
->array
[i
].space
);
4415 if (gen
->prog
->array
[i
].local
) {
4418 set
= isl_set_universe(space
);
4419 local
= isl_union_set_add_set(local
, set
);
4423 write_i
= isl_union_set_extract_set(may_write
, space
);
4424 empty
= isl_set_plain_is_empty(write_i
);
4425 isl_set_free(write_i
);
4429 write_i
= isl_set_copy(gen
->prog
->array
[i
].extent
);
4430 copy_out
= isl_union_set_add_set(copy_out
, write_i
);
4432 isl_union_set_free(may_write
);
4434 copy_out
= isl_union_set_intersect_params(copy_out
,
4435 isl_set_copy(gen
->prog
->context
));
4437 gen
->prog
->copy_out
= isl_union_set_copy(copy_out
);
4439 copy_out
= isl_union_set_apply(copy_out
,
4440 isl_union_map_copy(gen
->prog
->to_inner
));
4441 copy_out
= isl_union_set_intersect(copy_out
,
4442 isl_union_set_copy(gen
->prog
->may_persist
));
4443 not_written
= isl_union_set_subtract(copy_out
, must_write
);
4445 uninitialized
= isl_union_map_copy(gen
->prog
->scop
->live_in
);
4446 local_uninitialized
= isl_union_map_copy(uninitialized
);
4448 local
= isl_union_set_apply(local
,
4449 isl_union_map_copy(gen
->prog
->to_inner
));
4450 local_uninitialized
= isl_union_map_intersect_range(local_uninitialized
,
4452 if (!isl_union_map_is_empty(local_uninitialized
)) {
4454 "possibly uninitialized reads (not copied in):\n");
4455 isl_union_map_dump(local_uninitialized
);
4457 uninitialized
= isl_union_map_subtract(uninitialized
,
4458 local_uninitialized
);
4459 copy_in
= isl_union_map_range(uninitialized
);
4460 copy_in
= isl_union_set_union(copy_in
, not_written
);
4461 copy_in
= isl_union_set_apply(copy_in
,
4462 isl_union_map_copy(gen
->prog
->to_outer
));
4464 gen
->prog
->copy_in
= copy_in
;
4467 /* Internal data structure for extract_access.
4468 * "next_access" points to the end of a linked list that is extended
4469 * by extract_access.
4470 * "single_expression" is set if the access expressions belong to
4471 * an expression statement (i.e., a statement without internal control).
4472 * "any_to_outer" maps all intermediate arrays to their outer arrays.
4474 struct ppcg_extract_access_data
{
4475 struct gpu_stmt_access
**next_access
;
4476 int single_expression
;
4477 isl_union_map
*any_to_outer
;
4480 /* Given a tagged access relation to a single array "tagged", extract it
4481 * as a map, taking into account that the input may be empty.
4482 * If the access relation is empty, then it does not contain
4483 * any space information, so we try to recover it from the index
4485 * The space of the index expression is of the form I -> A,
4486 * with I the statement instances and A the array, or [I -> F] -> A,
4487 * with F the filters corresponding to arguments.
4488 * We first drop F, if present, obtaining I -> A.
4489 * Then we construct I -> R, with R the reference tag,
4490 * combine the two into I -> [R -> A] and uncurry to obtain
4491 * the final result [I -> R] -> A.
4492 * Note that the index expression may have a lower dimension
4493 * than that of the array, but this dimension is not used
4494 * if the access relation is empty.
4496 static __isl_give isl_map
*extract_single_tagged_access(
4497 __isl_take isl_union_map
*tagged
, __isl_keep pet_expr
*expr
)
4501 isl_space
*space
, *space2
;
4502 isl_multi_pw_aff
*index
;
4504 empty
= isl_union_map_is_empty(tagged
);
4508 return isl_map_from_union_map(tagged
);
4509 isl_union_map_free(tagged
);
4511 index
= pet_expr_access_get_index(expr
);
4512 space
= isl_multi_pw_aff_get_space(index
);
4513 isl_multi_pw_aff_free(index
);
4514 if (isl_space_domain_is_wrapping(space
))
4515 space
= isl_space_domain_factor_domain(space
);
4516 space2
= isl_space_copy(space
);
4517 space2
= isl_space_from_domain(isl_space_domain(space
));
4518 id
= pet_expr_access_get_ref_id(expr
);
4519 space2
= isl_space_set_tuple_id(space2
, isl_dim_out
, id
);
4520 space
= isl_space_range_product(space2
, space
);
4521 space
= isl_space_uncurry(space
);
4523 return isl_map_empty(space
);
4525 isl_union_map_free(tagged
);
4529 /* Extract a gpu_stmt_access from "expr", append it to the list
4530 * that ends in *data->next_access and update the end of the list.
4531 * If the access expression performs a write, then it is considered
4532 * exact only if it appears in a single expression statement and
4533 * if its may access relation is equal to its must access relation.
4535 * The combined set of may accesses may be union if member accesses
4536 * are involved, but the entire set is derived from a single reference and
4537 * therefore from a single index expression. These accesses therefore
4538 * all map to the same outer array.
4540 static int extract_access(__isl_keep pet_expr
*expr
, void *user
)
4542 struct ppcg_extract_access_data
*data
= user
;
4543 isl_union_map
*tagged
;
4544 struct gpu_stmt_access
*access
;
4545 isl_ctx
*ctx
= pet_expr_get_ctx(expr
);
4546 isl_multi_pw_aff
*index
;
4548 access
= isl_alloc_type(ctx
, struct gpu_stmt_access
);
4550 access
->next
= NULL
;
4551 access
->read
= pet_expr_access_is_read(expr
);
4552 access
->write
= pet_expr_access_is_write(expr
);
4553 tagged
= pet_expr_access_get_tagged_may_read(expr
);
4554 tagged
= isl_union_map_union(tagged
,
4555 pet_expr_access_get_tagged_may_write(expr
));
4556 tagged
= isl_union_map_apply_range(tagged
,
4557 isl_union_map_copy(data
->any_to_outer
));
4558 if (!access
->write
) {
4559 access
->exact_write
= 1;
4560 } else if (!data
->single_expression
) {
4561 access
->exact_write
= 0;
4563 isl_union_map
*must
, *may
;
4564 may
= isl_union_map_copy(tagged
);
4565 may
= isl_union_map_domain_factor_domain(may
);
4566 must
= pet_expr_access_get_must_write(expr
);
4567 access
->exact_write
= isl_union_map_is_equal(must
, may
);
4568 isl_union_map_free(must
);
4569 isl_union_map_free(may
);
4571 index
= pet_expr_access_get_index(expr
);
4572 access
->n_index
= isl_multi_pw_aff_dim(index
, isl_dim_out
);
4573 isl_multi_pw_aff_free(index
);
4574 access
->ref_id
= pet_expr_access_get_ref_id(expr
);
4575 access
->tagged_access
= extract_single_tagged_access(tagged
, expr
);
4576 access
->access
= isl_map_copy(access
->tagged_access
);
4577 access
->access
= isl_map_domain_factor_domain(access
->access
);
4579 *data
->next_access
= access
;
4580 data
->next_access
= &(*data
->next_access
)->next
;
4582 if (!access
->access
)
4588 /* Construct a linked list of gpu_stmt_access objects,
4589 * one for each access expression in the statement body.
4590 * "any_to_outer" maps all intermediate arrays to their outer arrays.
4592 static int pet_stmt_extract_accesses(struct gpu_stmt
*stmt
,
4593 __isl_keep isl_union_map
*any_to_outer
)
4595 struct ppcg_extract_access_data data
;
4597 stmt
->accesses
= NULL
;
4598 data
.next_access
= &stmt
->accesses
;
4599 data
.single_expression
=
4600 pet_tree_get_type(stmt
->stmt
->body
) == pet_tree_expr
;
4601 data
.any_to_outer
= any_to_outer
;
4602 return pet_tree_foreach_access_expr(stmt
->stmt
->body
,
4603 &extract_access
, &data
);
4606 /* Return an array of gpu_stmt representing the statements in "scop".
4608 static struct gpu_stmt
*extract_stmts(isl_ctx
*ctx
, struct ppcg_scop
*scop
,
4609 __isl_keep isl_set
*context
, __isl_keep isl_union_map
*any_to_outer
)
4612 struct gpu_stmt
*stmts
;
4614 stmts
= isl_calloc_array(ctx
, struct gpu_stmt
, scop
->pet
->n_stmt
);
4618 for (i
= 0; i
< scop
->pet
->n_stmt
; ++i
) {
4619 struct gpu_stmt
*s
= &stmts
[i
];
4621 s
->id
= isl_set_get_tuple_id(scop
->pet
->stmts
[i
]->domain
);
4622 s
->stmt
= scop
->pet
->stmts
[i
];
4623 if (pet_stmt_extract_accesses(s
, any_to_outer
) < 0)
4624 return free_stmts(stmts
, i
+ 1);
4630 /* Callback for ppcg_print_guarded that calls the callback for generate_gpu.
4632 static __isl_give isl_printer
*print_gpu(__isl_take isl_printer
*p
, void *user
)
4634 struct gpu_gen
*gen
= user
;
4636 return gen
->print(p
, gen
->prog
, gen
->tree
, &gen
->types
,
4640 /* Generate CUDA code for "scop" and print it to "p".
4641 * After generating an AST for the transformed scop as explained below,
4642 * we call "gen->print" to print the AST in the desired output format
4645 * If it turns out that it does not make sense to generate GPU code,
4646 * then we generate CPU code instead.
4648 * The GPU code is generated in a context where at least one
4649 * statement instance is executed. The corresponding guard (if any) is printed
4650 * around the entire generated GPU code, except for the declaration
4651 * of the arrays that are visible outside of the scop and that therefore
4652 * cannot be declared inside the body of any possible guard.
4654 * We first compute a schedule that respects the dependences
4655 * of the original program and select the outermost band
4656 * of tilable dimensions that has at least one parallel loop.
4657 * We then have three blocks of dimensions
4661 * The tilable band "B" is first tiled according to "tile" sizes, resulting
4666 * For each iteration of the T loop and for each array, we compute
4667 * the array elements accessed by that iteration, construct a rectangular
4668 * box around it and shift it to the origin. The result is used
4669 * as shared memory for the array.
4671 * We then split off at most 2 parallel loops from the T loops and
4672 * at most 3 parallel loops from the P loops
4676 * The T1/P1 loops are then tiled or "wrapped" over the blocks/threads,
4677 * according to "grid"/"block" sizes.
4679 * H T1T T1P T2 P1T P1P P2 G
4681 * Finally, the T1P and P1P iterators are equated to the block and
4682 * thread dimensions respectively and so are effectively removed.
4683 * The H loops are run on the host. The T1T, T2, P1T, P2 and G loops
4684 * are run on the GPU.
4686 * Code is generated in three stages. We first generate code for the
4687 * host (the H loops), with iterators h%d. Then, for each leaf node
4688 * of the resulting AST, we generate code for the shared loops (up to
4689 * and including T2), with iterators g%d and after equating the H loops
4690 * to h%d parameters and the T1P loops to the block dimensions.
4691 * Finally, we generate code for the remaining loops in a similar fashion.
4693 static __isl_give isl_printer
*generate(__isl_take isl_printer
*p
,
4694 struct gpu_gen
*gen
, struct ppcg_scop
*scop
,
4695 struct ppcg_options
*options
)
4697 struct gpu_prog
*prog
;
4699 isl_set
*context
, *guard
;
4702 return isl_printer_free(p
);
4704 ctx
= isl_printer_get_ctx(p
);
4705 prog
= gpu_prog_alloc(ctx
, scop
);
4707 return isl_printer_free(p
);
4709 context
= isl_set_copy(prog
->context
);
4710 guard
= isl_union_set_params(isl_union_set_copy(prog
->scop
->domain
));
4711 prog
->context
= isl_set_intersect(prog
->context
, isl_set_copy(guard
));
4714 gen
->any_parallelism
= 0;
4715 compute_schedule(gen
);
4717 if (!gen
->any_parallelism
) {
4718 isl_set_free(context
);
4719 isl_set_free(guard
);
4720 p
= print_cpu(p
, scop
, options
);
4722 compute_copy_in_and_out(gen
);
4723 gen
->tree
= generate_host_code(gen
);
4724 p
= ppcg_print_exposed_declarations(p
, prog
->scop
);
4725 p
= ppcg_print_guarded(p
, guard
, context
, &print_gpu
, gen
);
4726 isl_ast_node_free(gen
->tree
);
4729 isl_union_map_free(gen
->sched
);
4730 isl_schedule_free(gen
->host_schedule
);
4732 gpu_prog_free(prog
);
4737 /* Wrapper around generate for use as a ppcg_transform callback.
4739 static __isl_give isl_printer
*generate_wrap(__isl_take isl_printer
*p
,
4740 struct ppcg_scop
*scop
, void *user
)
4742 struct gpu_gen
*gen
= user
;
4744 return generate(p
, gen
, scop
, gen
->options
);
4747 /* Transform the code in the file called "input" by replacing
4748 * all scops by corresponding GPU code and write the results to "out".
4750 int generate_gpu(isl_ctx
*ctx
, const char *input
, FILE *out
,
4751 struct ppcg_options
*options
,
4752 __isl_give isl_printer
*(*print
)(__isl_take isl_printer
*p
,
4753 struct gpu_prog
*prog
, __isl_keep isl_ast_node
*tree
,
4754 struct gpu_types
*types
, void *user
), void *user
)
4761 gen
.sizes
= extract_sizes_from_str(ctx
, options
->sizes
);
4762 gen
.options
= options
;
4765 gen
.print_user
= user
;
4767 gen
.types
.name
= NULL
;
4769 if (options
->debug
->dump_sizes
) {
4770 isl_space
*space
= isl_space_params_alloc(ctx
, 0);
4771 gen
.used_sizes
= isl_union_map_empty(space
);
4774 r
= ppcg_transform(ctx
, input
, out
, options
, &generate_wrap
, &gen
);
4776 if (options
->debug
->dump_sizes
) {
4777 isl_union_map_dump(gen
.used_sizes
);
4778 isl_union_map_free(gen
.used_sizes
);
4781 isl_union_map_free(gen
.sizes
);
4782 for (i
= 0; i
< gen
.types
.n
; ++i
)
4783 free(gen
.types
.name
[i
]);
4784 free(gen
.types
.name
);
4789 /* Compute the set of inner array elements that may have their values
4790 * preserved by "prog". In particular, collect the array elements of
4791 * arrays that are not local to "prog" and remove those elements that
4792 * are definitely killed or definitely written by "prog".
4794 static __isl_give isl_union_set
*compute_may_persist(struct gpu_prog
*prog
)
4797 isl_union_set
*may_persist
, *killed
;
4798 isl_union_map
*must_kill
;
4800 may_persist
= isl_union_set_empty(isl_set_get_space(prog
->context
));
4801 for (i
= 0; i
< prog
->n_array
; ++i
) {
4804 if (prog
->array
[i
].local
)
4807 extent
= isl_set_copy(prog
->array
[i
].extent
);
4808 may_persist
= isl_union_set_add_set(may_persist
, extent
);
4811 may_persist
= isl_union_set_intersect_params(may_persist
,
4812 isl_set_copy(prog
->context
));
4813 may_persist
= isl_union_set_apply(may_persist
,
4814 isl_union_map_copy(prog
->to_inner
));
4815 must_kill
= isl_union_map_copy(prog
->tagged_must_kill
);
4816 killed
= isl_union_map_range(must_kill
);
4817 must_kill
= isl_union_map_copy(prog
->must_write
);
4818 killed
= isl_union_set_union(killed
, isl_union_map_range(must_kill
));
4820 may_persist
= isl_union_set_subtract(may_persist
, killed
);
4824 struct gpu_prog
*gpu_prog_alloc(isl_ctx
*ctx
, struct ppcg_scop
*scop
)
4826 struct gpu_prog
*prog
;
4833 prog
= isl_calloc_type(ctx
, struct gpu_prog
);
4838 prog
->context
= isl_set_copy(scop
->context
);
4839 prog
->n_stmts
= scop
->pet
->n_stmt
;
4840 prog
->any_to_outer
= pet_scop_compute_outer_to_any(scop
->pet
);
4841 prog
->any_to_outer
= isl_union_map_reverse(prog
->any_to_outer
);
4842 space
= isl_union_map_get_space(prog
->any_to_outer
);
4843 space
= isl_space_set_from_params(space
);
4844 space
= isl_space_add_dims(space
, isl_dim_set
, 1);
4845 space
= isl_space_map_from_set(space
);
4846 id
= isl_map_identity(space
);
4847 prog
->any_to_outer
= isl_union_map_add_map(prog
->any_to_outer
, id
);
4848 prog
->stmts
= extract_stmts(ctx
, scop
,
4849 prog
->context
, prog
->any_to_outer
);
4850 prog
->read
= isl_union_map_copy(scop
->reads
);
4851 prog
->may_write
= isl_union_map_copy(scop
->may_writes
);
4852 prog
->must_write
= isl_union_map_copy(scop
->must_writes
);
4853 prog
->tagged_must_kill
= isl_union_map_copy(scop
->tagged_must_kills
);
4854 prog
->to_inner
= pet_scop_compute_outer_to_inner(scop
->pet
);
4855 prog
->to_outer
= isl_union_map_copy(prog
->to_inner
);
4856 prog
->to_outer
= isl_union_map_reverse(prog
->to_outer
);
4859 return gpu_prog_free(prog
);
4861 if (collect_array_info(prog
) < 0)
4862 return gpu_prog_free(prog
);
4863 prog
->may_persist
= compute_may_persist(prog
);
4868 void *gpu_prog_free(struct gpu_prog
*prog
)
4872 free_array_info(prog
);
4873 free_stmts(prog
->stmts
, prog
->n_stmts
);
4874 isl_union_map_free(prog
->any_to_outer
);
4875 isl_union_map_free(prog
->to_outer
);
4876 isl_union_map_free(prog
->to_inner
);
4877 isl_union_set_free(prog
->copy_in
);
4878 isl_union_set_free(prog
->copy_out
);
4879 isl_union_map_free(prog
->read
);
4880 isl_union_map_free(prog
->may_write
);
4881 isl_union_map_free(prog
->must_write
);
4882 isl_union_map_free(prog
->tagged_must_kill
);
4883 isl_union_map_free(prog
->array_order
);
4884 isl_union_set_free(prog
->may_persist
);
4885 isl_set_free(prog
->context
);