llvm-project

History

Tobias Grosser 1f8b84094f Update isl bindings to latest version (+ Polly extensions)

After the isl C++ binding generator is now close to being upstreamed to isl, we
synchronize the latest changes to Polly. These are mostly formatting changes
plus a small interface change for the foreach callback function and some naming
changes in isl::boolean.

llvm-svn: 300398

2017-04-15 08:15:54 +00:00

cmake

[Cmake] Generate a PollyConfig.cmake.

2017-03-09 17:58:20 +00:00

docs

Porting the example illustrating Polly from HTML to reStructuredText

2017-02-10 11:46:57 +00:00

include/polly

[DeLICM] Export Known and Written to DeLICMTests. NFC.

2017-04-13 16:32:39 +00:00

lib

Update isl bindings to latest version (+ Polly extensions)

2017-04-15 08:15:54 +00:00

test

Fix missing .git/indexloadPolly in ensure-correct-tile-sizes testcase

2017-04-07 12:55:26 +00:00

tools

GPURuntime: ensure compilation with C99

2016-09-11 07:32:50 +00:00

unittests

Use isl C++ foreach implementation

2017-04-14 13:39:40 +00:00

utils

Revise polly-{update|check}-format targets

2015-09-14 16:59:50 +00:00

www

Add two Polly images

2017-04-05 11:50:31 +00:00

.arcconfig

Upgrade all the .arcconfigs to https.

2016-07-14 13:15:37 +00:00

.arclint

[External] Move lib/JSON to lib/External/JSON. NFC.

2017-02-05 15:26:56 +00:00

.gitattributes

gitattributes: .png and .txt are no text files

2013-07-28 09:05:20 +00:00

.gitignore

Do not track the isl PDF manual in SVN

2017-01-16 11:48:03 +00:00

CMakeLists.txt

[Cmake] Generate a PollyConfig.cmake.

2017-03-09 17:58:20 +00:00

CREDITS.txt

Add myself to the credits

2014-08-10 03:37:29 +00:00

LICENSE.txt

[External] Move lib/JSON to lib/External/JSON. NFC.

2017-02-05 15:26:56 +00:00

README

Trivial change to the README, mainly to test commit access.

2012-10-09 04:59:42 +00:00

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.