Update tests for private array analysis

tests/analysis/da_di/pass

@@ -82,6 +82,13 @@ private_array_6/tsar
 private_array_7/tsar
 private_array_8/tsar
 private_array_9/tsar
+private_array_var_bound_1/tsar
+private_array_var_bound_2/tsar
+private_array_var_bound_3/tsar
+private_array_var_bound_4/tsar
+private_array_var_bound_5/tsar
+private_array_var_bound_6/tsar
+private_array_var_bound_7/tsar
 reduction_1/tsar
 reduction_2/tsar
 reduction_3/tsar

tests/analysis/da_di/private_array_var_bound_1/main.c

@@ -0,0 +1,15 @@
+int A[10][2];
+
+int f(int N) {
+    int S = 0;
+    __builtin_assume(N > 0);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++) {
+            A[I][0] = I;
+            A[I][1] = I + 2;
+        }
+        for (int J = 0; J < N + 5; ++J)
+            S += A[J][0] * A[J][1];
+    }
+    return S;
+}

tests/analysis/da_di/private_array_var_bound_1/sample/main.c

@@ -0,0 +1,15 @@
+int A[10][2];
+
+int f(int N) {
+    int S = 0;
+    __builtin_assume(N > 0);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++) {
+            A[I][0] = I;
+            A[I][1] = I + 2;
+        }
+        for (int J = 0; J < N + 5; ++J)
+            S += A[J][0] * A[J][1];
+    }
+    return S;
+}

tests/analysis/da_di/private_array_var_bound_1/sample/output.txt

@@ -0,0 +1,70 @@
+Printing analysis 'Dependency Analysis (Metadata)' for function 'f':
+ loop at depth 1 main.c:6:5
+   private:
+    <I:7[7:9], 4> | <J:11[11:9], 4>
+   output:
+    <A, 80>
+   anti:
+    <A, 80>
+   flow:
+    <A, 80>
+   induction:
+    <K:6[6:5], 4>:[Int,0,10,1]
+   reduction:
+    <S:4, 4>:add
+   read only:
+    <N:3, 4>
+   lock:
+    <K:6[6:5], 4>
+   header access:
+    <K:6[6:5], 4>
+   explicit access:
+    <I:7[7:9], 4> | <J:11[11:9], 4> | <K:6[6:5], 4> | <N:3, 4> | <S:4, 4>
+   explicit access (separate):
+    <I:7[7:9], 4> <J:11[11:9], 4> <K:6[6:5], 4> <N:3, 4> <S:4, 4>
+   lock (separate):
+    <K:6[6:5], 4>
+   direct access (separate):
+    <A, 80> <I:7[7:9], 4> <J:11[11:9], 4> <K:6[6:5], 4> <N:3, 4> <S:4, 4>
+  loop at depth 2 main.c:11:9
+    induction:
+     <J:11[11:9], 4>:[Int,0,,1]
+    reduction:
+     <S:4, 4>:add
+    read only:
+     <A, 80> | <N:3, 4>
+    lock:
+     <J:11[11:9], 4> | <N:3, 4>
+    header access:
+     <J:11[11:9], 4> | <N:3, 4>
+    explicit access:
+     <J:11[11:9], 4> | <N:3, 4> | <S:4, 4>
+    explicit access (separate):
+     <J:11[11:9], 4> <N:3, 4> <S:4, 4>
+    lock (separate):
+     <J:11[11:9], 4> <N:3, 4>
+    direct access (separate):
+     <A, 80> <J:11[11:9], 4> <N:3, 4> <S:4, 4>
+  loop at depth 2 main.c:7:9
+    shared:
+     <A, 80>
+    first private:
+     <A, 80>
+    dynamic private:
+     <A, 80>
+    induction:
+     <I:7[7:9], 4>:[Int,0,,1]
+    read only:
+     <N:3, 4>
+    lock:
+     <I:7[7:9], 4> | <N:3, 4>
+    header access:
+     <I:7[7:9], 4> | <N:3, 4>
+    explicit access:
+     <I:7[7:9], 4> | <N:3, 4>
+    explicit access (separate):
+     <I:7[7:9], 4> <N:3, 4>
+    lock (separate):
+     <I:7[7:9], 4> <N:3, 4>
+    direct access (separate):
+     <A, 80> <I:7[7:9], 4> <N:3, 4>

tests/analysis/da_di/private_array_var_bound_1/tsar.conf

@@ -0,0 +1,8 @@
+plugin = TsarPlugin
+add_include_path = $include
+sources = main.c
+copy = $sources
+sample = $copy output.txt
+clean = $sample
+options = -print-only=da-di -print-step=4
+run = "$tsar $sources $options >output.txt 2>&1"

