[thirdparty/gcc.git] / libgfortran / generated / reshape_r8.c

/* Implementation of the RESHAPE
   Copyright 2002, 2006, 2007 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., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.  */

#include "libgfortran.h"
#include <stdlib.h>
#include <assert.h>


#if defined (HAVE_GFC_REAL_8)

typedef GFC_ARRAY_DESCRIPTOR(1, index_type) shape_type;


extern void reshape_r8 (gfc_array_r8 * const restrict, 
	gfc_array_r8 * const restrict, 
	shape_type * const restrict,
	gfc_array_r8 * const restrict, 
	shape_type * const restrict);
export_proto(reshape_r8);

void
reshape_r8 (gfc_array_r8 * const restrict ret, 
	gfc_array_r8 * const restrict source, 
	shape_type * const restrict shape,
	gfc_array_r8 * const restrict pad, 
	shape_type * const restrict order)
{
  /* r.* indicates the return array.  */
  index_type rcount[GFC_MAX_DIMENSIONS];
  index_type rextent[GFC_MAX_DIMENSIONS];
  index_type rstride[GFC_MAX_DIMENSIONS];
  index_type rstride0;
  index_type rdim;
  index_type rsize;
  index_type rs;
  index_type rex;
  GFC_REAL_8 *rptr;
  /* s.* indicates the source array.  */
  index_type scount[GFC_MAX_DIMENSIONS];
  index_type sextent[GFC_MAX_DIMENSIONS];
  index_type sstride[GFC_MAX_DIMENSIONS];
  index_type sstride0;
  index_type sdim;
  index_type ssize;
  const GFC_REAL_8 *sptr;
  /* p.* indicates the pad array.  */
  index_type pcount[GFC_MAX_DIMENSIONS];
  index_type pextent[GFC_MAX_DIMENSIONS];
  index_type pstride[GFC_MAX_DIMENSIONS];
  index_type pdim;
  index_type psize;
  const GFC_REAL_8 *pptr;

  const GFC_REAL_8 *src;
  int n;
  int dim;
  int sempty, pempty, shape_empty;
  index_type shape_data[GFC_MAX_DIMENSIONS];

  rdim = shape->dim[0].ubound - shape->dim[0].lbound + 1;
  if (rdim != GFC_DESCRIPTOR_RANK(ret))
    runtime_error("rank of return array incorrect in RESHAPE intrinsic");

  shape_empty = 0;

  for (n = 0; n < rdim; n++)
    {
      shape_data[n] = shape->data[n * shape->dim[0].stride];
      if (shape_data[n] <= 0)
      {
        shape_data[n] = 0;
	shape_empty = 1;
      }
    }

  if (ret->data == NULL)
    {
      rs = 1;
      for (n = 0; n < rdim; n++)
	{
	  ret->dim[n].lbound = 0;
	  rex = shape_data[n];
	  ret->dim[n].ubound =  rex - 1;
	  ret->dim[n].stride = rs;
	  rs *= rex;
	}
      ret->offset = 0;
      ret->data = internal_malloc_size ( rs * sizeof (GFC_REAL_8));
      ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
    }

  if (shape_empty)
    return;

  rsize = 1;
  for (n = 0; n < rdim; n++)
    {
      if (order)
        dim = order->data[n * order->dim[0].stride] - 1;
      else
        dim = n;

      rcount[n] = 0;
      rstride[n] = ret->dim[dim].stride;
      rextent[n] = ret->dim[dim].ubound + 1 - ret->dim[dim].lbound;
      if (rextent[n] < 0)
        rextent[n] = 0;

      if (rextent[n] != shape_data[dim])
        runtime_error ("shape and target do not conform");

      if (rsize == rstride[n])
        rsize *= rextent[n];
      else
        rsize = 0;
      if (rextent[n] <= 0)
        return;
    }

  sdim = GFC_DESCRIPTOR_RANK (source);
  ssize = 1;
  sempty = 0;
  for (n = 0; n < sdim; n++)
    {
      scount[n] = 0;
      sstride[n] = source->dim[n].stride;
      sextent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
      if (sextent[n] <= 0)
	{
	  sempty = 1;
	  sextent[n] = 0;
	}

      if (ssize == sstride[n])
        ssize *= sextent[n];
      else
        ssize = 0;
    }

  if (pad)
    {
      pdim = GFC_DESCRIPTOR_RANK (pad);
      psize = 1;
      pempty = 0;
      for (n = 0; n < pdim; n++)
        {
          pcount[n] = 0;
          pstride[n] = pad->dim[n].stride;
          pextent[n] = pad->dim[n].ubound + 1 - pad->dim[n].lbound;
          if (pextent[n] <= 0)
	    {
	      pempty = 1;
	      pextent[n] = 0;
	    }

          if (psize == pstride[n])
            psize *= pextent[n];
          else
            psize = 0;
        }
      pptr = pad->data;
    }
  else
    {
      pdim = 0;
      psize = 1;
      pempty = 1;
      pptr = NULL;
    }

  if (rsize != 0 && ssize != 0 && psize != 0)
    {
      rsize *= sizeof (GFC_REAL_8);
      ssize *= sizeof (GFC_REAL_8);
      psize *= sizeof (GFC_REAL_8);
      reshape_packed ((char *)ret->data, rsize, (char *)source->data,
		      ssize, pad ? (char *)pad->data : NULL, psize);
      return;
    }
  rptr = ret->data;
  src = sptr = source->data;
  rstride0 = rstride[0];
  sstride0 = sstride[0];

  if (sempty && pempty)
    abort ();

  if (sempty)
    {
      /* Switch immediately to the pad array.  */
      src = pptr;
      sptr = NULL;
      sdim = pdim;
      for (dim = 0; dim < pdim; dim++)
	{
	  scount[dim] = pcount[dim];
	  sextent[dim] = pextent[dim];
	  sstride[dim] = pstride[dim];
	  sstride0 = sstride[0] * sizeof (GFC_REAL_8);
	}
    }

  while (rptr)
    {
      /* Select between the source and pad arrays.  */
      *rptr = *src;
      /* Advance to the next element.  */
      rptr += rstride0;
      src += sstride0;
      rcount[0]++;
      scount[0]++;

      /* Advance to the next destination element.  */
      n = 0;
      while (rcount[n] == rextent[n])
        {
          /* When we get to the end of a dimension, reset it and increment
             the next dimension.  */
          rcount[n] = 0;
          /* We could precalculate these products, but this is a less
             frequently used path so probably not worth it.  */
          rptr -= rstride[n] * rextent[n];
          n++;
          if (n == rdim)
            {
              /* Break out of the loop.  */
              rptr = NULL;
              break;
            }
          else
            {
              rcount[n]++;
              rptr += rstride[n];
            }
        }
      /* Advance to the next source element.  */
      n = 0;
      while (scount[n] == sextent[n])
        {
          /* When we get to the end of a dimension, reset it and increment
             the next dimension.  */
          scount[n] = 0;
          /* We could precalculate these products, but this is a less
             frequently used path so probably not worth it.  */
          src -= sstride[n] * sextent[n];
          n++;
          if (n == sdim)
            {
              if (sptr && pad)
                {
                  /* Switch to the pad array.  */
                  sptr = NULL;
                  sdim = pdim;
                  for (dim = 0; dim < pdim; dim++)
                    {
                      scount[dim] = pcount[dim];
                      sextent[dim] = pextent[dim];
                      sstride[dim] = pstride[dim];
                      sstride0 = sstride[0];
                    }
                }
              /* We now start again from the beginning of the pad array.  */
              src = pptr;
              break;
            }
          else
            {
              scount[n]++;
              src += sstride[n];
            }
        }
    }
}

