1 /* Helper function for cshift functions.
2 Copyright (C) 2008-2013 Free Software Foundation, Inc.
3 Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
5 This file is part of the GNU Fortran 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 3 of the License, or (at your option) any later version.
12 Libgfortran 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 General Public License for more details.
17 Under Section 7 of GPL version 3, you are granted additional
18 permissions described in the GCC Runtime Library Exception, version
19 3.1, as published by the Free Software Foundation.
21 You should have received a copy of the GNU General Public License and
22 a copy of the GCC Runtime Library Exception along with this program;
23 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 <http://www.gnu.org/licenses/>. */
26 #include "libgfortran.h"
32 #if defined (HAVE_GFC_INTEGER_1)
35 cshift0_i1 (gfc_array_i1
*ret
, const gfc_array_i1
*array
, ptrdiff_t shift
,
38 /* r.* indicates the return array. */
39 index_type rstride
[GFC_MAX_DIMENSIONS
];
44 /* s.* indicates the source array. */
45 index_type sstride
[GFC_MAX_DIMENSIONS
];
48 const GFC_INTEGER_1
*sptr
;
50 index_type count
[GFC_MAX_DIMENSIONS
];
51 index_type extent
[GFC_MAX_DIMENSIONS
];
63 /* Initialized for avoiding compiler warnings. */
68 for (dim
= 0; dim
< GFC_DESCRIPTOR_RANK (array
); dim
++)
72 roffset
= GFC_DESCRIPTOR_STRIDE(ret
,dim
);
75 soffset
= GFC_DESCRIPTOR_STRIDE(array
,dim
);
78 len
= GFC_DESCRIPTOR_EXTENT(array
,dim
);
83 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,dim
);
84 rstride
[n
] = GFC_DESCRIPTOR_STRIDE(ret
,dim
);
85 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
,dim
);
94 dim
= GFC_DESCRIPTOR_RANK (array
);
95 rstride0
= rstride
[0];
96 sstride0
= sstride
[0];
97 rptr
= ret
->base_addr
;
98 sptr
= array
->base_addr
;
100 /* Avoid the costly modulo for trivially in-bound shifts. */
101 if (shift
< 0 || shift
>= len
)
103 shift
= len
== 0 ? 0 : shift
% (ptrdiff_t)len
;
110 /* Do the shift for this dimension. */
112 /* If elements are contiguous, perform the operation
113 in two block moves. */
114 if (soffset
== 1 && roffset
== 1)
116 size_t len1
= shift
* sizeof (GFC_INTEGER_1
);
117 size_t len2
= (len
- shift
) * sizeof (GFC_INTEGER_1
);
118 memcpy (rptr
, sptr
+ shift
, len2
);
119 memcpy (rptr
+ (len
- shift
), sptr
, len1
);
123 /* Otherwise, we will have to perform the copy one element at
125 GFC_INTEGER_1
*dest
= rptr
;
126 const GFC_INTEGER_1
*src
= &sptr
[shift
* soffset
];
128 for (n
= 0; n
< len
- shift
; n
++)
134 for (src
= sptr
, n
= 0; n
< shift
; n
++)
142 /* Advance to the next section. */
147 while (count
[n
] == extent
[n
])
149 /* When we get to the end of a dimension, reset it and increment
150 the next dimension. */
152 /* We could precalculate these products, but this is a less
153 frequently used path so probably not worth it. */
154 rptr
-= rstride
[n
] * extent
[n
];
155 sptr
-= sstride
[n
] * extent
[n
];
159 /* Break out of the loop. */