1 files changed, 0 insertions, 123 deletions
diff --git a/libgfortran/generated/in_pack_c4.c b/libgfortran/generated/in_pack_c4.c
deleted file mode 100644
index ed3b8ec6ef6..00000000000
--- a/libgfortran/generated/in_pack_c4.c
+++ /dev/null
@@ -1,123 +0,0 @@
-/* Helper function for repacking arrays.
-   Copyright 2003 Free Software Foundation, Inc.
-   Contributed by Paul Brook <paul@nowt.org>
-
-This file is part of the GNU Fortran 95 runtime library (libgfortran).
-
-Libgfortran is free software; you can redistribute it and/or
-modify it under the terms of the GNU General Public
-License as published by the Free Software Foundation; either
-version 2 of the License, or (at your option) any later version.
-
-In addition to the permissions in the GNU General Public License, the
-Free Software Foundation gives you unlimited permission to link the
-compiled version of this file into combinations with other programs,
-and to distribute those combinations without any restriction coming
-from the use of this file.  (The General Public License restrictions
-do apply in other respects; for example, they cover modification of
-the file, and distribution when not linked into a combine
-executable.)
-
-Libgfortran is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-GNU General Public License for more details.
-
-You should have received a copy of the GNU General Public
-License along with libgfortran; see the file COPYING.  If not,
-write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-Boston, MA 02111-1307, USA.  */
-
-#include "config.h"
-#include <stdlib.h>
-#include <assert.h>
-#include "libgfortran.h"
-
-/* Allocates a block of memory with internal_malloc if the array needs
-   repacking.  */
-
-GFC_COMPLEX_4 *
-internal_pack_c4 (gfc_array_c4 * source)
-{
-  index_type count[GFC_MAX_DIMENSIONS];
-  index_type extent[GFC_MAX_DIMENSIONS];
-  index_type stride[GFC_MAX_DIMENSIONS];
-  index_type stride0;
-  index_type dim;
-  index_type ssize;
-  const GFC_COMPLEX_4 *src;
-  GFC_COMPLEX_4 *dest;
-  GFC_COMPLEX_4 *destptr;
-  int n;
-  int packed;
-
-  if (source->dim[0].stride == 0)
-    {
-      source->dim[0].stride = 1;
-      return source->data;
-    }
-
-  dim = GFC_DESCRIPTOR_RANK (source);
-  ssize = 1;
-  packed = 1;
-  for (n = 0; n < dim; n++)
-    {
-      count[n] = 0;
-      stride[n] = source->dim[n].stride;
-      extent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
-      if (extent[n] <= 0)
-        {
-          /* Do nothing.  */
-          packed = 1;
-          break;
-        }
-
-      if (ssize != stride[n])
-        packed = 0;
-
-      ssize *= extent[n];
-    }
-
-  if (packed)
-    return source->data;
-
-  /* Allocate storage for the destination.  */
-  destptr = (GFC_COMPLEX_4 *)internal_malloc_size (ssize * sizeof (GFC_COMPLEX_4));
-  dest = destptr;
-  src = source->data;
-  stride0 = stride[0];
-
-
-  while (src)
-    {
-      /* Copy the data.  */
-      *(dest++) = *src;
-      /* Advance to the next element.  */
-      src += stride0;
-      count[0]++;
-      /* Advance to the next source element.  */
-      n = 0;
-      while (count[n] == extent[n])
-        {
-          /* When we get to the end of a dimension, reset it and increment
-             the next dimension.  */
-          count[n] = 0;
-          /* We could precalculate these products, but this is a less
-             frequently used path so proabably not worth it.  */
-          src -= stride[n] * extent[n];
-          n++;
-          if (n == dim)
-            {
-              src = NULL;
-              break;
-            }
-          else
-            {
-              count[n]++;
-              src += stride[n];
-            }
-        }
-    }
-  return destptr;
-}
-