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

/* Implementation of the MINLOC intrinsic
   Copyright (C) 2002-2018 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_16)

#define HAVE_BACK_ARG 1


extern void minloc1_16_r16 (gfc_array_i16 * const restrict, 
	gfc_array_r16 * const restrict, const index_type * const restrict, GFC_LOGICAL_4 back);
export_proto(minloc1_16_r16);

void
minloc1_16_r16 (gfc_array_i16 * 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_16 * 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 MINLOC 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_16));
      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"
		       " MINLOC 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", "MINLOC");
    }

  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_16 result;
      src = base;
      {

	GFC_REAL_16 minval;
#if defined (GFC_REAL_16_INFINITY)
	minval = GFC_REAL_16_INFINITY;
#else
	minval = 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 <= minval)
		  {
		    minval = *src;
		    result = (GFC_INTEGER_16)n + 1;
		    break;
		  }
	      }
#else
	    n = 0;
#endif
	    if (back)
	      for (; n < len; n++, src += delta)
	        {
		  if (unlikely (*src <= minval))
		    {
		      minval = *src;
		      result = (GFC_INTEGER_16)n + 1;
		    }
		}
	    else
	      for (; n < len; n++, src += delta)
	        {
		  if (unlikely (*src < minval))
		    {
		      minval = *src;
		      result = (GFC_INTEGER_16) 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 mminloc1_16_r16 (gfc_array_i16 * const restrict, 
	gfc_array_r16 * const restrict, const index_type * const restrict,
	gfc_array_l1 * const restrict, GFC_LOGICAL_4 back);
export_proto(mminloc1_16_r16);

void
mminloc1_16_r16 (gfc_array_i16 * 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_16 * 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;

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


  if (unlikely (dim < 0 || dim > rank))
    {
      runtime_error ("Dim argument incorrect in MINLOC 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;

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

    }
  else
    {
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
	runtime_error ("rank of return array incorrect in MINLOC intrinsic");

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

  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_16 result;
      src = base;
      msrc = mbase;
      {

	GFC_REAL_16 minval;
#if defined (GFC_REAL_16_INFINITY)
	minval = GFC_REAL_16_INFINITY;
#else
	minval = GFC_REAL_16_HUGE;
#endif
#if defined (GFC_REAL_16_QUIET_NAN)
	GFC_INTEGER_16 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_16)n + 1;
		    if (*src <= minval)
#endif
		      {
			minval = *src;
			result = (GFC_INTEGER_16)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 <= minval))
		    {
		      minval = *src;
		      result = (GFC_INTEGER_16)n + 1;
		    }
		}
	      else
	        for (; n < len; n++, src += delta, msrc += mdelta)
		  {
		    if (*msrc && unlikely (*src < minval))
		      {
		        minval = *src;
			result = (GFC_INTEGER_16) 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 sminloc1_16_r16 (gfc_array_i16 * const restrict, 
	gfc_array_r16 * const restrict, const index_type * const restrict,
	GFC_LOGICAL_4 *, GFC_LOGICAL_4 back);
export_proto(sminloc1_16_r16);

void
sminloc1_16_r16 (gfc_array_i16 * 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_16 * restrict dest;
  index_type rank;
  index_type n;
  index_type dim;


  if (*mask)
    {
#ifdef HAVE_BACK_ARG
      minloc1_16_r16 (retarray, array, pdim, back);
#else
      minloc1_16_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 MINLOC 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];

      if (alloc_size == 0)
	{
	  /* Make sure we have a zero-sized array.  */
	  GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
	  return;
	}
      else
	retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_16));
    }
  else
    {
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
	runtime_error ("rank of return array incorrect in"
		       " MINLOC 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"
			       " MINLOC 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 MINLOC intrinsic
85ec4feb	2	Copyright (C) 2002-2018 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_16)
	31
64b1806b TK	32	#define HAVE_BACK_ARG 1
64b1806b TK	33
644cb69f	34
64acfd99	35	extern void minloc1_16_r16 (gfc_array_i16 * const restrict,
64b1806b	36	gfc_array_r16 * const restrict, const index_type * const restrict, GFC_LOGICAL_4 back);
644cb69f FXC	37	export_proto(minloc1_16_r16);
	38
	39	void
64acfd99 JB	40	minloc1_16_r16 (gfc_array_i16 * 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_16 * 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 MINLOC 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_16));
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	" MINLOC 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", "MINLOC");
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_16 result;
	148	src = base;
	149	{
	150
80927a56 JJ	151	GFC_REAL_16 minval;
	152	#if defined (GFC_REAL_16_INFINITY)
	153	minval = GFC_REAL_16_INFINITY;
	154	#else
	155	minval = 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 <= minval)
	171	{
	172	minval = *src;
	173	result = (GFC_INTEGER_16)n + 1;
	174	break;
	175	}
	176	}
