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

/* Implementation of the PRODUCT intrinsic
   Copyright 2002 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 "config.h"
#include <stdlib.h>
#include <assert.h>
#include "libgfortran.h"


#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_8)


extern void product_i8 (gfc_array_i8 * const restrict, 
	gfc_array_i8 * const restrict, const index_type * const restrict);
export_proto(product_i8);

void
product_i8 (gfc_array_i8 * const restrict retarray, 
	gfc_array_i8 * const restrict array, 
	const index_type * const restrict pdim)
{
  index_type count[GFC_MAX_DIMENSIONS];
  index_type extent[GFC_MAX_DIMENSIONS];
  index_type sstride[GFC_MAX_DIMENSIONS];
  index_type dstride[GFC_MAX_DIMENSIONS];
  const GFC_INTEGER_8 * restrict base;
  GFC_INTEGER_8 * restrict dest;
  index_type rank;
  index_type n;
  index_type len;
  index_type delta;
  index_type dim;

  /* Make dim zero based to avoid confusion.  */
  dim = (*pdim) - 1;
  rank = GFC_DESCRIPTOR_RANK (array) - 1;

  /* TODO:  It should be a front end job to correctly set the strides.  */

  if (array->dim[0].stride == 0)
    array->dim[0].stride = 1;

  len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  delta = array->dim[dim].stride;

  for (n = 0; n < dim; n++)
    {
      sstride[n] = array->dim[n].stride;
      extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
    }
  for (n = dim; n < rank; n++)
    {
      sstride[n] = array->dim[n + 1].stride;
      extent[n] =
        array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
    }

  if (retarray->data == NULL)
    {
      for (n = 0; n < rank; n++)
        {
          retarray->dim[n].lbound = 0;
          retarray->dim[n].ubound = extent[n]-1;
          if (n == 0)
            retarray->dim[n].stride = 1;
          else
            retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
        }

      retarray->data
	 = internal_malloc_size (sizeof (GFC_INTEGER_8)
		 		 * retarray->dim[rank-1].stride
				 * extent[rank-1]);
      retarray->offset = 0;
      retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
    }
  else
    {
      if (retarray->dim[0].stride == 0)
	retarray->dim[0].stride = 1;

      if (rank != GFC_DESCRIPTOR_RANK (retarray))
	runtime_error ("rank of return array incorrect");
    }

  for (n = 0; n < rank; n++)
    {
      count[n] = 0;
      dstride[n] = retarray->dim[n].stride;
      if (extent[n] <= 0)
        len = 0;
    }

  base = array->data;
  dest = retarray->data;

  while (base)
    {
      const GFC_INTEGER_8 * restrict src;
      GFC_INTEGER_8 result;
      src = base;
      {

  result = 1;
        if (len <= 0)
	  *dest = 1;
	else
	  {
	    for (n = 0; n < len; n++, src += delta)
	      {

  result *= *src;
          }
	    *dest = result;
	  }
      }
      /* Advance to the next element.  */
      count[0]++;
      base += sstride[0];
      dest += dstride[0];
      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.  */
          base -= sstride[n] * extent[n];
          dest -= dstride[n] * extent[n];
          n++;
          if (n == rank)
            {
              /* Break out of the look.  */
              base = NULL;
              break;
            }
          else
            {
              count[n]++;
              base += sstride[n];
              dest += dstride[n];
            }
        }
    }
}


extern void mproduct_i8 (gfc_array_i8 * const restrict, 
	gfc_array_i8 * const restrict, const index_type * const restrict,
	gfc_array_l4 * const restrict);
export_proto(mproduct_i8);

