[PATCH] [Polly] Compute and print the loop carried dependency distance

[Sebastian Pop]

================
Comment at: test/Isl/Ast/dependence_distance_varying_multiple.ll:5
@@ +4,3 @@
+;               int *restrict E, int N) {
+; CHECK:   #pragma dependence distance: (-35 + N >= 0) ? (1) : (-17 + N >= 0 && 34 - N >= 0) ? (2) : 5
+;          for (int i = 0; i < N; i++) {
----------------
jdoerfert wrote:
> sebpop wrote:
> > The difference between A[i] and A[100 - 2*i] is not constant.
> > 
> > This loop does not carry a constant dependence distance of 1, 2, or 5.
> Should again be the minimal dep. distance.
Ok, so then let's print:

```
#pragma minimal dependence distance
```

that is different than what books call "dependence distance", that's why I got confused.

http://reviews.llvm.org/D4987