clang-p2996

Files

Johannes Doerfert 066dbf3f8e Track assumptions and restrictions separatly

In order to speed up compile time and to avoid random timeouts we now
  separately track assumptions and restrictions. In this context
  assumptions describe parameter valuations we need and restrictions
  describe parameter valuations we do not allow. During AST generation
  we create a runtime check for both, whereas the one for the
  restrictions is negated before a conjunction is build.

  Except the In-Bounds assumptions we currently only track restrictions.

Differential Revision: http://reviews.llvm.org/D17247

llvm-svn: 262328

2016-03-01 13:06:28 +00:00

cmake

Compile ISL into its own library

2015-09-24 11:30:22 +00:00

docs

Support accesses with differently sized types to the same array

2016-02-04 13:18:42 +00:00

include/polly

Track assumptions and restrictions separatly

2016-03-01 13:06:28 +00:00

lib

Track assumptions and restrictions separatly

2016-03-01 13:06:28 +00:00

test

Track assumptions and restrictions separatly

2016-03-01 13:06:28 +00:00

tools

Remove autotools build system

2016-01-28 12:00:33 +00:00

utils

Revise polly-{update|check}-format targets

2015-09-14 16:59:50 +00:00

www

www: Fix typo

2016-02-25 15:21:02 +00:00

.arcconfig

Adjusted arc linter config for modern version of arcanist

2015-08-12 09:01:16 +00:00

.arclint

Adjusted arc linter config for modern version of arcanist

2015-08-12 09:01:16 +00:00

.gitattributes

…

.gitignore

Add git patch files to .gitignore

2015-06-23 20:55:01 +00:00

CMakeLists.txt

Add basic doxygen infrastructure for Polly

2016-02-04 07:16:36 +00:00

CREDITS.txt

…

LICENSE.txt

…

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.