diff options
| author | Francois-Xavier Coudert <coudert@clipper.ens.fr> | 2006-10-20 13:52:56 +0200 |
|---|---|---|
| committer | François-Xavier Coudert <fxcoudert@gcc.gnu.org> | 2006-10-20 11:52:56 +0000 |
| commit | 5d7adf7a1573b3ab23d9a2d70fbf30a8ef0c4958 (patch) | |
| tree | 51f9c0060d03b15363ca3237c4dffcc063014276 | |
| parent | 065a4d36bca538c11061971e7b8407c0da799951 (diff) | |
| download | gcc-5d7adf7a1573b3ab23d9a2d70fbf30a8ef0c4958.zip gcc-5d7adf7a1573b3ab23d9a2d70fbf30a8ef0c4958.tar.gz gcc-5d7adf7a1573b3ab23d9a2d70fbf30a8ef0c4958.tar.bz2 | |
minval_r8.c: Regenerate.
* generated/minval_r8.c: Regenerate.
* generated/maxloc1_4_r8.c: Regenerate.
* generated/minloc1_16_r16.c: Regenerate.
* generated/sum_i8.c: Regenerate.
* generated/eoshift3_4.c: Regenerate.
* generated/any_l16.c: Regenerate.
* generated/eoshift1_8.c: Regenerate.
* generated/reshape_r16.c: Regenerate.
* generated/product_r4.c: Regenerate.
* generated/maxloc1_8_i4.c: Regenerate.
* generated/maxloc0_4_r4.c: Regenerate.
* generated/in_unpack_i8.c: Regenerate.
* generated/minloc0_4_r16.c: Regenerate.
* generated/reshape_c4.c: Regenerate.
* generated/maxloc0_4_r16.c: Regenerate.
* generated/minloc1_8_r16.c: Regenerate.
* generated/maxloc1_8_r16.c: Regenerate.
* generated/in_unpack_i16.c: Regenerate.
* generated/maxloc0_8_i8.c: Regenerate.
* generated/sum_r16.c: Regenerate.
* generated/minloc1_4_r8.c: Regenerate.
* generated/maxloc1_16_r16.c: Regenerate.
* generated/minloc1_16_i4.c: Regenerate.
* generated/maxloc1_16_i4.c: Regenerate.
* generated/minloc0_16_i8.c: Regenerate.
* generated/maxloc0_16_i8.c: Regenerate.
* generated/maxval_r16.c: Regenerate.
* generated/count_16_l16.c: Regenerate.
* generated/count_8_l8.c: Regenerate.
* generated/product_c10.c: Regenerate.
* generated/minloc1_8_i4.c: Regenerate.
* generated/minloc0_16_i16.c: Regenerate.
* generated/eoshift1_16.c: Regenerate.
* generated/minloc0_4_r4.c: Regenerate.
* generated/product_c4.c: Regenerate.
* generated/sum_r4.c: Regenerate.
* generated/in_pack_c16.c: Regenerate.
* generated/reshape_i4.c: Regenerate.
* generated/minloc0_8_i8.c: Regenerate.
* generated/minloc1_16_r10.c: Regenerate.
* generated/in_pack_c4.c: Regenerate.
* generated/all_l16.c: Regenerate.
* generated/reshape_c16.c: Regenerate.
* generated/maxloc1_8_r8.c: Regenerate.
* generated/minval_i16.c: Regenerate.
* generated/reshape_r10.c: Regenerate.
* generated/maxval_i4.c: Regenerate.
* generated/any_l4.c: Regenerate.
* generated/minval_i8.c: Regenerate.
* generated/maxloc1_4_i8.c: Regenerate.
* generated/maxloc0_16_i16.c: Regenerate.
* generated/maxloc0_8_r4.c: Regenerate.
* generated/minloc1_4_i16.c: Regenerate.
* generated/minloc0_4_r10.c: Regenerate.
* generated/maxloc1_4_i16.c: Regenerate.
* generated/minloc0_8_i16.c: Regenerate.
* generated/maxloc0_4_r10.c: Regenerate.
* generated/maxloc0_8_i16.c: Regenerate.
* generated/minloc1_8_r10.c: Regenerate.
* generated/product_i4.c: Regenerate.
* generated/minloc0_16_r4.c: Regenerate.
* generated/sum_c16.c: Regenerate.
* generated/maxloc1_8_r10.c: Regenerate.
* generated/maxloc0_16_r4.c: Regenerate.
* generated/minloc1_16_r8.c: Regenerate.
* generated/maxloc0_4_i4.c: Regenerate.
* generated/maxloc1_16_r8.c: Regenerate.
* generated/cshift1_4.c: Regenerate.
* generated/sum_r10.c: Regenerate.
* generated/sum_c4.c: Regenerate.
* generated/maxloc1_16_r10.c: Regenerate.
* generated/count_4_l16.c: Regenerate.
* generated/in_pack_i4.c: Regenerate.
* generated/minloc1_8_r8.c: Regenerate.
* generated/count_4_l4.c: Regenerate.
* generated/maxval_r10.c: Regenerate.
* generated/minloc1_4_i8.c: Regenerate.
* generated/in_unpack_c4.c: Regenerate.
* generated/minloc0_8_r4.c: Regenerate.
* generated/product_i16.c: Regenerate.
* generated/minloc0_16_r16.c: Regenerate.
* generated/reshape_r8.c: Regenerate.
* generated/all_l4.c: Regenerate.
* generated/in_pack_c10.c: Regenerate.
* generated/minloc0_4_i4.c: Regenerate.
* generated/reshape_c10.c: Regenerate.
* generated/minval_r4.c: Regenerate.
* generated/maxloc1_4_r4.c: Regenerate.
* generated/sum_i4.c: Regenerate.
* generated/count_16_l8.c: Regenerate.
* generated/maxval_r8.c: Regenerate.
* generated/eoshift1_4.c: Regenerate.
* generated/eoshift3_8.c: Regenerate.
* generated/minval_r16.c: Regenerate.
* generated/product_r8.c: Regenerate.
* generated/maxloc1_8_i8.c: Regenerate.
* generated/maxloc0_4_r8.c: Regenerate.
* generated/maxloc0_16_r16.c: Regenerate.
* generated/in_unpack_i4.c: Regenerate.
* generated/sum_c10.c: Regenerate.
* generated/minloc1_4_r16.c: Regenerate.
* generated/maxloc1_4_r16.c: Regenerate.
* generated/in_unpack_c16.c: Regenerate.
* generated/minloc0_8_r16.c: Regenerate.
* generated/reshape_c8.c: Regenerate.
* generated/maxloc0_8_r16.c: Regenerate.
* generated/maxloc0_8_i4.c: Regenerate.
* generated/minloc1_4_r4.c: Regenerate.
* generated/minloc0_16_i4.c: Regenerate.
* generated/maxloc0_16_i4.c: Regenerate.
* generated/minloc1_16_i8.c: Regenerate.
* generated/maxloc1_16_i8.c: Regenerate.
* generated/count_8_l4.c: Regenerate.
* generated/minloc0_16_r10.c: Regenerate.
* generated/minloc1_8_i8.c: Regenerate.
* generated/minloc0_4_r8.c: Regenerate.
* generated/product_r16.c: Regenerate.
* generated/product_c8.c: Regenerate.
* generated/sum_r8.c: Regenerate.
* generated/in_pack_i16.c: Regenerate.
* generated/minloc0_8_i4.c: Regenerate.
* generated/minloc1_16_i16.c: Regenerate.
* generated/reshape_i8.c: Regenerate.
* generated/in_pack_c8.c: Regenerate.
* generated/maxloc1_8_r4.c: Regenerate.
* generated/reshape_i16.c: Regenerate.
* generated/minval_r10.c: Regenerate.
* generated/minval_i4.c: Regenerate.
* generated/maxloc1_4_i4.c: Regenerate.
* generated/maxval_i8.c: Regenerate.
* generated/eoshift3_16.c: Regenerate.
* generated/any_l8.c: Regenerate.
* generated/maxloc0_16_r10.c: Regenerate.
* generated/minloc0_4_i16.c: Regenerate.
* generated/maxloc0_8_r8.c: Regenerate.
* generated/maxloc0_4_i16.c: Regenerate.
* generated/minloc1_4_r10.c: Regenerate.
* generated/minloc1_8_i16.c: Regenerate.
* generated/maxloc1_4_r10.c: Regenerate.
* generated/minloc0_8_r10.c: Regenerate.
* generated/maxloc1_8_i16.c: Regenerate.
* generated/in_unpack_c10.c: Regenerate.
* generated/maxloc0_8_r10.c: Regenerate.
* generated/minloc1_16_r4.c: Regenerate.
* generated/maxloc1_16_r4.c: Regenerate.
* generated/minloc0_16_r8.c: Regenerate.
* generated/product_i8.c: Regenerate.
* generated/maxloc0_16_r8.c: Regenerate.
* generated/sum_i16.c: Regenerate.
* generated/maxloc0_4_i8.c: Regenerate.
* generated/cshift1_8.c: Regenerate.
* generated/maxloc1_16_i16.c: Regenerate.
* generated/minloc1_8_r4.c: Regenerate.
* generated/sum_c8.c: Regenerate.
* generated/count_8_l16.c: Regenerate.
* generated/in_pack_i8.c: Regenerate.
* generated/maxval_i16.c: Regenerate.
* generated/count_4_l8.c: Regenerate.
* generated/minloc1_4_i4.c: Regenerate.
* generated/product_c16.c: Regenerate.
* generated/reshape_r4.c: Regenerate.
* generated/minloc0_8_r8.c: Regenerate.
* generated/in_unpack_c8.c: Regenerate.
* generated/product_r10.c: Regenerate.
* generated/cshift1_16.c: Regenerate.
* generated/all_l8.c: Regenerate.
* generated/minloc0_4_i8.c: Regenerate.
* generated/maxval_r4.c: Regenerate.
* generated/count_16_l4.c: Regenerate.
From-SVN: r117904
170 files changed, 472 insertions, 300 deletions
diff --git a/libgfortran/ChangeLog b/libgfortran/ChangeLog index 5a51c53..19c2a92 100644 --- a/libgfortran/ChangeLog +++ b/libgfortran/ChangeLog @@ -1,3 +1,175 @@ +2006-10-20 Francois-Xavier Coudert <coudert@clipper.ens.fr> + + * generated/minval_r8.c: Regenerate. + * generated/maxloc1_4_r8.c: Regenerate. + * generated/minloc1_16_r16.c: Regenerate. + * generated/sum_i8.c: Regenerate. + * generated/eoshift3_4.c: Regenerate. + * generated/any_l16.c: Regenerate. + * generated/eoshift1_8.c: Regenerate. + * generated/reshape_r16.c: Regenerate. + * generated/product_r4.c: Regenerate. + * generated/maxloc1_8_i4.c: Regenerate. + * generated/maxloc0_4_r4.c: Regenerate. + * generated/in_unpack_i8.c: Regenerate. + * generated/minloc0_4_r16.c: Regenerate. + * generated/reshape_c4.c: Regenerate. + * generated/maxloc0_4_r16.c: Regenerate. + * generated/minloc1_8_r16.c: Regenerate. + * generated/maxloc1_8_r16.c: Regenerate. + * generated/in_unpack_i16.c: Regenerate. + * generated/maxloc0_8_i8.c: Regenerate. + * generated/sum_r16.c: Regenerate. + * generated/minloc1_4_r8.c: Regenerate. + * generated/maxloc1_16_r16.c: Regenerate. + * generated/minloc1_16_i4.c: Regenerate. + * generated/maxloc1_16_i4.c: Regenerate. + * generated/minloc0_16_i8.c: Regenerate. + * generated/maxloc0_16_i8.c: Regenerate. + * generated/maxval_r16.c: Regenerate. + * generated/count_16_l16.c: Regenerate. + * generated/count_8_l8.c: Regenerate. + * generated/product_c10.c: Regenerate. + * generated/minloc1_8_i4.c: Regenerate. + * generated/minloc0_16_i16.c: Regenerate. + * generated/eoshift1_16.c: Regenerate. + * generated/minloc0_4_r4.c: Regenerate. + * generated/product_c4.c: Regenerate. + * generated/sum_r4.c: Regenerate. + * generated/in_pack_c16.c: Regenerate. + * generated/reshape_i4.c: Regenerate. + * generated/minloc0_8_i8.c: Regenerate. + * generated/minloc1_16_r10.c: Regenerate. + * generated/in_pack_c4.c: Regenerate. + * generated/all_l16.c: Regenerate. + * generated/reshape_c16.c: Regenerate. + * generated/maxloc1_8_r8.c: Regenerate. + * generated/minval_i16.c: Regenerate. + * generated/reshape_r10.c: Regenerate. + * generated/maxval_i4.c: Regenerate. + * generated/any_l4.c: Regenerate. + * generated/minval_i8.c: Regenerate. + * generated/maxloc1_4_i8.c: Regenerate. + * generated/maxloc0_16_i16.c: Regenerate. + * generated/maxloc0_8_r4.c: Regenerate. + * generated/minloc1_4_i16.c: Regenerate. + * generated/minloc0_4_r10.c: Regenerate. + * generated/maxloc1_4_i16.c: Regenerate. + * generated/minloc0_8_i16.c: Regenerate. + * generated/maxloc0_4_r10.c: Regenerate. + * generated/maxloc0_8_i16.c: Regenerate. + * generated/minloc1_8_r10.c: Regenerate. + * generated/product_i4.c: Regenerate. + * generated/minloc0_16_r4.c: Regenerate. + * generated/sum_c16.c: Regenerate. + * generated/maxloc1_8_r10.c: Regenerate. + * generated/maxloc0_16_r4.c: Regenerate. + * generated/minloc1_16_r8.c: Regenerate. + * generated/maxloc0_4_i4.c: Regenerate. + * generated/maxloc1_16_r8.c: Regenerate. + * generated/cshift1_4.c: Regenerate. + * generated/sum_r10.c: Regenerate. + * generated/sum_c4.c: Regenerate. + * generated/maxloc1_16_r10.c: Regenerate. + * generated/count_4_l16.c: Regenerate. + * generated/in_pack_i4.c: Regenerate. + * generated/minloc1_8_r8.c: Regenerate. + * generated/count_4_l4.c: Regenerate. + * generated/maxval_r10.c: Regenerate. + * generated/minloc1_4_i8.c: Regenerate. + * generated/in_unpack_c4.c: Regenerate. + * generated/minloc0_8_r4.c: Regenerate. + * generated/product_i16.c: Regenerate. + * generated/minloc0_16_r16.c: Regenerate. + * generated/reshape_r8.c: Regenerate. + * generated/all_l4.c: Regenerate. + * generated/in_pack_c10.c: Regenerate. + * generated/minloc0_4_i4.c: Regenerate. + * generated/reshape_c10.c: Regenerate. + * generated/minval_r4.c: Regenerate. + * generated/maxloc1_4_r4.c: Regenerate. + * generated/sum_i4.c: Regenerate. + * generated/count_16_l8.c: Regenerate. + * generated/maxval_r8.c: Regenerate. + * generated/eoshift1_4.c: Regenerate. + * generated/eoshift3_8.c: Regenerate. + * generated/minval_r16.c: Regenerate. + * generated/product_r8.c: Regenerate. + * generated/maxloc1_8_i8.c: Regenerate. + * generated/maxloc0_4_r8.c: Regenerate. + * generated/maxloc0_16_r16.c: Regenerate. + * generated/in_unpack_i4.c: Regenerate. + * generated/sum_c10.c: Regenerate. + * generated/minloc1_4_r16.c: Regenerate. + * generated/maxloc1_4_r16.c: Regenerate. + * generated/in_unpack_c16.c: Regenerate. + * generated/minloc0_8_r16.c: Regenerate. + * generated/reshape_c8.c: Regenerate. + * generated/maxloc0_8_r16.c: Regenerate. + * generated/maxloc0_8_i4.c: Regenerate. + * generated/minloc1_4_r4.c: Regenerate. + * generated/minloc0_16_i4.c: Regenerate. + * generated/maxloc0_16_i4.c: Regenerate. + * generated/minloc1_16_i8.c: Regenerate. + * generated/maxloc1_16_i8.c: Regenerate. + * generated/count_8_l4.c: Regenerate. + * generated/minloc0_16_r10.c: Regenerate. + * generated/minloc1_8_i8.c: Regenerate. + * generated/minloc0_4_r8.c: Regenerate. + * generated/product_r16.c: Regenerate. + * generated/product_c8.c: Regenerate. + * generated/sum_r8.c: Regenerate. + * generated/in_pack_i16.c: Regenerate. + * generated/minloc0_8_i4.c: Regenerate. + * generated/minloc1_16_i16.c: Regenerate. + * generated/reshape_i8.c: Regenerate. + * generated/in_pack_c8.c: Regenerate. + * generated/maxloc1_8_r4.c: Regenerate. + * generated/reshape_i16.c: Regenerate. + * generated/minval_r10.c: Regenerate. + * generated/minval_i4.c: Regenerate. + * generated/maxloc1_4_i4.c: Regenerate. + * generated/maxval_i8.c: Regenerate. + * generated/eoshift3_16.c: Regenerate. + * generated/any_l8.c: Regenerate. + * generated/maxloc0_16_r10.c: Regenerate. + * generated/minloc0_4_i16.c: Regenerate. + * generated/maxloc0_8_r8.c: Regenerate. + * generated/maxloc0_4_i16.c: Regenerate. + * generated/minloc1_4_r10.c: Regenerate. + * generated/minloc1_8_i16.c: Regenerate. + * generated/maxloc1_4_r10.c: Regenerate. + * generated/minloc0_8_r10.c: Regenerate. + * generated/maxloc1_8_i16.c: Regenerate. + * generated/in_unpack_c10.c: Regenerate. + * generated/maxloc0_8_r10.c: Regenerate. + * generated/minloc1_16_r4.c: Regenerate. + * generated/maxloc1_16_r4.c: Regenerate. + * generated/minloc0_16_r8.c: Regenerate. + * generated/product_i8.c: Regenerate. + * generated/maxloc0_16_r8.c: Regenerate. + * generated/sum_i16.c: Regenerate. + * generated/maxloc0_4_i8.c: Regenerate. + * generated/cshift1_8.c: Regenerate. + * generated/maxloc1_16_i16.c: Regenerate. + * generated/minloc1_8_r4.c: Regenerate. + * generated/sum_c8.c: Regenerate. + * generated/count_8_l16.c: Regenerate. + * generated/in_pack_i8.c: Regenerate. + * generated/maxval_i16.c: Regenerate. + * generated/count_4_l8.c: Regenerate. + * generated/minloc1_4_i4.c: Regenerate. + * generated/product_c16.c: Regenerate. + * generated/reshape_r4.c: Regenerate. + * generated/minloc0_8_r8.c: Regenerate. + * generated/in_unpack_c8.c: Regenerate. + * generated/product_r10.c: Regenerate. + * generated/cshift1_16.c: Regenerate. + * generated/all_l8.c: Regenerate. + * generated/minloc0_4_i8.c: Regenerate. + * generated/maxval_r4.c: Regenerate. + * generated/count_16_l4.c: Regenerate. + 2006-10-19 Francois-Xavier Coudert <coudert@clipper.ens.fr> PR libfortran/27895 diff --git a/libgfortran/generated/all_l16.c b/libgfortran/generated/all_l16.c index 91f342a..4ad871d 100644 --- a/libgfortran/generated/all_l16.c +++ b/libgfortran/generated/all_l16.c @@ -149,7 +149,7 @@ all_l16 (gfc_array_l16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/all_l4.c b/libgfortran/generated/all_l4.c index 7cb4ae1..fbfcd8b 100644 --- a/libgfortran/generated/all_l4.c +++ b/libgfortran/generated/all_l4.c @@ -149,7 +149,7 @@ all_l4 (gfc_array_l4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/all_l8.c b/libgfortran/generated/all_l8.c index bc3928a..b41c4c2 100644 --- a/libgfortran/generated/all_l8.c +++ b/libgfortran/generated/all_l8.c @@ -149,7 +149,7 @@ all_l8 (gfc_array_l8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/any_l16.c b/libgfortran/generated/any_l16.c index e4fce4b..ad4516c 100644 --- a/libgfortran/generated/any_l16.c +++ b/libgfortran/generated/any_l16.c @@ -149,7 +149,7 @@ any_l16 (gfc_array_l16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/any_l4.c b/libgfortran/generated/any_l4.c index d026abd..6f922fd 100644 --- a/libgfortran/generated/any_l4.c +++ b/libgfortran/generated/any_l4.c @@ -149,7 +149,7 @@ any_l4 (gfc_array_l4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/any_l8.c b/libgfortran/generated/any_l8.c index 232ebfa..2a379d3 100644 --- a/libgfortran/generated/any_l8.c +++ b/libgfortran/generated/any_l8.c @@ -149,7 +149,7 @@ any_l8 (gfc_array_l8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_16_l16.c b/libgfortran/generated/count_16_l16.c index c3402a0..92b2247 100644 --- a/libgfortran/generated/count_16_l16.c +++ b/libgfortran/generated/count_16_l16.c @@ -145,7 +145,7 @@ count_16_l16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_16_l4.c b/libgfortran/generated/count_16_l4.c index 433096d..9181153 100644 --- a/libgfortran/generated/count_16_l4.c +++ b/libgfortran/generated/count_16_l4.c @@ -145,7 +145,7 @@ count_16_l4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_16_l8.c b/libgfortran/generated/count_16_l8.c index 4a363dc..de41758 100644 --- a/libgfortran/generated/count_16_l8.c +++ b/libgfortran/generated/count_16_l8.c @@ -145,7 +145,7 @@ count_16_l8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_4_l16.c b/libgfortran/generated/count_4_l16.c index df29e33..ad9b901 100644 --- a/libgfortran/generated/count_4_l16.c +++ b/libgfortran/generated/count_4_l16.c @@ -145,7 +145,7 @@ count_4_l16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_4_l4.c b/libgfortran/generated/count_4_l4.c index fcbe081..f5a46bf 100644 --- a/libgfortran/generated/count_4_l4.c +++ b/libgfortran/generated/count_4_l4.c @@ -145,7 +145,7 @@ count_4_l4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_4_l8.c b/libgfortran/generated/count_4_l8.c index 2563e88..5ec58bf 100644 --- a/libgfortran/generated/count_4_l8.c +++ b/libgfortran/generated/count_4_l8.c @@ -145,7 +145,7 @@ count_4_l8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_8_l16.c b/libgfortran/generated/count_8_l16.c index 3b8172d..87c291e 100644 --- a/libgfortran/generated/count_8_l16.c +++ b/libgfortran/generated/count_8_l16.c @@ -145,7 +145,7 @@ count_8_l16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_8_l4.c b/libgfortran/generated/count_8_l4.c index a322b1b..1a5451b 100644 --- a/libgfortran/generated/count_8_l4.c +++ b/libgfortran/generated/count_8_l4.c @@ -145,7 +145,7 @@ count_8_l4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/count_8_l8.c b/libgfortran/generated/count_8_l8.c index 48a60b1..b255d9d 100644 --- a/libgfortran/generated/count_8_l8.c +++ b/libgfortran/generated/count_8_l8.c @@ -145,7 +145,7 @@ count_8_l8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/cshift1_16.c b/libgfortran/generated/cshift1_16.c index c264bb1..bf7845b 100644 --- a/libgfortran/generated/cshift1_16.c +++ b/libgfortran/generated/cshift1_16.c @@ -175,7 +175,7 @@ cshift1 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/cshift1_4.c b/libgfortran/generated/cshift1_4.c index 8eba7b3..1b3d07f 100644 --- a/libgfortran/generated/cshift1_4.c +++ b/libgfortran/generated/cshift1_4.c @@ -175,7 +175,7 @@ cshift1 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/cshift1_8.c b/libgfortran/generated/cshift1_8.c index d8d0f89..58fc036 100644 --- a/libgfortran/generated/cshift1_8.c +++ b/libgfortran/generated/cshift1_8.c @@ -175,7 +175,7 @@ cshift1 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/eoshift1_16.c b/libgfortran/generated/eoshift1_16.c index bfb051f..4cb01c8 100644 --- a/libgfortran/generated/eoshift1_16.c +++ b/libgfortran/generated/eoshift1_16.c @@ -199,7 +199,7 @@ eoshift1 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/eoshift1_4.c b/libgfortran/generated/eoshift1_4.c index 922c46c..2528597 100644 --- a/libgfortran/generated/eoshift1_4.c +++ b/libgfortran/generated/eoshift1_4.c @@ -199,7 +199,7 @@ eoshift1 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/eoshift1_8.c b/libgfortran/generated/eoshift1_8.c index ea23adf..0ca9844 100644 --- a/libgfortran/generated/eoshift1_8.c +++ b/libgfortran/generated/eoshift1_8.c @@ -199,7 +199,7 @@ eoshift1 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/eoshift3_16.c b/libgfortran/generated/eoshift3_16.c index 3a8b046..3c75a42 100644 --- a/libgfortran/generated/eoshift3_16.c +++ b/libgfortran/generated/eoshift3_16.c @@ -215,7 +215,7 @@ eoshift3 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/eoshift3_4.c b/libgfortran/generated/eoshift3_4.c index cfbf449..a8e54d0 100644 --- a/libgfortran/generated/eoshift3_4.c +++ b/libgfortran/generated/eoshift3_4.c @@ -215,7 +215,7 @@ eoshift3 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/eoshift3_8.c b/libgfortran/generated/eoshift3_8.c index 402318f..8590554 100644 --- a/libgfortran/generated/eoshift3_8.c +++ b/libgfortran/generated/eoshift3_8.c @@ -215,7 +215,7 @@ eoshift3 (gfc_array_char * const restrict ret, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * extent[n]; sptr -= sstride[n] * extent[n]; hptr -= hstride[n] * extent[n]; diff --git a/libgfortran/generated/in_pack_c10.c b/libgfortran/generated/in_pack_c10.c index 1c51349..2c5326f 100644 --- a/libgfortran/generated/in_pack_c10.c +++ b/libgfortran/generated/in_pack_c10.c @@ -102,7 +102,7 @@ internal_pack_c10 (gfc_array_c10 * source) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_pack_c16.c b/libgfortran/generated/in_pack_c16.c index ca6af47..912858b 100644 --- a/libgfortran/generated/in_pack_c16.c +++ b/libgfortran/generated/in_pack_c16.c @@ -102,7 +102,7 @@ internal_pack_c16 (gfc_array_c16 * source) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_pack_c4.c b/libgfortran/generated/in_pack_c4.c index f16392b..e4a7fc8 100644 --- a/libgfortran/generated/in_pack_c4.c +++ b/libgfortran/generated/in_pack_c4.c @@ -102,7 +102,7 @@ internal_pack_c4 (gfc_array_c4 * source) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_pack_c8.c b/libgfortran/generated/in_pack_c8.c index abcf571..17a3bde 100644 --- a/libgfortran/generated/in_pack_c8.c +++ b/libgfortran/generated/in_pack_c8.c @@ -102,7 +102,7 @@ internal_pack_c8 (gfc_array_c8 * source) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_pack_i16.c b/libgfortran/generated/in_pack_i16.c index 205c102..96a2bb4 100644 --- a/libgfortran/generated/in_pack_i16.c +++ b/libgfortran/generated/in_pack_i16.c @@ -102,7 +102,7 @@ internal_pack_16 (gfc_array_i16 * source) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_pack_i4.c b/libgfortran/generated/in_pack_i4.c index 0d2ef2d..04e17b8 100644 --- a/libgfortran/generated/in_pack_i4.c +++ b/libgfortran/generated/in_pack_i4.c @@ -102,7 +102,7 @@ internal_pack_4 (gfc_array_i4 * source) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_pack_i8.c b/libgfortran/generated/in_pack_i8.c index b9be8b3..f7b27e0 100644 --- a/libgfortran/generated/in_pack_i8.c +++ b/libgfortran/generated/in_pack_i8.c @@ -102,7 +102,7 @@ internal_pack_8 (gfc_array_i8 * source) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_unpack_c10.c b/libgfortran/generated/in_unpack_c10.c index d4fe858..96e6833 100644 --- a/libgfortran/generated/in_unpack_c10.c +++ b/libgfortran/generated/in_unpack_c10.c @@ -91,7 +91,7 @@ internal_unpack_c10 (gfc_array_c10 * d, const GFC_COMPLEX_10 * src) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ dest -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_unpack_c16.c b/libgfortran/generated/in_unpack_c16.c index ad5fa07..3c2fc79 100644 --- a/libgfortran/generated/in_unpack_c16.c +++ b/libgfortran/generated/in_unpack_c16.c @@ -91,7 +91,7 @@ internal_unpack_c16 (gfc_array_c16 * d, const GFC_COMPLEX_16 * src) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ dest -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_unpack_c4.c b/libgfortran/generated/in_unpack_c4.c index de1b486..9ea8a36 100644 --- a/libgfortran/generated/in_unpack_c4.c +++ b/libgfortran/generated/in_unpack_c4.c @@ -91,7 +91,7 @@ internal_unpack_c4 (gfc_array_c4 * d, const GFC_COMPLEX_4 * src) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ dest -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_unpack_c8.c b/libgfortran/generated/in_unpack_c8.c index 70f22e4..a71a719 100644 --- a/libgfortran/generated/in_unpack_c8.c +++ b/libgfortran/generated/in_unpack_c8.c @@ -91,7 +91,7 @@ internal_unpack_c8 (gfc_array_c8 * d, const GFC_COMPLEX_8 * src) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ dest -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_unpack_i16.c b/libgfortran/generated/in_unpack_i16.c index b64b8bd..f8f6ea7 100644 --- a/libgfortran/generated/in_unpack_i16.c +++ b/libgfortran/generated/in_unpack_i16.c @@ -91,7 +91,7 @@ internal_unpack_16 (gfc_array_i16 * d, const GFC_INTEGER_16 * src) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ dest -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_unpack_i4.c b/libgfortran/generated/in_unpack_i4.c index 0136349..3ac0298 100644 --- a/libgfortran/generated/in_unpack_i4.c +++ b/libgfortran/generated/in_unpack_i4.c @@ -91,7 +91,7 @@ internal_unpack_4 (gfc_array_i4 * d, const GFC_INTEGER_4 * src) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ dest -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/in_unpack_i8.c b/libgfortran/generated/in_unpack_i8.c index 3f21843..84e28f9 100644 --- a/libgfortran/generated/in_unpack_i8.c +++ b/libgfortran/generated/in_unpack_i8.c @@ -91,7 +91,7 @@ internal_unpack_8 (gfc_array_i8 * d, const GFC_INTEGER_8 * src) the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ dest -= stride[n] * extent[n]; n++; if (n == dim) diff --git a/libgfortran/generated/maxloc0_16_i16.c b/libgfortran/generated/maxloc0_16_i16.c index 1883557..04ebbd4 100644 --- a/libgfortran/generated/maxloc0_16_i16.c +++ b/libgfortran/generated/maxloc0_16_i16.c @@ -128,7 +128,7 @@ maxloc0_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_16_i4.c b/libgfortran/generated/maxloc0_16_i4.c index 187a6c8..4362fa8 100644 --- a/libgfortran/generated/maxloc0_16_i4.c +++ b/libgfortran/generated/maxloc0_16_i4.c @@ -128,7 +128,7 @@ maxloc0_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_16_i8.c b/libgfortran/generated/maxloc0_16_i8.c index c51a70b..aeb0aed 100644 --- a/libgfortran/generated/maxloc0_16_i8.c +++ b/libgfortran/generated/maxloc0_16_i8.c @@ -128,7 +128,7 @@ maxloc0_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_16_r10.c b/libgfortran/generated/maxloc0_16_r10.c index 75c3f7a..e170fca 100644 --- a/libgfortran/generated/maxloc0_16_r10.c +++ b/libgfortran/generated/maxloc0_16_r10.c @@ -128,7 +128,7 @@ maxloc0_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_16_r16.c b/libgfortran/generated/maxloc0_16_r16.c index 4754bbd..4f2c466 100644 --- a/libgfortran/generated/maxloc0_16_r16.c +++ b/libgfortran/generated/maxloc0_16_r16.c @@ -128,7 +128,7 @@ maxloc0_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_16_r4.c b/libgfortran/generated/maxloc0_16_r4.c index 007932e..bc4a63d 100644 --- a/libgfortran/generated/maxloc0_16_r4.c +++ b/libgfortran/generated/maxloc0_16_r4.c @@ -128,7 +128,7 @@ maxloc0_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_16_r8.c b/libgfortran/generated/maxloc0_16_r8.c index 6c004b0..ed51b8a 100644 --- a/libgfortran/generated/maxloc0_16_r8.c +++ b/libgfortran/generated/maxloc0_16_r8.c @@ -128,7 +128,7 @@ maxloc0_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_4_i16.c b/libgfortran/generated/maxloc0_4_i16.c index a8b3bab..6d05291 100644 --- a/libgfortran/generated/maxloc0_4_i16.c +++ b/libgfortran/generated/maxloc0_4_i16.c @@ -128,7 +128,7 @@ maxloc0_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_4_i4.c b/libgfortran/generated/maxloc0_4_i4.c index 8fe240c..16ee31e 100644 --- a/libgfortran/generated/maxloc0_4_i4.c +++ b/libgfortran/generated/maxloc0_4_i4.c @@ -128,7 +128,7 @@ maxloc0_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_4_i8.c b/libgfortran/generated/maxloc0_4_i8.c index dd816de..58c6509 100644 --- a/libgfortran/generated/maxloc0_4_i8.c +++ b/libgfortran/generated/maxloc0_4_i8.c @@ -128,7 +128,7 @@ maxloc0_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_4_r10.c b/libgfortran/generated/maxloc0_4_r10.c index db829a9..e918875 100644 --- a/libgfortran/generated/maxloc0_4_r10.c +++ b/libgfortran/generated/maxloc0_4_r10.c @@ -128,7 +128,7 @@ maxloc0_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_4_r16.c b/libgfortran/generated/maxloc0_4_r16.c index de37c03..ec0b06e 100644 --- a/libgfortran/generated/maxloc0_4_r16.c +++ b/libgfortran/generated/maxloc0_4_r16.c @@ -128,7 +128,7 @@ maxloc0_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_4_r4.c b/libgfortran/generated/maxloc0_4_r4.c index b69c01f..1e7f170 100644 --- a/libgfortran/generated/maxloc0_4_r4.c +++ b/libgfortran/generated/maxloc0_4_r4.c @@ -128,7 +128,7 @@ maxloc0_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_4_r8.c b/libgfortran/generated/maxloc0_4_r8.c index 8021d1b..7afbfcd 100644 --- a/libgfortran/generated/maxloc0_4_r8.c +++ b/libgfortran/generated/maxloc0_4_r8.c @@ -128,7 +128,7 @@ maxloc0_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_8_i16.c b/libgfortran/generated/maxloc0_8_i16.c index 14ce142..4400a5b 100644 --- a/libgfortran/generated/maxloc0_8_i16.c +++ b/libgfortran/generated/maxloc0_8_i16.c @@ -128,7 +128,7 @@ maxloc0_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_8_i4.c b/libgfortran/generated/maxloc0_8_i4.c index df1a27f..0d96ff3 100644 --- a/libgfortran/generated/maxloc0_8_i4.c +++ b/libgfortran/generated/maxloc0_8_i4.c @@ -128,7 +128,7 @@ maxloc0_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_8_i8.c b/libgfortran/generated/maxloc0_8_i8.c index 3400587..e749956 100644 --- a/libgfortran/generated/maxloc0_8_i8.c +++ b/libgfortran/generated/maxloc0_8_i8.c @@ -128,7 +128,7 @@ maxloc0_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_8_r10.c b/libgfortran/generated/maxloc0_8_r10.c index 70860c8..cc10ee6 100644 --- a/libgfortran/generated/maxloc0_8_r10.c +++ b/libgfortran/generated/maxloc0_8_r10.c @@ -128,7 +128,7 @@ maxloc0_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_8_r16.c b/libgfortran/generated/maxloc0_8_r16.c index e9ef7ef..e4ff821 100644 --- a/libgfortran/generated/maxloc0_8_r16.c +++ b/libgfortran/generated/maxloc0_8_r16.c @@ -128,7 +128,7 @@ maxloc0_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_8_r4.c b/libgfortran/generated/maxloc0_8_r4.c index 7dede45..088df04 100644 --- a/libgfortran/generated/maxloc0_8_r4.c +++ b/libgfortran/generated/maxloc0_8_r4.c @@ -128,7 +128,7 @@ maxloc0_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc0_8_r8.c b/libgfortran/generated/maxloc0_8_r8.c index 73531d7..f0687f5 100644 --- a/libgfortran/generated/maxloc0_8_r8.c +++ b/libgfortran/generated/maxloc0_8_r8.c @@ -128,7 +128,7 @@ maxloc0_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mmaxloc0_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/maxloc1_16_i16.c b/libgfortran/generated/maxloc1_16_i16.c index 7ba4fa5..3964c3f 100644 --- a/libgfortran/generated/maxloc1_16_i16.c +++ b/libgfortran/generated/maxloc1_16_i16.c @@ -152,7 +152,7 @@ maxloc1_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_16_i4.c b/libgfortran/generated/maxloc1_16_i4.c index af438c7..3516f22 100644 --- a/libgfortran/generated/maxloc1_16_i4.c +++ b/libgfortran/generated/maxloc1_16_i4.c @@ -152,7 +152,7 @@ maxloc1_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_16_i8.c b/libgfortran/generated/maxloc1_16_i8.c index 63de2a1..2887eb7 100644 --- a/libgfortran/generated/maxloc1_16_i8.c +++ b/libgfortran/generated/maxloc1_16_i8.c @@ -152,7 +152,7 @@ maxloc1_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_16_r10.c b/libgfortran/generated/maxloc1_16_r10.c index e78658d..826fd2e 100644 --- a/libgfortran/generated/maxloc1_16_r10.c +++ b/libgfortran/generated/maxloc1_16_r10.c @@ -152,7 +152,7 @@ maxloc1_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_16_r16.c b/libgfortran/generated/maxloc1_16_r16.c index c92dfc9..61c1077 100644 --- a/libgfortran/generated/maxloc1_16_r16.c +++ b/libgfortran/generated/maxloc1_16_r16.c @@ -152,7 +152,7 @@ maxloc1_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_16_r4.c b/libgfortran/generated/maxloc1_16_r4.c index dbe14d7..7e0d84e 100644 --- a/libgfortran/generated/maxloc1_16_r4.c +++ b/libgfortran/generated/maxloc1_16_r4.c @@ -152,7 +152,7 @@ maxloc1_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_16_r8.c b/libgfortran/generated/maxloc1_16_r8.c index 2dd3066..3b56f4c 100644 --- a/libgfortran/generated/maxloc1_16_r8.c +++ b/libgfortran/generated/maxloc1_16_r8.c @@ -152,7 +152,7 @@ maxloc1_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_4_i16.c b/libgfortran/generated/maxloc1_4_i16.c index d3609fb..0165803 100644 --- a/libgfortran/generated/maxloc1_4_i16.c +++ b/libgfortran/generated/maxloc1_4_i16.c @@ -152,7 +152,7 @@ maxloc1_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_4_i4.c b/libgfortran/generated/maxloc1_4_i4.c index d4f53a4..1109eb7 100644 --- a/libgfortran/generated/maxloc1_4_i4.c +++ b/libgfortran/generated/maxloc1_4_i4.c @@ -152,7 +152,7 @@ maxloc1_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_4_i8.c b/libgfortran/generated/maxloc1_4_i8.c index 71e8045..a530c57 100644 --- a/libgfortran/generated/maxloc1_4_i8.c +++ b/libgfortran/generated/maxloc1_4_i8.c @@ -152,7 +152,7 @@ maxloc1_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_4_r10.c b/libgfortran/generated/maxloc1_4_r10.c index 3c37659..77e9fec 100644 --- a/libgfortran/generated/maxloc1_4_r10.c +++ b/libgfortran/generated/maxloc1_4_r10.c @@ -152,7 +152,7 @@ maxloc1_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_4_r16.c b/libgfortran/generated/maxloc1_4_r16.c index 6c98b6f..ccdfbbb 100644 --- a/libgfortran/generated/maxloc1_4_r16.c +++ b/libgfortran/generated/maxloc1_4_r16.c @@ -152,7 +152,7 @@ maxloc1_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_4_r4.c b/libgfortran/generated/maxloc1_4_r4.c index e9b8d45..431a051 100644 --- a/libgfortran/generated/maxloc1_4_r4.c +++ b/libgfortran/generated/maxloc1_4_r4.c @@ -152,7 +152,7 @@ maxloc1_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_4_r8.c b/libgfortran/generated/maxloc1_4_r8.c index 4651e37..10e181f 100644 --- a/libgfortran/generated/maxloc1_4_r8.c +++ b/libgfortran/generated/maxloc1_4_r8.c @@ -152,7 +152,7 @@ maxloc1_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_8_i16.c b/libgfortran/generated/maxloc1_8_i16.c index 811bb29..b28dab4 100644 --- a/libgfortran/generated/maxloc1_8_i16.c +++ b/libgfortran/generated/maxloc1_8_i16.c @@ -152,7 +152,7 @@ maxloc1_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_8_i4.c b/libgfortran/generated/maxloc1_8_i4.c index 459d87d..72a9084 100644 --- a/libgfortran/generated/maxloc1_8_i4.c +++ b/libgfortran/generated/maxloc1_8_i4.c @@ -152,7 +152,7 @@ maxloc1_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_8_i8.c b/libgfortran/generated/maxloc1_8_i8.c index da054c0..b056e6d 100644 --- a/libgfortran/generated/maxloc1_8_i8.c +++ b/libgfortran/generated/maxloc1_8_i8.c @@ -152,7 +152,7 @@ maxloc1_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_8_r10.c b/libgfortran/generated/maxloc1_8_r10.c index 94d538e..f8a5ddb 100644 --- a/libgfortran/generated/maxloc1_8_r10.c +++ b/libgfortran/generated/maxloc1_8_r10.c @@ -152,7 +152,7 @@ maxloc1_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_8_r16.c b/libgfortran/generated/maxloc1_8_r16.c index 01b237e..26c90b7 100644 --- a/libgfortran/generated/maxloc1_8_r16.c +++ b/libgfortran/generated/maxloc1_8_r16.c @@ -152,7 +152,7 @@ maxloc1_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_8_r4.c b/libgfortran/generated/maxloc1_8_r4.c index 359cb7c..8cb1c1b 100644 --- a/libgfortran/generated/maxloc1_8_r4.c +++ b/libgfortran/generated/maxloc1_8_r4.c @@ -152,7 +152,7 @@ maxloc1_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxloc1_8_r8.c b/libgfortran/generated/maxloc1_8_r8.c index 8e91eb3..2170a76 100644 --- a/libgfortran/generated/maxloc1_8_r8.c +++ b/libgfortran/generated/maxloc1_8_r8.c @@ -152,7 +152,7 @@ maxloc1_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mmaxloc1_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxval_i16.c b/libgfortran/generated/maxval_i16.c index 77412e5..a43a506 100644 --- a/libgfortran/generated/maxval_i16.c +++ b/libgfortran/generated/maxval_i16.c @@ -146,7 +146,7 @@ maxval_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mmaxval_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxval_i4.c b/libgfortran/generated/maxval_i4.c index 2f13580..9cc078b 100644 --- a/libgfortran/generated/maxval_i4.c +++ b/libgfortran/generated/maxval_i4.c @@ -146,7 +146,7 @@ maxval_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mmaxval_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxval_i8.c b/libgfortran/generated/maxval_i8.c index 40726c0..30ab0cb 100644 --- a/libgfortran/generated/maxval_i8.c +++ b/libgfortran/generated/maxval_i8.c @@ -146,7 +146,7 @@ maxval_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mmaxval_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxval_r10.c b/libgfortran/generated/maxval_r10.c index db31988..ed88462 100644 --- a/libgfortran/generated/maxval_r10.c +++ b/libgfortran/generated/maxval_r10.c @@ -146,7 +146,7 @@ maxval_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mmaxval_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxval_r16.c b/libgfortran/generated/maxval_r16.c index abb41bb..94d6789 100644 --- a/libgfortran/generated/maxval_r16.c +++ b/libgfortran/generated/maxval_r16.c @@ -146,7 +146,7 @@ maxval_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mmaxval_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxval_r4.c b/libgfortran/generated/maxval_r4.c index 217a37b..8b3e1d4 100644 --- a/libgfortran/generated/maxval_r4.c +++ b/libgfortran/generated/maxval_r4.c @@ -146,7 +146,7 @@ maxval_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mmaxval_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/maxval_r8.c b/libgfortran/generated/maxval_r8.c index f455afc..f98ca68 100644 --- a/libgfortran/generated/maxval_r8.c +++ b/libgfortran/generated/maxval_r8.c @@ -146,7 +146,7 @@ maxval_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mmaxval_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc0_16_i16.c b/libgfortran/generated/minloc0_16_i16.c index 3a85b1b..e6cd4d1 100644 --- a/libgfortran/generated/minloc0_16_i16.c +++ b/libgfortran/generated/minloc0_16_i16.c @@ -128,7 +128,7 @@ minloc0_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_16_i4.c b/libgfortran/generated/minloc0_16_i4.c index 5fc6123..6060611 100644 --- a/libgfortran/generated/minloc0_16_i4.c +++ b/libgfortran/generated/minloc0_16_i4.c @@ -128,7 +128,7 @@ minloc0_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_16_i8.c b/libgfortran/generated/minloc0_16_i8.c index 486108f..d1c5938 100644 --- a/libgfortran/generated/minloc0_16_i8.c +++ b/libgfortran/generated/minloc0_16_i8.c @@ -128,7 +128,7 @@ minloc0_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_16_r10.c b/libgfortran/generated/minloc0_16_r10.c index e00fb50..8797d48 100644 --- a/libgfortran/generated/minloc0_16_r10.c +++ b/libgfortran/generated/minloc0_16_r10.c @@ -128,7 +128,7 @@ minloc0_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_16_r16.c b/libgfortran/generated/minloc0_16_r16.c index c6a8d8e..973a0f0 100644 --- a/libgfortran/generated/minloc0_16_r16.c +++ b/libgfortran/generated/minloc0_16_r16.c @@ -128,7 +128,7 @@ minloc0_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_16_r4.c b/libgfortran/generated/minloc0_16_r4.c index f6b10c8..dedf7f2 100644 --- a/libgfortran/generated/minloc0_16_r4.c +++ b/libgfortran/generated/minloc0_16_r4.c @@ -128,7 +128,7 @@ minloc0_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_16_r8.c b/libgfortran/generated/minloc0_16_r8.c index c129cd7..74175d9 100644 --- a/libgfortran/generated/minloc0_16_r8.c +++ b/libgfortran/generated/minloc0_16_r8.c @@ -128,7 +128,7 @@ minloc0_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_4_i16.c b/libgfortran/generated/minloc0_4_i16.c index 37233a7..5d95be6 100644 --- a/libgfortran/generated/minloc0_4_i16.c +++ b/libgfortran/generated/minloc0_4_i16.c @@ -128,7 +128,7 @@ minloc0_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_4_i4.c b/libgfortran/generated/minloc0_4_i4.c index c246b96..f03f004 100644 --- a/libgfortran/generated/minloc0_4_i4.c +++ b/libgfortran/generated/minloc0_4_i4.c @@ -128,7 +128,7 @@ minloc0_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_4_i8.c b/libgfortran/generated/minloc0_4_i8.c index 8b03ceb..b8c2a20 100644 --- a/libgfortran/generated/minloc0_4_i8.c +++ b/libgfortran/generated/minloc0_4_i8.c @@ -128,7 +128,7 @@ minloc0_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_4_r10.c b/libgfortran/generated/minloc0_4_r10.c index 06664d8..2f70c74 100644 --- a/libgfortran/generated/minloc0_4_r10.c +++ b/libgfortran/generated/minloc0_4_r10.c @@ -128,7 +128,7 @@ minloc0_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_4_r16.c b/libgfortran/generated/minloc0_4_r16.c index 29c880c..f5ba63c 100644 --- a/libgfortran/generated/minloc0_4_r16.c +++ b/libgfortran/generated/minloc0_4_r16.c @@ -128,7 +128,7 @@ minloc0_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_4_r4.c b/libgfortran/generated/minloc0_4_r4.c index 99c6c2f..7f19c53 100644 --- a/libgfortran/generated/minloc0_4_r4.c +++ b/libgfortran/generated/minloc0_4_r4.c @@ -128,7 +128,7 @@ minloc0_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_4_r8.c b/libgfortran/generated/minloc0_4_r8.c index 08d645e..2501b66 100644 --- a/libgfortran/generated/minloc0_4_r8.c +++ b/libgfortran/generated/minloc0_4_r8.c @@ -128,7 +128,7 @@ minloc0_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_8_i16.c b/libgfortran/generated/minloc0_8_i16.c index f669a93..af56f6c 100644 --- a/libgfortran/generated/minloc0_8_i16.c +++ b/libgfortran/generated/minloc0_8_i16.c @@ -128,7 +128,7 @@ minloc0_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_8_i4.c b/libgfortran/generated/minloc0_8_i4.c index 349c8b3..5bcfec0 100644 --- a/libgfortran/generated/minloc0_8_i4.c +++ b/libgfortran/generated/minloc0_8_i4.c @@ -128,7 +128,7 @@ minloc0_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_8_i8.c b/libgfortran/generated/minloc0_8_i8.c index 00d737e..1f7f7fd 100644 --- a/libgfortran/generated/minloc0_8_i8.c +++ b/libgfortran/generated/minloc0_8_i8.c @@ -128,7 +128,7 @@ minloc0_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_8_r10.c b/libgfortran/generated/minloc0_8_r10.c index c95778c..72b7ed5 100644 --- a/libgfortran/generated/minloc0_8_r10.c +++ b/libgfortran/generated/minloc0_8_r10.c @@ -128,7 +128,7 @@ minloc0_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_8_r16.c b/libgfortran/generated/minloc0_8_r16.c index 1d968f8..ca46545 100644 --- a/libgfortran/generated/minloc0_8_r16.c +++ b/libgfortran/generated/minloc0_8_r16.c @@ -128,7 +128,7 @@ minloc0_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_8_r4.c b/libgfortran/generated/minloc0_8_r4.c index f83af93..45ac73b 100644 --- a/libgfortran/generated/minloc0_8_r4.c +++ b/libgfortran/generated/minloc0_8_r4.c @@ -128,7 +128,7 @@ minloc0_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc0_8_r8.c b/libgfortran/generated/minloc0_8_r8.c index 8784b28..67bd888 100644 --- a/libgfortran/generated/minloc0_8_r8.c +++ b/libgfortran/generated/minloc0_8_r8.c @@ -128,7 +128,7 @@ minloc0_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; n++; if (n == rank) @@ -253,7 +253,7 @@ mminloc0_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; n++; diff --git a/libgfortran/generated/minloc1_16_i16.c b/libgfortran/generated/minloc1_16_i16.c index e1aa42a..d27e5b3 100644 --- a/libgfortran/generated/minloc1_16_i16.c +++ b/libgfortran/generated/minloc1_16_i16.c @@ -152,7 +152,7 @@ minloc1_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_16_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_16_i4.c b/libgfortran/generated/minloc1_16_i4.c index 6a42d90..64925cd 100644 --- a/libgfortran/generated/minloc1_16_i4.c +++ b/libgfortran/generated/minloc1_16_i4.c @@ -152,7 +152,7 @@ minloc1_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_16_i4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_16_i8.c b/libgfortran/generated/minloc1_16_i8.c index 72d0f94..7ec2c1c 100644 --- a/libgfortran/generated/minloc1_16_i8.c +++ b/libgfortran/generated/minloc1_16_i8.c @@ -152,7 +152,7 @@ minloc1_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_16_i8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_16_r10.c b/libgfortran/generated/minloc1_16_r10.c index 16d5903..7865d7e 100644 --- a/libgfortran/generated/minloc1_16_r10.c +++ b/libgfortran/generated/minloc1_16_r10.c @@ -152,7 +152,7 @@ minloc1_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_16_r10 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_16_r16.c b/libgfortran/generated/minloc1_16_r16.c index aee2cd1..8e0b36e 100644 --- a/libgfortran/generated/minloc1_16_r16.c +++ b/libgfortran/generated/minloc1_16_r16.c @@ -152,7 +152,7 @@ minloc1_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_16_r16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_16_r4.c b/libgfortran/generated/minloc1_16_r4.c index 16bbfea..8d7f1f1 100644 --- a/libgfortran/generated/minloc1_16_r4.c +++ b/libgfortran/generated/minloc1_16_r4.c @@ -152,7 +152,7 @@ minloc1_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_16_r4 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_16_r8.c b/libgfortran/generated/minloc1_16_r8.c index fe7c940..dd4be68 100644 --- a/libgfortran/generated/minloc1_16_r8.c +++ b/libgfortran/generated/minloc1_16_r8.c @@ -152,7 +152,7 @@ minloc1_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_16_r8 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_4_i16.c b/libgfortran/generated/minloc1_4_i16.c index 327e8c9..ce865e8 100644 --- a/libgfortran/generated/minloc1_4_i16.c +++ b/libgfortran/generated/minloc1_4_i16.c @@ -152,7 +152,7 @@ minloc1_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_4_i16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_4_i4.c b/libgfortran/generated/minloc1_4_i4.c index a7dfa1f..4032f1e 100644 --- a/libgfortran/generated/minloc1_4_i4.c +++ b/libgfortran/generated/minloc1_4_i4.c @@ -152,7 +152,7 @@ minloc1_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_4_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_4_i8.c b/libgfortran/generated/minloc1_4_i8.c index 34d0192..648a658 100644 --- a/libgfortran/generated/minloc1_4_i8.c +++ b/libgfortran/generated/minloc1_4_i8.c @@ -152,7 +152,7 @@ minloc1_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_4_i8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_4_r10.c b/libgfortran/generated/minloc1_4_r10.c index 1a0d1b5..88ae082 100644 --- a/libgfortran/generated/minloc1_4_r10.c +++ b/libgfortran/generated/minloc1_4_r10.c @@ -152,7 +152,7 @@ minloc1_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_4_r10 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_4_r16.c b/libgfortran/generated/minloc1_4_r16.c index ea3f020..fdf995a 100644 --- a/libgfortran/generated/minloc1_4_r16.c +++ b/libgfortran/generated/minloc1_4_r16.c @@ -152,7 +152,7 @@ minloc1_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_4_r16 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_4_r4.c b/libgfortran/generated/minloc1_4_r4.c index c788433..ca98b5a 100644 --- a/libgfortran/generated/minloc1_4_r4.c +++ b/libgfortran/generated/minloc1_4_r4.c @@ -152,7 +152,7 @@ minloc1_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_4_r4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_4_r8.c b/libgfortran/generated/minloc1_4_r8.c index ba96e5f..532954d 100644 --- a/libgfortran/generated/minloc1_4_r8.c +++ b/libgfortran/generated/minloc1_4_r8.c @@ -152,7 +152,7 @@ minloc1_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_4_r8 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_8_i16.c b/libgfortran/generated/minloc1_8_i16.c index 817b20e..83cdc6b 100644 --- a/libgfortran/generated/minloc1_8_i16.c +++ b/libgfortran/generated/minloc1_8_i16.c @@ -152,7 +152,7 @@ minloc1_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_8_i16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_8_i4.c b/libgfortran/generated/minloc1_8_i4.c index e087776..6382e9b 100644 --- a/libgfortran/generated/minloc1_8_i4.c +++ b/libgfortran/generated/minloc1_8_i4.c @@ -152,7 +152,7 @@ minloc1_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_8_i4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_8_i8.c b/libgfortran/generated/minloc1_8_i8.c index 5c8e882..82c3836 100644 --- a/libgfortran/generated/minloc1_8_i8.c +++ b/libgfortran/generated/minloc1_8_i8.c @@ -152,7 +152,7 @@ minloc1_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_8_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_8_r10.c b/libgfortran/generated/minloc1_8_r10.c index ade86ac..8cb2e28 100644 --- a/libgfortran/generated/minloc1_8_r10.c +++ b/libgfortran/generated/minloc1_8_r10.c @@ -152,7 +152,7 @@ minloc1_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_8_r10 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_8_r16.c b/libgfortran/generated/minloc1_8_r16.c index 4137672b..74eb70b 100644 --- a/libgfortran/generated/minloc1_8_r16.c +++ b/libgfortran/generated/minloc1_8_r16.c @@ -152,7 +152,7 @@ minloc1_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_8_r16 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_8_r4.c b/libgfortran/generated/minloc1_8_r4.c index 643ffa4..a6ed57e 100644 --- a/libgfortran/generated/minloc1_8_r4.c +++ b/libgfortran/generated/minloc1_8_r4.c @@ -152,7 +152,7 @@ minloc1_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_8_r4 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minloc1_8_r8.c b/libgfortran/generated/minloc1_8_r8.c index e9e876f..b03e497 100644 --- a/libgfortran/generated/minloc1_8_r8.c +++ b/libgfortran/generated/minloc1_8_r8.c @@ -152,7 +152,7 @@ minloc1_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -309,7 +309,7 @@ mminloc1_8_r8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minval_i16.c b/libgfortran/generated/minval_i16.c index 7854fd4..a2e7ed8 100644 --- a/libgfortran/generated/minval_i16.c +++ b/libgfortran/generated/minval_i16.c @@ -146,7 +146,7 @@ minval_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mminval_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minval_i4.c b/libgfortran/generated/minval_i4.c index a833529..e22a773 100644 --- a/libgfortran/generated/minval_i4.c +++ b/libgfortran/generated/minval_i4.c @@ -146,7 +146,7 @@ minval_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mminval_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minval_i8.c b/libgfortran/generated/minval_i8.c index 9b3de20..ff28957 100644 --- a/libgfortran/generated/minval_i8.c +++ b/libgfortran/generated/minval_i8.c @@ -146,7 +146,7 @@ minval_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mminval_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minval_r10.c b/libgfortran/generated/minval_r10.c index 85b51c61..4bbe200 100644 --- a/libgfortran/generated/minval_r10.c +++ b/libgfortran/generated/minval_r10.c @@ -146,7 +146,7 @@ minval_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mminval_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minval_r16.c b/libgfortran/generated/minval_r16.c index 556d14c..4e16dbf 100644 --- a/libgfortran/generated/minval_r16.c +++ b/libgfortran/generated/minval_r16.c @@ -146,7 +146,7 @@ minval_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mminval_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minval_r4.c b/libgfortran/generated/minval_r4.c index 9fe32a9..0f1a00f 100644 --- a/libgfortran/generated/minval_r4.c +++ b/libgfortran/generated/minval_r4.c @@ -146,7 +146,7 @@ minval_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mminval_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/minval_r8.c b/libgfortran/generated/minval_r8.c index f713332..4bb7799 100644 --- a/libgfortran/generated/minval_r8.c +++ b/libgfortran/generated/minval_r8.c @@ -146,7 +146,7 @@ minval_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -298,7 +298,7 @@ mminval_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_c10.c b/libgfortran/generated/product_c10.c index af3e3c2..f5434ef 100644 --- a/libgfortran/generated/product_c10.c +++ b/libgfortran/generated/product_c10.c @@ -144,7 +144,7 @@ product_c10 (gfc_array_c10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_c10 (gfc_array_c10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_c16.c b/libgfortran/generated/product_c16.c index f913b5f..382e419 100644 --- a/libgfortran/generated/product_c16.c +++ b/libgfortran/generated/product_c16.c @@ -144,7 +144,7 @@ product_c16 (gfc_array_c16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_c16 (gfc_array_c16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_c4.c b/libgfortran/generated/product_c4.c index 68144dc..5a40f84 100644 --- a/libgfortran/generated/product_c4.c +++ b/libgfortran/generated/product_c4.c @@ -144,7 +144,7 @@ product_c4 (gfc_array_c4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_c4 (gfc_array_c4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_c8.c b/libgfortran/generated/product_c8.c index 183e5b2..d057ec9 100644 --- a/libgfortran/generated/product_c8.c +++ b/libgfortran/generated/product_c8.c @@ -144,7 +144,7 @@ product_c8 (gfc_array_c8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_c8 (gfc_array_c8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_i16.c b/libgfortran/generated/product_i16.c index 7bd1c66..33db08f 100644 --- a/libgfortran/generated/product_i16.c +++ b/libgfortran/generated/product_i16.c @@ -144,7 +144,7 @@ product_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_i4.c b/libgfortran/generated/product_i4.c index 8bf7e64..69e1826 100644 --- a/libgfortran/generated/product_i4.c +++ b/libgfortran/generated/product_i4.c @@ -144,7 +144,7 @@ product_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_i8.c b/libgfortran/generated/product_i8.c index c5f9e09..f62a281 100644 --- a/libgfortran/generated/product_i8.c +++ b/libgfortran/generated/product_i8.c @@ -144,7 +144,7 @@ product_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_r10.c b/libgfortran/generated/product_r10.c index 091cec3..26e3f04 100644 --- a/libgfortran/generated/product_r10.c +++ b/libgfortran/generated/product_r10.c @@ -144,7 +144,7 @@ product_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_r16.c b/libgfortran/generated/product_r16.c index 4a059a9..2fc1ca1 100644 --- a/libgfortran/generated/product_r16.c +++ b/libgfortran/generated/product_r16.c @@ -144,7 +144,7 @@ product_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_r4.c b/libgfortran/generated/product_r4.c index 763dd95..f0723c6 100644 --- a/libgfortran/generated/product_r4.c +++ b/libgfortran/generated/product_r4.c @@ -144,7 +144,7 @@ product_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/product_r8.c b/libgfortran/generated/product_r8.c index 4336499..a829ff8 100644 --- a/libgfortran/generated/product_r8.c +++ b/libgfortran/generated/product_r8.c @@ -144,7 +144,7 @@ product_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ mproduct_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/reshape_c10.c b/libgfortran/generated/reshape_c10.c index 008dc23..7aa7f43 100644 --- a/libgfortran/generated/reshape_c10.c +++ b/libgfortran/generated/reshape_c10.c @@ -200,7 +200,7 @@ reshape_c10 (gfc_array_c10 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_c10 (gfc_array_c10 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_c16.c b/libgfortran/generated/reshape_c16.c index c176f2f..cc1fd0d 100644 --- a/libgfortran/generated/reshape_c16.c +++ b/libgfortran/generated/reshape_c16.c @@ -200,7 +200,7 @@ reshape_c16 (gfc_array_c16 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_c16 (gfc_array_c16 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_c4.c b/libgfortran/generated/reshape_c4.c index d713284..5e7d855 100644 --- a/libgfortran/generated/reshape_c4.c +++ b/libgfortran/generated/reshape_c4.c @@ -200,7 +200,7 @@ reshape_c4 (gfc_array_c4 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_c4 (gfc_array_c4 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_c8.c b/libgfortran/generated/reshape_c8.c index 5c0e1ab..aecacac 100644 --- a/libgfortran/generated/reshape_c8.c +++ b/libgfortran/generated/reshape_c8.c @@ -200,7 +200,7 @@ reshape_c8 (gfc_array_c8 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_c8 (gfc_array_c8 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_i16.c b/libgfortran/generated/reshape_i16.c index e7767dc..0b4da5c 100644 --- a/libgfortran/generated/reshape_i16.c +++ b/libgfortran/generated/reshape_i16.c @@ -200,7 +200,7 @@ reshape_16 (gfc_array_i16 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_16 (gfc_array_i16 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_i4.c b/libgfortran/generated/reshape_i4.c index e2f38e7..413762e 100644 --- a/libgfortran/generated/reshape_i4.c +++ b/libgfortran/generated/reshape_i4.c @@ -200,7 +200,7 @@ reshape_4 (gfc_array_i4 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_4 (gfc_array_i4 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_i8.c b/libgfortran/generated/reshape_i8.c index 5d54b07..0cd861a 100644 --- a/libgfortran/generated/reshape_i8.c +++ b/libgfortran/generated/reshape_i8.c @@ -200,7 +200,7 @@ reshape_8 (gfc_array_i8 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_8 (gfc_array_i8 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_r10.c b/libgfortran/generated/reshape_r10.c index fe514c7..5069e45 100644 --- a/libgfortran/generated/reshape_r10.c +++ b/libgfortran/generated/reshape_r10.c @@ -200,7 +200,7 @@ reshape_r10 (gfc_array_r10 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_r10 (gfc_array_r10 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_r16.c b/libgfortran/generated/reshape_r16.c index 3f260c1..d954c43 100644 --- a/libgfortran/generated/reshape_r16.c +++ b/libgfortran/generated/reshape_r16.c @@ -200,7 +200,7 @@ reshape_r16 (gfc_array_r16 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_r16 (gfc_array_r16 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_r4.c b/libgfortran/generated/reshape_r4.c index acd73a4..72eb06e 100644 --- a/libgfortran/generated/reshape_r4.c +++ b/libgfortran/generated/reshape_r4.c @@ -200,7 +200,7 @@ reshape_r4 (gfc_array_r4 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_r4 (gfc_array_r4 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/reshape_r8.c b/libgfortran/generated/reshape_r8.c index 5f80f4c..065fb3d 100644 --- a/libgfortran/generated/reshape_r8.c +++ b/libgfortran/generated/reshape_r8.c @@ -200,7 +200,7 @@ reshape_r8 (gfc_array_r8 * const restrict ret, the next dimension. */ rcount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ rptr -= rstride[n] * rextent[n]; n++; if (n == rdim) @@ -223,7 +223,7 @@ reshape_r8 (gfc_array_r8 * const restrict ret, the next dimension. */ scount[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ src -= sstride[n] * sextent[n]; n++; if (n == sdim) diff --git a/libgfortran/generated/sum_c10.c b/libgfortran/generated/sum_c10.c index 7bd3b79..34788c5 100644 --- a/libgfortran/generated/sum_c10.c +++ b/libgfortran/generated/sum_c10.c @@ -144,7 +144,7 @@ sum_c10 (gfc_array_c10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_c10 (gfc_array_c10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_c16.c b/libgfortran/generated/sum_c16.c index a5f66c5..ba1b057 100644 --- a/libgfortran/generated/sum_c16.c +++ b/libgfortran/generated/sum_c16.c @@ -144,7 +144,7 @@ sum_c16 (gfc_array_c16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_c16 (gfc_array_c16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_c4.c b/libgfortran/generated/sum_c4.c index 17d9e91..e3f9e67 100644 --- a/libgfortran/generated/sum_c4.c +++ b/libgfortran/generated/sum_c4.c @@ -144,7 +144,7 @@ sum_c4 (gfc_array_c4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_c4 (gfc_array_c4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_c8.c b/libgfortran/generated/sum_c8.c index d5bd3aa..18e45c3 100644 --- a/libgfortran/generated/sum_c8.c +++ b/libgfortran/generated/sum_c8.c @@ -144,7 +144,7 @@ sum_c8 (gfc_array_c8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_c8 (gfc_array_c8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_i16.c b/libgfortran/generated/sum_i16.c index 33911eb..95c4c326 100644 --- a/libgfortran/generated/sum_i16.c +++ b/libgfortran/generated/sum_i16.c @@ -144,7 +144,7 @@ sum_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_i16 (gfc_array_i16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_i4.c b/libgfortran/generated/sum_i4.c index 03d7ce2..3421a20 100644 --- a/libgfortran/generated/sum_i4.c +++ b/libgfortran/generated/sum_i4.c @@ -144,7 +144,7 @@ sum_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_i4 (gfc_array_i4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_i8.c b/libgfortran/generated/sum_i8.c index 177aae6..b67f576 100644 --- a/libgfortran/generated/sum_i8.c +++ b/libgfortran/generated/sum_i8.c @@ -144,7 +144,7 @@ sum_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_i8 (gfc_array_i8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_r10.c b/libgfortran/generated/sum_r10.c index 87531d3..730b068 100644 --- a/libgfortran/generated/sum_r10.c +++ b/libgfortran/generated/sum_r10.c @@ -144,7 +144,7 @@ sum_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_r10 (gfc_array_r10 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_r16.c b/libgfortran/generated/sum_r16.c index ea59713..af7f5c8 100644 --- a/libgfortran/generated/sum_r16.c +++ b/libgfortran/generated/sum_r16.c @@ -144,7 +144,7 @@ sum_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_r16 (gfc_array_r16 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_r4.c b/libgfortran/generated/sum_r4.c index 2c4441d..7d30805 100644 --- a/libgfortran/generated/sum_r4.c +++ b/libgfortran/generated/sum_r4.c @@ -144,7 +144,7 @@ sum_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_r4 (gfc_array_r4 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; diff --git a/libgfortran/generated/sum_r8.c b/libgfortran/generated/sum_r8.c index 6a68db0..6e07e2a 100644 --- a/libgfortran/generated/sum_r8.c +++ b/libgfortran/generated/sum_r8.c @@ -144,7 +144,7 @@ sum_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; dest -= dstride[n] * extent[n]; n++; @@ -296,7 +296,7 @@ msum_r8 (gfc_array_r8 * const restrict retarray, the next dimension. */ count[n] = 0; /* We could precalculate these products, but this is a less - frequently used path so proabably not worth it. */ + frequently used path so probably not worth it. */ base -= sstride[n] * extent[n]; mbase -= mstride[n] * extent[n]; dest -= dstride[n] * extent[n]; |