clang-p2996

Files

Philip Pfaffe d477bb9a50 [SI] Create Scop Name lazily

Summary: Creating the Scop name is expensive, because creating the
Region name it's derived from is expensive. So create the name lazily,
because getName() is actually called rarely.

This is a reiteration of r328666, which introduced a use-after-free and
got reverted in r331363.

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

llvm-svn: 332359

2018-05-15 14:53:25 +00:00

cmake

[CMake] Use only keyword-version of target_link_library. NFC.

2018-01-12 16:09:18 +00:00

docs

[doc] Overhaul doc on preparing IR for processing by Polly.

2018-04-06 19:24:18 +00:00

include/polly

[SI] Create Scop Name lazily

2018-05-15 14:53:25 +00:00

lib

[SI] Create Scop Name lazily

2018-05-15 14:53:25 +00:00

test

[SCEVAffinator] Fix handling of pwaff complexity limit.

2018-05-14 23:05:43 +00:00

tools

[GPUJIT] Improved temporary file handling.

2017-09-19 10:41:29 +00:00

unittests

Remove the last uses of isl::give and isl::take

2018-04-29 00:28:26 +00:00

utils

[arc] Remove unittesting from arcconfig

2018-05-15 13:43:42 +00:00

www

[Polly] Information about generalized matrix multiplication

2017-09-24 19:00:25 +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

…

CMakeLists.txt

[CMake] Use only keyword-version of target_link_library. NFC.

2018-01-12 16:09:18 +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.