]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/generated/eoshift1_8.c
379cb4a1b50acb59ed4d7a3d67b9c3c2cd77ce54
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 eoshift1_8 (gfc_array_char
*,
41 const gfc_array_char
*,
42 const gfc_array_i8
*, const char *,
43 const GFC_INTEGER_8
*);
44 export_proto(eoshift1_8
);
47 eoshift1_8 (gfc_array_char
*ret
,
48 const gfc_array_char
*array
,
49 const gfc_array_i8
*h
, const char *pbound
,
50 const GFC_INTEGER_8
*pwhich
)
52 /* r.* indicates the return array. */
53 index_type rstride
[GFC_MAX_DIMENSIONS
];
58 /* s.* indicates the source array. */
59 index_type sstride
[GFC_MAX_DIMENSIONS
];
64 /* h.* indicates the shift array. */
65 index_type hstride
[GFC_MAX_DIMENSIONS
];
67 const GFC_INTEGER_8
*hptr
;
69 index_type count
[GFC_MAX_DIMENSIONS
];
70 index_type extent
[GFC_MAX_DIMENSIONS
];
79 /* The compiler cannot figure out that these are set, initialize
80 them to avoid warnings. */
93 size
= GFC_DESCRIPTOR_SIZE (ret
);
97 size
= GFC_DESCRIPTOR_SIZE (array
);
99 if (ret
->data
== NULL
)
103 ret
->data
= internal_malloc_size (size
* size0 ((array_t
*)array
));
105 ret
->dtype
= array
->dtype
;
106 for (i
= 0; i
< GFC_DESCRIPTOR_RANK (array
); i
++)
108 ret
->dim
[i
].lbound
= 0;
109 ret
->dim
[i
].ubound
= array
->dim
[i
].ubound
- array
->dim
[i
].lbound
;
112 ret
->dim
[i
].stride
= 1;
114 ret
->dim
[i
].stride
= (ret
->dim
[i
-1].ubound
+ 1) * ret
->dim
[i
-1].stride
;
119 for (dim
= 0; dim
< GFC_DESCRIPTOR_RANK (array
); dim
++)
123 roffset
= ret
->dim
[dim
].stride
* size
;
126 soffset
= array
->dim
[dim
].stride
* size
;
129 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
134 extent
[n
] = array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
135 rstride
[n
] = ret
->dim
[dim
].stride
* size
;
136 sstride
[n
] = array
->dim
[dim
].stride
* size
;
138 hstride
[n
] = h
->dim
[n
].stride
* size
;
149 dim
= GFC_DESCRIPTOR_RANK (array
);
150 rstride0
= rstride
[0];
151 sstride0
= sstride
[0];
152 hstride0
= hstride
[0];
159 /* Do the shift for this dimension. */
161 delta
= (sh
>= 0) ? sh
: -sh
;
164 src
= &sptr
[delta
* soffset
];
170 dest
= &rptr
[delta
* roffset
];
172 for (n
= 0; n
< len
- delta
; n
++)
174 memcpy (dest
, src
, size
);
184 memcpy (dest
, pbound
, size
);
188 /* Advance to the next section. */
194 while (count
[n
] == extent
[n
])
196 /* When we get to the end of a dimension, reset it and increment
197 the next dimension. */
199 /* We could precalculate these products, but this is a less
200 frequently used path so proabably not worth it. */
201 rptr
-= rstride
[n
] * extent
[n
];
202 sptr
-= sstride
[n
] * extent
[n
];
203 hptr
-= hstride
[n
] * extent
[n
];
207 /* Break out of the loop. */