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

/* Implementation of the MAXLOC intrinsic
   Copyright (C) 2002-2023 Free Software Foundation, Inc.
   Contributed by Paul Brook <paul@nowt.org>

This file is part of the GNU Fortran 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 3 of the License, or (at your option) any later version.

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.

Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.

You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
<http://www.gnu.org/licenses/>.  */

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


#if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_INTEGER_4)

#define HAVE_BACK_ARG 1


extern void maxloc1_4_r16 (gfc_array_i4 * const restrict, 
	gfc_array_r16 * const restrict, const index_type * const restrict, GFC_LOGICAL_4 back);
export_proto(maxloc1_4_r16);

void
maxloc1_4_r16 (gfc_array_i4 * const restrict retarray, 
	gfc_array_r16 * const restrict array, 
	const index_type * const restrict pdim, GFC_LOGICAL_4 back)
{
  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_REAL_16 * restrict base;
  GFC_INTEGER_4 * restrict dest;
  index_type rank;
  index_type n;
  index_type len;
  index_type delta;
  index_type dim;
  int continue_loop;

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

  if (unlikely (dim < 0 || dim > rank))
    {
      runtime_error ("Dim argument incorrect in MAXLOC intrinsic: "
 		     "is %ld, should be between 1 and %ld",
		     (long int) dim + 1, (long int) rank + 1);
    }

  len = GFC_DESCRIPTOR_EXTENT(array,dim);
  if (len < 0)
    len = 0;
  delta = GFC_DESCRIPTOR_STRIDE(array,dim);

  for (n = 0; n < dim; n++)
    {
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
      extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);

      if (extent[n] < 0)
	extent[n] = 0;
    }
  for (n = dim; n < rank; n++)
    {
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array, n + 1);
      extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);

      if (extent[n] < 0)
	extent[n] = 0;
    }

  if (retarray->base_addr == NULL)
    {
      size_t alloc_size, str;

      for (n = 0; n < rank; n++)
	{
	  if (n == 0)
	    str = 1;
	  else
	    str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];

	  GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);

	}

      retarray->offset = 0;
      retarray->dtype.rank = rank;

      alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];

      retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_4));
      if (alloc_size == 0)
	{
	  /* Make sure we have a zero-sized array.  */
	  GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
	  return;

	}
    }
  else
    {
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
	runtime_error ("rank of return array incorrect in"
		       " MAXLOC intrinsic: is %ld, should be %ld",
		       (long int) (GFC_DESCRIPTOR_RANK (retarray)),
		       (long int) rank);

      if (unlikely (compile_options.bounds_check))
	bounds_ifunction_return ((array_t *) retarray, extent,
				 "return value", "MAXLOC");
    }

  for (n = 0; n < rank; n++)
    {
      count[n] = 0;
      dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
      if (extent[n] <= 0)
	return;
    }

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

  continue_loop = 1;
  while (continue_loop)
    {
      const GFC_REAL_16 * restrict src;
      GFC_INTEGER_4 result;
      src = base;
      {

	GFC_REAL_16 maxval;
#if defined (GFC_REAL_16_INFINITY)
	maxval = -GFC_REAL_16_INFINITY;
#else
	maxval = -GFC_REAL_16_HUGE;
#endif
	result = 1;
	if (len <= 0)
	  *dest = 0;
	else
	  {
#if ! defined HAVE_BACK_ARG
	    for (n = 0; n < len; n++, src += delta)
	      {
#endif

#if defined (GFC_REAL_16_QUIET_NAN)
     	     for (n = 0; n < len; n++, src += delta)
	       {
		if (*src >= maxval)
		  {
		    maxval = *src;
		    result = (GFC_INTEGER_4)n + 1;
		    break;
		  }
	      }
#else
	    n = 0;
#endif
	    for (; n < len; n++, src += delta)
	      {
		if (back ? *src >= maxval : *src > maxval)
		  {
		    maxval = *src;
		    result = (GFC_INTEGER_4)n + 1;
		  }
	      }
	    
	    *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 probably not worth it.  */
	  base -= sstride[n] * extent[n];
	  dest -= dstride[n] * extent[n];
	  n++;
	  if (n >= rank)
	    {
	      /* Break out of the loop.  */
	      continue_loop = 0;
	      break;
	    }
	  else
	    {
	      count[n]++;
	      base += sstride[n];
	      dest += dstride[n];
	    }
	}
    }
}


extern void mmaxloc1_4_r16 (gfc_array_i4 * const restrict, 
	gfc_array_r16 * const restrict, const index_type * const restrict,
	gfc_array_l1 * const restrict, GFC_LOGICAL_4 back);
export_proto(mmaxloc1_4_r16);

void
mmaxloc1_4_r16 (gfc_array_i4 * const restrict retarray, 
	gfc_array_r16 * const restrict array, 
	const index_type * const restrict pdim, 
	gfc_array_l1 * const restrict mask, GFC_LOGICAL_4 back)
{
  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_4 * restrict dest;
  const GFC_REAL_16 * restrict base;
  const GFC_LOGICAL_1 * restrict mbase;
  index_type rank;
  index_type dim;
  index_type n;
  index_type len;
  index_type delta;
  index_type mdelta;
  int mask_kind;

  if (mask == NULL)
    {
#ifdef HAVE_BACK_ARG
      maxloc1_4_r16 (retarray, array, pdim, back);
#else
      maxloc1_4_r16 (retarray, array, pdim);
#endif
      return;
    }

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


  if (unlikely (dim < 0 || dim > rank))
    {
      runtime_error ("Dim argument incorrect in MAXLOC intrinsic: "
 		     "is %ld, should be between 1 and %ld",
		     (long int) dim + 1, (long int) rank + 1);
    }

  len = GFC_DESCRIPTOR_EXTENT(array,dim);
  if (len <= 0)
    return;

  mbase = mask->base_addr;

  mask_kind = GFC_DESCRIPTOR_SIZE (mask);

  if (mask_kind == 1 || mask_kind == 2 || mask_kind == 4 || mask_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
      || mask_kind == 16
#endif
      )
    mbase = GFOR_POINTER_TO_L1 (mbase, mask_kind);
  else
    runtime_error ("Funny sized logical array");

  delta = GFC_DESCRIPTOR_STRIDE(array,dim);
  mdelta = GFC_DESCRIPTOR_STRIDE_BYTES(mask,dim);

  for (n = 0; n < dim; n++)
    {
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
      mstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(mask,n);
      extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);

      if (extent[n] < 0)
	extent[n] = 0;

    }
  for (n = dim; n < rank; n++)
    {
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n + 1);
      mstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(mask, n + 1);
      extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);

      if (extent[n] < 0)
	extent[n] = 0;
    }

  if (retarray->base_addr == NULL)
    {
      size_t alloc_size, str;

      for (n = 0; n < rank; n++)
	{
	  if (n == 0)
	    str = 1;
	  else
	    str= GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];

	  GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);

	}

      alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];

      retarray->offset = 0;
      retarray->dtype.rank = rank;

      retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_4));
      if (alloc_size == 0)
	{
	  /* Make sure we have a zero-sized array.  */
	  GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
	  return;
	}
    }
  else
    {
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
	runtime_error ("rank of return array incorrect in MAXLOC intrinsic");

      if (unlikely (compile_options.bounds_check))
	{
	  bounds_ifunction_return ((array_t *) retarray, extent,
				   "return value", "MAXLOC");
	  bounds_equal_extents ((array_t *) mask, (array_t *) array,
	  			"MASK argument", "MAXLOC");
	}
    }

  for (n = 0; n < rank; n++)
    {
      count[n] = 0;
      dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
      if (extent[n] <= 0)
	return;
    }

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

  while (base)
    {
      const GFC_REAL_16 * restrict src;
      const GFC_LOGICAL_1 * restrict msrc;
      GFC_INTEGER_4 result;
      src = base;
      msrc = mbase;
      {

	GFC_REAL_16 maxval;
#if defined (GFC_REAL_16_INFINITY)
	maxval = -GFC_REAL_16_INFINITY;
#else
	maxval = -GFC_REAL_16_HUGE;
#endif
#if defined (GFC_REAL_16_QUIET_NAN)
	GFC_INTEGER_4 result2 = 0;
#endif
	result = 0;
	for (n = 0; n < len; n++, src += delta, msrc += mdelta)
	  {

		if (*msrc)
		  {
#if defined (GFC_REAL_16_QUIET_NAN)
		    if (!result2)
		      result2 = (GFC_INTEGER_4)n + 1;
		    if (*src >= maxval)
#endif
		      {
			maxval = *src;
			result = (GFC_INTEGER_4)n + 1;
			break;
		      }
		  }
	      }
#if defined (GFC_REAL_16_QUIET_NAN)
	    if (unlikely (n >= len))
	      result = result2;
	    else
#endif
	    if (back)
	      for (; n < len; n++, src += delta, msrc += mdelta)
	      	{
		  if (*msrc && unlikely (*src >= maxval))
		    {
		      maxval = *src;
		      result = (GFC_INTEGER_4)n + 1;
		    }
		}
	    else
	      for (; n < len; n++, src += delta, msrc += mdelta)
	        {
		  if (*msrc && unlikely (*src > maxval))
		    {
		      maxval = *src;
		      result = (GFC_INTEGER_4)n + 1;
		    }
	  }
	*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 probably 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 loop.  */
	      base = NULL;
	      break;
	    }
	  else
	    {
	      count[n]++;
	      base += sstride[n];
	      mbase += mstride[n];
	      dest += dstride[n];
	    }
	}
    }
}


