Skip to content

R
riscv-gcc-1
Commit fc560ecd by Jakub Jelinek
Options

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
parent 831a2e2f
Showing with 622 additions and 590 deletions
libgfortran/ChangeLog
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> 2019-01-09 Sandra Loosemore <sandra@codesourcery.com>
PR other/16615 PR other/16615
...@@ -6,8 +38,8 @@ ...@@ -6,8 +38,8 @@
* io/unit.c: Likewise. * io/unit.c: Likewise.
2019-01-07 Thomas Koenig <tkoenig@gcc.gnu.org> 2019-01-07 Thomas Koenig <tkoenig@gcc.gnu.org>
Harald Anlauf <anlauf@gmx.de> Harald Anlauf <anlauf@gmx.de>
Tobias Burnus <burnus@gcc.gnu.org> Tobias Burnus <burnus@gcc.gnu.org>
PR fortran/45424 PR fortran/45424
* Makefile.am: Add intrinsics/is_contiguous.c. * Makefile.am: Add intrinsics/is_contiguous.c.
......
libgfortran/generated/minloc0_16_i1.c
...@@ -123,27 +123,27 @@ minloc0_16_i1 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_i1 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_i16.c
...@@ -123,27 +123,27 @@ minloc0_16_i16 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_i16 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_i2.c
...@@ -123,27 +123,27 @@ minloc0_16_i2 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_i2 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_i4.c
...@@ -123,27 +123,27 @@ minloc0_16_i4 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_i4 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_i8.c
...@@ -123,27 +123,27 @@ minloc0_16_i8 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_i8 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_r10.c
...@@ -123,27 +123,27 @@ minloc0_16_r10 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_r10 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_r16.c
...@@ -123,27 +123,27 @@ minloc0_16_r16 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_r16 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_r4.c
...@@ -123,27 +123,27 @@ minloc0_16_r4 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_r4 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_16_r8.c
...@@ -123,27 +123,27 @@ minloc0_16_r8 (gfc_array_i16 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_16_r8 (gfc_array_i16 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_i1.c
...@@ -123,27 +123,27 @@ minloc0_4_i1 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_i1 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_i16.c
...@@ -123,27 +123,27 @@ minloc0_4_i16 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_i16 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_i2.c
...@@ -123,27 +123,27 @@ minloc0_4_i2 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_i2 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_i4.c
...@@ -123,27 +123,27 @@ minloc0_4_i4 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_i4 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_i8.c
...@@ -123,27 +123,27 @@ minloc0_4_i8 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_i8 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_r10.c
...@@ -123,27 +123,27 @@ minloc0_4_r10 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_r10 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_r16.c
...@@ -123,27 +123,27 @@ minloc0_4_r16 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_r16 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_r4.c
...@@ -123,27 +123,27 @@ minloc0_4_r4 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_r4 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_4_r8.c
...@@ -123,27 +123,27 @@ minloc0_4_r8 (gfc_array_i4 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_4_r8 (gfc_array_i4 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_i1.c
...@@ -123,27 +123,27 @@ minloc0_8_i1 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_i1 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_i16.c
...@@ -123,27 +123,27 @@ minloc0_8_i16 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_i16 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_i2.c
...@@ -123,27 +123,27 @@ minloc0_8_i2 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_i2 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_i4.c
...@@ -123,27 +123,27 @@ minloc0_8_i4 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_i4 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_i8.c
...@@ -123,27 +123,27 @@ minloc0_8_i8 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_i8 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_r10.c
...@@ -123,27 +123,27 @@ minloc0_8_r10 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_r10 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_r16.c
...@@ -123,27 +123,27 @@ minloc0_8_r16 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_r16 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_r4.c
...@@ -123,27 +123,27 @@ minloc0_8_r4 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_r4 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/generated/minloc0_8_r8.c
...@@ -123,27 +123,27 @@ minloc0_8_r8 (gfc_array_i8 * const restrict retarray, ...@@ -123,27 +123,27 @@ minloc0_8_r8 (gfc_array_i8 * const restrict retarray,
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
/* Implementation end. */ /* Implementation end. */
/* Advance to the next element. */ /* Advance to the next element. */
base += sstride[0]; base += sstride[0];
......
libgfortran/m4/minloc0.m4
...@@ -63,27 +63,27 @@ FOREACH_FUNCTION( ...@@ -63,27 +63,27 @@ FOREACH_FUNCTION(
} }
else else
#endif #endif
if (back) if (back)
do do
{ {
if (unlikely (*base <= minval)) if (unlikely (*base <= minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
} }
base += sstride[0]; base += sstride[0];
} }
while (++count[0] != extent[0]); while (++count[0] != extent[0]);
else else
do do
{ {
if (unlikely (*base < minval)) if (unlikely (*base < minval))
{ {
minval = *base; minval = *base;
for (n = 0; n < rank; n++) for (n = 0; n < rank; n++)
dest[n * dstride] = count[n] + 1; dest[n * dstride] = count[n] + 1;
}') }')
MASKED_FOREACH_FUNCTION( MASKED_FOREACH_FUNCTION(
` atype_name minval; ` atype_name minval;
int fast = 0; int fast = 0;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment