cshift1_8.c 9.8 KB
Newer Older
1
/* Implementation of the CSHIFT intrinsic
2
   Copyright (C) 2003-2018 Free Software Foundation, Inc.
3 4
   Contributed by Feng Wang <wf_cs@yahoo.com>

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

Ligbfortran is distributed in the hope that it will be useful,
13 14
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15
GNU General Public License for more details.
16

17 18 19 20 21 22 23 24
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/>.  */
25

26
#include "libgfortran.h"
27
#include <string.h>
28

29

30 31
#if defined (HAVE_GFC_INTEGER_8)

32
static void
Janne Blomqvist committed
33 34 35
cshift1 (gfc_array_char * const restrict ret, 
	const gfc_array_char * const restrict array,
	const gfc_array_i8 * const restrict h, 
36
	const GFC_INTEGER_8 * const restrict pwhich)
37 38
{
  /* r.* indicates the return array.  */
39
  index_type rstride[GFC_MAX_DIMENSIONS];
40 41 42 43 44
  index_type rstride0;
  index_type roffset;
  char *rptr;
  char *dest;
  /* s.* indicates the source array.  */
45
  index_type sstride[GFC_MAX_DIMENSIONS];
46 47 48 49
  index_type sstride0;
  index_type soffset;
  const char *sptr;
  const char *src;
50
  /* h.* indicates the shift array.  */
51
  index_type hstride[GFC_MAX_DIMENSIONS];
52 53 54
  index_type hstride0;
  const GFC_INTEGER_8 *hptr;

55 56
  index_type count[GFC_MAX_DIMENSIONS];
  index_type extent[GFC_MAX_DIMENSIONS];
57 58 59 60 61
  index_type dim;
  index_type len;
  index_type n;
  int which;
  GFC_INTEGER_8 sh;
62
  index_type arraysize;
63
  index_type size;
64 65
  index_type type_size;
  
66 67 68 69
  if (pwhich)
    which = *pwhich - 1;
  else
    which = 0;
70
 
71 72 73
  if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
    runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");

74 75
  size = GFC_DESCRIPTOR_SIZE(array);

76 77
  arraysize = size0 ((array_t *)array);

78
  if (ret->base_addr == NULL)
Thomas Koenig committed
79
    {
80
      ret->base_addr = xmallocarray (arraysize, size);
81
      ret->offset = 0;
82
      GFC_DTYPE_COPY(ret,array);
83
      for (index_type i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
Thomas Koenig committed
84
        {
85 86 87
	  index_type ub, str;

          ub = GFC_DESCRIPTOR_EXTENT(array,i) - 1;
Thomas Koenig committed
88 89

          if (i == 0)
90
            str = 1;
Thomas Koenig committed
91
          else
92 93 94 95
	    str = GFC_DESCRIPTOR_EXTENT(ret,i-1) *
	      GFC_DESCRIPTOR_STRIDE(ret,i-1);

	  GFC_DIMENSION_SET(ret->dim[i], 0, ub, str);
Thomas Koenig committed
96 97
        }
    }
Thomas Koenig committed
98 99 100 101 102 103 104 105 106 107 108
  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");
    }
Thomas Koenig committed
109

110 111 112
  if (arraysize == 0)
    return;

113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
  /* 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_8_i1 ((gfc_array_i1 *)ret, (gfc_array_i1 *) array,
      			h, pwhich);
      return;
 
    case GFC_DTYPE_LOGICAL_2:
    case GFC_DTYPE_INTEGER_2:
      cshift1_8_i2 ((gfc_array_i2 *)ret, (gfc_array_i2 *) array,
      			h, pwhich);
      return;
 
    case GFC_DTYPE_LOGICAL_4:
    case GFC_DTYPE_INTEGER_4:
      cshift1_8_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array,
      			h, pwhich);
      return;

    case GFC_DTYPE_LOGICAL_8:
    case GFC_DTYPE_INTEGER_8:
      cshift1_8_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_8_i16 ((gfc_array_i16 *)ret, (gfc_array_i16 *) array,
      			h, pwhich);
      return;
#endif

    case GFC_DTYPE_REAL_4:
      cshift1_8_r4 ((gfc_array_r4 *)ret, (gfc_array_r4 *) array,
      			h, pwhich);
      return;

    case GFC_DTYPE_REAL_8:
      cshift1_8_r8 ((gfc_array_r8 *)ret, (gfc_array_r8 *) array,
      			h, pwhich);
      return;

#if defined (HAVE_REAL_10)
    case GFC_DTYPE_REAL_10:
      cshift1_8_r10 ((gfc_array_r10 *)ret, (gfc_array_r10 *) array,
      			h, pwhich);
      return;
#endif

#if defined (HAVE_REAL_16)
    case GFC_DTYPE_REAL_16:
      cshift1_8_r16 ((gfc_array_r16 *)ret, (gfc_array_r16 *) array,
      			h, pwhich);
      return;
#endif

    case GFC_DTYPE_COMPLEX_4:
      cshift1_8_c4 ((gfc_array_c4 *)ret, (gfc_array_c4 *) array,
      			h, pwhich);
      return;

    case GFC_DTYPE_COMPLEX_8:
      cshift1_8_c8 ((gfc_array_c8 *)ret, (gfc_array_c8 *) array,
      			h, pwhich);
      return;

#if defined (HAVE_COMPLEX_10)
    case GFC_DTYPE_COMPLEX_10:
      cshift1_8_c10 ((gfc_array_c10 *)ret, (gfc_array_c10 *) array,
      			h, pwhich);
      return;
#endif

#if defined (HAVE_COMPLEX_16)
    case GFC_DTYPE_COMPLEX_16:
      cshift1_8_c16 ((gfc_array_c16 *)ret, (gfc_array_c16 *) array,
      			h, pwhich);
      return;
#endif

    default:
      break;
    
  }
  
204 205 206 207
  extent[0] = 1;
  count[0] = 0;
  n = 0;

208
  /* Initialized for avoiding compiler warnings.  */
209 210 211 212 213 214 215 216
  roffset = size;
  soffset = size;
  len = 0;

  for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
    {
      if (dim == which)
        {
217
          roffset = GFC_DESCRIPTOR_STRIDE_BYTES(ret,dim);
218 219
          if (roffset == 0)
            roffset = size;
220
          soffset = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
221 222
          if (soffset == 0)
            soffset = size;
223
          len = GFC_DESCRIPTOR_EXTENT(array,dim);
224 225 226 227
        }
      else
        {
          count[n] = 0;
228 229 230
          extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
          rstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(ret,dim);
          sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
231

232
          hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
233 234 235 236 237 238 239 240 241 242 243 244 245 246
          n++;
        }
    }
  if (sstride[0] == 0)
    sstride[0] = size;
  if (rstride[0] == 0)
    rstride[0] = size;
  if (hstride[0] == 0)
    hstride[0] = 1;

  dim = GFC_DESCRIPTOR_RANK (array);
  rstride0 = rstride[0];
  sstride0 = sstride[0];
  hstride0 = hstride[0];
247 248 249
  rptr = ret->base_addr;
  sptr = array->base_addr;
  hptr = h->base_addr;
250 251 252

  while (rptr)
    {
253
      /* Do the shift for this dimension.  */
254
      sh = *hptr;
255 256
      /* Normal case should be -len < sh < len; try to
         avoid the expensive remainder operation if possible.  */
257 258
      if (sh < 0)
        sh += len;
259 260 261 262 263 264
      if (unlikely (sh >= len || sh < 0))
        {
	  sh = sh % len;
	  if (sh < 0)
	    sh += len;
	}
265 266 267

      src = &sptr[sh * soffset];
      dest = rptr;
268 269 270 271 272 273 274 275
      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
276
        {
277 278 279 280 281 282 283 284 285 286 287 288 289
	  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;
	      }
	  }
290 291 292 293 294 295 296 297 298 299 300 301 302

      /* Advance to the next section.  */
      rptr += rstride0;
      sptr += sstride0;
      hptr += hstride0;
      count[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
303
             frequently used path so probably not worth it.  */
304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
          rptr -= rstride[n] * extent[n];
          sptr -= sstride[n] * extent[n];
	  hptr -= hstride[n] * extent[n];
          n++;
          if (n >= dim - 1)
            {
              /* Break out of the loop.  */
              rptr = NULL;
              break;
            }
          else
            {
              count[n]++;
              rptr += rstride[n];
              sptr += sstride[n];
	      hptr += hstride[n];
            }
        }
    }
}
324

