hanchenye-llvm-project

History

Tobias Grosser 28781423b2 isl scheduler: Do not fail when returning an empty band list The bug was within isl. To fix it, we simply update the isl version that is used by Polly. We still have some changes within Polly to be able to write a proper test case. Reported-by: Sameer Sahasrabuddhe <Sameer.Sahasrabuddhe@amd.com> llvm-svn: 166021		2012-10-16 07:29:19 +00:00
..
autoconf	Detect the isl code generation feature correctly	2012-10-02 19:50:22 +00:00
cmake	Detect the isl code generation feature correctly	2012-10-02 19:50:22 +00:00
docs	…
include	isl-codegen: Support '<' and '>'	2012-10-16 07:29:13 +00:00
lib	isl scheduler: Do not fail when returning an empty band list	2012-10-16 07:29:19 +00:00
test	isl scheduler: Do not fail when returning an empty band list	2012-10-16 07:29:19 +00:00
tools	Update libGPURuntime to be dual licensed under MIT and UIUC license.	2012-07-06 10:40:15 +00:00
utils	isl scheduler: Do not fail when returning an empty band list	2012-10-16 07:29:19 +00:00
www	www: Clarify that GMP is LGPL licensed	2012-10-12 07:44:38 +00:00
CMakeLists.txt	Add preliminary implementation for GPGPU code generation.	2012-08-03 12:50:07 +00:00
CREDITS.txt	(Test commit for polly)	2011-07-16 13:30:03 +00:00
LICENSE.txt	Happy new year 2012!	2012-01-01 08:16:56 +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	…
Makefile.config.in	Add support for libpluto as the scheduling optimizer.	2012-08-02 07:47:26 +00:00
README	Trivial change to the README, mainly to test commit access.	2012-10-09 04:59:42 +00:00
configure	Detect the isl code generation feature correctly	2012-10-02 19:50:22 +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.