Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2024-11-28 08:02:08 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity
3d2efafb36
llvm-capstone/polly
History
Tobias Grosser 3d2efafb36 www: Fix path to git repository. 
llvm-svn: 132761
2011-06-08 22:46:40 +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 Cloog: Export clast_root 2011-05-14 19:02:29 +00:00
lib ScheduleOptimizer: Declare functions static 2011-05-24 12:20:07 +00:00
test CodeGeneration: Do not delete the old version of the Scop. 2011-05-14 19:01:49 +00:00
tools Add initial version of Polly 2011-04-29 06:27:02 +00:00
utils ScheduleOptimizer: Add an isl based schedule optimizer 2011-05-14 19:02:06 +00:00
www www: Fix path to git repository. 2011-06-08 22:46:40 +00:00
CMakeLists.txt 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
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 Add initial version of Polly 2011-04-29 06:27:02 +00:00
README 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.