hanchenye-llvm-project/polly
Siddharth Bhat 726c28f8c4 [CodeGen] Track trip counts per-scop for performance measurement.
- Add a counter that is incremented once on exit from a scop.

- Test cases got split into two: one to test the cycles, and another one
to test trip counts.

- Sample output:
```name=sample-output.txt
scop function, entry block name, exit block name, total time, trip count
warmup, %entry.split, %polly.merge_new_and_old, 5180, 1
f, %entry.split, %polly.merge_new_and_old, 409944, 500
g, %entry.split, %polly.merge_new_and_old, 1226, 1
```

Differential Revision: https://reviews.llvm.org/D33822

llvm-svn: 304543
2017-06-02 11:36:52 +00:00
..
cmake [Polly][CMake] Fix variable name in target exports 2017-05-12 10:39:38 +00:00
docs Update information on isl C++ bindings in Polly release notes 2017-05-27 11:01:01 +00:00
include/polly [CodeGen] Track trip counts per-scop for performance measurement. 2017-06-02 11:36:52 +00:00
lib [CodeGen] Track trip counts per-scop for performance measurement. 2017-06-02 11:36:52 +00:00
test [CodeGen] Track trip counts per-scop for performance measurement. 2017-06-02 11:36:52 +00:00
tools [GPUJIT] Disabled gcc's -Wpedantic for use of dlsym 2017-05-10 11:51:44 +00:00
unittests [Polly][NewPM] Reenable ScopPassManager unittest 2017-05-23 11:28:50 +00:00
utils
www Add a permanent Polly Hangouts URL 2017-05-24 06:46:11 +00:00
.arcconfig Upgrade all the .arcconfigs to https. 2016-07-14 13:15:37 +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 [Polly][CMake] Exclude isl_config from the polly-check-format target. 2017-05-15 13:20:26 +00:00
CREDITS.txt
LICENSE.txt [External] Move lib/JSON to lib/External/JSON. NFC. 2017-02-05 15:26:56 +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.