llvm-project/polly/lib/Transform
Roman Gareev 98075fe181 A new algorithm for identification of a SCoP statement that implement a matrix
multiplication

The current identification of a SCoP statement that implement a matrix
multiplication does not help to identify different permutations of loops that
contain it and check for dependencies, which can prevent it from being
optimized. It also requires external determination of the operands of
the matrix multiplication. This patch contains the implementation of a new
algorithm that helps to avoid these issues. It also modifies the test cases
that generate matrix multiplications with linearized accesses, because
the new algorithm does not support them.

Reviewed-by: Michael Kruse <llvm@meinersbur.de>,
             Tobias Grosser <tobias@grosser.es>

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

llvm-svn: 293890
2017-02-02 14:23:14 +00:00
..
Canonicalization.cpp Rerun mem2reg after the inliner 2016-12-02 17:43:57 +00:00
CodePreparation.cpp [CodePrepa] Remove unused declaration. NFC. 2017-01-27 16:59:09 +00:00
DeLICM.cpp [DeLICM] Add pass boilerplate code. 2016-11-29 16:41:21 +00:00
DeadCodeElimination.cpp Perform copying to created arrays according to the packing transformation 2016-09-14 06:26:09 +00:00
FlattenAlgo.cpp FlattenAlgo: Ensure we _really_ obtain a param space 2016-09-09 16:11:26 +00:00
FlattenSchedule.cpp Add -polly-flatten-schedule pass. 2016-09-08 15:02:36 +00:00
ScheduleOptimizer.cpp A new algorithm for identification of a SCoP statement that implement a matrix 2017-02-02 14:23:14 +00:00