re PR libfortran/79956 (many new -Wmaybe-uninitialized warnings with bootstrap-O3)

author Thomas Koenig <tkoenig@gcc.gnu.org>

Fri, 10 Mar 2017 19:42:46 +0000 (19:42 +0000)

committer Thomas Koenig <tkoenig@gcc.gnu.org>

Fri, 10 Mar 2017 19:42:46 +0000 (19:42 +0000)
author Thomas Koenig <tkoenig@gcc.gnu.org>
Fri, 10 Mar 2017 19:42:46 +0000 (19:42 +0000)
committer Thomas Koenig <tkoenig@gcc.gnu.org>
Fri, 10 Mar 2017 19:42:46 +0000 (19:42 +0000)
diff --git a/libgfortran/ChangeLog b/libgfortran/ChangeLog

index edb416bde94b14e63c02c936ef44782dc2729157..bd2f726670d0bbd1dd563a1c21bb7eb762ce4110 100644 (file)
--- a/libgfortran/ChangeLog
+++ b/libgfortran/ChangeLog
@@ -1,3 +1,202 @@
+2017-03-10  Thomas Koenig  <tkoenig@gcc.gnu.org>
+
+       PR libfortran/79956
+       * m4/iforeach.m4:  Change exit condition from loop for
+       increasing dimension to >=.  Fix type in comment.
+       * m4/ifunction.m4:  Likewise.
+       * m4/ifunction_logical.m4: Likewise.
+       * generated/all_l1.c: Regenerated.
+       * generated/all_l16.c: Regenerated.
+       * generated/all_l2.c: Regenerated.
+       * generated/all_l4.c: Regenerated.
+       * generated/all_l8.c: Regenerated.
+       * generated/any_l1.c: Regenerated.
+       * generated/any_l16.c: Regenerated.
+       * generated/any_l2.c: Regenerated.
+       * generated/any_l4.c: Regenerated.
+       * generated/any_l8.c: Regenerated.
+       * generated/count_16_l.c: Regenerated.
+       * generated/count_1_l.c: Regenerated.
+       * generated/count_2_l.c: Regenerated.
+       * generated/count_4_l.c: Regenerated.
+       * generated/count_8_l.c: Regenerated.
+       * generated/iall_i1.c: Regenerated.
+       * generated/iall_i16.c: Regenerated.
+       * generated/iall_i2.c: Regenerated.
+       * generated/iall_i4.c: Regenerated.
+       * generated/iall_i8.c: Regenerated.
+       * generated/iany_i1.c: Regenerated.
+       * generated/iany_i16.c: Regenerated.
+       * generated/iany_i2.c: Regenerated.
+       * generated/iany_i4.c: Regenerated.
+       * generated/iany_i8.c: Regenerated.
+       * generated/iparity_i1.c: Regenerated.
+       * generated/iparity_i16.c: Regenerated.
+       * generated/iparity_i2.c: Regenerated.
+       * generated/iparity_i4.c: Regenerated.
+       * generated/iparity_i8.c: Regenerated.
+       * generated/maxloc0_16_i1.c: Regenerated.
+       * generated/maxloc0_16_i16.c: Regenerated.
+       * generated/maxloc0_16_i2.c: Regenerated.
+       * generated/maxloc0_16_i4.c: Regenerated.
+       * generated/maxloc0_16_i8.c: Regenerated.
+       * generated/maxloc0_16_r10.c: Regenerated.
+       * generated/maxloc0_16_r16.c: Regenerated.
+       * generated/maxloc0_16_r4.c: Regenerated.
+       * generated/maxloc0_16_r8.c: Regenerated.
+       * generated/maxloc0_4_i1.c: Regenerated.
+       * generated/maxloc0_4_i16.c: Regenerated.
+       * generated/maxloc0_4_i2.c: Regenerated.
+       * generated/maxloc0_4_i4.c: Regenerated.
+       * generated/maxloc0_4_i8.c: Regenerated.
+       * generated/maxloc0_4_r10.c: Regenerated.
+       * generated/maxloc0_4_r16.c: Regenerated.
+       * generated/maxloc0_4_r4.c: Regenerated.
+       * generated/maxloc0_4_r8.c: Regenerated.
+       * generated/maxloc0_8_i1.c: Regenerated.
+       * generated/maxloc0_8_i16.c: Regenerated.
+       * generated/maxloc0_8_i2.c: Regenerated.
+       * generated/maxloc0_8_i4.c: Regenerated.
+       * generated/maxloc0_8_i8.c: Regenerated.
+       * generated/maxloc0_8_r10.c: Regenerated.
+       * generated/maxloc0_8_r16.c: Regenerated.
+       * generated/maxloc0_8_r4.c: Regenerated.
+       * generated/maxloc0_8_r8.c: Regenerated.
+       * generated/maxloc1_16_i1.c: Regenerated.
+       * generated/maxloc1_16_i16.c: Regenerated.
+       * generated/maxloc1_16_i2.c: Regenerated.
+       * generated/maxloc1_16_i4.c: Regenerated.
+       * generated/maxloc1_16_i8.c: Regenerated.
+       * generated/maxloc1_16_r10.c: Regenerated.
+       * generated/maxloc1_16_r16.c: Regenerated.
+       * generated/maxloc1_16_r4.c: Regenerated.
+       * generated/maxloc1_16_r8.c: Regenerated.
+       * generated/maxloc1_4_i1.c: Regenerated.
+       * generated/maxloc1_4_i16.c: Regenerated.
+       * generated/maxloc1_4_i2.c: Regenerated.
+       * generated/maxloc1_4_i4.c: Regenerated.
+       * generated/maxloc1_4_i8.c: Regenerated.
+       * generated/maxloc1_4_r10.c: Regenerated.
+       * generated/maxloc1_4_r16.c: Regenerated.
+       * generated/maxloc1_4_r4.c: Regenerated.
+       * generated/maxloc1_4_r8.c: Regenerated.
+       * generated/maxloc1_8_i1.c: Regenerated.
+       * generated/maxloc1_8_i16.c: Regenerated.
+       * generated/maxloc1_8_i2.c: Regenerated.
+       * generated/maxloc1_8_i4.c: Regenerated.
+       * generated/maxloc1_8_i8.c: Regenerated.
+       * generated/maxloc1_8_r10.c: Regenerated.
+       * generated/maxloc1_8_r16.c: Regenerated.
+       * generated/maxloc1_8_r4.c: Regenerated.
+       * generated/maxloc1_8_r8.c: Regenerated.
+       * generated/maxval_i1.c: Regenerated.
+       * generated/maxval_i16.c: Regenerated.
+       * generated/maxval_i2.c: Regenerated.
+       * generated/maxval_i4.c: Regenerated.
+       * generated/maxval_i8.c: Regenerated.
+       * generated/maxval_r10.c: Regenerated.
+       * generated/maxval_r16.c: Regenerated.
+       * generated/maxval_r4.c: Regenerated.
+       * generated/maxval_r8.c: Regenerated.
+       * generated/minloc0_16_i1.c: Regenerated.
+       * generated/minloc0_16_i16.c: Regenerated.
+       * generated/minloc0_16_i2.c: Regenerated.
+       * generated/minloc0_16_i4.c: Regenerated.
+       * generated/minloc0_16_i8.c: Regenerated.
+       * generated/minloc0_16_r10.c: Regenerated.
+       * generated/minloc0_16_r16.c: Regenerated.
+       * generated/minloc0_16_r4.c: Regenerated.
+       * generated/minloc0_16_r8.c: Regenerated.
+       * generated/minloc0_4_i1.c: Regenerated.
+       * generated/minloc0_4_i16.c: Regenerated.
+       * generated/minloc0_4_i2.c: Regenerated.
+       * generated/minloc0_4_i4.c: Regenerated.
+       * generated/minloc0_4_i8.c: Regenerated.
+       * generated/minloc0_4_r10.c: Regenerated.
+       * generated/minloc0_4_r16.c: Regenerated.
+       * generated/minloc0_4_r4.c: Regenerated.
+       * generated/minloc0_4_r8.c: Regenerated.
+       * generated/minloc0_8_i1.c: Regenerated.
+       * generated/minloc0_8_i16.c: Regenerated.
+       * generated/minloc0_8_i2.c: Regenerated.
+       * generated/minloc0_8_i4.c: Regenerated.
+       * generated/minloc0_8_i8.c: Regenerated.
+       * generated/minloc0_8_r10.c: Regenerated.
+       * generated/minloc0_8_r16.c: Regenerated.
+       * generated/minloc0_8_r4.c: Regenerated.
+       * generated/minloc0_8_r8.c: Regenerated.
+       * generated/minloc1_16_i1.c: Regenerated.
+       * generated/minloc1_16_i16.c: Regenerated.
+       * generated/minloc1_16_i2.c: Regenerated.
+       * generated/minloc1_16_i4.c: Regenerated.
+       * generated/minloc1_16_i8.c: Regenerated.
+       * generated/minloc1_16_r10.c: Regenerated.
+       * generated/minloc1_16_r16.c: Regenerated.
+       * generated/minloc1_16_r4.c: Regenerated.
+       * generated/minloc1_16_r8.c: Regenerated.
+       * generated/minloc1_4_i1.c: Regenerated.
+       * generated/minloc1_4_i16.c: Regenerated.
+       * generated/minloc1_4_i2.c: Regenerated.
+       * generated/minloc1_4_i4.c: Regenerated.
+       * generated/minloc1_4_i8.c: Regenerated.
+       * generated/minloc1_4_r10.c: Regenerated.
+       * generated/minloc1_4_r16.c: Regenerated.
+       * generated/minloc1_4_r4.c: Regenerated.
+       * generated/minloc1_4_r8.c: Regenerated.
+       * generated/minloc1_8_i1.c: Regenerated.
+       * generated/minloc1_8_i16.c: Regenerated.
+       * generated/minloc1_8_i2.c: Regenerated.
+       * generated/minloc1_8_i4.c: Regenerated.
+       * generated/minloc1_8_i8.c: Regenerated.
+       * generated/minloc1_8_r10.c: Regenerated.
+       * generated/minloc1_8_r16.c: Regenerated.
+       * generated/minloc1_8_r4.c: Regenerated.
+       * generated/minloc1_8_r8.c: Regenerated.
+       * generated/minval_i1.c: Regenerated.
+       * generated/minval_i16.c: Regenerated.
+       * generated/minval_i2.c: Regenerated.
+       * generated/minval_i4.c: Regenerated.
+       * generated/minval_i8.c: Regenerated.
+       * generated/minval_r10.c: Regenerated.
+       * generated/minval_r16.c: Regenerated.
+       * generated/minval_r4.c: Regenerated.
+       * generated/minval_r8.c: Regenerated.
+       * generated/norm2_r10.c: Regenerated.
+       * generated/norm2_r16.c: Regenerated.
+       * generated/norm2_r4.c: Regenerated.
+       * generated/norm2_r8.c: Regenerated.
+       * generated/parity_l1.c: Regenerated.
+       * generated/parity_l16.c: Regenerated.
+       * generated/parity_l2.c: Regenerated.
+       * generated/parity_l4.c: Regenerated.
+       * generated/parity_l8.c: Regenerated.
+       * generated/product_c10.c: Regenerated.
+       * generated/product_c16.c: Regenerated.
+       * generated/product_c4.c: Regenerated.
+       * generated/product_c8.c: Regenerated.
+       * generated/product_i1.c: Regenerated.
+       * generated/product_i16.c: Regenerated.
+       * generated/product_i2.c: Regenerated.
+       * generated/product_i4.c: Regenerated.
+       * generated/product_i8.c: Regenerated.
+       * generated/product_r10.c: Regenerated.
+       * generated/product_r16.c: Regenerated.
+       * generated/product_r4.c: Regenerated.
+       * generated/product_r8.c: Regenerated.
+       * generated/sum_c10.c: Regenerated.
+       * generated/sum_c16.c: Regenerated.
+       * generated/sum_c4.c: Regenerated.
+       * generated/sum_c8.c: Regenerated.
+       * generated/sum_i1.c: Regenerated.
+       * generated/sum_i16.c: Regenerated.
+       * generated/sum_i2.c: Regenerated.
+       * generated/sum_i4.c: Regenerated.
+       * generated/sum_i8.c: Regenerated.
+       * generated/sum_r10.c: Regenerated.
+       * generated/sum_r16.c: Regenerated.
+       * generated/sum_r4.c: Regenerated.
+       * generated/sum_r8.c: Regenerated.
+
  2017-03-05  Andre Vehreschild  <vehre@gcc.gnu.org>
              Alessandro Fanfarillo  <fanfarillo.gcc@gmail.com>
  
diff --git a/libgfortran/generated/all_l1.c b/libgfortran/generated/all_l1.c