#endif
Commit	Line	Data
ecebfb8b	1	/* Implementation of the RESHAPE
36ae8a61	2	Copyright 2002, 2006, 2007 Free Software Foundation, Inc.
ecebfb8b FXC	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
36ae8a61	31	#include "libgfortran.h"
ecebfb8b FXC	32	#include <stdlib.h>
ecebfb8b FXC	33	#include <assert.h>
36ae8a61	34
ecebfb8b FXC	35
	36	#if defined (HAVE_GFC_REAL_8)
	37
	38	typedef GFC_ARRAY_DESCRIPTOR(1, index_type) shape_type;
	39
ecebfb8b FXC	40
	41	extern void reshape_r8 (gfc_array_r8 * const restrict,
	42	gfc_array_r8 * const restrict,
	43	shape_type * const restrict,
	44	gfc_array_r8 * const restrict,
	45	shape_type * const restrict);
	46	export_proto(reshape_r8);
	47
	48	void
	49	reshape_r8 (gfc_array_r8 * const restrict ret,
	50	gfc_array_r8 * const restrict source,
	51	shape_type * const restrict shape,
	52	gfc_array_r8 * const restrict pad,
	53	shape_type * const restrict order)
	54	{
	55	/* r.* indicates the return array. */
	56	index_type rcount[GFC_MAX_DIMENSIONS];
	57	index_type rextent[GFC_MAX_DIMENSIONS];
	58	index_type rstride[GFC_MAX_DIMENSIONS];
	59	index_type rstride0;
	60	index_type rdim;
	61	index_type rsize;
	62	index_type rs;
	63	index_type rex;
	64	GFC_REAL_8 *rptr;
	65	/* s.* indicates the source array. */
	66	index_type scount[GFC_MAX_DIMENSIONS];
	67	index_type sextent[GFC_MAX_DIMENSIONS];
	68	index_type sstride[GFC_MAX_DIMENSIONS];
	69	index_type sstride0;
	70	index_type sdim;
	71	index_type ssize;
	72	const GFC_REAL_8 *sptr;
	73	/* p.* indicates the pad array. */
	74	index_type pcount[GFC_MAX_DIMENSIONS];
	75	index_type pextent[GFC_MAX_DIMENSIONS];
	76	index_type pstride[GFC_MAX_DIMENSIONS];
	77	index_type pdim;
	78	index_type psize;
	79	const GFC_REAL_8 *pptr;
	80
	81	const GFC_REAL_8 *src;
	82	int n;
	83	int dim;
