maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly
History
Tobias Grosser cdea7df0fe Cloog: Include header file for pipe/open/close 
We forgot to include the unistd.h header file that defines the
functions mentioned above. This was not a problem with gnu C++ library,
however it did not work for libc++.

llvm-svn: 145790
 		2011-12-04 10:44:14 +00:00
..
autoconf configure: Add gmp_inc when checking for CLooG 2011-10-04 06:55:03 +00:00
cmake Add initial version of Polly 2011-04-29 06:27:02 +00:00
docs Add initial version of Polly 2011-04-29 06:27:02 +00:00
include JScop: Allow to update the context 2011-11-15 11:38:44 +00:00
lib Cloog: Include header file for pipe/open/close 2011-12-04 10:44:14 +00:00
test test: Switch to new atomic instructions 2011-11-29 14:51:05 +00:00
tools Add initial version of Polly 2011-04-29 06:27:02 +00:00
utils Add utils/jscop2cloog.py 2011-11-29 14:50:52 +00:00
www www: Document how to run 'make polly-test' for autoconf build 2011-11-22 19:40:34 +00:00
CMakeLists.txt Buildsystem: Add -no-rtti 2011-06-30 19:50:04 +00:00
CREDITS.txt (Test commit for polly) 2011-07-16 13:30:03 +00:00
LICENSE.txt Add initial version of Polly 2011-04-29 06:27:02 +00:00
Makefile Add initial version of Polly 2011-04-29 06:27:02 +00:00
Makefile.common.in Add initial version of Polly 2011-04-29 06:27:02 +00:00
Makefile.config.in Buildsystem: Add -no-rtti 2011-06-30 19:50:04 +00:00
README Remove some empty lines 2011-10-04 06:56:36 +00:00
configure configure: Add gmp_inc when checking for CLooG 2011-10-04 06:55:03 +00:00

README 

Polly - Polyhedral optimizations for LLVM

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.