llvm-capstone

mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2024-11-25 14:50:26 +00:00

History

Johannes Doerfert f4fa9879fb [FIX] Do not assume only one loop can be left at a time llvm-svn: 247291		2015-09-10 15:53:59 +00:00
..
autoconf	Generate gitversion.h in autoconf builds	2015-09-09 13:15:11 +00:00
cmake	Unify FOLDER property of Polly targets	2015-07-21 12:40:01 +00:00
include/polly	Allow general loops with one latch	2015-09-10 15:27:46 +00:00
lib	[FIX] Do not assume only one loop can be left at a time	2015-09-10 15:53:59 +00:00
test	[FIX] Do not assume only one loop can be left at a time	2015-09-10 15:53:59 +00:00
tools	Do not compile GPU library with sanitizers	2015-07-28 12:51:23 +00:00
utils	Make arc unit work with ninja builds	2015-08-12 09:02:20 +00:00
www	Do not use negative option name	2015-08-19 08:22:06 +00:00
.arcconfig	Adjusted arc linter config for modern version of arcanist	2015-08-12 09:01:16 +00:00
.arclint	Adjusted arc linter config for modern version of arcanist	2015-08-12 09:01:16 +00:00
.gitattributes
.gitignore	Add git patch files to .gitignore	2015-06-23 20:55:01 +00:00
CMakeLists.txt	Do not use -fvisibility option with Visual C	2015-08-07 22:16:44 +00:00
configure	Enable ISL's small integer optimization	2015-06-25 20:47:35 +00:00
CREDITS.txt	Add myself to the credits	2014-08-10 03:37:29 +00:00
LICENSE.txt
Makefile
Makefile.common.in
Makefile.config.in	Fix autotools build	2015-06-25 16:50:13 +00:00
README

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.