]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/generated/eoshift3_8.c
7e9b911b1a6b8f8ebb7a152bda30fae514b4f586
1 /* Implementation of the EOSHIFT intrinsic
2 Copyright 2002, 2005 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 95 runtime library (libgfortran).
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.
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
21 Libgfortran 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.
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., 59 Temple Place - Suite 330,
29 Boston, MA 02111-1307, USA. */
35 #include "libgfortran.h"
37 static const char zeros
[16] =
38 {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
40 extern void eoshift3_8 (gfc_array_char
*, gfc_array_char
*,
41 gfc_array_i8
*, const gfc_array_char
*,
43 export_proto(eoshift3_8
);
46 eoshift3_8 (gfc_array_char
*ret
, gfc_array_char
*array
,
47 gfc_array_i8
*h
, const gfc_array_char
*bound
,
48 GFC_INTEGER_8
*pwhich
)
50 /* r.* indicates the return array. */
51 index_type rstride
[GFC_MAX_DIMENSIONS
];
56 /* s.* indicates the source array. */
57 index_type sstride
[GFC_MAX_DIMENSIONS
];
62 /* h.* indicates the shift array. */
63 index_type hstride
[GFC_MAX_DIMENSIONS
];
65 const GFC_INTEGER_8
*hptr
;
66 /* b.* indicates the bound array. */
67 index_type bstride
[GFC_MAX_DIMENSIONS
];
71 index_type count
[GFC_MAX_DIMENSIONS
];
72 index_type extent
[GFC_MAX_DIMENSIONS
];
81 /* The compiler cannot figure out that these are set, initialize
82 them to avoid warnings. */
92 size
= GFC_DESCRIPTOR_SIZE (ret
);
93 if (ret
->data
== NULL
)
97 ret
->data
= internal_malloc_size (size
* size0 ((array_t
*)array
));
99 ret
->dtype
= array
->dtype
;
100 for (i
= 0; i
< GFC_DESCRIPTOR_RANK (array
); i
++)
102 ret
->dim
[i
].lbound
= 0;
103 ret
->dim
[i
].ubound
= array
->dim
[i
].ubound
- array
->dim
[i
].lbound
;
106 ret
->dim
[i
].stride
= 1;
108 ret
->dim
[i
].stride
= (ret
->dim
[i
-1].ubound
+ 1) * ret
->dim
[i
-1].stride
;
115 size
= GFC_DESCRIPTOR_SIZE (array
);
117 for (dim
= 0; dim
< GFC_DESCRIPTOR_RANK (array
); dim
++)
121 roffset
= ret
->dim
[dim
].stride
* size
;
124 soffset
= array
->dim
[dim
].stride
* size
;
127 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
132 extent
[n
] = array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
133 rstride
[n
] = ret
->dim
[dim
].stride
* size
;
134 sstride
[n
] = array
->dim
[dim
].stride
* size
;
136 hstride
[n
] = h
->dim
[n
].stride
;
138 bstride
[n
] = bound
->dim
[n
].stride
* size
;
150 if (bound
&& bstride
[0] == 0)
153 dim
= GFC_DESCRIPTOR_RANK (array
);
154 rstride0
= rstride
[0];
155 sstride0
= sstride
[0];
156 hstride0
= hstride
[0];
157 bstride0
= bstride
[0];
168 /* Do the shift for this dimension. */
170 delta
= (sh
>= 0) ? sh
: -sh
;
173 src
= &sptr
[delta
* soffset
];
179 dest
= &rptr
[delta
* roffset
];
181 for (n
= 0; n
< len
- delta
; n
++)
183 memcpy (dest
, src
, size
);
193 memcpy (dest
, bptr
, size
);
197 /* Advance to the next section. */
204 while (count
[n
] == extent
[n
])
206 /* When we get to the end of a dimension, reset it and increment
207 the next dimension. */
209 /* We could precalculate these products, but this is a less
210 frequently used path so proabably not worth it. */
211 rptr
-= rstride
[n
] * extent
[n
];
212 sptr
-= sstride
[n
] * extent
[n
];
213 hptr
-= hstride
[n
] * extent
[n
];
214 bptr
-= bstride
[n
] * extent
[n
];
218 /* Break out of the loop. */