re PR libfortran/79956 (many new -Wmaybe-uninitialized warnings with bootstrap-O3)
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. From-SVN: r246053
This commit is contained in:
Thomas Koenig
parent
4ccfdb287e
commit
80dd631fce
195 changed files with 929 additions and 730 deletions
|
|
@ -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>
|
||||
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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
|
||||
{
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
|
|
@ -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;
|
||||
|
|
|
|||
Some files were not shown because too many files have changed in this diff Show more
Loading…
Add table
Reference in a new issue