[gcc(refs/users/mikael/heads/refactor_descriptor_v08)] Correction ifindloc0.m4

[Mikael Morin]

https://gcc.gnu.org/g:b174033a1e269bf7d2d2576427c5e0cebdf95a53

commit b174033a1e269bf7d2d2576427c5e0cebdf95a53
Author: Mikael Morin <mikael@gcc.gnu.org>
Date:   Tue Sep 9 22:15:29 2025 +0200

    Correction ifindloc0.m4

Diff:
---
 libgfortran/m4/ifindloc0.m4 | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/libgfortran/m4/ifindloc0.m4 b/libgfortran/m4/ifindloc0.m4
index f5e392c5e791..4e1d1dccc4e5 100644
--- a/libgfortran/m4/ifindloc0.m4
+++ b/libgfortran/m4/ifindloc0.m4
@@ -103,14 +103,14 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 	      count[n] = 0;
 	      /* We could precalculate these products, but this is a less
 		 frequently used path so probably not worth it.  */
-	      PTR_INCREMENT_BYTES (base, sstride[n] * extent[n] * 'base_mult`);
+	      PTR_INCREMENT_BYTES (base, sstride[n] * extent[n]);
 	      n++;
 	      if (n >= rank)
 	        return;
 	      else
 		{
 		  count[n]++;
-		  PTR_DECREMENT_BYTES (base, sstride[n] * 'base_mult`);
+		  PTR_DECREMENT_BYTES (base, sstride[n]);
 		}
 	    } while (count[n] == extent[n]);      
 	}
@@ -129,7 +129,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 
 		  return;
 		}
-	      PTR_INCREMENT_BYTES (base, sstride[0] * 'base_mult`);
+	      PTR_INCREMENT_BYTES (base, sstride[0]);
 	    } while(++count[0] != extent[0]);
 
 	  n = 0;
@@ -140,14 +140,14 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 	      count[n] = 0;
 	      /* We could precalculate these products, but this is a less
 		 frequently used path so probably not worth it.  */
-	      PTR_DECREMENT_BYTES (base, sstride[n] * extent[n] * 'base_mult`);
+	      PTR_DECREMENT_BYTES (base, sstride[n] * extent[n]);
 	      n++;
 	      if (n >= rank)
 	        return;
 	      else
 		{
 		  count[n]++;
-		  PTR_INCREMENT_BYTES (base, sstride[n] * 'base_mult`);
+		  PTR_INCREMENT_BYTES (base, sstride[n]);
 		}
 	    } while (count[n] == extent[n]);
 	}
@@ -241,7 +241,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 
 		  return;
 		}
-	      PTR_DECREMENT_BYTES (base, sstride[0] * 'base_mult`);
+	      PTR_DECREMENT_BYTES (base, sstride[0]);
 	      mbase -= mstride[0];
 	    } while(++count[0] != extent[0]);
 
@@ -253,7 +253,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 	      count[n] = 0;
 	      /* We could precalculate these products, but this is a less
 		 frequently used path so probably not worth it.  */
-	      PTR_INCREMENT_BYTES (base, sstride[n] * extent[n] * 'base_mult`);
+	      PTR_INCREMENT_BYTES (base, sstride[n] * extent[n]);
 	      mbase -= mstride[n] * extent[n];
 	      n++;
 	      if (n >= rank)
@@ -261,7 +261,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 	      else
 		{
 		  count[n]++;
-		  PTR_DECREMENT_BYTES (base, sstride[n] * 'base_mult`);
+		  PTR_DECREMENT_BYTES (base, sstride[n]);
 		  mbase += mstride[n];
 		}
 	    } while (count[n] == extent[n]);      
@@ -281,7 +281,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 
 		  return;
 		}
-	      PTR_INCREMENT_BYTES (base, sstride[0] * 'base_mult`);
+	      PTR_INCREMENT_BYTES (base, sstride[0]);
 	      mbase += mstride[0];
 	    } while(++count[0] != extent[0]);
 
@@ -293,7 +293,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
 	      count[n] = 0;
 	      /* We could precalculate these products, but this is a less
 		 frequently used path so probably not worth it.  */
-	      PTR_DECREMENT_BYTES (base, sstride[n] * extent[n] * 'base_mult`);
+	      PTR_DECREMENT_BYTES (base, sstride[n] * extent[n]);
 	      mbase -= mstride[n] * extent[n];
 	      n++;
 	      if (n >= rank)
@@ -301,7 +301,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]);
 		  mbase += mstride[n];
 		}
 	    } while (count[n] == extent[n]);