b573f931 TK	177	#else
b573f931 TK	178	n = 0;
80927a56	179	#endif
b573f931 TK	180	if (back)
	181	for (; n < len; n++, src += delta)
	182	{
	183	if (unlikely (*src <= minval))
	184	{
	185	minval = *src;
	186	result = (GFC_INTEGER_16)n + 1;
	187	}
	188	}
	189	else
	190	for (; n < len; n++, src += delta)
	191	{
	192	if (unlikely (*src < minval))
	193	{
	194	minval = *src;
	195	result = (GFC_INTEGER_16) n + 1;
	196	}
80927a56	197	}
0cd0559e	198
644cb69f FXC	199	*dest = result;
	200	}
	201	}
	202	/* Advance to the next element. */
	203	count[0]++;
	204	base += sstride[0];
	205	dest += dstride[0];
	206	n = 0;
	207	while (count[n] == extent[n])
80927a56 JJ	208	{
	209	/* When we get to the end of a dimension, reset it and increment
	210	the next dimension. */
	211	count[n] = 0;
	212	/* We could precalculate these products, but this is a less
	213	frequently used path so probably not worth it. */
	214	base -= sstride[n] * extent[n];
	215	dest -= dstride[n] * extent[n];
	216	n++;
80dd631f	217	if (n >= rank)
80927a56	218	{
80dd631f	219	/* Break out of the loop. */
da96f5ab TK	220	continue_loop = 0;
da96f5ab TK	221	break;
80927a56 JJ	222	}
	223	else
	224	{
	225	count[n]++;
	226	base += sstride[n];
	227	dest += dstride[n];
	228	}
	229	}
644cb69f FXC	230	}
	231	}
	232
	233
64acfd99 JB	234	extern void mminloc1_16_r16 (gfc_array_i16 * const restrict,
64acfd99 JB	235	gfc_array_r16 * const restrict, const index_type * const restrict,
64b1806b	236	gfc_array_l1 * const restrict, GFC_LOGICAL_4 back);
644cb69f FXC	237	export_proto(mminloc1_16_r16);
	238
	239	void
