Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2024-12-16 04:20:59 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
ea927baee2
llvm-capstone/polly
History
Michael Kruse a9035a8fec polly-update-format after change in clang-format. NFC. 
r313963 changed the sorting of using-declarations.

llvm-svn: 313976
2017-09-22 11:30:26 +00:00
..
cmake [CMake] FindJsoncpp.cmake: Use descriptive variable name for libjsoncpp.so path. 2017-07-18 10:10:02 +00:00
docs Tiny docs fix 2017-07-27 18:14:00 +00:00
include/polly polly-update-format after change in clang-format. NFC. 2017-09-22 11:30:26 +00:00
lib [DeLICM] Allow non-injective PHIRead->PHIWrite mapping. 2017-09-21 19:08:23 +00:00
test [DeLICM] Allow non-injective PHIRead->PHIWrite mapping. 2017-09-21 19:08:23 +00:00
tools [GPUJIT] Improved temporary file handling. 2017-09-19 10:41:29 +00:00
unittests [test] Add some test cases for computeArrayUnused. 2017-08-21 23:04:55 +00:00
utils
www [WWW] Add a section to Getting Started about building out-of-tree 2017-07-11 20:37:28 +00:00
.arcconfig
.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 [Polly][CMake] Skip unit-tests in lit if gtest is not available 2017-07-11 11:37:35 +00:00
CREDITS.txt
LICENSE.txt [External] Move lib/JSON to lib/External/JSON. NFC. 2017-02-05 15:26:56 +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.