extern void smaxloc1_4_r16 (gfc_array_i4 * const restrict, 
	gfc_array_r16 * const restrict, const index_type * const restrict,
	GFC_LOGICAL_4 *, GFC_LOGICAL_4 back);
export_proto(smaxloc1_4_r16);

void
smaxloc1_4_r16 (gfc_array_i4 * const restrict retarray, 
	gfc_array_r16 * const restrict array, 
	const index_type * const restrict pdim, 
	GFC_LOGICAL_4 * mask, GFC_LOGICAL_4 back)
{
  index_type count[GFC_MAX_DIMENSIONS];
  index_type extent[GFC_MAX_DIMENSIONS];
  index_type dstride[GFC_MAX_DIMENSIONS];
  GFC_INTEGER_4 * restrict dest;
  index_type rank;
  index_type n;
  index_type dim;


  if (mask == NULL || *mask)
    {
#ifdef HAVE_BACK_ARG
      maxloc1_4_r16 (retarray, array, pdim, back);
#else
      maxloc1_4_r16 (retarray, array, pdim);
#endif
      return;
    }
  /* Make dim zero based to avoid confusion.  */
  dim = (*pdim) - 1;
  rank = GFC_DESCRIPTOR_RANK (array) - 1;

  if (unlikely (dim < 0 || dim > rank))
    {
      runtime_error ("Dim argument incorrect in MAXLOC intrinsic: "
 		     "is %ld, should be between 1 and %ld",
		     (long int) dim + 1, (long int) rank + 1);
    }

  for (n = 0; n < dim; n++)
    {
      extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);

      if (extent[n] <= 0)
	extent[n] = 0;
    }

  for (n = dim; n < rank; n++)
    {
      extent[n] =
	GFC_DESCRIPTOR_EXTENT(array,n + 1);

      if (extent[n] <= 0)
	extent[n] = 0;
    }

  if (retarray->base_addr == NULL)
    {
      size_t alloc_size, str;

      for (n = 0; n < rank; n++)
	{
	  if (n == 0)
	    str = 1;
	  else
	    str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];

	  GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);

	}

      retarray->offset = 0;
      retarray->dtype.rank = rank;

      alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];

      retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_4));
      if (alloc_size == 0)
	{
	  /* Make sure we have a zero-sized array.  */
	  GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
	  return;
	}
    }
  else
    {
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
	runtime_error ("rank of return array incorrect in"
		       " MAXLOC intrinsic: is %ld, should be %ld",
		       (long int) (GFC_DESCRIPTOR_RANK (retarray)),
		       (long int) rank);

      if (unlikely (compile_options.bounds_check))
	{
	  for (n=0; n < rank; n++)
	    {
	      index_type ret_extent;

	      ret_extent = GFC_DESCRIPTOR_EXTENT(retarray,n);
	      if (extent[n] != ret_extent)
		runtime_error ("Incorrect extent in return value of"
			       " MAXLOC intrinsic in dimension %ld:"
			       " is %ld, should be %ld", (long int) n + 1,
			       (long int) ret_extent, (long int) extent[n]);
	    }
	}
    }

  for (n = 0; n < rank; n++)
    {
      count[n] = 0;
      dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
    }

  dest = retarray->base_addr;

  while(1)
    {
      *dest = 0;
      count[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 probably not worth it.  */
	  dest -= dstride[n] * extent[n];
	  n++;
	  if (n >= rank)
	    return;
	  else
	    {
	      count[n]++;
	      dest += dstride[n];
	    }
      	}
    }
}

