libgfortran/generated/minloc1_4_i4.c

   1 /* Implementation of the MINLOC 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 (libgfor).
   6
   7 Libgfortran is free software; you can redistribute it and/or
   8 modify it under the terms of the GNU Lesser General Public
   9 License as published by the Free Software Foundation; either
  10 version 2.1 of the License, or (at your option) any later version.
  11
  12 Libgfortran is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU Lesser General Public License for more details.
  16
  17 You should have received a copy of the GNU Lesser General Public
  18 License along with libgfor; see the file COPYING.LIB.  If not,
  19 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  20 Boston, MA 02111-1307, USA.  */
  21
  22 #include "config.h"
  23 #include <stdlib.h>
  24 #include <assert.h>
  25 #include <float.h>
  26 #include <limits.h>
  27 #include "libgfortran.h"
  28
  29
  30 void
  31 __minloc1_4_i4 (gfc_array_i4 * retarray, gfc_array_i4 *array, index_type *pdim)
  32 {
  33   index_type count[GFC_MAX_DIMENSIONS - 1];
  34   index_type extent[GFC_MAX_DIMENSIONS - 1];
  35   index_type sstride[GFC_MAX_DIMENSIONS - 1];
  36   index_type dstride[GFC_MAX_DIMENSIONS - 1];
  37   GFC_INTEGER_4 *base;
  38   GFC_INTEGER_4 *dest;
  39   index_type rank;
  40   index_type n;
  41   index_type len;
  42   index_type delta;
  43   index_type dim;
  44
  45   /* Make dim zero based to avoid confusion.  */
  46   dim = (*pdim) - 1;
  47   rank = GFC_DESCRIPTOR_RANK (array) - 1;
  48   assert (rank == GFC_DESCRIPTOR_RANK (retarray));
  49   if (array->dim[0].stride == 0)
  50     array->dim[0].stride = 1;
  51   if (retarray->dim[0].stride == 0)
  52     retarray->dim[0].stride = 1;
  53
  54   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  55   if (len <= 0)
  56     return;
  57   delta = array->dim[dim].stride;
  58
  59   for (n = 0; n < dim; n++)
  60     {
  61       sstride[n] = array->dim[n].stride;
  62       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
  63     }
  64   for (n = dim; n < rank; n++)
  65     {
  66       sstride[n] = array->dim[n + 1].stride;
  67       extent[n] =
  68         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
  69     }
  70
  71   for (n = 0; n < rank; n++)
  72     {
  73       count[n] = 0;
  74       dstride[n] = retarray->dim[n].stride;
  75       if (extent[n] <= 0)
  76         return;
  77     }
  78
  79   base = array->data;
  80   dest = retarray->data;
  81
  82   while (base)
  83     {
  84       GFC_INTEGER_4 *src;
  85       GFC_INTEGER_4 result;
  86       src = base;
  87       {
  88
  89   GFC_INTEGER_4 minval;
  90   minval = GFC_INTEGER_4_HUGE;
  91   result = 0;
  92        for (n = 0; n < len; n++, src += delta)
  93           {
  94
  95   if (*src < minval)
  96     {
  97       minval = *src;
  98       result = (GFC_INTEGER_4)n + 1;
  99     }
 100           }
 101         *dest = result;
 102       }
 103       /* Advance to the next element.  */
 104       count[0]++;
 105       base += sstride[0];
 106       dest += dstride[0];
 107       n = 0;
 108       while (count[n] == extent[n])
 109         {
 110           /* When we get to the end of a dimension, reset it and increment
 111              the next dimension.  */
 112           count[n] = 0;
 113           /* We could precalculate these products, but this is a less
 114              frequently used path so proabably not worth it.  */
 115           base -= sstride[n] * extent[n];
 116           dest -= dstride[n] * extent[n];
 117           n++;
 118           if (n == rank)
 119             {
 120               /* Break out of the look.  */
 121               base = NULL;
 122               break;
 123             }
 124           else
 125             {
 126               count[n]++;
 127               base += sstride[n];
 128               dest += dstride[n];
 129             }
 130         }
 131     }
 132 }
 133
 134 void
 135 __mminloc1_4_i4 (gfc_array_i4 * retarray, gfc_array_i4 * array, index_type *pdim, gfc_array_l4 * mask)
 136 {
 137   index_type count[GFC_MAX_DIMENSIONS - 1];
 138   index_type extent[GFC_MAX_DIMENSIONS - 1];
 139   index_type sstride[GFC_MAX_DIMENSIONS - 1];
 140   index_type dstride[GFC_MAX_DIMENSIONS - 1];
 141   index_type mstride[GFC_MAX_DIMENSIONS - 1];
 142   GFC_INTEGER_4 *dest;
 143   GFC_INTEGER_4 *base;
 144   GFC_LOGICAL_4 *mbase;
 145   int rank;
 146   int dim;
 147   index_type n;
 148   index_type len;
 149   index_type delta;
 150   index_type mdelta;
 151
 152   dim = (*pdim) - 1;
 153   rank = GFC_DESCRIPTOR_RANK (array) - 1;
 154   assert (rank == GFC_DESCRIPTOR_RANK (retarray));
 155   if (array->dim[0].stride == 0)
 156     array->dim[0].stride = 1;
 157   if (retarray->dim[0].stride == 0)
 158     retarray->dim[0].stride = 1;
 159
 160   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
 161   if (len <= 0)
 162     return;
 163   delta = array->dim[dim].stride;
 164   mdelta = mask->dim[dim].stride;
 165
 166   for (n = 0; n < dim; n++)
 167     {
 168       sstride[n] = array->dim[n].stride;
 169       mstride[n] = mask->dim[n].stride;
 170       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
 171     }
 172   for (n = dim; n < rank; n++)
 173     {
 174       sstride[n] = array->dim[n + 1].stride;
 175       mstride[n] = mask->dim[n + 1].stride;
 176       extent[n] =
 177         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
 178     }
 179
 180   for (n = 0; n < rank; n++)
 181     {
 182       count[n] = 0;
 183       dstride[n] = retarray->dim[n].stride;
 184       if (extent[n] <= 0)
 185         return;
 186     }
 187
 188   dest = retarray->data;
 189   base = array->data;
 190   mbase = mask->data;
 191
 192   if (GFC_DESCRIPTOR_SIZE (mask) != 4)
 193     {
 194       /* This allows the same loop to be used for all logical types.  */
 195       assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
 196       for (n = 0; n < rank; n++)
 197         mstride[n] <<= 1;
 198       mdelta <<= 1;
 199       mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
 200     }
 201
 202   while (base)
 203     {
 204       GFC_INTEGER_4 *src;
 205       GFC_LOGICAL_4 *msrc;
 206       GFC_INTEGER_4 result;
 207       src = base;
 208       msrc = mbase;
 209       {
 210
 211   GFC_INTEGER_4 minval;
 212   minval = GFC_INTEGER_4_HUGE;
 213   result = 0;
 214         for (n = 0; n < len; n++, src += delta, msrc += mdelta)
 215           {
 216
 217   if (*msrc && *src < minval)
 218     {
 219       minval = *src;
 220       result = (GFC_INTEGER_4)n + 1;
 221     }
 222           }
 223         *dest = result;
 224       }
 225       /* Advance to the next element.  */
 226       count[0]++;
 227       base += sstride[0];
 228       mbase += mstride[0];
 229       dest += dstride[0];
 230       n = 0;
 231       while (count[n] == extent[n])
 232         {
 233           /* When we get to the end of a dimension, reset it and increment
 234              the next dimension.  */
 235           count[n] = 0;
 236           /* We could precalculate these products, but this is a less
 237              frequently used path so proabably not worth it.  */
 238           base -= sstride[n] * extent[n];
 239           mbase -= mstride[n] * extent[n];
 240           dest -= dstride[n] * extent[n];
 241           n++;
 242           if (n == rank)
 243             {
 244               /* Break out of the look.  */
 245               base = NULL;
 246               break;
 247             }
 248           else
 249             {
 250               count[n]++;
 251               base += sstride[n];
 252               mbase += mstride[n];
 253               dest += dstride[n];
 254             }
 255         }
 256     }
 257 }
 258