libgfortran/generated/count_1_l.c

   1 /* Implementation of the COUNT intrinsic
   2    Copyright (C) 2002-2016 Free Software Foundation, Inc.
   3    Contributed by Paul Brook <paul@nowt.org>
   4
   5 This file is part of the GNU Fortran 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 3 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 General Public License for more details.
  16
  17 Under Section 7 of GPL version 3, you are granted additional
  18 permissions described in the GCC Runtime Library Exception, version
  19 3.1, as published by the Free Software Foundation.
  20
  21 You should have received a copy of the GNU General Public License and
  22 a copy of the GCC Runtime Library Exception along with this program;
  23 see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
  24 <http://www.gnu.org/licenses/>.  */
  25
  26 #include "libgfortran.h"
  27 #include <stdlib.h>
  28 #include <assert.h>
  29
  30
  31 #if defined (HAVE_GFC_INTEGER_1)
  32
  33
  34 extern void count_1_l (gfc_array_i1 * const restrict,
  35         gfc_array_l1 * const restrict, const index_type * const restrict);
  36 export_proto(count_1_l);
  37
  38 void
  39 count_1_l (gfc_array_i1 * const restrict retarray,
  40         gfc_array_l1 * const restrict array,
  41         const index_type * const restrict 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   const GFC_LOGICAL_1 * restrict base;
  48   GFC_INTEGER_1 * restrict dest;
  49   index_type rank;
  50   index_type n;
  51   index_type len;
  52   index_type delta;
  53   index_type dim;
  54   int src_kind;
  55   int continue_loop;
  56
  57   /* Make dim zero based to avoid confusion.  */
  58   dim = (*pdim) - 1;
  59   rank = GFC_DESCRIPTOR_RANK (array) - 1;
  60
  61   src_kind = GFC_DESCRIPTOR_SIZE (array);
  62
  63   len = GFC_DESCRIPTOR_EXTENT(array,dim);
  64   if (len < 0)
  65     len = 0;
  66
  67   delta = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
  68
  69   for (n = 0; n < dim; n++)
  70     {
  71       sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n);
  72       extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
  73
  74       if (extent[n] < 0)
  75         extent[n] = 0;
  76     }
  77   for (n = dim; n < rank; n++)
  78     {
  79       sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n + 1);
  80       extent[n] = GFC_DESCRIPTOR_EXTENT(array,n + 1);
  81
  82       if (extent[n] < 0)
  83         extent[n] = 0;
  84     }
  85
  86   if (retarray->base_addr == NULL)
  87     {
  88       size_t alloc_size, str;
  89
  90       for (n = 0; n < rank; n++)
  91         {
  92           if (n == 0)
  93             str = 1;
  94           else
  95             str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
  96
  97           GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
  98
  99         }
 100
 101       retarray->offset = 0;
 102       retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
 103
 104       alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];
 105
 106       if (alloc_size == 0)
 107         {
 108           /* Make sure we have a zero-sized array.  */
 109           GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
 110           return;
 111         }
 112       else
 113         retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_1));
 114     }
 115   else
 116     {
 117       if (rank != GFC_DESCRIPTOR_RANK (retarray))
 118         runtime_error ("rank of return array incorrect in"
 119                        " COUNT intrinsic: is %ld, should be %ld",
 120                        (long int) GFC_DESCRIPTOR_RANK (retarray),
 121                        (long int) rank);
 122
 123       if (unlikely (compile_options.bounds_check))
 124         {
 125           for (n=0; n < rank; n++)
 126             {
 127               index_type ret_extent;
 128
 129               ret_extent = GFC_DESCRIPTOR_EXTENT(retarray,n);
 130               if (extent[n] != ret_extent)
 131                 runtime_error ("Incorrect extent in return value of"
 132                                " COUNT intrinsic in dimension %d:"
 133                                " is %ld, should be %ld", (int) n + 1,
 134                                (long int) ret_extent, (long int) extent[n]);
 135             }
 136         }
 137     }
 138
 139   for (n = 0; n < rank; n++)
 140     {
 141       count[n] = 0;
 142       dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
 143       if (extent[n] <= 0)
 144         return;
 145     }
 146
 147   base = array->base_addr;
 148
 149   if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
 150 #ifdef HAVE_GFC_LOGICAL_16
 151       || src_kind == 16
 152 #endif
 153     )
 154     {
 155       if (base)
 156         base = GFOR_POINTER_TO_L1 (base, src_kind);
 157     }
 158   else
 159     internal_error (NULL, "Funny sized logical array in COUNT intrinsic");
 160
 161   dest = retarray->base_addr;
 162
 163   continue_loop = 1;
 164   while (continue_loop)
 165     {
 166       const GFC_LOGICAL_1 * restrict src;
 167       GFC_INTEGER_1 result;
 168       src = base;
 169       {
 170
 171   result = 0;
 172         if (len <= 0)
 173           *dest = 0;
 174         else
 175           {
 176             for (n = 0; n < len; n++, src += delta)
 177               {
 178
 179   if (*src)
 180     result++;
 181           }
 182             *dest = result;
 183           }
 184       }
 185       /* Advance to the next element.  */
 186       count[0]++;
 187       base += sstride[0];
 188       dest += dstride[0];
 189       n = 0;
 190       while (count[n] == extent[n])
 191         {
 192           /* When we get to the end of a dimension, reset it and increment
 193              the next dimension.  */
 194           count[n] = 0;
 195           /* We could precalculate these products, but this is a less
 196              frequently used path so probably not worth it.  */
 197           base -= sstride[n] * extent[n];
 198           dest -= dstride[n] * extent[n];
 199           n++;
 200           if (n == rank)
 201             {
 202               /* Break out of the look.  */
 203               continue_loop = 0;
 204               break;
 205             }
 206           else
 207             {
 208               count[n]++;
 209               base += sstride[n];
 210               dest += dstride[n];
 211             }
 212         }
 213     }
 214 }
 215
 216 #endif