Changes between Version 50 and Version 51 of Next-GenOpenMPTransformation

Timestamp:

11/05/19 17:58:42 (7 years ago)

Author:

wuwenhao

Comment:

--

Next-GenOpenMPTransformation

@@ -667 +667 @@
 In this case the system function must return an int iterator in which the ints occur in loop order.
 
+==== Case 1: ordered for-loop without a collapse clause ====
 {{{
 #pragma omp for ordered
@@ -680 +681 @@
 
 {{{
+int order_counter0 = INIT; //global
+  ..
 {
   $domain loop_domain = {INIT .. COND # INCR};
   $domain(1) loop_dist = ($domain(1))$omp_arrive_loop(team, loop_id++, loop_domain, STRATEGY);
-  int order_counter0 = INIT;
 
   $for (int i : loop_dist) {
@@ -695 +697 @@
   }
 }
+}}}
+
+==== Case 1: ordered for-loop with a collapse clause ====
+
+{{{
+#pragma omp parallel for collapse(2) ordered
+for (i=I_INIT; i<I_COND; i+=I_INCR)
+  for (j=J_INIT; j<J_COND; j+=J_INCR) {
+    #pragma omp ordered
+      BLOCK
+  }
+}}}
+
+=>
+
+{{{
+int order_counter0 = I_INIT;
+int order_counter1 = J_INIT;
+
+{ // worksharing-loop construct (begin)
+  ..
+  $for (int i, j : loop_dist) {
+    $yield();
+    $when((order_counter0 == i) && (order_counter1 == j)) {
+      translate(BLOCK);
+
+      order_counter1 += J_INCR;
+      if (order_counter1 >= J_COND) {
+        order_counter1 = J_INIT;
+        order_counter0 += I_INCR;
+      }
+    }
+  }
+  ..
+} // worksharing-loop construct (end)
 }}}