void
mproduct_i8 (gfc_array_i8 * const restrict retarray, 
	gfc_array_i8 * const restrict array, 
	const index_type * const restrict pdim, 
	gfc_array_l4 * const restrict mask)
{
  index_type count[GFC_MAX_DIMENSIONS];
  index_type extent[GFC_MAX_DIMENSIONS];
  index_type sstride[GFC_MAX_DIMENSIONS];
  index_type dstride[GFC_MAX_DIMENSIONS];
  index_type mstride[GFC_MAX_DIMENSIONS];
  GFC_INTEGER_8 * restrict dest;
  const GFC_INTEGER_8 * restrict base;
  const GFC_LOGICAL_4 * restrict mbase;
  int rank;
  int dim;
  index_type n;
  index_type len;
  index_type delta;
  index_type mdelta;

  dim = (*pdim) - 1;
  rank = GFC_DESCRIPTOR_RANK (array) - 1;

  /* TODO:  It should be a front end job to correctly set the strides.  */

  if (array->dim[0].stride == 0)
    array->dim[0].stride = 1;

  if (mask->dim[0].stride == 0)
    mask->dim[0].stride = 1;

  len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
  if (len <= 0)
    return;
  delta = array->dim[dim].stride;
  mdelta = mask->dim[dim].stride;

  for (n = 0; n < dim; n++)
    {
      sstride[n] = array->dim[n].stride;
      mstride[n] = mask->dim[n].stride;
      extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
    }
  for (n = dim; n < rank; n++)
    {
      sstride[n] = array->dim[n + 1].stride;
      mstride[n] = mask->dim[n + 1].stride;
      extent[n] =
        array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
    }

  if (retarray->data == NULL)
    {
      for (n = 0; n < rank; n++)
        {
          retarray->dim[n].lbound = 0;
          retarray->dim[n].ubound = extent[n]-1;
          if (n == 0)
            retarray->dim[n].stride = 1;
          else
            retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
        }

      retarray->data
	 = internal_malloc_size (sizeof (GFC_INTEGER_8)
		 		 * retarray->dim[rank-1].stride
				 * extent[rank-1]);
      retarray->offset = 0;
      retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
    }
  else
    {
      if (retarray->dim[0].stride == 0)
	retarray->dim[0].stride = 1;

      if (rank != GFC_DESCRIPTOR_RANK (retarray))
	runtime_error ("rank of return array incorrect");
    }

  for (n = 0; n < rank; n++)
    {
      count[n] = 0;
      dstride[n] = retarray->dim[n].stride;
      if (extent[n] <= 0)
        return;
    }

  dest = retarray->data;
  base = array->data;
  mbase = mask->data;

  if (GFC_DESCRIPTOR_SIZE (mask) != 4)
    {
      /* This allows the same loop to be used for all logical types.  */
      assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
      for (n = 0; n < rank; n++)
        mstride[n] <<= 1;
      mdelta <<= 1;
      mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
    }

  while (base)
    {
      const GFC_INTEGER_8 * restrict src;
      const GFC_LOGICAL_4 * restrict msrc;
      GFC_INTEGER_8 result;
      src = base;
      msrc = mbase;
      {

  result = 1;
        if (len <= 0)
	  *dest = 1;
	else
	  {
	    for (n = 0; n < len; n++, src += delta, msrc += mdelta)
	      {

  if (*msrc)
    result *= *src;
              }
	    *dest = result;
	  }
      }
      /* Advance to the next element.  */
      count[0]++;
      base += sstride[0];
      mbase += mstride[0];
      dest += dstride[0];
      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.  */
          base -= sstride[n] * extent[n];
          mbase -= mstride[n] * extent[n];
          dest -= dstride[n] * extent[n];
          n++;
          if (n == rank)
            {
              /* Break out of the look.  */
              base = NULL;
              break;
            }
          else
            {
              count[n]++;
              base += sstride[n];
              mbase += mstride[n];
              dest += dstride[n];
            }
        }
    }
}

#endif
Commit	Line	Data
6de9cd9a DN	1	/* Implementation of the PRODUCT intrinsic
	2	Copyright 2002 Free Software Foundation, Inc.
	3	Contributed by Paul Brook <paul@nowt.org>
	4
57dea9f6	5	This file is part of the GNU Fortran 95 runtime library (libgfortran).
6de9cd9a DN	6
6de9cd9a DN	7	Libgfortran is free software; you can redistribute it and/or
57dea9f6	8	modify it under the terms of the GNU General Public
6de9cd9a	9	License as published by the Free Software Foundation; either
57dea9f6 TM	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.)
6de9cd9a DN	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
57dea9f6	24	GNU General Public License for more details.
6de9cd9a	25
57dea9f6 TM	26	You should have received a copy of the GNU General Public
57dea9f6 TM	27	License along with libgfortran; see the file COPYING. If not,
fe2ae685 KC	28	write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
fe2ae685 KC	29	Boston, MA 02110-1301, USA. */
6de9cd9a DN	30
	31	#include "config.h"
	32	#include <stdlib.h>
	33	#include <assert.h>
	34	#include "libgfortran.h"
	35
7d7b8bfe	36
644cb69f FXC	37	#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_8)
	38
	39
64acfd99 JB	40	extern void product_i8 (gfc_array_i8 * const restrict,
64acfd99 JB	41	gfc_array_i8 * const restrict, const index_type * const restrict);
7f68c75f	42	export_proto(product_i8);
7d7b8bfe	43
6de9cd9a	44	void
64acfd99 JB	45	product_i8 (gfc_array_i8 * const restrict retarray,
	46	gfc_array_i8 * const restrict array,
	47	const index_type * const restrict pdim)
