https://gcc.gnu.org/g:449f87776649cb3513ec90de38f393f5b3f19df2

commit 449f87776649cb3513ec90de38f393f5b3f19df2
Author: Mikael Morin <[email protected]>
Date:   Tue Sep 9 22:27:26 2025 +0200

    Correction ifindloc1.m4

Diff:
---
 libgfortran/m4/ifindloc1.m4 | 24 ++++++++++++------------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/libgfortran/m4/ifindloc1.m4 b/libgfortran/m4/ifindloc1.m4
index d196f3f6cda6..8e2eb95df7f4 100644
--- a/libgfortran/m4/ifindloc1.m4
+++ b/libgfortran/m4/ifindloc1.m4
@@ -131,7 +131,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
       result = 0;
       if (back)
        {
-         src = (const 'atype_name` * restrict) (((char*) base) + (len - 1) * 
delta * 'base_mult`);
+         src = (const 'atype_name` * restrict) (((char*) base) + (len - 1) * 
delta);
          for (n = len; n > 0; n--)
            {
              if ('comparison`)
@@ -139,7 +139,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
                  result = n;
                  break;
                }
-             PTR_DECREMENT_BYTES (src, delta * 'base_mult`);
+             PTR_DECREMENT_BYTES (src, delta);
            }
        }
       else
@@ -152,19 +152,19 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
                  result = n;
                  break;
                }
-             PTR_INCREMENT_BYTES (src, delta * 'base_mult`);
+             PTR_INCREMENT_BYTES (src, delta);
            }
        }
       *dest = result;
 
       count[0]++;
-      PTR_INCREMENT_BYTES (base, sstride[0] * 'base_mult`);
+      PTR_INCREMENT_BYTES (base, sstride[0]);
       PTR_INCREMENT_BYTES (dest, dstride[0]);
       n = 0;
       while (count[n] == extent[n])
        {
          count[n] = 0;
-         PTR_DECREMENT_BYTES (base, sstride[n] * extent[n] * 'base_mult`);
+         PTR_DECREMENT_BYTES (base, sstride[n] * extent[n]);
          PTR_DECREMENT_BYTES (dest, dstride[n] * extent[n]);
          n++;
          if (n >= rank)
@@ -175,7 +175,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
          else
            {
              count[n]++;
-             PTR_INCREMENT_BYTES (base, sstride[n] * 'base_mult`);
+             PTR_INCREMENT_BYTES (base, sstride[n]);
              PTR_INCREMENT_BYTES (dest, dstride[n]);
            }
        }
@@ -307,7 +307,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
       result = 0;
       if (back)
        {
-         src = (const 'atype_name` * restrict) (((char*)base) + (len - 1) * 
delta * 'base_mult`);
+         src = (const 'atype_name` * restrict) (((char*)base) + (len - 1) * 
delta);
          msrc = mbase + (len - 1) * mdelta; 
          for (n = len; n > 0; n--)
            {
@@ -316,7 +316,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
                  result = n;
                  break;
                }
-             PTR_DECREMENT_BYTES (src, delta * 'base_mult`);
+             PTR_DECREMENT_BYTES (src, delta);
              msrc -= mdelta;
            }
        }
@@ -331,21 +331,21 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
                  result = n;
                  break;
                }
-             PTR_INCREMENT_BYTES (src, delta * 'base_mult`);
+             PTR_INCREMENT_BYTES (src, delta);
              msrc += mdelta;
            }
        }
       *dest = result;
 
       count[0]++;
-      PTR_INCREMENT_BYTES (base, sstride[0] * 'base_mult`);
+      PTR_INCREMENT_BYTES (base, sstride[0]);
       PTR_INCREMENT_BYTES (dest, dstride[0]);
       mbase += mstride[0];
       n = 0;
       while (count[n] == extent[n])
        {
          count[n] = 0;
-         PTR_DECREMENT_BYTES (base, sstride[n] * extent[n] * 'base_mult`);
+         PTR_DECREMENT_BYTES (base, sstride[n] * extent[n]);
          PTR_DECREMENT_BYTES (dest, dstride[n] * extent[n]);
          mbase -= mstride[n] * extent[n];
          n++;
@@ -357,7 +357,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  
If not, see
          else
            {
              count[n]++;
-             PTR_INCREMENT_BYTES (base, sstride[n] * 'base_mult`);
+             PTR_INCREMENT_BYTES (base, sstride[n]);
              PTR_INCREMENT_BYTES (dest, dstride[n]);
            }
        }

Reply via email to