[PATCH] Allow to model non-affine control flow in a SCoP.

[Sebastian Pop]

I like the patch: let's wait for comments from Tobi before committing.


================
Comment at: include/polly/ScopInfo.h:466
@@ +465,3 @@
+  /// @param isApproximated Flag to indicate blocks that might not be executed,
+  ///                       hence for which write accesses need to be modelt as
+  ///                       may-write accesses.
----------------
s/modelt/modeled/

================
Comment at: test/ScopInfo/non-affine-loop-condition.ll:6
@@ +5,3 @@
+;        while (C[i])
+;          A[i]++;
+;      }
----------------
if C[0] is non null, then the inner while loop is infinite unless there is some aliasing A == C.
I think in this particular case we can say something about the number of elements of A and C we are accessing, because we can compute the access function A[i] and C[i].

Would we say that all the elements of arrays A and C are accessed if we cannot compute their access functions?

http://reviews.llvm.org/D7764

EMAIL PREFERENCES
  http://reviews.llvm.org/settings/panel/emailpreferences/