#endif
Commit	Line	Data
644cb69f	1	/* Implementation of the MAXLOC intrinsic
83ffe9cd	2	Copyright (C) 2002-2023 Free Software Foundation, Inc.
644cb69f FXC	3	Contributed by Paul Brook <paul@nowt.org>
644cb69f FXC	4
0cd0559e	5	This file is part of the GNU Fortran runtime library (libgfortran).
644cb69f FXC	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
748086b7	10	version 3 of the License, or (at your option) any later version.
644cb69f FXC	11
	12	Libgfortran 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 General Public License for more details.
	16
748086b7 JJ	17	Under Section 7 of GPL version 3, you are granted additional
	18	permissions described in the GCC Runtime Library Exception, version
	19	3.1, as published by the Free Software Foundation.
	20
	21	You should have received a copy of the GNU General Public License and
	22	a copy of the GCC Runtime Library Exception along with this program;
	23	see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
	24	<http://www.gnu.org/licenses/>. */
644cb69f	25
36ae8a61	26	#include "libgfortran.h"
64b1806b	27	#include <assert.h>
644cb69f FXC	28
	29
	30	#if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_INTEGER_4)
	31
64b1806b TK	32	#define HAVE_BACK_ARG 1
64b1806b TK	33
644cb69f	34
64acfd99	35	extern void maxloc1_4_r16 (gfc_array_i4 * const restrict,
64b1806b	36	gfc_array_r16 * const restrict, const index_type * const restrict, GFC_LOGICAL_4 back);
644cb69f FXC	37	export_proto(maxloc1_4_r16);
	38
	39	void
