maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly
History
Raghesh Aloor 3cb6628d7c MemAccess: Reading Change in Access Function 
This patch reads the change in access functions from
imported JSCOP file. A test case is also added.

llvm-svn: 134991
 		2011-07-12 17:14:03 +00:00
..
autoconf Add initial version of Polly 2011-04-29 06:27:02 +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 MemAccess: Reading Change in Access Function 2011-07-12 17:14:03 +00:00
lib MemAccess: Reading Change in Access Function 2011-07-12 17:14:03 +00:00
test MemAccess: Reading Change in Access Function 2011-07-12 17:14:03 +00:00
tools Add initial version of Polly 2011-04-29 06:27:02 +00:00
utils pollycc: Fix error message if PoCC/Pluto are not available 2011-07-06 18:04:59 +00:00
www www: Fix typo 2011-07-12 12:43:00 +00:00
CMakeLists.txt Buildsystem: Add -no-rtti 2011-06-30 19:50:04 +00:00
CREDITS.txt Add e-mail to credits file. 2011-04-29 07:54:20 +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 Add initial version of Polly 2011-04-29 06:27:02 +00:00
configure Add initial version of Polly 2011-04-29 06:27:02 +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.