OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

bessel.m4: Remove useless statement. 

2012-10-28  Tobias Burnus  <burnus@net-b.de>

         * m4/bessel.m4: Remove useless statement.
         * m4/ifunction.m4: Remove unreachable code.
         * generated/bessel_r10.c: Regenerated.
         * generated/bessel_r16.c: Regenerated.
         * generated/bessel_r4.c: Regenerated.
         * generated/bessel_r8.c: Regenerated.
         * generated/iall_i1.c: Regenerated.
         * generated/iall_i16.c: Regenerated.
         * generated/iall_i2.c: Regenerated.
         * generated/iall_i4.c: Regenerated.
         * generated/iall_i8.c: Regenerated.
         * generated/iany_i1.c: Regenerated.
         * generated/iany_i16.c: Regenerated.
         * generated/iany_i2.c: Regenerated.
         * generated/iany_i4.c: Regenerated.
         * generated/iany_i8.c: Regenerated.
         * generated/iparity_i1.c: Regenerated.
         * generated/iparity_i16.c: Regenerated.
         * generated/iparity_i2.c: Regenerated.
         * generated/iparity_i4.c: Regenerated.
         * generated/iparity_i8.c: Regenerated.
         * generated/maxloc1_16_i1.c: Regenerated.
         * generated/maxloc1_16_i16.c: Regenerated.
         * generated/maxloc1_16_i2.c: Regenerated.
         * generated/maxloc1_16_i4.c: Regenerated.
         * generated/maxloc1_16_i8.c: Regenerated.
         * generated/maxloc1_16_r10.c: Regenerated.
         * generated/maxloc1_16_r16.c: Regenerated.
         * generated/maxloc1_16_r4.c: Regenerated.
         * generated/maxloc1_16_r8.c: Regenerated.
         * generated/maxloc1_4_i1.c: Regenerated.
         * generated/maxloc1_4_i16.c: Regenerated.
         * generated/maxloc1_4_i2.c: Regenerated.
         * generated/maxloc1_4_i4.c: Regenerated.
         * generated/maxloc1_4_i8.c: Regenerated.
         * generated/maxloc1_4_r10.c: Regenerated.
         * generated/maxloc1_4_r16.c: Regenerated.
         * generated/maxloc1_4_r4.c: Regenerated.
         * generated/maxloc1_4_r8.c: Regenerated.
         * generated/maxloc1_8_i1.c: Regenerated.
         * generated/maxloc1_8_i16.c: Regenerated.
         * generated/maxloc1_8_i2.c: Regenerated.
         * generated/maxloc1_8_i4.c: Regenerated.
         * generated/maxloc1_8_i8.c: Regenerated.
         * generated/maxloc1_8_r10.c: Regenerated.
         * generated/maxloc1_8_r16.c: Regenerated.
         * generated/maxloc1_8_r4.c: Regenerated.
         * generated/maxloc1_8_r8.c: Regenerated.
         * generated/maxval_i1.c: Regenerated.
         * generated/maxval_i16.c: Regenerated.
         * generated/maxval_i2.c: Regenerated.
         * generated/maxval_i4.c: Regenerated.
         * generated/maxval_i8.c: Regenerated.
         * generated/maxval_r10.c: Regenerated.
         * generated/maxval_r16.c: Regenerated.
         * generated/maxval_r4.c: Regenerated.
         * generated/maxval_r8.c: Regenerated.
         * generated/minloc1_16_i1.c: Regenerated.
         * generated/minloc1_16_i16.c: Regenerated.
         * generated/minloc1_16_i2.c: Regenerated.
         * generated/minloc1_16_i4.c: Regenerated.
         * generated/minloc1_16_i8.c: Regenerated.
         * generated/minloc1_16_r10.c: Regenerated.
         * generated/minloc1_16_r16.c: Regenerated.
         * generated/minloc1_16_r4.c: Regenerated.
         * generated/minloc1_16_r8.c: Regenerated.
         * generated/minloc1_4_i1.c: Regenerated.
         * generated/minloc1_4_i16.c: Regenerated.
         * generated/minloc1_4_i2.c: Regenerated.
         * generated/minloc1_4_i4.c: Regenerated.
         * generated/minloc1_4_i8.c: Regenerated.
         * generated/minloc1_4_r10.c: Regenerated.
         * generated/minloc1_4_r16.c: Regenerated.
         * generated/minloc1_4_r4.c: Regenerated.
         * generated/minloc1_4_r8.c: Regenerated.
         * generated/minloc1_8_i1.c: Regenerated.
         * generated/minloc1_8_i16.c: Regenerated.
         * generated/minloc1_8_i2.c: Regenerated.
         * generated/minloc1_8_i4.c: Regenerated.
         * generated/minloc1_8_i8.c: Regenerated.
         * generated/minloc1_8_r10.c: Regenerated.
         * generated/minloc1_8_r16.c: Regenerated.
         * generated/minloc1_8_r4.c: Regenerated.
         * generated/minloc1_8_r8.c: Regenerated.
         * generated/minval_i1.c: Regenerated.
         * generated/minval_i16.c: Regenerated.
         * generated/minval_i2.c: Regenerated.
         * generated/minval_i4.c: Regenerated.
         * generated/minval_i8.c: Regenerated.
         * generated/minval_r10.c: Regenerated.
         * generated/minval_r16.c: Regenerated.
         * generated/minval_r4.c: Regenerated.
         * generated/minval_r8.c: Regenerated.
         * generated/product_c10.c: Regenerated.
         * generated/product_c16.c: Regenerated.
         * generated/product_c4.c: Regenerated.
         * generated/product_c8.c: Regenerated.
         * generated/product_i1.c: Regenerated.
         * generated/product_i16.c: Regenerated.
         * generated/product_i2.c: Regenerated.
         * generated/product_i4.c: Regenerated.
         * generated/product_i8.c: Regenerated.
         * generated/product_r10.c: Regenerated.
         * generated/product_r16.c: Regenerated.
         * generated/product_r4.c: Regenerated.
         * generated/product_r8.c: Regenerated.
         * generated/sum_c10.c: Regenerated.
         * generated/sum_c16.c: Regenerated.
         * generated/sum_c4.c: Regenerated.
         * generated/sum_c8.c: Regenerated.
         * generated/sum_i1.c: Regenerated.
         * generated/sum_i16.c: Regenerated.
         * generated/sum_i2.c: Regenerated.
         * generated/sum_i4.c: Regenerated.
         * generated/sum_i8.c: Regenerated.
         * generated/sum_r10.c: Regenerated.
         * generated/sum_r16.c: Regenerated.
         * generated/sum_r4.c: Regenerated.
         * generated/sum_r8.c: Regenerated.

