libgfortran/generated/any_l8.c

   1 /* Implementation of the ANY 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 "libgfortran.h"
  26
  27
  28 void
  29 __any_l8 (gfc_array_l8 * retarray, gfc_array_l8 *array, index_type *pdim)
  30 {
  31   index_type count[GFC_MAX_DIMENSIONS - 1];
  32   index_type extent[GFC_MAX_DIMENSIONS - 1];
  33   index_type sstride[GFC_MAX_DIMENSIONS - 1];
  34   index_type dstride[GFC_MAX_DIMENSIONS - 1];
  35   GFC_LOGICAL_8 *base;
  36   GFC_LOGICAL_8 *dest;
  37   index_type rank;
  38   index_type n;
  39   index_type len;
  40   index_type delta;
  41   index_type dim;
  42
  43   /* Make dim zero based to avoid confusion.  */
  44   dim = (*pdim) - 1;
  45   rank = GFC_DESCRIPTOR_RANK (array) - 1;
  46   assert (rank == GFC_DESCRIPTOR_RANK (retarray));
  47   if (array->dim[0].stride == 0)
  48     array->dim[0].stride = 1;
  49   if (retarray->dim[0].stride == 0)
  50     retarray->dim[0].stride = 1;
  51
  52   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  53   delta = array->dim[dim].stride;
  54
  55   for (n = 0; n < dim; n++)
  56     {
  57       sstride[n] = array->dim[n].stride;
  58       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
  59     }
  60   for (n = dim; n < rank; n++)
  61     {
  62       sstride[n] = array->dim[n + 1].stride;
  63       extent[n] =
  64         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
  65     }
  66
  67   for (n = 0; n < rank; n++)
  68     {
  69       count[n] = 0;
  70       dstride[n] = retarray->dim[n].stride;
  71       if (extent[n] <= 0)
  72         len = 0;
  73     }
  74
  75   base = array->data;
  76   dest = retarray->data;
  77
  78   while (base)
  79     {
  80       GFC_LOGICAL_8 *src;
  81       GFC_LOGICAL_8 result;
  82       src = base;
  83       {
  84
  85   result = 0;
  86         if (len <= 0)
  87           *dest = 0;
  88         else
  89           {
  90             for (n = 0; n < len; n++, src += delta)
  91               {
  92
  93   /* Return true if any of the elements are set.  */
  94   if (*src)
  95     {
  96       result = 1;
  97       break;
  98     }
  99           }
 100             *dest = result;
 101           }
 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