64acfd99 JB	240	mminloc1_16_r16 (gfc_array_i16 * const restrict retarray,
	241	gfc_array_r16 * const restrict array,
	242	const index_type * const restrict pdim,
64b1806b	243	gfc_array_l1 * const restrict mask, GFC_LOGICAL_4 back)
644cb69f FXC	244	{
	245	index_type count[GFC_MAX_DIMENSIONS];
	246	index_type extent[GFC_MAX_DIMENSIONS];
	247	index_type sstride[GFC_MAX_DIMENSIONS];
	248	index_type dstride[GFC_MAX_DIMENSIONS];
	249	index_type mstride[GFC_MAX_DIMENSIONS];
64acfd99 JB	250	GFC_INTEGER_16 * restrict dest;
64acfd99 JB	251	const GFC_REAL_16 * restrict base;
28dc6b33	252	const GFC_LOGICAL_1 * restrict mbase;
cfdf6ff6 TK	253	index_type rank;
cfdf6ff6 TK	254	index_type dim;
644cb69f FXC	255	index_type n;
	256	index_type len;
	257	index_type delta;
	258	index_type mdelta;
28dc6b33	259	int mask_kind;
644cb69f FXC	260
	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 MINLOC 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 TK	331
	332	if (alloc_size == 0)
	333	{
	334	/* Make sure we have a zero-sized array. */
dfb55fdc	335	GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
80ee04b9 TK	336	return;
	337	}
	338	else
92e6f3a4	339	retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_16));
80ee04b9	340
644cb69f FXC	341	}
	342	else
	343	{
644cb69f	344	if (rank != GFC_DESCRIPTOR_RANK (retarray))
fd6590f8 TK	345	runtime_error ("rank of return array incorrect in MINLOC intrinsic");
fd6590f8 TK	346
9731c4a3	347	if (unlikely (compile_options.bounds_check))
fd6590f8	348	{
16bff921 TK	349	bounds_ifunction_return ((array_t *) retarray, extent,
	350	"return value", "MINLOC");
	351	bounds_equal_extents ((array_t ) mask, (array_t ) array,
	352	"MASK argument", "MINLOC");
fd6590f8	353	}
644cb69f FXC	354	}
	355
	356	for (n = 0; n < rank; n++)
	357	{
	358	count[n] = 0;
dfb55fdc	359	dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
644cb69f	360	if (extent[n] <= 0)
80927a56	361	return;
644cb69f FXC	362	}
644cb69f FXC	363
21d1335b TB	364	dest = retarray->base_addr;
21d1335b TB	365	base = array->base_addr;
644cb69f FXC	366
	367	while (base)
	368	{
64acfd99	369	const GFC_REAL_16 * restrict src;
28dc6b33	370	const GFC_LOGICAL_1 * restrict msrc;
644cb69f FXC	371	GFC_INTEGER_16 result;
	372	src = base;
	373	msrc = mbase;
	374	{
	375
80927a56 JJ	376	GFC_REAL_16 minval;
	377	#if defined (GFC_REAL_16_INFINITY)
	378	minval = GFC_REAL_16_INFINITY;
	379	#else
	380	minval = GFC_REAL_16_HUGE;
	381	#endif
	382	#if defined (GFC_REAL_16_QUIET_NAN)
	383	GFC_INTEGER_16 result2 = 0;
	384	#endif
	385	result = 0;
036e1775	386	for (n = 0; n < len; n++, src += delta, msrc += mdelta)
644cb69f	387	{
644cb69f	388
80927a56 JJ	389	if (*msrc)
	390	{
	391	#if defined (GFC_REAL_16_QUIET_NAN)
	392	if (!result2)
	393	result2 = (GFC_INTEGER_16)n + 1;
	394	if (*src <= minval)
	395	#endif
	396	{
	397	minval = *src;
	398	result = (GFC_INTEGER_16)n + 1;
	399	break;
	400	}
	401	}
	402	}
	403	#if defined (GFC_REAL_16_QUIET_NAN)
	404	if (unlikely (n >= len))
	405	result = result2;
	406	else
	407	#endif
b573f931 TK	408	if (back)
	409	for (; n < len; n++, src += delta, msrc += mdelta)
	410	{
	411	if (msrc && unlikely (src <= minval))
	412	{
	413	minval = *src;
	414	result = (GFC_INTEGER_16)n + 1;
	415	}
	416	}
	417	else
	418	for (; n < len; n++, src += delta, msrc += mdelta)
80927a56	419	{
b573f931 TK	420	if (msrc && unlikely (src < minval))
	421	{
	422	minval = *src;
	423	result = (GFC_INTEGER_16) n + 1;
	424	}
644cb69f	425	}
036e1775	426	*dest = result;
644cb69f FXC	427	}
	428	/* Advance to the next element. */
	429	count[0]++;
	430	base += sstride[0];
	431	mbase += mstride[0];
	432	dest += dstride[0];
	433	n = 0;
	434	while (count[n] == extent[n])
80927a56 JJ	435	{
	436	/* When we get to the end of a dimension, reset it and increment
	437	the next dimension. */
	438	count[n] = 0;
	439	/* We could precalculate these products, but this is a less
	440	frequently used path so probably not worth it. */
	441	base -= sstride[n] * extent[n];
	442	mbase -= mstride[n] * extent[n];
	443	dest -= dstride[n] * extent[n];
	444	n++;
80dd631f	445	if (n >= rank)
80927a56	446	{
80dd631f	447	/* Break out of the loop. */
80927a56 JJ	448	base = NULL;
	449	break;
	450	}
	451	else
	452	{
	453	count[n]++;
	454	base += sstride[n];
	455	mbase += mstride[n];
	456	dest += dstride[n];
	457	}
	458	}
644cb69f FXC	459	}
	460	}
	461