tests/analysis/da_di/private_array_var_bound_2/main.c

@@ -0,0 +1,15 @@
+int A[10][2];
+
+int f(int N) {
+    int S = 0;
+    __builtin_assume(N > 0);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++) {
+            A[I][0] = I;
+            A[I][1] = I + 2;
+        }
+        for (int J = 0; J < N; ++J)
+            S += A[J][0] * A[J][1];
+    }
+    return S;
+}

tests/analysis/da_di/private_array_var_bound_2/sample/main.c

@@ -0,0 +1,15 @@
+int A[10][2];
+
+int f(int N) {
+    int S = 0;
+    __builtin_assume(N > 0);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++) {
+            A[I][0] = I;
+            A[I][1] = I + 2;
+        }
+        for (int J = 0; J < N; ++J)
+            S += A[J][0] * A[J][1];
+    }
+    return S;
+}

tests/analysis/da_di/private_array_var_bound_2/sample/output.txt

@@ -0,0 +1,68 @@
+Printing analysis 'Dependency Analysis (Metadata)' for function 'f':
+ loop at depth 1 main.c:6:5
+   first private:
+    <A, 80>
+   dynamic private:
+    <A, 80>
+   private:
+    <I:7[7:9], 4> | <J:11[11:9], 4>
+   induction:
+    <K:6[6:5], 4>:[Int,0,10,1]
+   reduction:
+    <S:4, 4>:add
+   read only:
+    <N:3, 4>
+   lock:
+    <K:6[6:5], 4>
+   header access:
+    <K:6[6:5], 4>
+   explicit access:
+    <I:7[7:9], 4> | <J:11[11:9], 4> | <K:6[6:5], 4> | <N:3, 4> | <S:4, 4>
+   explicit access (separate):
+    <I:7[7:9], 4> <J:11[11:9], 4> <K:6[6:5], 4> <N:3, 4> <S:4, 4>
+   lock (separate):
+    <K:6[6:5], 4>
+   direct access (separate):
+    <A, 80> <I:7[7:9], 4> <J:11[11:9], 4> <K:6[6:5], 4> <N:3, 4> <S:4, 4>
+  loop at depth 2 main.c:11:9
+    induction:
+     <J:11[11:9], 4>:[Int,0,,1]
+    reduction:
+     <S:4, 4>:add
+    read only:
+     <A, 80> | <N:3, 4>
+    lock:
+     <J:11[11:9], 4> | <N:3, 4>
+    header access:
+     <J:11[11:9], 4> | <N:3, 4>
+    explicit access:
+     <J:11[11:9], 4> | <N:3, 4> | <S:4, 4>
+    explicit access (separate):
+     <J:11[11:9], 4> <N:3, 4> <S:4, 4>
+    lock (separate):
+     <J:11[11:9], 4> <N:3, 4>
+    direct access (separate):
+     <A, 80> <J:11[11:9], 4> <N:3, 4> <S:4, 4>
+  loop at depth 2 main.c:7:9
+    shared:
+     <A, 80>
+    first private:
+     <A, 80>
+    dynamic private:
+     <A, 80>
+    induction:
+     <I:7[7:9], 4>:[Int,0,,1]
+    read only:
+     <N:3, 4>
+    lock:
+     <I:7[7:9], 4> | <N:3, 4>
+    header access:
+     <I:7[7:9], 4> | <N:3, 4>
+    explicit access:
+     <I:7[7:9], 4> | <N:3, 4>
+    explicit access (separate):
+     <I:7[7:9], 4> <N:3, 4>
+    lock (separate):
+     <I:7[7:9], 4> <N:3, 4>
+    direct access (separate):
+     <A, 80> <I:7[7:9], 4> <N:3, 4>

tests/analysis/da_di/private_array_var_bound_2/tsar.conf

@@ -0,0 +1,8 @@
+plugin = TsarPlugin
+add_include_path = $include
+sources = main.c
+copy = $sources
+sample = $copy output.txt
+clean = $sample
+options = -print-only=da-di -print-step=4
+run = "$tsar $sources $options >output.txt 2>&1"

tests/analysis/da_di/private_array_var_bound_3/main.c

@@ -0,0 +1,10 @@
+void f(int * restrict A, int * restrict B, int N) {
+    __builtin_assume(N > 1);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++)
+            A[I] = I * I;
+        B[0] = 0;
+        for (int I = 1; I < N; ++I)
+            B[I] = A[I] + A[I-1];
+    }
+}

tests/analysis/da_di/private_array_var_bound_3/sample/main.c

@@ -0,0 +1,10 @@
+void f(int * restrict A, int * restrict B, int N) {
+    __builtin_assume(N > 1);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++)
+            A[I] = I * I;
+        B[0] = 0;
+        for (int I = 1; I < N; ++I)
+            B[I] = A[I] + A[I-1];
+    }
+}