Janne Blomqvist committed
325 326 327 328
void cshift1_8 (gfc_array_char * const restrict, 
	const gfc_array_char * const restrict,
	const gfc_array_i8 * const restrict, 
	const GFC_INTEGER_8 * const restrict);
329 330 331
export_proto(cshift1_8);

void
Janne Blomqvist committed
332 333 334 335
cshift1_8 (gfc_array_char * const restrict ret,
	const gfc_array_char * const restrict array,
	const gfc_array_i8 * const restrict h, 
	const GFC_INTEGER_8 * const restrict pwhich)
336
{
337
  cshift1 (ret, array, h, pwhich);
338 339
}

340

Janne Blomqvist committed
341 342 343 344 345 346
void cshift1_8_char (gfc_array_char * const restrict ret, 
	GFC_INTEGER_4,
	const gfc_array_char * const restrict array,
	const gfc_array_i8 * const restrict h, 
	const GFC_INTEGER_8 * const restrict pwhich,
	GFC_INTEGER_4);
347 348 349
export_proto(cshift1_8_char);

void
Janne Blomqvist committed
350 351 352 353 354
cshift1_8_char (gfc_array_char * const restrict ret,
	GFC_INTEGER_4 ret_length __attribute__((unused)),
	const gfc_array_char * const restrict array,
	const gfc_array_i8 * const restrict h, 
	const GFC_INTEGER_8 * const restrict pwhich,
355
	GFC_INTEGER_4 array_length __attribute__((unused)))
356
{
357
  cshift1 (ret, array, h, pwhich);
358
}
359

360 361 362 363 364 365 366 367 368 369 370 371 372 373 374

void cshift1_8_char4 (gfc_array_char * const restrict ret, 
	GFC_INTEGER_4,
	const gfc_array_char * const restrict array,
	const gfc_array_i8 * const restrict h, 
	const GFC_INTEGER_8 * const restrict pwhich,
	GFC_INTEGER_4);
export_proto(cshift1_8_char4);

void
cshift1_8_char4 (gfc_array_char * const restrict ret,
	GFC_INTEGER_4 ret_length __attribute__((unused)),
	const gfc_array_char * const restrict array,
	const gfc_array_i8 * const restrict h, 
	const GFC_INTEGER_8 * const restrict pwhich,
375
	GFC_INTEGER_4 array_length __attribute__((unused)))
376
{
377
  cshift1 (ret, array, h, pwhich);
378 379
}

380
#endif