8c154b65 TK	84	int sempty, pempty, shape_empty;
	85	index_type shape_data[GFC_MAX_DIMENSIONS];
	86
	87	rdim = shape->dim[0].ubound - shape->dim[0].lbound + 1;
	88	if (rdim != GFC_DESCRIPTOR_RANK(ret))
	89	runtime_error("rank of return array incorrect in RESHAPE intrinsic");
	90
	91	shape_empty = 0;
	92
	93	for (n = 0; n < rdim; n++)
	94	{
	95	shape_data[n] = shape->data[n * shape->dim[0].stride];
	96	if (shape_data[n] <= 0)
	97	{
	98	shape_data[n] = 0;
	99	shape_empty = 1;
	100	}
	101	}
ecebfb8b FXC	102
	103	if (ret->data == NULL)
	104	{
ecebfb8b	105	rs = 1;
47c07d96	106	for (n = 0; n < rdim; n++)
ecebfb8b FXC	107	{
ecebfb8b FXC	108	ret->dim[n].lbound = 0;
8c154b65	109	rex = shape_data[n];
ecebfb8b FXC	110	ret->dim[n].ubound = rex - 1;
	111	ret->dim[n].stride = rs;
	112	rs *= rex;
	113	}
	114	ret->offset = 0;
	115	ret->data = internal_malloc_size ( rs * sizeof (GFC_REAL_8));
	116	ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) \| rdim;
	117	}
8c154b65 TK	118
	119	if (shape_empty)
	120	return;
ecebfb8b FXC	121
	122	rsize = 1;
	123	for (n = 0; n < rdim; n++)
	124	{
	125	if (order)
	126	dim = order->data[n * order->dim[0].stride] - 1;
	127	else
	128	dim = n;
	129
	130	rcount[n] = 0;
	131	rstride[n] = ret->dim[dim].stride;
	132	rextent[n] = ret->dim[dim].ubound + 1 - ret->dim[dim].lbound;
8c154b65	133	if (rextent[n] < 0)
e94471ba	134	rextent[n] = 0;
ecebfb8b	135
8c154b65	136	if (rextent[n] != shape_data[dim])
ecebfb8b FXC	137	runtime_error ("shape and target do not conform");
	138
	139	if (rsize == rstride[n])
	140	rsize *= rextent[n];
	141	else
	142	rsize = 0;
	143	if (rextent[n] <= 0)
	144	return;
	145	}
	146
	147	sdim = GFC_DESCRIPTOR_RANK (source);
	148	ssize = 1;
