hanchenye-llvm-project/polly
Michael Kruse 1b8eb4104b Update to isl-0.17.1-314-g3106e8d
This version includes an update for imath (isl-0.17.1-49-g2f1c129). It fixes
the compilation under windows, which does not know ssize_t.

In addition, isl-0.17.1-288-g0500299 changed the way isl_test finds the source
directory. It now generates a file isl_srcdir.c at configure-time, containing
the source path, to not require setting the environment variable "srcdir" at
test-time. The cmake build system had to be modified to also generate that file.

llvm-svn: 288811
2016-12-06 14:37:39 +00:00
..
cmake Remove -fvisibility=hidden and FORCE_STATIC. 2016-09-12 18:25:00 +00:00
docs docs: Remove reference to PoCC 2016-05-17 19:44:16 +00:00
include/polly Allow to disable unsigned operations (zext, icmp ugt, ...) 2016-12-02 17:55:41 +00:00
lib Update to isl-0.17.1-314-g3106e8d 2016-12-06 14:37:39 +00:00
test [ScopInfo] Fold constant coefficients in array dimensions to the right 2016-12-02 08:10:56 +00:00
tools GPURuntime: ensure compilation with C99 2016-09-11 07:32:50 +00:00
unittests Add -polly-flatten-schedule pass. 2016-09-08 15:02:36 +00:00
utils Revise polly-{update|check}-format targets 2015-09-14 16:59:50 +00:00
www www: Add Loopy publication 2016-09-29 18:17:30 +00:00
.arcconfig Upgrade all the .arcconfigs to https. 2016-07-14 13:15:37 +00:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt Remove POLLY_LINK_LIBS, it is not used 2016-11-04 00:32:32 +00:00
CREDITS.txt
LICENSE.txt Update copyright year to 2016. 2016-03-30 22:41:38 +00:00
README

README

Polly - Polyhedral optimizations for LLVM
-----------------------------------------
http://polly.llvm.org/

Polly uses a mathematical representation, the polyhedral model, to represent and
transform loops and other control flow structures. Using an abstract
representation it is possible to reason about transformations in a more general
way and to use highly optimized linear programming libraries to figure out the
optimal loop structure. These transformations can be used to do constant
propagation through arrays, remove dead loop iterations, optimize loops for
cache locality, optimize arrays, apply advanced automatic parallelization, drive
vectorization, or they can be used to do software pipelining.