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