libgfortran/generated/all_l8.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_8) && defined (HAVE_GFC_LOGICAL_8)
  37
  38
  39 extern void all_l8 (gfc_array_l8 * const restrict,
  40         gfc_array_l8 * const restrict, const index_type * const restrict);
  41 export_proto(all_l8);
  42
  43 void
  44 all_l8 (gfc_array_l8 * const restrict retarray,
  45         gfc_array_l8 * 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_8 * restrict base;
  53   GFC_LOGICAL_8 * restrict dest;
  54   index_type rank;
  55   index_type n;
  56   index_type len;
  57   index_type delta;
  58   index_type dim;
  59
  60   /* Make dim zero based to avoid confusion.  */
  61   dim = (*pdim) - 1;
  62   rank = GFC_DESCRIPTOR_RANK (array) - 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       if (extent[n] < 0)
  73         extent[n] = 0;
  74     }
  75   for (n = dim; n < rank; n++)
  76     {
  77       sstride[n] = array->dim[n + 1].stride;
  78       extent[n] =
  79         array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
  80
  81       if (extent[n] < 0)
  82         extent[n] = 0;
  83     }
  84
  85   if (retarray->data == NULL)
  86     {
  87       size_t alloc_size;
  88
  89       for (n = 0; n < rank; n++)
  90         {
  91           retarray->dim[n].lbound = 0;
  92           retarray->dim[n].ubound = extent[n]-1;
  93           if (n == 0)
  94             retarray->dim[n].stride = 1;
  95           else
  96             retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
  97         }
  98
  99       retarray->offset = 0;
 100       retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
 101
 102       alloc_size = sizeof (GFC_LOGICAL_8) * retarray->dim[rank-1].stride
 103                    * extent[rank-1];
 104
 105       if (alloc_size == 0)
 106         {
 107           /* Make sure we have a zero-sized array.  */
 108           retarray->dim[0].lbound = 0;
 109           retarray->dim[0].ubound = -1;
 110           return;
 111         }
 112       else
 113         retarray->data = internal_malloc_size (alloc_size);
 114     }
 115   else
 116     {
 117       if (rank != GFC_DESCRIPTOR_RANK (retarray))
 118         runtime_error ("rank of return array incorrect");
 119     }
 120
 121   for (n = 0; n < rank; n++)
 122     {
 123       count[n] = 0;
 124       dstride[n] = retarray->dim[n].stride;
 125       if (extent[n] <= 0)
 126         len = 0;
 127     }
 128
 129   base = array->data;
 130   dest = retarray->data;
 131
 132   while (base)
 133     {
 134       const GFC_LOGICAL_8 * restrict src;
 135       GFC_LOGICAL_8 result;
 136       src = base;
 137       {
 138
 139   /* Return true only if all the elements are set.  */
 140   result = 1;
 141         if (len <= 0)
 142           *dest = 1;
 143         else
 144           {
 145             for (n = 0; n < len; n++, src += delta)
 146               {
 147
 148   if (! *src)
 149     {
 150       result = 0;
 151       break;
 152     }
 153           }
 154             *dest = result;
 155           }
 156       }
 157       /* Advance to the next element.  */
 158       count[0]++;
 159       base += sstride[0];
 160       dest += dstride[0];
 161       n = 0;
 162       while (count[n] == extent[n])
 163         {
 164           /* When we get to the end of a dimension, reset it and increment
 165              the next dimension.  */
 166           count[n] = 0;
 167           /* We could precalculate these products, but this is a less
 168              frequently used path so probably not worth it.  */
 169           base -= sstride[n] * extent[n];
 170           dest -= dstride[n] * extent[n];
 171           n++;
 172           if (n == rank)
 173             {
 174               /* Break out of the look.  */
 175               base = NULL;
 176               break;
 177             }
 178           else
 179             {
 180               count[n]++;
 181               base += sstride[n];
 182               dest += dstride[n];
 183             }
 184         }
 185     }
 186 }
 187
 188 #endif