97a62038 TK	462
	463	extern void sminloc1_16_r16 (gfc_array_i16 * const restrict,
	464	gfc_array_r16 * const restrict, const index_type * const restrict,
64b1806b	465	GFC_LOGICAL_4 *, GFC_LOGICAL_4 back);
97a62038 TK	466	export_proto(sminloc1_16_r16);
	467
	468	void
	469	sminloc1_16_r16 (gfc_array_i16 * const restrict retarray,
	470	gfc_array_r16 * const restrict array,
	471	const index_type * const restrict pdim,
64b1806b	472	GFC_LOGICAL_4 * mask, GFC_LOGICAL_4 back)
97a62038	473	{
802367d7 TK	474	index_type count[GFC_MAX_DIMENSIONS];
802367d7 TK	475	index_type extent[GFC_MAX_DIMENSIONS];
802367d7 TK	476	index_type dstride[GFC_MAX_DIMENSIONS];
802367d7 TK	477	GFC_INTEGER_16 * restrict dest;
97a62038 TK	478	index_type rank;
97a62038 TK	479	index_type n;
802367d7 TK	480	index_type dim;
802367d7 TK	481
97a62038 TK	482
	483	if (*mask)
	484	{
64b1806b TK	485	#ifdef HAVE_BACK_ARG
	486	minloc1_16_r16 (retarray, array, pdim, back);
	487	#else
97a62038	488	minloc1_16_r16 (retarray, array, pdim);
64b1806b	489	#endif
97a62038 TK	490	return;
97a62038 TK	491	}
802367d7 TK	492	/* Make dim zero based to avoid confusion. */
	493	dim = (*pdim) - 1;
	494	rank = GFC_DESCRIPTOR_RANK (array) - 1;
	495
cfdf6ff6 TK	496	if (unlikely (dim < 0 \|\| dim > rank))
	497	{
	498	runtime_error ("Dim argument incorrect in MINLOC intrinsic: "
	499	"is %ld, should be between 1 and %ld",
	500	(long int) dim + 1, (long int) rank + 1);
	501	}
	502
802367d7 TK	503	for (n = 0; n < dim; n++)
802367d7 TK	504	{
dfb55fdc	505	extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
802367d7 TK	506
	507	if (extent[n] <= 0)
	508	extent[n] = 0;
	509	}
	510
	511	for (n = dim; n < rank; n++)
	512	{
802367d7	513	extent[n] =
80927a56	514	GFC_DESCRIPTOR_EXTENT(array,n + 1);
802367d7 TK	515
802367d7 TK	516	if (extent[n] <= 0)
80927a56	517	extent[n] = 0;
802367d7	518	}
97a62038	519
21d1335b	520	if (retarray->base_addr == NULL)
97a62038	521	{
dfb55fdc	522	size_t alloc_size, str;
802367d7 TK	523
802367d7 TK	524	for (n = 0; n < rank; n++)
80927a56 JJ	525	{
	526	if (n == 0)
	527	str = 1;
	528	else
	529	str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
dfb55fdc TK	530
	531	GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
	532
80927a56	533	}
802367d7	534
97a62038	535	retarray->offset = 0;
ca708a2b	536	retarray->dtype.rank = rank;
802367d7	537
92e6f3a4	538	alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];
802367d7 TK	539
	540	if (alloc_size == 0)
	541	{
	542	/* Make sure we have a zero-sized array. */
dfb55fdc	543	GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
802367d7 TK	544	return;
	545	}
	546	else
92e6f3a4	547	retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_INTEGER_16));
97a62038 TK	548	}
	549	else
	550	{
802367d7 TK	551	if (rank != GFC_DESCRIPTOR_RANK (retarray))
	552	runtime_error ("rank of return array incorrect in"
	553	" MINLOC intrinsic: is %ld, should be %ld",
	554	(long int) (GFC_DESCRIPTOR_RANK (retarray)),
	555	(long int) rank);
	556
9731c4a3	557	if (unlikely (compile_options.bounds_check))
fd6590f8	558	{
802367d7 TK	559	for (n=0; n < rank; n++)
	560	{
	561	index_type ret_extent;
97a62038	562
dfb55fdc	563	ret_extent = GFC_DESCRIPTOR_EXTENT(retarray,n);
802367d7 TK	564	if (extent[n] != ret_extent)
	565	runtime_error ("Incorrect extent in return value of"
	566	" MINLOC intrinsic in dimension %ld:"
	567	" is %ld, should be %ld", (long int) n + 1,
	568	(long int) ret_extent, (long int) extent[n]);
	569	}
fd6590f8 TK	570	}
fd6590f8 TK	571	}
97a62038	572
802367d7 TK	573	for (n = 0; n < rank; n++)
	574	{
	575	count[n] = 0;
dfb55fdc	576	dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
802367d7 TK	577	}
802367d7 TK	578
21d1335b	579	dest = retarray->base_addr;
802367d7 TK	580
	581	while(1)
	582	{
	583	*dest = 0;
	584	count[0]++;
	585	dest += dstride[0];
	586	n = 0;
	587	while (count[n] == extent[n])
80927a56	588	{
802367d7	589	/* When we get to the end of a dimension, reset it and increment
80927a56 JJ	590	the next dimension. */
	591	count[n] = 0;
	592	/* We could precalculate these products, but this is a less
	593	frequently used path so probably not worth it. */
	594	dest -= dstride[n] * extent[n];
	595	n++;
80dd631f	596	if (n >= rank)
802367d7	597	return;
80927a56 JJ	598	else
	599	{
	600	count[n]++;
	601	dest += dstride[n];
	602	}
802367d7 TK	603	}
802367d7 TK	604	}
97a62038 TK	605	}
97a62038 TK	606
644cb69f	607	#endif