diff options
| author | tkoenig <tkoenig@138bc75d-0d04-0410-961f-82ee72b054a4> | 2017-03-10 19:42:46 +0000 |
|---|---|---|
| committer | tkoenig <tkoenig@138bc75d-0d04-0410-961f-82ee72b054a4> | 2017-03-10 19:42:46 +0000 |
| commit | bacde0a1fa06e04b07478ad4b5ab8c4f289d7eb9 (patch) | |
| tree | 10b7e42e65eb89c6f795ff465b4c61c7527c4353 /libgfortran | |
| parent | 319901d067e8331dfe117f24315507837191d2a9 (diff) | |
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.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@246053 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libgfortran')
195 files changed, 929 insertions, 730 deletions
diff --git a/libgfortran/ChangeLog b/libgfortran/ChangeLog index edb416bde94b..bd2f726670d0 100644 --- 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 6a04f86a8d97..46168ebac833 100644 --- 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 7962fb61c98e..2fa957829f47 100644 --- 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 8e4cf2840832..5b08556ec5f8 100644 --- 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 b3edb83b1adb..b57374270b51 100644 --- 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 299f05a01396..dfac0e3c27af 100644 --- 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 df4c053d1e1e..e2bf26c4e6a5 100644 --- 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 261c5fe9d6e0..5b2987dbaba0 100644 --- 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 ebd19ee6eec1..6e28643eace4 100644 --- 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 2bd83fb70eb1..7d2fcd068145 100644 --- 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 c4c5adcdb820..c72d12fb07c3 100644 --- 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 98c5aeed106a..28ae1611db03 100644 --- 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 051400dc8306..8b1892c0faa4 100644 --- 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 256403ffaba7..8132c2ed7571 100644 --- 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 2d10338e5177..f90ba357d8e3 100644 --- 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 d366568218f1..efce9e480621 100644 --- 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 f49c73fde91f..619c833c33b3 100644 --- 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 01178998495f..4d37d9c80bf1 100644 --- 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 9b594ed579c5..283ceffb2c95 100644 --- 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 4e4dd50dd8b6..ef0ac58d3b95 100644 --- 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 0d562cc47ab0..ef780b01c71c 100644 --- 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 4cf28fc2e5f9..b60d4f2d3834 100644 --- 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 7cddbc5abf4f..f8fb40acd1cb 100644 --- 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 085668346781..ef931b35a579 100644 --- 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 14d43a237caa..d0ecaef23d01 100644 --- 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 a6b1c0251512..c963165cf184 100644 --- 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 6ebf498c480a..18e9fc24be13 100644 --- 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 670c74e57f8e..5b8ea6974833 100644 --- 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 63f7b4313c7c..0076667cabac 100644 --- 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 682b1705dcb1..20798423f5c8 100644 --- 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 3b8f55c439f4..60e390e99b76 100644 --- 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 09d1f72c161f..5fd888707a5c 100644 --- 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 f5626ecb9cc8..2a4d5d1c9a3e 100644 --- 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 d2f4d45734f5..43e706567313 100644 --- 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 be2da162ab19..d7e539db540b 100644 --- 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 de63fdf7ca3e..72afd48cb9f8 100644 --- 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 8663b3251c2f..670239b57dbf 100644 --- 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 f9cda989a25b..aa98e7d85d26 100644 --- 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 2368b01c5137..006d593c08b7 100644 --- 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 168b0dc451c3..a8d44d5cd856 100644 --- 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 5059f23bd44c..32caa2d0db7b 100644 --- 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 9951ebd294ac..fb05f9c0b546 100644 --- 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 8a905746c749..84520a99231c 100644 --- 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 cfa1c177c444..9d2e007a8189 100644 --- 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 0f79f0fc238f..a2366733fad1 100644 --- 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 711d1e5b9f35..c1953ab1c0f2 100644 --- 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 3d96dd9eead0..d0221d7611e4 100644 --- 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 292c0bfb031d..9f3931a1bf71 100644 --- 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 b735ac02c514..dff5190e5a36 100644 --- 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 7ef8f7b08804..d5a66288f482 100644 --- 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 65a378415ef1..ce2ad4910b60 100644 --- 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 afffe3f4e4d2..f9c9732886f6 100644 --- 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 41d8d64a4bd4..cc9d94cf3114 100644 --- 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 170cfe7bfeaa..c61fbedb8e2f 100644 --- 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 3333280402b5..07acd2540581 100644 --- 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 4826fbfecc2b..5b98163b048c 100644 --- 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 d0c9a33b9c1f..0caccea262a1 100644 --- 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 905472e3489b..4e51b65e526d 100644 --- 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 1d54b1d0ab36..48f2fc01e598 100644 --- 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 f6a8930537c6..6c154fb84e73 100644 --- 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 595fa2c89503..029e061e43c6 100644 --- 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 2d68405cd6ff..aceb7aeb69b3 100644 --- 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 06b20750c5ae..000a0cf599ce 100644 --- 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 896de8ac9ff0..53378d958e29 100644 --- 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 93cddf4c5942..4bdc4d66b893 100644 --- 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 42419b75eeb1..36d79e23ce3a 100644 --- 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 db0d6a3f6297..3993f77619bd 100644 --- 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 284116abe528..05d2af4be3e1 100644 --- 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 48c27674bc82..67e8a9ca2c7e 100644 --- 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 b9c9a010d98c..60ceaa698f4e 100644 --- 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 5222bc39ecdc..d2f30b7246a0 100644 --- 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 f9f067f18ef4..13a7dc6d34c7 100644 --- 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 8baf3376d48d..204229293c4c 100644 --- 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 03aa2abe348f..95076481c104 100644 --- 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 94c3260b46cd..87c6ca5eb402 100644 --- 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 11f71ee34962..a13986a1fa85 100644 --- 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 a46ddab57322..71a5d97efe4f 100644 --- 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 0e04e8ca2020..92cf55c4e2ce 100644 --- 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 d29c7ec294e6..fd1063c5df17 100644 --- 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 c477cdc60d41..db82ae894aec 100644 --- 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 5af011a09761..43b4af147926 100644 --- 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 0f352b2508a3..9ba6cb950e41 100644 --- 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 57e4ce4a6c7e..f7eb1ebf9be1 100644 --- 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 a74fa5c7633f..67b455bb7356 100644 --- 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 a7a1bf79d234..bd0913f4feaf 100644 --- 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 5593ffeca959..90ddf3503784 100644 --- 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 fa2536de34f2..6a54739e2909 100644 --- 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 ed90dad9fa06..3cdb5b9d3ede 100644 --- 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 67c7b0e37d13..d7ae9951a4ae 100644 --- 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 9cad4e3fff68..d622da09b272 100644 --- 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 96f77b73527b..9c4c6fbb26cb 100644 --- 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 6416040744b6..f10573233e33 100644 --- 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 ec5b1ac3e1b3..94d4f335a199 100644 --- 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 8788420dca35..5ba70b62edb6 100644 --- 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 7fb5c6e0b247..e458174b2852 100644 --- 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 4bdf9a09db88..b15ec83670ed 100644 --- 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 f01afcaae28a..b54495280ded 100644 --- 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 b2b5c8a3d915..5fa12c924e4a 100644 --- 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 7ae23368fefa..b8aefae9e611 100644 --- 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 5388bb3cb874..801b9e641312 100644 --- 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 3aca587355b8..499292fb213c 100644 --- 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 88f4cdbb8e72..d4377d45e750 100644 --- 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 a360b595426e..43e2c7fc0a63 100644 --- 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 470d2eab98f7..756c2dc86d15 100644 --- 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 8dcea5ec11da..3e38c724148c 100644 --- 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 1e9e154de990..c8136b66f340 100644 --- 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 7e80a494da75..a0afc1a8b3e5 100644 --- 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 f0a9ed3588c1..21b818f169d8 100644 --- 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 dd0bdf2ea776..6b86186cf040 100644 --- 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 d3a2e57af203..ca3ca9d02dc4 100644 --- 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 f507e796606b..f33c455a9a80 100644 --- 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 97eff1d3bb0d..6658b01b3df9 100644 --- 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 988e2771298c..8f0c48d08045 100644 --- 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 82e61a056b6a..50f5f861581f 100644 --- 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 d6055820c8a6..936cdf5d8d77 100644 --- 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 ff62da4e48f9..d6df3158b95c 100644 --- 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 bb6420998a68..df59e0933c27 100644 --- 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 527523a48f12..b57bc8d260b4 100644 --- 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 096fce480ff6..d76b290f870e 100644 --- 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 d9320d8854b8..ff3f300f701a 100644 --- 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 7917597adb04..e13239037da5 100644 --- 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 a2a2560562b6..bf6be092e858 100644 --- 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 23170e412fad..e4d9dab0b7ff 100644 --- 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 ac14c6a7e623..450142f7a82d 100644 --- 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 14ba2c858821..e1ca90f803b0 100644 --- 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 f68995826634..b5212041d730 100644 --- 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 cd22b3be2b6d..880bb7e2986d 100644 --- 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 63fadc354fd3..4343508d4a09 100644 --- 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 eaf4687acc61..b2fb09c92e9d 100644 --- 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 ad7c69a6bccb..f62cf3371530 100644 --- 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 025949c5fe5c..5bf2dbacdc4c 100644 --- 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 0fe8bedaa28d..c8925879e9c5 100644 --- 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 02a59927a95a..42d5afaf3d2c 100644 --- 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 db38835bd24a..456ea792b3ff 100644 --- 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 88719e20928c..a65195dcc3f4 100644 --- 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 8eec1bdf26eb..b106e97dde85 100644 --- 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 44b09b65c8d4..b1ef3b3ee622 100644 --- 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 ca95245ea49f..9ddf490d68bf 100644 --- 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 157220804407..0619ac6f0a78 100644 --- 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 707e5fb194db..27c7fa9e3503 100644 --- 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 9acb3e3c58a6..274b17e45f97 100644 --- 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 918f09fee36d..416622c36e72 100644 --- 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 53b0208b9dfa..ff67899917c7 100644 --- 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 b967c5ff5972..c4247ac7f177 100644 --- 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 8787a2568e64..c57f72aabe6a 100644 --- 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 c4b1b4f660dd..c1d2cd2a88e1 100644 --- 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 1e8ccc164bb4..c1faa797d4cb 100644 --- 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 1363e565dede..e7c5ee19ad19 100644 --- 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 842abbb4a3c9..ccfdfa7670b2 100644 --- 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 d5b0cc9f7f13..9d3a1502e98f 100644 --- 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 0fadcf8208a8..0c335a068948 100644 --- 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 5da7ccc47ffc..73de782ef094 100644 --- 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 8984151a9ad1..4a2a71500842 100644 --- 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 beebcdae73df..279661369555 100644 --- 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 511f1ecf4ee4..8bc429b8d921 100644 --- 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 0498e8b63e0e..a5ecce21dd92 100644 --- 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 528fbe4ad065..78c751ef6994 100644 --- 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 c4864c8a073b..4c5a23062851 100644 --- 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 35cbe93cccb1..5eaefb8a92db 100644 --- 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 9d9d936fb373..0482b16ca2d1 100644 --- 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 c4c34c4b8379..173faa63eb20 100644 --- 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 651f61614b8d..4fe64dec7db6 100644 --- 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 a2919a44b5de..d9e0a8efcdcb 100644 --- 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 68f9b4fc00b1..3cf26312f029 100644 --- 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 9cff0825b3ab..70cdd18aef9a 100644 --- 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 9e6e1ffa4c75..d22c9a553711 100644 --- 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 4c41d5765c5c..4e2f6f2b5668 100644 --- 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 69c4c097e46c..df73041f1701 100644 --- 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 7f0f8ecdf281..3d097a9a3ec1 100644 --- 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 e1d314029d6d..4bb1ddee0fed 100644 --- 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 013ea30dc293..fc03a48bc05d 100644 --- 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 477f186c556c..6a4e1aa29a39 100644 --- 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 c9b2b99fd4d0..82a650f6ec65 100644 --- 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 7b7f01a501e9..84f7c36e439d 100644 --- 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 4283eee3c520..5ace17304e4f 100644 --- 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 fcf25f8fbe4f..54e22915b88b 100644 --- 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 365d69e5b754..d3a2afdbdadd 100644 --- 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 9c541ed9d1dd..94a2f1060385 100644 --- 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 e71e24f50b93..2daba7587bd3 100644 --- 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 4dfff6af3f6b..9d16db231b48 100644 --- 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 8c94dd047d6b..581110141006 100644 --- 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 cd9c4e94db2d..27438bf4bac6 100644 --- 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 958ab38bf6ac..cb58bbf5724b 100644 --- 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 bd1989202e62..1980383b5db1 100644 --- 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 7227d6004631..0abaff00adea 100644 --- 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 d308991184d5..6332b6477430 100644 --- 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 26d0130c4247..27dd47ee8c51 100644 --- 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 95f1252f72bb..f7639db0ae79 100644 --- 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 7e478db531de..07caf2360342 100644 --- 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 d3cc4b8b38df..374c2b326f38 100644 --- 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 faeb09360426..4b5caeede98d 100644 --- 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 861458e24b61..18872d7d5358 100644 --- 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 2b916af66ddb..e7521e62537b 100644 --- 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 b4de9a876084..43d8775d04ce 100644 --- 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 fd3afb074f8e..fda8812cc51f 100644 --- 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; } |