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

re PR libfortran/88807 (misleading indentation warnings building libgfortran) 

PR libfortran/88807
	* m4/minloc0.m4: Reindent to avoid -Wmisleading-indentation warnings.
	* generated/minloc0_4_i1.c: Regenerated.
	* generated/minloc0_4_i2.c: Regenerated.
	* generated/minloc0_4_i4.c: Regenerated.
	* generated/minloc0_4_i8.c: Regenerated.
	* generated/minloc0_4_i16.c: Regenerated.
	* generated/minloc0_4_r4.c: Regenerated.
	* generated/minloc0_4_r8.c: Regenerated.
	* generated/minloc0_4_r10.c: Regenerated.
	* generated/minloc0_4_r16.c: Regenerated.
	* generated/minloc0_8_i1.c: Regenerated.
	* generated/minloc0_8_i2.c: Regenerated.
	* generated/minloc0_8_i4.c: Regenerated.
	* generated/minloc0_8_i8.c: Regenerated.
	* generated/minloc0_8_i16.c: Regenerated.
	* generated/minloc0_8_r4.c: Regenerated.
	* generated/minloc0_8_r8.c: Regenerated.
	* generated/minloc0_8_r10.c: Regenerated.
	* generated/minloc0_8_r16.c: Regenerated.
	* generated/minloc0_16_i1.c: Regenerated.
	* generated/minloc0_16_i2.c: Regenerated.
	* generated/minloc0_16_i4.c: Regenerated.
	* generated/minloc0_16_i8.c: Regenerated.
	* generated/minloc0_16_i16.c: Regenerated.
	* generated/minloc0_16_r4.c: Regenerated.
	* generated/minloc0_16_r8.c: Regenerated.
	* generated/minloc0_16_r10.c: Regenerated.
	* generated/minloc0_16_r16.c: Regenerated.

From-SVN: r267875
This commit is contained in:
Jakub Jelinek 2019-01-12 10:15:54 +01:00
parent 831a2e2f86
commit fc560ecd49
29 changed files with 622 additions and 590 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
libgfortran/ChangeLog
View File

@ -1,3 +1,35 @@
2019-01-12 Jakub Jelinek <jakub@redhat.com>
PR libfortran/88807
* m4/minloc0.m4: Reindent to avoid -Wmisleading-indentation warnings.
* generated/minloc0_4_i1.c: Regenerated.
* generated/minloc0_4_i2.c: Regenerated.
* generated/minloc0_4_i4.c: Regenerated.
* generated/minloc0_4_i8.c: Regenerated.
* generated/minloc0_4_i16.c: Regenerated.
* generated/minloc0_4_r4.c: Regenerated.
* generated/minloc0_4_r8.c: Regenerated.
* generated/minloc0_4_r10.c: Regenerated.
* generated/minloc0_4_r16.c: Regenerated.
* generated/minloc0_8_i1.c: Regenerated.
* generated/minloc0_8_i2.c: Regenerated.
* generated/minloc0_8_i4.c: Regenerated.
* generated/minloc0_8_i8.c: Regenerated.
* generated/minloc0_8_i16.c: Regenerated.
* generated/minloc0_8_r4.c: Regenerated.
* generated/minloc0_8_r8.c: Regenerated.
* generated/minloc0_8_r10.c: Regenerated.
* generated/minloc0_8_r16.c: Regenerated.
* generated/minloc0_16_i1.c: Regenerated.
* generated/minloc0_16_i2.c: Regenerated.
* generated/minloc0_16_i4.c: Regenerated.
* generated/minloc0_16_i8.c: Regenerated.
* generated/minloc0_16_i16.c: Regenerated.
* generated/minloc0_16_r4.c: Regenerated.
* generated/minloc0_16_r8.c: Regenerated.
* generated/minloc0_16_r10.c: Regenerated.
* generated/minloc0_16_r16.c: Regenerated.
2019-01-09 Sandra Loosemore <sandra@codesourcery.com>
PR other/16615
@ -6,8 +38,8 @@
* io/unit.c: Likewise.
2019-01-07 Thomas Koenig <tkoenig@gcc.gnu.org>
Harald Anlauf <anlauf@gmx.de>
Tobias Burnus <burnus@gcc.gnu.org>
Harald Anlauf <anlauf@gmx.de>
Tobias Burnus <burnus@gcc.gnu.org>
PR fortran/45424
* Makefile.am: Add intrinsics/is_contiguous.c.

42
libgfortran/generated/minloc0_16_i1.c
View File

@ -123,27 +123,27 @@ minloc0_16_i1 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_i16.c
View File

@ -123,27 +123,27 @@ minloc0_16_i16 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_i2.c
View File

@ -123,27 +123,27 @@ minloc0_16_i2 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_i4.c
View File

@ -123,27 +123,27 @@ minloc0_16_i4 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_i8.c
View File

@ -123,27 +123,27 @@ minloc0_16_i8 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_r10.c
View File

@ -123,27 +123,27 @@ minloc0_16_r10 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_r16.c
View File

@ -123,27 +123,27 @@ minloc0_16_r16 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_r4.c
View File

@ -123,27 +123,27 @@ minloc0_16_r4 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_16_r8.c
View File

@ -123,27 +123,27 @@ minloc0_16_r8 (gfc_array_i16 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_i1.c
View File

@ -123,27 +123,27 @@ minloc0_4_i1 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_i16.c
View File

@ -123,27 +123,27 @@ minloc0_4_i16 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_i2.c
View File

@ -123,27 +123,27 @@ minloc0_4_i2 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_i4.c
View File

@ -123,27 +123,27 @@ minloc0_4_i4 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_i8.c
View File

@ -123,27 +123,27 @@ minloc0_4_i8 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_r10.c
View File

@ -123,27 +123,27 @@ minloc0_4_r10 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_r16.c
View File

@ -123,27 +123,27 @@ minloc0_4_r16 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_r4.c
View File

@ -123,27 +123,27 @@ minloc0_4_r4 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_4_r8.c
View File

@ -123,27 +123,27 @@ minloc0_4_r8 (gfc_array_i4 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_i1.c
View File

@ -123,27 +123,27 @@ minloc0_8_i1 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_i16.c
View File

@ -123,27 +123,27 @@ minloc0_8_i16 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_i2.c
View File

@ -123,27 +123,27 @@ minloc0_8_i2 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_i4.c
View File

@ -123,27 +123,27 @@ minloc0_8_i4 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_i8.c
View File

@ -123,27 +123,27 @@ minloc0_8_i8 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_r10.c
View File

@ -123,27 +123,27 @@ minloc0_8_r10 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_r16.c
View File

@ -123,27 +123,27 @@ minloc0_8_r16 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_r4.c
View File

@ -123,27 +123,27 @@ minloc0_8_r4 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/generated/minloc0_8_r8.c
View File

@ -123,27 +123,27 @@ minloc0_8_r8 (gfc_array_i8 * const restrict retarray,
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
/* Implementation end. */
/* Advance to the next element. */
base += sstride[0];

42
libgfortran/m4/minloc0.m4
View File

@ -63,27 +63,27 @@ FOREACH_FUNCTION(
}
else
#endif
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}')
if (back)
do
{
if (unlikely (*base <= minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}
base += sstride[0];
}
while (++count[0] != extent[0]);
else
do
{
if (unlikely (*base < minval))
{
minval = *base;
for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1;
}')
MASKED_FOREACH_FUNCTION(
` atype_name minval;
int fast = 0;