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 /libgfortran | |
| parent | 065a4d36bca538c11061971e7b8407c0da799951 (diff) | |
| download | gcc-5d7adf7a1573b3ab23d9a2d70fbf30a8ef0c4958.tar.gz | |
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
Diffstat (limited to 'libgfortran')
170 files changed, 472 insertions, 300 deletions
diff --git a/libgfortran/ChangeLog b/libgfortran/ChangeLog index 5a51c53cadb..19c2a92a3f6 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 91f342aee1d..4ad871d306a 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 7cb4ae1a6d7..fbfcd8bd65b 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 bc3928a8fa7..b41c4c2b22b 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 e4fce4b9f6e..ad4516c123a 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 d026abd2b9b..6f922fdac17 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 232ebfadda5..2a379d3d519 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 c3402a0bc0f..92b2247f3bd 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 433096dd3dc..91811530cdd 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 4a363dc08d0..de41758ced3 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 df29e33961e..ad9b9016c2c 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 fcbe0812f32..f5a46bf1a47 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 2563e88ecd1..5ec58bf4f60 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 3b8172d7f85..87c291eeba7 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 a322b1b1913..1a5451bf3e2 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 48a60b15e09..b255d9d36ab 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 c264bb13f92..bf7845b7ac7 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 8eba7b331aa..1b3d07f2942 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 d8d0f898377..58fc0361362 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 bfb051fe1c6..4cb01c85d55 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 922c46c6830..2528597b46d 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 ea23adfaabf..0ca9844e293 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 3a8b046bc8e..3c75a42ae8f 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 cfbf449901e..a8e54d06049 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 402318ff606..8590554b0d2 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 1c51349d088..2c5326f9c0d 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 ca6af477ef9..912858b35f2 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 f16392b3ca9..e4a7fc84f42 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 abcf571dbd8..17a3bdedbd5 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 205c1020150..96a2bb4a5cf 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 0d2ef2dd261..04e17b817e3 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 b9be8b33582..f7b27e05ea1 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 d4fe858b5c5..96e6833a034 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 ad5fa0717cc..3c2fc796981 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 de1b48664ba..9ea8a36b125 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 70f22e41c29..a71a71948ea 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 b64b8bdaf65..f8f6ea74b95 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 01363492103..3ac0298bcd1 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 3f21843c7eb..84e28f94ae9 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 1883557545c..04ebbd4fdc1 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 187a6c8c694..4362fa889b5 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 c51a70b9228..aeb0aedcb29 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 75c3f7a86f3..e170fca9faa 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 4754bbd487d..4f2c466c92a 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 007932e1838..bc4a63d0075 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 6c004b02cad..ed51b8a55ef 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 a8b3bab824e..6d052911f44 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 8fe240c9a7e..16ee31ede31 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 dd816defcd8..58c6509d23d 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 db829a90218..e918875362e 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 de37c032a60..ec0b06e6509 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 b69c01fabc0..1e7f1705343 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 8021d1b9288..7afbfcde32c 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 14ce1422635..4400a5b52f4 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 df1a27fd16d..0d96ff3636d 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 3400587250f..e7499568d4b 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 70860c8a9bd..cc10ee6b05f 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 e9ef7ef4060..e4ff82140cb 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 7dede4597e1..088df049330 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 73531d713f9..f0687f5f769 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 7ba4fa56360..3964c3fd865 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 af438c7758a..3516f22e5e2 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 63de2a1a94e..2887eb7c7b2 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 e78658d58f5..826fd2e17cc 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 c92dfc9cc39..61c10773cf2 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 dbe14d7cf08..7e0d84e04b0 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 2dd306620ad..3b56f4c1d9b 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 d3609fb6ef7..016580373d1 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 d4f53a4bcb2..1109eb7c022 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 71e804560a1..a530c57ed01 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 3c376591fc3..77e9fec6889 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 6c98b6f0ada..ccdfbbb8b2f 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 e9b8d454cf5..431a051023d 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 4651e3751fd..10e181f341d 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 811bb294543..b28dab49742 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 459d87db0ff..72a9084e341 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 da054c05b51..b056e6d1f0f 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 94d538eeeca..f8a5ddb7b48 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 01b237eb976..26c90b76bbc 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 359cb7c1543..8cb1c1b5a62 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 8e91eb3d2fb..2170a76d9b5 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 77412e50d32..a43a50698c0 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 2f135802179..9cc078b67a3 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 40726c01287..30ab0cb79a6 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 db319884bb5..ed884622dd0 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 abb41bb1809..94d6789a2eb 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 217a37b19ee..8b3e1d41965 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 f455afc5fdf..f98ca68b9f8 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 3a85b1bad71..e6cd4d1b3c2 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 5fc61237e46..6060611d821 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 486108fed4b..d1c5938b744 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 e00fb5032d5..8797d48598f 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 c6a8d8e5e7a..973a0f0a617 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 f6b10c83a42..dedf7f2c44a 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 c129cd70d2f..74175d9aa6a 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 37233a78e2b..5d95be6e9ca 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 c246b96ff29..f03f004908a 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 8b03ceba63d..b8c2a206eee 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 06664d89ece..2f70c745345 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 29c880c6845..f5ba63ce4e9 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 99c6c2f318b..7f19c539878 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 08d645ea584..2501b6673c6 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 f669a93dcb6..af56f6cefb3 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 349c8b3c525..5bcfec09ba1 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 00d737e9a5c..1f7f7fd510a 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 c95778c5765..72b7ed5f2bf 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 1d968f89607..ca465453810 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 f83af9366a5..45ac73ba005 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 8784b280b09..67bd8884b12 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 e1aa42abad9..d27e5b3dd76 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 6a42d90baa4..64925cdf132 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 72d0f94f213..7ec2c1cc9e6 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 16d5903ff9d..7865d7ed9eb 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 aee2cd1a9b8..8e0b36e640f 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 16bbfeaea03..8d7f1f15a6b 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 fe7c940bbe7..dd4be68c7eb 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 327e8c9116d..ce865e810e6 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 a7dfa1f6396..4032f1ef741 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 34d0192861e..648a658ecf1 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 1a0d1b55562..88ae0826074 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 ea3f0201709..fdf995a98cb 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 c788433d13c..ca98b5a8c91 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 ba96e5f10a3..532954d176d 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 817b20e78c9..83cdc6b748a 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 e087776f4b8..6382e9b6053 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 5c8e882b44b..82c3836cae8 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 ade86acdd46..8cb2e28174a 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 4137672b9d5..74eb70bc354 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 643ffa483a1..a6ed57e349a 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 e9e876ff2de..b03e4974bc2 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 7854fd4c7fd..a2e7ed84bfb 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 a833529a06b..e22a773d412 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 9b3de20f3c1..ff289574685 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 85b51c61eb9..4bbe2002c81 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 556d14c4d1a..4e16dbf257f 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 9fe32a9a7e5..0f1a00f29b0 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 f7133320558..4bb77996653 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 af3e3c29c5e..f5434efd256 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 f913b5f2b29..382e4192d09 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 68144dcfbe2..5a40f8430d7 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 183e5b2dff7..d057ec99429 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 7bd1c66247c..33db08f70b0 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 8bf7e648027..69e1826f31e 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 c5f9e09e5a4..f62a281f2ad 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 091cec3ca61..26e3f04e69c 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 4a059a9c44c..2fc1ca1a130 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 763dd95e2b2..f0723c69a0e 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 43364994a17..a829ff80019 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 008dc2329d7..7aa7f43eef6 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 c176f2f511d..cc1fd0dec5b 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 d7132848728..5e7d855be84 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 5c0e1ab5566..aecacac9d16 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 e7767dc8df9..0b4da5c957f 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 e2f38e7e796..413762e6043 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 5d54b074d4b..0cd861a5060 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 fe514c72173..5069e45cdb1 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 3f260c11ed1..d954c43e1c7 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 acd73a4935a..72eb06e9af1 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 5f80f4cf677..065fb3d351d 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 7bd3b79a320..34788c55e9e 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 a5f66c5925a..ba1b0571fd5 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 17d9e911704..e3f9e67d46f 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 d5bd3aa029c..18e45c39812 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 33911ebd6f0..95c4c3269f6 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 03d7ce20dcc..3421a202fe7 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 177aae61a33..b67f576907c 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 87531d313ca..730b0688981 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 ea59713ca70..af7f5c8f9e3 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 2c4441d11c9..7d30805c195 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 6a68db05243..6e07e2a8fa7 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]; |