~pali/llvm/polly-3.5 : changes

~pali/llvm/polly-3.5 » Changes from revision 1063

From Revision 1063 to 1044

Rev	Summary	Authors	Date
1063	Revert renaming. Should rename tags instead. Revert renaming. Should rename tags instead.	void	9 years ago
1062	Renaming to coincide with updated tagging system. Renaming to coincide with updated tagging system.	void	9 years ago
1061	Creating release_35 branch Creating release_35 branch	void	9 years ago
1060	Update formatting with clang-format. Update formatting with clang-format.	void	9 years ago
1059	Update for RegionInfo changes. Update for RegionInfo changes. Mostly related to missing includes and renaming of the pass to RegionInfoPass.	arsenm	9 years ago
1058	[Refactor] Move code out of the IslAst header [Refactor] Move code out of the IslAst header Offer the static functions to extract information out of an IslAst for node as members of IslAstInfo not as top level entities. + Refactor common code + Add isParallel and isReductionParallel + Rename IslAstUser to IslAstUserPayload to make it clear this is just a (or the) payload struct.	jdoerfert	9 years ago
1057	[Refactor] Use attributes to mark function as invalid for po... [Refactor] Use attributes to mark function as invalid for polly + Test case annotated with the new attribute + Modified test case to check if subfunctions are annotated	jdoerfert	9 years ago
1056	Update to isl-0.13.0 Update to isl-0.13.0 This pulls in a couple of minor cleanups in isl. More importantly, in preparation of the upcoming LLVM releases this change brings us back on a released version of isl.	grosser	9 years ago
1055	[Format] Clang format IslAst.cpp [Format] Clang format IslAst.cpp	jdoerfert	9 years ago
1054	Annotate reduction parallel loops in the IslAst textual outp... Annotate reduction parallel loops in the IslAst textual output + Introduced dependency type TYPE_TC_RED to represent the transitive closure (& the reverse) of reduction dependences. These are used when we check for reduction parallel loops. + Test cases including loop reversals and modulo schedules which compute reductions in a alternated order.	jdoerfert	9 years ago
1053	DeadCodeElimination: Fix liveout computation DeadCodeElimination: Fix liveout computation We move back to a simple approach where the liveout is the last must-write statement for a data-location plus all may-write statements. The previous approach did not work out. We would have to consider per-data-access dependences, instead of per-statement dependences to correct it. As this adds complexity and it seems we would not gain anything over the simpler approach that we implement in this commit, I moved us back to the old approach of computing the liveout, but enhanced it to also add may-write accesses. We also fix the test case and explain why we can not perform dead code elimination in this case.	grosser	9 years ago
1052	Remove unnecessary isl annotations Remove unnecessary isl annotations They where just left over from copy-pasting. Reported-by: Johannes Doerfert <jdoerfert@codeaurora.org>	grosser	9 years ago
1051	DeadCodeElim: Compute correct liveout for non-affine accesse... DeadCodeElim: Compute correct liveout for non-affine accesses Thanks to Johannes Doerfert for narrowing down the bug. Reported-by: Chris Jenneisch <chrisj@codeaurora.org>	grosser	9 years ago
1050	clang-format polly to avoid buildbot noise clang-format polly to avoid buildbot noise	grosser	9 years ago
1049	Update for llvm api change. Update for llvm api change.	rafael	9 years ago
1048	Derive run-time conditions for delinearization Derive run-time conditions for delinearization As our delinearization works optimistically, we need in some cases run-time checks that verify our optimistic assumptions. A simple example is the following code: void foo(long n, long m, long o, double A[n][m][o]) { for (long i = 0; i < 100; i++) for (long j = 0; j < 150; j++) for (long k = 0; k < 200; k++) A[i][j][k] = 1.0; } After clang linearized the access to A and we delinearized it again to A[i][j][k] we need to ensure that we do not access the delinearized array out of bounds (this information is not available in LLVM-IR). Hence, we need to verify the following constraints at run-time: CHECK: Assumed Context: CHECK: [o, m] -> { : m >= 150 and o >= 200 }	grosser	9 years ago
1047	Use arguments of user statements to perform induction variab... Use arguments of user statements to perform induction variable substitution To translate the old induction variables as they exist before Polly to new new induction variables introduced during AST code generation we need to generate code that computes the new values from the old ones. We can do this by just looking at the arguments isl generates in each scheduled statement. Example: // Old for i S(i) // New for c0 for c1 S(c0 + c1) To get the value of i, we need to compute 'c0 + c1'. This expression is readily available in the user statements generated by isl and just needs to be translated to LLVM-IR. This replaces an old confusing construct that constructed during ast generation an isl multi affine expression that described this relation and which was then again ast generated for each statement and argument when translating the isl ast to LLVM-IR. This approach was difficult to understand and the additional ast generation calls where entirely redundant as isl provides the relevant expressions as arguments of the generated user statements.	grosser	9 years ago
1046	Introduce reduction types Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type	jdoerfert	9 years ago
1045	[FIX] Don't consider reductions which are partially outside ... [FIX] Don't consider reductions which are partially outside the SCoP + Test case	jdoerfert	9 years ago
1044	[C++11] Use more range based fors [C++11] Use more range based fors	grosser	9 years ago

Older »