libgfortran/generated/all_l4.c

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