Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2025-01-01 13:20:25 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity
1aabf2777b
llvm-capstone/polly
History
Tobias Grosser 1aabf2777b www: Use german 'umlaut' in Simbuerger 
llvm-svn: 131247
2011-05-12 21:36:27 +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 ScopDetection: Move implementation of function from header to .cpp file 2011-05-12 21:33:28 +00:00
lib ScopDetection: Move implementation of function from header to .cpp file 2011-05-12 21:33:28 +00:00
test ScopDetection: Remember the functions generated by backend in a pointer set, so we 2011-05-06 02:38:20 +00:00
tools Add initial version of Polly 2011-04-29 06:27:02 +00:00
utils Add a converter from jscop to iscc input 2011-04-29 06:29:20 +00:00
www www: Use german 'umlaut' in Simbuerger 2011-05-12 21:36:27 +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.