5 Commits

Author	SHA1	Message	Date
Tobias Grosser	f57d63f906	Do allow negative offsets in the outermost array dimension ... There is no needed for neither 1-dimensional nor higher dimensional arrays to require positive offsets in the outermost array dimension. We originally introduced this assumption with the support for delinearizing multi-dimensional arrays. llvm-svn: 214665	2014-08-03 21:07:30 +00:00
Tobias Grosser	5e6813d184	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 } llvm-svn: 212198	2014-07-02 17:47:48 +00:00
Sebastian Pop	1801668af3	delinearize memory access functions ... llvm-svn: 205799	2014-04-08 21:20:44 +00:00
Tobias Grosser	4f96749351	ScopInfo: Clarify may-write and must-write accesses ... llvm-svn: 184658	2013-06-23 05:21:18 +00:00
Tobias Grosser	6a2da6b9c8	Add test cases for multi-dimensional variable lengths arrays ... At the moment we can handle such arrays only by conservatively assuming that each access to such an array may touch any element in the array. It would be great if we could improve Polly/LLVM at some point, such that we can recover the multi-dimensionality of the accesses. llvm-svn: 163619	2012-09-11 14:03:19 +00:00