llvm-project

History

Tobias Grosser 75296901f7 Fix 'unused variable' warning in NASSERTS build llvm-svn: 245723		2015-08-21 19:23:21 +00:00
..
autoconf	Enable ISL's small integer optimization	2015-06-25 20:47:35 +00:00
cmake	Unify FOLDER property of Polly targets	2015-07-21 12:40:01 +00:00
include/polly	Manually check a loop form	2015-08-21 09:08:14 +00:00
lib	Fix 'unused variable' warning in NASSERTS build	2015-08-21 19:23:21 +00:00
test	Manually check a loop form	2015-08-21 09:08:14 +00:00
tools	Do not compile GPU library with sanitizers	2015-07-28 12:51:23 +00:00
utils	Make arc unit work with ninja builds	2015-08-12 09:02:20 +00:00
www	Do not use negative option name	2015-08-19 08:22:06 +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	Do not use -fvisibility option with Visual C	2015-08-07 22:16:44 +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	Revert "Fix a bug introduced by r153739: We are not able to provide the correct"	2012-04-11 07:43:13 +00:00
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	Trivial change to the README, mainly to test commit access.	2012-10-09 04:59:42 +00:00
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.