`/* Implementation of the CSHIFT intrinsic
- Copyright 2003, 2007, 2009 Free Software Foundation, Inc.
+ Copyright (C) 2003-2024 Free Software Foundation, Inc.
Contributed by Feng Wang <wf_cs@yahoo.com>
-This file is part of the GNU Fortran 95 runtime library (libgfortran).
+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
<http://www.gnu.org/licenses/>. */
#include "libgfortran.h"
-#include <stdlib.h>
-#include <assert.h>
#include <string.h>'
include(iparm.m4)dnl
'atype_name` sh;
index_type arraysize;
index_type size;
-
+ index_type type_size;
+
if (pwhich)
which = *pwhich - 1;
else
which = 0;
-
+
if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
runtime_error ("Argument ''`DIM''` is out of range in call to ''`CSHIFT''`");
arraysize = size0 ((array_t *)array);
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
- int i;
-
- ret->data = internal_malloc_size (size * arraysize);
+ ret->base_addr = xmallocarray (arraysize, size);
ret->offset = 0;
- ret->dtype = array->dtype;
- for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
+ GFC_DTYPE_COPY(ret,array);
+ for (index_type i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
{
index_type ub, str;
GFC_DIMENSION_SET(ret->dim[i], 0, ub, str);
}
}
+ else if (unlikely (compile_options.bounds_check))
+ {
+ bounds_equal_extents ((array_t *) ret, (array_t *) array,
+ "return value", "CSHIFT");
+ }
+
+ if (unlikely (compile_options.bounds_check))
+ {
+ bounds_reduced_extents ((array_t *) h, (array_t *) array, which,
+ "SHIFT argument", "CSHIFT");
+ }
if (arraysize == 0)
return;
+ /* See if we should dispatch to a helper function. */
+
+ type_size = GFC_DTYPE_TYPE_SIZE (array);
+
+ switch (type_size)
+ {
+ case GFC_DTYPE_LOGICAL_1:
+ case GFC_DTYPE_INTEGER_1:
+ cshift1_'atype_kind`_i1 ((gfc_array_i1 *)ret, (gfc_array_i1 *) array,
+ h, pwhich);
+ return;
+
+ case GFC_DTYPE_LOGICAL_2:
+ case GFC_DTYPE_INTEGER_2:
+ cshift1_'atype_kind`_i2 ((gfc_array_i2 *)ret, (gfc_array_i2 *) array,
+ h, pwhich);
+ return;
+
+ case GFC_DTYPE_LOGICAL_4:
+ case GFC_DTYPE_INTEGER_4:
+ cshift1_'atype_kind`_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array,
+ h, pwhich);
+ return;
+
+ case GFC_DTYPE_LOGICAL_8:
+ case GFC_DTYPE_INTEGER_8:
+ cshift1_'atype_kind`_i8 ((gfc_array_i8 *)ret, (gfc_array_i8 *) array,
+ h, pwhich);
+ return;
+
+#if defined (HAVE_INTEGER_16)
+ case GFC_DTYPE_LOGICAL_16:
+ case GFC_DTYPE_INTEGER_16:
+ cshift1_'atype_kind`_i16 ((gfc_array_i16 *)ret, (gfc_array_i16 *) array,
+ h, pwhich);
+ return;
+#endif
+
+ case GFC_DTYPE_REAL_4:
+ cshift1_'atype_kind`_r4 ((gfc_array_r4 *)ret, (gfc_array_r4 *) array,
+ h, pwhich);
+ return;
+
+ case GFC_DTYPE_REAL_8:
+ cshift1_'atype_kind`_r8 ((gfc_array_r8 *)ret, (gfc_array_r8 *) array,
+ h, pwhich);
+ return;
+
+#if defined (HAVE_REAL_10)
+ case GFC_DTYPE_REAL_10:
+ cshift1_'atype_kind`_r10 ((gfc_array_r10 *)ret, (gfc_array_r10 *) array,
+ h, pwhich);
+ return;
+#endif
+
+#if defined (HAVE_REAL_16)
+ case GFC_DTYPE_REAL_16:
+ cshift1_'atype_kind`_r16 ((gfc_array_r16 *)ret, (gfc_array_r16 *) array,
+ h, pwhich);
+ return;
+#endif
+
+ case GFC_DTYPE_COMPLEX_4:
+ cshift1_'atype_kind`_c4 ((gfc_array_c4 *)ret, (gfc_array_c4 *) array,
+ h, pwhich);
+ return;
+
+ case GFC_DTYPE_COMPLEX_8:
+ cshift1_'atype_kind`_c8 ((gfc_array_c8 *)ret, (gfc_array_c8 *) array,
+ h, pwhich);
+ return;
+
+#if defined (HAVE_COMPLEX_10)
+ case GFC_DTYPE_COMPLEX_10:
+ cshift1_'atype_kind`_c10 ((gfc_array_c10 *)ret, (gfc_array_c10 *) array,
+ h, pwhich);
+ return;
+#endif
+
+#if defined (HAVE_COMPLEX_16)
+ case GFC_DTYPE_COMPLEX_16:
+ cshift1_'atype_kind`_c16 ((gfc_array_c16 *)ret, (gfc_array_c16 *) array,
+ h, pwhich);
+ return;
+#endif
+
+ default:
+ break;
+
+ }
+
extent[0] = 1;
count[0] = 0;
n = 0;
rstride0 = rstride[0];
sstride0 = sstride[0];
hstride0 = hstride[0];
- rptr = ret->data;
- sptr = array->data;
- hptr = h->data;
+ rptr = ret->base_addr;
+ sptr = array->base_addr;
+ hptr = h->base_addr;
while (rptr)
{
/* Do the shift for this dimension. */
sh = *hptr;
- sh = (div (sh, len)).rem;
+ /* Normal case should be -len < sh < len; try to
+ avoid the expensive remainder operation if possible. */
if (sh < 0)
sh += len;
+ if (unlikely (sh >= len || sh < 0))
+ {
+ sh = sh % len;
+ if (sh < 0)
+ sh += len;
+ }
src = &sptr[sh * soffset];
dest = rptr;
-
- for (n = 0; n < len; n++)
+ if (soffset == size && roffset == size)
+ {
+ size_t len1 = sh * size;
+ size_t len2 = (len - sh) * size;
+ memcpy (rptr, sptr + len1, len2);
+ memcpy (rptr + len2, sptr, len1);
+ }
+ else
{
- memcpy (dest, src, size);
- dest += roffset;
- if (n == len - sh - 1)
- src = sptr;
- else
- src += soffset;
- }
+ for (n = 0; n < len - sh; n++)
+ {
+ memcpy (dest, src, size);
+ dest += roffset;
+ src += soffset;
+ }
+ for (src = sptr, n = 0; n < sh; n++)
+ {
+ memcpy (dest, src, size);
+ dest += roffset;
+ src += soffset;
+ }
+ }
/* Advance to the next section. */
rptr += rstride0;