Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2024-12-22 07:22:54 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity
37fed66402
llvm-capstone/polly
History
Hans Wennborg 8f5b44aead Bump the trunk version to 10.0.0svn 
and clear the release notes.

llvm-svn: 366427
2019-07-18 11:51:05 +00:00
..
cmake [CMake] Fix generation of exported targets in build directory 2018-11-06 15:18:17 +00:00
docs Bump the trunk version to 10.0.0svn 2019-07-18 11:51:05 +00:00
include/polly [NFC][ScopBuilder] Move buildSchedule and its callees to ScopBuilder or ScopHelper 2019-07-17 21:42:39 +00:00
lib [NFC][ScopBuilder] Move buildSchedule and its callees to ScopBuilder or ScopHelper 2019-07-17 21:42:39 +00:00
test [test] Add wrap flags after D61934. 2019-06-17 19:17:07 +00:00
tools Fix typos throughout the license files that somehow I and my reviewers 2019-01-21 09:52:34 +00:00
unittests Update the file headers across all of the LLVM projects in the monorepo 2019-01-19 08:50:56 +00:00
utils [arc] Remove unittesting from arcconfig 2018-05-15 13:43:42 +00:00
www Adjust documentation for git migration. 2019-01-29 16:37:27 +00:00
.arcconfig [arc] Remove unittesting from arcconfig 2018-05-15 13:43:42 +00:00
.arclint [External] Move lib/JSON to lib/External/JSON. NFC. 2017-02-05 15:26:56 +00:00
.gitattributes
.gitignore Do not track the isl PDF manual in SVN 2017-01-16 11:48:03 +00:00
CMakeLists.txt [JSONExporter] Replace bundled Jsoncpp with llvm/Support/JSON.h. NFC. 2018-08-01 00:15:16 +00:00
CREDITS.txt
LICENSE.txt Fix typos throughout the license files that somehow I and my reviewers 2019-01-21 09:52:34 +00:00
README Test commit 2017-06-28 12:58:44 +00:00

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.