64acfd99 JB	40	maxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
64acfd99 JB	41	gfc_array_r16 * const restrict array,
64b1806b	42	const index_type * const restrict pdim, GFC_LOGICAL_4 back)
644cb69f FXC	43	{
	44	index_type count[GFC_MAX_DIMENSIONS];
	45	index_type extent[GFC_MAX_DIMENSIONS];
	46	index_type sstride[GFC_MAX_DIMENSIONS];
	47	index_type dstride[GFC_MAX_DIMENSIONS];
64acfd99 JB	48	const GFC_REAL_16 * restrict base;
64acfd99 JB	49	GFC_INTEGER_4 * restrict dest;
644cb69f FXC	50	index_type rank;
	51	index_type n;
	52	index_type len;
	53	index_type delta;
	54	index_type dim;
da96f5ab	55	int continue_loop;
644cb69f FXC	56
644cb69f FXC	57	/* Make dim zero based to avoid confusion. */
644cb69f	58	rank = GFC_DESCRIPTOR_RANK (array) - 1;
cfdf6ff6 TK	59	dim = (*pdim) - 1;
	60
	61	if (unlikely (dim < 0 \|\| dim > rank))
	62	{
	63	runtime_error ("Dim argument incorrect in MAXLOC intrinsic: "
	64	"is %ld, should be between 1 and %ld",
	65	(long int) dim + 1, (long int) rank + 1);
	66	}
644cb69f	67
dfb55fdc	68	len = GFC_DESCRIPTOR_EXTENT(array,dim);
da96f5ab TK	69	if (len < 0)
da96f5ab TK	70	len = 0;
dfb55fdc	71	delta = GFC_DESCRIPTOR_STRIDE(array,dim);
644cb69f FXC	72
	73	for (n = 0; n < dim; n++)
	74	{
dfb55fdc TK	75	sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
dfb55fdc TK	76	extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
80ee04b9 TK	77
	78	if (extent[n] < 0)
	79	extent[n] = 0;
644cb69f FXC	80	}
	81	for (n = dim; n < rank; n++)
	82	{
dfb55fdc TK	83	sstride[n] = GFC_DESCRIPTOR_STRIDE(array, n + 1);
dfb55fdc TK	84	extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);
80ee04b9 TK	85
	86	if (extent[n] < 0)
	87	extent[n] = 0;
644cb69f FXC	88	}
644cb69f FXC	89
21d1335b	90	if (retarray->base_addr == NULL)
644cb69f	91	{
dfb55fdc	92	size_t alloc_size, str;
80ee04b9	93
644cb69f	94	for (n = 0; n < rank; n++)
80927a56 JJ	95	{
80927a56 JJ	96	if (n == 0)
dfb55fdc	97	str = 1;
80927a56 JJ	98	else
80927a56 JJ	99	str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
dfb55fdc TK	100
	101	GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
	102
80927a56	103	}
644cb69f	104
644cb69f	105	retarray->offset = 0;
ca708a2b	106	retarray->dtype.rank = rank;
80ee04b9	107
92e6f3a4	108	alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];
80ee04b9	109
92e6f3a4	110	retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_4));
80ee04b9 TK	111	if (alloc_size == 0)
	112	{
	113	/* Make sure we have a zero-sized array. */
dfb55fdc	114	GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
80ee04b9	115	return;
dfb55fdc	116
80ee04b9	117	}
644cb69f FXC	118	}
	119	else
	120	{
644cb69f	121	if (rank != GFC_DESCRIPTOR_RANK (retarray))
fd6590f8	122	runtime_error ("rank of return array incorrect in"
ccacefc7 TK	123	" MAXLOC intrinsic: is %ld, should be %ld",
	124	(long int) (GFC_DESCRIPTOR_RANK (retarray)),
	125	(long int) rank);
fd6590f8	126
9731c4a3	127	if (unlikely (compile_options.bounds_check))
16bff921 TK	128	bounds_ifunction_return ((array_t *) retarray, extent,
16bff921 TK	129	"return value", "MAXLOC");
644cb69f FXC	130	}
	131
	132	for (n = 0; n < rank; n++)
	133	{
	134	count[n] = 0;
dfb55fdc	135	dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
644cb69f	136	if (extent[n] <= 0)
facc1285	137	return;
644cb69f FXC	138	}
644cb69f FXC	139
21d1335b TB	140	base = array->base_addr;
21d1335b TB	141	dest = retarray->base_addr;
644cb69f	142
da96f5ab TK	143	continue_loop = 1;
da96f5ab TK	144	while (continue_loop)
644cb69f	145	{
64acfd99	146	const GFC_REAL_16 * restrict src;
644cb69f FXC	147	GFC_INTEGER_4 result;
	148	src = base;
	149	{
	150
80927a56 JJ	151	GFC_REAL_16 maxval;
	152	#if defined (GFC_REAL_16_INFINITY)
	153	maxval = -GFC_REAL_16_INFINITY;
	154	#else
	155	maxval = -GFC_REAL_16_HUGE;
	156	#endif
	157	result = 1;
	158	if (len <= 0)
644cb69f FXC	159	*dest = 0;
	160	else
	161	{
b573f931	162	#if ! defined HAVE_BACK_ARG
644cb69f FXC	163	for (n = 0; n < len; n++, src += delta)
644cb69f FXC	164	{
b573f931	165	#endif
644cb69f	166
80927a56	167	#if defined (GFC_REAL_16_QUIET_NAN)
b573f931 TK	168	for (n = 0; n < len; n++, src += delta)
b573f931 TK	169	{
80927a56 JJ	170	if (*src >= maxval)
	171	{
	172	maxval = *src;
	173	result = (GFC_INTEGER_4)n + 1;
	174	break;
	175	}
	176	}
b573f931 TK	177	#else
	178	n = 0;
	179	#endif
80927a56 JJ	180	for (; n < len; n++, src += delta)
80927a56 JJ	181	{
b573f931	182	if (back ? src >= maxval : src > maxval)
80927a56 JJ	183	{
	184	maxval = *src;
	185	result = (GFC_INTEGER_4)n + 1;
	186	}
	187	}
0cd0559e	188
644cb69f FXC	189	*dest = result;
	190	}
	191	}
	192	/* Advance to the next element. */
	193	count[0]++;
	194	base += sstride[0];
	195	dest += dstride[0];
	196	n = 0;
	197	while (count[n] == extent[n])
80927a56 JJ	198	{
	199	/* When we get to the end of a dimension, reset it and increment
	200	the next dimension. */
	201	count[n] = 0;
	202	/* We could precalculate these products, but this is a less
	203	frequently used path so probably not worth it. */
	204	base -= sstride[n] * extent[n];
	205	dest -= dstride[n] * extent[n];
	206	n++;
80dd631f	207	if (n >= rank)
80927a56	208	{
80dd631f	209	/* Break out of the loop. */
da96f5ab TK	210	continue_loop = 0;
da96f5ab TK	211	break;
80927a56 JJ	212	}
	213	else
	214	{
	215	count[n]++;
	216	base += sstride[n];
	217	dest += dstride[n];
	218	}
	219	}
644cb69f FXC	220	}
	221	}
	222
	223
