Hi,

this patch adds a new test-case. The existing three parloops-exit-first-loop-alt test-cases covered:
- variable bound, vector addition
- constant bound, vector addition
- variable bound, reduction

This patch adds the case 'constant bound, reduction'.

Committed to trunk.

Thanks,
- Tom
Add gcc.dg/parloops-exit-first-loop-alt-4.c

2015-06-13  Tom de Vries  <t...@codesourcery.com>

	* gcc.dg/parloops-exit-first-loop-alt-4.c: New test.

	* testsuite/libgomp.c/parloops-exit-first-loop-alt-4.c: New test.
---
 .../gcc.dg/parloops-exit-first-loop-alt-4.c        | 28 ++++++++++++++++++
 .../libgomp.c/parloops-exit-first-loop-alt-4.c     | 33 ++++++++++++++++++++++
 2 files changed, 61 insertions(+)
 create mode 100644 gcc/testsuite/gcc.dg/parloops-exit-first-loop-alt-4.c
 create mode 100644 libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt-4.c

diff --git a/gcc/testsuite/gcc.dg/parloops-exit-first-loop-alt-4.c b/gcc/testsuite/gcc.dg/parloops-exit-first-loop-alt-4.c
new file mode 100644
index 0000000..2b8d289
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/parloops-exit-first-loop-alt-4.c
@@ -0,0 +1,28 @@
+/* { dg-do compile } */
+/* { dg-require-effective-target pthread } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops" } */
+
+/* Constant bound, reduction.  */
+
+#define N 4000
+
+unsigned int *a;
+
+unsigned int
+f (void)
+{
+  int i;
+  unsigned int sum = 1;
+
+  for (i = 0; i < N; ++i)
+    sum += a[i];
+
+  return sum;
+}
+
+/* Three array accesses:
+   - one in f._loopfn.0
+   - one in the parallel
+   - one in the low iteration count loop
+   Crucially, none for a peeled off last iteration following the parallel.  */
+/* { dg-final { scan-tree-dump-times "(?n)\\\* 4" 3 "parloops" } } */
diff --git a/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt-4.c b/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt-4.c
new file mode 100644
index 0000000..1beae3e
--- /dev/null
+++ b/libgomp/testsuite/libgomp.c/parloops-exit-first-loop-alt-4.c
@@ -0,0 +1,33 @@
+/* { dg-do run } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2" } */
+
+/* Constant bound, reduction.  */
+
+#define N 4000
+
+unsigned int *a;
+
+unsigned int
+f (void)
+{
+  int i;
+  unsigned int sum = 1;
+
+  for (i = 0; i < N; ++i)
+    sum += a[i];
+
+  return sum;
+}
+
+int
+main (void)
+{
+  unsigned int res;
+  unsigned int array[N];
+  int i;
+  for (i = 0; i < N; ++i)
+    array[i] = i % 7;
+  a = &array[0];
+  res = f ();
+  return !(res == 11995);
+}
-- 
1.9.1

Reply via email to