From-SVN: r192895
This commit is contained in:
Tobias Burnus 2012-10-28 17:54:44 +01:00 committed by Tobias Burnus
parent 937b190d75
commit 036e177573
120 changed files with 352 additions and 805 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

122
libgfortran/ChangeLog
View File

@ -1,3 +1,125 @@
2012-10-28 Tobias Burnus <burnus@net-b.de>
* m4/bessel.m4: Remove useless statement.
* m4/ifunction.m4: Remove unreachable code.
* generated/bessel_r10.c: Regenerated.
* generated/bessel_r16.c: Regenerated.
* generated/bessel_r4.c: Regenerated.
* generated/bessel_r8.c: Regenerated.
* generated/iall_i1.c: Regenerated.
* generated/iall_i16.c: Regenerated.
* generated/iall_i2.c: Regenerated.
* generated/iall_i4.c: Regenerated.
* generated/iall_i8.c: Regenerated.
* generated/iany_i1.c: Regenerated.
* generated/iany_i16.c: Regenerated.
* generated/iany_i2.c: Regenerated.
* generated/iany_i4.c: Regenerated.
* generated/iany_i8.c: Regenerated.
* generated/iparity_i1.c: Regenerated.
* generated/iparity_i16.c: Regenerated.
* generated/iparity_i2.c: Regenerated.
* generated/iparity_i4.c: Regenerated.
* generated/iparity_i8.c: Regenerated.
* generated/maxloc1_16_i1.c: Regenerated.
* generated/maxloc1_16_i16.c: Regenerated.
* generated/maxloc1_16_i2.c: Regenerated.
* generated/maxloc1_16_i4.c: Regenerated.
* generated/maxloc1_16_i8.c: Regenerated.
* generated/maxloc1_16_r10.c: Regenerated.
* generated/maxloc1_16_r16.c: Regenerated.
* generated/maxloc1_16_r4.c: Regenerated.
* generated/maxloc1_16_r8.c: Regenerated.
* generated/maxloc1_4_i1.c: Regenerated.
* generated/maxloc1_4_i16.c: Regenerated.
* generated/maxloc1_4_i2.c: Regenerated.
* generated/maxloc1_4_i4.c: Regenerated.
* generated/maxloc1_4_i8.c: Regenerated.
* generated/maxloc1_4_r10.c: Regenerated.
* generated/maxloc1_4_r16.c: Regenerated.
* generated/maxloc1_4_r4.c: Regenerated.
* generated/maxloc1_4_r8.c: Regenerated.
* generated/maxloc1_8_i1.c: Regenerated.
* generated/maxloc1_8_i16.c: Regenerated.
* generated/maxloc1_8_i2.c: Regenerated.
* generated/maxloc1_8_i4.c: Regenerated.
* generated/maxloc1_8_i8.c: Regenerated.
* generated/maxloc1_8_r10.c: Regenerated.
* generated/maxloc1_8_r16.c: Regenerated.
* generated/maxloc1_8_r4.c: Regenerated.
* generated/maxloc1_8_r8.c: Regenerated.
* generated/maxval_i1.c: Regenerated.
* generated/maxval_i16.c: Regenerated.
* generated/maxval_i2.c: Regenerated.
* generated/maxval_i4.c: Regenerated.
* generated/maxval_i8.c: Regenerated.
* generated/maxval_r10.c: Regenerated.
* generated/maxval_r16.c: Regenerated.
* generated/maxval_r4.c: Regenerated.
* generated/maxval_r8.c: Regenerated.
* generated/minloc1_16_i1.c: Regenerated.
* generated/minloc1_16_i16.c: Regenerated.
* generated/minloc1_16_i2.c: Regenerated.
* generated/minloc1_16_i4.c: Regenerated.
* generated/minloc1_16_i8.c: Regenerated.
* generated/minloc1_16_r10.c: Regenerated.
* generated/minloc1_16_r16.c: Regenerated.
* generated/minloc1_16_r4.c: Regenerated.
* generated/minloc1_16_r8.c: Regenerated.
* generated/minloc1_4_i1.c: Regenerated.
* generated/minloc1_4_i16.c: Regenerated.
* generated/minloc1_4_i2.c: Regenerated.
* generated/minloc1_4_i4.c: Regenerated.
* generated/minloc1_4_i8.c: Regenerated.
* generated/minloc1_4_r10.c: Regenerated.
* generated/minloc1_4_r16.c: Regenerated.
* generated/minloc1_4_r4.c: Regenerated.
* generated/minloc1_4_r8.c: Regenerated.
* generated/minloc1_8_i1.c: Regenerated.
* generated/minloc1_8_i16.c: Regenerated.
* generated/minloc1_8_i2.c: Regenerated.
* generated/minloc1_8_i4.c: Regenerated.
* generated/minloc1_8_i8.c: Regenerated.
* generated/minloc1_8_r10.c: Regenerated.
* generated/minloc1_8_r16.c: Regenerated.
* generated/minloc1_8_r4.c: Regenerated.
* generated/minloc1_8_r8.c: Regenerated.
* generated/minval_i1.c: Regenerated.
* generated/minval_i16.c: Regenerated.
* generated/minval_i2.c: Regenerated.
* generated/minval_i4.c: Regenerated.
* generated/minval_i8.c: Regenerated.
* generated/minval_r10.c: Regenerated.
* generated/minval_r16.c: Regenerated.
* generated/minval_r4.c: Regenerated.
* generated/minval_r8.c: Regenerated.
* generated/product_c10.c: Regenerated.
* generated/product_c16.c: Regenerated.
* generated/product_c4.c: Regenerated.
* generated/product_c8.c: Regenerated.
* generated/product_i1.c: Regenerated.
* generated/product_i16.c: Regenerated.
* generated/product_i2.c: Regenerated.
* generated/product_i4.c: Regenerated.
* generated/product_i8.c: Regenerated.
* generated/product_r10.c: Regenerated.
* generated/product_r16.c: Regenerated.
* generated/product_r4.c: Regenerated.
* generated/product_r8.c: Regenerated.
* generated/sum_c10.c: Regenerated.
* generated/sum_c16.c: Regenerated.
* generated/sum_c4.c: Regenerated.
* generated/sum_c8.c: Regenerated.
* generated/sum_i1.c: Regenerated.
* generated/sum_i16.c: Regenerated.
* generated/sum_i2.c: Regenerated.
* generated/sum_i4.c: Regenerated.
* generated/sum_i8.c: Regenerated.
* generated/sum_r10.c: Regenerated.
* generated/sum_r16.c: Regenerated.
* generated/sum_r4.c: Regenerated.
* generated/sum_r8.c: Regenerated.
2012-10-10 Tobias Burnus <burnus@net-b.de>
PR fortran/54878

