libgfortran/generated/any_l16.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 (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., 51 Franklin Street, Fifth Floor,
  29 Boston, MA 02110-1301, USA.  */
  30
  31 #include "config.h"
  32 #include <stdlib.h>
  33 #include <assert.h>
  34 #include "libgfortran.h"
  35
  36
  37 #if defined (HAVE_GFC_LOGICAL_16) && defined (HAVE_GFC_LOGICAL_16)
  38
  39
  40 extern void any_l16 (gfc_array_l16 * const restrict,
  41         gfc_array_l16 * const restrict, const index_type * const restrict);
  42 export_proto(any_l16);
  43
  44 void
  45 any_l16 (gfc_array_l16 * const restrict retarray,
  46         gfc_array_l16 * const restrict array,
  47         const index_type * const restrict pdim)
  48 {
  49   index_type count[GFC_MAX_DIMENSIONS];
  50   index_type extent[GFC_MAX_DIMENSIONS];
  51   index_type sstride[GFC_MAX_DIMENSIONS];
  52   index_type dstride[GFC_MAX_DIMENSIONS];
  53   const GFC_LOGICAL_16 * restrict base;
  54   GFC_LOGICAL_16 * restrict dest;
  55   index_type rank;
  56   index_type n;
  57   index_type len;
  58   index_type delta;
  59   index_type dim;
  60
  61   /* Make dim zero based to avoid confusion.  */
  62   dim = (*pdim) - 1;
  63   rank = GFC_DESCRIPTOR_RANK (array) - 1;
  64
  65   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  66   delta = array->dim[dim].stride;
  67
  68   for (n = 0; n < dim; n++)
  69     {
  70       sstride[n] = array->dim[n].stride;
  71       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
  72     }
  73   for (n = dim; n < rank; n++)
  74     {
  75       sstride[n] = array->dim[n + 1].stride;
  76       extent[n] =
  77         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
  78     }
  79
  80   if (retarray->data == NULL)
  81     {
  82       for (n = 0; n < rank; n++)
  83         {
  84           retarray->dim[n].lbound = 0;
  85           retarray->dim[n].ubound = extent[n]-1;
  86           if (n == 0)
  87             retarray->dim[n].stride = 1;
  88           else
  89             retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
  90         }
  91
  92       retarray->data
  93          = internal_malloc_size (sizeof (GFC_LOGICAL_16)
  94                                  * retarray->dim[rank-1].stride
  95                                  * extent[rank-1]);
  96       retarray->offset = 0;
  97       retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
  98     }
  99   else
 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       const GFC_LOGICAL_16 * restrict src;
 119       GFC_LOGICAL_16 result;
 120       src = base;
 121       {
 122
 123   result = 0;
 124         if (len <= 0)
 125           *dest = 0;
 126         else
 127           {
 128             for (n = 0; n < len; n++, src += delta)
 129               {
 130
 131   /* Return true if any of the elements are set.  */
 132   if (*src)
 133     {
 134       result = 1;
 135       break;
 136     }
 137           }
 138             *dest = result;
 139           }
 140       }
 141       /* Advance to the next element.  */
 142       count[0]++;
 143       base += sstride[0];
 144       dest += dstride[0];
 145       n = 0;
 146       while (count[n] == extent[n])
 147         {
 148           /* When we get to the end of a dimension, reset it and increment
 149              the next dimension.  */
 150           count[n] = 0;
 151           /* We could precalculate these products, but this is a less
 152              frequently used path so probably not worth it.  */
 153           base -= sstride[n] * extent[n];
 154           dest -= dstride[n] * extent[n];
 155           n++;
 156           if (n == rank)
 157             {
 158               /* Break out of the look.  */
 159               base = NULL;
 160               break;
 161             }
 162           else
 163             {
 164               count[n]++;
 165               base += sstride[n];
 166               dest += dstride[n];
 167             }
 168         }
 169     }
 170 }
 171
 172 #endif