tests/analysis/da_di/private_array_var_bound_3/sample/output.txt

@@ -0,0 +1,70 @@
+Printing analysis 'Dependency Analysis (Metadata)' for function 'f':
+ loop at depth 1 main.c:3:5
+   first private:
+    <*A:1, +?> | <*B:1, +?>
+   dynamic private:
+    <*A:1, +?> | <*B:1, +?>
+   private:
+    <I:4[4:9], 4> | <I:7[7:9], 4>
+   induction:
+    <K:3[3:5], 4>:[Int,0,10,1]
+   read only:
+    <A:1, 8> | <B:1, 8> | <N:1, 4>
+   lock:
+    <K:3[3:5], 4>
+   header access:
+    <K:3[3:5], 4>
+   explicit access:
+    <A:1, 8> | <B:1, 8> | <I:4[4:9], 4> | <I:7[7:9], 4> | <K:3[3:5], 4> | <N:1, 4>
+   explicit access (separate):
+    <A:1, 8> <B:1, 8> <I:4[4:9], 4> <I:7[7:9], 4> <K:3[3:5], 4> <N:1, 4>
+   lock (separate):
+    <K:3[3:5], 4>
+   direct access (separate):
+    <*A:1, +?> <*B:1, +?> <A:1, 8> <B:1, 8> <I:4[4:9], 4> <I:7[7:9], 4> <K:3[3:5], 4> <N:1, 4>
+  loop at depth 2 main.c:7:9
+    shared:
+     <*B:1, +?>
+    first private:
+     <*B:1, +?>
+    dynamic private:
+     <*B:1, +?>
+    induction:
+     <I:7[7:9], 4>:[Int,1,,1]
+    read only:
+     <*A:1, +?> | <A:1, 8> | <B:1, 8> | <N:1, 4>
+    lock:
+     <I:7[7:9], 4> | <N:1, 4>
+    header access:
+     <I:7[7:9], 4> | <N:1, 4>
+    explicit access:
+     <A:1, 8> | <B:1, 8> | <I:7[7:9], 4> | <N:1, 4>
+    explicit access (separate):
+     <A:1, 8> <B:1, 8> <I:7[7:9], 4> <N:1, 4>
+    lock (separate):
+     <I:7[7:9], 4> <N:1, 4>
+    direct access (separate):
+     <*A:1, +?> <*B:1, +?> <A:1, 8> <B:1, 8> <I:7[7:9], 4> <N:1, 4>
+  loop at depth 2 main.c:4:9
+    shared:
+     <*A:1, +?>
+    first private:
+     <*A:1, +?>
+    dynamic private:
+     <*A:1, +?>
+    induction:
+     <I:4[4:9], 4>:[Int,0,,1]
+    read only:
+     <A:1, 8> | <N:1, 4>
+    lock:
+     <I:4[4:9], 4> | <N:1, 4>
+    header access:
+     <I:4[4:9], 4> | <N:1, 4>
+    explicit access:
+     <A:1, 8> | <I:4[4:9], 4> | <N:1, 4>
+    explicit access (separate):
+     <A:1, 8> <I:4[4:9], 4> <N:1, 4>
+    lock (separate):
+     <I:4[4:9], 4> <N:1, 4>
+    direct access (separate):
+     <*A:1, +?> <A:1, 8> <I:4[4:9], 4> <N:1, 4>

tests/analysis/da_di/private_array_var_bound_3/tsar.conf

@@ -0,0 +1,8 @@
+plugin = TsarPlugin
+add_include_path = $include
+sources = main.c
+copy = $sources
+sample = $copy output.txt
+clean = $sample
+options = -print-only=da-di -print-step=4
+run = "$tsar $sources $options >output.txt 2>&1"

tests/analysis/da_di/private_array_var_bound_4/main.c

@@ -0,0 +1,10 @@
+void f(int *A, int *B, int N) {
+    __builtin_assume(N > 1);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++)
+            A[I] = I * I;
+        B[0] = 0;
+        for (int I = 1; I < N; ++I)
+            B[I] = A[I] + A[I-1];
+    }
+}

tests/analysis/da_di/private_array_var_bound_4/sample/main.c

@@ -0,0 +1,10 @@
+void f(int *A, int *B, int N) {
+    __builtin_assume(N > 1);
+    for (int K = 0; K < 10; K++) {
+        for (int I = 0; I < N; I++)
+            A[I] = I * I;
+        B[0] = 0;
+        for (int I = 1; I < N; ++I)
+            B[I] = A[I] + A[I-1];
+    }
+}