Update copyright years.

[thirdparty/gcc.git] / libgfortran / generated / maxloc0_4_i2.c

diff --git a/libgfortran/generated/maxloc0_4_i2.c b/libgfortran/generated/maxloc0_4_i2.c
index f78e20ec405a0e6f38035484279c71a17bc2c742..edc951df6afd37ca403f9d81a0359ba66b5cd0a0 100644 (file)
--- a/libgfortran/generated/maxloc0_4_i2.c
+++ b/libgfortran/generated/maxloc0_4_i2.c
@@ -1,5 +1,5 @@
 /* Implementation of the MAXLOC intrinsic
-   Copyright (C) 2002-2018 Free Software Foundation, Inc.
+   Copyright (C) 2002-2020 Free Software Foundation, Inc.
    Contributed by Paul Brook <paul@nowt.org>
 
 This file is part of the GNU Fortran 95 runtime library (libgfortran).
@@ -47,7 +47,6 @@ maxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
   index_type rank;
   index_type n;
 
-  assert(back == 0);
   rank = GFC_DESCRIPTOR_RANK (array);
   if (rank <= 0)
     runtime_error ("Rank of array needs to be > 0");
@@ -55,7 +54,7 @@ maxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
   if (retarray->base_addr == NULL)
     {
       GFC_DIMENSION_SET(retarray->dim[0], 0, rank-1, 1);
-      GFC_DTYPE_COPY_SETRANK(retarray,retarray,1);
+      retarray->dtype.rank = 1;
       retarray->offset = 0;
       retarray->base_addr = xmallocarray (rank, sizeof (GFC_INTEGER_4));
     }
@@ -101,13 +100,9 @@ maxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
 #endif
   while (base)
     {
-      do
-       {
          /* Implementation start.  */
 
 #if defined(GFC_INTEGER_2_QUIET_NAN)
-       }
-      while (0);
       if (unlikely (!fast))
        {
          do
@@ -126,15 +121,29 @@ maxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
          if (likely (fast))
            continue;
        }
-      else do
-       {
+      else
 #endif
-         if (*base > maxval)
-           {
-             maxval = *base;
-             for (n = 0; n < rank; n++)
-               dest[n * dstride] = count[n] + 1;
-           }
+        if (back)
+         do
+            {
+             if (unlikely (*base >= maxval))
+              {
+                maxval = *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 > maxval))
+              {
+                maxval = *base;
+                for (n = 0; n < rank; n++)
+                  dest[n * dstride] = count[n] + 1;
+              }
          /* Implementation end.  */
          /* Advance to the next element.  */
          base += sstride[0];
@@ -167,7 +176,6 @@ maxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
   }
 }
 
-
 extern void mmaxloc0_4_i2 (gfc_array_i4 * const restrict, 
        gfc_array_i2 * const restrict, gfc_array_l1 * const restrict,
        GFC_LOGICAL_4);
@@ -190,7 +198,13 @@ mmaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
   index_type n;
   int mask_kind;
 
-  assert(back == 0);
+
+  if (mask == NULL)
+    {
+      maxloc0_4_i2 (retarray, array, back);
+      return;
+    }
+
   rank = GFC_DESCRIPTOR_RANK (array);
   if (rank <= 0)
     runtime_error ("Rank of array needs to be > 0");
@@ -198,7 +212,7 @@ mmaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
   if (retarray->base_addr == NULL)
     {
       GFC_DIMENSION_SET(retarray->dim[0], 0, rank - 1, 1);
-      GFC_DTYPE_COPY_SETRANK(retarray,retarray,1);
+      retarray->dtype.rank = 1;
       retarray->offset = 0;
       retarray->base_addr = xmallocarray (rank, sizeof (GFC_INTEGER_4));
     }
@@ -261,12 +275,8 @@ mmaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
 #endif
   while (base)
     {
-      do
-       {
          /* Implementation start.  */
 
-       }
-      while (0);
       if (unlikely (!fast))
        {
          do
@@ -294,14 +304,28 @@ mmaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
          if (likely (fast))
            continue;
        }
-      else do
-       {
-         if (*mbase && *base > maxval)
+      else
+        if (back)
+         do
            {
-             maxval = *base;
-             for (n = 0; n < rank; n++)
-               dest[n * dstride] = count[n] + 1;
+             if (*mbase && *base >= maxval)
+               {
+                 maxval = *base;
+                 for (n = 0; n < rank; n++)
+                   dest[n * dstride] = count[n] + 1;
+               }
+             base += sstride[0];
            }
+         while (++count[0] != extent[0]);
+       else
+         do
+           {
+             if (*mbase && unlikely (*base > maxval))
+               {
+                 maxval = *base;
+                 for (n = 0; n < rank; n++)
+                   dest[n * dstride] = count[n] + 1;
+               }
          /* Implementation end.  */
          /* Advance to the next element.  */
          base += sstride[0];
@@ -352,7 +376,7 @@ smaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
   index_type n;
   GFC_INTEGER_4 *dest;
 
-  if (*mask)
+  if (mask == NULL || *mask)
     {
       maxloc0_4_i2 (retarray, array, back);
       return;
@@ -366,7 +390,7 @@ smaxloc0_4_i2 (gfc_array_i4 * const restrict retarray,
   if (retarray->base_addr == NULL)
     {
       GFC_DIMENSION_SET(retarray->dim[0], 0, rank-1, 1);
-      GFC_DTYPE_COPY_SETRANK(retarray,retarray,1);
+      retarray->dtype.rank = 1;
       retarray->offset = 0;
       retarray->base_addr = xmallocarray (rank, sizeof (GFC_INTEGER_4));
     }