libgfortran/generated/in_pack_i4.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 Libgfor is free software; you can redistribute it and/or
   8 modify it under the terms of the GNU Lesser General Public
   9 License as published by the Free Software Foundation; either
  10 version 2.1 of the License, or (at your option) any later version.
  11
  12 Ligbfor 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 Lesser General Public License for more details.
  16
  17 You should have received a copy of the GNU Lesser General Public
  18 License along with libgfortran; see the file COPYING.LIB.  If not,
  19 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  20 Boston, MA 02111-1307, USA.  */
  21
  22 #include "config.h"
  23 #include <stdlib.h>
  24 #include <assert.h>
  25 #include "libgfortran.h"
  26
  27
  28 /* Allocates a block of memory with internal_malloc if the array needs
  29    repacking.  */
  30
  31 GFC_INTEGER_4 *
  32 internal_pack_4 (gfc_array_i4 * source)
  33 {
  34   index_type count[GFC_MAX_DIMENSIONS - 1];
  35   index_type extent[GFC_MAX_DIMENSIONS - 1];
  36   index_type stride[GFC_MAX_DIMENSIONS - 1];
  37   index_type stride0;
  38   index_type dim;
  39   index_type ssize;
  40   const GFC_INTEGER_4 *src;
  41   GFC_INTEGER_4 *dest;
  42   GFC_INTEGER_4 *destptr;
  43   int n;
  44   int packed;
  45
  46   if (source->dim[0].stride == 0)
  47     {
  48       source->dim[0].stride = 1;
  49       return source->data;
  50     }
  51
  52   dim = GFC_DESCRIPTOR_RANK (source);
  53   ssize = 1;
  54   packed = 1;
  55   for (n = 0; n < dim; n++)
  56     {
  57       count[n] = 0;
  58       stride[n] = source->dim[n].stride;
  59       extent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
  60       if (extent[n] <= 0)
  61         {
  62           /* Do nothing.  */
  63           packed = 1;
  64           break;
  65         }
  66
  67       if (ssize != stride[n])
  68         packed = 0;
  69
  70       ssize *= extent[n];
  71     }
  72
  73   if (packed)
  74     return source->data;
  75
  76   /* Allocate storage for the destination.  */
  77   destptr = (GFC_INTEGER_4 *)internal_malloc_size (ssize * 4);
  78   dest = destptr;
  79   src = source->data;
  80   stride0 = stride[0];
  81
  82
  83   while (src)
  84     {
  85       /* Copy the data.  */
  86       *(dest++) = *src;
  87       /* Advance to the next element.  */
  88       src += stride0;
  89       count[0]++;
  90       /* Advance to the next source element.  */
  91       n = 0;
  92       while (count[n] == extent[n])
  93         {
  94           /* When we get to the end of a dimension, reset it and increment
  95              the next dimension.  */
  96           count[n] = 0;
  97           /* We could precalculate these products, but this is a less
  98              frequently used path so proabably not worth it.  */
  99           src -= stride[n] * extent[n];
 100           n++;
 101           if (n == dim)
 102             {
 103               src = NULL;
 104               break;
 105             }
 106           else
 107             {
 108               count[n]++;
 109               src += stride[n];
 110             }
 111         }
 112     }
 113   return destptr;
 114 }
 115