[OpenMP] Add tests on task in_reduction and depend clause

[animeshk-amd]

Summary

The working of depend clause can be correctly tested by
means of execution tests and not at the LLVM IR level.
The in_reduction clause wasn't being tested with task
construct in the context of a target region. These tests
are imported/inspired from the SOLLVE tests.

SOLLVE repo: https://github.com/SOLLVE/sollve_vv

[JonChesterfield]

More tests, great! Do you know how the first one fails on amdgpu?

[animeshk-amd]

In D146706#4216075, @JonChesterfield wrote:

More tests, great! Do you know how the first one fails on amdgpu?

Thanks. The target_task_reductions.c fails on the amdgcn-amd-amdhsa with the following error:
ld.lld: error: undefined symbol: __kmpc_taskred_modifier_init

[tianshilei1992]

Do we support in reduction yet?

[animeshk-amd]

In D146706#4216440, @tianshilei1992 wrote:

Do we support in reduction yet?

Right. I believed it's supported on nvptx and not on amdgpu. It turns out it's supported on neither. Please help me decide what should I do?

1. Delete the added test target_task_reductions.c.
2. Keep the test but add nvptx target as well in the list of UNSUPPORTED.

[animeshk-amd]

Rebase the patch and delete the target_task_reductions.c because
this test is not worth testing. It is neither supported on nvptx
nor on amdgpu. I had originally assumed that such a test should be
relevant because it exists in SOLLVE suite.

openmp/runtime/test/tasking/omp_task_depend_iterator.cpp

+// RUN: %libomp-cxx-compile-and-run
+
+/*
+
+This test is imported from SOLLVE: 5.0/task/test_task_depend_iterator.cpp
+SOLLVE page: https://github.com/SOLLVE/sollve_vv
+
+OpenMP API Version 5.0 Nov 2020
+
+This test is for the iterator modifier when used with the task depend
+clause. This modifier should create an iterator that expands to multiple values
+inside the clause they appear. In this particular test case the iterator expands into
+several values creating several dependencies at the same time.
+
+*/
+
+#include <omp.h>
+#include <algorithm>
+#include <cstdlib>
+#include <iostream>
+#include <thread>
+#include <vector>
+#include "omp_testsuite.h"
+
+#define N 1024
+#define FROM 64
+#define LENGTH 128
+
+int test_omp_task_depend_iterator() {
+  int ptr[] = {0, 4, 5, 6, 7, 8, 9, 10, 11};
+  int cols[] = {1, 2, 3, 4, 5, 5, 6, 6, 7, 7, 8};
+  std::vector<int> threadOrder;
+  bool threadOrderError = false;
+#pragma omp parallel num_threads(8)
+  {
+#pragma omp single
+    {
+      for (int i = 0; i < 8; ++i) {
+        int pos = ptr[i], size = ptr[i + 1] - ptr[i];
+#pragma omp task depend(iterator(it = 0 : size), in : ptr[cols[pos + it]]) depend(out : ptr[i])
+        {
+#pragma omp critical
+          {
+            threadOrder.push_back(i);
+          } // end critical section
+        } // end task depend
+      }
+    } // end single
+  } // end parallel
+
+  // store the indices of the execution order of generated tasks in idx[]
+  std::vector<int>::iterator idx[8];
+  for (int i = 0; i < 8; ++i)
+    idx[i] = std::find (threadOrder.begin(), threadOrder.end(), i);
+
+  // verify that dependencies are met in the order
+  if (idx[0] != threadOrder.begin())
+    threadOrderError |= true;
+  if (idx[1] > idx[5] || idx[2] > idx[5])
+    threadOrderError |= true;
+  if (idx[3] > idx[6] || idx[4] > idx[6])
+    threadOrderError |= true;
+  if (idx[5] > idx[7] || idx[6] > idx[7])
+    threadOrderError |= true;
+
+  std::sort(threadOrder.begin(), threadOrder.end());
+  for(int i = 0; i < 8; ++i)
+    threadOrderError = (threadOrder[i] != i) || threadOrderError;
+
+  // FALSE If dependencies between tasks were not enforced in the correct order.
+  return !threadOrderError; 
+}
+
+
+
+int main() {
+  int i;
+  int num_failed=0;
+
+  for(i = 0; i < REPETITIONS; i++) {
+    if(!test_omp_task_depend_iterator()) {
+      num_failed++;
+    }
+  }
+  return num_failed;
+}