64acfd99 JB	224	extern void mmaxloc1_4_r16 (gfc_array_i4 * const restrict,
64acfd99 JB	225	gfc_array_r16 * const restrict, const index_type * const restrict,
64b1806b	226	gfc_array_l1 * const restrict, GFC_LOGICAL_4 back);
644cb69f FXC	227	export_proto(mmaxloc1_4_r16);
	228
	229	void
64acfd99 JB	230	mmaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
	231	gfc_array_r16 * const restrict array,
	232	const index_type * const restrict pdim,
64b1806b	233	gfc_array_l1 * const restrict mask, GFC_LOGICAL_4 back)
644cb69f FXC	234	{
	235	index_type count[GFC_MAX_DIMENSIONS];
	236	index_type extent[GFC_MAX_DIMENSIONS];
	237	index_type sstride[GFC_MAX_DIMENSIONS];
	238	index_type dstride[GFC_MAX_DIMENSIONS];
	239	index_type mstride[GFC_MAX_DIMENSIONS];
64acfd99 JB	240	GFC_INTEGER_4 * restrict dest;
64acfd99 JB	241	const GFC_REAL_16 * restrict base;
28dc6b33	242	const GFC_LOGICAL_1 * restrict mbase;
cfdf6ff6 TK	243	index_type rank;
cfdf6ff6 TK	244	index_type dim;
644cb69f FXC	245	index_type n;
	246	index_type len;
	247	index_type delta;
	248	index_type mdelta;
28dc6b33	249	int mask_kind;
644cb69f	250
2ea47ee9 TK	251	if (mask == NULL)
	252	{
	253	#ifdef HAVE_BACK_ARG
	254	maxloc1_4_r16 (retarray, array, pdim, back);
	255	#else
	256	maxloc1_4_r16 (retarray, array, pdim);
	257	#endif
	258	return;
	259	}
	260
644cb69f FXC	261	dim = (*pdim) - 1;
	262	rank = GFC_DESCRIPTOR_RANK (array) - 1;
	263
cfdf6ff6 TK	264
	265	if (unlikely (dim < 0 \|\| dim > rank))
	266	{
	267	runtime_error ("Dim argument incorrect in MAXLOC intrinsic: "
	268	"is %ld, should be between 1 and %ld",
	269	(long int) dim + 1, (long int) rank + 1);
	270	}
	271
dfb55fdc	272	len = GFC_DESCRIPTOR_EXTENT(array,dim);
644cb69f FXC	273	if (len <= 0)
644cb69f FXC	274	return;
28dc6b33	275
21d1335b	276	mbase = mask->base_addr;
28dc6b33 TK	277
	278	mask_kind = GFC_DESCRIPTOR_SIZE (mask);
	279
	280	if (mask_kind == 1 \|\| mask_kind == 2 \|\| mask_kind == 4 \|\| mask_kind == 8
	281	#ifdef HAVE_GFC_LOGICAL_16
	282	\|\| mask_kind == 16
	283	#endif
	284	)
	285	mbase = GFOR_POINTER_TO_L1 (mbase, mask_kind);
	286	else
	287	runtime_error ("Funny sized logical array");
	288
dfb55fdc TK	289	delta = GFC_DESCRIPTOR_STRIDE(array,dim);
dfb55fdc TK	290	mdelta = GFC_DESCRIPTOR_STRIDE_BYTES(mask,dim);
644cb69f FXC	291
	292	for (n = 0; n < dim; n++)
	293	{
dfb55fdc TK	294	sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
	295	mstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(mask,n);
	296	extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
80ee04b9 TK	297
	298	if (extent[n] < 0)
	299	extent[n] = 0;
	300
644cb69f FXC	301	}
	302	for (n = dim; n < rank; n++)
	303	{
dfb55fdc TK	304	sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n + 1);
	305	mstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(mask, n + 1);
	306	extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);
