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
This commit is contained in:
Francois-Xavier Coudert
François-Xavier Coudert
parent
065a4d36bc
commit
5d7adf7a15
|
|
@ -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
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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];
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
|
|
@ -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++;
|
||||
|
|
|
|||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue