libgfortran/generated/count_8_l8.c

   1 /* Implementation of the COUNT 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 extern void count_8_l8 (gfc_array_i8 *, gfc_array_l8 *, index_type *);
  29 export_proto(count_8_l8);
  30
  31 void
  32 count_8_l8 (gfc_array_i8 *retarray, gfc_array_l8 *array, index_type *pdim)
  33 {
  34   index_type count[GFC_MAX_DIMENSIONS - 1];
  35   index_type extent[GFC_MAX_DIMENSIONS - 1];
  36   index_type sstride[GFC_MAX_DIMENSIONS - 1];
  37   index_type dstride[GFC_MAX_DIMENSIONS - 1];
  38   GFC_LOGICAL_8 *base;
  39   GFC_INTEGER_8 *dest;
  40   index_type rank;
  41   index_type n;
  42   index_type len;
  43   index_type delta;
  44   index_type dim;
  45
  46   /* Make dim zero based to avoid confusion.  */
  47   dim = (*pdim) - 1;
  48   rank = GFC_DESCRIPTOR_RANK (array) - 1;
  49   assert (rank == GFC_DESCRIPTOR_RANK (retarray));
  50   if (array->dim[0].stride == 0)
  51     array->dim[0].stride = 1;
  52   if (retarray->dim[0].stride == 0)
  53     retarray->dim[0].stride = 1;
  54
  55   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  56   delta = array->dim[dim].stride;
  57
  58   for (n = 0; n < dim; n++)
  59     {
  60       sstride[n] = array->dim[n].stride;
  61       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
  62     }
  63   for (n = dim; n < rank; n++)
  64     {
  65       sstride[n] = array->dim[n + 1].stride;
  66       extent[n] =
  67         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
  68     }
  69
  70   if (retarray->data == NULL)
  71     {
  72       for (n = 0; n < rank; n++)
  73         {
  74           retarray->dim[n].lbound = 0;
  75           retarray->dim[n].ubound = extent[n]-1;
  76           if (n == 0)
  77             retarray->dim[n].stride = 1;
  78           else
  79             retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
  80         }
  81
  82       retarray->data
  83          = internal_malloc_size (sizeof (GFC_INTEGER_8)
  84                                  * retarray->dim[rank-1].stride
  85                                  * extent[rank-1]);
  86       retarray->base = 0;
  87     }
  88
  89   for (n = 0; n < rank; n++)
  90     {
  91       count[n] = 0;
  92       dstride[n] = retarray->dim[n].stride;
  93       if (extent[n] <= 0)
  94         len = 0;
  95     }
  96
  97   base = array->data;
  98   dest = retarray->data;
  99
 100   while (base)
 101     {
 102       GFC_LOGICAL_8 *src;
 103       GFC_INTEGER_8 result;
 104       src = base;
 105       {
 106
 107   result = 0;
 108         if (len <= 0)
 109           *dest = 0;
 110         else
 111           {
 112             for (n = 0; n < len; n++, src += delta)
 113               {
 114
 115   if (*src)
 116     result++;
 117           }
 118             *dest = result;
 119           }
 120       }
 121       /* Advance to the next element.  */
 122       count[0]++;
 123       base += sstride[0];
 124       dest += dstride[0];
 125       n = 0;
 126       while (count[n] == extent[n])
 127         {
 128           /* When we get to the end of a dimension, reset it and increment
 129              the next dimension.  */
 130           count[n] = 0;
 131           /* We could precalculate these products, but this is a less
 132              frequently used path so proabably not worth it.  */
 133           base -= sstride[n] * extent[n];
 134           dest -= dstride[n] * extent[n];
 135           n++;
 136           if (n == rank)
 137             {
 138               /* Break out of the look.  */
 139               base = NULL;
 140               break;
 141             }
 142           else
 143             {
 144               count[n]++;
 145               base += sstride[n];
 146               dest += dstride[n];
 147             }
 148         }
 149     }
 150 }
 151