OpenCores
URL https://opencores.org/ocsvn/scarts/scarts/trunk

Subversion Repositories scarts

[/] [scarts/] [trunk/] [toolchain/] [scarts-gcc/] [gcc-4.1.1/] [libgfortran/] [m4/] [cshift1.m4] - Blame information for rev 14

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 14 jlechner
`/* Implementation of the CSHIFT intrinsic
2
   Copyright 2003 Free Software Foundation, Inc.
3
   Contributed by Feng Wang <wf_cs@yahoo.com>
4
 
5
This file is part of the GNU Fortran 95 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 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.)
20
 
21
Ligbfortran 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
24
GNU General Public License for more details.
25
 
26
You should have received a copy of the GNU General Public
27
License along with libgfortran; see the file COPYING.  If not,
28
write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
29
Boston, MA 02110-1301, USA.  */
30
 
31
#include "config.h"
32
#include <stdlib.h>
33
#include <assert.h>
34
#include <string.h>
35
#include "libgfortran.h"'
36
include(iparm.m4)dnl
37
 
38
`#if defined (HAVE_'atype_name`)'
39
 
40
static void
41
cshift1 (gfc_array_char * ret, const gfc_array_char * array,
42
         const atype * h, const atype_name * pwhich, index_type size)
43
{
44
  /* r.* indicates the return array.  */
45
  index_type rstride[GFC_MAX_DIMENSIONS];
46
  index_type rstride0;
47
  index_type roffset;
48
  char *rptr;
49
  char *dest;
50
  /* s.* indicates the source array.  */
51
  index_type sstride[GFC_MAX_DIMENSIONS];
52
  index_type sstride0;
53
  index_type soffset;
54
  const char *sptr;
55
  const char *src;
56
  /* h.* indicates the shift array.  */
57
  index_type hstride[GFC_MAX_DIMENSIONS];
58
  index_type hstride0;
59
  const atype_name *hptr;
60
 
61
  index_type count[GFC_MAX_DIMENSIONS];
62
  index_type extent[GFC_MAX_DIMENSIONS];
63
  index_type dim;
64
  index_type len;
65
  index_type n;
66
  int which;
67
  atype_name sh;
68
 
69
  if (pwhich)
70
    which = *pwhich - 1;
71
  else
72
    which = 0;
73
 
74
  if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
75
    runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
76
 
77
  if (ret->data == NULL)
78
    {
79
      int i;
80
 
81
      ret->data = internal_malloc_size (size * size0 ((array_t *)array));
82
      ret->offset = 0;
83
      ret->dtype = array->dtype;
84
      for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
85
        {
86
          ret->dim[i].lbound = 0;
87
          ret->dim[i].ubound = array->dim[i].ubound - array->dim[i].lbound;
88
 
89
          if (i == 0)
90
            ret->dim[i].stride = 1;
91
          else
92
            ret->dim[i].stride = (ret->dim[i-1].ubound + 1) * ret->dim[i-1].stride;
93
        }
94
    }
95
 
96
  extent[0] = 1;
97
  count[0] = 0;
98
  n = 0;
99
 
100
  /* Initialized for avoiding compiler warnings.  */
101
  roffset = size;
102
  soffset = size;
103
  len = 0;
104
 
105
  for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
106
    {
107
      if (dim == which)
108
        {
109
          roffset = ret->dim[dim].stride * size;
110
          if (roffset == 0)
111
            roffset = size;
112
          soffset = array->dim[dim].stride * size;
113
          if (soffset == 0)
114
            soffset = size;
115
          len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
116
        }
117
      else
118
        {
119
          count[n] = 0;
120
          extent[n] = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
121
          rstride[n] = ret->dim[dim].stride * size;
122
          sstride[n] = array->dim[dim].stride * size;
123
 
124
          hstride[n] = h->dim[n].stride;
125
          n++;
126
        }
127
    }
128
  if (sstride[0] == 0)
129
    sstride[0] = size;
130
  if (rstride[0] == 0)
131
    rstride[0] = size;
132
  if (hstride[0] == 0)
133
    hstride[0] = 1;
134
 
135
  dim = GFC_DESCRIPTOR_RANK (array);
136
  rstride0 = rstride[0];
137
  sstride0 = sstride[0];
138
  hstride0 = hstride[0];
139
  rptr = ret->data;
140
  sptr = array->data;
141
  hptr = h->data;
142
 
143
  while (rptr)
144
    {
145
      /* Do the shift for this dimension.  */
146
      sh = *hptr;
147
      sh = (div (sh, len)).rem;
148
      if (sh < 0)
149
        sh += len;
150
 
151
      src = &sptr[sh * soffset];
152
      dest = rptr;
153
 
154
      for (n = 0; n < len; n++)
155
        {
156
          memcpy (dest, src, size);
157
          dest += roffset;
158
          if (n == len - sh - 1)
159
            src = sptr;
160
          else
161
            src += soffset;
162
        }
163
 
164
      /* Advance to the next section.  */
165
      rptr += rstride0;
166
      sptr += sstride0;
167
      hptr += hstride0;
168
      count[0]++;
169
      n = 0;
170
      while (count[n] == extent[n])
171
        {
172
          /* When we get to the end of a dimension, reset it and increment
173
             the next dimension.  */
174
          count[n] = 0;
175
          /* We could precalculate these products, but this is a less
176
             frequently used path so proabably not worth it.  */
177
          rptr -= rstride[n] * extent[n];
178
          sptr -= sstride[n] * extent[n];
179
          hptr -= hstride[n] * extent[n];
180
          n++;
181
          if (n >= dim - 1)
182
            {
183
              /* Break out of the loop.  */
184
              rptr = NULL;
185
              break;
186
            }
187
          else
188
            {
189
              count[n]++;
190
              rptr += rstride[n];
191
              sptr += sstride[n];
192
              hptr += hstride[n];
193
            }
194
        }
195
    }
196
}
197
 
198
void cshift1_`'atype_kind (gfc_array_char *, const gfc_array_char *,
199
                           const atype *, const atype_name *);
200
export_proto(cshift1_`'atype_kind);
201
 
202
void
203
cshift1_`'atype_kind (gfc_array_char * ret,
204
                      const gfc_array_char * array,
205
                      const atype * h, const atype_name * pwhich)
206
{
207
  cshift1 (ret, array, h, pwhich, GFC_DESCRIPTOR_SIZE (array));
208
}
209
 
210
void cshift1_`'atype_kind`'_char (gfc_array_char * ret, GFC_INTEGER_4,
211
                                  const gfc_array_char * array,
212
                                  const atype * h, const atype_name * pwhich,
213
                                  GFC_INTEGER_4);
214
export_proto(cshift1_`'atype_kind`'_char);
215
 
216
void
217
cshift1_`'atype_kind`'_char (gfc_array_char * ret,
218
                             GFC_INTEGER_4 ret_length __attribute__((unused)),
219
                             const gfc_array_char * array,
220
                             const atype * h, const atype_name * pwhich,
221
                             GFC_INTEGER_4 array_length)
222
{
223
  cshift1 (ret, array, h, pwhich, array_length);
224
}
225
 
226
#endif

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.