old-autovect-branch/libgfortran/generated/in_pack_c16.c

   1 /* Helper function for repacking arrays.
   2    Copyright 2003 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 #if defined (HAVE_GFC_COMPLEX_16)
  37
  38 /* Allocates a block of memory with internal_malloc if the array needs
  39    repacking.  */
  40
  41 GFC_COMPLEX_16 *
  42 internal_pack_c16 (gfc_array_c16 * source)
  43 {
  44   index_type count[GFC_MAX_DIMENSIONS];
  45   index_type extent[GFC_MAX_DIMENSIONS];
  46   index_type stride[GFC_MAX_DIMENSIONS];
  47   index_type stride0;
  48   index_type dim;
  49   index_type ssize;
  50   const GFC_COMPLEX_16 *src;
  51   GFC_COMPLEX_16 *dest;
  52   GFC_COMPLEX_16 *destptr;
  53   int n;
  54   int packed;
  55
  56   if (source->dim[0].stride == 0)
  57     {
  58       source->dim[0].stride = 1;
  59       return source->data;
  60     }
  61
  62   dim = GFC_DESCRIPTOR_RANK (source);
  63   ssize = 1;
  64   packed = 1;
  65   for (n = 0; n < dim; n++)
  66     {
  67       count[n] = 0;
  68       stride[n] = source->dim[n].stride;
  69       extent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
  70       if (extent[n] <= 0)
  71         {
  72           /* Do nothing.  */
  73           packed = 1;
  74           break;
  75         }
  76
  77       if (ssize != stride[n])
  78         packed = 0;
  79
  80       ssize *= extent[n];
  81     }
  82
  83   if (packed)
  84     return source->data;
  85
  86   /* Allocate storage for the destination.  */
  87   destptr = (GFC_COMPLEX_16 *)internal_malloc_size (ssize * sizeof (GFC_COMPLEX_16));
  88   dest = destptr;
  89   src = source->data;
  90   stride0 = stride[0];
  91
  92
  93   while (src)
  94     {
  95       /* Copy the data.  */
  96       *(dest++) = *src;
  97       /* Advance to the next element.  */
  98       src += stride0;
  99       count[0]++;
 100       /* Advance to the next source element.  */
 101       n = 0;
 102       while (count[n] == extent[n])
 103         {
 104           /* When we get to the end of a dimension, reset it and increment
 105              the next dimension.  */
 106           count[n] = 0;
 107           /* We could precalculate these products, but this is a less
 108              frequently used path so proabably not worth it.  */
 109           src -= stride[n] * extent[n];
 110           n++;
 111           if (n == dim)
 112             {
 113               src = NULL;
 114               break;
 115             }
 116           else
 117             {
 118               count[n]++;
 119               src += stride[n];
 120             }
 121         }
 122     }
 123   return destptr;
 124 }
 125
 126 #endif