1fa7b972c0
This commit imports the latest isl version into lib/External/isl. The changes
relavant for Polly are:
1) Schedule trees [1] have been introduced as a more structured way to
describe schedules. Polly does not yet use them, but we may switch to them
in the near future.
2) Another set of coalescing changes [2] simplifies some data dependences and
removes a couple of code generation artifacts.
We now understand that the following sets can be merged:
{ Stmt_S1[i0, i1] -> Stmt_S2[i0 + i1] :
i0 >= 0 and i1 <= 1023 - i0 and i1 >= 1
Stmt_S1[i0, 0] -> Stmt_S2[i0] : i0 <= 1023 and i0 >= 1}
into:
{ Stmt_S1[i0, i1] -> Stmt_S2[i0 + i1] : i1 <= 1023 - i0 and i1 >= 0 and
i1 >= 1 - i0 and i0 >= 0 }
Changes of this kind reduce unnecessary specialization during code
generation.
- for (int c3 = 0; c3 <= 1023; c3 += 1) {
- if (c3 % 2 == 0) {
- Stmt_for_body3(c1, c3);
- } else
- Stmt_for_body3(c1, c3);
- }
+ for (int c3 = 0; c3 <= 1023; c3 += 1)
+ Stmt_for_body3(c1, c3);
[1] http://impact.gforge.inria.fr/impact2014/papers/impact2014-verdoolaege.pdf
[2] http://impact.gforge.inria.fr/impact2015/papers/impact2015-verdoolaege.pdf
llvm-svn: 229423
107 lines
2.1 KiB
C
107 lines
2.1 KiB
C
#include <isl/ctx.h>
|
|
#include <isl/id.h>
|
|
#include <isl/space.h>
|
|
#include <isl/local_space.h>
|
|
#include <isl/set.h>
|
|
#include <isl/map.h>
|
|
#include <isl/union_set.h>
|
|
#include <isl/union_map.h>
|
|
#include <isl/polynomial.h>
|
|
#include <isl/band.h>
|
|
#include <isl/constraint.h>
|
|
#include <isl/aff.h>
|
|
#include <isl/ast.h>
|
|
#include <isl/printer.h>
|
|
#include <isl/val.h>
|
|
|
|
#undef BASE
|
|
#define BASE id
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE val
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE multi_val
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE space
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE local_space
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE basic_set
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE basic_map
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE set
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE map
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE union_set
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE union_map
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE qpolynomial
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE qpolynomial_fold
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE pw_qpolynomial
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE pw_qpolynomial_fold
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE union_pw_qpolynomial
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE union_pw_qpolynomial_fold
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE band
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE constraint
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE pw_aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE multi_aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE pw_multi_aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE union_pw_multi_aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE multi_pw_aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE union_pw_aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE multi_union_pw_aff
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE point
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE ast_expr
|
|
#include <print_templ.c>
|
|
#undef BASE
|
|
#define BASE ast_node
|
|
#include <print_templ.c>
|