47c07d96	149	sempty = 0;
ecebfb8b FXC	150	for (n = 0; n < sdim; n++)
	151	{
	152	scount[n] = 0;
	153	sstride[n] = source->dim[n].stride;
	154	sextent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
	155	if (sextent[n] <= 0)
47c07d96 FXC	156	{
	157	sempty = 1;
	158	sextent[n] = 0;
	159	}
ecebfb8b FXC	160
	161	if (ssize == sstride[n])
	162	ssize *= sextent[n];
	163	else
	164	ssize = 0;
	165	}
	166
	167	if (pad)
	168	{
	169	pdim = GFC_DESCRIPTOR_RANK (pad);
	170	psize = 1;
47c07d96	171	pempty = 0;
ecebfb8b FXC	172	for (n = 0; n < pdim; n++)
	173	{
	174	pcount[n] = 0;
	175	pstride[n] = pad->dim[n].stride;
	176	pextent[n] = pad->dim[n].ubound + 1 - pad->dim[n].lbound;
	177	if (pextent[n] <= 0)
47c07d96 FXC	178	{
	179	pempty = 1;
	180	pextent[n] = 0;
	181	}
	182
ecebfb8b FXC	183	if (psize == pstride[n])
	184	psize *= pextent[n];
	185	else
	186	psize = 0;
	187	}
	188	pptr = pad->data;
	189	}
	190	else
	191	{
	192	pdim = 0;
	193	psize = 1;
47c07d96	194	pempty = 1;
ecebfb8b FXC	195	pptr = NULL;
	196	}
	197
	198	if (rsize != 0 && ssize != 0 && psize != 0)
	199	{
	200	rsize *= sizeof (GFC_REAL_8);
	201	ssize *= sizeof (GFC_REAL_8);
	202	psize *= sizeof (GFC_REAL_8);
	203	reshape_packed ((char )ret->data, rsize, (char )source->data,
	204	ssize, pad ? (char *)pad->data : NULL, psize);
	205	return;
	206	}
	207	rptr = ret->data;
	208	src = sptr = source->data;
	209	rstride0 = rstride[0];
	210	sstride0 = sstride[0];
	211
47c07d96 FXC	212	if (sempty && pempty)
	213	abort ();
	214
	215	if (sempty)
	216	{
	217	/* Switch immediately to the pad array. */
	218	src = pptr;
	219	sptr = NULL;
	220	sdim = pdim;
	221	for (dim = 0; dim < pdim; dim++)
	222	{
	223	scount[dim] = pcount[dim];
	224	sextent[dim] = pextent[dim];
	225	sstride[dim] = pstride[dim];
	226	sstride0 = sstride[0] * sizeof (GFC_REAL_8);
	227	}
	228	}
	229
ecebfb8b FXC	230	while (rptr)
	231	{
	232	/* Select between the source and pad arrays. */
	233	rptr = src;
	234	/* Advance to the next element. */
	235	rptr += rstride0;
	236	src += sstride0;
	237	rcount[0]++;
	238	scount[0]++;
47c07d96	239
ecebfb8b FXC	240	/* Advance to the next destination element. */
	241	n = 0;
	242	while (rcount[n] == rextent[n])
	243	{
	244	/* When we get to the end of a dimension, reset it and increment
	245	the next dimension. */
	246	rcount[n] = 0;
	247	/* We could precalculate these products, but this is a less
5d7adf7a	248	frequently used path so probably not worth it. */
ecebfb8b FXC	249	rptr -= rstride[n] * rextent[n];
	250	n++;
	251	if (n == rdim)
	252	{
	253	/* Break out of the loop. */
	254	rptr = NULL;
	255	break;
	256	}
	257	else
	258	{
	259	rcount[n]++;
	260	rptr += rstride[n];
	261	}
	262	}
	263	/* Advance to the next source element. */
	264	n = 0;
	265	while (scount[n] == sextent[n])
	266	{
	267	/* When we get to the end of a dimension, reset it and increment
	268	the next dimension. */
	269	scount[n] = 0;
	270	/* We could precalculate these products, but this is a less
5d7adf7a	271	frequently used path so probably not worth it. */
ecebfb8b FXC	272	src -= sstride[n] * sextent[n];
	273	n++;
	274	if (n == sdim)
	275	{
	276	if (sptr && pad)
	277	{
	278	/* Switch to the pad array. */
	279	sptr = NULL;
	280	sdim = pdim;
	281	for (dim = 0; dim < pdim; dim++)
	282	{
	283	scount[dim] = pcount[dim];
	284	sextent[dim] = pextent[dim];
	285	sstride[dim] = pstride[dim];
	286	sstride0 = sstride[0];
	287	}
	288	}
	289	/* We now start again from the beginning of the pad array. */
	290	src = pptr;
	291	break;
	292	}
	293	else
	294	{
	295	scount[n]++;
	296	src += sstride[n];
	297	}
	298	}
	299	}
	300	}
	301
	302	#endif