80ee04b9 TK	307
	308	if (extent[n] < 0)
	309	extent[n] = 0;
644cb69f FXC	310	}
644cb69f FXC	311
21d1335b	312	if (retarray->base_addr == NULL)
644cb69f	313	{
dfb55fdc	314	size_t alloc_size, str;
80ee04b9	315
644cb69f	316	for (n = 0; n < rank; n++)
80927a56 JJ	317	{
	318	if (n == 0)
	319	str = 1;
	320	else
	321	str= GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
dfb55fdc TK	322
	323	GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
	324
80927a56	325	}
644cb69f	326
92e6f3a4	327	alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];
80ee04b9	328
644cb69f	329	retarray->offset = 0;
ca708a2b	330	retarray->dtype.rank = rank;
80ee04b9	331
d56bf419	332	retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_4));
80ee04b9 TK	333	if (alloc_size == 0)
	334	{
	335	/* Make sure we have a zero-sized array. */
dfb55fdc	336	GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
80ee04b9 TK	337	return;
80ee04b9 TK	338	}
644cb69f FXC	339	}
	340	else
	341	{
644cb69f	342	if (rank != GFC_DESCRIPTOR_RANK (retarray))
fd6590f8 TK	343	runtime_error ("rank of return array incorrect in MAXLOC intrinsic");
fd6590f8 TK	344
9731c4a3	345	if (unlikely (compile_options.bounds_check))
fd6590f8	346	{
16bff921 TK	347	bounds_ifunction_return ((array_t *) retarray, extent,
	348	"return value", "MAXLOC");
	349	bounds_equal_extents ((array_t ) mask, (array_t ) array,
	350	"MASK argument", "MAXLOC");
fd6590f8	351	}
644cb69f FXC	352	}
	353
	354	for (n = 0; n < rank; n++)
	355	{
	356	count[n] = 0;
dfb55fdc	357	dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
644cb69f	358	if (extent[n] <= 0)
80927a56	359	return;
644cb69f FXC	360	}
644cb69f FXC	361
21d1335b TB	362	dest = retarray->base_addr;
21d1335b TB	363	base = array->base_addr;
644cb69f FXC	364
	365	while (base)
	366	{
64acfd99	367	const GFC_REAL_16 * restrict src;
28dc6b33	368	const GFC_LOGICAL_1 * restrict msrc;
644cb69f FXC	369	GFC_INTEGER_4 result;
	370	src = base;
	371	msrc = mbase;
	372	{
	373
80927a56 JJ	374	GFC_REAL_16 maxval;
	375	#if defined (GFC_REAL_16_INFINITY)
	376	maxval = -GFC_REAL_16_INFINITY;
	377	#else
	378	maxval = -GFC_REAL_16_HUGE;
	379	#endif
	380	#if defined (GFC_REAL_16_QUIET_NAN)
	381	GFC_INTEGER_4 result2 = 0;
	382	#endif
	383	result = 0;
036e1775	384	for (n = 0; n < len; n++, src += delta, msrc += mdelta)
644cb69f	385	{
644cb69f	386
80927a56 JJ	387	if (*msrc)
	388	{
	389	#if defined (GFC_REAL_16_QUIET_NAN)
	390	if (!result2)
	391	result2 = (GFC_INTEGER_4)n + 1;
	392	if (*src >= maxval)
	393	#endif
	394	{
	395	maxval = *src;
	396	result = (GFC_INTEGER_4)n + 1;
	397	break;
	398	}
	399	}
	400	}
	401	#if defined (GFC_REAL_16_QUIET_NAN)
	402	if (unlikely (n >= len))
	403	result = result2;
	404	else
	405	#endif
b573f931 TK	406	if (back)
	407	for (; n < len; n++, src += delta, msrc += mdelta)
	408	{
	409	if (msrc && unlikely (src >= maxval))
	410	{
	411	maxval = *src;
	412	result = (GFC_INTEGER_4)n + 1;
	413	}
	414	}
	415	else
	416	for (; n < len; n++, src += delta, msrc += mdelta)
	417	{
	418	if (msrc && unlikely (src > maxval))
	419	{
	420	maxval = *src;
	421	result = (GFC_INTEGER_4)n + 1;
	422	}
644cb69f	423	}
036e1775	424	*dest = result;
644cb69f FXC	425	}
	426	/* Advance to the next element. */
	427	count[0]++;
	428	base += sstride[0];
	429	mbase += mstride[0];
	430	dest += dstride[0];
	431	n = 0;
	432	while (count[n] == extent[n])
80927a56 JJ	433	{
	434	/* When we get to the end of a dimension, reset it and increment
	435	the next dimension. */
	436	count[n] = 0;
	437	/* We could precalculate these products, but this is a less
	438	frequently used path so probably not worth it. */
	439	base -= sstride[n] * extent[n];
	440	mbase -= mstride[n] * extent[n];
	441	dest -= dstride[n] * extent[n];
	442	n++;
80dd631f	443	if (n >= rank)
80927a56	444	{
80dd631f	445	/* Break out of the loop. */
80927a56 JJ	446	base = NULL;
	447	break;
	448	}
	449	else
	450	{
	451	count[n]++;
	452	base += sstride[n];
	453	mbase += mstride[n];
	454	dest += dstride[n];
	455	}
	456	}
644cb69f FXC	457	}
	458	}
	459