6de9cd9a	48	{
e33e218b TK	49	index_type count[GFC_MAX_DIMENSIONS];
	50	index_type extent[GFC_MAX_DIMENSIONS];
	51	index_type sstride[GFC_MAX_DIMENSIONS];
	52	index_type dstride[GFC_MAX_DIMENSIONS];
64acfd99 JB	53	const GFC_INTEGER_8 * restrict base;
64acfd99 JB	54	GFC_INTEGER_8 * restrict dest;
6de9cd9a DN	55	index_type rank;
	56	index_type n;
	57	index_type len;
	58	index_type delta;
	59	index_type dim;
	60
	61	/* Make dim zero based to avoid confusion. */
	62	dim = (*pdim) - 1;
	63	rank = GFC_DESCRIPTOR_RANK (array) - 1;
e33e218b TK	64
	65	/* TODO: It should be a front end job to correctly set the strides. */
	66
6de9cd9a DN	67	if (array->dim[0].stride == 0)
6de9cd9a DN	68	array->dim[0].stride = 1;
6de9cd9a DN	69
	70	len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
	71	delta = array->dim[dim].stride;
	72
	73	for (n = 0; n < dim; n++)
	74	{
	75	sstride[n] = array->dim[n].stride;
	76	extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
	77	}
	78	for (n = dim; n < rank; n++)
	79	{
	80	sstride[n] = array->dim[n + 1].stride;
	81	extent[n] =
	82	array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
	83	}
	84
6c167c45 VL	85	if (retarray->data == NULL)
	86	{
	87	for (n = 0; n < rank; n++)
	88	{
	89	retarray->dim[n].lbound = 0;
	90	retarray->dim[n].ubound = extent[n]-1;
	91	if (n == 0)
	92	retarray->dim[n].stride = 1;
	93	else
	94	retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
	95	}
	96
07d3cebe RH	97	retarray->data
	98	= internal_malloc_size (sizeof (GFC_INTEGER_8)
	99	* retarray->dim[rank-1].stride
	100	* extent[rank-1]);
efd4dc1a	101	retarray->offset = 0;
50dd63a9	102	retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) \| rank;
6c167c45	103	}
50dd63a9 TK	104	else
	105	{
	106	if (retarray->dim[0].stride == 0)
	107	retarray->dim[0].stride = 1;
	108
	109	if (rank != GFC_DESCRIPTOR_RANK (retarray))
	110	runtime_error ("rank of return array incorrect");
	111	}
	112
6de9cd9a DN	113	for (n = 0; n < rank; n++)
	114	{
	115	count[n] = 0;
	116	dstride[n] = retarray->dim[n].stride;
	117	if (extent[n] <= 0)
	118	len = 0;
	119	}
	120
	121	base = array->data;
	122	dest = retarray->data;
	123
	124	while (base)
	125	{
64acfd99	126	const GFC_INTEGER_8 * restrict src;
6de9cd9a DN	127	GFC_INTEGER_8 result;
	128	src = base;
	129	{
	130
	131	result = 1;
	132	if (len <= 0)
	133	*dest = 1;
	134	else
	135	{
	136	for (n = 0; n < len; n++, src += delta)
	137	{
	138
	139	result = src;
	140	}
	141	*dest = result;
	142	}
	143	}
	144	/* Advance to the next element. */
	145	count[0]++;
	146	base += sstride[0];
	147	dest += dstride[0];
	148	n = 0;
	149	while (count[n] == extent[n])
	150	{
	151	/* When we get to the end of a dimension, reset it and increment
	152	the next dimension. */
	153	count[n] = 0;
	154	/* We could precalculate these products, but this is a less
	155	frequently used path so proabably not worth it. */
	156	base -= sstride[n] * extent[n];
	157	dest -= dstride[n] * extent[n];
	158	n++;
	159	if (n == rank)
	160	{
	161	/* Break out of the look. */
	162	base = NULL;
	163	break;
	164	}
	165	else
	166	{
	167	count[n]++;
	168	base += sstride[n];
	169	dest += dstride[n];
	170	}
	171	}
	172	}
	173	}
	174
7d7b8bfe	175
64acfd99 JB	176	extern void mproduct_i8 (gfc_array_i8 * const restrict,
	177	gfc_array_i8 * const restrict, const index_type * const restrict,
	178	gfc_array_l4 * const restrict);
7f68c75f	179	export_proto(mproduct_i8);
7d7b8bfe	180
6de9cd9a	181	void
64acfd99 JB	182	mproduct_i8 (gfc_array_i8 * const restrict retarray,
	183	gfc_array_i8 * const restrict array,
	184	const index_type * const restrict pdim,
	185	gfc_array_l4 * const restrict mask)
