libgfortran/generated/all_l2.c

   1 /* Implementation of the ALL intrinsic
   2    Copyright 2002, 2007 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 "libgfortran.h"
  32 #include <stdlib.h>
  33 #include <assert.h>
  34
  35
  36 #if defined (HAVE_GFC_LOGICAL_2)
  37
  38
  39 extern void all_l2 (gfc_array_l2 * const restrict,
  40         gfc_array_l1 * const restrict, const index_type * const restrict);
  41 export_proto(all_l2);
  42
  43 void
  44 all_l2 (gfc_array_l2 * const restrict retarray,
  45         gfc_array_l1 * const restrict array,
  46         const index_type * const restrict pdim)
  47 {
  48   index_type count[GFC_MAX_DIMENSIONS];
  49   index_type extent[GFC_MAX_DIMENSIONS];
  50   index_type sstride[GFC_MAX_DIMENSIONS];
  51   index_type dstride[GFC_MAX_DIMENSIONS];
  52   const GFC_LOGICAL_1 * restrict base;
  53   GFC_LOGICAL_2 * restrict dest;
  54   index_type rank;
  55   index_type n;
  56   index_type len;
  57   index_type delta;
  58   index_type dim;
  59   int src_kind;
  60
  61   /* Make dim zero based to avoid confusion.  */
  62   dim = (*pdim) - 1;
  63   rank = GFC_DESCRIPTOR_RANK (array) - 1;
  64
  65   src_kind = GFC_DESCRIPTOR_SIZE (array);
  66
  67   len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  68   delta = array->dim[dim].stride * src_kind;
  69
  70   for (n = 0; n < dim; n++)
  71     {
  72       sstride[n] = array->dim[n].stride * src_kind;
  73       extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
  74
  75       if (extent[n] < 0)
  76         extent[n] = 0;
  77     }
  78   for (n = dim; n < rank; n++)
  79     {
  80       sstride[n] = array->dim[n + 1].stride * src_kind;
  81       extent[n] =
  82         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
  83
  84       if (extent[n] < 0)
  85         extent[n] = 0;
  86     }
  87
  88   if (retarray->data == NULL)
  89     {
  90       size_t alloc_size;
  91
  92       for (n = 0; n < rank; n++)
  93         {
  94           retarray->dim[n].lbound = 0;
  95           retarray->dim[n].ubound = extent[n]-1;
  96           if (n == 0)
  97             retarray->dim[n].stride = 1;
  98           else
  99             retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
 100         }
 101
 102       retarray->offset = 0;
 103       retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
 104
 105       alloc_size = sizeof (GFC_LOGICAL_2) * retarray->dim[rank-1].stride
 106                    * extent[rank-1];
 107
 108       if (alloc_size == 0)
 109         {
 110           /* Make sure we have a zero-sized array.  */
 111           retarray->dim[0].lbound = 0;
 112           retarray->dim[0].ubound = -1;
 113           return;
 114         }
 115       else
 116         retarray->data = internal_malloc_size (alloc_size);
 117     }
 118   else
 119     {
 120       if (rank != GFC_DESCRIPTOR_RANK (retarray))
 121         runtime_error ("rank of return array incorrect in"
 122                        " ALL intrinsic: is %ld, should be %ld",
 123                        (long int) GFC_DESCRIPTOR_RANK (retarray),
 124                        (long int) rank);
 125
 126       if (compile_options.bounds_check)
 127         {
 128           for (n=0; n < rank; n++)
 129             {
 130               index_type ret_extent;
 131
 132               ret_extent = retarray->dim[n].ubound + 1
 133                 - retarray->dim[n].lbound;
 134               if (extent[n] != ret_extent)
 135                 runtime_error ("Incorrect extent in return value of"
 136                                " ALL intrinsic in dimension %d:"
 137                                " is %ld, should be %ld", n + 1,
 138                                (long int) ret_extent, (long int) extent[n]);
 139             }
 140         }
 141     }
 142
 143   for (n = 0; n < rank; n++)
 144     {
 145       count[n] = 0;
 146       dstride[n] = retarray->dim[n].stride;
 147       if (extent[n] <= 0)
 148         len = 0;
 149     }
 150
 151   base = array->data;
 152
 153   if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
 154 #ifdef HAVE_GFC_LOGICAL_16
 155       || src_kind == 16
 156 #endif
 157     )
 158     {
 159       if (base)
 160         base = GFOR_POINTER_TO_L1 (base, src_kind);
 161     }
 162   else
 163     internal_error (NULL, "Funny sized logical array in ALL intrinsic");
 164
 165   dest = retarray->data;
 166
 167   while (base)
 168     {
 169       const GFC_LOGICAL_1 * restrict src;
 170       GFC_LOGICAL_2 result;
 171       src = base;
 172       {
 173
 174   /* Return true only if all the elements are set.  */
 175   result = 1;
 176         if (len <= 0)
 177           *dest = 1;
 178         else
 179           {
 180             for (n = 0; n < len; n++, src += delta)
 181               {
 182
 183   if (! *src)
 184     {
 185       result = 0;
 186       break;
 187     }
 188           }
 189             *dest = result;
 190           }
 191       }
 192       /* Advance to the next element.  */
 193       count[0]++;
 194       base += sstride[0];
 195       dest += dstride[0];
 196       n = 0;
 197       while (count[n] == extent[n])
 198         {
 199           /* When we get to the end of a dimension, reset it and increment
 200              the next dimension.  */
 201           count[n] = 0;
 202           /* We could precalculate these products, but this is a less
 203              frequently used path so probably not worth it.  */
 204           base -= sstride[n] * extent[n];
 205           dest -= dstride[n] * extent[n];
 206           n++;
 207           if (n == rank)
 208             {
 209               /* Break out of the look.  */
 210               base = NULL;
 211               break;
 212             }
 213           else
 214             {
 215               count[n]++;
 216               base += sstride[n];
 217               dest += dstride[n];
 218             }
 219         }
 220     }
 221 }
 222
 223 #endif