1
libgfortran/generated/bessel_r10.c
View File

@ -148,7 +148,6 @@ bessel_yn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2,
return;
}
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->base_addr[0] = last1;

1
libgfortran/generated/bessel_r16.c
View File

@ -152,7 +152,6 @@ bessel_yn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2,
return;
}
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->base_addr[0] = last1;

1
libgfortran/generated/bessel_r4.c
View File

@ -148,7 +148,6 @@ bessel_yn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2,
return;
}
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->base_addr[0] = last1;

1
libgfortran/generated/bessel_r8.c
View File

@ -148,7 +148,6 @@ bessel_yn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2,
return;
}
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->base_addr[0] = last1;

9
libgfortran/generated/iall_i1.c
View File

@ -323,18 +323,13 @@ miall_i1 (gfc_array_i1 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result &= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iall_i16.c
View File

@ -323,18 +323,13 @@ miall_i16 (gfc_array_i16 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result &= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iall_i2.c
View File

@ -323,18 +323,13 @@ miall_i2 (gfc_array_i2 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result &= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iall_i4.c
View File

@ -323,18 +323,13 @@ miall_i4 (gfc_array_i4 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result &= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iall_i8.c
View File

@ -323,18 +323,13 @@ miall_i8 (gfc_array_i8 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result &= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iany_i1.c
View File

@ -323,18 +323,13 @@ miany_i1 (gfc_array_i1 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result |= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iany_i16.c
View File

@ -323,18 +323,13 @@ miany_i16 (gfc_array_i16 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result |= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iany_i2.c
View File

@ -323,18 +323,13 @@ miany_i2 (gfc_array_i2 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result |= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iany_i4.c
View File

@ -323,18 +323,13 @@ miany_i4 (gfc_array_i4 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result |= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iany_i8.c
View File

@ -323,18 +323,13 @@ miany_i8 (gfc_array_i8 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result |= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iparity_i1.c
View File

@ -323,18 +323,13 @@ miparity_i1 (gfc_array_i1 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result ^= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iparity_i16.c
View File

@ -323,18 +323,13 @@ miparity_i16 (gfc_array_i16 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result ^= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iparity_i2.c
View File

@ -323,18 +323,13 @@ miparity_i2 (gfc_array_i2 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result ^= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iparity_i4.c
View File

@ -323,18 +323,13 @@ miparity_i4 (gfc_array_i4 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result ^= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/iparity_i8.c
View File

@ -323,18 +323,13 @@ miparity_i8 (gfc_array_i8 * const restrict retarray,
{
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result ^= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_i1.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_i16.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_i2.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_i4.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_i8.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_r10.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_r16.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_r4.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_16_r8.c
View File

@ -354,12 +354,8 @@ mmaxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_i1.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_i16.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_i2.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_i4.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_i8.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_r10.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_r16.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_r4.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_4_r8.c
View File

@ -354,12 +354,8 @@ mmaxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_i1.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_i16.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_i2.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_i4.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_i8.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_r10.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_r16.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_r4.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxloc1_8_r8.c
View File

@ -354,12 +354,8 @@ mmaxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mmaxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
maxval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_i1.c
View File

@ -344,12 +344,8 @@ mmaxval_i1 (gfc_array_i1 * const restrict retarray,
#if defined (GFC_INTEGER_1_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = (-GFC_INTEGER_1_HUGE-1);
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_1_INFINITY) || defined (GFC_INTEGER_1_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_i1 (gfc_array_i1 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_i16.c
View File

@ -344,12 +344,8 @@ mmaxval_i16 (gfc_array_i16 * const restrict retarray,
#if defined (GFC_INTEGER_16_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = (-GFC_INTEGER_16_HUGE-1);
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_16_INFINITY) || defined (GFC_INTEGER_16_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_i16 (gfc_array_i16 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_i2.c
View File

@ -344,12 +344,8 @@ mmaxval_i2 (gfc_array_i2 * const restrict retarray,
#if defined (GFC_INTEGER_2_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = (-GFC_INTEGER_2_HUGE-1);
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_2_INFINITY) || defined (GFC_INTEGER_2_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_i2 (gfc_array_i2 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_i4.c
View File

@ -344,12 +344,8 @@ mmaxval_i4 (gfc_array_i4 * const restrict retarray,
#if defined (GFC_INTEGER_4_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = (-GFC_INTEGER_4_HUGE-1);
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_4_INFINITY) || defined (GFC_INTEGER_4_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_i4 (gfc_array_i4 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_i8.c
View File

@ -344,12 +344,8 @@ mmaxval_i8 (gfc_array_i8 * const restrict retarray,
#if defined (GFC_INTEGER_8_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = (-GFC_INTEGER_8_HUGE-1);
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_8_INFINITY) || defined (GFC_INTEGER_8_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_i8 (gfc_array_i8 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_r10.c
View File

@ -344,12 +344,8 @@ mmaxval_r10 (gfc_array_r10 * const restrict retarray,
#if defined (GFC_REAL_10_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = -GFC_REAL_10_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_10_INFINITY) || defined (GFC_REAL_10_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_r10 (gfc_array_r10 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_r16.c
View File

@ -344,12 +344,8 @@ mmaxval_r16 (gfc_array_r16 * const restrict retarray,
#if defined (GFC_REAL_16_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = -GFC_REAL_16_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_16_INFINITY) || defined (GFC_REAL_16_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_r16 (gfc_array_r16 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_r4.c
View File

@ -344,12 +344,8 @@ mmaxval_r4 (gfc_array_r4 * const restrict retarray,
#if defined (GFC_REAL_4_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = -GFC_REAL_4_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_4_INFINITY) || defined (GFC_REAL_4_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_r4 (gfc_array_r4 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/maxval_r8.c
View File

@ -344,12 +344,8 @@ mmaxval_r8 (gfc_array_r8 * const restrict retarray,
#if defined (GFC_REAL_8_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = -GFC_REAL_8_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_8_INFINITY) || defined (GFC_REAL_8_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mmaxval_r8 (gfc_array_r8 * const restrict retarray,
#endif
if (*msrc && *src > result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_i1.c
View File

@ -354,12 +354,8 @@ mminloc1_16_i1 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_i1 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_i16.c
View File

@ -354,12 +354,8 @@ mminloc1_16_i16 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_i16 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_i2.c
View File

@ -354,12 +354,8 @@ mminloc1_16_i2 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_i2 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_i4.c
View File

@ -354,12 +354,8 @@ mminloc1_16_i4 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_i4 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_i8.c
View File

@ -354,12 +354,8 @@ mminloc1_16_i8 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_i8 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_r10.c
View File

@ -354,12 +354,8 @@ mminloc1_16_r10 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_r10 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_r16.c
View File

@ -354,12 +354,8 @@ mminloc1_16_r16 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_r16 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_r4.c
View File

@ -354,12 +354,8 @@ mminloc1_16_r4 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_r4 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_16_r8.c
View File

@ -354,12 +354,8 @@ mminloc1_16_r8 (gfc_array_i16 * const restrict retarray,
GFC_INTEGER_16 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_16_r8 (gfc_array_i16 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_16)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_i1.c
View File

@ -354,12 +354,8 @@ mminloc1_4_i1 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_i1 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_i16.c
View File

@ -354,12 +354,8 @@ mminloc1_4_i16 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_i16 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_i2.c
View File

@ -354,12 +354,8 @@ mminloc1_4_i2 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_i2 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_i4.c
View File

@ -354,12 +354,8 @@ mminloc1_4_i4 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_i4 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_i8.c
View File

@ -354,12 +354,8 @@ mminloc1_4_i8 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_i8 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_r10.c
View File

@ -354,12 +354,8 @@ mminloc1_4_r10 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_r10 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_r16.c
View File

@ -354,12 +354,8 @@ mminloc1_4_r16 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_r16 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_r4.c
View File

@ -354,12 +354,8 @@ mminloc1_4_r4 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_r4 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_4_r8.c
View File

@ -354,12 +354,8 @@ mminloc1_4_r8 (gfc_array_i4 * const restrict retarray,
GFC_INTEGER_4 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_4_r8 (gfc_array_i4 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_4)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_i1.c
View File

@ -354,12 +354,8 @@ mminloc1_8_i1 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_i1 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_i16.c
View File

@ -354,12 +354,8 @@ mminloc1_8_i16 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_i16 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_i2.c
View File

@ -354,12 +354,8 @@ mminloc1_8_i2 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_i2 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_i4.c
View File

@ -354,12 +354,8 @@ mminloc1_8_i4 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_i4 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_i8.c
View File

@ -354,12 +354,8 @@ mminloc1_8_i8 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_i8 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_r10.c
View File

@ -354,12 +354,8 @@ mminloc1_8_r10 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_r10 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_r16.c
View File

@ -354,12 +354,8 @@ mminloc1_8_r16 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_r16 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_r4.c
View File

@ -354,12 +354,8 @@ mminloc1_8_r4 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_r4 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minloc1_8_r8.c
View File

@ -354,12 +354,8 @@ mminloc1_8_r8 (gfc_array_i8 * const restrict retarray,
GFC_INTEGER_8 result2 = 0;
#endif
result = 0;
if (len <= 0)
*dest = 0;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
{
@ -387,9 +383,8 @@ mminloc1_8_r8 (gfc_array_i8 * const restrict retarray,
minval = *src;
result = (GFC_INTEGER_8)n + 1;
}
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_i1.c
View File

@ -344,12 +344,8 @@ mminval_i1 (gfc_array_i1 * const restrict retarray,
#if defined (GFC_INTEGER_1_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_INTEGER_1_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_1_INFINITY) || defined (GFC_INTEGER_1_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_i1 (gfc_array_i1 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_i16.c
View File

@ -344,12 +344,8 @@ mminval_i16 (gfc_array_i16 * const restrict retarray,
#if defined (GFC_INTEGER_16_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_INTEGER_16_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_16_INFINITY) || defined (GFC_INTEGER_16_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_i16 (gfc_array_i16 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_i2.c
View File

@ -344,12 +344,8 @@ mminval_i2 (gfc_array_i2 * const restrict retarray,
#if defined (GFC_INTEGER_2_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_INTEGER_2_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_2_INFINITY) || defined (GFC_INTEGER_2_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_i2 (gfc_array_i2 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_i4.c
View File

@ -344,12 +344,8 @@ mminval_i4 (gfc_array_i4 * const restrict retarray,
#if defined (GFC_INTEGER_4_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_INTEGER_4_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_4_INFINITY) || defined (GFC_INTEGER_4_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_i4 (gfc_array_i4 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_i8.c
View File

@ -344,12 +344,8 @@ mminval_i8 (gfc_array_i8 * const restrict retarray,
#if defined (GFC_INTEGER_8_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_INTEGER_8_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_INTEGER_8_INFINITY) || defined (GFC_INTEGER_8_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_i8 (gfc_array_i8 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_r10.c
View File

@ -344,12 +344,8 @@ mminval_r10 (gfc_array_r10 * const restrict retarray,
#if defined (GFC_REAL_10_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_REAL_10_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_10_INFINITY) || defined (GFC_REAL_10_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_r10 (gfc_array_r10 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_r16.c
View File

@ -344,12 +344,8 @@ mminval_r16 (gfc_array_r16 * const restrict retarray,
#if defined (GFC_REAL_16_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_REAL_16_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_16_INFINITY) || defined (GFC_REAL_16_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_r16 (gfc_array_r16 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_r4.c
View File

@ -344,12 +344,8 @@ mminval_r4 (gfc_array_r4 * const restrict retarray,
#if defined (GFC_REAL_4_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_REAL_4_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_4_INFINITY) || defined (GFC_REAL_4_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_r4 (gfc_array_r4 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/minval_r8.c
View File

@ -344,12 +344,8 @@ mminval_r8 (gfc_array_r8 * const restrict retarray,
#if defined (GFC_REAL_8_QUIET_NAN)
int non_empty_p = 0;
#endif
if (len <= 0)
*dest = GFC_REAL_8_HUGE;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
#if defined (GFC_REAL_8_INFINITY) || defined (GFC_REAL_8_QUIET_NAN)
if (*msrc)
@ -374,9 +370,8 @@ mminval_r8 (gfc_array_r8 * const restrict retarray,
#endif
if (*msrc && *src < result)
result = *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_c10.c
View File

@ -323,18 +323,13 @@ mproduct_c10 (gfc_array_c10 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_c16.c
View File

@ -323,18 +323,13 @@ mproduct_c16 (gfc_array_c16 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_c4.c
View File

@ -323,18 +323,13 @@ mproduct_c4 (gfc_array_c4 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_c8.c
View File

@ -323,18 +323,13 @@ mproduct_c8 (gfc_array_c8 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_i1.c
View File

@ -323,18 +323,13 @@ mproduct_i1 (gfc_array_i1 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_i16.c
View File

@ -323,18 +323,13 @@ mproduct_i16 (gfc_array_i16 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_i2.c
View File

@ -323,18 +323,13 @@ mproduct_i2 (gfc_array_i2 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

9
libgfortran/generated/product_i4.c
View File

@ -323,18 +323,13 @@ mproduct_i4 (gfc_array_i4 * const restrict retarray,
{
result = 1;
if (len <= 0)
*dest = 1;
else
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
for (n = 0; n < len; n++, src += delta, msrc += mdelta)
{
if (*msrc)
result *= *src;
}
*dest = result;
}
*dest = result;
}
/* Advance to the next element. */
count[0]++;

Some files were not shown because too many files have changed in this diff Show More