6de9cd9a	186	{
e33e218b TK	187	index_type count[GFC_MAX_DIMENSIONS];
	188	index_type extent[GFC_MAX_DIMENSIONS];
	189	index_type sstride[GFC_MAX_DIMENSIONS];
	190	index_type dstride[GFC_MAX_DIMENSIONS];
	191	index_type mstride[GFC_MAX_DIMENSIONS];
64acfd99 JB	192	GFC_INTEGER_8 * restrict dest;
	193	const GFC_INTEGER_8 * restrict base;
	194	const GFC_LOGICAL_4 * restrict mbase;
6de9cd9a DN	195	int rank;
	196	int dim;
	197	index_type n;
	198	index_type len;
	199	index_type delta;
	200	index_type mdelta;
	201
	202	dim = (*pdim) - 1;
	203	rank = GFC_DESCRIPTOR_RANK (array) - 1;
e33e218b TK	204
	205	/* TODO: It should be a front end job to correctly set the strides. */
	206
6de9cd9a DN	207	if (array->dim[0].stride == 0)
6de9cd9a DN	208	array->dim[0].stride = 1;
6de9cd9a	209
c6abe94d TK	210	if (mask->dim[0].stride == 0)
	211	mask->dim[0].stride = 1;
	212
6de9cd9a DN	213	len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
	214	if (len <= 0)
	215	return;
	216	delta = array->dim[dim].stride;
	217	mdelta = mask->dim[dim].stride;
	218
	219	for (n = 0; n < dim; n++)
	220	{
	221	sstride[n] = array->dim[n].stride;
	222	mstride[n] = mask->dim[n].stride;
	223	extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
	224	}
	225	for (n = dim; n < rank; n++)
	226	{
	227	sstride[n] = array->dim[n + 1].stride;
	228	mstride[n] = mask->dim[n + 1].stride;
	229	extent[n] =
	230	array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
	231	}
	232
50dd63a9 TK	233	if (retarray->data == NULL)
	234	{
	235	for (n = 0; n < rank; n++)
	236	{
	237	retarray->dim[n].lbound = 0;
	238	retarray->dim[n].ubound = extent[n]-1;
	239	if (n == 0)
	240	retarray->dim[n].stride = 1;
	241	else
	242	retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
	243	}
	244
	245	retarray->data
	246	= internal_malloc_size (sizeof (GFC_INTEGER_8)
	247	* retarray->dim[rank-1].stride
	248	* extent[rank-1]);
efd4dc1a	249	retarray->offset = 0;
50dd63a9 TK	250	retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) \| rank;
	251	}
	252	else
	253	{
	254	if (retarray->dim[0].stride == 0)
	255	retarray->dim[0].stride = 1;
	256
	257	if (rank != GFC_DESCRIPTOR_RANK (retarray))
	258	runtime_error ("rank of return array incorrect");
	259	}
	260
6de9cd9a DN	261	for (n = 0; n < rank; n++)
	262	{
	263	count[n] = 0;
	264	dstride[n] = retarray->dim[n].stride;
	265	if (extent[n] <= 0)
	266	return;
	267	}
	268
	269	dest = retarray->data;
	270	base = array->data;
	271	mbase = mask->data;
	272
	273	if (GFC_DESCRIPTOR_SIZE (mask) != 4)
	274	{
	275	/* This allows the same loop to be used for all logical types. */
	276	assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
	277	for (n = 0; n < rank; n++)
	278	mstride[n] <<= 1;
	279	mdelta <<= 1;
	280	mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
	281	}
	282
	283	while (base)
	284	{
64acfd99 JB	285	const GFC_INTEGER_8 * restrict src;
64acfd99 JB	286	const GFC_LOGICAL_4 * restrict msrc;
6de9cd9a DN	287	GFC_INTEGER_8 result;
	288	src = base;
	289	msrc = mbase;
	290	{
	291
	292	result = 1;
	293	if (len <= 0)
	294	*dest = 1;
	295	else
	296	{
	297	for (n = 0; n < len; n++, src += delta, msrc += mdelta)
	298	{
	299
	300	if (*msrc)
	301	result = src;
	302	}
	303	*dest = result;
	304	}
	305	}
	306	/* Advance to the next element. */
	307	count[0]++;
	308	base += sstride[0];
	309	mbase += mstride[0];
	310	dest += dstride[0];
	311	n = 0;
	312	while (count[n] == extent[n])
	313	{
	314	/* When we get to the end of a dimension, reset it and increment
	315	the next dimension. */
	316	count[n] = 0;
	317	/* We could precalculate these products, but this is a less
	318	frequently used path so proabably not worth it. */
	319	base -= sstride[n] * extent[n];
	320	mbase -= mstride[n] * extent[n];
	321	dest -= dstride[n] * extent[n];
	322	n++;
	323	if (n == rank)
	324	{
	325	/* Break out of the look. */
	326	base = NULL;
	327	break;
	328	}
	329	else
	330	{
	331	count[n]++;
	332	base += sstride[n];
	333	mbase += mstride[n];
	334	dest += dstride[n];
	335	}
	336	}
	337	}
	338	}
	339
644cb69f	340	#endif