libgfortran/generated/count_4_l4.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_4_l4 (gfc_array_i4 *, gfc_array_l4 *, index_type *);
  38 export_proto(count_4_l4);
  39
  40 void
  41 count_4_l4 (gfc_array_i4 *retarray, gfc_array_l4 *array, index_type *pdim)
  42 {
  43   index_type count[GFC_MAX_DIMENSIONS - 1];
  44   index_type extent[GFC_MAX_DIMENSIONS - 1];
  45   index_type sstride[GFC_MAX_DIMENSIONS - 1];
  46   index_type dstride[GFC_MAX_DIMENSIONS - 1];
  47   GFC_LOGICAL_4 *base;
  48   GFC_INTEGER_4 *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   assert (rank == GFC_DESCRIPTOR_RANK (retarray));
  59   if (array->dim[0].stride == 0)
  60     array->dim[0].stride = 1;
  61   if (retarray->dim[0].stride == 0)
  62     retarray->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_4)
  93                                  * retarray->dim[rank-1].stride
  94                                  * extent[rank-1]);
  95       retarray->base = 0;
  96     }
  97
  98   for (n = 0; n < rank; n++)
  99     {
 100       count[n] = 0;
 101       dstride[n] = retarray->dim[n].stride;
 102       if (extent[n] <= 0)
 103         len = 0;
 104     }
 105
 106   base = array->data;
 107   dest = retarray->data;
 108
 109   while (base)
 110     {
 111       GFC_LOGICAL_4 *src;
 112       GFC_INTEGER_4 result;
 113       src = base;
 114       {
 115
 116   result = 0;
 117         if (len <= 0)
 118           *dest = 0;
 119         else
 120           {
 121             for (n = 0; n < len; n++, src += delta)
 122               {
 123
 124   if (*src)
 125     result++;
 126           }
 127             *dest = result;
 128           }
 129       }
 130       /* Advance to the next element.  */
 131       count[0]++;
 132       base += sstride[0];
 133       dest += dstride[0];
 134       n = 0;
 135       while (count[n] == extent[n])
 136         {
 137           /* When we get to the end of a dimension, reset it and increment
 138              the next dimension.  */
 139           count[n] = 0;
 140           /* We could precalculate these products, but this is a less
 141              frequently used path so proabably not worth it.  */
 142           base -= sstride[n] * extent[n];
 143           dest -= dstride[n] * extent[n];
 144           n++;
 145           if (n == rank)
 146             {
 147               /* Break out of the look.  */
 148               base = NULL;
 149               break;
 150             }
 151           else
 152             {
 153               count[n]++;
 154               base += sstride[n];
 155               dest += dstride[n];
 156             }
 157         }
 158     }
 159 }
 160