Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2024-11-24 06:10:12 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity
f7f917a764
llvm-capstone/polly
History
Timm Bäder e1b88c8a09 [clang] Only use major version in resource dir 
This causes unnecessary churn for downstreams.

For the full discussion, see https://discourse.llvm.org/t/should-we-continue-embed-the-full-llvm-version-in-lib-clang/62094

Differential Revision: https://reviews.llvm.org/D125860
2022-11-10 15:02:03 +01:00
..
cmake [CMake] Avoid LLVM_BINARY_DIR when other more specific variable are better-suited, part 2 2022-09-14 15:48:58 -04:00
docs [Polly][docs] Avoid use of code-block:: guess. 2022-10-24 19:54:22 -05:00
include/polly [Polly] Ensure -polly-detect-keep-going still eventually rejects invalid regions. 2022-10-20 13:35:09 -05:00
lib [clang] Only use major version in resource dir 2022-11-10 15:02:03 +01:00
test [polly][test] Remove -polly-target from tests 2022-10-28 10:39:07 -07:00
tools [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
unittests [polly][unittests] Link DeLICMTests with libLLVMCore 2022-01-28 21:58:40 +01:00
utils Harmonize Python shebang 2020-07-16 21:53:45 +02:00
www [polly] Fixed a number of typos. NFC 2022-08-07 22:56:07 +08:00
.arclint
.gitattributes
.gitignore
CMakeLists.txt Move googletest to the third-party directory 2022-11-09 15:28:08 -08:00
CREDITS.txt
LICENSE.TXT Rename top-level LICENSE.txt files to LICENSE.TXT 2021-03-10 21:26:24 -08: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.