Hi!
The following patch reindents parts of m4/minloc0.m4 to avoid
../../../libgfortran/generated/minloc0_4_i1.c:138:5: warning: this ‘else’
clause does not guard... [-Wmisleading-indentation]
etc. warnings. The indentation of the generated sources is misleading
for many of the sources and fixing it properly would be harder - this
patch just changes it so that we don't have
else
something;
following statements;
which -Wmisleading-indentation among other things warns about.
Bootstrapped/regtested on x86_64-linux and i686-linux, preapproved by Steven
in the PR, commited to trunk.
If we ignored 8 spaces vs. tabs, perhaps we could define a couple of indentN
m4 macros and used them in front of the various chunks provided from
iforeach*.m4, so that different *.m4 files would have better control on how
much does it indent. But not really sure if even that would lead to
something correct.
2019-01-12 Jakub Jelinek <ja...@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.
--- libgfortran/m4/minloc0.m4.jj 2019-01-01 12:38:37.066663848 +0100
+++ libgfortran/m4/minloc0.m4 2019-01-12 01:11:14.779583814 +0100
@@ -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;
--- libgfortran/generated/minloc0_4_i1.c.jj 2019-01-01 12:38:33.561721355
+0100
+++ libgfortran/generated/minloc0_4_i1.c 2019-01-12 01:11:21.469475297
+0100
@@ -123,27 +123,27 @@ minloc0_4_i1 (gfc_array_i4 * const restr
}
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];
--- libgfortran/generated/minloc0_4_i2.c.jj 2019-01-01 12:38:33.614720485
+0100
+++ libgfortran/generated/minloc0_4_i2.c 2019-01-12 01:11:21.470475281
+0100
@@ -123,27 +123,27 @@ minloc0_4_i2 (gfc_array_i4 * const restr
}
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];
--- libgfortran/generated/minloc0_4_i4.c.jj 2019-01-01 12:38:35.193694578
+0100
+++ libgfortran/generated/minloc0_4_i4.c 2019-01-12 01:11:21.471475265
+0100
@@ -123,27 +123,27 @@ minloc0_4_i4 (gfc_array_i4 * const restr
}
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];
--- libgfortran/generated/minloc0_4_i8.c.jj 2019-01-01 12:38:33.317725358
+0100
+++ libgfortran/generated/minloc0_4_i8.c 2019-01-12 01:11:21.472475249
+0100
@@ -123,27 +123,27 @@ minloc0_4_i8 (gfc_array_i4 * const restr
}
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];
--- libgfortran/generated/minloc0_4_i16.c.jj 2019-01-01 12:38:32.692735613
+0100
+++ libgfortran/generated/minloc0_4_i16.c 2019-01-12 01:11:21.473475232
+0100
@@ -123,27 +123,27 @@ minloc0_4_i16 (gfc_array_i4 * const rest
}
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];
--- libgfortran/generated/minloc0_4_r4.c.jj 2019-01-01 12:38:33.535721782
+0100
+++ libgfortran/generated/minloc0_4_r4.c 2019-01-12 01:11:21.473475232
+0100
@@ -123,27 +123,27 @@ minloc0_4_r4 (gfc_array_i4 * const restr
}
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];
--- libgfortran/generated/minloc0_4_r8.c.jj 2019-01-01 12:38:33.752718221
+0100
+++ libgfortran/generated/minloc0_4_r8.c 2019-01-12 01:11:21.474475216
+0100
@@ -123,27 +123,27 @@ minloc0_4_r8 (gfc_array_i4 * const restr
}
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];
--- libgfortran/generated/minloc0_4_r10.c.jj 2019-01-01 12:38:33.291725785
+0100
+++ libgfortran/generated/minloc0_4_r10.c 2019-01-12 01:11:21.474475216
+0100
@@ -123,27 +123,27 @@ minloc0_4_r10 (gfc_array_i4 * const rest
}
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];
--- libgfortran/generated/minloc0_4_r16.c.jj 2019-01-01 12:38:33.580721043
+0100
+++ libgfortran/generated/minloc0_4_r16.c 2019-01-12 01:11:21.475475200
+0100
@@ -123,27 +123,27 @@ minloc0_4_r16 (gfc_array_i4 * const rest
}
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];
--- libgfortran/generated/minloc0_8_i1.c.jj 2019-01-01 12:38:32.332741525
+0100
+++ libgfortran/generated/minloc0_8_i1.c 2019-01-12 01:11:21.470475281
+0100
@@ -123,27 +123,27 @@ minloc0_8_i1 (gfc_array_i8 * const restr
}
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];
--- libgfortran/generated/minloc0_8_i2.c.jj 2019-01-01 12:38:33.968714677
+0100
+++ libgfortran/generated/minloc0_8_i2.c 2019-01-12 01:11:21.471475265
+0100
@@ -123,27 +123,27 @@ minloc0_8_i2 (gfc_array_i8 * const restr
}
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];
--- libgfortran/generated/minloc0_8_i4.c.jj 2019-01-01 12:38:33.076729312
+0100
+++ libgfortran/generated/minloc0_8_i4.c 2019-01-12 01:11:21.472475249
+0100
@@ -123,27 +123,27 @@ minloc0_8_i4 (gfc_array_i8 * const restr
}
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];
--- libgfortran/generated/minloc0_8_i8.c.jj 2019-01-01 12:38:32.329741574
+0100
+++ libgfortran/generated/minloc0_8_i8.c 2019-01-12 01:11:21.473475232
+0100
@@ -123,27 +123,27 @@ minloc0_8_i8 (gfc_array_i8 * const restr
}
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];
--- libgfortran/generated/minloc0_8_i16.c.jj 2019-01-01 12:38:32.501738749
+0100
+++ libgfortran/generated/minloc0_8_i16.c 2019-01-12 01:11:21.473475232
+0100
@@ -123,27 +123,27 @@ minloc0_8_i16 (gfc_array_i8 * const rest
}
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];
--- libgfortran/generated/minloc0_8_r4.c.jj 2019-01-01 12:38:32.774734267
+0100
+++ libgfortran/generated/minloc0_8_r4.c 2019-01-12 01:11:21.474475216
+0100
@@ -123,27 +123,27 @@ minloc0_8_r4 (gfc_array_i8 * const restr
}
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];
--- libgfortran/generated/minloc0_8_r8.c.jj 2019-01-01 12:38:33.185727524
+0100
+++ libgfortran/generated/minloc0_8_r8.c 2019-01-12 01:11:21.474475216
+0100
@@ -123,27 +123,27 @@ minloc0_8_r8 (gfc_array_i8 * const restr
}
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];
--- libgfortran/generated/minloc0_8_r10.c.jj 2019-01-01 12:38:33.870716285
+0100
+++ libgfortran/generated/minloc0_8_r10.c 2019-01-12 01:11:21.474475216
+0100
@@ -123,27 +123,27 @@ minloc0_8_r10 (gfc_array_i8 * const rest
}
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];
--- libgfortran/generated/minloc0_8_r16.c.jj 2019-01-01 12:38:32.872732659
+0100
+++ libgfortran/generated/minloc0_8_r16.c 2019-01-12 01:11:21.475475200
+0100
@@ -123,27 +123,27 @@ minloc0_8_r16 (gfc_array_i8 * const rest
}
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];
--- libgfortran/generated/minloc0_16_i1.c.jj 2019-01-01 12:38:36.308676284
+0100
+++ libgfortran/generated/minloc0_16_i1.c 2019-01-12 01:11:21.469475297
+0100
@@ -123,27 +123,27 @@ minloc0_16_i1 (gfc_array_i16 * const res
}
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];
--- libgfortran/generated/minloc0_16_i2.c.jj 2019-01-01 12:38:34.597704358
+0100
+++ libgfortran/generated/minloc0_16_i2.c 2019-01-12 01:11:21.470475281
+0100
@@ -123,27 +123,27 @@ minloc0_16_i2 (gfc_array_i16 * const res
}
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];
--- libgfortran/generated/minloc0_16_i4.c.jj 2019-01-01 12:38:33.293725752
+0100
+++ libgfortran/generated/minloc0_16_i4.c 2019-01-12 01:11:21.471475265
+0100
@@ -123,27 +123,27 @@ minloc0_16_i4 (gfc_array_i16 * const res
}
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];
--- libgfortran/generated/minloc0_16_i8.c.jj 2019-01-01 12:38:33.453723127
+0100
+++ libgfortran/generated/minloc0_16_i8.c 2019-01-12 01:11:21.472475249
+0100
@@ -123,27 +123,27 @@ minloc0_16_i8 (gfc_array_i16 * const res
}
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];
--- libgfortran/generated/minloc0_16_i16.c.jj 2019-01-01 12:38:32.430739915
+0100
+++ libgfortran/generated/minloc0_16_i16.c 2019-01-12 01:11:21.472475249
+0100
@@ -123,27 +123,27 @@ minloc0_16_i16 (gfc_array_i16 * const re
}
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];
--- libgfortran/generated/minloc0_16_r4.c.jj 2019-01-01 12:38:32.776734235
+0100
+++ libgfortran/generated/minloc0_16_r4.c 2019-01-12 01:11:21.473475232
+0100
@@ -123,27 +123,27 @@ minloc0_16_r4 (gfc_array_i16 * const res
}
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];
--- libgfortran/generated/minloc0_16_r8.c.jj 2019-01-01 12:38:34.845700288
+0100
+++ libgfortran/generated/minloc0_16_r8.c 2019-01-12 01:11:21.473475232
+0100
@@ -123,27 +123,27 @@ minloc0_16_r8 (gfc_array_i16 * const res
}
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];
--- libgfortran/generated/minloc0_16_r10.c.jj 2019-01-01 12:38:34.294709328
+0100
+++ libgfortran/generated/minloc0_16_r10.c 2019-01-12 01:11:21.475475200
+0100
@@ -123,27 +123,27 @@ minloc0_16_r10 (gfc_array_i16 * const re
}
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];
--- libgfortran/generated/minloc0_16_r16.c.jj 2019-01-01 12:38:32.534738207
+0100
+++ libgfortran/generated/minloc0_16_r16.c 2019-01-12 01:11:21.474475216
+0100
@@ -123,27 +123,27 @@ minloc0_16_r16 (gfc_array_i16 * const re
}
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];
Jakub