97a62038 TK	460
	461	extern void smaxloc1_4_r16 (gfc_array_i4 * const restrict,
	462	gfc_array_r16 * const restrict, const index_type * const restrict,
64b1806b	463	GFC_LOGICAL_4 *, GFC_LOGICAL_4 back);
97a62038 TK	464	export_proto(smaxloc1_4_r16);
	465
	466	void
	467	smaxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
	468	gfc_array_r16 * const restrict array,
	469	const index_type * const restrict pdim,
64b1806b	470	GFC_LOGICAL_4 * mask, GFC_LOGICAL_4 back)
97a62038	471	{
802367d7 TK	472	index_type count[GFC_MAX_DIMENSIONS];
802367d7 TK	473	index_type extent[GFC_MAX_DIMENSIONS];
802367d7 TK	474	index_type dstride[GFC_MAX_DIMENSIONS];
802367d7 TK	475	GFC_INTEGER_4 * restrict dest;
97a62038 TK	476	index_type rank;
97a62038 TK	477	index_type n;
802367d7 TK	478	index_type dim;
802367d7 TK	479
97a62038	480
2ea47ee9	481	if (mask == NULL \|\| *mask)
97a62038	482	{
64b1806b TK	483	#ifdef HAVE_BACK_ARG
	484	maxloc1_4_r16 (retarray, array, pdim, back);
	485	#else
97a62038	486	maxloc1_4_r16 (retarray, array, pdim);
64b1806b	487	#endif
97a62038 TK	488	return;
97a62038 TK	489	}
802367d7 TK	490	/* Make dim zero based to avoid confusion. */
	491	dim = (*pdim) - 1;
	492	rank = GFC_DESCRIPTOR_RANK (array) - 1;
	493
cfdf6ff6 TK	494	if (unlikely (dim < 0 \|\| dim > rank))
	495	{
	496	runtime_error ("Dim argument incorrect in MAXLOC intrinsic: "
	497	"is %ld, should be between 1 and %ld",
	498	(long int) dim + 1, (long int) rank + 1);
	499	}
	500
802367d7 TK	501	for (n = 0; n < dim; n++)
802367d7 TK	502	{
dfb55fdc	503	extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
802367d7 TK	504
	505	if (extent[n] <= 0)
	506	extent[n] = 0;
	507	}
	508
	509	for (n = dim; n < rank; n++)
	510	{
802367d7	511	extent[n] =
80927a56	512	GFC_DESCRIPTOR_EXTENT(array,n + 1);
802367d7 TK	513
802367d7 TK	514	if (extent[n] <= 0)
80927a56	515	extent[n] = 0;
802367d7	516	}
97a62038	517
21d1335b	518	if (retarray->base_addr == NULL)
97a62038	519	{
dfb55fdc	520	size_t alloc_size, str;
802367d7 TK	521
802367d7 TK	522	for (n = 0; n < rank; n++)
80927a56 JJ	523	{
	524	if (n == 0)
	525	str = 1;
	526	else
	527	str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
dfb55fdc TK	528
	529	GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
	530
80927a56	531	}
802367d7	532
97a62038	533	retarray->offset = 0;
ca708a2b	534	retarray->dtype.rank = rank;
802367d7	535
92e6f3a4	536	alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];
802367d7	537
d56bf419	538	retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_4));
802367d7 TK	539	if (alloc_size == 0)
	540	{
	541	/* Make sure we have a zero-sized array. */
dfb55fdc	542	GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
802367d7 TK	543	return;
802367d7 TK	544	}
97a62038 TK	545	}
	546	else
	547	{
802367d7 TK	548	if (rank != GFC_DESCRIPTOR_RANK (retarray))
	549	runtime_error ("rank of return array incorrect in"
	550	" MAXLOC intrinsic: is %ld, should be %ld",
	551	(long int) (GFC_DESCRIPTOR_RANK (retarray)),
	552	(long int) rank);
	553
9731c4a3	554	if (unlikely (compile_options.bounds_check))
fd6590f8	555	{
802367d7 TK	556	for (n=0; n < rank; n++)
	557	{
	558	index_type ret_extent;
97a62038	559
dfb55fdc	560	ret_extent = GFC_DESCRIPTOR_EXTENT(retarray,n);
802367d7 TK	561	if (extent[n] != ret_extent)
	562	runtime_error ("Incorrect extent in return value of"
	563	" MAXLOC intrinsic in dimension %ld:"
	564	" is %ld, should be %ld", (long int) n + 1,
	565	(long int) ret_extent, (long int) extent[n]);
	566	}
fd6590f8 TK	567	}
fd6590f8 TK	568	}
97a62038	569
802367d7 TK	570	for (n = 0; n < rank; n++)
	571	{
	572	count[n] = 0;
dfb55fdc	573	dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
802367d7 TK	574	}
802367d7 TK	575
21d1335b	576	dest = retarray->base_addr;
802367d7 TK	577
	578	while(1)
	579	{
	580	*dest = 0;
	581	count[0]++;
	582	dest += dstride[0];
	583	n = 0;
	584	while (count[n] == extent[n])
80927a56	585	{
802367d7	586	/* When we get to the end of a dimension, reset it and increment
80927a56 JJ	587	the next dimension. */
	588	count[n] = 0;
	589	/* We could precalculate these products, but this is a less
	590	frequently used path so probably not worth it. */
	591	dest -= dstride[n] * extent[n];
	592	n++;
80dd631f	593	if (n >= rank)
802367d7	594	return;
80927a56 JJ	595	else
	596	{
	597	count[n]++;
	598	dest += dstride[n];
	599	}
802367d7 TK	600	}
802367d7 TK	601	}
97a62038 TK	602	}
97a62038 TK	603
644cb69f	604	#endif