1 /* Generic implementation of the EOSHIFT intrinsic
2 Copyright 2002 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 95 runtime library (libgfor).
7 Libgfor is free software; you can redistribute it and/or
8 modify it under the terms of the GNU Lesser General Public
9 License as published by the Free Software Foundation; either
10 version 2.1 of the License, or (at your option) any later version.
12 Ligbfor 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 Lesser General Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with libgfor; see the file COPYING.LIB. If not,
19 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
26 #include "libgfortran.h"
28 static const char zeros
[16] =
29 {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
31 /* TODO: make this work for large shifts when
32 sizeof(int) < sizeof (index_type). */
35 __eoshift0 (gfc_array_char
* ret
, const gfc_array_char
* array
,
36 int shift
, const char * pbound
, int which
)
38 /* r.* indicates the return array. */
39 index_type rstride
[GFC_MAX_DIMENSIONS
- 1];
44 /* s.* indicates the source array. */
45 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
51 index_type count
[GFC_MAX_DIMENSIONS
- 1];
52 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
61 size
= GFC_DESCRIPTOR_SIZE (ret
);
63 if (ret
->data
== NULL
)
67 ret
->data
= internal_malloc (size
* size0 ((array_t
*)array
));
69 ret
->dtype
= array
->dtype
;
70 for (i
= 0; i
< GFC_DESCRIPTOR_RANK (array
); i
++)
72 ret
->dim
[i
].lbound
= 0;
73 ret
->dim
[i
].ubound
= array
->dim
[i
].ubound
- array
->dim
[i
].lbound
;
76 ret
->dim
[i
].stride
= 1;
78 ret
->dim
[i
].stride
= (ret
->dim
[i
-1].ubound
+ 1) * ret
->dim
[i
-1].stride
;
86 size
= GFC_DESCRIPTOR_SIZE (array
);
88 for (dim
= 0; dim
< GFC_DESCRIPTOR_RANK (array
); dim
++)
92 roffset
= ret
->dim
[dim
].stride
* size
;
95 soffset
= array
->dim
[dim
].stride
* size
;
98 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
103 extent
[n
] = array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
104 rstride
[n
] = ret
->dim
[dim
].stride
* size
;
105 sstride
[n
] = array
->dim
[dim
].stride
* size
;
114 dim
= GFC_DESCRIPTOR_RANK (array
);
115 rstride0
= rstride
[0];
116 sstride0
= sstride
[0];
126 /* Do the shift for this dimension. */
129 src
= &sptr
[shift
* soffset
];
135 dest
= &rptr
[-shift
* roffset
];
137 for (n
= 0; n
< len
; n
++)
139 memcpy (dest
, src
, size
);
155 memcpy (dest
, pbound
, size
);
159 /* Advance to the next section. */
164 while (count
[n
] == extent
[n
])
166 /* When we get to the end of a dimension, reset it and increment
167 the next dimension. */
169 /* We could precalculate these products, but this is a less
170 frequently used path so proabably not worth it. */
171 rptr
-= rstride
[n
] * extent
[n
];
172 sptr
-= sstride
[n
] * extent
[n
];
176 /* Break out of the loop. */
192 __eoshift0_4 (gfc_array_char
* ret
, const gfc_array_char
* array
,
193 const GFC_INTEGER_4
* pshift
, const char * pbound
,
194 const GFC_INTEGER_4
* pdim
)
196 __eoshift0 (ret
, array
, *pshift
, pbound
, pdim
? *pdim
: 1);
201 __eoshift0_8 (gfc_array_char
* ret
, const gfc_array_char
* array
,
202 const GFC_INTEGER_8
* pshift
, const char * pbound
,
203 const GFC_INTEGER_8
* pdim
)
205 __eoshift0 (ret
, array
, *pshift
, pbound
, pdim
? *pdim
: 1);