index 6a04f86a8d974ebe96809b5f6c73ee338c06fe4d..46168ebac8331de81c84a544b4c39c078cb9e3d2 100644 (file)
--- a/libgfortran/generated/all_l1.c
+++ b/libgfortran/generated/all_l1.c
@@ -199,9 +199,9 @@ all_l1 (gfc_array_l1 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/all_l16.c b/libgfortran/generated/all_l16.c

index 7962fb61c98e49f82ebee37471e87fbe144a4146..2fa957829f47d2205cfe86e196407a47ea31bf3d 100644 (file)
--- a/libgfortran/generated/all_l16.c
+++ b/libgfortran/generated/all_l16.c
@@ -199,9 +199,9 @@ all_l16 (gfc_array_l16 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/all_l2.c b/libgfortran/generated/all_l2.c

index 8e4cf2840832cf5d41dda3d0e104f43ecdfe9e59..5b08556ec5f8c80dfba1165c50a5ab7f90adc388 100644 (file)
--- a/libgfortran/generated/all_l2.c
+++ b/libgfortran/generated/all_l2.c
@@ -199,9 +199,9 @@ all_l2 (gfc_array_l2 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/all_l4.c b/libgfortran/generated/all_l4.c

index b3edb83b1adbe81973d5038d45e4a3341af7ec47..b57374270b51a17b250363935fc447e5efa183e9 100644 (file)
--- a/libgfortran/generated/all_l4.c
+++ b/libgfortran/generated/all_l4.c
@@ -199,9 +199,9 @@ all_l4 (gfc_array_l4 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/all_l8.c b/libgfortran/generated/all_l8.c

index 299f05a01396062ca0540188e4ae50e91141fce9..dfac0e3c27afe33d35df0501635c31f66c4ef656 100644 (file)
--- a/libgfortran/generated/all_l8.c
+++ b/libgfortran/generated/all_l8.c
@@ -199,9 +199,9 @@ all_l8 (gfc_array_l8 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/any_l1.c b/libgfortran/generated/any_l1.c

index df4c053d1e1e7b02d6ff0af973a25831045a987b..e2bf26c4e6a5a16d3a6a2bfb6dcc4ecb6acc7ee9 100644 (file)
--- a/libgfortran/generated/any_l1.c
+++ b/libgfortran/generated/any_l1.c
@@ -199,9 +199,9 @@ any_l1 (gfc_array_l1 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/any_l16.c b/libgfortran/generated/any_l16.c

index 261c5fe9d6e098051f56ae5b0c9aa193dccc7c1f..5b2987dbaba00a2ac814df014870a96a5bca125a 100644 (file)
--- a/libgfortran/generated/any_l16.c
+++ b/libgfortran/generated/any_l16.c
@@ -199,9 +199,9 @@ any_l16 (gfc_array_l16 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/any_l2.c b/libgfortran/generated/any_l2.c

index ebd19ee6eec152152b48df538ee4278840847200..6e28643eace4332c3deb9283df2923dead6db782 100644 (file)
--- a/libgfortran/generated/any_l2.c
+++ b/libgfortran/generated/any_l2.c
@@ -199,9 +199,9 @@ any_l2 (gfc_array_l2 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/any_l4.c b/libgfortran/generated/any_l4.c

index 2bd83fb70eb1228d366668ad1596b1579a38f503..7d2fcd06814584ff48fb1473c99ac60f79cd0846 100644 (file)
--- a/libgfortran/generated/any_l4.c
+++ b/libgfortran/generated/any_l4.c
@@ -199,9 +199,9 @@ any_l4 (gfc_array_l4 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/any_l8.c b/libgfortran/generated/any_l8.c

index c4c5adcdb8201811194544bbd1c6b80121fac7d1..c72d12fb07c3ee56e741a6a1e3062c3934aa3d3d 100644 (file)
--- a/libgfortran/generated/any_l8.c
+++ b/libgfortran/generated/any_l8.c
@@ -199,9 +199,9 @@ any_l8 (gfc_array_l8 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/count_16_l.c b/libgfortran/generated/count_16_l.c

index 98c5aeed106a850763dc7f8fa8a8379158070efa..28ae1611db0342ab370b5ba4190e8297c0a2e174 100644 (file)
--- a/libgfortran/generated/count_16_l.c
+++ b/libgfortran/generated/count_16_l.c
@@ -195,9 +195,9 @@ count_16_l (gfc_array_i16 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/count_1_l.c b/libgfortran/generated/count_1_l.c

index 051400dc830695fbad3ed360d9dd1a2eb682e1ae..8b1892c0faa4802a728c78f76065e606a596f1f8 100644 (file)
--- a/libgfortran/generated/count_1_l.c
+++ b/libgfortran/generated/count_1_l.c
@@ -195,9 +195,9 @@ count_1_l (gfc_array_i1 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/count_2_l.c b/libgfortran/generated/count_2_l.c

index 256403ffaba7697d18abb93b94395f8ea31197fe..8132c2ed757108e8d2e5f07449a51e2091ad0af7 100644 (file)
--- a/libgfortran/generated/count_2_l.c
+++ b/libgfortran/generated/count_2_l.c
@@ -195,9 +195,9 @@ count_2_l (gfc_array_i2 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/count_4_l.c b/libgfortran/generated/count_4_l.c

index 2d10338e5177c741fd99011307c0972081918511..f90ba357d8e3cba6c62657efcdcc670030946ba9 100644 (file)
--- a/libgfortran/generated/count_4_l.c
+++ b/libgfortran/generated/count_4_l.c
@@ -195,9 +195,9 @@ count_4_l (gfc_array_i4 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/count_8_l.c b/libgfortran/generated/count_8_l.c

index d366568218f1ee215ee9c15efedc3038a7a1abf3..efce9e480621955940dded6a0c8e375c90c9a6f6 100644 (file)
--- a/libgfortran/generated/count_8_l.c
+++ b/libgfortran/generated/count_8_l.c
@@ -195,9 +195,9 @@ count_8_l (gfc_array_i8 * const restrict retarray,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
diff --git a/libgfortran/generated/iall_i1.c b/libgfortran/generated/iall_i1.c

index f49c73fde91fe2de011e3c1058373dbec058bff5..619c833c33b36c8d12b9f793c0586f79e1e4c8e1 100644 (file)
--- a/libgfortran/generated/iall_i1.c
+++ b/libgfortran/generated/iall_i1.c
@@ -167,9 +167,9 @@ iall_i1 (gfc_array_i1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miall_i1 (gfc_array_i1 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siall_i1 (gfc_array_i1 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iall_i16.c b/libgfortran/generated/iall_i16.c

index 01178998495f1f7832a5f1b48aeed60b78a66d49..4d37d9c80bf15d796c540ade9c5dc9127bf56372 100644 (file)
--- a/libgfortran/generated/iall_i16.c
+++ b/libgfortran/generated/iall_i16.c
@@ -167,9 +167,9 @@ iall_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miall_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siall_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iall_i2.c b/libgfortran/generated/iall_i2.c

index 9b594ed579c56ee976f1b807b2f0d954da0df577..283ceffb2c95c7ac258f689f406e2da7614cf94c 100644 (file)
--- a/libgfortran/generated/iall_i2.c
+++ b/libgfortran/generated/iall_i2.c
@@ -167,9 +167,9 @@ iall_i2 (gfc_array_i2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miall_i2 (gfc_array_i2 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siall_i2 (gfc_array_i2 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iall_i4.c b/libgfortran/generated/iall_i4.c

index 4e4dd50dd8b677f52d38854b5d0ceb10643f82cd..ef0ac58d3b956957b69bb8a083b019d3b1181bb4 100644 (file)
--- a/libgfortran/generated/iall_i4.c
+++ b/libgfortran/generated/iall_i4.c
@@ -167,9 +167,9 @@ iall_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miall_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siall_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iall_i8.c b/libgfortran/generated/iall_i8.c

index 0d562cc47ab0c8ea30e9551b424a581b6cd5d194..ef780b01c71cab1ff70812daaa57b2084d26932c 100644 (file)
--- a/libgfortran/generated/iall_i8.c
+++ b/libgfortran/generated/iall_i8.c
@@ -167,9 +167,9 @@ iall_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miall_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siall_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iany_i1.c b/libgfortran/generated/iany_i1.c

index 4cf28fc2e5f95ba5ef7250a581cd56604f846c83..b60d4f2d383459c4e13ba7cc9d7a97046211d40e 100644 (file)
--- a/libgfortran/generated/iany_i1.c
+++ b/libgfortran/generated/iany_i1.c
@@ -167,9 +167,9 @@ iany_i1 (gfc_array_i1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miany_i1 (gfc_array_i1 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siany_i1 (gfc_array_i1 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iany_i16.c b/libgfortran/generated/iany_i16.c

index 7cddbc5abf4f9fcbf3bab96f9ecb7a0ab952e318..f8fb40acd1cb04eb782383658cac902015be274d 100644 (file)
--- a/libgfortran/generated/iany_i16.c
+++ b/libgfortran/generated/iany_i16.c
@@ -167,9 +167,9 @@ iany_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miany_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siany_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iany_i2.c b/libgfortran/generated/iany_i2.c

index 085668346781d656279868ff11c0681711e018ee..ef931b35a5798caac8fda4ad469b6499d1185a87 100644 (file)
--- a/libgfortran/generated/iany_i2.c
+++ b/libgfortran/generated/iany_i2.c
@@ -167,9 +167,9 @@ iany_i2 (gfc_array_i2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miany_i2 (gfc_array_i2 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siany_i2 (gfc_array_i2 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iany_i4.c b/libgfortran/generated/iany_i4.c

index 14d43a237caaf2b1750d73e57a5f2ac1992661dd..d0ecaef23d01b493c3c66a1ed0bf38bd31b1adbc 100644 (file)
--- a/libgfortran/generated/iany_i4.c
+++ b/libgfortran/generated/iany_i4.c
@@ -167,9 +167,9 @@ iany_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miany_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siany_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iany_i8.c b/libgfortran/generated/iany_i8.c

index a6b1c02515126cf84950fc3d6df7dfb5b7563a2d..c963165cf184ff09eaf2003a7d3ddc0a16a0cabb 100644 (file)
--- a/libgfortran/generated/iany_i8.c
+++ b/libgfortran/generated/iany_i8.c
@@ -167,9 +167,9 @@ iany_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miany_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siany_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iparity_i1.c b/libgfortran/generated/iparity_i1.c

index 6ebf498c480a1b5ea3011571a7beddd677868a4e..18e9fc24be135077506b6850bb50896f527d9ea5 100644 (file)
--- a/libgfortran/generated/iparity_i1.c
+++ b/libgfortran/generated/iparity_i1.c
@@ -167,9 +167,9 @@ iparity_i1 (gfc_array_i1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miparity_i1 (gfc_array_i1 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siparity_i1 (gfc_array_i1 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iparity_i16.c b/libgfortran/generated/iparity_i16.c

index 670c74e57f8e6bec669a52f030f28ba750379394..5b8ea697483385a00be60d7348b255fa87fe8c68 100644 (file)
--- a/libgfortran/generated/iparity_i16.c
+++ b/libgfortran/generated/iparity_i16.c
@@ -167,9 +167,9 @@ iparity_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miparity_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siparity_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iparity_i2.c b/libgfortran/generated/iparity_i2.c

index 63f7b4313c7c5f2a708fb55e6bde9479e5281103..0076667cabace18f9081f1a183a8b4d634037fea 100644 (file)
--- a/libgfortran/generated/iparity_i2.c
+++ b/libgfortran/generated/iparity_i2.c
@@ -167,9 +167,9 @@ iparity_i2 (gfc_array_i2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miparity_i2 (gfc_array_i2 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siparity_i2 (gfc_array_i2 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iparity_i4.c b/libgfortran/generated/iparity_i4.c

index 682b1705dcb1b17e704581890b938b137d1a009f..20798423f5c8e012a9a1225ae2b555a3abc771cf 100644 (file)
--- a/libgfortran/generated/iparity_i4.c
+++ b/libgfortran/generated/iparity_i4.c
@@ -167,9 +167,9 @@ iparity_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miparity_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siparity_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/iparity_i8.c b/libgfortran/generated/iparity_i8.c

index 3b8f55c439f4d0df8536600034dc05c192d50fdb..60e390e99b76883332ca1c96a665197cfaa27865 100644 (file)
--- a/libgfortran/generated/iparity_i8.c
+++ b/libgfortran/generated/iparity_i8.c
@@ -167,9 +167,9 @@ iparity_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ miparity_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ siparity_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc0_16_i1.c b/libgfortran/generated/maxloc0_16_i1.c

index 09d1f72c161f5fa53ae762116edac495fa7ef488..5fd888707a5c206c8dfa2479ee27693e9d2348cf 100644 (file)
--- a/libgfortran/generated/maxloc0_16_i1.c
+++ b/libgfortran/generated/maxloc0_16_i1.c
@@ -148,7 +148,7 @@ maxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_i16.c b/libgfortran/generated/maxloc0_16_i16.c

index f5626ecb9cc84a251d557f713f8014de1b999a86..2a4d5d1c9a3e0cd1f58c96cfc23194e89977559b 100644 (file)
--- a/libgfortran/generated/maxloc0_16_i16.c
+++ b/libgfortran/generated/maxloc0_16_i16.c
@@ -148,7 +148,7 @@ maxloc0_16_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_i2.c b/libgfortran/generated/maxloc0_16_i2.c

index d2f4d45734f54ae825badee70ea76c3d0a585e67..43e7065673131e72ef8f4e44fbd04ef7954b0411 100644 (file)
--- a/libgfortran/generated/maxloc0_16_i2.c
+++ b/libgfortran/generated/maxloc0_16_i2.c
@@ -148,7 +148,7 @@ maxloc0_16_i2 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_i2 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_i4.c b/libgfortran/generated/maxloc0_16_i4.c

index be2da162ab19664fcfc9e949e278cb381fb6748e..d7e539db540b41f57d156bde400e31e9ca772158 100644 (file)
--- a/libgfortran/generated/maxloc0_16_i4.c
+++ b/libgfortran/generated/maxloc0_16_i4.c
@@ -148,7 +148,7 @@ maxloc0_16_i4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_i4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_i8.c b/libgfortran/generated/maxloc0_16_i8.c

index de63fdf7ca3ea668e78976283f858fdeca296eb0..72afd48cb9f81321b5e7bbd4c67be064427e9325 100644 (file)
--- a/libgfortran/generated/maxloc0_16_i8.c
+++ b/libgfortran/generated/maxloc0_16_i8.c
@@ -148,7 +148,7 @@ maxloc0_16_i8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_i8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_r10.c b/libgfortran/generated/maxloc0_16_r10.c

index 8663b3251c2f7c05dd46ccd9d20d4a6698769096..670239b57dbfec4b249170445308d930d966d6cc 100644 (file)
--- a/libgfortran/generated/maxloc0_16_r10.c
+++ b/libgfortran/generated/maxloc0_16_r10.c
@@ -148,7 +148,7 @@ maxloc0_16_r10 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_r10 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_r16.c b/libgfortran/generated/maxloc0_16_r16.c

index f9cda989a25b166b2ebda97928b81c390093fa8a..aa98e7d85d26ae14215547560d7dc744fb729a51 100644 (file)
--- a/libgfortran/generated/maxloc0_16_r16.c
+++ b/libgfortran/generated/maxloc0_16_r16.c
@@ -148,7 +148,7 @@ maxloc0_16_r16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_r16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_r4.c b/libgfortran/generated/maxloc0_16_r4.c

index 2368b01c5137c86cab6768e6b1b95796cef99afd..006d593c08b7f8eef44510d83d77823537c2a2bb 100644 (file)
--- a/libgfortran/generated/maxloc0_16_r4.c
+++ b/libgfortran/generated/maxloc0_16_r4.c
@@ -148,7 +148,7 @@ maxloc0_16_r4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_r4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_16_r8.c b/libgfortran/generated/maxloc0_16_r8.c

index 168b0dc451c38550604ee094628b7a06f9902ab3..a8d44d5cd8567dd567565ad04aa605e5e36ae280 100644 (file)
--- a/libgfortran/generated/maxloc0_16_r8.c
+++ b/libgfortran/generated/maxloc0_16_r8.c
@@ -148,7 +148,7 @@ maxloc0_16_r8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_16_r8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_i1.c b/libgfortran/generated/maxloc0_4_i1.c

index 5059f23bd44c0c27b147db956aedbf61d1ef4efd..32caa2d0db7bd3e37cecafa17c486769a5af23ab 100644 (file)
--- a/libgfortran/generated/maxloc0_4_i1.c
+++ b/libgfortran/generated/maxloc0_4_i1.c
@@ -148,7 +148,7 @@ maxloc0_4_i1 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_i1 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_i16.c b/libgfortran/generated/maxloc0_4_i16.c

index 9951ebd294ac0b1ae86eeeea8ff913e37b1b816c..fb05f9c0b5467057c8c436fd4358258974f36fb4 100644 (file)
--- a/libgfortran/generated/maxloc0_4_i16.c
+++ b/libgfortran/generated/maxloc0_4_i16.c
@@ -148,7 +148,7 @@ maxloc0_4_i16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_i16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_i2.c b/libgfortran/generated/maxloc0_4_i2.c

index 8a905746c749721130ed22141b5f0d744a68989b..84520a99231c4af2db8a2cf1d98068f6319acfa2 100644 (file)
--- a/libgfortran/generated/maxloc0_4_i2.c
+++ b/libgfortran/generated/maxloc0_4_i2.c
@@ -148,7 +148,7 @@ maxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_i4.c b/libgfortran/generated/maxloc0_4_i4.c

index cfa1c177c4448d66fb7bec85de2faa6c8d687a9c..9d2e007a8189bb24dd61a5868b13f1360fb11636 100644 (file)
--- a/libgfortran/generated/maxloc0_4_i4.c
+++ b/libgfortran/generated/maxloc0_4_i4.c
@@ -148,7 +148,7 @@ maxloc0_4_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_i8.c b/libgfortran/generated/maxloc0_4_i8.c

index 0f79f0fc238f8c20f1a77aba298455b985b91f80..a2366733fad16fb9ce0fb58018f662dbd450748f 100644 (file)
--- a/libgfortran/generated/maxloc0_4_i8.c
+++ b/libgfortran/generated/maxloc0_4_i8.c
@@ -148,7 +148,7 @@ maxloc0_4_i8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_i8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_r10.c b/libgfortran/generated/maxloc0_4_r10.c

index 711d1e5b9f358e92160a8c7ced9a0a94a6e4036a..c1953ab1c0f2a99750696c7e5a6d6a2e7d39d1bb 100644 (file)
--- a/libgfortran/generated/maxloc0_4_r10.c
+++ b/libgfortran/generated/maxloc0_4_r10.c
@@ -148,7 +148,7 @@ maxloc0_4_r10 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_r10 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_r16.c b/libgfortran/generated/maxloc0_4_r16.c

index 3d96dd9eead0c83b99f923e8a940acd66d453709..d0221d7611e4c1b171d2eabc0888c94270ddffd4 100644 (file)
--- a/libgfortran/generated/maxloc0_4_r16.c
+++ b/libgfortran/generated/maxloc0_4_r16.c
@@ -148,7 +148,7 @@ maxloc0_4_r16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_r16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_r4.c b/libgfortran/generated/maxloc0_4_r4.c

index 292c0bfb031d230091c6f84a8df19c93ae975d72..9f3931a1bf71c90954d413bd22ab8c76dbe2f2ee 100644 (file)
--- a/libgfortran/generated/maxloc0_4_r4.c
+++ b/libgfortran/generated/maxloc0_4_r4.c
@@ -148,7 +148,7 @@ maxloc0_4_r4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_r4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_4_r8.c b/libgfortran/generated/maxloc0_4_r8.c

index b735ac02c514b7d60023deb997b4b648b7daa92a..dff5190e5a36aac46143b60a1f157b0f69d7d176 100644 (file)
--- a/libgfortran/generated/maxloc0_4_r8.c
+++ b/libgfortran/generated/maxloc0_4_r8.c
@@ -148,7 +148,7 @@ maxloc0_4_r8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_4_r8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_i1.c b/libgfortran/generated/maxloc0_8_i1.c

index 7ef8f7b08804dda0b12087cdfbe5d3421194259e..d5a66288f4825974af6ead53e4586778f196ae6f 100644 (file)
--- a/libgfortran/generated/maxloc0_8_i1.c
+++ b/libgfortran/generated/maxloc0_8_i1.c
@@ -148,7 +148,7 @@ maxloc0_8_i1 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_i1 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_i16.c b/libgfortran/generated/maxloc0_8_i16.c

index 65a378415ef1e20d61522958855429c07cb86c4a..ce2ad4910b602e8a81e480d6ffaee81e1e8aa50d 100644 (file)
--- a/libgfortran/generated/maxloc0_8_i16.c
+++ b/libgfortran/generated/maxloc0_8_i16.c
@@ -148,7 +148,7 @@ maxloc0_8_i16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_i16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_i2.c b/libgfortran/generated/maxloc0_8_i2.c

index afffe3f4e4d279c65363612f7de03e7e436c9ea4..f9c9732886f6840243a9a51f2e1892d190d72011 100644 (file)
--- a/libgfortran/generated/maxloc0_8_i2.c
+++ b/libgfortran/generated/maxloc0_8_i2.c
@@ -148,7 +148,7 @@ maxloc0_8_i2 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_i2 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_i4.c b/libgfortran/generated/maxloc0_8_i4.c

index 41d8d64a4bd483250af2de03d629a0deb7db30e0..cc9d94cf3114a95f5691339902b7c7afa6a28b4d 100644 (file)
--- a/libgfortran/generated/maxloc0_8_i4.c
+++ b/libgfortran/generated/maxloc0_8_i4.c
@@ -148,7 +148,7 @@ maxloc0_8_i4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_i4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_i8.c b/libgfortran/generated/maxloc0_8_i8.c

index 170cfe7bfeaa25837414ac477a496f42f5ff5cbb..c61fbedb8e2f5dbf0810f12949adf4640eb5dc3e 100644 (file)
--- a/libgfortran/generated/maxloc0_8_i8.c
+++ b/libgfortran/generated/maxloc0_8_i8.c
@@ -148,7 +148,7 @@ maxloc0_8_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_r10.c b/libgfortran/generated/maxloc0_8_r10.c

index 3333280402b5f83de35781cd105ccf4c9cb14ac4..07acd2540581c0968758d41cef52adce183a8e7f 100644 (file)
--- a/libgfortran/generated/maxloc0_8_r10.c
+++ b/libgfortran/generated/maxloc0_8_r10.c
@@ -148,7 +148,7 @@ maxloc0_8_r10 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_r10 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_r16.c b/libgfortran/generated/maxloc0_8_r16.c

index 4826fbfecc2b95e0927714ddefb6ef6c923fcc2c..5b98163b048cd42a2d0c0ef50a7b34a9b58f092a 100644 (file)
--- a/libgfortran/generated/maxloc0_8_r16.c
+++ b/libgfortran/generated/maxloc0_8_r16.c
@@ -148,7 +148,7 @@ maxloc0_8_r16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_r16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_r4.c b/libgfortran/generated/maxloc0_8_r4.c

index d0c9a33b9c1f4314108b572cb077e57afcfe1075..0caccea262a100b2b3069abbb987248664de1975 100644 (file)
--- a/libgfortran/generated/maxloc0_8_r4.c
+++ b/libgfortran/generated/maxloc0_8_r4.c
@@ -148,7 +148,7 @@ maxloc0_8_r4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_r4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc0_8_r8.c b/libgfortran/generated/maxloc0_8_r8.c

index 905472e3489bf579a63a8e47555af77d7e86cb8e..4e51b65e526d67520c5b5b5d4df6030d8ec962af 100644 (file)
--- a/libgfortran/generated/maxloc0_8_r8.c
+++ b/libgfortran/generated/maxloc0_8_r8.c
@@ -148,7 +148,7 @@ maxloc0_8_r8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mmaxloc0_8_r8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/maxloc1_16_i1.c b/libgfortran/generated/maxloc1_16_i1.c

index 1d54b1d0ab36f98fea87d6af35a02716d53da8a2..48f2fc01e5981f2468f7b9954d806b3623db21a7 100644 (file)
--- a/libgfortran/generated/maxloc1_16_i1.c
+++ b/libgfortran/generated/maxloc1_16_i1.c
@@ -188,9 +188,9 @@ maxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_i16.c b/libgfortran/generated/maxloc1_16_i16.c

index f6a8930537c6c7b3512243a17a7bd80cc3979168..6c154fb84e73257503eb1f760e51d9a8beb19bf1 100644 (file)
--- a/libgfortran/generated/maxloc1_16_i16.c
+++ b/libgfortran/generated/maxloc1_16_i16.c
@@ -188,9 +188,9 @@ maxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_i2.c b/libgfortran/generated/maxloc1_16_i2.c

index 595fa2c89503283a02b4eb567bb38b120a7d61fd..029e061e43c69de36155c821464b70b91db1d660 100644 (file)
--- a/libgfortran/generated/maxloc1_16_i2.c
+++ b/libgfortran/generated/maxloc1_16_i2.c
@@ -188,9 +188,9 @@ maxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_i4.c b/libgfortran/generated/maxloc1_16_i4.c

index 2d68405cd6ff0299e13575439455a225714ead34..aceb7aeb69b3bd289c690db8e10fa3318b99f33a 100644 (file)
--- a/libgfortran/generated/maxloc1_16_i4.c
+++ b/libgfortran/generated/maxloc1_16_i4.c
@@ -188,9 +188,9 @@ maxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_i8.c b/libgfortran/generated/maxloc1_16_i8.c

index 06b20750c5ae24d1d63f2dc9fa15c9860e118a39..000a0cf599ce71a6f5c0b61ad51457272ee9d7f7 100644 (file)
--- a/libgfortran/generated/maxloc1_16_i8.c
+++ b/libgfortran/generated/maxloc1_16_i8.c
@@ -188,9 +188,9 @@ maxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_r10.c b/libgfortran/generated/maxloc1_16_r10.c

index 896de8ac9ff0e0d31c8a1ea44898706b2f90ff77..53378d958e298496f5936ae2e2d01389ba6eab84 100644 (file)
--- a/libgfortran/generated/maxloc1_16_r10.c
+++ b/libgfortran/generated/maxloc1_16_r10.c
@@ -188,9 +188,9 @@ maxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_r16.c b/libgfortran/generated/maxloc1_16_r16.c

index 93cddf4c5942bf720cebda203b6e0e0173aae036..4bdc4d66b893d2ae51c06c7ea743c47962091dda 100644 (file)
--- a/libgfortran/generated/maxloc1_16_r16.c
+++ b/libgfortran/generated/maxloc1_16_r16.c
@@ -188,9 +188,9 @@ maxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_r4.c b/libgfortran/generated/maxloc1_16_r4.c

index 42419b75eeb13e8cd940abfeb7dee8539bfe6244..36d79e23ce3a0a1e0093ab92b356effb8062a07a 100644 (file)
--- a/libgfortran/generated/maxloc1_16_r4.c
+++ b/libgfortran/generated/maxloc1_16_r4.c
@@ -188,9 +188,9 @@ maxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_16_r8.c b/libgfortran/generated/maxloc1_16_r8.c

index db0d6a3f62970f524b7acd628b560c2672b3b1ea..3993f77619bd861947015f728d2a9d4e1c2f2afd 100644 (file)
--- a/libgfortran/generated/maxloc1_16_r8.c
+++ b/libgfortran/generated/maxloc1_16_r8.c
@@ -188,9 +188,9 @@ maxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_i1.c b/libgfortran/generated/maxloc1_4_i1.c

index 284116abe5288c49107be031fea9fa549c8104b4..05d2af4be3e1184f16439f7a8f96217669617679 100644 (file)
--- a/libgfortran/generated/maxloc1_4_i1.c
+++ b/libgfortran/generated/maxloc1_4_i1.c
@@ -188,9 +188,9 @@ maxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_i16.c b/libgfortran/generated/maxloc1_4_i16.c

index 48c27674bc8215f88633d44a5b65461680f26d12..67e8a9ca2c7e5a8be83d45ba091e9ede5943aac5 100644 (file)
--- a/libgfortran/generated/maxloc1_4_i16.c
+++ b/libgfortran/generated/maxloc1_4_i16.c
@@ -188,9 +188,9 @@ maxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_i2.c b/libgfortran/generated/maxloc1_4_i2.c

index b9c9a010d98c4894ba9216fde270958e0c8e51b9..60ceaa698f4ec1d0cf4f1c814ea982ffd59eb434 100644 (file)
--- a/libgfortran/generated/maxloc1_4_i2.c
+++ b/libgfortran/generated/maxloc1_4_i2.c
@@ -188,9 +188,9 @@ maxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_i4.c b/libgfortran/generated/maxloc1_4_i4.c

index 5222bc39ecdcd175b33dedb409ede5a82809aac5..d2f30b7246a03342dcb7a57c3c9edbad4774b283 100644 (file)
--- a/libgfortran/generated/maxloc1_4_i4.c
+++ b/libgfortran/generated/maxloc1_4_i4.c
@@ -188,9 +188,9 @@ maxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_i8.c b/libgfortran/generated/maxloc1_4_i8.c

index f9f067f18ef47ceb18fe863a06fbef716c7b23f4..13a7dc6d34c7c371a51c7fb555b64c0a83adcd5b 100644 (file)
--- a/libgfortran/generated/maxloc1_4_i8.c
+++ b/libgfortran/generated/maxloc1_4_i8.c
@@ -188,9 +188,9 @@ maxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_r10.c b/libgfortran/generated/maxloc1_4_r10.c

index 8baf3376d48d84103ff4f51efb215e4f4f399248..204229293c4c96e18ba9eb1eae5dfe4117ea0415 100644 (file)
--- a/libgfortran/generated/maxloc1_4_r10.c
+++ b/libgfortran/generated/maxloc1_4_r10.c
@@ -188,9 +188,9 @@ maxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_r16.c b/libgfortran/generated/maxloc1_4_r16.c

index 03aa2abe348f0eaca4a59ea04e38eabd3b2f6b97..95076481c1041fd2b6c6560de8fc96a408ad3237 100644 (file)
--- a/libgfortran/generated/maxloc1_4_r16.c
+++ b/libgfortran/generated/maxloc1_4_r16.c
@@ -188,9 +188,9 @@ maxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_r4.c b/libgfortran/generated/maxloc1_4_r4.c

index 94c3260b46cdd08cb783ecfaa97dd7660f8efbff..87c6ca5eb4024c887996a91c828587d3ab0a4f66 100644 (file)
--- a/libgfortran/generated/maxloc1_4_r4.c
+++ b/libgfortran/generated/maxloc1_4_r4.c
@@ -188,9 +188,9 @@ maxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_4_r8.c b/libgfortran/generated/maxloc1_4_r8.c

index 11f71ee34962ad4222e793637fe09fa96454ce9c..a13986a1fa859d2bb336a5df9a8cd5251f2b06b9 100644 (file)
--- a/libgfortran/generated/maxloc1_4_r8.c
+++ b/libgfortran/generated/maxloc1_4_r8.c
@@ -188,9 +188,9 @@ maxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_i1.c b/libgfortran/generated/maxloc1_8_i1.c

index a46ddab573228ccece799f1877dd09118c251d60..71a5d97efe4fd17da4a1e946d214a9d01d4cc3ba 100644 (file)
--- a/libgfortran/generated/maxloc1_8_i1.c
+++ b/libgfortran/generated/maxloc1_8_i1.c
@@ -188,9 +188,9 @@ maxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_i16.c b/libgfortran/generated/maxloc1_8_i16.c

index 0e04e8ca2020dd0ccd2ebd9313e5e4b60fb16760..92cf55c4e2ce8e56995add74fd8239eebe5d73df 100644 (file)
--- a/libgfortran/generated/maxloc1_8_i16.c
+++ b/libgfortran/generated/maxloc1_8_i16.c
@@ -188,9 +188,9 @@ maxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_i2.c b/libgfortran/generated/maxloc1_8_i2.c

index d29c7ec294e653d25efa327e3a795cc3ac4bd20f..fd1063c5df170025e9d6d2ae26e2441e0f62491a 100644 (file)
--- a/libgfortran/generated/maxloc1_8_i2.c
+++ b/libgfortran/generated/maxloc1_8_i2.c
@@ -188,9 +188,9 @@ maxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_i4.c b/libgfortran/generated/maxloc1_8_i4.c

index c477cdc60d41fea3864baa39259608f4ddb7ab58..db82ae894aec9c477a58d3335450a41080a48293 100644 (file)
--- a/libgfortran/generated/maxloc1_8_i4.c
+++ b/libgfortran/generated/maxloc1_8_i4.c
@@ -188,9 +188,9 @@ maxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_i8.c b/libgfortran/generated/maxloc1_8_i8.c

index 5af011a09761c10705c3169fe60cfd6c6c13ff1e..43b4af1479263cf79dd1dbc154c2b56c7d36cdd0 100644 (file)
--- a/libgfortran/generated/maxloc1_8_i8.c
+++ b/libgfortran/generated/maxloc1_8_i8.c
@@ -188,9 +188,9 @@ maxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_r10.c b/libgfortran/generated/maxloc1_8_r10.c

index 0f352b2508a3cdc17060e3449f2193afe12c92a6..9ba6cb950e4109a739871ed1882e47b3784f9fd9 100644 (file)
--- a/libgfortran/generated/maxloc1_8_r10.c
+++ b/libgfortran/generated/maxloc1_8_r10.c
@@ -188,9 +188,9 @@ maxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_r16.c b/libgfortran/generated/maxloc1_8_r16.c

index 57e4ce4a6c7e82812a0866fe03ac676423e122b7..f7eb1ebf9be14e81d8c15ce9f5aa2eb526ce8b07 100644 (file)
--- a/libgfortran/generated/maxloc1_8_r16.c
+++ b/libgfortran/generated/maxloc1_8_r16.c
@@ -188,9 +188,9 @@ maxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_r4.c b/libgfortran/generated/maxloc1_8_r4.c

index a74fa5c7633f622d4d9f7776955823e5723a78d1..67b455bb7356a3db6284dd1ba3b3a123f7ad9935 100644 (file)
--- a/libgfortran/generated/maxloc1_8_r4.c
+++ b/libgfortran/generated/maxloc1_8_r4.c
@@ -188,9 +188,9 @@ maxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxloc1_8_r8.c b/libgfortran/generated/maxloc1_8_r8.c

index a7a1bf79d234d4d127852e448eb4bd04c576a3b1..bd0913f4feafb78d8cf4a00d083d0ce5005c4c81 100644 (file)
--- a/libgfortran/generated/maxloc1_8_r8.c
+++ b/libgfortran/generated/maxloc1_8_r8.c
@@ -188,9 +188,9 @@ maxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mmaxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ smaxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_i1.c b/libgfortran/generated/maxval_i1.c

index 5593ffeca959e58e9c4661b59c244b36a39603c4..90ddf3503784b0153a954b170aebfe26ec29b92e 100644 (file)
--- a/libgfortran/generated/maxval_i1.c
+++ b/libgfortran/generated/maxval_i1.c
@@ -181,9 +181,9 @@ maxval_i1 (gfc_array_i1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_i1 (gfc_array_i1 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_i1 (gfc_array_i1 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_i16.c b/libgfortran/generated/maxval_i16.c

index fa2536de34f2cdc0b5965e63fe559ca17f854a51..6a54739e2909473a9245fc93335c03d16e5933be 100644 (file)
--- a/libgfortran/generated/maxval_i16.c
+++ b/libgfortran/generated/maxval_i16.c
@@ -181,9 +181,9 @@ maxval_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_i2.c b/libgfortran/generated/maxval_i2.c

index ed90dad9fa06dbb7eb99d447b23034da1b9b4f9f..3cdb5b9d3eded15291312d4d36d003a0d86badf3 100644 (file)
--- a/libgfortran/generated/maxval_i2.c
+++ b/libgfortran/generated/maxval_i2.c
@@ -181,9 +181,9 @@ maxval_i2 (gfc_array_i2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_i2 (gfc_array_i2 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_i2 (gfc_array_i2 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_i4.c b/libgfortran/generated/maxval_i4.c

index 67c7b0e37d131e79d50b8eea2faacf52ad43e4be..d7ae9951a4ae63a41cd2ca20ab68eed2a619da9f 100644 (file)
--- a/libgfortran/generated/maxval_i4.c
+++ b/libgfortran/generated/maxval_i4.c
@@ -181,9 +181,9 @@ maxval_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_i8.c b/libgfortran/generated/maxval_i8.c

index 9cad4e3fff68d119faa4c7349b59f3a285f38342..d622da09b272906a4a1eea2c656b93eaa1c06bd9 100644 (file)
--- a/libgfortran/generated/maxval_i8.c
+++ b/libgfortran/generated/maxval_i8.c
@@ -181,9 +181,9 @@ maxval_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_r10.c b/libgfortran/generated/maxval_r10.c

index 96f77b73527be9fe19dabaa161a6bb2b2135992a..9c4c6fbb26cbda1c2b064c3ecb8c7efe2beea20e 100644 (file)
--- a/libgfortran/generated/maxval_r10.c
+++ b/libgfortran/generated/maxval_r10.c
@@ -181,9 +181,9 @@ maxval_r10 (gfc_array_r10 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_r10 (gfc_array_r10 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_r10 (gfc_array_r10 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_r16.c b/libgfortran/generated/maxval_r16.c

index 6416040744b663ab22acb56cf6f9e4f9ddd9637d..f10573233e33bde75eceec70ab294023af9b5307 100644 (file)
--- a/libgfortran/generated/maxval_r16.c
+++ b/libgfortran/generated/maxval_r16.c
@@ -181,9 +181,9 @@ maxval_r16 (gfc_array_r16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_r16 (gfc_array_r16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_r16 (gfc_array_r16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_r4.c b/libgfortran/generated/maxval_r4.c

index ec5b1ac3e1b314438cfd036f01b6e9d224bbec3c..94d4f335a199fea0ed2146771fd6f0e258242bd8 100644 (file)
--- a/libgfortran/generated/maxval_r4.c
+++ b/libgfortran/generated/maxval_r4.c
@@ -181,9 +181,9 @@ maxval_r4 (gfc_array_r4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_r4 (gfc_array_r4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_r4 (gfc_array_r4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/maxval_r8.c b/libgfortran/generated/maxval_r8.c

index 8788420dca3584d047266fc14e233851f23a30da..5ba70b62edb6e9edc1f43d9efacf657caf8c3df3 100644 (file)
--- a/libgfortran/generated/maxval_r8.c
+++ b/libgfortran/generated/maxval_r8.c
@@ -181,9 +181,9 @@ maxval_r8 (gfc_array_r8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mmaxval_r8 (gfc_array_r8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ smaxval_r8 (gfc_array_r8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc0_16_i1.c b/libgfortran/generated/minloc0_16_i1.c

index 7fb5c6e0b24724aef635b61f7c9f65e0794b2392..e458174b2852e90d09df10faca6a6a14ace297e7 100644 (file)
--- a/libgfortran/generated/minloc0_16_i1.c
+++ b/libgfortran/generated/minloc0_16_i1.c
@@ -148,7 +148,7 @@ minloc0_16_i1 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_i1 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_i16.c b/libgfortran/generated/minloc0_16_i16.c

index 4bdf9a09db8841cf2bbef29e0f45cb397648c360..b15ec83670ed2fa3aa90367a54810bd6e6e1b48c 100644 (file)
--- a/libgfortran/generated/minloc0_16_i16.c
+++ b/libgfortran/generated/minloc0_16_i16.c
@@ -148,7 +148,7 @@ minloc0_16_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_i2.c b/libgfortran/generated/minloc0_16_i2.c

index f01afcaae28a3e2c5b1681e560b1bf90b2ba2eb5..b54495280ded2f7cb53f9b8fed3aadce8e3d13dc 100644 (file)
--- a/libgfortran/generated/minloc0_16_i2.c
+++ b/libgfortran/generated/minloc0_16_i2.c
@@ -148,7 +148,7 @@ minloc0_16_i2 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_i2 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_i4.c b/libgfortran/generated/minloc0_16_i4.c

index b2b5c8a3d9154ee8261fffda5061a0e79651e4ee..5fa12c924e4a5b188ee570eb3677aa9af4369a48 100644 (file)
--- a/libgfortran/generated/minloc0_16_i4.c
+++ b/libgfortran/generated/minloc0_16_i4.c
@@ -148,7 +148,7 @@ minloc0_16_i4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_i4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_i8.c b/libgfortran/generated/minloc0_16_i8.c

index 7ae23368fefa48483ac9ea82f2d800c036ab9822..b8aefae9e61130e607a0e2c5d8b6d5b47152bb6c 100644 (file)
--- a/libgfortran/generated/minloc0_16_i8.c
+++ b/libgfortran/generated/minloc0_16_i8.c
@@ -148,7 +148,7 @@ minloc0_16_i8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_i8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_r10.c b/libgfortran/generated/minloc0_16_r10.c

index 5388bb3cb87427174f65698260a2183f35d7be8e..801b9e64131247b32d9a970cf7dc79dc66b227c2 100644 (file)
--- a/libgfortran/generated/minloc0_16_r10.c
+++ b/libgfortran/generated/minloc0_16_r10.c
@@ -148,7 +148,7 @@ minloc0_16_r10 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_r10 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_r16.c b/libgfortran/generated/minloc0_16_r16.c

index 3aca587355b876ce4de734727e0ef6d50d75ac6a..499292fb213cdcb094604e5f2d80126a3ac14afb 100644 (file)
--- a/libgfortran/generated/minloc0_16_r16.c
+++ b/libgfortran/generated/minloc0_16_r16.c
@@ -148,7 +148,7 @@ minloc0_16_r16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_r16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_r4.c b/libgfortran/generated/minloc0_16_r4.c

index 88f4cdbb8e72fbb038530b33624b7adb9911f8ea..d4377d45e75092e058b66799c74d100f72b7e8f3 100644 (file)
--- a/libgfortran/generated/minloc0_16_r4.c
+++ b/libgfortran/generated/minloc0_16_r4.c
@@ -148,7 +148,7 @@ minloc0_16_r4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_r4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_16_r8.c b/libgfortran/generated/minloc0_16_r8.c

index a360b595426e5bbb12b1f89c2e52c6627c6b0e0e..43e2c7fc0a637509b294059239c8d77664427984 100644 (file)
--- a/libgfortran/generated/minloc0_16_r8.c
+++ b/libgfortran/generated/minloc0_16_r8.c
@@ -148,7 +148,7 @@ minloc0_16_r8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_16_r8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_i1.c b/libgfortran/generated/minloc0_4_i1.c

index 470d2eab98f7feb2534195f05ad2655087a7d971..756c2dc86d15da4a9d8d419ffc48d911b41acef0 100644 (file)
--- a/libgfortran/generated/minloc0_4_i1.c
+++ b/libgfortran/generated/minloc0_4_i1.c
@@ -148,7 +148,7 @@ minloc0_4_i1 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_i1 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_i16.c b/libgfortran/generated/minloc0_4_i16.c

index 8dcea5ec11dab47e004b661d4683688db3dd099d..3e38c724148c071ecad4eccadf2b84eb58681a29 100644 (file)
--- a/libgfortran/generated/minloc0_4_i16.c
+++ b/libgfortran/generated/minloc0_4_i16.c
@@ -148,7 +148,7 @@ minloc0_4_i16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_i16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_i2.c b/libgfortran/generated/minloc0_4_i2.c

index 1e9e154de9900000413128adcc697398e6b1b5a4..c8136b66f340645e0fc920d399ff0e2427182e61 100644 (file)
--- a/libgfortran/generated/minloc0_4_i2.c
+++ b/libgfortran/generated/minloc0_4_i2.c
@@ -148,7 +148,7 @@ minloc0_4_i2 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_i2 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_i4.c b/libgfortran/generated/minloc0_4_i4.c

index 7e80a494da75584c0a4c4e420119b1020786e1a2..a0afc1a8b3e5ec3334ca1325119867402a4b2e19 100644 (file)
--- a/libgfortran/generated/minloc0_4_i4.c
+++ b/libgfortran/generated/minloc0_4_i4.c
@@ -148,7 +148,7 @@ minloc0_4_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_i8.c b/libgfortran/generated/minloc0_4_i8.c

index f0a9ed3588c109229285c9e5e5a8d2aa93602427..21b818f169d8836ef1ba3a00dac809a035beae31 100644 (file)
--- a/libgfortran/generated/minloc0_4_i8.c
+++ b/libgfortran/generated/minloc0_4_i8.c
@@ -148,7 +148,7 @@ minloc0_4_i8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_i8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_r10.c b/libgfortran/generated/minloc0_4_r10.c

index dd0bdf2ea776444b4300a051faf203431429eb44..6b86186cf040cefe142039e2768d557d4b5725df 100644 (file)
--- a/libgfortran/generated/minloc0_4_r10.c
+++ b/libgfortran/generated/minloc0_4_r10.c
@@ -148,7 +148,7 @@ minloc0_4_r10 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_r10 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_r16.c b/libgfortran/generated/minloc0_4_r16.c

index d3a2e57af20359c554a23a44daa476a87f1799e3..ca3ca9d02dc4d6440869380f17075a70c70dd683 100644 (file)
--- a/libgfortran/generated/minloc0_4_r16.c
+++ b/libgfortran/generated/minloc0_4_r16.c
@@ -148,7 +148,7 @@ minloc0_4_r16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_r16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_r4.c b/libgfortran/generated/minloc0_4_r4.c

index f507e796606bb1551a5ac38cf3272a067430eef4..f33c455a9a80d6303bb4a16b4ec6f61ba3005b47 100644 (file)
--- a/libgfortran/generated/minloc0_4_r4.c
+++ b/libgfortran/generated/minloc0_4_r4.c
@@ -148,7 +148,7 @@ minloc0_4_r4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_r4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_4_r8.c b/libgfortran/generated/minloc0_4_r8.c

index 97eff1d3bb0dc8f5d23fddbf14e00dce845252ed..6658b01b3df95e986b3ba34ddd6f7404998e5c10 100644 (file)
--- a/libgfortran/generated/minloc0_4_r8.c
+++ b/libgfortran/generated/minloc0_4_r8.c
@@ -148,7 +148,7 @@ minloc0_4_r8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_4_r8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_i1.c b/libgfortran/generated/minloc0_8_i1.c

index 988e2771298c3a09f1a436635c3c74772b6e754c..8f0c48d08045e6c08fe7acec47d2b1dd45ff17f8 100644 (file)
--- a/libgfortran/generated/minloc0_8_i1.c
+++ b/libgfortran/generated/minloc0_8_i1.c
@@ -148,7 +148,7 @@ minloc0_8_i1 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_i1 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_i16.c b/libgfortran/generated/minloc0_8_i16.c

index 82e61a056b6a84a2c6bc70cba7ec3d4e08b7a9a6..50f5f861581f0d3d8c348748f6ab5f8e918bb2cc 100644 (file)
--- a/libgfortran/generated/minloc0_8_i16.c
+++ b/libgfortran/generated/minloc0_8_i16.c
@@ -148,7 +148,7 @@ minloc0_8_i16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_i16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_i2.c b/libgfortran/generated/minloc0_8_i2.c

index d6055820c8a63f5199d66e5cadf185d1ae693a3f..936cdf5d8d7771feeca8fe57e1a9ef1f2dc17184 100644 (file)
--- a/libgfortran/generated/minloc0_8_i2.c
+++ b/libgfortran/generated/minloc0_8_i2.c
@@ -148,7 +148,7 @@ minloc0_8_i2 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_i2 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_i4.c b/libgfortran/generated/minloc0_8_i4.c

index ff62da4e48f92279260f34be4ac9fc02917d186e..d6df3158b95cb42bd116a292f983d7b7553232d8 100644 (file)
--- a/libgfortran/generated/minloc0_8_i4.c
+++ b/libgfortran/generated/minloc0_8_i4.c
@@ -148,7 +148,7 @@ minloc0_8_i4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_i4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_i8.c b/libgfortran/generated/minloc0_8_i8.c

index bb6420998a683e4afe84a0211dcae6d992ceabe3..df59e0933c27dba0a99954241385cb45cae5930b 100644 (file)
--- a/libgfortran/generated/minloc0_8_i8.c
+++ b/libgfortran/generated/minloc0_8_i8.c
@@ -148,7 +148,7 @@ minloc0_8_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_r10.c b/libgfortran/generated/minloc0_8_r10.c

index 527523a48f1210802c43b531ec2968d9d01749b6..b57bc8d260b479c262d16006c6ee97a5b0d3ce47 100644 (file)
--- a/libgfortran/generated/minloc0_8_r10.c
+++ b/libgfortran/generated/minloc0_8_r10.c
@@ -148,7 +148,7 @@ minloc0_8_r10 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_r10 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_r16.c b/libgfortran/generated/minloc0_8_r16.c

index 096fce480ff6a823e2c1910a701ae8a2ec673699..d76b290f870e4f65cd4014b8f57664e6613480c0 100644 (file)
--- a/libgfortran/generated/minloc0_8_r16.c
+++ b/libgfortran/generated/minloc0_8_r16.c
@@ -148,7 +148,7 @@ minloc0_8_r16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_r16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_r4.c b/libgfortran/generated/minloc0_8_r4.c

index d9320d8854b8a9ca5bf836158d1863df5e954fee..ff3f300f701aa931aa2d1547b1ec48e86cad3c81 100644 (file)
--- a/libgfortran/generated/minloc0_8_r4.c
+++ b/libgfortran/generated/minloc0_8_r4.c
@@ -148,7 +148,7 @@ minloc0_8_r4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_r4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc0_8_r8.c b/libgfortran/generated/minloc0_8_r8.c

index 7917597adb04ccf6bb2801cd9e71fbea0af665da..e13239037da5ac7e12404052ceadb0451df00202 100644 (file)
--- a/libgfortran/generated/minloc0_8_r8.c
+++ b/libgfortran/generated/minloc0_8_r8.c
@@ -148,7 +148,7 @@ minloc0_8_r8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -315,7 +315,7 @@ mminloc0_8_r8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/generated/minloc1_16_i1.c b/libgfortran/generated/minloc1_16_i1.c

index a2a2560562b6e3df0af64459a3f710e679283329..bf6be092e8583fe8bba7a287999d9fe3eb996b23 100644 (file)
--- a/libgfortran/generated/minloc1_16_i1.c
+++ b/libgfortran/generated/minloc1_16_i1.c
@@ -188,9 +188,9 @@ minloc1_16_i1 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_i1 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_i1 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_i16.c b/libgfortran/generated/minloc1_16_i16.c

index 23170e412fad6f9b7ff50e121728fdefe9c98774..e4d9dab0b7ff69b9025831fb9750abce0ab36a14 100644 (file)
--- a/libgfortran/generated/minloc1_16_i16.c
+++ b/libgfortran/generated/minloc1_16_i16.c
@@ -188,9 +188,9 @@ minloc1_16_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_i2.c b/libgfortran/generated/minloc1_16_i2.c

index ac14c6a7e623ac5d55e1dc11b2c13b972534d0d9..450142f7a82d3918912181d771974fa50bad04a9 100644 (file)
--- a/libgfortran/generated/minloc1_16_i2.c
+++ b/libgfortran/generated/minloc1_16_i2.c
@@ -188,9 +188,9 @@ minloc1_16_i2 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_i2 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_i2 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_i4.c b/libgfortran/generated/minloc1_16_i4.c

index 14ba2c858821ea62dce7c0d3e49fba088a4a934c..e1ca90f803b07485973b40e42b71a4f2ce3be98b 100644 (file)
--- a/libgfortran/generated/minloc1_16_i4.c
+++ b/libgfortran/generated/minloc1_16_i4.c
@@ -188,9 +188,9 @@ minloc1_16_i4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_i4 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_i4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_i8.c b/libgfortran/generated/minloc1_16_i8.c

index f68995826634b5313c4ad09fe23e980827c51784..b5212041d7305516ab03f29aca9da00bb3e3fb55 100644 (file)
--- a/libgfortran/generated/minloc1_16_i8.c
+++ b/libgfortran/generated/minloc1_16_i8.c
@@ -188,9 +188,9 @@ minloc1_16_i8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_i8 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_i8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_r10.c b/libgfortran/generated/minloc1_16_r10.c

index cd22b3be2b6d0d9e1957f6926aefc076c8c3105a..880bb7e2986dcfc0955a0bb0c622ae751c51aadb 100644 (file)
--- a/libgfortran/generated/minloc1_16_r10.c
+++ b/libgfortran/generated/minloc1_16_r10.c
@@ -188,9 +188,9 @@ minloc1_16_r10 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_r10 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_r10 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_r16.c b/libgfortran/generated/minloc1_16_r16.c

index 63fadc354fd32283cf9ecf70820dbab5b5784872..4343508d4a091d6ca34a8c59d8d640e587e3d7f4 100644 (file)
--- a/libgfortran/generated/minloc1_16_r16.c
+++ b/libgfortran/generated/minloc1_16_r16.c
@@ -188,9 +188,9 @@ minloc1_16_r16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_r16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_r16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_r4.c b/libgfortran/generated/minloc1_16_r4.c

index eaf4687acc611ff7ccbe799246e7dd0ae9539734..b2fb09c92e9d6bcf450d1df82ed85137846141cf 100644 (file)
--- a/libgfortran/generated/minloc1_16_r4.c
+++ b/libgfortran/generated/minloc1_16_r4.c
@@ -188,9 +188,9 @@ minloc1_16_r4 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_r4 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_r4 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_16_r8.c b/libgfortran/generated/minloc1_16_r8.c

index ad7c69a6bccb6a9e5a289863d10d12ecbdaf010c..f62cf33715309d575da94cb9ba1320bc252c840d 100644 (file)
--- a/libgfortran/generated/minloc1_16_r8.c
+++ b/libgfortran/generated/minloc1_16_r8.c
@@ -188,9 +188,9 @@ minloc1_16_r8 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_16_r8 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_16_r8 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_i1.c b/libgfortran/generated/minloc1_4_i1.c

index 025949c5fe5c553a46af5aa866fe29fd29dab499..5bf2dbacdc4c64210bae53531a8bfc08a955d8e6 100644 (file)
--- a/libgfortran/generated/minloc1_4_i1.c
+++ b/libgfortran/generated/minloc1_4_i1.c
@@ -188,9 +188,9 @@ minloc1_4_i1 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_i1 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_i1 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_i16.c b/libgfortran/generated/minloc1_4_i16.c

index 0fe8bedaa28d43ddbf41fed4ba16a8402355795d..c8925879e9c58ace4a2a1c1cecef53d3c3a69ea3 100644 (file)
--- a/libgfortran/generated/minloc1_4_i16.c
+++ b/libgfortran/generated/minloc1_4_i16.c
@@ -188,9 +188,9 @@ minloc1_4_i16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_i16 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_i16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_i2.c b/libgfortran/generated/minloc1_4_i2.c

index 02a59927a95abb6d0b7a48d388d284997d8baf7f..42d5afaf3d2cc89416b46b78fe7c845c66e0d040 100644 (file)
--- a/libgfortran/generated/minloc1_4_i2.c
+++ b/libgfortran/generated/minloc1_4_i2.c
@@ -188,9 +188,9 @@ minloc1_4_i2 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_i2 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_i2 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_i4.c b/libgfortran/generated/minloc1_4_i4.c

index db38835bd24a833640cb1120a59864098f148683..456ea792b3ff935129e6c8ab805b5a25ecb8ca58 100644 (file)
--- a/libgfortran/generated/minloc1_4_i4.c
+++ b/libgfortran/generated/minloc1_4_i4.c
@@ -188,9 +188,9 @@ minloc1_4_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_i8.c b/libgfortran/generated/minloc1_4_i8.c

index 88719e20928cc6ad70087fa2dba75ab9b6795a66..a65195dcc3f429547f1875da60da93eec6c2dd1f 100644 (file)
--- a/libgfortran/generated/minloc1_4_i8.c
+++ b/libgfortran/generated/minloc1_4_i8.c
@@ -188,9 +188,9 @@ minloc1_4_i8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_i8 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_i8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_r10.c b/libgfortran/generated/minloc1_4_r10.c

index 8eec1bdf26eb1e6de072e165ff8684aab62aa390..b106e97dde85552f1dad7579f2f72f36f3d93a57 100644 (file)
--- a/libgfortran/generated/minloc1_4_r10.c
+++ b/libgfortran/generated/minloc1_4_r10.c
@@ -188,9 +188,9 @@ minloc1_4_r10 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_r10 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_r10 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_r16.c b/libgfortran/generated/minloc1_4_r16.c

index 44b09b65c8d4dc2beb8e625f342862aab17b926c..b1ef3b3ee6220f009dced3a8fde076e9f2908fc5 100644 (file)
--- a/libgfortran/generated/minloc1_4_r16.c
+++ b/libgfortran/generated/minloc1_4_r16.c
@@ -188,9 +188,9 @@ minloc1_4_r16 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_r16 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_r16 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_r4.c b/libgfortran/generated/minloc1_4_r4.c

index ca95245ea49f4482eeae0f090b57e9f407bade95..9ddf490d68bfe94ee847b145b5ba6162f09e6ce8 100644 (file)
--- a/libgfortran/generated/minloc1_4_r4.c
+++ b/libgfortran/generated/minloc1_4_r4.c
@@ -188,9 +188,9 @@ minloc1_4_r4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_r4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_r4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_4_r8.c b/libgfortran/generated/minloc1_4_r8.c

index 157220804407e766e2a8a0fb695581d3dd0a0a3d..0619ac6f0a78d7cd7ee29585a1a83c7997bdb734 100644 (file)
--- a/libgfortran/generated/minloc1_4_r8.c
+++ b/libgfortran/generated/minloc1_4_r8.c
@@ -188,9 +188,9 @@ minloc1_4_r8 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_4_r8 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_4_r8 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_i1.c b/libgfortran/generated/minloc1_8_i1.c

index 707e5fb194db254833aa298dbd8c47ed300a36a8..27c7fa9e350307c406b5725eb7e739c9998c4c8a 100644 (file)
--- a/libgfortran/generated/minloc1_8_i1.c
+++ b/libgfortran/generated/minloc1_8_i1.c
@@ -188,9 +188,9 @@ minloc1_8_i1 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_i1 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_i1 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_i16.c b/libgfortran/generated/minloc1_8_i16.c

index 9acb3e3c58a6781f2ef337fe4021c46cc4368c0f..274b17e45f971761dbb2b4c023242d20dfc44ba6 100644 (file)
--- a/libgfortran/generated/minloc1_8_i16.c
+++ b/libgfortran/generated/minloc1_8_i16.c
@@ -188,9 +188,9 @@ minloc1_8_i16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_i16 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_i16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_i2.c b/libgfortran/generated/minloc1_8_i2.c

index 918f09fee36d8c38aeb0a0bbe4273338c5d17e51..416622c36e72c8dce39c33ef0a451185b2857765 100644 (file)
--- a/libgfortran/generated/minloc1_8_i2.c
+++ b/libgfortran/generated/minloc1_8_i2.c
@@ -188,9 +188,9 @@ minloc1_8_i2 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_i2 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_i2 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_i4.c b/libgfortran/generated/minloc1_8_i4.c

index 53b0208b9dfa622c195c9aadfd3112c618d6cb28..ff67899917c72159393ac60692424b2a4162f5a5 100644 (file)
--- a/libgfortran/generated/minloc1_8_i4.c
+++ b/libgfortran/generated/minloc1_8_i4.c
@@ -188,9 +188,9 @@ minloc1_8_i4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_i4 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_i4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_i8.c b/libgfortran/generated/minloc1_8_i8.c

index b967c5ff597211ff1f7faf9e38e7b82ee938774c..c4247ac7f177a8a7cd68c8023e302aababf56181 100644 (file)
--- a/libgfortran/generated/minloc1_8_i8.c
+++ b/libgfortran/generated/minloc1_8_i8.c
@@ -188,9 +188,9 @@ minloc1_8_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_r10.c b/libgfortran/generated/minloc1_8_r10.c

index 8787a2568e646a0cff20f107691f21e35eacf59e..c57f72aabe6a87fb454dec91c6c3aa1dff910c6b 100644 (file)
--- a/libgfortran/generated/minloc1_8_r10.c
+++ b/libgfortran/generated/minloc1_8_r10.c
@@ -188,9 +188,9 @@ minloc1_8_r10 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_r10 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_r10 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_r16.c b/libgfortran/generated/minloc1_8_r16.c

index c4b1b4f660dde99778e764c2257102325aaf9432..c1d2cd2a88e1a8a5edb0dd242e0b32c438c9fc41 100644 (file)
--- a/libgfortran/generated/minloc1_8_r16.c
+++ b/libgfortran/generated/minloc1_8_r16.c
@@ -188,9 +188,9 @@ minloc1_8_r16 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_r16 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_r16 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_r4.c b/libgfortran/generated/minloc1_8_r4.c

index 1e8ccc164bb412ecf9bd29fa64b53bb66657cd9c..c1faa797d4cb5693b426367eb6c3cdcb4fe0a9fa 100644 (file)
--- a/libgfortran/generated/minloc1_8_r4.c
+++ b/libgfortran/generated/minloc1_8_r4.c
@@ -188,9 +188,9 @@ minloc1_8_r4 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_r4 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_r4 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minloc1_8_r8.c b/libgfortran/generated/minloc1_8_r8.c

index 1363e565dede0523daa10b4d14fe2365cb0bcc96..e7c5ee19ad193debf6a162d3d363a122d4be5080 100644 (file)
--- a/libgfortran/generated/minloc1_8_r8.c
+++ b/libgfortran/generated/minloc1_8_r8.c
@@ -188,9 +188,9 @@ minloc1_8_r8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -398,9 +398,9 @@ mminloc1_8_r8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -538,7 +538,7 @@ sminloc1_8_r8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_i1.c b/libgfortran/generated/minval_i1.c

index 842abbb4a3c997344f0c79bfc358f6fd492e0a69..ccfdfa7670b2a0dc6c5bae0d9df3f202447bf500 100644 (file)
--- a/libgfortran/generated/minval_i1.c
+++ b/libgfortran/generated/minval_i1.c
@@ -181,9 +181,9 @@ minval_i1 (gfc_array_i1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_i1 (gfc_array_i1 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_i1 (gfc_array_i1 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_i16.c b/libgfortran/generated/minval_i16.c

index d5b0cc9f7f13b164afc3ce545f5dd47b73012459..9d3a1502e98f900ed98c73f4f94cd94f06944fad 100644 (file)
--- a/libgfortran/generated/minval_i16.c
+++ b/libgfortran/generated/minval_i16.c
@@ -181,9 +181,9 @@ minval_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_i2.c b/libgfortran/generated/minval_i2.c

index 0fadcf8208a8b2f246ea114e077255ab34060049..0c335a0689483fe7719db9f239dcfcf3f2a62b2c 100644 (file)
--- a/libgfortran/generated/minval_i2.c
+++ b/libgfortran/generated/minval_i2.c
@@ -181,9 +181,9 @@ minval_i2 (gfc_array_i2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_i2 (gfc_array_i2 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_i2 (gfc_array_i2 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_i4.c b/libgfortran/generated/minval_i4.c

index 5da7ccc47ffc534922c5386cd035e7e830291a04..73de782ef0941ca938ee07fcad565d0edd218d09 100644 (file)
--- a/libgfortran/generated/minval_i4.c
+++ b/libgfortran/generated/minval_i4.c
@@ -181,9 +181,9 @@ minval_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_i8.c b/libgfortran/generated/minval_i8.c

index 8984151a9ad1ad379599bf321042950b7b5d5652..4a2a71500842f1844fe8a0918ab07fc18bb89184 100644 (file)
--- a/libgfortran/generated/minval_i8.c
+++ b/libgfortran/generated/minval_i8.c
@@ -181,9 +181,9 @@ minval_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_r10.c b/libgfortran/generated/minval_r10.c

index beebcdae73dfd714a6b2381bcef735853f152e90..27966136955559e366f482466bf9a501afff0612 100644 (file)
--- a/libgfortran/generated/minval_r10.c
+++ b/libgfortran/generated/minval_r10.c
@@ -181,9 +181,9 @@ minval_r10 (gfc_array_r10 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_r10 (gfc_array_r10 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_r10 (gfc_array_r10 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_r16.c b/libgfortran/generated/minval_r16.c

index 511f1ecf4ee4d6fb165bce217205413637c54694..8bc429b8d921aa388523e6af1bcad08227ab2ff7 100644 (file)
--- a/libgfortran/generated/minval_r16.c
+++ b/libgfortran/generated/minval_r16.c
@@ -181,9 +181,9 @@ minval_r16 (gfc_array_r16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_r16 (gfc_array_r16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_r16 (gfc_array_r16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_r4.c b/libgfortran/generated/minval_r4.c

index 0498e8b63e0ec86e17306d55675bbee54a9eb725..a5ecce21dd92c4a1a0edf2bc18221423b9d09532 100644 (file)
--- a/libgfortran/generated/minval_r4.c
+++ b/libgfortran/generated/minval_r4.c
@@ -181,9 +181,9 @@ minval_r4 (gfc_array_r4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_r4 (gfc_array_r4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_r4 (gfc_array_r4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/minval_r8.c b/libgfortran/generated/minval_r8.c

index 528fbe4ad0656c8662ada6294a9ca259a644045f..78c751ef6994cc1760607629c55d6d29ed88b444 100644 (file)
--- a/libgfortran/generated/minval_r8.c
+++ b/libgfortran/generated/minval_r8.c
@@ -181,9 +181,9 @@ minval_r8 (gfc_array_r8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -386,9 +386,9 @@ mminval_r8 (gfc_array_r8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -526,7 +526,7 @@ sminval_r8 (gfc_array_r8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/norm2_r10.c b/libgfortran/generated/norm2_r10.c

index c4864c8a073bc1684fe8c7303cb0d77fd89024e8..4c5a23062851f3b42d608ab445fea6a4dd4c4309 100644 (file)
--- a/libgfortran/generated/norm2_r10.c
+++ b/libgfortran/generated/norm2_r10.c
@@ -187,9 +187,9 @@ norm2_r10 (gfc_array_r10 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/norm2_r16.c b/libgfortran/generated/norm2_r16.c

index 35cbe93cccb1a057b0957d064766ba46f8f2f51d..5eaefb8a92dbd12772061cf774ff36fa6155253e 100644 (file)
--- a/libgfortran/generated/norm2_r16.c
+++ b/libgfortran/generated/norm2_r16.c
@@ -191,9 +191,9 @@ norm2_r16 (gfc_array_r16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/norm2_r4.c b/libgfortran/generated/norm2_r4.c

index 9d9d936fb37337b092a7a6b0b86d0d3d8575a82e..0482b16ca2d1b7d88e64997dc8c769f0cfb38e16 100644 (file)
--- a/libgfortran/generated/norm2_r4.c
+++ b/libgfortran/generated/norm2_r4.c
@@ -187,9 +187,9 @@ norm2_r4 (gfc_array_r4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/norm2_r8.c b/libgfortran/generated/norm2_r8.c

index c4c34c4b8379a3d1bc3a6eab9aa99fbc749fdbeb..173faa63eb20fec3ab8be8b6f08df3db6ae9c51f 100644 (file)
--- a/libgfortran/generated/norm2_r8.c
+++ b/libgfortran/generated/norm2_r8.c
@@ -187,9 +187,9 @@ norm2_r8 (gfc_array_r8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/parity_l1.c b/libgfortran/generated/parity_l1.c

index 651f61614b8d8ff67ae898a5e19b0200f60be002..4fe64dec7db6ee60d4c21aabda77ab725a48e13c 100644 (file)
--- a/libgfortran/generated/parity_l1.c
+++ b/libgfortran/generated/parity_l1.c
@@ -167,9 +167,9 @@ parity_l1 (gfc_array_l1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/parity_l16.c b/libgfortran/generated/parity_l16.c

index a2919a44b5ded3d0a42bf2f5e497826a291be670..d9e0a8efcdcb89ee8d1a8b743a24283de1f8db29 100644 (file)
--- a/libgfortran/generated/parity_l16.c
+++ b/libgfortran/generated/parity_l16.c
@@ -167,9 +167,9 @@ parity_l16 (gfc_array_l16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/parity_l2.c b/libgfortran/generated/parity_l2.c

index 68f9b4fc00b11e1aad960cb421f59512e6be8435..3cf26312f02904ad10ec5eede5416e6b7b9f7315 100644 (file)
--- a/libgfortran/generated/parity_l2.c
+++ b/libgfortran/generated/parity_l2.c
@@ -167,9 +167,9 @@ parity_l2 (gfc_array_l2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/parity_l4.c b/libgfortran/generated/parity_l4.c

index 9cff0825b3aba1fca9a69a473aa22e8d139f9b25..70cdd18aef9a45e9b96bbfc30fb207463251717d 100644 (file)
--- a/libgfortran/generated/parity_l4.c
+++ b/libgfortran/generated/parity_l4.c
@@ -167,9 +167,9 @@ parity_l4 (gfc_array_l4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/parity_l8.c b/libgfortran/generated/parity_l8.c

index 9e6e1ffa4c754c75b31c5468870855b0d381a054..d22c9a5537110f2837990ce92cbcf68444f988cd 100644 (file)
--- a/libgfortran/generated/parity_l8.c
+++ b/libgfortran/generated/parity_l8.c
@@ -167,9 +167,9 @@ parity_l8 (gfc_array_l8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
diff --git a/libgfortran/generated/product_c10.c b/libgfortran/generated/product_c10.c

index 4c41d5765c5cf33e9329db6e1305c0b3b587c72d..4e2f6f2b56689c6307f2e180cc45c57337aaadd3 100644 (file)
--- a/libgfortran/generated/product_c10.c
+++ b/libgfortran/generated/product_c10.c
@@ -167,9 +167,9 @@ product_c10 (gfc_array_c10 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_c10 (gfc_array_c10 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_c10 (gfc_array_c10 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_c16.c b/libgfortran/generated/product_c16.c

index 69c4c097e46cfb0e90b93651df7143fb8d251f4c..df73041f1701c5c768a2dab7fafdd45bb0209fb6 100644 (file)
--- a/libgfortran/generated/product_c16.c
+++ b/libgfortran/generated/product_c16.c
@@ -167,9 +167,9 @@ product_c16 (gfc_array_c16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_c16 (gfc_array_c16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_c16 (gfc_array_c16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_c4.c b/libgfortran/generated/product_c4.c

index 7f0f8ecdf28128ae76b536ed6f9d71842b7c67b0..3d097a9a3ec1f6bad2126a5950e74db1f3e63b86 100644 (file)
--- a/libgfortran/generated/product_c4.c
+++ b/libgfortran/generated/product_c4.c
@@ -167,9 +167,9 @@ product_c4 (gfc_array_c4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_c4 (gfc_array_c4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_c4 (gfc_array_c4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_c8.c b/libgfortran/generated/product_c8.c

index e1d314029d6db7c983c9da5f035e773902575426..4bb1ddee0fedd42f965f2c32be7df0eb013b44de 100644 (file)
--- a/libgfortran/generated/product_c8.c
+++ b/libgfortran/generated/product_c8.c
@@ -167,9 +167,9 @@ product_c8 (gfc_array_c8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_c8 (gfc_array_c8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_c8 (gfc_array_c8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_i1.c b/libgfortran/generated/product_i1.c

index 013ea30dc293b12316ecd347b3a12054a18b3279..fc03a48bc05d90bd98106bf988d4048b792f3dd5 100644 (file)
--- a/libgfortran/generated/product_i1.c
+++ b/libgfortran/generated/product_i1.c
@@ -167,9 +167,9 @@ product_i1 (gfc_array_i1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_i1 (gfc_array_i1 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_i1 (gfc_array_i1 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_i16.c b/libgfortran/generated/product_i16.c

index 477f186c556c6a1e3a6c7abfbd3dc6b0dc5a7a29..6a4e1aa29a394699f1d4343913b371320bab09db 100644 (file)
--- a/libgfortran/generated/product_i16.c
+++ b/libgfortran/generated/product_i16.c
@@ -167,9 +167,9 @@ product_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_i2.c b/libgfortran/generated/product_i2.c

index c9b2b99fd4d0a78867a8bcb7d38e8ef7c2147b53..82a650f6ec65cfaa014d1617aff89634fcb09488 100644 (file)
--- a/libgfortran/generated/product_i2.c
+++ b/libgfortran/generated/product_i2.c
@@ -167,9 +167,9 @@ product_i2 (gfc_array_i2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_i2 (gfc_array_i2 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_i2 (gfc_array_i2 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_i4.c b/libgfortran/generated/product_i4.c

index 7b7f01a501e91280dfaa04fac35a1a65960f4c70..84f7c36e439dcd29debf6bed28ba6291f4858f7c 100644 (file)
--- a/libgfortran/generated/product_i4.c
+++ b/libgfortran/generated/product_i4.c
@@ -167,9 +167,9 @@ product_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_i8.c b/libgfortran/generated/product_i8.c

index 4283eee3c52060f24773a3bed889d428e779d54f..5ace17304e4f1f770ba4a29c7a23deff7858d48a 100644 (file)
--- a/libgfortran/generated/product_i8.c
+++ b/libgfortran/generated/product_i8.c
@@ -167,9 +167,9 @@ product_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_r10.c b/libgfortran/generated/product_r10.c

index fcf25f8fbe4f7593753e261bf9cc9a89dc5117fc..54e22915b88b0e10f5a214517a1626dbf949d14a 100644 (file)
--- a/libgfortran/generated/product_r10.c
+++ b/libgfortran/generated/product_r10.c
@@ -167,9 +167,9 @@ product_r10 (gfc_array_r10 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_r10 (gfc_array_r10 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_r10 (gfc_array_r10 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_r16.c b/libgfortran/generated/product_r16.c

index 365d69e5b754e343e36df85d4476f143f75380a7..d3a2afdbdadd9470f4e80cf426c8dc385e5b674d 100644 (file)
--- a/libgfortran/generated/product_r16.c
+++ b/libgfortran/generated/product_r16.c
@@ -167,9 +167,9 @@ product_r16 (gfc_array_r16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_r16 (gfc_array_r16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_r16 (gfc_array_r16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_r4.c b/libgfortran/generated/product_r4.c

index 9c541ed9d1dda47c4a97489884e9c30a55cd2fba..94a2f1060385e5383d9470d1cf67f944fb566057 100644 (file)
--- a/libgfortran/generated/product_r4.c
+++ b/libgfortran/generated/product_r4.c
@@ -167,9 +167,9 @@ product_r4 (gfc_array_r4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_r4 (gfc_array_r4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_r4 (gfc_array_r4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/product_r8.c b/libgfortran/generated/product_r8.c

index e71e24f50b93e3606997bc00f751fa20be6c18dd..2daba7587bd3e08e43b0e002068a977a5d28a7f1 100644 (file)
--- a/libgfortran/generated/product_r8.c
+++ b/libgfortran/generated/product_r8.c
@@ -167,9 +167,9 @@ product_r8 (gfc_array_r8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ mproduct_r8 (gfc_array_r8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ sproduct_r8 (gfc_array_r8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_c10.c b/libgfortran/generated/sum_c10.c

index 4dfff6af3f6bab8afc692558f96efec3cdd6ded5..9d16db231b4843a9f5100a2a27fb732b36f9468c 100644 (file)
--- a/libgfortran/generated/sum_c10.c
+++ b/libgfortran/generated/sum_c10.c
@@ -167,9 +167,9 @@ sum_c10 (gfc_array_c10 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_c10 (gfc_array_c10 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_c10 (gfc_array_c10 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_c16.c b/libgfortran/generated/sum_c16.c

index 8c94dd047d6bd16eed58b4eb491c7c70db359cc4..581110141006296f9d73e5f36fd11feea652e318 100644 (file)
--- a/libgfortran/generated/sum_c16.c
+++ b/libgfortran/generated/sum_c16.c
@@ -167,9 +167,9 @@ sum_c16 (gfc_array_c16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_c16 (gfc_array_c16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_c16 (gfc_array_c16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_c4.c b/libgfortran/generated/sum_c4.c

index cd9c4e94db2df40797944f996304a445e0fc537c..27438bf4bac609fb5f9657dc92f8454302907287 100644 (file)
--- a/libgfortran/generated/sum_c4.c
+++ b/libgfortran/generated/sum_c4.c
@@ -167,9 +167,9 @@ sum_c4 (gfc_array_c4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_c4 (gfc_array_c4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_c4 (gfc_array_c4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_c8.c b/libgfortran/generated/sum_c8.c

index 958ab38bf6ac620899146153e214e08d7428b7a2..cb58bbf5724b2ca71e89b2a41f1a06cc4649e67f 100644 (file)
--- a/libgfortran/generated/sum_c8.c
+++ b/libgfortran/generated/sum_c8.c
@@ -167,9 +167,9 @@ sum_c8 (gfc_array_c8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_c8 (gfc_array_c8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_c8 (gfc_array_c8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_i1.c b/libgfortran/generated/sum_i1.c

index bd1989202e626c784b1c1e1353d457e38b42ca58..1980383b5db1c353a062780ca1ae796fd0c15350 100644 (file)
--- a/libgfortran/generated/sum_i1.c
+++ b/libgfortran/generated/sum_i1.c
@@ -167,9 +167,9 @@ sum_i1 (gfc_array_i1 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_i1 (gfc_array_i1 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_i1 (gfc_array_i1 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_i16.c b/libgfortran/generated/sum_i16.c

index 7227d60046313fb54a21fd49ed2f4bc410d65f7d..0abaff00adea7ea5ad4c16772a4728eea703e759 100644 (file)
--- a/libgfortran/generated/sum_i16.c
+++ b/libgfortran/generated/sum_i16.c
@@ -167,9 +167,9 @@ sum_i16 (gfc_array_i16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_i16 (gfc_array_i16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_i16 (gfc_array_i16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_i2.c b/libgfortran/generated/sum_i2.c

index d308991184d5b33363106dedc86b965d82afbaec..6332b64774305ed6065ef6c9ba44c5642ffc89e5 100644 (file)
--- a/libgfortran/generated/sum_i2.c
+++ b/libgfortran/generated/sum_i2.c
@@ -167,9 +167,9 @@ sum_i2 (gfc_array_i2 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_i2 (gfc_array_i2 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_i2 (gfc_array_i2 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_i4.c b/libgfortran/generated/sum_i4.c

index 26d0130c42474a52fdde26535ea668460bda79f8..27dd47ee8c516afede8031f3bafdb06d759cca80 100644 (file)
--- a/libgfortran/generated/sum_i4.c
+++ b/libgfortran/generated/sum_i4.c
@@ -167,9 +167,9 @@ sum_i4 (gfc_array_i4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_i4 (gfc_array_i4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_i4 (gfc_array_i4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_i8.c b/libgfortran/generated/sum_i8.c

index 95f1252f72bb3793b69954e3aaee16ac08faf6cb..f7639db0ae7901586536f9d682e712ea95555908 100644 (file)
--- a/libgfortran/generated/sum_i8.c
+++ b/libgfortran/generated/sum_i8.c
@@ -167,9 +167,9 @@ sum_i8 (gfc_array_i8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_i8 (gfc_array_i8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_i8 (gfc_array_i8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_r10.c b/libgfortran/generated/sum_r10.c

index 7e478db531de9989d3f7148f264d92858e4ae30b..07caf2360342b76b39bedb259b8eee56dc5f087d 100644 (file)
--- a/libgfortran/generated/sum_r10.c
+++ b/libgfortran/generated/sum_r10.c
@@ -167,9 +167,9 @@ sum_r10 (gfc_array_r10 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_r10 (gfc_array_r10 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_r10 (gfc_array_r10 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_r16.c b/libgfortran/generated/sum_r16.c

index d3cc4b8b38df407a4cc4ef99a0dee5a00180d1c7..374c2b326f3815c55b2d8bf75a5bb8acaa6dbebe 100644 (file)
--- a/libgfortran/generated/sum_r16.c
+++ b/libgfortran/generated/sum_r16.c
@@ -167,9 +167,9 @@ sum_r16 (gfc_array_r16 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_r16 (gfc_array_r16 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_r16 (gfc_array_r16 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_r4.c b/libgfortran/generated/sum_r4.c

index faeb09360426b01fe51f53a139b22c49998e9661..4b5caeede98d4611b0c5babd573e0e301b4924c4 100644 (file)
--- a/libgfortran/generated/sum_r4.c
+++ b/libgfortran/generated/sum_r4.c
@@ -167,9 +167,9 @@ sum_r4 (gfc_array_r4 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_r4 (gfc_array_r4 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_r4 (gfc_array_r4 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/generated/sum_r8.c b/libgfortran/generated/sum_r8.c

index 861458e24b6150a873c10d0b49647c523e0e4a66..18872d7d53581ea92860ae4542da287d2f2e0bec 100644 (file)
--- a/libgfortran/generated/sum_r8.c
+++ b/libgfortran/generated/sum_r8.c
@@ -167,9 +167,9 @@ sum_r8 (gfc_array_r8 * const restrict retarray,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -344,9 +344,9 @@ msum_r8 (gfc_array_r8 * const restrict retarray,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -484,7 +484,7 @@ ssum_r8 (gfc_array_r8 * const restrict retarray,
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/m4/iforeach.m4 b/libgfortran/m4/iforeach.m4

index 2b916af66ddb7cc06d941f2a148e036dedb4d594..e7521e62537b83d11d97ab06ef9f0d4a266a1198 100644 (file)
--- a/libgfortran/m4/iforeach.m4
+++ b/libgfortran/m4/iforeach.m4
@@ -85,7 +85,7 @@ define(FINISH_FOREACH_FUNCTION,
              frequently used path so probably not worth it.  */
           base -= sstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
@@ -203,7 +203,7 @@ define(FINISH_MASKED_FOREACH_FUNCTION,
           base -= sstride[n] * extent[n];
           mbase -= mstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
               /* Break out of the loop.  */
               base = NULL;
diff --git a/libgfortran/m4/ifunction.m4 b/libgfortran/m4/ifunction.m4

index b4de9a876084142ae08715b7a4bfe8a85a1e4b47..43d8775d04ceade93d69df70786742e511243755 100644 (file)
--- a/libgfortran/m4/ifunction.m4
+++ b/libgfortran/m4/ifunction.m4
@@ -157,9 +157,9 @@ define(FINISH_ARRAY_FUNCTION,
           base -= sstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               continue_loop = 0;
               break;
             }
@@ -333,9 +333,9 @@ define(FINISH_MASKED_ARRAY_FUNCTION,
           mbase -= mstride[n] * extent[n];
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             {
-             /* Break out of the look.  */
+             /* Break out of the loop.  */
               base = NULL;
               break;
             }
@@ -473,7 +473,7 @@ void
              frequently used path so probably not worth it.  */
           dest -= dstride[n] * extent[n];
           n++;
-         if (n == rank)
+         if (n >= rank)
             return;
           else
             {
diff --git a/libgfortran/m4/ifunction_logical.m4 b/libgfortran/m4/ifunction_logical.m4

index fd3afb074f8e1ac94e0c8baa447330f1a3bd1b8a..fda8812cc51f3543aedeeafe09cb799b3232aa3a 100644 (file)
--- a/libgfortran/m4/ifunction_logical.m4
+++ b/libgfortran/m4/ifunction_logical.m4
@@ -184,9 +184,9 @@ define(FINISH_ARRAY_FUNCTION,
            base -= sstride[n] * extent[n];
            dest -= dstride[n] * extent[n];
            n++;
-          if (n == rank)
+          if (n >= rank)
              {
-              /* Break out of the look.  */
+              /* Break out of the loop.  */
                continue_loop = 0;
                break;
              }
author	Thomas Koenig <tkoenig@gcc.gnu.org>
	Fri, 10 Mar 2017 19:42:46 +0000 (19:42 +0000)
committer	Thomas Koenig <tkoenig@gcc.gnu.org>
	Fri, 10 Mar 2017 19:42:46 +0000 (19:42 +0000)
libgfortran/ChangeLog		patch \| blob \| history
libgfortran/generated/all_l1.c		patch \| blob \| history
libgfortran/generated/all_l16.c		patch \| blob \| history
libgfortran/generated/all_l2.c		patch \| blob \| history
libgfortran/generated/all_l4.c		patch \| blob \| history
libgfortran/generated/all_l8.c		patch \| blob \| history
libgfortran/generated/any_l1.c		patch \| blob \| history
libgfortran/generated/any_l16.c		patch \| blob \| history
libgfortran/generated/any_l2.c		patch \| blob \| history
libgfortran/generated/any_l4.c		patch \| blob \| history
libgfortran/generated/any_l8.c		patch \| blob \| history
libgfortran/generated/count_16_l.c		patch \| blob \| history
libgfortran/generated/count_1_l.c		patch \| blob \| history
libgfortran/generated/count_2_l.c		patch \| blob \| history
libgfortran/generated/count_4_l.c		patch \| blob \| history
libgfortran/generated/count_8_l.c		patch \| blob \| history
libgfortran/generated/iall_i1.c		patch \| blob \| history
libgfortran/generated/iall_i16.c		patch \| blob \| history
libgfortran/generated/iall_i2.c		patch \| blob \| history
libgfortran/generated/iall_i4.c		patch \| blob \| history
libgfortran/generated/iall_i8.c		patch \| blob \| history
libgfortran/generated/iany_i1.c		patch \| blob \| history
libgfortran/generated/iany_i16.c		patch \| blob \| history
libgfortran/generated/iany_i2.c		patch \| blob \| history
libgfortran/generated/iany_i4.c		patch \| blob \| history
libgfortran/generated/iany_i8.c		patch \| blob \| history
libgfortran/generated/iparity_i1.c		patch \| blob \| history
libgfortran/generated/iparity_i16.c		patch \| blob \| history
libgfortran/generated/iparity_i2.c		patch \| blob \| history
libgfortran/generated/iparity_i4.c		patch \| blob \| history
libgfortran/generated/iparity_i8.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_i1.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_i16.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_i2.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_i4.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_i8.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_r10.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_r16.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_r4.c		patch \| blob \| history
libgfortran/generated/maxloc0_16_r8.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_i1.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_i16.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_i2.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_i4.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_i8.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_r10.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_r16.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_r4.c		patch \| blob \| history
libgfortran/generated/maxloc0_4_r8.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_i1.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_i16.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_i2.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_i4.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_i8.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_r10.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_r16.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_r4.c		patch \| blob \| history
libgfortran/generated/maxloc0_8_r8.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_i1.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_i16.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_i2.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_i4.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_i8.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_r10.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_r16.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_r4.c		patch \| blob \| history
libgfortran/generated/maxloc1_16_r8.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_i1.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_i16.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_i2.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_i4.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_i8.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_r10.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_r16.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_r4.c		patch \| blob \| history
libgfortran/generated/maxloc1_4_r8.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_i1.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_i16.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_i2.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_i4.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_i8.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_r10.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_r16.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_r4.c		patch \| blob \| history
libgfortran/generated/maxloc1_8_r8.c		patch \| blob \| history
libgfortran/generated/maxval_i1.c		patch \| blob \| history
libgfortran/generated/maxval_i16.c		patch \| blob \| history
libgfortran/generated/maxval_i2.c		patch \| blob \| history
libgfortran/generated/maxval_i4.c		patch \| blob \| history
libgfortran/generated/maxval_i8.c		patch \| blob \| history
libgfortran/generated/maxval_r10.c		patch \| blob \| history
libgfortran/generated/maxval_r16.c		patch \| blob \| history
libgfortran/generated/maxval_r4.c		patch \| blob \| history
libgfortran/generated/maxval_r8.c		patch \| blob \| history
libgfortran/generated/minloc0_16_i1.c		patch \| blob \| history
libgfortran/generated/minloc0_16_i16.c		patch \| blob \| history
libgfortran/generated/minloc0_16_i2.c		patch \| blob \| history
libgfortran/generated/minloc0_16_i4.c		patch \| blob \| history
libgfortran/generated/minloc0_16_i8.c		patch \| blob \| history
libgfortran/generated/minloc0_16_r10.c		patch \| blob \| history
libgfortran/generated/minloc0_16_r16.c		patch \| blob \| history
libgfortran/generated/minloc0_16_r4.c		patch \| blob \| history
libgfortran/generated/minloc0_16_r8.c		patch \| blob \| history
libgfortran/generated/minloc0_4_i1.c		patch \| blob \| history
libgfortran/generated/minloc0_4_i16.c		patch \| blob \| history
libgfortran/generated/minloc0_4_i2.c		patch \| blob \| history
libgfortran/generated/minloc0_4_i4.c		patch \| blob \| history
libgfortran/generated/minloc0_4_i8.c		patch \| blob \| history
libgfortran/generated/minloc0_4_r10.c		patch \| blob \| history
libgfortran/generated/minloc0_4_r16.c		patch \| blob \| history
libgfortran/generated/minloc0_4_r4.c		patch \| blob \| history
libgfortran/generated/minloc0_4_r8.c		patch \| blob \| history
libgfortran/generated/minloc0_8_i1.c		patch \| blob \| history
libgfortran/generated/minloc0_8_i16.c		patch \| blob \| history
libgfortran/generated/minloc0_8_i2.c		patch \| blob \| history
libgfortran/generated/minloc0_8_i4.c		patch \| blob \| history
libgfortran/generated/minloc0_8_i8.c		patch \| blob \| history
libgfortran/generated/minloc0_8_r10.c		patch \| blob \| history
libgfortran/generated/minloc0_8_r16.c		patch \| blob \| history
libgfortran/generated/minloc0_8_r4.c		patch \| blob \| history
libgfortran/generated/minloc0_8_r8.c		patch \| blob \| history
libgfortran/generated/minloc1_16_i1.c		patch \| blob \| history
libgfortran/generated/minloc1_16_i16.c		patch \| blob \| history
libgfortran/generated/minloc1_16_i2.c		patch \| blob \| history
libgfortran/generated/minloc1_16_i4.c		patch \| blob \| history
libgfortran/generated/minloc1_16_i8.c		patch \| blob \| history
libgfortran/generated/minloc1_16_r10.c		patch \| blob \| history
libgfortran/generated/minloc1_16_r16.c		patch \| blob \| history
libgfortran/generated/minloc1_16_r4.c		patch \| blob \| history
libgfortran/generated/minloc1_16_r8.c		patch \| blob \| history
libgfortran/generated/minloc1_4_i1.c		patch \| blob \| history
libgfortran/generated/minloc1_4_i16.c		patch \| blob \| history
libgfortran/generated/minloc1_4_i2.c		patch \| blob \| history
libgfortran/generated/minloc1_4_i4.c		patch \| blob \| history
libgfortran/generated/minloc1_4_i8.c		patch \| blob \| history
libgfortran/generated/minloc1_4_r10.c		patch \| blob \| history
libgfortran/generated/minloc1_4_r16.c		patch \| blob \| history
libgfortran/generated/minloc1_4_r4.c		patch \| blob \| history
libgfortran/generated/minloc1_4_r8.c		patch \| blob \| history
libgfortran/generated/minloc1_8_i1.c		patch \| blob \| history
libgfortran/generated/minloc1_8_i16.c		patch \| blob \| history
libgfortran/generated/minloc1_8_i2.c		patch \| blob \| history
libgfortran/generated/minloc1_8_i4.c		patch \| blob \| history
libgfortran/generated/minloc1_8_i8.c		patch \| blob \| history
libgfortran/generated/minloc1_8_r10.c		patch \| blob \| history
libgfortran/generated/minloc1_8_r16.c		patch \| blob \| history
libgfortran/generated/minloc1_8_r4.c		patch \| blob \| history
libgfortran/generated/minloc1_8_r8.c		patch \| blob \| history
libgfortran/generated/minval_i1.c		patch \| blob \| history
libgfortran/generated/minval_i16.c		patch \| blob \| history
libgfortran/generated/minval_i2.c		patch \| blob \| history
libgfortran/generated/minval_i4.c		patch \| blob \| history
libgfortran/generated/minval_i8.c		patch \| blob \| history
libgfortran/generated/minval_r10.c		patch \| blob \| history
libgfortran/generated/minval_r16.c		patch \| blob \| history
libgfortran/generated/minval_r4.c		patch \| blob \| history
libgfortran/generated/minval_r8.c		patch \| blob \| history
libgfortran/generated/norm2_r10.c		patch \| blob \| history
libgfortran/generated/norm2_r16.c		patch \| blob \| history
libgfortran/generated/norm2_r4.c		patch \| blob \| history
libgfortran/generated/norm2_r8.c		patch \| blob \| history
libgfortran/generated/parity_l1.c		patch \| blob \| history
libgfortran/generated/parity_l16.c		patch \| blob \| history
libgfortran/generated/parity_l2.c		patch \| blob \| history
libgfortran/generated/parity_l4.c		patch \| blob \| history
libgfortran/generated/parity_l8.c		patch \| blob \| history
libgfortran/generated/product_c10.c		patch \| blob \| history
libgfortran/generated/product_c16.c		patch \| blob \| history
libgfortran/generated/product_c4.c		patch \| blob \| history
libgfortran/generated/product_c8.c		patch \| blob \| history
libgfortran/generated/product_i1.c		patch \| blob \| history
libgfortran/generated/product_i16.c		patch \| blob \| history
libgfortran/generated/product_i2.c		patch \| blob \| history
libgfortran/generated/product_i4.c		patch \| blob \| history
libgfortran/generated/product_i8.c		patch \| blob \| history
libgfortran/generated/product_r10.c		patch \| blob \| history
libgfortran/generated/product_r16.c		patch \| blob \| history
libgfortran/generated/product_r4.c		patch \| blob \| history
libgfortran/generated/product_r8.c		patch \| blob \| history
libgfortran/generated/sum_c10.c		patch \| blob \| history
libgfortran/generated/sum_c16.c		patch \| blob \| history
libgfortran/generated/sum_c4.c		patch \| blob \| history
libgfortran/generated/sum_c8.c		patch \| blob \| history
libgfortran/generated/sum_i1.c		patch \| blob \| history
libgfortran/generated/sum_i16.c		patch \| blob \| history
libgfortran/generated/sum_i2.c		patch \| blob \| history
libgfortran/generated/sum_i4.c		patch \| blob \| history
libgfortran/generated/sum_i8.c		patch \| blob \| history
libgfortran/generated/sum_r10.c		patch \| blob \| history
libgfortran/generated/sum_r16.c		patch \| blob \| history
libgfortran/generated/sum_r4.c		patch \| blob \| history
libgfortran/generated/sum_r8.c		patch \| blob \| history
libgfortran/m4/iforeach.m4		patch \| blob \| history
libgfortran/m4/ifunction.m4		patch \| blob \| history
libgfortran/m4/ifunction_logical.m4		patch \| blob \| history