llvm-project

History

Roman Gareev 10595a1739 Call assumeNoOutOfBound only in updateDimensionality Call assumeNoOutOfBound only in updateDimensionality to process situations when new dimensions are added and new bounds checks are required. Contributed-by: Tobias Grosser, Gareev Roman llvm-svn: 257170		2016-01-08 14:01:59 +00:00
..
autoconf	Generate gitversion.h in autoconf builds	2015-09-09 13:15:11 +00:00
cmake	Compile ISL into its own library	2015-09-24 11:30:22 +00:00
include/polly	Define buildScheduleRec on RegionNodes and pull out the tree traversal [NFC]	2016-01-06 15:30:06 +00:00
lib	Call assumeNoOutOfBound only in updateDimensionality	2016-01-08 14:01:59 +00:00
test	Call assumeNoOutOfBound only in updateDimensionality	2016-01-08 14:01:59 +00:00
tools	Do not compile GPU library with sanitizers	2015-07-28 12:51:23 +00:00
utils	Revise polly-{update\|check}-format targets	2015-09-14 16:59:50 +00:00
www	TODO: Polly can handle boolean expressions (Open->Done)	2016-01-05 11:48:59 +00:00
.arcconfig	Adjusted arc linter config for modern version of arcanist	2015-08-12 09:01:16 +00:00
.arclint	Adjusted arc linter config for modern version of arcanist	2015-08-12 09:01:16 +00:00
.gitattributes	gitattributes: .png and .txt are no text files	2013-07-28 09:05:20 +00:00
.gitignore	Add git patch files to .gitignore	2015-06-23 20:55:01 +00:00
CMakeLists.txt	Add -sort-includes to our automatic source code formatting	2015-10-15 12:18:37 +00:00
CREDITS.txt	Add myself to the credits	2014-08-10 03:37:29 +00:00
LICENSE.txt	Update the copyright credits -- Happy new year 2014!	2014-01-01 08:27:31 +00:00
Makefile	…
Makefile.common.in	'chmod -x' on files that do not need the executable bits	2012-12-29 15:09:03 +00:00
Makefile.config.in	Fix autotools build	2015-06-25 16:50:13 +00:00
README	…
configure	Enable ISL's small integer optimization	2015-06-25 20:47:35 +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.