libgfortran/generated/maxval_i4.c

   1 /* Implementation of the MAXVAL intrinsic
   2    Copyright 2002 Free Software Foundation, Inc.
   3    Contributed by Paul Brook <paul@nowt.org>
   4
   5 This file is part of the GNU Fortran 95 runtime library (libgfortran).
   6
   7 Libgfortran is free software; you can redistribute it and/or
   8 modify it under the terms of the GNU General Public
   9 License as published by the Free Software Foundation; either
  10 version 2 of the License, or (at your option) any later version.
  11
  12 In addition to the permissions in the GNU General Public License, the
  13 Free Software Foundation gives you unlimited permission to link the
  14 compiled version of this file into combinations with other programs,
  15 and to distribute those combinations without any restriction coming
  16 from the use of this file.  (The General Public License restrictions
  17 do apply in other respects; for example, they cover modification of
  18 the file, and distribution when not linked into a combine
  19 executable.)
  20
  21 Libgfortran is distributed in the hope that it will be useful,
  22 but WITHOUT ANY WARRANTY; without even the implied warranty of
  23 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  24 GNU General Public License for more details.
  25
  26 You should have received a copy of the GNU General Public
  27 License along with libgfortran; see the file COPYING.  If not,
  28 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  29 Boston, MA 02111-1307, USA.  */
  30
  31 #include "config.h"
  32 #include <stdlib.h>
  33 #include <assert.h>
  34 #include <float.h>
  35 #include "libgfortran.h"
  36
  37
  38 extern void maxval_i4 (gfc_array_i4 *, gfc_array_i4 *, index_type *);
  39 export_proto(maxval_i4);
  40
  41 void
  42 maxval_i4 (gfc_array_i4 *retarray, gfc_array_i4 *array, index_type *pdim)
  43 {
  44   index_type count[GFC_MAX_DIMENSIONS - 1];
  45   index_type extent[GFC_MAX_DIMENSIONS - 1];
  46   index_type sstride[GFC_MAX_DIMENSIONS - 1];
  47   index_type dstride[GFC_MAX_DIMENSIONS - 1];
  48   GFC_INTEGER_4 *base;
  49   GFC_INTEGER_4 *dest;
  50   index_type rank;
  51   index_type n;
  52   index_type len;
  53   index_type delta;
  54   index_type dim;
  55
  56   /* Make dim zero based to avoid confusion.  */
  57   dim = (*pdim) - 1;
  58   rank = GFC_DESCRIPTOR_RANK (array) - 1;
  59   if (array->dim[0].stride == 0)
  60     array->dim[0].stride = 1;
  61
  62   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  63   delta = array->dim[dim].stride;
  64
  65   for (n = 0; n < dim; n++)
  66     {
  67       sstride[n] = array->dim[n].stride;
  68       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
  69     }
  70   for (n = dim; n < rank; n++)
  71     {
  72       sstride[n] = array->dim[n + 1].stride;
  73       extent[n] =
  74         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
  75     }
  76
  77   if (retarray->data == NULL)
  78     {
  79       for (n = 0; n < rank; n++)
  80         {
  81           retarray->dim[n].lbound = 0;
  82           retarray->dim[n].ubound = extent[n]-1;
  83           if (n == 0)
  84             retarray->dim[n].stride = 1;
  85           else
  86             retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
  87         }
  88
  89       retarray->data
  90          = internal_malloc_size (sizeof (GFC_INTEGER_4)
  91                                  * retarray->dim[rank-1].stride
  92                                  * extent[rank-1]);
  93       retarray->base = 0;
  94       retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
  95     }
  96   else
  97     {
  98       if (retarray->dim[0].stride == 0)
  99         retarray->dim[0].stride = 1;
 100
 101       if (rank != GFC_DESCRIPTOR_RANK (retarray))
 102         runtime_error ("rank of return array incorrect");
 103     }
 104
 105   for (n = 0; n < rank; n++)
 106     {
 107       count[n] = 0;
 108       dstride[n] = retarray->dim[n].stride;
 109       if (extent[n] <= 0)
 110         len = 0;
 111     }
 112
 113   base = array->data;
 114   dest = retarray->data;
 115
 116   while (base)
 117     {
 118       GFC_INTEGER_4 *src;
 119       GFC_INTEGER_4 result;
 120       src = base;
 121       {
 122
 123   result = -GFC_INTEGER_4_HUGE;
 124         if (len <= 0)
 125           *dest = -GFC_INTEGER_4_HUGE;
 126         else
 127           {
 128             for (n = 0; n < len; n++, src += delta)
 129               {
 130
 131   if (*src > result)
 132     result = *src;
 133           }
 134             *dest = result;
 135           }
 136       }
 137       /* Advance to the next element.  */
 138       count[0]++;
 139       base += sstride[0];
 140       dest += dstride[0];
 141       n = 0;
 142       while (count[n] == extent[n])
 143         {
 144           /* When we get to the end of a dimension, reset it and increment
 145              the next dimension.  */
 146           count[n] = 0;
 147           /* We could precalculate these products, but this is a less
 148              frequently used path so proabably not worth it.  */
 149           base -= sstride[n] * extent[n];
 150           dest -= dstride[n] * extent[n];
 151           n++;
 152           if (n == rank)
 153             {
 154               /* Break out of the look.  */
 155               base = NULL;
 156               break;
 157             }
 158           else
 159             {
 160               count[n]++;
 161               base += sstride[n];
 162               dest += dstride[n];
 163             }
 164         }
 165     }
 166 }
 167
 168
 169 extern void mmaxval_i4 (gfc_array_i4 *, gfc_array_i4 *, index_type *,
 170                                                gfc_array_l4 *);
 171 export_proto(mmaxval_i4);
 172
 173 void
 174 mmaxval_i4 (gfc_array_i4 * retarray, gfc_array_i4 * array,
 175                                   index_type *pdim, gfc_array_l4 * mask)
 176 {
 177   index_type count[GFC_MAX_DIMENSIONS - 1];
 178   index_type extent[GFC_MAX_DIMENSIONS - 1];
 179   index_type sstride[GFC_MAX_DIMENSIONS - 1];
 180   index_type dstride[GFC_MAX_DIMENSIONS - 1];
 181   index_type mstride[GFC_MAX_DIMENSIONS - 1];
 182   GFC_INTEGER_4 *dest;
 183   GFC_INTEGER_4 *base;
 184   GFC_LOGICAL_4 *mbase;
 185   int rank;
 186   int dim;
 187   index_type n;
 188   index_type len;
 189   index_type delta;
 190   index_type mdelta;
 191
 192   dim = (*pdim) - 1;
 193   rank = GFC_DESCRIPTOR_RANK (array) - 1;
 194   if (array->dim[0].stride == 0)
 195     array->dim[0].stride = 1;
 196
 197   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
 198   if (len <= 0)
 199     return;
 200   delta = array->dim[dim].stride;
 201   mdelta = mask->dim[dim].stride;
 202
 203   for (n = 0; n < dim; n++)
 204     {
 205       sstride[n] = array->dim[n].stride;
 206       mstride[n] = mask->dim[n].stride;
 207       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
 208     }
 209   for (n = dim; n < rank; n++)
 210     {
 211       sstride[n] = array->dim[n + 1].stride;
 212       mstride[n] = mask->dim[n + 1].stride;
 213       extent[n] =
 214         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
 215     }
 216
 217   if (retarray->data == NULL)
 218     {
 219       for (n = 0; n < rank; n++)
 220         {
 221           retarray->dim[n].lbound = 0;
 222           retarray->dim[n].ubound = extent[n]-1;
 223           if (n == 0)
 224             retarray->dim[n].stride = 1;
 225           else
 226             retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
 227         }
 228
 229       retarray->data
 230          = internal_malloc_size (sizeof (GFC_INTEGER_4)
 231                                  * retarray->dim[rank-1].stride
 232                                  * extent[rank-1]);
 233       retarray->base = 0;
 234       retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
 235     }
 236   else
 237     {
 238       if (retarray->dim[0].stride == 0)
 239         retarray->dim[0].stride = 1;
 240
 241       if (rank != GFC_DESCRIPTOR_RANK (retarray))
 242         runtime_error ("rank of return array incorrect");
 243     }
 244
 245   for (n = 0; n < rank; n++)
 246     {
 247       count[n] = 0;
 248       dstride[n] = retarray->dim[n].stride;
 249       if (extent[n] <= 0)
 250         return;
 251     }
 252
 253   dest = retarray->data;
 254   base = array->data;
 255   mbase = mask->data;
 256
 257   if (GFC_DESCRIPTOR_SIZE (mask) != 4)
 258     {
 259       /* This allows the same loop to be used for all logical types.  */
 260       assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
 261       for (n = 0; n < rank; n++)
 262         mstride[n] <<= 1;
 263       mdelta <<= 1;
 264       mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
 265     }
 266
 267   while (base)
 268     {
 269       GFC_INTEGER_4 *src;
 270       GFC_LOGICAL_4 *msrc;
 271       GFC_INTEGER_4 result;
 272       src = base;
 273       msrc = mbase;
 274       {
 275
 276   result = -GFC_INTEGER_4_HUGE;
 277         if (len <= 0)
 278           *dest = -GFC_INTEGER_4_HUGE;
 279         else
 280           {
 281             for (n = 0; n < len; n++, src += delta, msrc += mdelta)
 282               {
 283
 284   if (*msrc && *src > result)
 285     result = *src;
 286               }
 287             *dest = result;
 288           }
 289       }
 290       /* Advance to the next element.  */
 291       count[0]++;
 292       base += sstride[0];
 293       mbase += mstride[0];
 294       dest += dstride[0];
 295       n = 0;
 296       while (count[n] == extent[n])
 297         {
 298           /* When we get to the end of a dimension, reset it and increment
 299              the next dimension.  */
 300           count[n] = 0;
 301           /* We could precalculate these products, but this is a less
 302              frequently used path so proabably not worth it.  */
 303           base -= sstride[n] * extent[n];
 304           mbase -= mstride[n] * extent[n];
 305           dest -= dstride[n] * extent[n];
 306           n++;
 307           if (n == rank)
 308             {
 309               /* Break out of the look.  */
 310               base = NULL;
 311               break;
 312             }
 313           else
 314             {
 315               count[n]++;
 316               base += sstride[n];
 317               mbase += mstride[n];
 318               dest += dstride[n];
 319             }
 320         }
 321     }
 322 }
 323